[ { "path": ".cargo/config.toml", "content": "# TODO: track https://github.com/rust-lang/rust/issues/141626 for a resolution\n[target.x86_64-pc-windows-msvc]\nrustflags = ['-Csymbol-mangling-version=v0']\n\n[env]\nMIRIFLAGS = \"-Zmiri-tree-borrows\"\n" }, { "path": ".config/nextest.toml", "content": "[profile.ci]\n# Don't fail fast in CI to run the full test suite.\nfail-fast = false\n" }, { "path": ".editorconfig", "content": "root = true\n\n[*]\nend_of_line = lf\ncharset = utf-8\ntrim_trailing_whitespace = true\ninsert_final_newline = true\nindent_size = 4\nindent_style = space\n\n[{Makefile,**.mk}]\n# Use tabs for indentation (Makefiles require tabs)\nindent_style = tab\n\n[{*.js,*.json,*.mjs}]\nindent_size = 2\n\n[*.md]\nindent_size = 2\n\n[flake.lock]\n#\n" }, { "path": ".gitattributes", "content": "# Handle line endings automatically for files detected as text\n# and leave all files detected as binary untouched.\n* text=auto\n\n#\n# The above will handle all files NOT found below\n#\n# These files are text and should be normalized (Convert crlf => lf)\n*.css eol=lf\n*.htm eol=lf\n*.html eol=lf\n*.js eol=lf\n*.json eol=lf\n*.sh eol=lf\n*.txt eol=lf\n*.yml eol=lf\n*.rs eol=lf\n*.toml eol=lf\n*.lock eol=lf\n*.md eol=lf\n*.svg eol=lf\n\n# These files are binary and should be left untouched\n# (binary is a macro for -text -diff)\n*.gif binary\n*.ico binary\n*.jar binary\n*.jpg binary\n*.jpeg binary\n*.png binary\n" }, { "path": ".github/FUNDING.yml", "content": "open_collective: boa\n" }, { "path": ".github/ISSUE_TEMPLATE/bug_report.md", "content": "---\nname: \"\\U0001F41B Bug report\"\nabout: Create a report to help us improve\ntitle: \"\"\ntype: \"Bug\"\nassignees: \"\"\n---\n\n\n\n**Describe the bug**\nA clear and concise description of what the bug is.\n\n\n\n**To Reproduce**\nSteps to reproduce the issue, or JavaScript code that causes this failure.\n\n\n\n**Expected behavior**\nExplain what you expected to happen, and what is happening instead.\n\n\n\n**Build environment (please complete the following information):**\n\n- OS: [e.g. Fedora Linux]\n- Version: [e.g. 32]\n- Target triple: [e.g. x86_64-unknown-linux-gnu]\n- Rustc version: [e.g. rustc 1.43.0 (4fb7144ed 2020-04-20), running `rustc -V`]\n\n**Additional context**\nAdd any other context about the problem here.\n\n\n" }, { "path": ".github/ISSUE_TEMPLATE/config.yml", "content": "blank_issues_enabled: false\ncontact_links:\n - name: Matrix space\n url: https://matrix.to/#/#boa:matrix.org\n about: Please ask and answer questions here.\n" }, { "path": ".github/ISSUE_TEMPLATE/custom.md", "content": "---\nname: Custom\nabout: Open an issue in the repo that is neither a bug or a feature.\ntitle: \"\"\nlabels: \"\"\ntype: \"\"\nassignees: \"\"\n---\n\n\n\nE.g.: I think we should improve the way the JavaScript interpreter works by...\n" }, { "path": ".github/ISSUE_TEMPLATE/feature_request.md", "content": "---\nname: \"\\U0001F680 Feature request\"\nabout: Suggest a new ECMAScript feature to be implemented, or a new capability of the engine.\ntitle: \"\"\ntype: \"Feature\"\nlabels: \"\"\nassignees: \"\"\n---\n\n\n\n**ECMASCript feature**\nExplain the ECMAScript feature that you'd like to see implemented.\n\n\n\n**Example code**\nGive a code example that should work after the implementation of this feature.\n\n\n" }, { "path": ".github/PULL_REQUEST_TEMPLATE.md", "content": "\n\nThis Pull Request fixes/closes #{issue_num}.\n\nIt changes the following:\n\n-\n-\n-\n" }, { "path": ".github/codecov.yml", "content": "github_checks:\n annotations: false\n\ncoverage:\n status:\n project:\n default:\n threshold: 5% # allow 5% coverage variance\n\n patch: off\n" }, { "path": ".github/dependabot.yml", "content": "version: 2\nupdates:\n - package-ecosystem: github-actions\n directory: /\n schedule:\n interval: weekly\n labels:\n - \"C-Dependencies\"\n - \"C-Actions\"\n groups:\n ci-dependencies:\n applies-to: version-updates\n patterns: [\"*\"]\n update-types:\n - \"minor\"\n - \"patch\"\n - package-ecosystem: cargo\n directory: /\n schedule:\n interval: weekly\n labels:\n - \"C-Dependencies\"\n groups:\n rust-dependencies:\n applies-to: version-updates\n patterns: [\"*\"]\n update-types:\n - \"minor\"\n - \"patch\"\n - package-ecosystem: cargo\n directory: /tests/fuzz/\n schedule:\n interval: weekly\n labels:\n - \"C-Dependencies\"\n groups:\n fuzz-dependencies:\n applies-to: version-updates\n patterns: [\"*\"]\n update-types:\n - \"minor\"\n - \"patch\"\n" }, { "path": ".github/labeler.yml", "content": "C-Actions:\n- changed-files:\n - any-glob-to-any-file:\n - '.github/**'\n\nC-AST:\n- changed-files:\n - any-glob-to-any-file: 'core/ast/**'\n\nC-Benchmark:\n- changed-files:\n - any-glob-to-any-file:\n - 'benches/**'\n - 'core/engine/benches/**'\n\nC-Builtins:\n- all:\n - changed-files:\n - any-glob-to-any-file:\n - 'core/engine/src/builtins/**'\n - 'core/engine/src/object/builtins/**'\n - all-globs-to-all-files:\n - '!core/engine/src/object/builtins/intl/**'\n\nC-CLI:\n- changed-files:\n - any-glob-to-any-file:\n - 'cli/**'\n\nC-Dependencies:\n- changed-files:\n - any-glob-to-any-file:\n - '**/Cargo.lock'\n - '**/Cargo.toml'\n\nC-Documentation:\n- changed-files:\n - any-glob-to-any-file:\n - '**/*.md'\n\nC-FFI:\n- changed-files:\n - any-glob-to-any-file:\n - 'ffi/**'\n\nC-GC:\n- changed-files:\n - any-glob-to-any-file:\n - 'core/gc/**'\n\nC-Intl:\n- changed-files:\n - any-glob-to-any-file:\n - 'core/engine/src/builtins/intl/**'\n\nC-Javascript:\n- changed-files:\n - any-glob-to-any-file:\n - '**/*.js'\n\nC-Parser:\n- changed-files:\n - any-glob-to-any-file:\n - 'core/parser/**'\n\nC-Runtime:\n- changed-files:\n - any-glob-to-any-file:\n - 'core/runtime/**'\n\nC-Tests:\n- changed-files:\n - any-glob-to-any-file:\n - '**/tests/**'\n - '**/test*'\n\nC-VM:\n- changed-files:\n - any-glob-to-any-file:\n - 'core/engine/src/bytecompiler/**'\n - 'core/engine/src/vm/**'\n\nC-WebAssembly:\n- changed-files:\n - any-glob-to-any-file:\n - 'ffi/wasm/**'\n" }, { "path": ".github/release.yml", "content": "# .github/release.yml\n\nchangelog:\n exclude:\n authors:\n - dependabot\n categories:\n - title: Feature Enhancements\n labels:\n - A-Enhancement\n - title: Bug Fixes\n labels:\n - A-Bug\n - title: Performance Improvements\n labels:\n - A-Performance\n - A-Memory\n - title: Internal Improvements\n labels:\n - A-Internal\n - A-Technical Debt\n - title: Other Changes\n labels:\n - \"*\"\n" }, { "path": ".github/workflows/codeql.yml", "content": "name: \"CodeQL SAST Scanning\"\n\non:\n workflow_dispatch:\n schedule:\n - cron: '0 0 * * 0' # Run weekly on Sundays\n\npermissions:\n contents: read\n\njobs:\n analyze:\n name: Analyze\n runs-on: ubuntu-latest\n timeout-minutes: 60\n permissions:\n actions: read\n contents: read\n security-events: write\n\n strategy:\n fail-fast: false\n matrix:\n language: [ 'rust' ]\n\n steps:\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Initialize CodeQL\n uses: github/codeql-action/init@38697555549f1db7851b81482ff19f1fa5c4fedc # v4.34.1\n with:\n languages: ${{ matrix.language }}\n build-mode: none\n\n - name: Perform CodeQL Analysis\n uses: github/codeql-action/analyze@38697555549f1db7851b81482ff19f1fa5c4fedc # v4.34.1\n with:\n category: \"/language:${{matrix.language}}\"\n" }, { "path": ".github/workflows/labeler.yml", "content": "name: \"Pull Request Labeler\"\non:\n- pull_request_target\n\npermissions:\n contents: read\n\njobs:\n labeler:\n permissions:\n contents: read\n pull-requests: write\n runs-on: ubuntu-latest\n timeout-minutes: 10\n steps:\n - uses: actions/labeler@634933edcd8ababfe52f92936142cc22ac488b1b # v6\n" }, { "path": ".github/workflows/nightly_build.yml", "content": "name: Nightly Build\npermissions:\n contents: read\n\n# Schedule this workflow to run at midnight every day\non:\n schedule:\n - cron: \"0 0 * * *\"\n workflow_dispatch:\n\njobs:\n build:\n permissions:\n contents: write\n strategy:\n matrix:\n include:\n - target: x86_64-unknown-linux-gnu\n os: ubuntu-latest\n binary_extension: \"\"\n - target: aarch64-apple-darwin\n os: macos-14\n - target: aarch64-unknown-linux-gnu\n os: ubuntu-24.04-arm\n binary_extension: \"\"\n - target: x86_64-pc-windows-msvc\n os: windows-latest\n binary_extension: \".exe\"\n runs-on: ${{ matrix.os }}\n timeout-minutes: 60\n steps:\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n targets: ${{ matrix.target }}\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Build\n run: cargo build --target ${{ matrix.target }} --release --locked --bin boa\n\n - name: Upload binaries to release\n uses: svenstaro/upload-release-action@29e53e917877a24fad85510ded594ab3c9ca12de # v2\n with:\n repo_token: ${{ secrets.GITHUB_TOKEN }}\n file: target/${{ matrix.target }}/release/boa${{ matrix.binary_extension }}\n asset_name: boa-${{ matrix.target }}${{ matrix.binary_extension }}\n tag: refs/tags/nightly\n overwrite: true\n prerelease: true\n" }, { "path": ".github/workflows/pr_management.yml", "content": "name: PR Management\n\non:\n pull_request_target:\n types: [opened, reopened, synchronize, closed]\n\npermissions:\n contents: read\n\njobs:\n manage_pr:\n runs-on: ubuntu-latest\n timeout-minutes: 10\n permissions:\n pull-requests: write\n issues: write\n steps:\n - name: Auto Add Label\n if: github.event.action == 'opened' || github.event.action == 'reopened' || github.event.action == 'synchronize'\n uses: actions/github-script@ed597411d8f924073f98dfc5c65a23a2325f34cd # v8\n with:\n script: |\n const labels = await github.rest.issues.listLabelsOnIssue({\n owner: context.repo.owner,\n repo: context.repo.repo,\n issue_number: context.issue.number\n });\n\n if (labels.data.every(label => label.name != \"Waiting On Author\")) {\n github.rest.issues.addLabels({\n issue_number: context.issue.number,\n owner: context.repo.owner,\n repo: context.repo.repo,\n labels: ['Waiting On Review']\n })\n }\n\n\n - name: Auto Remove Label\n if: github.event.action == 'closed'\n uses: actions/github-script@ed597411d8f924073f98dfc5c65a23a2325f34cd # v8\n continue-on-error: true\n with:\n script: |\n try {\n await github.rest.issues.removeLabel({\n issue_number: context.issue.number,\n owner: context.repo.owner,\n repo: context.repo.repo,\n name: 'Waiting On Review'\n });\n } catch (error) {\n console.log('Label \"Waiting On Review\" not found or could not be removed.');\n }\n\n - name: Auto Assign Milestone\n if: github.event.action == 'opened'\n uses: actions/github-script@ed597411d8f924073f98dfc5c65a23a2325f34cd # v8\n with:\n script: |\n // Fetch open milestones and assign the closest one\n const { data: milestones } = await github.rest.issues.listMilestones({\n owner: context.repo.owner,\n repo: context.repo.repo,\n state: 'open',\n sort: 'due_on',\n direction: 'asc'\n });\n\n if (milestones.length > 0) {\n const latestMilestone = milestones[0];\n await github.rest.issues.update({\n issue_number: context.issue.number,\n owner: context.repo.owner,\n repo: context.repo.repo,\n milestone: latestMilestone.number\n });\n }\n" }, { "path": ".github/workflows/pull_request.yml", "content": "name: Benchmarks\n\non:\n pull_request:\n branches:\n - main\n - releases/**\n\npermissions:\n contents: read\n\nconcurrency:\n group: ${{ github.workflow }}-${{ github.event.pull_request.number || github.ref }}\n cancel-in-progress: true\n\njobs:\n runBenchmark:\n if: contains(github.event.pull_request.labels.*.name, 'run-benchmark')\n name: run benchmark\n runs-on: ubuntu-latest\n timeout-minutes: 120\n steps:\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n fetch-depth: 0\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - uses: boa-dev/criterion-compare-action@adfd3a94634fe2041ce5613eb7df09d247555b87 # v3.2.4\n with:\n token: ${{ secrets.GITHUB_TOKEN }}\n branchName: ${{ github.base_ref }}\n cwd: ./core/engine\n" }, { "path": ".github/workflows/release.yml", "content": "name: Publish Release\non:\n release:\n types: [published]\n\npermissions:\n contents: read\n\njobs:\n publish:\n name: Publish crates\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Set environment\n env:\n W_FLAGS: ${{ (github.ref == 'refs/heads/main' || github.base_ref == 'main') && '-Dwarnings' || '' }}\n # Setting `RUSTFLAGS` overrides any flags set on .cargo/config.toml, so we need to\n # set the target flags instead which are cumulative.\n # Track https://github.com/rust-lang/cargo/issues/5376\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n - name: Install cargo-workspaces\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: cargo-workspaces\n\n - name: Release\n env:\n CARGO_REGISTRY_TOKEN: ${{ secrets.CARGO_REGISTRY_TOKEN }}\n PATCH: ${{ github.run_number }}\n shell: bash\n run: |\n git config --global user.email \"runner@gha.local\"\n git config --global user.name \"Github Action\"\n cargo workspaces publish \\\n --from-git \\\n --yes \\\n --no-git-commit \\\n skip\n\n npm_publish:\n name: Publish NPM package (wasm)\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n targets: wasm32-unknown-unknown\n\n - name: Install wasm-pack\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: wasm-pack\n\n - name: Build boa_wasm\n run: wasm-pack build --scope boa-dev ./ffi/wasm\n\n - name: Set-up Node.js\n uses: actions/setup-node@53b83947a5a98c8d113130e565377fae1a50d02f # v6\n with:\n node-version: \"20\"\n\n - name: Set-up npm config for publishing\n run: npm config set -- '//registry.npmjs.org/:_authToken' \"${{ secrets.NPM_TOKEN }}\"\n\n - name: Check if the npm version already exists\n run: |\n VERSION=$(jq -r '.version' ./ffi/wasm/pkg/package.json)\n\n if npm view @boa-dev/boa_wasm@$VERSION version > dev/null 2>&1; then\n echo \"Version $VERSION already published. Skipping\"\n echo \"SKIP_PUBLISH=true\" >> $GITHUB_ENV\n fi\n\n - name: Publish to npm\n if: env.SKIP_PUBLISH != 'true'\n run: npm publish ./ffi/wasm/pkg --access=public\n\n release-binaries:\n name: Publish binaries\n permissions:\n contents: write\n needs: publish\n strategy:\n fail-fast: false\n matrix:\n build: [linux, macos-arm64, win-msvc]\n include:\n - build: linux\n os: ubuntu-latest\n target: x86_64-unknown-linux-gnu\n binary_extension: \"\"\n - build: macos-arm64\n os: macos-14\n target: aarch64-apple-darwin\n binary_extension: \"\"\n - build: win-msvc\n os: windows-latest\n target: x86_64-pc-windows-msvc\n binary_extension: \".exe\"\n runs-on: ${{ matrix.os }}\n timeout-minutes: 60\n steps:\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n targets: ${{ matrix.target }}\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Build\n run: cargo build --target ${{ matrix.target }} --verbose --release --locked --bin boa\n\n - name: Upload binaries to release\n uses: svenstaro/upload-release-action@29e53e917877a24fad85510ded594ab3c9ca12de # v2\n with:\n repo_token: ${{ secrets.GITHUB_TOKEN }}\n file: target/${{ matrix.target }}/release/boa${{ matrix.binary_extension }}\n asset_name: boa-${{ matrix.target }}${{ matrix.binary_extension }}\n tag: ${{ github.ref }}\n" }, { "path": ".github/workflows/rust.yml", "content": "name: Continuous integration\n\non:\n pull_request:\n branches:\n - main\n - releases/**\n push:\n branches:\n - main\n - releases/**\n merge_group:\n types: [checks_requested]\n workflow_dispatch:\n\npermissions:\n contents: read\n\nconcurrency:\n group: ${{ github.workflow }}-${{ github.event.pull_request.number || github.ref }}\n cancel-in-progress: true\n\nenv:\n W_FLAGS: ${{ (github.ref == 'refs/heads/main' || github.base_ref == 'main') && '-D warnings' || '' }}\n\njobs:\n fmt:\n name: Formatting\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Set environment\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n components: rustfmt\n\n - name: Format (rustfmt)\n run: cargo fmt --all --check\n\n typos:\n name: Typos\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Check for typos\n uses: crate-ci/typos@631208b7aac2daa8b707f55e7331f9112b0e062d # v1.44.0\n\n clippy:\n name: Lint\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Set environment\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n components: clippy\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Install cargo-workspaces\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: cargo-workspaces\n\n - name: Clippy (All features)\n run: cargo workspaces exec cargo clippy --all-features --all-targets\n - name: Clippy (No features)\n run: cargo workspaces exec cargo clippy --no-default-features --all-targets\n - name: Clippy (Intl)\n run: cargo clippy -p boa_engine --features intl\n - name: Clippy (Annex-B)\n run: cargo clippy -p boa_engine --features annex-b\n - name: Clippy (Experimental)\n run: cargo clippy -p boa_engine --features experimental\n\n docs:\n name: Documentation\n runs-on: ubuntu-latest\n timeout-minutes: 60\n env:\n RUSTDOCFLAGS: ${{ (github.ref == 'refs/heads/main' || github.base_ref == 'main') && '-D warnings' || '' }}\n steps:\n - name: Set environment\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Generate documentation\n run: cargo doc -v --document-private-items --all-features\n\n msrv:\n name: MSRV\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Set environment\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n # Get the rust_version from the Cargo.toml\n - name: Get rust_version\n id: rust_version\n run: echo \"rust_version=$(grep '^rust-version' Cargo.toml | cut -d' ' -f3 | tr -d '\"')\" >> $GITHUB_OUTPUT\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: ${{ steps.rust_version.outputs.rust_version }}\n\n - name: Check compilation\n run: cargo check --all-features --all-targets\n\n coverage:\n name: Coverage\n runs-on: ubuntu-latest\n timeout-minutes: 60\n if: ${{ github.ref == 'refs/heads/main' || github.base_ref == 'main' }}\n needs:\n - fmt\n - typos\n - clippy\n - docs\n - msrv\n steps:\n - name: Set environment\n # Setting `RUSTFLAGS` overrides any flags set on .cargo/config.toml, so we need to\n # set the target flags instead which are cumulative.\n # Track https://github.com/rust-lang/cargo/issues/5376\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Install cargo-tarpaulin\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: cargo-tarpaulin\n\n - name: Run tarpaulin\n run: cargo tarpaulin --workspace --features annex-b,intl_bundled,experimental --ignore-tests --engine llvm --out xml\n\n - name: Upload to codecov.io\n uses: codecov/codecov-action@1af58845a975a7985b0beb0cbe6fbbb71a41dbad # v5\n\n tests:\n name: Test\n runs-on: ${{ matrix.os }}\n timeout-minutes: 60\n needs:\n - fmt\n - typos\n - clippy\n - docs\n - msrv\n env:\n RUSTUP_WINDOWS_PATH_ADD_BIN: 1\n strategy:\n fail-fast: false\n matrix:\n include:\n - os: macos-14\n - os: windows-latest\n - os: ubuntu-24.04-arm\n - os: ubuntu-latest\n steps:\n - name: Set environment\n if: ${{ matrix.os != 'windows-latest' }}\n # Setting `RUSTFLAGS` overrides any flags set on .cargo/config.toml, so we need to\n # set the target flags instead which are cumulative.\n # Track https://github.com/rust-lang/cargo/issues/5376\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr '[:lower:]' '[:upper:]' | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Set environment\n if: ${{ matrix.os == 'windows-latest' }}\n run: |\n $target = (rustc -vV | Select-String '^host') -replace '^host:\\s+', '' | ForEach-Object { $_.ToUpper().Replace('-', '_') }\n \"CARGO_TARGET_${target}_RUSTFLAGS=$env:W_FLAGS\" | Out-File -FilePath $env:GITHUB_ENV -Append -Encoding utf8\n\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n - name: Install Cargo insta\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: cargo-insta\n locked: true\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Build tests\n run: cargo test --no-run --profile ci\n # this order is faster according to rust-analyzer\n - name: Build\n run: cargo build --all-targets --quiet --profile ci --features annex-b,intl_bundled,experimental,embedded_lz4\n - name: Install latest nextest\n uses: taiki-e/install-action@7cb3ba7bc31801346db00d4a6d7008aabab5e986 # nextest\n - name: Test with nextest\n run: cargo nextest run --profile ci --cargo-profile ci --features annex-b,intl_bundled,experimental,embedded_lz4\n - name: Test docs\n run: cargo test --doc --profile ci --features annex-b,intl_bundled,experimental\n - name: Test bytecode output\n run: cargo insta test -p insta-bytecode\n\n cross-tests:\n name: Test\n runs-on: ubuntu-latest\n timeout-minutes: 60\n needs:\n - fmt\n - typos\n - clippy\n - docs\n - msrv\n strategy:\n matrix:\n include:\n - target: i686-unknown-linux-gnu\n steps:\n - name: Set environment\n # Setting `RUSTFLAGS` overrides any flags set on .cargo/config.toml, so we need to\n # set the target flags instead which are cumulative.\n # Track https://github.com/rust-lang/cargo/issues/5376\n run: |\n target=$(echo ${{ matrix.target }} | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n target: ${{ matrix.target }}\n\n - name: Install Cross\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: cross\n git: https://github.com/cross-rs/cross\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Run tests\n run: |\n cross test --workspace --target ${{ matrix.target }} \\\n --profile ci \\\n --features annex-b,intl_bundled,experimental \\\n --exclude boa_macros \\\n --exclude boa_macros_tests\n\n miri:\n name: Miri\n runs-on: ubuntu-latest\n timeout-minutes: 120\n needs:\n - fmt\n - typos\n - clippy\n - docs\n - msrv\n steps:\n - name: Set environment\n # Setting `RUSTFLAGS` overrides any flags set on .cargo/config.toml, so we need to\n # set the target flags instead which are cumulative.\n # Track https://github.com/rust-lang/cargo/issues/5376\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust nightly with miri\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # nightly\n with:\n toolchain: nightly\n components: miri\n\n - name: Setup miri\n run: cargo miri setup\n\n - name: Run miri tests\n run: cargo miri test --workspace --exclude boa_cli --exclude boa_examples miri\n\n build-fuzz:\n name: Fuzzing\n runs-on: ubuntu-latest\n timeout-minutes: 60\n needs:\n - fmt\n - typos\n - clippy\n - docs\n - msrv\n steps:\n - name: Set environment\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Install cargo-fuzz\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: cargo-fuzz\n\n - name: Build fuzz\n run: cd tests/fuzz && cargo fuzz build -s none --dev\n\n build-run-examples:\n name: Build & run examples\n runs-on: ubuntu-latest\n timeout-minutes: 60\n needs:\n - fmt\n - typos\n - clippy\n - docs\n - msrv\n steps:\n - name: Set environment\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Install cargo-workspaces\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: cargo-workspaces\n\n - name: Build (All features)\n run: cargo workspaces exec cargo build --all-features --all-targets --profile ci\n - name: Build (No features)\n run: cargo workspaces exec cargo build --no-default-features --all-targets --profile ci\n\n - name: Run examples\n run: |\n cd examples\n cargo run -p boa_examples --bin 2>&1 \\\n | grep -E '^ ' \\\n | xargs -n1 sh -c 'cargo run -p boa_examples --profile ci --bin $0 || exit 255'\n\n run-semver-check:\n name: Check SemVer compatibility\n runs-on: ubuntu-latest\n timeout-minutes: 60\n needs:\n - fmt\n - typos\n - clippy\n - docs\n - msrv\n steps:\n - name: Set environment\n run: |\n target=$(rustc -vV | awk '/^host/ { print $2 }' | tr [:lower:] [:upper:] | tr '-' '_')\n echo \"CARGO_TARGET_${target}_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Check Semver\n uses: obi1kenobi/cargo-semver-checks-action@5b298c9520f7096a4683c0bd981a7ac5a7e249ae # v2\n with:\n exclude: boa_wintertc\n" }, { "path": ".github/workflows/security_audit.yml", "content": "name: Security audit\non:\n schedule:\n - cron: \"0 0 * * *\"\n\npermissions:\n contents: read\njobs:\n audit:\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n - uses: rustsec/audit-check@69366f33c96575abad1ee0dba8212993eecbe998 # v2.0.0\n with:\n token: ${{ secrets.GITHUB_TOKEN }}\n" }, { "path": ".github/workflows/test262.yml", "content": "name: test262\n\non:\n pull_request:\n branches:\n - main\n - releases/**\n\npermissions:\n contents: read\n\nconcurrency:\n group: ${{ github.workflow }}-${{ github.event.pull_request.number }}\n cancel-in-progress: true\n\njobs:\n run_test262:\n name: Run the test262 test suite\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n path: boa\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Checkout the data repo\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n repository: boa-dev/data\n path: data\n persist-credentials: false\n\n - name: Run the test262 test suite\n run: |\n cd boa\n mkdir -p ../results/test262\n cargo run --release --bin boa_tester -- run -v -o ../results/test262\n cd ..\n\n - name: Compare results\n shell: bash\n run: |\n cd boa\n\n base_results=\"../data/test262/refs/heads/main/latest.json\"\n pr_results=\"../results/test262/pull/latest.json\"\n output_dir=\"../results/outputs\"\n\n test -f \"$base_results\"\n test -f \"$pr_results\"\n\n comment=\"$(./target/release/boa_tester compare \"$base_results\" \"$pr_results\" -m)\"\n maincommit=\"$(jq -r '.c' \"$base_results\")\"\n\n mkdir -p \"$output_dir\"\n {\n echo \"\"\n echo \"### Test262 conformance changes\"\n echo\n echo \"$comment\"\n echo\n echo \"Tested main commit: [\\`${maincommit}\\`](${{ github.event.pull_request.base.repo.html_url }}/commit/${maincommit})\"\n echo \"Tested PR commit: [\\`${{ github.event.pull_request.head.sha }}\\`](${{ github.event.pull_request.head.repo.html_url }}/commit/${{ github.event.pull_request.head.sha }})\"\n echo \"Compare commits: ${{ github.event.pull_request.base.repo.html_url }}/compare/${maincommit}...${{ github.event.pull_request.head.sha }}\"\n } > \"$output_dir/comment.md\"\n\n echo \"${{ github.event.pull_request.number }}\" > \"$output_dir/pr_number.txt\"\n\n - name: Upload results\n uses: actions/upload-artifact@bbbca2ddaa5d8feaa63e36b76fdaad77386f024f # v7.0.0\n with:\n name: test262-results\n path: results/outputs\n retention-days: 1\n" }, { "path": ".github/workflows/test262_comment.yml", "content": "name: test262_comment\n\non:\n workflow_run:\n workflows: [\"test262\"]\n types:\n - completed\n\npermissions:\n contents: read\n pull-requests: write\n\njobs:\n comment:\n name: Post results to PR\n runs-on: ubuntu-latest\n if: ${{ github.event.workflow_run.event == 'pull_request' && github.event.workflow_run.conclusion == 'success' }}\n steps:\n - name: Download results\n uses: actions/download-artifact@3e5f45b2cfb9172054b4087a40e8e0b5a5461e7c # v8.0.1\n with:\n name: test262-results\n github-token: ${{ secrets.GITHUB_TOKEN }}\n run-id: ${{ github.event.workflow_run.id }}\n path: downloaded-results\n\n - name: Read results\n id: results\n shell: bash\n run: |\n echo \"pr_number=$(cat downloaded-results/pr_number.txt)\" >> $GITHUB_OUTPUT\n\n - name: Find Previous Comment\n uses: peter-evans/find-comment@b30e6a3c0ed37e7c023ccd3f1db5c6c0b0c23aad # v4\n id: previous-comment\n with:\n issue-number: ${{ steps.results.outputs.pr_number }}\n body-includes: \"\"\n\n - name: Update or create comment\n uses: peter-evans/create-or-update-comment@e8674b075228eee787fea43ef493e45ece1004c9 # v5\n with:\n comment-id: ${{ steps.previous-comment.outputs.comment-id }}\n issue-number: ${{ steps.results.outputs.pr_number }}\n body-path: downloaded-results/comment.md\n edit-mode: replace\n" }, { "path": ".github/workflows/test262_release.yml", "content": "name: Update Test262 Results\n\non:\n release:\n types:\n - published\n push:\n branches:\n - main\n\npermissions:\n contents: read\n\nconcurrency:\n group: ${{ github.workflow }}-${{ github.ref }}\n cancel-in-progress: true\n\njobs:\n update_test262_results:\n name: Update Test262 Results\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n # Checkout the main repository\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n path: boa\n\n # Install Rust toolchain\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n # Cache cargo dependencies\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n # Checkout the `data` repository\n - name: Checkout the data repo\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n repository: boa-dev/data\n token: ${{ secrets.DATA_PAT }}\n path: data\n\n # Run the Test262 test suite\n - name: Run the test262 test suite\n run: |\n cd boa\n cargo run --release --bin boa_tester -- run -v -o ../data/test262\n\n # Commit and push results back to the `data` repo\n - name: Commit results\n run: |\n cd data\n git config user.name \"GitHub Actions\"\n git config user.email \"actions@github.com\"\n git add test262\n git commit -m \"Update Test262 results ( ${{ github.ref_name }} )\"\n - name: Push changes\n uses: ad-m/github-push-action@4cc74773234f74829a8c21bc4d69dd4be9cfa599 # master\n with:\n # cannot use secrets.GITHUB_TOKEN since it only gives you\n # write permissions to the current repository.\n github_token: ${{ secrets.DATA_PAT }}\n repository: boa-dev/data\n directory: data\n" }, { "path": ".github/workflows/webassembly.yml", "content": "name: Webassembly demo\n\non:\n pull_request:\n branches:\n - main\n - releases/**\n push:\n branches:\n - main\n - releases/**\n merge_group:\n types: [checks_requested]\n\npermissions:\n contents: read\n\nconcurrency:\n group: ${{ github.workflow }}-${{ github.event.pull_request.number || github.ref }}\n cancel-in-progress: true\n\njobs:\n check_style:\n name: Check webassembly demo style\n runs-on: ubuntu-latest\n timeout-minutes: 60\n steps:\n - name: Checkout\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n - name: Check code formatting\n run: npx prettier --check .\n\n build:\n name: Build webassembly demo\n runs-on: ubuntu-latest\n timeout-minutes: 60\n env:\n WASM_PACK_PATH: ~/.cargo/bin/wasm-pack\n steps:\n - name: Set environment\n env:\n W_FLAGS: ${{ (github.ref == 'refs/heads/main' || github.base_ref == 'main') && '-Dwarnings' || '' }}\n # Setting `RUSTFLAGS` overrides any flags set on .cargo/config.toml, so we need to\n # set the target flags instead which are cumulative.\n # Track https://github.com/rust-lang/cargo/issues/5376\n run: echo \"CARGO_TARGET_WASM32_UNKNOWN_UNKNOWN_RUSTFLAGS=$W_FLAGS\" >> $GITHUB_ENV\n - name: Checkout repository\n uses: actions/checkout@de0fac2e4500dabe0009e67214ff5f5447ce83dd # v6\n with:\n persist-credentials: false\n\n - name: Install Rust toolchain\n uses: dtolnay/rust-toolchain@631a55b12751854ce901bb631d5902ceb48146f7 # stable\n with:\n toolchain: stable\n\n\n - name: Cache Cargo\n uses: Swatinem/rust-cache@c19371144df3bb44fab255c43d04cbc2ab54d1c4 # v2.9.1\n\n - name: Install wasm-pack\n uses: baptiste0928/cargo-install@f204293d9709061b7bc1756fec3ec4e2cd57dec0 # v3.4.0\n with:\n crate: wasm-pack\n\n - name: Build Playground\n run: wasm-pack build ./ffi/wasm --verbose\n - name: Test (Chrome)\n run: wasm-pack test --headless --chrome ./ffi/wasm --verbose\n - name: Test (Firefox)\n run: wasm-pack test --headless --firefox ./ffi/wasm --verbose\n" }, { "path": ".gitignore", "content": "# IDE\n.idea/\n*.iml\n\n# Vim\n*.*.swp\n*.*.swo\n\n# Build\ntarget\ndist\n**/*.rs.bk\nnode_modules\n.DS_Store\nyarn-error.log\n.vscode/settings.json\n.zed/settings.json\n\n# debug is used for testing changes locally\n/debug\n.boa_history\n\n# test262 testing suite\ntest262\n\n# wpt testing suite\ntests_wpt\n\n# Profiling\n*.string_data\n*.string_index\n*.events\nchrome_profiler.json\n*.mm_profdata\nprofile.json.gz\n\n# Logs\n*.log\n\n# Yarn\n.yarn\n.yarnrc.yml\n\n# e2e test\nplaywright-report\ntest-results\n\n# dhat\ndhat-*.json\nperf.data*\n\n# Nix\n/.envrc\n/.direnv\n" }, { "path": ".husky/pre-push", "content": "#!/bin/sh\n\ntarget=$(rustc -vV | awk '/^host/ { print $2 }' | tr '[:lower:]' '[:upper:]' | tr '-' '_')\nexport CARGO_TARGET_${target}_RUSTFLAGS='-D warnings'\n\nif ! command -v cargo-make >/dev/null 2>&1; then\n echo \"cargo-make is not installed. Install it with:\"\n echo \" cargo install cargo-make\"\n exit 1\nfi\n\ncargo make run-ci\n" }, { "path": ".prettierignore", "content": "# Ignore artifacts:\n*.rs\n*.yml\ntarget\nnode_modules\ncore/engine/benches/bench_scripts/mini_js.js\ncore/engine/benches/bench_scripts/clean_js.js\nffi/wasm/pkg\ndist\ntest262\nplaywright-report\ntest-results\n\n# For some reason Prettier likes to reformat JSON lock files.\nflake.lock\n\n# Assets that should not be checked.\nbenches/scripts/v8-benches\n" }, { "path": ".vscode/launch.json", "content": "{\n // Use IntelliSense to learn about possible attributes.\n // Hover to view descriptions of existing attributes.\n // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387\n \"version\": \"0.2.0\",\n \"configurations\": [\n {\n \"type\": \"lldb\",\n \"request\": \"launch\",\n \"name\": \"Debug Boa (Script mode)\",\n \"windows\": {\n \"program\": \"${workspaceFolder}/target/debug/boa.exe\"\n },\n \"program\": \"${workspaceFolder}/target/debug/boa\",\n \"args\": [\"${workspaceFolder}/${input:filePath}\", \"--debug-object\"],\n \"sourceLanguages\": [\"rust\"],\n \"preLaunchTask\": \"Cargo Build boa_cli\"\n },\n {\n \"type\": \"lldb\",\n \"request\": \"launch\",\n \"name\": \"Debug Boa (Module mode)\",\n \"windows\": {\n \"program\": \"${workspaceFolder}/target/debug/boa.exe\"\n },\n \"program\": \"${workspaceFolder}/target/debug/boa\",\n \"args\": [\n \"${workspaceFolder}/${input:filePath}\",\n \"--debug-object\",\n \"-m\",\n \"-r\",\n \"${workspaceFolder}/${input:modulePath}\"\n ],\n \"sourceLanguages\": [\"rust\"],\n \"preLaunchTask\": \"Cargo Build boa_cli\"\n },\n {\n \"type\": \"lldb\",\n \"request\": \"launch\",\n \"name\": \"Debug Boa (Tester)\",\n \"windows\": {\n \"program\": \"${workspaceFolder}/target/debug/boa_tester.exe\"\n },\n \"program\": \"${workspaceFolder}/target/debug/boa_tester\",\n \"args\": [\"run\", \"-s\", \"${input:testPath}\", \"-vvv\", \"-d\"],\n \"sourceLanguages\": [\"rust\"],\n \"preLaunchTask\": \"Cargo Build boa_tester\"\n }\n ],\n \"inputs\": [\n {\n \"id\": \"filePath\",\n \"description\": \"Relative path to the file to run\",\n \"type\": \"promptString\"\n },\n {\n \"id\": \"modulePath\",\n \"description\": \"Relative path to the module root directory\",\n \"type\": \"promptString\"\n },\n {\n \"id\": \"testPath\",\n \"description\": \"Relative path to the test from the test262 directory\",\n \"type\": \"promptString\"\n }\n ]\n}\n" }, { "path": ".vscode/tasks.json", "content": "{\n // See https://go.microsoft.com/fwlink/?LinkId=733558\n // for the documentation about the tasks.json format\n \"version\": \"2.0.0\",\n \"tasks\": [\n {\n \"type\": \"process\",\n \"label\": \"Cargo Build\",\n \"command\": \"cargo\",\n \"args\": [\"build\"],\n \"group\": \"build\",\n \"presentation\": {\n \"clear\": true\n }\n },\n {\n \"type\": \"process\",\n \"label\": \"Cargo Build boa_cli\",\n \"command\": \"cargo\",\n \"args\": [\"build\", \"-p\", \"boa_cli\"],\n \"group\": \"build\",\n \"presentation\": {\n \"clear\": true\n }\n },\n {\n \"type\": \"process\",\n \"label\": \"Cargo Build boa_tester\",\n \"command\": \"cargo\",\n \"args\": [\"build\", \"-p\", \"boa_tester\"],\n \"group\": \"build\",\n \"presentation\": {\n \"clear\": true\n }\n },\n {\n \"type\": \"process\",\n \"label\": \"Run JS file\",\n \"command\": \"cargo\",\n \"args\": [\"run\", \"--bin\", \"boa\", \"${file}\"],\n \"group\": {\n \"kind\": \"build\",\n \"isDefault\": true\n },\n \"presentation\": {\n \"clear\": true\n },\n \"options\": {\n \"env\": {\n \"RUST_BACKTRACE\": \"1\"\n }\n },\n \"problemMatcher\": []\n },\n {\n \"type\": \"process\",\n \"label\": \"Run JS file (Profiler)\",\n \"command\": \"cargo\",\n \"args\": [\"run\", \"--features\", \"profiler\", \"${file}\"],\n \"group\": \"build\",\n \"options\": {\n \"env\": {\n \"RUST_BACKTRACE\": \"full\"\n },\n \"cwd\": \"${workspaceFolder}/cli\"\n },\n \"presentation\": {\n \"clear\": true\n },\n \"problemMatcher\": []\n },\n {\n \"type\": \"process\",\n \"label\": \"Run JS file with VM trace\",\n \"command\": \"cargo\",\n \"args\": [\"run\", \"--bin\", \"boa\", \"--\", \"-t\", \"${file}\"],\n \"group\": \"build\",\n \"presentation\": {\n \"clear\": true\n },\n \"problemMatcher\": []\n },\n {\n \"type\": \"process\",\n \"label\": \"Get AST for JS file\",\n \"command\": \"cargo\",\n \"args\": [\"run\", \"--bin\", \"boa\", \"--\", \"-a=Debug\", \"${file}\"],\n \"group\": \"build\",\n \"presentation\": {\n \"clear\": true\n },\n \"problemMatcher\": []\n },\n {\n \"type\": \"process\",\n \"label\": \"Cargo Test\",\n \"command\": \"cargo\",\n \"args\": [\"test\"],\n \"group\": {\n \"kind\": \"test\",\n \"isDefault\": true\n },\n \"presentation\": {\n \"clear\": true\n }\n },\n {\n \"type\": \"process\",\n \"label\": \"Cargo Test Build\",\n \"command\": \"cargo\",\n \"args\": [\"test\", \"--no-run\"],\n \"group\": \"build\"\n }\n ]\n}\n" }, { "path": "ABOUT.md", "content": "# About Boa\n\nBoa is an open-source, experimental ECMAScript Engine written in Rust for\nlexing, parsing and executing ECMAScript/JavaScript. Currently, Boa supports some\nof the [language][boa-conformance]. More information can be viewed at [Boa's\nwebsite][boa-web].\n\nTry out the most recent release with Boa's live demo\n[playground][boa-playground].\n\n## Boa Crates\n\n- [**`boa_cli`**][cli] - Boa's CLI && REPL implementation\n- [**`boa_ast`**][ast] - Boa's ECMAScript Abstract Syntax Tree.\n- [**`boa_engine`**][engine] - Boa's implementation of ECMAScript builtin objects and execution.\n- [**`boa_gc`**][gc] - Boa's garbage collector.\n- [**`boa_icu_provider`**][icu] - Boa's ICU4X data provider.\n- [**`boa_interner`**][interner] - Boa's string interner.\n- [**`boa_macros`**][macros] - Boa's macros.\n- [**`boa_parser`**][parser] - Boa's lexer and parser.\n- [**`boa_runtime`**][runtime] - Boa's `WebAPI` features.\n- [**`boa_string`**][string] - Boa's ECMAScript string implementation.\n- [**`boa_wintertc`**][wintertc] - Boa's `WinterTC` (TC55) Minimum Common Web API implementation.\n- [**`tag_ptr`**][tag_ptr] - Utility library that enables a pointer to be associated with a tag of type `usize`.\n- [**`small_btree`**][small_btree] - Utility library that adds the `SmallBTreeMap` data structure.\n\n[boa-conformance]: https://boajs.dev/conformance\n[boa-web]: https://boajs.dev/\n[boa-playground]: https://boajs.dev/playground\n[ast]: https://docs.rs/boa_ast/latest/boa_ast/index.html\n[engine]: https://docs.rs/boa_engine/latest/boa_engine/index.html\n[gc]: https://docs.rs/boa_gc/latest/boa_gc/index.html\n[interner]: https://docs.rs/boa_interner/latest/boa_interner/index.html\n[parser]: https://docs.rs/boa_parser/latest/boa_parser/index.html\n[icu]: https://docs.rs/boa_icu_provider/latest/boa_icu_provider/index.html\n[runtime]: https://docs.rs/boa_runtime/latest/boa_runtime/index.html\n[string]: https://docs.rs/boa_string/latest/boa_string/index.html\n[wintertc]: https://docs.rs/boa_wintertc/latest/boa_wintertc/index.html\n[tag_ptr]: https://docs.rs/tag_ptr/latest/tag_ptr/index.html\n[small_btree]: https://docs.rs/small_btree/latest/small_btree/index.html\n[macros]: https://docs.rs/boa_macros/latest/boa_macros/index.html\n[cli]: https://crates.io/crates/boa_cli\n" }, { "path": "CHANGELOG.md", "content": "# CHANGELOG\n\n## [v0.21.0 (2025-10-21)](https://github.com/boa-dev/boa/compare/v0.20...v0.21)\n\n### Feature Enhancements\n\n- Build out Temporal's `ZonedDateTime` and `Now` by @nekevss in https://github.com/boa-dev/boa/pull/4068\n- Add valueOf methods to the Temporal builtins by @nekevss in https://github.com/boa-dev/boa/pull/4079\n- Add more `ZonedDateTime` method implementations by @nekevss in https://github.com/boa-dev/boa/pull/4095\n- Cleanup CLI to use eyre + refactor patterns by @jedel1043 in https://github.com/boa-dev/boa/pull/4108\n- Move methods of `JsString` to `JsStr` by @jedel1043 in https://github.com/boa-dev/boa/pull/4106\n- Implement `Error.isError` by @jedel1043 in https://github.com/boa-dev/boa/pull/4114\n- Improve implementation of example `JobQueue`s by @jedel1043 in https://github.com/boa-dev/boa/pull/4111\n- Implement `PlainDate` string methods by @nekevss in https://github.com/boa-dev/boa/pull/4119\n- Revamp `JobQueue` into `JobExecutor` and introduce `NativeAsyncJob` by @jedel1043 in https://github.com/boa-dev/boa/pull/4118\n- Add `From>` for `JsString` by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/4134\n- Implement more `toString` and `toJSON` methods on Temporal builtins by @nekevss in https://github.com/boa-dev/boa/pull/4126\n- Implement `Array.fromAsync` by @jedel1043 in https://github.com/boa-dev/boa/pull/4115\n- Implement `toString` and `toJSON` methods for the remaining builtins `Duration`, `PlainMonthDay`, and `PlainYearMonth` by @nekevss in https://github.com/boa-dev/boa/pull/4135\n- Bump temporal_rs and fix instant return by @nekevss in https://github.com/boa-dev/boa/pull/4142\n- Implement toLocaleString and some general cleanup by @nekevss in https://github.com/boa-dev/boa/pull/4156\n- add macos arm64 by @ahaoboy in https://github.com/boa-dev/boa/pull/4160\n- Use NaN-boxing on value::InnerValue by @hansl in https://github.com/boa-dev/boa/pull/4091\n- Split `Tagged` into a utility crate by @HalidOdat in https://github.com/boa-dev/boa/pull/3849\n- Update JsValue::to_json to support undefined by @jamesthurley in https://github.com/boa-dev/boa/pull/4212\n- Change signature of `from_async_fn` to allow capturing the context by @jedel1043 in https://github.com/boa-dev/boa/pull/4215\n- Implement Set methods from ECMAScript Specification Features/#4128 by @Hemenguelbindi in https://github.com/boa-dev/boa/pull/4145\n- Add a `#[boa_module]` macro to automatically implement a Module by @hansl in https://github.com/boa-dev/boa/pull/4277\n- Implement small changes from Intl's 2026 spec by @jedel1043 in https://github.com/boa-dev/boa/pull/4290\n- Bump rustc edition to 2024 and version to 1.88 by @jedel1043 in https://github.com/boa-dev/boa/pull/4315\n- Implement backtrace information for errors by @HalidOdat in https://github.com/boa-dev/boa/pull/4292\n- Add WPT as optional tests for boa_runtime by @hansl in https://github.com/boa-dev/boa/pull/4008\n- Simplify SourcePositionGuard creation by @hansl in https://github.com/boa-dev/boa/pull/4327\n- Make `JobExecutor::run_jobs_async` a plain async method by @jedel1043 in https://github.com/boa-dev/boa/pull/4331\n- Introduce async `ModuleLoader`s by @jedel1043 in https://github.com/boa-dev/boa/pull/4328\n- Use `AsyncFnOnce` in constructors of `NativeAsyncJob` by @jedel1043 in https://github.com/boa-dev/boa/pull/4333\n- Add (optionally) Float16Array and f16round() support and add JsUint8ClampedArray by @hansl in https://github.com/boa-dev/boa/pull/4364\n- Implement `Atomics.waitAsync` by @jedel1043 in https://github.com/boa-dev/boa/pull/4339\n- Implement `Math.sumPrecise` by @nekevss in https://github.com/boa-dev/boa/pull/4383\n- Add `Date.prototype.toTemporalInstant` from the Temporal proposal by @nekevss in https://github.com/boa-dev/boa/pull/4382\n- Implement upsert methods for Map by @jasonmilad in https://github.com/boa-dev/boa/pull/4436\n- Change JsObject default method to take `Instrinsics` parameter by @mdrokz in https://github.com/boa-dev/boa/pull/4466\n- Cleanup `BuiltInConstructor` constants to ensure no additional allocations by @jedel1043 in https://github.com/boa-dev/boa/pull/4464\n- Implement Upsert methods for weakMap: getOrInsert and getOrInsertComputed by @rrogerc in https://github.com/boa-dev/boa/pull/4459\n\n### Bug Fixes\n\n- Fix #4051, parse Arguments should expect `)` not `}` by @zzzdong in https://github.com/boa-dev/boa/pull/4058\n- bug fix: ops that stay strictly at the EOF after assigns ops are ignored by @Nikita-str in https://github.com/boa-dev/boa/pull/4047\n- Patch Temporal.PlainTime and Temporal.Duration constructors by @nekevss in https://github.com/boa-dev/boa/pull/4078\n- Fix bugs on ephemeron and TypedArray.prototype.slice by @jedel1043 in https://github.com/boa-dev/boa/pull/4107\n- Allow bool and null literals in export aliases by @jedel1043 in https://github.com/boa-dev/boa/pull/4113\n- Allow referencing `super` within initializer of static private property by @jedel1043 in https://github.com/boa-dev/boa/pull/4121\n- Fix truncation on max microseconds and nanoseconds by @nekevss in https://github.com/boa-dev/boa/pull/4139\n- Fix issues with `to_temporal_time` and `ZonedDateTime.prototype.withPlainTime` by @nekevss in https://github.com/boa-dev/boa/pull/4154\n- Some cleanup + order of operations fixes by @nekevss in https://github.com/boa-dev/boa/pull/4190\n- Fix JsValue::to_json with cyclic values by @changhc in https://github.com/boa-dev/boa/pull/4176\n- Fixed logo in documentation by @Razican in https://github.com/boa-dev/boa/pull/4208\n- Enable `wasm_js` feature of getrandom in boa_engine crate by @HalidOdat in https://github.com/boa-dev/boa/pull/4241\n- Fix panics on staging TypedArray.slice tests by @jedel1043 in https://github.com/boa-dev/boa/pull/4289\n- Add the legacy enum-based JsValue implementation behind a flag by @hansl in https://github.com/boa-dev/boa/pull/4281\n- Allow non-reserved keywords to be used as identifiers by @cijiugechu in https://github.com/boa-dev/boa/pull/4307\n- Avoid fully awaiting futures in async event loops by @jedel1043 in https://github.com/boa-dev/boa/pull/4332\n- Prevent evalutation of code with `--dump-ast` flag by @HalidOdat in https://github.com/boa-dev/boa/pull/4337\n- Some general bug fixes for Temporal implementation by @nekevss in https://github.com/boa-dev/boa/pull/4349\n- Fix UB in implementation of `NanBoxedValue` by @jedel1043 in https://github.com/boa-dev/boa/pull/4346\n- fix(regexp): fix the capture group count assert to have the correct upper limit by @BDeuDev in https://github.com/boa-dev/boa/pull/4419\n- Fix `contains_direct_eval` for ordinary function by @hpp2334 in https://github.com/boa-dev/boa/pull/4453\n- Fix test262 comments on new PR by @jedel1043 in https://github.com/boa-dev/boa/pull/4465\n\n### Internal Improvements\n\n- Remove `try_break` macro in favour of question mark operator by @jedel1043 in https://github.com/boa-dev/boa/pull/4112\n- Use cow-utils instead by @heygsc in https://github.com/boa-dev/boa/pull/4133\n- Register VM by @HalidOdat in https://github.com/boa-dev/boa/pull/3798\n- Bump MSRV to 1.84 by @jedel1043 in https://github.com/boa-dev/boa/pull/4165\n- Avoid unnecessary calls of `to_string` in `cow_*` by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/4166\n- Apply rustc 1.85 lints by @jedel1043 in https://github.com/boa-dev/boa/pull/4170\n- Some string cleanups by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/4090\n- Refactor bytecode representation by @raskad in https://github.com/boa-dev/boa/pull/4220\n- Refactor registers to use the stack by @raskad in https://github.com/boa-dev/boa/pull/4263\n- Bump Test262 hash commit and cleanup test features by @jedel1043 in https://github.com/boa-dev/boa/pull/4288\n- Replace inner `Gc` with `Rc` for `SourceText` by @HalidOdat in https://github.com/boa-dev/boa/pull/4293\n- Fix more Intl tests for latest ECMA402 spec by @jedel1043 in https://github.com/boa-dev/boa/pull/4304\n- Fix lints for rustc 1.88 by @jedel1043 in https://github.com/boa-dev/boa/pull/4309\n- Migrate `temporal_rs` from `0.0.9` to `0.0.10` by @HalidOdat in https://github.com/boa-dev/boa/pull/4318\n- Mark the error path in `Call::operation` as cold. by @cijiugechu in https://github.com/boa-dev/boa/pull/4319\n- Add arm64 linux nightly build by @nekevss in https://github.com/boa-dev/boa/pull/4321\n- extract small_map as separate utility crate by @countradooku in https://github.com/boa-dev/boa/pull/4214\n- Remove `Box` from `JsValue` for `JsString` by @HalidOdat in https://github.com/boa-dev/boa/pull/4329\n- Add `repr(C)` on `Object` to prevent field reordering by @HalidOdat in https://github.com/boa-dev/boa/pull/4343\n- Fix clippy lints for Rust 1.89 by @nekevss in https://github.com/boa-dev/boa/pull/4368\n- Add Nix flake by @xubaiwang in https://github.com/boa-dev/boa/pull/4381\n- Apply clippy fixes for Rust 1.90 by @hansl in https://github.com/boa-dev/boa/pull/4423\n- Fix UB on unaligned ArrayBuffers by @jedel1043 in https://github.com/boa-dev/boa/pull/4427\n- Use same cache key for builds and tests by @jasonwilliams in https://github.com/boa-dev/boa/pull/4426\n\n### Other Changes\n\n- Bug fix: regex started with `/=` parsed as `AssignDiv` by @Nikita-str in https://github.com/boa-dev/boa/pull/4048\n- Add fast path for number to `JsString` conversion by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/4054\n- Bump the rust-dependencies group with 3 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4069\n- Add `fjcvtzs` instruction for `ARMv8.3` target by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/4084\n- Add a stress test to the parser to parser multi-millions tokens by @hansl in https://github.com/boa-dev/boa/pull/4086\n- Bump the rust-dependencies group with 4 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4088\n- Privatize `JsValue`'s internals and expose it through a JsVariant (with immutable reference) by @hansl in https://github.com/boa-dev/boa/pull/4080\n- Skip creation of arguments object if possible by @raskad in https://github.com/boa-dev/boa/pull/4087\n- Allow resizing of underlying ArrayBuffer from Rust by @hansl in https://github.com/boa-dev/boa/pull/4082\n- Add inline cache for getting bindings from the global object by @raskad in https://github.com/boa-dev/boa/pull/4067\n- Update Temporal ToIntegerIfIntegral, ToIntegerWithTruncation, and ToPositiveIntegerWithTruncation implementation by @nekevss in https://github.com/boa-dev/boa/pull/4081\n- Adjust call to correct method for `PlainDateTime.prototype.since` by @nekevss in https://github.com/boa-dev/boa/pull/4096\n- fix very minor typo shift -> unshift by @albertleigh in https://github.com/boa-dev/boa/pull/4097\n- Bump the `temporal_rs` version and related changes by @nekevss in https://github.com/boa-dev/boa/pull/4098\n- Bump test262 commit and changes to `boa_tester` to support sm changes by @nekevss in https://github.com/boa-dev/boa/pull/4099\n- Bump the rust-dependencies group across 1 directory with 6 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4103\n- Remove some clones and branches in hot `PropertyDescriptor` functions by @raskad in https://github.com/boa-dev/boa/pull/4104\n- Bump syn from 2.0.93 to 2.0.95 in the rust-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4109\n- Fix CI with the latest linter errors introduced in 1.84 by @hansl in https://github.com/boa-dev/boa/pull/4117\n- Use `cow_to_ascii_uppercase` instead by @heygsc in https://github.com/boa-dev/boa/pull/4124\n- Bump the rust-dependencies group across 1 directory with 7 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4131\n- Set the array \"length\" property in `[[DefineOwnProperty]]` based on the array shape by @raskad in https://github.com/boa-dev/boa/pull/4101\n- Bump the rust-dependencies group with 5 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4137\n- Implement since and until methods for ZonedDateTime by @nekevss in https://github.com/boa-dev/boa/pull/4136\n- Bump baptiste0928/cargo-install from 3.1.1 to 3.3.0 in the ci-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4138\n- Make the HostHooks shareable between app and context by @hansl in https://github.com/boa-dev/boa/pull/4141\n- Bump the rust-dependencies group across 1 directory with 3 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4148\n- Implement an internal time type and Clock trait by @hansl in https://github.com/boa-dev/boa/pull/4149\n- `SourceText` collection & `toString()` for fns and methods by @Nikita-str in https://github.com/boa-dev/boa/pull/4038\n- `setTimeout`, `setInterval` and `clearInterval` (and the same `clearTimeout`) implementations by @hansl in https://github.com/boa-dev/boa/pull/4130\n- Bump the rust-dependencies group with 3 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4151\n- Bump the rust-dependencies group with 5 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4157\n- Add trace function to Logger trait by @jamesthurley in https://github.com/boa-dev/boa/pull/4155\n- Allow local parameters if mapped arguments object is not used by @raskad in https://github.com/boa-dev/boa/pull/4092\n- Bump temporal_rs to Feb. 15 version + adjustments by @nekevss in https://github.com/boa-dev/boa/pull/4162\n- Bump the rust-dependencies group with 3 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4163\n- Add `PlainDateTime.prototype.round` implementation from `temporal_rs` by @nekevss in https://github.com/boa-dev/boa/pull/4164\n- Fix some engine specific bugs and bump version by @nekevss in https://github.com/boa-dev/boa/pull/4167\n- Simplify date parser by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/4143\n- Build out remaining method stubs for temporal by @nekevss in https://github.com/boa-dev/boa/pull/4172\n- Bump the rust-dependencies group with 4 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4174\n- Prioritize drop of common types for nan-boxed `JsValue` by @HalidOdat in https://github.com/boa-dev/boa/pull/4178\n- Add changes from YearMonth parsing update and MonthCode addition by @nekevss in https://github.com/boa-dev/boa/pull/4173\n- implementation of static method compare for duration from temporal.rs by @lockels in https://github.com/boa-dev/boa/pull/4189\n- Unify release workflows by @HalidOdat in https://github.com/boa-dev/boa/pull/4192\n- Temporal bump and fixes by @nekevss in https://github.com/boa-dev/boa/pull/4193\n- Bump ring from 0.17.9 to 0.17.13 by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4201\n- Bump the rust-dependencies group across 1 directory with 20 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4204\n- feat(examples): Add comprehensive JsPromise example by @created-by-varun in https://github.com/boa-dev/boa/pull/4198\n- Temporal bump and implementation of toPlainYearMonth and toPlainMonthDay by @lockels in https://github.com/boa-dev/boa/pull/4207\n- Bump the rust-dependencies group with 5 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4209\n- Bump the rust-dependencies group with 4 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4216\n- Fix Rust 1.86.0 lints and update dependencies by @raskad in https://github.com/boa-dev/boa/pull/4228\n- Move interop and module utilities from boa_interop into boa_engine by @hansl in https://github.com/boa-dev/boa/pull/4218\n- Bump the rust-dependencies group with 3 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4229\n- Temporal bump by @lockels in https://github.com/boa-dev/boa/pull/4231\n- Bump the rust-dependencies group with 2 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4232\n- Enable `PlainDate.prototype.toZonedDateTime` method by @nekevss in https://github.com/boa-dev/boa/pull/4233\n- `PlainDateTime::toZonedDateTime` & `PlainDateTime::toPlainDate` implementations by @nekevss in https://github.com/boa-dev/boa/pull/4234\n- Bump temporal_rs and add ZonedDateTime.prototype.round impl by @nekevss in https://github.com/boa-dev/boa/pull/4236\n- Bump the rust-dependencies group across 1 directory with 6 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4239\n- Bump the rust-dependencies group with 2 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4242\n- Bump temporal_rs and remove dead code by @nekevss in https://github.com/boa-dev/boa/pull/4248\n- Fix Rust 1.87.0 lints by @raskad in https://github.com/boa-dev/boa/pull/4249\n- Avoid range checks in nan-boxing by @raskad in https://github.com/boa-dev/boa/pull/4251\n- Update README.md to new version. by @tomoverlund in https://github.com/boa-dev/boa/pull/4254\n- Fix the Set methods to pass the 262 tests by @hansl in https://github.com/boa-dev/boa/pull/4260\n- Add support for LZ4 compression in embedded module loader by @hansl in https://github.com/boa-dev/boa/pull/4261\n- Bump the rust-dependencies group across 1 directory with 3 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4264\n- Fix AST `contains` operation by @HalidOdat in https://github.com/boa-dev/boa/pull/4267\n- Bump temporal_rs and fix some order of operation issues by @nekevss in https://github.com/boa-dev/boa/pull/4268\n- Escape analyze function scopes on non-arrow functions by @HalidOdat in https://github.com/boa-dev/boa/pull/4266\n- Remove local binding's initialized state in `CallFrame` by @HalidOdat in https://github.com/boa-dev/boa/pull/4269\n- Improve `README.md` by @HalidOdat in https://github.com/boa-dev/boa/pull/4270\n- Add a #[boa_class] proc macro attribute by @hansl in https://github.com/boa-dev/boa/pull/4271\n- Bump ICU4X to 2.0 by @jedel1043 in https://github.com/boa-dev/boa/pull/4274\n- Bump the rust-dependencies group with 2 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4278\n- Add `Span`s to expression nodes by @HalidOdat in https://github.com/boa-dev/boa/pull/4273\n- Bump the rust-dependencies group with 4 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4283\n- Bump temporal_rs to v0.0.9 by @nekevss in https://github.com/boa-dev/boa/pull/4285\n- remove boa_profiler and profiler calls. update docs. (#4272) by @Timkarx in https://github.com/boa-dev/boa/pull/4276\n- Add a #[boa(rename = ...)] attribute to TryFromJs and TryIntoJs derive macros by @hansl in https://github.com/boa-dev/boa/pull/4286\n- Add a js_value! macro to allow creation of JsValue from JSON-like DSL by @hansl in https://github.com/boa-dev/boa/pull/4282\n- Bump baptiste0928/cargo-install from 3.3.0 to 3.3.1 in the ci-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4295\n- Bump the rust-dependencies group with 4 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4296\n- Update phf requirement from 0.11.2 to 0.12.1 in /tests/fuzz in the fuzz-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4297\n- Fix `JsValue::mul` to handle zero times a negative integer by @Rafferty97 in https://github.com/boa-dev/boa/pull/4303\n- Move the URL class to using the boa_class macro by @hansl in https://github.com/boa-dev/boa/pull/4294\n- Hint branch predictor that surrogate pairs are rare by @cijiugechu in https://github.com/boa-dev/boa/pull/4312\n- cli: use `mimalloc` as global allocator on windows by @cijiugechu in https://github.com/boa-dev/boa/pull/4314\n- Refactor the `Binding` modifiers to use bitflags by @cijiugechu in https://github.com/boa-dev/boa/pull/4316\n- Implement type erased `Gc` by @HalidOdat in https://github.com/boa-dev/boa/pull/4291\n- inline `Gc::inner_ptr` by @cijiugechu in https://github.com/boa-dev/boa/pull/4317\n- Shrink `JsStr` from 24 to 16 bytes by @HalidOdat in https://github.com/boa-dev/boa/pull/4322\n- Bump tokio from 1.45.1 to 1.46.1 in the rust-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4324\n- Refactor `JsObject` to always be size 8 by @raskad in https://github.com/boa-dev/boa/pull/4287\n- Add a new `Nullable` type that deserialize null to `Nullable::::Null` by @hansl in https://github.com/boa-dev/boa/pull/4325\n- Refactor `JsString`'s static string tagging by @HalidOdat in https://github.com/boa-dev/boa/pull/4334\n- Bump the rust-dependencies group with 6 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4335\n- Implement native backtrace positions by @HalidOdat in https://github.com/boa-dev/boa/pull/4306\n- Fix documentation for NativeFunction::from_async_fn by @jedel1043 in https://github.com/boa-dev/boa/pull/4344\n- Bump the rust-dependencies group with 2 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4347\n- Bump temporal_rs version to v0.0.11 by @nekevss in https://github.com/boa-dev/boa/pull/4348\n- Add an empty EmbeddedModuleLoader default by @hansl in https://github.com/boa-dev/boa/pull/4351\n- Fix a camel case bug by @hansl in https://github.com/boa-dev/boa/pull/4352\n- Temporal documentation update, part 1 by @nekevss in https://github.com/boa-dev/boa/pull/4353\n- Temporal documentation update, part 2 by @nekevss in https://github.com/boa-dev/boa/pull/4354\n- Temporal documentation, part 3 by @nekevss in https://github.com/boa-dev/boa/pull/4355\n- Temporal documentation update, part 4 by @nekevss in https://github.com/boa-dev/boa/pull/4356\n- Bump tokio from 1.46.1 to 1.47.0 in the rust-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4357\n- `Fetch` API (beta) by @hansl in https://github.com/boa-dev/boa/pull/4338\n- Remove `Box` from `Object`'s data member by @HalidOdat in https://github.com/boa-dev/boa/pull/4342\n- Bump the rust-dependencies group with 6 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4361\n- Add support for utf16(-le|be) and use the class API by @hansl in https://github.com/boa-dev/boa/pull/4358\n- Bump temporal_rs version to v0.0.12 by @nekevss in https://github.com/boa-dev/boa/pull/4367\n- Allow public access to the full position of a call frame by @hansl in https://github.com/boa-dev/boa/pull/4365\n- Bump the rust-dependencies group with 5 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4374\n- Bump slab from 0.4.10 to 0.4.11 by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4376\n- Implement queueMicrotask() and a test for it by @hansl in https://github.com/boa-dev/boa/pull/4359\n- Bump actions/checkout from 4 to 5 by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4386\n- Bump the rust-dependencies group with 4 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4387\n- Improve object display by @xubaiwang in https://github.com/boa-dev/boa/pull/4377\n- Fix broken PlainMonthDay.from tests by @nekevss in https://github.com/boa-dev/boa/pull/4389\n- Fix final Temporal.Instant test in built-ins test suite by @nekevss in https://github.com/boa-dev/boa/pull/4388\n- Remove alignment of property keys with identation by @hansl in https://github.com/boa-dev/boa/pull/4390\n- Bump temporal_rs version to v0.0.14 by @nekevss in https://github.com/boa-dev/boa/pull/4391\n- Update `Math.sumPrecise` to remove `SummationState` by @nekevss in https://github.com/boa-dev/boa/pull/4392\n- Update phf requirement from 0.12.1 to 0.13.1 in /tests/fuzz in the fuzz-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4384\n- Fix index access in `JumpTable` instruction by @HalidOdat in https://github.com/boa-dev/boa/pull/4372\n- Bump the rust-dependencies group with 5 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4395\n- Fix: prevent OOB panic in decodeURI by tightening percent-decoding bounds; add test for incomplete escape %E7%9A%8 (#4404) by @hamflx in https://github.com/boa-dev/boa/pull/4405\n- Implement a `JsValueStore` as well as structuredClone and tests by @hansl in https://github.com/boa-dev/boa/pull/4366\n- Bump baptiste0928/cargo-install from 3.3.1 to 3.3.2 in the ci-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4385\n- Update hashbrown requirement from 0.15.5 to 0.16.0 in /tests/fuzz in the fuzz-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4396\n- Replace the String producing Display logic to using a Formatter by @hansl in https://github.com/boa-dev/boa/pull/4393\n- Propagate AST errors to the user by @hansl in https://github.com/boa-dev/boa/pull/4408\n- Remove the boa_interop module by @hansl in https://github.com/boa-dev/boa/pull/4407\n- Fix final `Temporal.PlainTime.from` tests by @nekevss in https://github.com/boa-dev/boa/pull/4411\n- Bump the rust-dependencies group with 3 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4413\n- Bump actions/setup-node from 4 to 5 by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4412\n- Various quality of life improvements to the CLI by @hansl in https://github.com/boa-dev/boa/pull/4414\n- Implement `Date` and `RegExp` `JsValueStore` from/to by @hansl in https://github.com/boa-dev/boa/pull/4415\n- Use async channels for Atomics.waitAsync implementation by @jedel1043 in https://github.com/boa-dev/boa/pull/4418\n- Bump the rust-dependencies group across 1 directory with 7 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4421\n- Unblock Context::run_jobs when no timeouts need to be run by @hansl in https://github.com/boa-dev/boa/pull/4416\n- Fix 2 UBs, and cleanup `GcRefCell` by @hansl in https://github.com/boa-dev/boa/pull/4422\n- Bump temporal_rs version to v0.0.16 by @nekevss in https://github.com/boa-dev/boa/pull/4425\n- Fix the CLI when it is not attached to a TTY by @hansl in https://github.com/boa-dev/boa/pull/4424\n- Bump the rust-dependencies group with 6 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4429\n- Implement `JsValueStore` for `SharedArrayBuffer` and `postMessage` by @hansl in https://github.com/boa-dev/boa/pull/4417\n- fix: comment typo by @jasonmilad in https://github.com/boa-dev/boa/pull/4430\n- Editorconfig: specify indentation and dont overrule Makefile by @hansl in https://github.com/boa-dev/boa/pull/4446\n- Add a simple cargo-make to the project by @hansl in https://github.com/boa-dev/boa/pull/4437\n- Update to temporal_rs to 0.1 release by @nekevss in https://github.com/boa-dev/boa/pull/4433\n- Add minimal CI task to cargo-make by @nekevss in https://github.com/boa-dev/boa/pull/4448\n- Improve regular expression flags parsing by @hansl in https://github.com/boa-dev/boa/pull/4434\n- Bump the rust-dependencies group with 4 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4449\n- Only validate the RegExp, do not optimize/compile it by @hansl in https://github.com/boa-dev/boa/pull/4451\n- Bump peter-evans/create-or-update-comment from 4 to 5 by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4456\n- Bump peter-evans/find-comment from 3 to 4 by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4457\n- Bump bytemuck from 1.23.2 to 1.24.0 in the rust-dependencies group by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4458\n- Allow printing test262 comment on PRs from forks by @jedel1043 in https://github.com/boa-dev/boa/pull/4428\n- perf: Improve `Math.sumPrecise` Performance by @Gumichocopengin8 in https://github.com/boa-dev/boa/pull/4462\n- Bump the rust-dependencies group with 3 updates by @dependabot[bot] in https://github.com/boa-dev/boa/pull/4467\n\n### New Contributors\n\n- @zzzdong made their first contribution in https://github.com/boa-dev/boa/pull/4058\n- @albertleigh made their first contribution in https://github.com/boa-dev/boa/pull/4097\n- @heygsc made their first contribution in https://github.com/boa-dev/boa/pull/4124\n- @jamesthurley made their first contribution in https://github.com/boa-dev/boa/pull/4155\n- @lockels made their first contribution in https://github.com/boa-dev/boa/pull/4189\n- @changhc made their first contribution in https://github.com/boa-dev/boa/pull/4176\n- @created-by-varun made their first contribution in https://github.com/boa-dev/boa/pull/4198\n- @tomoverlund made their first contribution in https://github.com/boa-dev/boa/pull/4254\n- @Hemenguelbindi made their first contribution in https://github.com/boa-dev/boa/pull/4145\n- @Timkarx made their first contribution in https://github.com/boa-dev/boa/pull/4276\n- @Rafferty97 made their first contribution in https://github.com/boa-dev/boa/pull/4303\n- @cijiugechu made their first contribution in https://github.com/boa-dev/boa/pull/4307\n- @countradooku made their first contribution in https://github.com/boa-dev/boa/pull/4214\n- @xubaiwang made their first contribution in https://github.com/boa-dev/boa/pull/4381\n- @hamflx made their first contribution in https://github.com/boa-dev/boa/pull/4405\n- @BDeuDev made their first contribution in https://github.com/boa-dev/boa/pull/4419\n- @jasonmilad made their first contribution in https://github.com/boa-dev/boa/pull/4430\n- @hpp2334 made their first contribution in https://github.com/boa-dev/boa/pull/4453\n- @Gumichocopengin8 made their first contribution in https://github.com/boa-dev/boa/pull/4462\n- @mdrokz made their first contribution in https://github.com/boa-dev/boa/pull/4466\n- @rrogerc made their first contribution in https://github.com/boa-dev/boa/pull/4459\n\n**Full Changelog**: https://github.com/boa-dev/boa/compare/v0.20...v0.21\n\n## [0.20.0 (2024-12-05)](https://github.com/boa-dev/boa/compare/v0.19.1...v0.20.0)\n\n### Feature Enhancements\n\n- Add a js_error! macro to create opaque errors by @hansl in https://github.com/boa-dev/boa/pull/3920\n- Update `Instant` for new Temporal functionality by @nekevss in https://github.com/boa-dev/boa/pull/3928\n- Add a way to add setters/getters in js_class! by @hansl in https://github.com/boa-dev/boa/pull/3911\n- Fix lints from rustc 1.80.0 by @jedel1043 in https://github.com/boa-dev/boa/pull/3936\n- Add a JsError::from_rust constructor to create native errors from Rust by @hansl in https://github.com/boa-dev/boa/pull/3921\n- add some temporal methods by @jasonwilliams in https://github.com/boa-dev/boa/pull/3856\n- Allow a custom Logger to be used as the backend for boa_runtime::Console by @hansl in https://github.com/boa-dev/boa/pull/3943\n- Add more utility functions around modules and exports by @hansl in https://github.com/boa-dev/boa/pull/3937\n- Allow trailing commas in js_class functions by @hansl in https://github.com/boa-dev/boa/pull/3964\n- Implement `Atomics.pause` by @jedel1043 in https://github.com/boa-dev/boa/pull/3956\n- Add a clone_inner method to allow cloning of inner data by @hansl in https://github.com/boa-dev/boa/pull/3968\n- fix: ignore `debugger` statement by @shurizzle in https://github.com/boa-dev/boa/pull/3976\n- Add support for boa(rename = \"\") in TryFromJs derive by @hansl in https://github.com/boa-dev/boa/pull/3980\n- Add an \"iter()\" method to Js\\*Array for convenience by @hansl in https://github.com/boa-dev/boa/pull/3986\n- A simple module loader from a function by @hansl in https://github.com/boa-dev/boa/pull/3932\n- Add a way for js_error! macro to create native errors with message by @hansl in https://github.com/boa-dev/boa/pull/3971\n- Limit actions runs to 1 per branch and fix macos release by @jedel1043 in https://github.com/boa-dev/boa/pull/3996\n- Add TextEncoder, TextDecoder implementations to boa_runtime by @hansl in https://github.com/boa-dev/boa/pull/3994\n- Add TryFromJs for TypedJsFunction and more tests by @hansl in https://github.com/boa-dev/boa/pull/3981\n- Add context to the console `Logger` trait by @hansl in https://github.com/boa-dev/boa/pull/4005\n- Add a URL class to boa_runtime by @hansl in https://github.com/boa-dev/boa/pull/4004\n- Add a display_lossy() to write a JsString lossily by @hansl in https://github.com/boa-dev/boa/pull/4023\n- `TryIntoJs` trait and derive macro for it by @Nikita-str in https://github.com/boa-dev/boa/pull/3999\n- console.debug() should use a debug Logger method by @hansl in https://github.com/boa-dev/boa/pull/4019\n- `TryFromJs` from `JsMap` for `HashMap` & `BtreeMap` by @Nikita-str in https://github.com/boa-dev/boa/pull/3998\n- Add string builder to build `JsString` by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/3915\n\n### Bug Fixes\n\n- Implement `Math.pow` function according to ECMAScript specification by @magic-akari in https://github.com/boa-dev/boa/pull/3916\n- Fix temporal builtin properties by @nekevss in https://github.com/boa-dev/boa/pull/3930\n- Fix wrong `neg` operation by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/3926\n- Fix destructuring assignment evaluation order by @raskad in https://github.com/boa-dev/boa/pull/3934\n- Fix various parser idempotency issues and parsing errors by @raskad in https://github.com/boa-dev/boa/pull/3917\n- Implement new spec changes for `AsyncGenerator` by @jedel1043 in https://github.com/boa-dev/boa/pull/3950\n- Refactor ast function types by @raskad in https://github.com/boa-dev/boa/pull/3931\n- Fix `js_str` macro to correctly handle latin1 strings by @jedel1043 in https://github.com/boa-dev/boa/pull/3959\n- Allow dead code for code that is newly detected as unused by @hansl in https://github.com/boa-dev/boa/pull/3984\n- Allow warnings when running CI on release branches by @jedel1043 in https://github.com/boa-dev/boa/pull/3990\n- docs: Fix link to examples by @it-a-me in https://github.com/boa-dev/boa/pull/4007\n- `IntegerOrInfinity` `eq` bug fix by @Nikita-str in https://github.com/boa-dev/boa/pull/4010\n\n### Internal Improvements\n\n- Refactor `RawJsString`'s representation to make `JsString`s construction from string literal heap-allocation free by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/3935\n- Split default icu data into lazily deserialized parts by @jedel1043 in https://github.com/boa-dev/boa/pull/3948\n- Add clippy for denying print and eprints by @hansl in https://github.com/boa-dev/boa/pull/3967\n- Refactor iterator APIs to be on parity with the latest spec by @jedel1043 in https://github.com/boa-dev/boa/pull/3962\n- Add support for Trace, Finalize and JsData for Convert<> by @hansl in https://github.com/boa-dev/boa/pull/3970\n- use with_capacity to reduce re-allocations fixes #3896 by @jasonwilliams in https://github.com/boa-dev/boa/pull/3961\n- add nightly build by @jasonwilliams in https://github.com/boa-dev/boa/pull/4026\n- Patch the indentation in nightly_build.yml by @nekevss in https://github.com/boa-dev/boa/pull/4028\n- Update night build's rename binary step by @nekevss in https://github.com/boa-dev/boa/pull/4032\n- Use upload-rust-binary-action for nightly release by @nekevss in https://github.com/boa-dev/boa/pull/4040\n- Fix `ref` value in nightly and add target to nightly release by @nekevss in https://github.com/boa-dev/boa/pull/4042\n- Reduce environment allocations by @raskad in https://github.com/boa-dev/boa/pull/4002\n\n### Other Changes\n\n- Implement more Temporal functionality by @nekevss in https://github.com/boa-dev/boa/pull/3924\n- Add a Source::with_path method to set the path on a Source by @hansl in https://github.com/boa-dev/boa/pull/3941\n- Add spec edition 15 to the tester by @jedel1043 in https://github.com/boa-dev/boa/pull/3957\n- Rename as_promise to as_promise_object and add as_promise -> JsPromise by @hansl in https://github.com/boa-dev/boa/pull/3965\n- Build out partial record functionality, property bag construction, and `with` methods by @nekevss in https://github.com/boa-dev/boa/pull/3955\n- Enable CI for release branches by @jedel1043 in https://github.com/boa-dev/boa/pull/3987\n- Add a display type for JsString to allow formatting without allocations by @hansl in https://github.com/boa-dev/boa/pull/3951\n- Add TryIntoJsResult for vectors by @hansl in https://github.com/boa-dev/boa/pull/3993\n- Add tests from WPT and fix them in the Console by @hansl in https://github.com/boa-dev/boa/pull/3979\n- Update changelog for v0.19.1 by @jedel1043 in https://github.com/boa-dev/boa/pull/3995\n- Implement register allocation by @HalidOdat in https://github.com/boa-dev/boa/pull/3942\n- Implement scope analysis and local variables by @raskad in https://github.com/boa-dev/boa/pull/3988\n- `JsValue::to_json` fix integer property keys by @Nikita-str in https://github.com/boa-dev/boa/pull/4011\n- Some optimizations on `Error` by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/4020\n- Option::None should try into Undefined, not Null by @hansl in https://github.com/boa-dev/boa/pull/4029\n- Some string optimizations by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/4030\n- Add a JsPromise::from_result for convenience by @hansl in https://github.com/boa-dev/boa/pull/4039\n- Fix misspelled permissions in nightly build action by @nekevss in https://github.com/boa-dev/boa/pull/4041\n- Remove dockerfile from documentation by @4yman-0 in https://github.com/boa-dev/boa/pull/4046\n- Bump dependencies with breaking changes by @jedel1043 in https://github.com/boa-dev/boa/pull/4050\n- Migrate to fast-float2 by @jedel1043 in https://github.com/boa-dev/boa/pull/4052\n\n### New Contributors\n\n- @magic-akari made their first contribution in https://github.com/boa-dev/boa/pull/3916\n- @shurizzle made their first contribution in https://github.com/boa-dev/boa/pull/3976\n- @it-a-me made their first contribution in https://github.com/boa-dev/boa/pull/4007\n- @Nikita-str made their first contribution in https://github.com/boa-dev/boa/pull/4010\n- @4yman-0 made their first contribution in https://github.com/boa-dev/boa/pull/4046\n\n**Full Changelog**: https://github.com/boa-dev/boa/compare/v0.19...v0.20.0\n\n## [0.19.1 (2024-09-11)](https://github.com/boa-dev/boa/compare/v0.19...v0.19.1)\n\n### Bug Fixes\n\n- Implement new spec changes for `AsyncGenerator` by @jedel1043 in https://github.com/boa-dev/boa/pull/3950\n- Allow dead code for code that is newly detected as unused by @hansl in https://github.com/boa-dev/boa/pull/3984\n- Allow warnings when running CI on release branches by @jedel1043 in https://github.com/boa-dev/boa/pull/3990\n\n### Internal Improvements\n\n- Add spec edition 15 to the tester by @jedel1043 in https://github.com/boa-dev/boa/pull/3957\n- Enable CI for release branches by @jedel1043 in https://github.com/boa-dev/boa/pull/3987\n\n**Full Changelog**: https://github.com/boa-dev/boa/compare/v0.19...v0.19.1\n\n## [0.19.0 (2024-07-08)](https://github.com/boa-dev/boa/compare/v0.18...v0.19)\n\n### Feature Enhancements\n\n- Add release binary striping by @Razican in https://github.com/boa-dev/boa/pull/3727\n- Added NPM publish workflow by @Razican in https://github.com/boa-dev/boa/pull/3725\n- Remove references to dev docs and npm dependencies by @jedel1043 in https://github.com/boa-dev/boa/pull/3787\n- Cleanup tester deps and patterns by @jedel1043 in https://github.com/boa-dev/boa/pull/3792\n- Build docs.rs docs with all features enabled by @jedel1043 in https://github.com/boa-dev/boa/pull/3794\n- Add a new type Convert<> to convert values by @hansl in https://github.com/boa-dev/boa/pull/3786\n- Add functions to create modules from a JSON value by @hansl in https://github.com/boa-dev/boa/pull/3804\n- Add an embed_module!() macro to boa_interop by @hansl in https://github.com/boa-dev/boa/pull/3784\n- Add a ContextData struct to inject host defined types from the context by @hansl in https://github.com/boa-dev/boa/pull/3802\n- Implement object keys access by @HalidOdat in https://github.com/boa-dev/boa/pull/3832\n- Group dependabot updates by @jedel1043 in https://github.com/boa-dev/boa/pull/3863\n- Adding TryFromJs implementations for BTreeMap and HashMap by @hansl in https://github.com/boa-dev/boa/pull/3844\n- Adding TryFromJs implementations for tuples by @hansl in https://github.com/boa-dev/boa/pull/3843\n- Add a js_class to implement the Class trait without boilerplate by @hansl in https://github.com/boa-dev/boa/pull/3872\n- Implement lossless TryFromJs for integers from f64 by @HalidOdat in https://github.com/boa-dev/boa/pull/3907\n\n### Bug Fixes\n\n- Close for-of iterator when the loop body throws by @raskad in https://github.com/boa-dev/boa/pull/3734\n- Add default value handling for destructuring property access arrays by @raskad in https://github.com/boa-dev/boa/pull/3738\n- Fix invalid syntax errors for allowed `let` as variable names by @raskad in https://github.com/boa-dev/boa/pull/3743\n- Fix parsing of `async` in for-of loops by @raskad in https://github.com/boa-dev/boa/pull/3745\n- Fix parsing of binding identifier in try catch parameters by @raskad in https://github.com/boa-dev/boa/pull/3752\n- Add missing environment creation in initial iteration of for loop by @raskad in https://github.com/boa-dev/boa/pull/3751\n- chore: Update README link to reflect new site paths by @NickTomlin in https://github.com/boa-dev/boa/pull/3793\n- Fix order of `ToString` call in `Function` constructor by @HalidOdat in https://github.com/boa-dev/boa/pull/3820\n- Fix CI for nextest step by @jedel1043 in https://github.com/boa-dev/boa/pull/3862\n- Fix base objects in `with` statements by @raskad in https://github.com/boa-dev/boa/pull/3870\n- Fix boa cli history by @raskad in https://github.com/boa-dev/boa/pull/3875\n- Fix hashbang comments by using proper goal symbols by @raskad in https://github.com/boa-dev/boa/pull/3876\n- Fix AsyncGenerator to correctly handle `return` inside `then` by @jedel1043 in https://github.com/boa-dev/boa/pull/3879\n- Fix HomeObject for private class methods by @raskad in https://github.com/boa-dev/boa/pull/3897\n- Fix evaluation order in destructive property assignments by @raskad in https://github.com/boa-dev/boa/pull/3895\n\n### Internal Improvements\n\n- Apply new clippy lints for rustc 1.77 by @jedel1043 in https://github.com/boa-dev/boa/pull/3759\n- Change dependabot interval to weekly by @jedel1043 in https://github.com/boa-dev/boa/pull/3758\n- Dense array storage variants for `i32` and `f64` by @HalidOdat in https://github.com/boa-dev/boa/pull/3760\n- Optimize number to `PropertyKey` conversion by @HalidOdat in https://github.com/boa-dev/boa/pull/3769\n- don't run test262 on push by @jasonwilliams in https://github.com/boa-dev/boa/pull/3774\n- Check that `min <= max` in `clamp_finite` by @jedel1043 in https://github.com/boa-dev/boa/pull/3699\n- Decouple `Context` from `ByteCompiler` by @HalidOdat in https://github.com/boa-dev/boa/pull/3829\n- Implement latin1 encoded `JsString`s by @HalidOdat in https://github.com/boa-dev/boa/pull/3450\n- Replace `js_str` with `js_string` in examples by @getong in https://github.com/boa-dev/boa/pull/3836\n- Separate `JsString` into its own crate by @HalidOdat in https://github.com/boa-dev/boa/pull/3837\n- Bump temporal_rs to latest commit by @jedel1043 in https://github.com/boa-dev/boa/pull/3880\n- Remove `FormalParameterList` from `CodeBlock` by @HalidOdat in https://github.com/boa-dev/boa/pull/3882\n\n### Other Changes\n\n- Fix a few Duration code typos by @robot-head in https://github.com/boa-dev/boa/pull/3730\n- Add a try_from_js implementation for Vec (accept any Array-like) by @hansl in https://github.com/boa-dev/boa/pull/3755\n- Swap to Duration::round from temporal_rs by @robot-head in https://github.com/boa-dev/boa/pull/3731\n- Cache `this` value by @HalidOdat in https://github.com/boa-dev/boa/pull/3771\n- Allow deserialization of missing objects properties into Option<> by @hansl in https://github.com/boa-dev/boa/pull/3767\n- Optimize Regex match check by @HalidOdat in https://github.com/boa-dev/boa/pull/3779\n- Add a boa_interop crate by @hansl in https://github.com/boa-dev/boa/pull/3772\n- Add a path to Module (and expose it in Referrer) by @hansl in https://github.com/boa-dev/boa/pull/3783\n- Properly resolve paths in SimpleModuleLoader and add path to Referrer::Script by @hansl in https://github.com/boa-dev/boa/pull/3791\n- Fix SimpleModuleLoader on Windows by @hansl in https://github.com/boa-dev/boa/pull/3795\n- Add more utility traits and funtions to boa_interop by @hansl in https://github.com/boa-dev/boa/pull/3773\n- Implement Promise.try() by @linusg in https://github.com/boa-dev/boa/pull/3800\n- Implement TryFromJs for Either by @hansl in https://github.com/boa-dev/boa/pull/3822\n- Fix Rust 1.78.0 Clippy lints by @HalidOdat in https://github.com/boa-dev/boa/pull/3838\n- Switch from actions-rs/toolchain to dtolnay/rust-toolchain by @raskad in https://github.com/boa-dev/boa/pull/3845\n- Replace archived github actions from actions-rs by @raskad in https://github.com/boa-dev/boa/pull/3848\n- Add matrix badge and update communication to include matrix by @nekevss in https://github.com/boa-dev/boa/pull/3865\n- Add groupCollapsed by @leoflalv in https://github.com/boa-dev/boa/pull/3867\n- Bump ICU4X to 1.5 and cleanup Intl by @jedel1043 in https://github.com/boa-dev/boa/pull/3868\n- Update regress to v0.10.0 by @raskad in https://github.com/boa-dev/boa/pull/3869\n- Combine `HasProperty` and `Get` operations when possible by @raskad in https://github.com/boa-dev/boa/pull/3883\n- Remove some environment clones by @raskad in https://github.com/boa-dev/boa/pull/3884\n- Refactor call frame access to avoid panic checks by @raskad in https://github.com/boa-dev/boa/pull/3888\n- Remove `Temporal.Calendar` and `Temporal.TimeZone` by @jedel1043 in https://github.com/boa-dev/boa/pull/3890\n- Update Temporal rounding and implement additional methods by @nekevss in https://github.com/boa-dev/boa/pull/3892\n- format code in comments by @jasonwilliams in https://github.com/boa-dev/boa/pull/3902\n- Updates to temporal_rs version and temporal methods by @nekevss in https://github.com/boa-dev/boa/pull/3900\n- Patch regression from change to to-relative-to-object by @nekevss in https://github.com/boa-dev/boa/pull/3906\n- Add `get_unchecked` method to `JsString` and `JsStr` by @CrazyboyQCD in https://github.com/boa-dev/boa/pull/3898\n- bump gc threshold by @jasonwilliams in https://github.com/boa-dev/boa/pull/3908\n- update versions and ABOUT files by @jasonwilliams in https://github.com/boa-dev/boa/pull/3903\n- Cleanup README.md and contributor documentation by @jedel1043 in https://github.com/boa-dev/boa/pull/3909\n- Refactor environment stack to remove some panics by @raskad in https://github.com/boa-dev/boa/pull/3893\n\n### New Contributors\n\n- @robot-head made their first contribution in https://github.com/boa-dev/boa/pull/3730\n- @hansl made their first contribution in https://github.com/boa-dev/boa/pull/3755\n- @NickTomlin made their first contribution in https://github.com/boa-dev/boa/pull/3793\n- @linusg made their first contribution in https://github.com/boa-dev/boa/pull/3800\n- @getong made their first contribution in https://github.com/boa-dev/boa/pull/3836\n- @leoflalv made their first contribution in https://github.com/boa-dev/boa/pull/3867\n- @CrazyboyQCD made their first contribution in https://github.com/boa-dev/boa/pull/3898\n\n**Full Changelog**: https://github.com/boa-dev/boa/compare/v0.18...v0.19\n\n## [0.18.0 (2024-03-04)](https://github.com/boa-dev/boa/compare/v0.17...v0.18)\n\n### Feature Enhancements\n\n- Format let-else expressions by @jedel1043 in https://github.com/boa-dev/boa/pull/3102\n- Add regexp indices (`d` flag) support by @dirkdev98 in https://github.com/boa-dev/boa/pull/3094\n- Add missing 'unscopables' to `Array.prototype[@@unscopables]` by @dirkdev98 in https://github.com/boa-dev/boa/pull/3111\n- Updated Fuzzer dependencies and added them to Dependabot by @Razican in https://github.com/boa-dev/boa/pull/3124\n- Implement `findLast` and `findLastIndex` on TypedArray by @dirkdev98 in https://github.com/boa-dev/boa/pull/3135\n- Implement i128/u128 to JsBigInt conversions by @AlvinKuruvilla in https://github.com/boa-dev/boa/pull/3129\n- Implement `String.prototype.isWellFormed` and `String.prototype.toWellFormed` by @raskad in https://github.com/boa-dev/boa/pull/3187\n- Clarify usage section in `README.md` by @postmeback in https://github.com/boa-dev/boa/pull/3092\n- Log traces even without message (boa_runtime) by @kelbazz in https://github.com/boa-dev/boa/pull/3193\n- Implement ephemeron-based weak map by @jedel1043 in https://github.com/boa-dev/boa/pull/3052\n- Improve bytecompiler bytecode generation. by @HalidOdat in https://github.com/boa-dev/boa/pull/3188\n- Add `Instruction` and `InstructionIterator` by @HalidOdat in https://github.com/boa-dev/boa/pull/3201\n- Add ECMAScript 14 to `boa_tester` by @jedel1043 in https://github.com/boa-dev/boa/pull/3273\n- Bump `rust-version` to 1.71 by @jedel1043 in https://github.com/boa-dev/boa/pull/3290\n- Lazily download `test262` repository by @HalidOdat in https://github.com/boa-dev/boa/pull/3214\n- Implement `Gc::new_cyclic` by @jedel1043 in https://github.com/boa-dev/boa/pull/3292\n- Implement `Intl.PluralRules` by @jedel1043 in https://github.com/boa-dev/boa/pull/3298\n- Implement step 5 in `RegExp` constructor by @HalidOdat in https://github.com/boa-dev/boa/pull/3305\n- Replace #[deny] with #[warn] by @jedel1043 in https://github.com/boa-dev/boa/pull/3309\n- Bump ICU4X to 1.3 by @jedel1043 in https://github.com/boa-dev/boa/pull/3306\n- Migrate to workspace deps by @jedel1043 in https://github.com/boa-dev/boa/pull/3313\n- Implement `[[HostDefined]]` field on `Realm`s by @HalidOdat in https://github.com/boa-dev/boa/pull/2952\n- Introduce experimental features by @jedel1043 in https://github.com/boa-dev/boa/pull/3318\n- Introduce a `Class` map by @jedel1043 in https://github.com/boa-dev/boa/pull/3315\n- Fix `Function.prototype.toString()` by @HalidOdat in https://github.com/boa-dev/boa/pull/3374\n- First portion of the Temporal implementation by @nekevss in https://github.com/boa-dev/boa/pull/3277\n- Update feature flags to specific feature flag by @nekevss in https://github.com/boa-dev/boa/pull/3376\n- Implement `[[HostDefined]]` for `Module` and `Script` by @arexon in https://github.com/boa-dev/boa/pull/3381\n- Implement synthetic modules by @jedel1043 in https://github.com/boa-dev/boa/pull/3294\n- Prevent `test262` repository update if not needed by @HalidOdat in https://github.com/boa-dev/boa/pull/3386\n- Implement `SharedArrayBuffer` by @jedel1043 in https://github.com/boa-dev/boa/pull/3384\n- Add `Context::create_realm` by @johnyob in https://github.com/boa-dev/boa/pull/3369\n- Introduce a thread safe version of `JsError` by @jedel1043 in https://github.com/boa-dev/boa/pull/3398\n- Implement asynchronous evaluation of scripts by @jedel1043 in https://github.com/boa-dev/boa/pull/3044\n- Feature `get/set $boa.limits.stack` by @HalidOdat in https://github.com/boa-dev/boa/pull/3385\n- Implement `change-array-by-copy` methods by @jedel1043 in https://github.com/boa-dev/boa/pull/3412\n- Implement the `array-grouping` proposal by @jedel1043 in https://github.com/boa-dev/boa/pull/3420\n- Implement `Atomics` builtin by @jedel1043 in https://github.com/boa-dev/boa/pull/3394\n- Migrate to workspace lints by @jedel1043 in https://github.com/boa-dev/boa/pull/3334\n- Bump ICU4X to 1.4 and finish Intl impls with new APIs by @jedel1043 in https://github.com/boa-dev/boa/pull/3469\n- Class: Switch `make_data` parameter from `this` to `new_target` by @johnyob in https://github.com/boa-dev/boa/pull/3478\n- Add utility methods to the `Class` trait by @jedel1043 in https://github.com/boa-dev/boa/pull/3488\n- Simplify `Icu` API by @jedel1043 in https://github.com/boa-dev/boa/pull/3503\n- Add UTF-16 input parsing by @raskad in https://github.com/boa-dev/boa/pull/3538\n- Remove allocations from `HostDefined::get_many_mut` by @jedel1043 in https://github.com/boa-dev/boa/pull/3606\n- Implement getter for `ArrayBuffer` data by @HalidOdat in https://github.com/boa-dev/boa/pull/3610\n- Implement non-erased `JsObject`s by @jedel1043 in https://github.com/boa-dev/boa/pull/3618\n- Update regress to v0.8.0 and use UTF16 / UCS2 matching by @raskad in https://github.com/boa-dev/boa/pull/3627\n- Cleanup 262 tester and stabilize some experimental features by @jedel1043 in https://github.com/boa-dev/boa/pull/3632\n- Improve typing of `DataView` and related objects by @jedel1043 in https://github.com/boa-dev/boa/pull/3626\n- Close sync iterator when async wrapper yields rejection by @jedel1043 in https://github.com/boa-dev/boa/pull/3633\n- Implement resizable buffers by @jedel1043 in https://github.com/boa-dev/boa/pull/3634\n- Implement stage 3 feature \"arraybuffer-transfer\" by @jedel1043 in https://github.com/boa-dev/boa/pull/3649\n- Implement prototype of `NumberFormat` by @jedel1043 in https://github.com/boa-dev/boa/pull/3669\n- Add example for async module fetches by @jedel1043 in https://github.com/boa-dev/boa/pull/3012\n- Js typed array methods by @AngeloChecked in https://github.com/boa-dev/boa/pull/3481\n- Create tool to regenerate `ABOUT.md` by @jedel1043 in https://github.com/boa-dev/boa/pull/3692\n- Implement RegExp `v` flag by @raskad in https://github.com/boa-dev/boa/pull/3695\n\n### Bug Fixes\n\n- Allow escaped yield and await in labelled statement by @raskad in https://github.com/boa-dev/boa/pull/3117\n- `TypedArray.prototype.values()` and `TypedArray.prototype[@@iterator]` should be equal by @HalidOdat in https://github.com/boa-dev/boa/pull/3096\n- Fix TypedArrayConstructors tests by @raskad in https://github.com/boa-dev/boa/pull/3171\n- Close iterator after generator return call while array destructuring assignment by @HalidOdat in https://github.com/boa-dev/boa/pull/3164\n- Fix remaining TypedArray bugs by @raskad in https://github.com/boa-dev/boa/pull/3186\n- Add early errors for `LexicalDeclaration` by @raskad in https://github.com/boa-dev/boa/pull/3207\n- Fix switch statement `break` and `continue` return values by @raskad in https://github.com/boa-dev/boa/pull/3205\n- Fix GitHub coverage workflow by @HalidOdat in https://github.com/boa-dev/boa/pull/3288\n- Fix tagged template `this` in strict mode by @HalidOdat in https://github.com/boa-dev/boa/pull/3307\n- fix: add 'static lifetime by @mattsse in https://github.com/boa-dev/boa/pull/3297\n- Fix class inherit from `null` by @HalidOdat in https://github.com/boa-dev/boa/pull/3312\n- Fix anonymous function name in cover assignment by @raskad in https://github.com/boa-dev/boa/pull/3325\n- Add `NonMaxU32` as integer variant for `PropertyKey` by @raskad in https://github.com/boa-dev/boa/pull/3321\n- Add missing class name binding by @raskad in https://github.com/boa-dev/boa/pull/3328\n- Truncate environment stack on non-caught native error by @HalidOdat in https://github.com/boa-dev/boa/pull/3331\n- Fix regular expression construction by @HalidOdat in https://github.com/boa-dev/boa/pull/3338\n- Fix `super()` construction with default parameters by @HalidOdat in https://github.com/boa-dev/boa/pull/3339\n- Fix static class element evaluation order by @raskad in https://github.com/boa-dev/boa/pull/3327\n- Fix detection of runtime limits for accessors by @jedel1043 in https://github.com/boa-dev/boa/pull/3335\n- Fix `Number.prototype.toFixed()` by @HalidOdat in https://github.com/boa-dev/boa/pull/2898\n- Check `eval` realm before call by @HalidOdat in https://github.com/boa-dev/boa/pull/3375\n- Evaluate all parts of `class` in strict mode by @HalidOdat in https://github.com/boa-dev/boa/pull/3383\n- Fix var declaration for deleted binding locator by @raskad in https://github.com/boa-dev/boa/pull/3387\n- Fix await flag in class constructor by @raskad in https://github.com/boa-dev/boa/pull/3388\n- Fix compilation for targets without `AtomicU64` by @jedel1043 in https://github.com/boa-dev/boa/pull/3399\n- Update `regex.match` spec and code by @raskad in https://github.com/boa-dev/boa/pull/3462\n- `Context` independent `CodeBlock`s by @HalidOdat in https://github.com/boa-dev/boa/pull/3424\n- Fix a Parser Idempotency Issue by @veera-sivarajan in https://github.com/boa-dev/boa/pull/3172\n- Non recursive gc trace by @HalidOdat in https://github.com/boa-dev/boa/pull/3508\n- Fix invalid return value when closing an iterator by @raskad in https://github.com/boa-dev/boa/pull/3567\n- Implement Date parsing according to the spec by @raskad in https://github.com/boa-dev/boa/pull/3564\n- `Date` refactor by @raskad in https://github.com/boa-dev/boa/pull/3595\n- Fix regexp `toString` method by @raskad in https://github.com/boa-dev/boa/pull/3608\n- Fix escaping in `RegExp.prototype.source` by @raskad in https://github.com/boa-dev/boa/pull/3619\n- Fix line terminators in template strings by @raskad in https://github.com/boa-dev/boa/pull/3641\n- Consider strict + no-strict tests as a single test by @jedel1043 in https://github.com/boa-dev/boa/pull/3675\n- Preserve `.exe` suffix for Windows releases by @HalidOdat in https://github.com/boa-dev/boa/pull/3680\n\n### Internal Improvements\n\n- Move `RefCell` of `CompileTimeEnvironment`s to field `bindings` by @HalidOdat in https://github.com/boa-dev/boa/pull/3108\n- Change `name` field type in `CodeBlock` to `JsString` by @HalidOdat in https://github.com/boa-dev/boa/pull/3107\n- Refactor `Array.prototype.find*` and TypedArray variants to use `FindViaPredicate` by @dirkdev98 in https://github.com/boa-dev/boa/pull/3134\n- Fix 1.71.0 lints by @RageKnify in https://github.com/boa-dev/boa/pull/3140\n- Clippy updates: add panics and etc. by @nekevss in https://github.com/boa-dev/boa/pull/3235\n- Remove unused class environments by @raskad in https://github.com/boa-dev/boa/pull/3332\n- Improve highlighter performance by @jedel1043 in https://github.com/boa-dev/boa/pull/3341\n- Cleanup `get_option` and calls to the function by @jedel1043 in https://github.com/boa-dev/boa/pull/3355\n- Fix new lints for Rust 1.73 by @jedel1043 in https://github.com/boa-dev/boa/pull/3361\n- Refactor compile time environment handling by @raskad in https://github.com/boa-dev/boa/pull/3365\n- Update all dependencies by @jedel1043 in https://github.com/boa-dev/boa/pull/3400\n- Optimize `shift` for dense arrays by @jedel1043 in https://github.com/boa-dev/boa/pull/3405\n- Disallow changing type of already created objects by @jedel1043 in https://github.com/boa-dev/boa/pull/3410\n- Merge `CodeBlock` constant pools by @HalidOdat in https://github.com/boa-dev/boa/pull/3413\n- Move ordinary function `[[ConstructorKind]]` to `CodeBlock` by @HalidOdat in https://github.com/boa-dev/boa/pull/3439\n- Move `FunctionKind` to `CodeBlock` by @HalidOdat in https://github.com/boa-dev/boa/pull/3440\n- Unify generator and ordinary function creation by @HalidOdat in https://github.com/boa-dev/boa/pull/3441\n- Move `arguments` object creation to bytecode by @HalidOdat in https://github.com/boa-dev/boa/pull/3432\n- Move parameter environment creation to bytecode by @HalidOdat in https://github.com/boa-dev/boa/pull/3433\n- Prevent `DefVar` opcode emit for global binding by @HalidOdat in https://github.com/boa-dev/boa/pull/3453\n- Transition `Intl` types to `NativeObject` API by @jedel1043 in https://github.com/boa-dev/boa/pull/3491\n- Reduce `WeakGc` memory usage by @HalidOdat in https://github.com/boa-dev/boa/pull/3492\n- Migrate `Temporal` to its own crate. by @nekevss in https://github.com/boa-dev/boa/pull/3461\n- Reestructure repo and CI improvements by @jedel1043 in https://github.com/boa-dev/boa/pull/3505\n- Move `PromiseCapability` to stack by @HalidOdat in https://github.com/boa-dev/boa/pull/3528\n- Fix rust 1.75 lints by @raskad in https://github.com/boa-dev/boa/pull/3540\n- Remove double indirection in module types by @jedel1043 in https://github.com/boa-dev/boa/pull/3640\n- Fix clippy warnings for rustc 1.76 by @jedel1043 in https://github.com/boa-dev/boa/pull/3668\n- Migrate to `temporal_rs` crate by @nekevss in https://github.com/boa-dev/boa/pull/3694\n\n### Other Changes\n\n- Removed time 0.1 dependency, updated dependencies by @Razican in https://github.com/boa-dev/boa/pull/3122\n- Add new CLI options to usage in README by @Razican in https://github.com/boa-dev/boa/pull/3123\n- Find roots when running GC rather than runtime by @tunz in https://github.com/boa-dev/boa/pull/3109\n- Re-enable must_use clippy rule by @tunz in https://github.com/boa-dev/boa/pull/3180\n- Refactor environment, exception handling and jumping in VM by @HalidOdat in https://github.com/boa-dev/boa/pull/3059\n- Refactor `Context::run()` method by @HalidOdat in https://github.com/boa-dev/boa/pull/3179\n- Added examples by @postmeback in https://github.com/boa-dev/boa/pull/3141\n- Use main stack for calling ordinary functions by @HalidOdat in https://github.com/boa-dev/boa/pull/3185\n- Update license field following SPDX 2.1 license expression standard by @frisoft in https://github.com/boa-dev/boa/pull/3209\n- Store active runnable and active function in `CallFrame` by @HalidOdat in https://github.com/boa-dev/boa/pull/3197\n- Added MSRV check by @Razican in https://github.com/boa-dev/boa/pull/3291\n- Reintroduce publish CI job by @jedel1043 in https://github.com/boa-dev/boa/pull/3308\n- Format code snippets in docs by @jedel1043 in https://github.com/boa-dev/boa/pull/3317\n- Remove direct conversion from `&str` to `JsValue`/`PropertyKey`. by @jedel1043 in https://github.com/boa-dev/boa/pull/3319\n- `icu_properties` default features to true by @nekevss in https://github.com/boa-dev/boa/pull/3326\n- Varying length instruction operands by @HalidOdat in https://github.com/boa-dev/boa/pull/3253\n- Improve CI testing by @jedel1043 in https://github.com/boa-dev/boa/pull/3333\n- Refactor function internal methods by @HalidOdat in https://github.com/boa-dev/boa/pull/3322\n- Make environments opcodes use varying operands by @HalidOdat in https://github.com/boa-dev/boa/pull/3340\n- Bump test262 by @jedel1043 in https://github.com/boa-dev/boa/pull/3349\n- Refactor ordinary VM calling by @HalidOdat in https://github.com/boa-dev/boa/pull/3295\n- Fix Array.join when the array contains itself by @ahaoboy in https://github.com/boa-dev/boa/pull/3406\n- Rename master workflow to main by @Razican in https://github.com/boa-dev/boa/pull/3409\n- Cleaned up a couple of Github action warnings by @Razican in https://github.com/boa-dev/boa/pull/3417\n- Temporal duration update and cleanup by @nekevss in https://github.com/boa-dev/boa/pull/3443\n- Progress on Duration's round/total method updates by @nekevss in https://github.com/boa-dev/boa/pull/3451\n- Simplify all extensions APIs of `Context` by @jedel1043 in https://github.com/boa-dev/boa/pull/3456\n- `[[HostDefined]]` Improvements by @johnyob in https://github.com/boa-dev/boa/pull/3460\n- Make well_known_symbols functions pub by @tj825 in https://github.com/boa-dev/boa/pull/3465\n- Use `Vec` for keeping track of gc objects by @HalidOdat in https://github.com/boa-dev/boa/pull/3493\n- Implement `Inline Caching` by @HalidOdat in https://github.com/boa-dev/boa/pull/2767\n- Migrate `ISO8601` parsing to `boa_temporal` by @nekevss in https://github.com/boa-dev/boa/pull/3500\n- Implement erased objects by @jedel1043 in https://github.com/boa-dev/boa/pull/3494\n- Build out ZonedDateTime, TimeZone, and Instant by @nekevss in https://github.com/boa-dev/boa/pull/3497\n- `boa_temporal` structure changes and docs update by @nekevss in https://github.com/boa-dev/boa/pull/3504\n- Refactor vm calling convention to allow locals by @HalidOdat in https://github.com/boa-dev/boa/pull/3496\n- Temporal Parser Cleanup/Fixes by @nekevss in https://github.com/boa-dev/boa/pull/3521\n- Refactor Temporal Calendar API for `AnyCalendar` and fields by @nekevss in https://github.com/boa-dev/boa/pull/3522\n- Update `boa_temporal` Time Zone design by @nekevss in https://github.com/boa-dev/boa/pull/3543\n- Implement `DifferenceInstant` and related refactor by @nekevss in https://github.com/boa-dev/boa/pull/3568\n- Run `cargo update` on fuzz crate by @jedel1043 in https://github.com/boa-dev/boa/pull/3607\n- Temporal `Instant` migration cont. and related changes by @nekevss in https://github.com/boa-dev/boa/pull/3601\n- Temporal: Update `Date` builtin with `boa_temporal` and fixes by @nekevss in https://github.com/boa-dev/boa/pull/3614\n- Temporal: Build out `Time` and its methods by @nekevss in https://github.com/boa-dev/boa/pull/3613\n- Temporal: Enable temporal tests by @nekevss in https://github.com/boa-dev/boa/pull/3620\n- Fix tests results upload by @raskad in https://github.com/boa-dev/boa/pull/3635\n- Temporal: `DateTime` and `PlainDateTime` functionality by @nekevss in https://github.com/boa-dev/boa/pull/3628\n- Temporal: Initial `PlainTime` build out by @nekevss in https://github.com/boa-dev/boa/pull/3621\n- Ignore `Cargo.lock` in fuzzer by @jedel1043 in https://github.com/boa-dev/boa/pull/3636\n- Temporal: attribute/property and custom calendar fixes by @nekevss in https://github.com/boa-dev/boa/pull/3639\n- Docs: Update boa's main README.md by @nekevss in https://github.com/boa-dev/boa/pull/3650\n- Bump time from 0.3.31 to 0.3.33 by @jedel1043 in https://github.com/boa-dev/boa/pull/3652\n- Temporal: Refactor Calendar protocol for `JsObject`s by @nekevss in https://github.com/boa-dev/boa/pull/3651\n- Simplify Temporal APIs by @jedel1043 in https://github.com/boa-dev/boa/pull/3653\n- Implement inline caching tests and cleanup by @HalidOdat in https://github.com/boa-dev/boa/pull/3513\n- Docs: Update README.md and add `boa_cli`'s README.md by @nekevss in https://github.com/boa-dev/boa/pull/3659\n- Change `HostEnsureCanCompileStrings` to the new spec by @jedel1043 in https://github.com/boa-dev/boa/pull/3690\n- Split ICU4X data generation from `boa_icu_provider` by @jedel1043 in https://github.com/boa-dev/boa/pull/3682\n- Add a catch all for other categories not labelled by @jasonwilliams in https://github.com/boa-dev/boa/pull/3703\n- Fix `temporal_rs` in Cargo.toml by @nekevss in https://github.com/boa-dev/boa/pull/3702\n\n## New Contributors\n\n- @AlvinKuruvilla made their first contribution in https://github.com/boa-dev/boa/pull/3129\n- @tunz made their first contribution in https://github.com/boa-dev/boa/pull/3109\n- @postmeback made their first contribution in https://github.com/boa-dev/boa/pull/3092\n- @kelbazz made their first contribution in https://github.com/boa-dev/boa/pull/3193\n- @frisoft made their first contribution in https://github.com/boa-dev/boa/pull/3209\n- @mattsse made their first contribution in https://github.com/boa-dev/boa/pull/3297\n- @arexon made their first contribution in https://github.com/boa-dev/boa/pull/3381\n- @johnyob made their first contribution in https://github.com/boa-dev/boa/pull/3369\n- @ahaoboy made their first contribution in https://github.com/boa-dev/boa/pull/3406\n- @tj825 made their first contribution in https://github.com/boa-dev/boa/pull/3465\n- @AngeloChecked made their first contribution in https://github.com/boa-dev/boa/pull/3481\n\n**Full Changelog**: https://github.com/boa-dev/boa/compare/v0.17...v0.18\n\n## [0.17.0 (2023-07-05)](https://github.com/boa-dev/boa/compare/v0.16...v0.17)\n\n### Feature Enhancements\n\n- Implement `new.target` expression by @raskad in [#2299](https://github.com/boa-dev/boa/pull/2299)\n- Parse static async private methods in classes by @raskad in [#2315](https://github.com/boa-dev/boa/pull/2315)\n- Implement `JsDataView` by @nekevss in [#2308](https://github.com/boa-dev/boa/pull/2308)\n- Upgrade clap to 4.0, add value hints for zsh and fish by @Razican in [#2336](https://github.com/boa-dev/boa/pull/2336)\n- Implement `JsRegExp` by @nekevss in [#2326](https://github.com/boa-dev/boa/pull/2326)\n- Create new lazy Error type by @jedel1043 in [#2283](https://github.com/boa-dev/boa/pull/2283)\n- Fixed some documentation and clippy warnings in tests by @Razican in [#2362](https://github.com/boa-dev/boa/pull/2362)\n- Removed the \"VM Implementation\" headline for Test262 by @Razican in [#2364](https://github.com/boa-dev/boa/pull/2364)\n- Modified the `loadfile` example to show how Boa can read bytes by @Razican in [#2363](https://github.com/boa-dev/boa/pull/2363)\n- Implement `LabelledStatement` by @jedel1043 in [#2349](https://github.com/boa-dev/boa/pull/2349)\n- Split vm/opcode into modules by @nekevss in [#2343](https://github.com/boa-dev/boa/pull/2343)\n- Removed some duplicate code, added `ToIndentedString` by @Razican in [#2367](https://github.com/boa-dev/boa/pull/2367)\n- Document the AST by @jedel1043 in [#2377](https://github.com/boa-dev/boa/pull/2377)\n- Implement member accessors in initializer of for loops by @jedel1043 in [#2381](https://github.com/boa-dev/boa/pull/2381)\n- Implement `JsGenerator` and wrapper docs clean up by @nekevss in [#2380](https://github.com/boa-dev/boa/pull/2380)\n- Add named evaluation of logical assignments by @raskad in [#2389](https://github.com/boa-dev/boa/pull/2389)\n- Implement optional chains by @jedel1043 in [#2390](https://github.com/boa-dev/boa/pull/2390)\n- Implement delete for references by @jedel1043 in [#2395](https://github.com/boa-dev/boa/pull/2395)\n- Implement AST Visitor pattern (attempt #3) by @addisoncrump in [#2392](https://github.com/boa-dev/boa/pull/2392)\n- Implement async arrow functions by @raskad in [#2393](https://github.com/boa-dev/boa/pull/2393)\n- Pretty print promise objects by @jedel1043 in [#2407](https://github.com/boa-dev/boa/pull/2407)\n- Parser Idempotency Fuzzer by @addisoncrump in [#2400](https://github.com/boa-dev/boa/pull/2400)\n- Safe wrapper for `JsDate` by @anuvratsingh in [#2181](https://github.com/boa-dev/boa/pull/2181)\n- Fix some Date tests by @jedel1043 in [#2431](https://github.com/boa-dev/boa/pull/2431)\n- Boa Gc implementation draft by @nekevss in [#2394](https://github.com/boa-dev/boa/pull/2394)\n- VM Fuzzer by @addisoncrump in [#2401](https://github.com/boa-dev/boa/pull/2401)\n- Implement the `WeakRef` builtin by @jedel1043 in [#2438](https://github.com/boa-dev/boa/pull/2438)\n- Refactor the `Date` builtin by @jedel1043 in [#2449](https://github.com/boa-dev/boa/pull/2449)\n- Implement instruction flowgraph generator by @HalidOdat in [#2422](https://github.com/boa-dev/boa/pull/2422)\n- `JsArrayBuffer` take method and docs by @nekevss in [#2454](https://github.com/boa-dev/boa/pull/2454)\n- Set function names in object literal methods by @raskad in [#2460](https://github.com/boa-dev/boa/pull/2460)\n- Redesign Intl API and implement some services by @jedel1043 in [#2478](https://github.com/boa-dev/boa/pull/2478)\n- Cleanup `Context` APIs by @jedel1043 in [#2504](https://github.com/boa-dev/boa/pull/2504)\n- Prepare `Promises` for new host hooks and job queue API by @jedel1043 in [#2528](https://github.com/boa-dev/boa/pull/2528)\n- Implement host hooks and job queues APIs by @jedel1043 in [#2529](https://github.com/boa-dev/boa/pull/2529)\n- First batch of `no_std` support for some sub-crates by @jedel1043 in [#2544](https://github.com/boa-dev/boa/pull/2544)\n- Create `Source` to abstract JS code sources by @jedel1043 in [#2579](https://github.com/boa-dev/boa/pull/2579)\n- Move increment and decrement operations to `Update` expression by @raskad in [#2565](https://github.com/boa-dev/boa/pull/2565)\n- Implement binary `in` operation with private names by @raskad in [#2582](https://github.com/boa-dev/boa/pull/2582)\n- Module parsing by @Razican in [#2411](https://github.com/boa-dev/boa/pull/2411)\n- Implement `WeakSet` by @lupd in [#2586](https://github.com/boa-dev/boa/pull/2586)\n- Implement `WeakMap` by @raskad in [#2597](https://github.com/boa-dev/boa/pull/2597)\n- API to construct a `NativeFunction` from a native async function by @jedel1043 in [#2542](https://github.com/boa-dev/boa/pull/2542)\n- Add `--strict` flag to cli by @HalidOdat in [#2689](https://github.com/boa-dev/boa/pull/2689)\n- Add timeout to CI by @HalidOdat in [#2691](https://github.com/boa-dev/boa/pull/2691)\n- Add ES5 and ES6 Conformance calculation to boa_tester by @ZackMitkin in [#2690](https://github.com/boa-dev/boa/pull/2690)\n- Improve tester display for multiple editions by @jedel1043 in [#2720](https://github.com/boa-dev/boa/pull/2720)\n- Implement `JsPromise` wrapper by @jedel1043 in [#2758](https://github.com/boa-dev/boa/pull/2758)\n- Initial version of a JS -> Rust conversion trait. by @Razican in [#2276](https://github.com/boa-dev/boa/pull/2276)\n- Implement `escape` and `unescape` by @jedel1043 in [#2768](https://github.com/boa-dev/boa/pull/2768)\n- Implement debug object for CLI by @HalidOdat in [#2772](https://github.com/boa-dev/boa/pull/2772)\n- Make `Realm` shareable between functions by @jedel1043 in [#2801](https://github.com/boa-dev/boa/pull/2801)\n- Implement Annex-B string html methods by @HalidOdat in [#2798](https://github.com/boa-dev/boa/pull/2798)\n- Implement annex-b `trimLeft` and `trimRight` string methods by @HalidOdat in [#2806](https://github.com/boa-dev/boa/pull/2806)\n- Implement HTML comments and gate behind the `annex-b` feature by @jedel1043 in [#2817](https://github.com/boa-dev/boa/pull/2817)\n- Implement `Intl.Segmenter` by @jedel1043 in [#2840](https://github.com/boa-dev/boa/pull/2840)\n- Implement var initializers in for-in loops by @jedel1043 in [#2842](https://github.com/boa-dev/boa/pull/2842)\n- Improve debug output of `JsNativeError` and `Realm` by @jedel1043 in [#2894](https://github.com/boa-dev/boa/pull/2894)\n- Implement runtime limits for loops by @HalidOdat in [#2857](https://github.com/boa-dev/boa/pull/2857)\n- Implement runtime limits for recursion by @HalidOdat in [#2904](https://github.com/boa-dev/boa/pull/2904)\n- Implement annexB Block-Level Function Declarations by @raskad in [#2910](https://github.com/boa-dev/boa/pull/2910)\n- Implement module execution by @jedel1043 in [#2922](https://github.com/boa-dev/boa/pull/2922)\n- Type safe root shape by @HalidOdat in [#2940](https://github.com/boa-dev/boa/pull/2940)\n- Implement dynamic imports by @jedel1043 in [#2932](https://github.com/boa-dev/boa/pull/2932)\n- Implement pseudo-property `import.meta` by @jedel1043 in [#2956](https://github.com/boa-dev/boa/pull/2956)\n- Implement `with` and object environments by @raskad in [#2692](https://github.com/boa-dev/boa/pull/2692)\n- Add hooks to get the current time and timezone by @jedel1043 in [#2824](https://github.com/boa-dev/boa/pull/2824)\n- Make `JsSymbol` thread-safe by @jedel1043 in [#2539](https://github.com/boa-dev/boa/pull/2539)\n- Added a Boa runtime by @Razican in [#2743](https://github.com/boa-dev/boa/pull/2743)\n- Implement `TryFromJs` for `JsObject` wrappers by @Razican in [#2809](https://github.com/boa-dev/boa/pull/2809)\n- Allow passing owned `HostHooks` and `JobQueues` to `Context` by @jedel1043 in [#2811](https://github.com/boa-dev/boa/pull/2811)\n- Implement `String.prototype.toLocaleUpper/LowerCase` by @jedel1043 in [#2822](https://github.com/boa-dev/boa/pull/2822)\n- Implement constant folding optimization by @HalidOdat in [#2679](https://github.com/boa-dev/boa/pull/2679)\n- Implement `Hidden classes` by @HalidOdat in [#2723](https://github.com/boa-dev/boa/pull/2723)\n- show object kind, name and address when using dbg! by @jasonwilliams in [#2960](https://github.com/boa-dev/boa/pull/2960)\n- Add convenience methods to `ModuleLoader` by @jedel1043 in [#3007](https://github.com/boa-dev/boa/pull/3007)\n- Allow `JobQueue` to concurrently run jobs by @jedel1043 in [#3036](https://github.com/boa-dev/boa/pull/3036)\n- Make `IntegerIndexed::byte_offset` public by @CryZe in [#3017](https://github.com/boa-dev/boa/pull/3017)\n- Allow awaiting `JsPromise` from Rust code by @jedel1043 in [#3011](https://github.com/boa-dev/boa/pull/3011)\n- Cache `cargo-tarpaulin` binary by @jedel1043 in [#3071](https://github.com/boa-dev/boa/pull/3071)\n- add link to the main logo by @jasonwilliams in [#3082](https://github.com/boa-dev/boa/pull/3082)\n\n### Bug Fixes\n\n- Add unicode terminator to line comment by @creampnx-x in [#2301](https://github.com/boa-dev/boa/pull/2301)\n- Fix function property order by @raskad in [#2305](https://github.com/boa-dev/boa/pull/2305)\n- Fix some Array spec deviations by @raskad in [#2306](https://github.com/boa-dev/boa/pull/2306)\n- Fix double conversion to primitive in `ToNumeric` by @raskad in [#2310](https://github.com/boa-dev/boa/pull/2310)\n- Fixing the output for the test diffs in PRs by @Razican in [#2320](https://github.com/boa-dev/boa/pull/2320)\n- Fix Regex literal parsing in MemberExpression by @tunz in [#2328](https://github.com/boa-dev/boa/pull/2328)\n- Fix error in `Proxy` set implementation by @raskad in [#2369](https://github.com/boa-dev/boa/pull/2369)\n- Allow LineTerminator before Semicolon in `continue` by @raskad in [#2371](https://github.com/boa-dev/boa/pull/2371)\n- Fix var collisions in strict eval calls by @jedel1043 in [#2382](https://github.com/boa-dev/boa/pull/2382)\n- Set `in` to `true` when parsing AssignmentExpression in ConditionalExpression by @raskad in [#2386](https://github.com/boa-dev/boa/pull/2386)\n- Skip prototype field definition for arrow function by @raskad in [#2388](https://github.com/boa-dev/boa/pull/2388)\n- Remove invalid optimization in addition by @raskad in [#2387](https://github.com/boa-dev/boa/pull/2387)\n- Fix order dependent execution in assignment. by @HalidOdat in [#2378](https://github.com/boa-dev/boa/pull/2378)\n- Add early error for `yield` in `GeneratorExpression` parameters by @raskad in [#2413](https://github.com/boa-dev/boa/pull/2413)\n- Handle `__proto__` fields in object literals by @raskad in [#2423](https://github.com/boa-dev/boa/pull/2423)\n- Fix built-ins/Array/prototype/toString/non-callable-join-string-tag.js test case by @akavi in [#2458](https://github.com/boa-dev/boa/pull/2458)\n- Fix `PartialEq` for `JsBigInt` and `f64` by @raskad in [#2461](https://github.com/boa-dev/boa/pull/2461)\n- Allow class expressions without identifier by @raskad in [#2464](https://github.com/boa-dev/boa/pull/2464)\n- Fix to weak_trace for `boa_tester` by @nekevss in [#2470](https://github.com/boa-dev/boa/pull/2470)\n- Fix unary operations on `this` by @veera-sivarajan in [#2507](https://github.com/boa-dev/boa/pull/2507)\n- Fix postfix operator line terminator parsing by @raskad in [#2520](https://github.com/boa-dev/boa/pull/2520)\n- Remove `Literal::Undefined` by @veera-sivarajan in [#2518](https://github.com/boa-dev/boa/pull/2518)\n- Add early errors for 'eval' or 'arguments' in parameters by @raskad in [#2515](https://github.com/boa-dev/boa/pull/2515)\n- Pass a receiver value in property getter opcodes by @raskad in [#2516](https://github.com/boa-dev/boa/pull/2516)\n- Add regex literal early errors by @raskad in [#2517](https://github.com/boa-dev/boa/pull/2517)\n- `Break` Opcode and `ByteCompiler` changes by @nekevss in [#2523](https://github.com/boa-dev/boa/pull/2523)\n- Refactor some class features by @raskad in [#2513](https://github.com/boa-dev/boa/pull/2513)\n- Recognize Directive Prologues correctly by @raskad in [#2521](https://github.com/boa-dev/boa/pull/2521)\n- Correctly parse consecutive semicolons by @raskad in [#2533](https://github.com/boa-dev/boa/pull/2533)\n- Fix some HoistableDeclaration parsing errors by @raskad in [#2532](https://github.com/boa-dev/boa/pull/2532)\n- Return the correct value from a statement list by @raskad in [#2554](https://github.com/boa-dev/boa/pull/2554)\n- Fix error for static class methods named `prototype` by @raskad in [#2552](https://github.com/boa-dev/boa/pull/2552)\n- Avoid creating `prototype` property on methods by @raskad in [#2553](https://github.com/boa-dev/boa/pull/2553)\n- Fix double property access on assignment ops by @raskad in [#2551](https://github.com/boa-dev/boa/pull/2551)\n- Add early errors for escaped identifiers by @raskad in [#2546](https://github.com/boa-dev/boa/pull/2546)\n- Fix failing collator tests by @jedel1043 in [#2575](https://github.com/boa-dev/boa/pull/2575)\n- fuzzer: bubble up NoInstructionsRemain error instead of trying to handle as exception by @Mrmaxmeier in [#2566](https://github.com/boa-dev/boa/pull/2566)\n- Try-catch-block control flow fix/refactor by @nekevss in [#2568](https://github.com/boa-dev/boa/pull/2568)\n- Fix doc tests and add CI check by @jedel1043 in [#2606](https://github.com/boa-dev/boa/pull/2606)\n- Fix string to number conversion for `infinity` by @raskad in [#2607](https://github.com/boa-dev/boa/pull/2607)\n- Fix exponent operator by @HalidOdat in [#2681](https://github.com/boa-dev/boa/pull/2681)\n- Update `README.md` cli options by @HalidOdat in [#2678](https://github.com/boa-dev/boa/pull/2678)\n- Fix incorrect `Number.MIN_VALUE` value by @HalidOdat in [#2682](https://github.com/boa-dev/boa/pull/2682)\n- Correctly run async tests by @jedel1043 in [#2683](https://github.com/boa-dev/boa/pull/2683)\n- Fix value to bigint conversion by @HalidOdat in [#2688](https://github.com/boa-dev/boa/pull/2688)\n- Fix Object constructor by @raskad in [#2694](https://github.com/boa-dev/boa/pull/2694)\n- Fix get function opcode traces by @HalidOdat in [#2708](https://github.com/boa-dev/boa/pull/2708)\n- Add early errors to dynamic function constructors by @raskad in [#2716](https://github.com/boa-dev/boa/pull/2716)\n- Add negative zero handling for `Map.delete` by @raskad in [#2726](https://github.com/boa-dev/boa/pull/2726)\n- Fix remaining `Set` tests by @raskad in [#2725](https://github.com/boa-dev/boa/pull/2725)\n- Fix update expressions getting values multiple times by @raskad in [#2733](https://github.com/boa-dev/boa/pull/2733)\n- Make if statements return their completion values by @raskad in [#2739](https://github.com/boa-dev/boa/pull/2739)\n- Fix super call execution order by @raskad in [#2724](https://github.com/boa-dev/boa/pull/2724)\n- Fix deserialization of `SpecEdition` by @jedel1043 in [#2762](https://github.com/boa-dev/boa/pull/2762)\n- Add `json-parse-with-source` feature to `boa_tester` by @HalidOdat in [#2778](https://github.com/boa-dev/boa/pull/2778)\n- Fix `Symbol.prototype[@@iterator]` by @HalidOdat in [#2800](https://github.com/boa-dev/boa/pull/2800)\n- Fix `String.prototype.replace()` order of `ToString` execution by @HalidOdat in [#2799](https://github.com/boa-dev/boa/pull/2799)\n- Fix `ThrowTypeError` intrinsic by @HalidOdat in [#2797](https://github.com/boa-dev/boa/pull/2797)\n- Fix `String.prototype.substr()` by @HalidOdat in [#2805](https://github.com/boa-dev/boa/pull/2805)\n- Fix destructive for-of loop assignments by @raskad in [#2803](https://github.com/boa-dev/boa/pull/2803)\n- Fix `TypedArray`s minus zero key by @HalidOdat in [#2808](https://github.com/boa-dev/boa/pull/2808)\n- Fix sync generator yield expressions by @raskad in [#2838](https://github.com/boa-dev/boa/pull/2838)\n- Fix async generators by @raskad in [#2853](https://github.com/boa-dev/boa/pull/2853)\n- Catch 'eval' and 'arguments' in setter method parameter by @raskad in [#2858](https://github.com/boa-dev/boa/pull/2858)\n- Fix `PropertyKey` index parse by @HalidOdat in [#2843](https://github.com/boa-dev/boa/pull/2843)\n- Fix `Date.prototype[Symbol.primitive]` incorrect attributes by @HalidOdat in [#2862](https://github.com/boa-dev/boa/pull/2862)\n- Allow `Date` object to store invalid `NativeDateTime` by @HalidOdat in [#2861](https://github.com/boa-dev/boa/pull/2861)\n- Fix panic when calling toString with radix by @HalidOdat in [#2863](https://github.com/boa-dev/boa/pull/2863)\n- Fix incorrect `LoopContinue` instruction in while-do loops by @HalidOdat in [#2866](https://github.com/boa-dev/boa/pull/2866)\n- Initialize `var` bindings in runtime environments with `undefined` by @raskad in [#2860](https://github.com/boa-dev/boa/pull/2860)\n- Bugfix/new.target is not understood by the parser as an expression #2793 by @projectnoa in [#2878](https://github.com/boa-dev/boa/pull/2878)\n- Fix `RegExp` constructor return value when pattern is a regexp by @HalidOdat in [#2880](https://github.com/boa-dev/boa/pull/2880)\n- `RegExp` constructor should call `IsRegExp()` by @HalidOdat in [#2881](https://github.com/boa-dev/boa/pull/2881)\n- Fix `for-of` expression parsing by @HalidOdat in [#2882](https://github.com/boa-dev/boa/pull/2882)\n- Disallow strict directives with escaped sequences by @jedel1043 in [#2892](https://github.com/boa-dev/boa/pull/2892)\n- Make `typeof` throw when accessing uninitialized variables by @raskad in [#2902](https://github.com/boa-dev/boa/pull/2902)\n- Fix wrong name of `Function.prototype[Symbol.hasInstance]` by @raskad in [#2905](https://github.com/boa-dev/boa/pull/2905)\n- Fix remaining object literal tests by @raskad in [#2906](https://github.com/boa-dev/boa/pull/2906)\n- Add SyntaxErrors in GlobalDeclarationInstantiation by @raskad in [#2908](https://github.com/boa-dev/boa/pull/2908)\n- Fix switch `default` execution by @HalidOdat in [#2907](https://github.com/boa-dev/boa/pull/2907)\n- Add loop and switch return values by @raskad in [#2828](https://github.com/boa-dev/boa/pull/2828)\n- Allow escaped `let` as expression by @HalidOdat in [#2916](https://github.com/boa-dev/boa/pull/2916)\n- Allow `let` name in for-in loop in non-strict mode by @HalidOdat in [#2915](https://github.com/boa-dev/boa/pull/2915)\n- Fix lexical environments in for loops by @raskad in [#2917](https://github.com/boa-dev/boa/pull/2917)\n- Fix `GetSubstitution` by @HalidOdat in [#2933](https://github.com/boa-dev/boa/pull/2933)\n- Allow escaped `async` as binding name by @jedel1043 in [#2936](https://github.com/boa-dev/boa/pull/2936)\n- Fix tagged template creation by @raskad in [#2925](https://github.com/boa-dev/boa/pull/2925)\n- Implement Private Runtime Environments by @raskad in [#2929](https://github.com/boa-dev/boa/pull/2929)\n- Fix remaining ES5 `built-ins/RegExp` tests by @HalidOdat in [#2957](https://github.com/boa-dev/boa/pull/2957)\n- Fix remaining static module bugs by @jedel1043 in [#2955](https://github.com/boa-dev/boa/pull/2955)\n- Deny Unicode Escapes in boolean and null expressions by @veera-sivarajan in [#2931](https://github.com/boa-dev/boa/pull/2931)\n- Fix `Date` for dynamic timezones by @jedel1043 in [#2877](https://github.com/boa-dev/boa/pull/2877)\n- Fix ES5 selector by @veera-sivaraja in [#2924](https://github.com/boa-dev/boa/pull/2924)\n- Labelled ByteCompiler Fix by @nekevss in [#2534](https://github.com/boa-dev/boa/pull/2534)\n- Fix verbose test display by @jedel1043 in [#2731](https://github.com/boa-dev/boa/pull/2731)\n- Fix WASM playground by @jedel1043 in [#2992](https://github.com/boa-dev/boa/pull/2992)\n- Correctly initialize functions inside modules by @jedel1043 in [#2993](https://github.com/boa-dev/boa/pull/2993)\n- Allow `true`, `false` and `null` in object patterns by @jedel1043 in [#2994](https://github.com/boa-dev/boa/pull/2994)\n- Fix panic in optional expressions with private identifiers by @raskad in [#2995](https://github.com/boa-dev/boa/pull/2995)\n- Fix prompt on windows by @ShaneEverittM in [#2986](https://github.com/boa-dev/boa/pull/2986)\n- Fix panic in constructor call by @raskad in [#3001](https://github.com/boa-dev/boa/pull/3001)\n- Unify async iterators and iterators compilation by @jedel1043 in [#2976](https://github.com/boa-dev/boa/pull/2976)\n- Correctly parse `yield import(..)` expressions by @jedel1043 in [#3006](https://github.com/boa-dev/boa/pull/3006)\n- Return the correct value during a labelled break by @raskad in [#2996](https://github.com/boa-dev/boa/pull/2996)\n- Fix panics on empty return values by @raskad in [#3018](https://github.com/boa-dev/boa/pull/3018)\n- Add early error for `await` in class static blocks by @raskad in [#3019](https://github.com/boa-dev/boa/pull/3019)\n- Fix class constructor return value by @raskad in [#3028](https://github.com/boa-dev/boa/pull/3028)\n- Fix super property access by @raskad in [#3026](https://github.com/boa-dev/boa/pull/3026)\n- Skip reversing arguments in SuperCallDerived by @dirkdev98 in [#3062](https://github.com/boa-dev/boa/pull/3062)\n- Mark header of rooted ephemerons when tracing by @jedel1043 in [#3049](https://github.com/boa-dev/boa/pull/3049)\n- Copy `ABOUT.md` file to all published crates by @jedel1043 in [#3074](https://github.com/boa-dev/boa/pull/3074)\n- Correctly handle finally..loop..break by @dirkdev98 in [#3073](https://github.com/boa-dev/boa/pull/3073)\n\n### Internal Improvements\n\n- Direct conversion from `u8` to `Opcode` by @HalidOdat [#2951](https://github.com/boa-dev/boa/pull/2951)\n- Fix links in readme by @raskad in [#2304](https://github.com/boa-dev/boa/pull/2304)\n- Switch to workspace inherited properties by @jedel1043 in [#2297](https://github.com/boa-dev/boa/pull/2297)\n- Separate JsObjectType implementors to their own module by @CalliEve in [#2324](https://github.com/boa-dev/boa/pull/2324)\n- First prototype for new `JsString` using UTF-16 by @jedel1043 in [#1659](https://github.com/boa-dev/boa/pull/1659)\n- Split `Node` into `Statement`, `Expression` and `Declaration` by @jedel1043 in [#2319](https://github.com/boa-dev/boa/pull/2319)\n- Changes neccesary -> necessary by @nekevss in [#2370](https://github.com/boa-dev/boa/pull/2370)\n- Cleanup and speed-up CI by @RageKnify in [#2376](https://github.com/boa-dev/boa/pull/2376)\n- Reduce documentation size in blog by @jedel1043 in [#2383](https://github.com/boa-dev/boa/pull/2383)\n- Generate `Opcode` impl using macro by @jedel1043 in [#2391](https://github.com/boa-dev/boa/pull/2391)\n- Extract the ast to a crate by @jedel1043 in [#2402](https://github.com/boa-dev/boa/pull/2402)\n- Replace `contains` and friends with visitors by @jedel1043 in [#2403](https://github.com/boa-dev/boa/pull/2403)\n- Rewrite some patterns with let-else and ok_or_else by @jedel1043 in [#2404](https://github.com/boa-dev/boa/pull/2404)\n- Fix async tests result values by @jedel1043 in [#2406](https://github.com/boa-dev/boa/pull/2406)\n- Rewrite scope analysis operations using visitors by @jedel1043 in [#2408](https://github.com/boa-dev/boa/pull/2408)\n- Make `JsString` conform to miri tests by @jedel1043 in [#2412](https://github.com/boa-dev/boa/pull/2412)\n- Reduced boilerplate code in the parser by @Razican in [#2410](https://github.com/boa-dev/boa/pull/2410)\n- Extract the parser into a crate by @jedel1043 in [#2409](https://github.com/boa-dev/boa/pull/2409)\n- Switch tarpaulin to llvm engine by @RageKnify in [#2432](https://github.com/boa-dev/boa/pull/2432)\n- Cleanup `boa_tester` by @jedel1043 in [#2440](https://github.com/boa-dev/boa/pull/2440)\n- Restructure lint lists in `boa_ast` by @raskad in [#2433](https://github.com/boa-dev/boa/pull/2433)\n- Restructure lints in multiple crates by @raskad in [#2447](https://github.com/boa-dev/boa/pull/2447)\n- Restructure lint lists in `boa_engine` by @raskad in [#2455](https://github.com/boa-dev/boa/pull/2455)\n- Fix rust 1.66.0 lints by @raskad in [#2486](https://github.com/boa-dev/boa/pull/2486)\n- Divide byte compiler by @e-codes-stuff in [#2425](https://github.com/boa-dev/boa/pull/2425)\n- Cleanup inline annotations by @jedel1043 in [#2493](https://github.com/boa-dev/boa/pull/2493)\n- [profiler] Cache StringId by @tunz in [#2495](https://github.com/boa-dev/boa/pull/2495)\n- Improve identifier parsing by @jedel1043 in [#2581](https://github.com/boa-dev/boa/pull/2581)\n- Remove Syntax Errors from Bytecompiler by @raskad in [#2598](https://github.com/boa-dev/boa/pull/2598)\n- fix: RUSTSEC-2020-0071 in boa_engine by @hanabi1224 in [#2627](https://github.com/boa-dev/boa/pull/2627)\n- Migrate tests to new test API by @jedel1043 in [#2619](https://github.com/boa-dev/boa/pull/2619)\n- [regexp] new tests for unicode flag by @selfisekai in [#2656](https://github.com/boa-dev/boa/pull/2656)\n- Handle surrogates in `String.fromCodePoint` by @jedel1043 in [#2659](https://github.com/boa-dev/boa/pull/2659)\n- Bump Test262 and add new features by @jedel1043 in [#2729](https://github.com/boa-dev/boa/pull/2729)\n- Fix cross-realm construction bugs by @jedel1043 in [#2786](https://github.com/boa-dev/boa/pull/2786)\n- Lift `InternalObjectMethods` from `Object` by @jedel1043 in [#2790](https://github.com/boa-dev/boa/pull/2790)\n- Implement async functions using generators by @jedel1043 in [#2821](https://github.com/boa-dev/boa/pull/2821)\n- Improve strictness of `GeneratorState` by @jedel1043 in [#2837](https://github.com/boa-dev/boa/pull/2837)\n- Upgraded to ICU 1.2 by @Razican in [#2826](https://github.com/boa-dev/boa/pull/2826)\n- Fix setting properties inside `with` blocks by @jedel1043 in [#2847](https://github.com/boa-dev/boa/pull/2847)\n- Create a unique `PromiseCapability` on each async function call by @jedel1043 in [#2846](https://github.com/boa-dev/boa/pull/2846)\n- Refactor binding handling APIs by @jedel1043 in [#2870](https://github.com/boa-dev/boa/pull/2870)\n- Refactor guards into a `ContextCleanupGuard` abstraction by @jedel1043 in [#2890](https://github.com/boa-dev/boa/pull/2890)\n- Refactor binding declarations by @raskad in [#2887](https://github.com/boa-dev/boa/pull/2887)\n- Cleanup some bytecompiler code by @raskad in [#2918](https://github.com/boa-dev/boa/pull/2918)\n- Fix `use_self` lints by @raskad in [#2946](https://github.com/boa-dev/boa/pull/2946)\n- Remove unused lint allows by @raskad in [#2968](https://github.com/boa-dev/boa/pull/2968)\n- Decouple bytecompiler from CodeBlock by @HalidOdat in [#2669](https://github.com/boa-dev/boa/pull/2669)\n- Clarity changes for the VM by @nekevss in [#2531](https://github.com/boa-dev/boa/pull/2531)\n- Bump bitflags to 2.0.0 by @Razican in [#2666](https://github.com/boa-dev/boa/pull/2666)\n- Replace deprecated set-output command by @karol-jani in [#2500](https://github.com/boa-dev/boa/pull/2500)\n- Documentation Updates by @nekevss in [#2463](https://github.com/boa-dev/boa/pull/2463)\n- Fixed typo in the docs by @Razican in [#2450](https://github.com/boa-dev/boa/pull/2450)\n- update tasks.json by @jasonwilliams in [#2313](https://github.com/boa-dev/boa/pull/2313)\n- Updated the Code of Conduct by @Razican in [#2365](https://github.com/boa-dev/boa/pull/2365)\n- Bump serde_json from 1.0.85 to 1.0.86 by @jedel1043 in [#2341](https://github.com/boa-dev/boa/pull/2341)\n- Add test case for issue #2719 by @jedel1043 in [#2980](https://github.com/boa-dev/boa/pull/2980)\n- Remove unneded `num_bindings` in `Opcode`s and `CodeBlock` by @HalidOdat in [#2967](https://github.com/boa-dev/boa/pull/2967)\n- Added period to sentence by @nekevss in [#2939](https://github.com/boa-dev/boa/pull/2939)\n- Prune collected shared shapes by @HalidOdat in [#2941](https://github.com/boa-dev/boa/pull/2941)\n- Separate declarative environment kinds by @jedel1043 in [#2921](https://github.com/boa-dev/boa/pull/2921)\n- Shrink environment binding locators by @HalidOdat in [#2950](https://github.com/boa-dev/boa/pull/2950)\n- Extract \"About Boa\" section into a separate file by @jedel1043 in [#2938](https://github.com/boa-dev/boa/pull/2938)\n- Remove `arguments_binding` field from `CodeBlock` by @HalidOdat in [#2969](https://github.com/boa-dev/boa/pull/2969)\n- Remove redundant `param_count` field from `CallFrame` by @HalidOdat in [#2962](https://github.com/boa-dev/boa/pull/2962)\n- Direct length access on arrays by @HalidOdat in [#2796](https://github.com/boa-dev/boa/pull/2796)\n- Prevent allocation of field names by @HalidOdat in [#2901](https://github.com/boa-dev/boa/pull/2901)\n- Added unit tests for `boa_ast::Punctuator` by @Razican in [#2884](https://github.com/boa-dev/boa/pull/2884)\n- Added unit tests for `boa_ast::Keyword` by @Razican in [#2883](https://github.com/boa-dev/boa/pull/2883)\n- Make update operations reuse the last found binding locator by @jedel1043 in [#2876](https://github.com/boa-dev/boa/pull/2876)\n- Docs update for boa_runtime and console documentation by @nekevss in [#2891](https://github.com/boa-dev/boa/pull/2891)\n- Direct array element access on `ByValue` instructions by @HalidOdat in [#2827](https://github.com/boa-dev/boa/pull/2827)\n- Optimize `String.prototype.normalize` by @jedel1043 in [#2848](https://github.com/boa-dev/boa/pull/2848)\n- Fix more Annex B tests by @jedel1043 in [#2841](https://github.com/boa-dev/boa/pull/2841)\n- Enable github queues and remove bors.toml by @jedel1043 in [#2899](https://github.com/boa-dev/boa/pull/2899)\n- Shrink size of `IndexedProperties` by @HalidOdat in [#2757](https://github.com/boa-dev/boa/pull/2757)\n- Added an example usage to documentation by @Razican in [#2742](https://github.com/boa-dev/boa/pull/2742)\n- Don't construct prototype if not needed by @HalidOdat in [#2751](https://github.com/boa-dev/boa/pull/2751)\n- Implement `is_identifier_(start/part)` using `icu_properties` by @jedel1043 in [#2865](https://github.com/boa-dev/boa/pull/2865)\n- Add boa logo to remaining hosted docs by @nekevss in [#2740](https://github.com/boa-dev/boa/pull/2740)\n- Added a bunch more tests by @Razican in [#2885](https://github.com/boa-dev/boa/pull/2885)\n- Updated dependencies, removes `remove_dir_all`, which is vulnerable by @Razican in [#2685](https://github.com/boa-dev/boa/pull/2685)\n- Updated README by @Razican in [#2825](https://github.com/boa-dev/boa/pull/2825)\n- Remove panics on module compilation by @jedel1043 in [#2730](https://github.com/boa-dev/boa/pull/2730)\n- Update icu dependencies by @raskad in [#2574](https://github.com/boa-dev/boa/pull/2574)\n- Pin tarpaulin version to 0.22 by @jedel1043 in [#2562](https://github.com/boa-dev/boa/pull/2562)\n- Improve the design of ephemerons in our GC by @jedel1043 in [#2530](https://github.com/boa-dev/boa/pull/2530)\n- Pass locale data provider by ref instead of boxing by @jedel1043 in [#2508](https://github.com/boa-dev/boa/pull/2508)\n- Fast path for static property keys by @tunz in [#2604](https://github.com/boa-dev/boa/pull/2604)\n- Replace `criterion::black_box` with `std::hint::black_box` by @jedel1043 in [#2494](https://github.com/boa-dev/boa/pull/2494)\n- Shrink objects by using `ThinVec`s by @HalidOdat in [#2752](https://github.com/boa-dev/boa/pull/2752)\n- Redesign native functions and closures API by @jedel1043 in [#2499](https://github.com/boa-dev/boa/pull/2499)\n- Make the `wasmbind` feature of the `chrono` crate optional by @Razican in [#2810](https://github.com/boa-dev/boa/pull/2810)\n- Use opcode table rather than match by @tunz in [#2501](https://github.com/boa-dev/boa/pull/2501)\n- Align iterator loops to the spec by @jedel1043 in [#2686](https://github.com/boa-dev/boa/pull/2686)\n- Add AST node for parenthesized expressions by @raskad in [#2738](https://github.com/boa-dev/boa/pull/2738)\n- Optimize Get/SetPropertyByName by @tunz in [#2608](https://github.com/boa-dev/boa/pull/2608)\n- Keep Integer type for inc/dec of an integer by @tunz in [#2615](https://github.com/boa-dev/boa/pull/2615)\n- Implement `CompletionRecords` for the Vm by @nekevss in [#2618](https://github.com/boa-dev/boa/pull/2618)\n- Feature flag on builtins console import by @nekevss in [#2584](https://github.com/boa-dev/boa/pull/2584)\n- Fix documentation links by @Razican in [#2741](https://github.com/boa-dev/boa/pull/2741)\n- Updated syn to 2.0.3 by @Razican in [#2702](https://github.com/boa-dev/boa/pull/2702)\n- Cleanup intrinsics and move to realm by @jedel1043 in [#2555](https://github.com/boa-dev/boa/pull/2555)\n- Rename `check_parser` and `Identifier` by @jedel1043 in [#2576](https://github.com/boa-dev/boa/pull/2576)\n- Fix rust 1.67 lints by @raskad in [#2567](https://github.com/boa-dev/boa/pull/2567)\n- Avoid unneeded bounds checks in bytecode address patching by @HalidOdat in [#2680](https://github.com/boa-dev/boa/pull/2680)\n- Rust 1.68 clippy fixes by @nekevss in [#2646](https://github.com/boa-dev/boa/pull/2646)\n- Fix rust 1.70 lints by @raskad in [#2990](https://github.com/boa-dev/boa/pull/2990)\n- Simplify/Refactor exception handling and last statement value by @HalidOdat in [#3053](https://github.com/boa-dev/boa/pull/3053)\n\n## [0.16.0 (2022-09-25)](https://github.com/boa-dev/boa/compare/v0.15...v0.16)\n\n### Feature Enhancements\n\n- Implement getter and setter of `Object.prototype.__proto__` by @CYBAI in [#2110](https://github.com/boa-dev/boa/pull/2110)\n- Execution stack & promises by @Razican in [#2107](https://github.com/boa-dev/boa/pull/2107)\n- Add the `[[Done]]` field to iterators by @Razican in [#2125](https://github.com/boa-dev/boa/pull/2125)\n- Fix for in/of loop initializer environment by @raskad in [#2135](https://github.com/boa-dev/boa/pull/2135)\n- Implement `Promise.all` by @raskad in [#2140](https://github.com/boa-dev/boa/pull/2140)\n- Implement `Promise.any` by @raskad in [#2145](https://github.com/boa-dev/boa/pull/2145)\n- Implement `Promise.allSettled` by @raskad in [#2146](https://github.com/boa-dev/boa/pull/2146)\n- Implement `super` expressions by @raskad in [#2116](https://github.com/boa-dev/boa/pull/2116)\n- Implement `async function` and `await` by @raskad in [#2158](https://github.com/boa-dev/boa/pull/2158)\n- Implementation of `JsMap` Wrapper by @nekevss in [#2115](https://github.com/boa-dev/boa/pull/2115)\n- Safe wrapper for `JsSet` by @anuvratsingh in [#2162](https://github.com/boa-dev/boa/pull/2162)\n- Implement `JsArrayBuffer` by @HalidOdat in [#2170](https://github.com/boa-dev/boa/pull/2170)\n- Implement arrow function parsing based on `CoverParenthesizedExpressionAndArrowParameterList` by @raskad in [#2171](https://github.com/boa-dev/boa/pull/2171)\n- Implement Generator Function Constructor by @raskad in [#2174](https://github.com/boa-dev/boa/pull/2174)\n- Parse class private async generator methods by @raskad in [#2220](https://github.com/boa-dev/boa/pull/2220)\n- Implement Async Generators by @raskad in [#2200](https://github.com/boa-dev/boa/pull/2200)\n- Add field accessors to destructing assignment by @raskad in [#2213](https://github.com/boa-dev/boa/pull/2213)\n- Added a bit more integer operation consistency to ByteDataBlock creation by @Razican in [#2272](https://github.com/boa-dev/boa/pull/2272)\n- Implement Async-from-Sync Iterator Objects by @raskad in [#2234](https://github.com/boa-dev/boa/pull/2234)\n- Add URI encoding and decoding functions by @Razican in [#2267](https://github.com/boa-dev/boa/pull/2267)\n- Implement `for await...of` loops by @raskad in [#2286](https://github.com/boa-dev/boa/pull/2286)\n\n### Bug Fixes\n\n- Fix `eval` attributes by @raskad in [#2130](https://github.com/boa-dev/boa/pull/2130)\n- Fix `this` in function calls by @raskad in [#2153](https://github.com/boa-dev/boa/pull/2153)\n- Fix remaining `Promise` bugs by @raskad in [#2156](https://github.com/boa-dev/boa/pull/2156)\n- Fix length/index in `32bit` architectures by @HalidOdat in [#2196](https://github.com/boa-dev/boa/pull/2196)\n- Fix `yield` expression to end on line terminator by @raskad in [#2232](https://github.com/boa-dev/boa/pull/2232)\n- Fix spread arguments in function calls by @raskad in [#2216](https://github.com/boa-dev/boa/pull/2216)\n- Fix `arguments` object iterator function by @raskad in [#2231](https://github.com/boa-dev/boa/pull/2231)\n- check history file exist if not create it by @udhaykumarbala in [#2245](https://github.com/boa-dev/boa/pull/2245)\n- Do not auto-insert semicolon in `VariableDeclarationList` by @tunz in [#2266](https://github.com/boa-dev/boa/pull/2266)\n- Fix property access of call expression by @tunz in [#2273](https://github.com/boa-dev/boa/pull/2273)\n- fix computed property methods can call super methods by @creampnx-x in [#2274](https://github.com/boa-dev/boa/pull/2274)\n- Fix regex literal `/[/]/` by @tunz in [#2277](https://github.com/boa-dev/boa/pull/2277)\n- Fixed assignment expression parsing by @Razican in [#2268](https://github.com/boa-dev/boa/pull/2268)\n- Fix labelled block statement by @creampnx-x in [#2285](https://github.com/boa-dev/boa/pull/2285)\n- Implement missing global object internal methods by @raskad in [#2287](https://github.com/boa-dev/boa/pull/2287)\n\n### Internal Improvements\n\n- Fix spec links for some object operation methods by @CYBAI in [#2111](https://github.com/boa-dev/boa/pull/2111)\n- Only run benchmarks on PRs when a label is set by @raskad in [#2114](https://github.com/boa-dev/boa/pull/2114)\n- Refactor `construct` and `PromiseCapability` to preserve `JsObject` invariants by @jedel1043 in [#2136](https://github.com/boa-dev/boa/pull/2136)\n- Remove `string-interner` dependency and implement custom string `Interner` by @jedel1043 in [#2147](https://github.com/boa-dev/boa/pull/2147)\n- Fix clippy 1.62.0 lints by @raskad in [#2154](https://github.com/boa-dev/boa/pull/2154)\n- Store call frames in `Vec` instead of singly-linked list by @HalidOdat in [#2164](https://github.com/boa-dev/boa/pull/2164)\n- Dense/Packed JavaScript arrays by @HalidOdat in [#2167](https://github.com/boa-dev/boa/pull/2167)\n- Fix Rust 1.63 clippy lints by @raskad in [#2230](https://github.com/boa-dev/boa/pull/2230)\n- Removed some `unsafe_empty_trace!()` calls to improve performance by @Razican in [#2233](https://github.com/boa-dev/boa/pull/2233)\n- Add integer type to fast path of `to_property_key` by @tunz in [#2261](https://github.com/boa-dev/boa/pull/2261)\n\n**Full Changelog**: https://github.com/boa-dev/boa/compare/v0.14...v0.15\n\n## [0.15.0 (2022-06-10)](https://github.com/boa-dev/boa/compare/v0.14...v0.15)\n\n### Feature Enhancements\n\n- Deploy playground to custom destination dir by @jedel1043 in [#1943](https://github.com/boa-dev/boa/pull/1943)\n- add README for crates.io publish by @superhawk610 in [#1952](https://github.com/boa-dev/boa/pull/1952)\n- migrated to clap 3 by @manthanabc in [#1957](https://github.com/boa-dev/boa/pull/1957)\n- Implement unscopables for Array.prototype by @NorbertGarfield in [#1963](https://github.com/boa-dev/boa/pull/1963)\n- Retrieve feature-based results for Test262 runs by @NorbertGarfield in [#1980](https://github.com/boa-dev/boa/pull/1980)\n- Added better error handling for the Boa tester by @Razican in [#1984](https://github.com/boa-dev/boa/pull/1984)\n- Add From for JsValue by @lastmjs in [#1990](https://github.com/boa-dev/boa/pull/1990)\n- Implement Classes by @raskad in [#1976](https://github.com/boa-dev/boa/pull/1976)\n- Allow `PropertyName`s in `BindingProperty`in `ObjectBindingPattern` by @raskad in [#2022](https://github.com/boa-dev/boa/pull/2022)\n- Allow `Initializer` after `ArrayBindingPattern` in `FormalParameter` by @raskad in [#2002](https://github.com/boa-dev/boa/pull/2002)\n- Allow unicode escaped characters in identifiers that are keywords by @raskad in [#2021](https://github.com/boa-dev/boa/pull/2021)\n- Feature `JsTypedArray`s by @HalidOdat in [#2003](https://github.com/boa-dev/boa/pull/2003)\n- Allow creating object with true/false property names by @lupd in [#2028](https://github.com/boa-dev/boa/pull/2028)\n- Implement `get RegExp.prototype.hasIndices` by @HalidOdat in [#2031](https://github.com/boa-dev/boa/pull/2031)\n- Partial implementation for Intl.DateTimeFormat by @NorbertGarfield in [#2025](https://github.com/boa-dev/boa/pull/2025)\n- Allow `let` as variable declaration name by @raskad in [#2044](https://github.com/boa-dev/boa/pull/2044)\n- cargo workspaces fixes #2001 by @jasonwilliams in [#2026](https://github.com/boa-dev/boa/pull/2026)\n- Move redeclaration errors to parser by @raskad in [#2027](https://github.com/boa-dev/boa/pull/2027)\n- Feature `JsFunction` by @HalidOdat in [#2015](https://github.com/boa-dev/boa/pull/2015)\n- Improve `JsString` performance by @YXL76 in [#2042](https://github.com/boa-dev/boa/pull/2042)\n- Implement ResolveLocale helper by @NorbertGarfield in [#2036](https://github.com/boa-dev/boa/pull/2036)\n- Refactor `IdentifierReference` parsing by @raskad in [#2055](https://github.com/boa-dev/boa/pull/2055)\n- Implement the global `eval()` function by @raskad in [#2041](https://github.com/boa-dev/boa/pull/2041)\n- DateTimeFormat helpers by @NorbertGarfield in [#2064](https://github.com/boa-dev/boa/pull/2064)\n- Create `Date` standard constructor by @jedel1043 in [#2079](https://github.com/boa-dev/boa/pull/2079)\n- Implement `ProxyBuilder` by @jedel1043 in [#2076](https://github.com/boa-dev/boa/pull/2076)\n- Remove `strict` flag from `Context` by @raskad in [#2069](https://github.com/boa-dev/boa/pull/2069)\n- Integrate ICU4X into `Intl` module by @jedel1043 in [#2083](https://github.com/boa-dev/boa/pull/2083)\n- Implement `Function` constructor by @raskad in [#2090](https://github.com/boa-dev/boa/pull/2090)\n- Parse private generator methods in classes by @raskad in [#2092](https://github.com/boa-dev/boa/pull/2092)\n\n### Bug Fixes\n\n- Fix link to the playground by @raskad in [#1947](https://github.com/boa-dev/boa/pull/1947)\n- convert inner datetime to local in `to_date_string` by @superhawk610 in [#1953](https://github.com/boa-dev/boa/pull/1953)\n- Fix panic on AST dump in JSON format by @kilotaras in [#1959](https://github.com/boa-dev/boa/pull/1959)\n- Fix panic in do while by @pdogr in [#1968](https://github.com/boa-dev/boa/pull/1968)\n- Support numbers with multiple leading zeroes by @lupd in [#1979](https://github.com/boa-dev/boa/pull/1979)\n- Fix length properties on array methods by @lupd in [#1983](https://github.com/boa-dev/boa/pull/1983)\n- Allow boolean/null as property identifier by dot operator assignment by @lupd in [#1985](https://github.com/boa-dev/boa/pull/1985)\n- fix(vm): off-by-one in code block stringification. by @tsutton in [#1999](https://github.com/boa-dev/boa/pull/1999)\n- Indicate bigint has constructor by @lupd in [#2008](https://github.com/boa-dev/boa/pull/2008)\n- Change `ArrayBuffer` `byteLength` to accessor property by @lupd in [#2010](https://github.com/boa-dev/boa/pull/2010)\n- Fix `ArrayBuffer.isView()` by @HalidOdat in [#2019](https://github.com/boa-dev/boa/pull/2019)\n- Fix casting negative number to usize in `Array.splice` by @lupd in [#2030](https://github.com/boa-dev/boa/pull/2030)\n- Fix `Symbol` and `BigInt` constructors by @HalidOdat in [#2032](https://github.com/boa-dev/boa/pull/2032)\n- Make `Array.prototype` an array object by @HalidOdat in [#2033](https://github.com/boa-dev/boa/pull/2033)\n- Fix early return in `for in loop` head by @raskad in [#2043](https://github.com/boa-dev/boa/pull/2043)\n\n### Internal Improvements\n\n- docs: update README by structuring the topics by @ftonato in [#1958](https://github.com/boa-dev/boa/pull/1958)\n- Migrate to NPM and cleanup Playground by @jedel1043 in [#1951](https://github.com/boa-dev/boa/pull/1951)\n- Fix performance bottleneck in VM by @pdogr in [#1973](https://github.com/boa-dev/boa/pull/1973)\n- Remove `git2` and `hex` dependencies by @raskad in [#1992](https://github.com/boa-dev/boa/pull/1992)\n- Fix rust 1.60 clippy lints by @raskad in [#2014](https://github.com/boa-dev/boa/pull/2014)\n- Refactor `RegExp` constructor methods by @raskad in [#2049](https://github.com/boa-dev/boa/pull/2049)\n- Fixing build for changes in clippy for Rust 1.61 by @Razican in [#2082](https://github.com/boa-dev/boa/pull/2082)\n\n**Full Changelog**: https://github.com/boa-dev/boa/compare/v0.14...v0.15\n\n## [0.14.0 (2022-03-15) - Virtual Machine](https://github.com/boa-dev/boa/compare/v0.13...v0.14)\n\n### Feature Enhancements\n\n- Implement functions for vm by @HalidOdat in [#1433](https://github.com/boa-dev/boa/pull/1433)\n- Implement Object.getOwnPropertyNames and Object.getOwnPropertySymbols by @kevinputera in [#1606](https://github.com/boa-dev/boa/pull/1606)\n- Implement `Symbol.prototype.valueOf` by @hle0 in [#1618](https://github.com/boa-dev/boa/pull/1618)\n- Implement Array.prototype.at() by @nekevss in [#1613](https://github.com/boa-dev/boa/pull/1613)\n- Implement Array.from by @nrabulinski [#1831](https://github.com/boa-dev/boa/pull/1831)\n- Implement String.fromCharCode by @hle0 in [#1619](https://github.com/boa-dev/boa/pull/1619)\n- Implement `Typed Array` built-in by @Razican in [#1552](https://github.com/boa-dev/boa/pull/1552)\n- Implement arguments exotic objects by @jedel1043 in [#1522](https://github.com/boa-dev/boa/pull/1522)\n- Allow `BindingPattern`s as `CatchParameter` by @lowr in [#1628](https://github.com/boa-dev/boa/pull/1628)\n- Implement `Symbol.prototype[ @@toPrimitive ]` by @Nimpruda in [#1634](https://github.com/boa-dev/boa/pull/1634)\n- Implement Generator parsing by @raskad in [#1575](https://github.com/boa-dev/boa/pull/1575)\n- Implement Object.hasOwn and improve Object.prototype.hasOwnProperty by @kevinputera in [#1639](https://github.com/boa-dev/boa/pull/1639)\n- Hashbang lexer support by @nekevss in [#1631](https://github.com/boa-dev/boa/pull/1631)\n- Implement `delete` operator in the vm by @raskad in [#1649](https://github.com/boa-dev/boa/pull/1649)\n- Implement Object.fromEntries by @kevinputera in [#1660](https://github.com/boa-dev/boa/pull/1660)\n- Initial implementation for increment/decrement in VM by @abhishekc-sharma in [#1621](https://github.com/boa-dev/boa/pull/1621)\n- Implement `Proxy` object by @raskad in [#1664](https://github.com/boa-dev/boa/pull/1664)\n- Implement object literals for vm by @raskad in [#1668](https://github.com/boa-dev/boa/pull/1668)\n- Implement Array findLast and findLastIndex by @bsinky in [#1665](https://github.com/boa-dev/boa/pull/1665)\n- Implement `DataView` built-in object by @Nimpruda in [#1662](https://github.com/boa-dev/boa/pull/1662)\n- Clean-up contribution guidelines, dependencies, Test262, MSRV by @Razican in [#1683](https://github.com/boa-dev/boa/pull/1683)\n- Implement Async Generator Parsing by @nekevss in [#1669](https://github.com/boa-dev/boa/pull/1669)\n- Implement prototype of `Intl` built-in by @hle0 in [#1622](https://github.com/boa-dev/boa/pull/1622)\n- Add limited console.trace implementation by @osman-turan in [#1623](https://github.com/boa-dev/boa/pull/1623)\n- Allow `BindingPattern` in function parameters by @am-a-man in [#1666](https://github.com/boa-dev/boa/pull/1666)\n- Small test ux improvements by @orndorffgrant in [#1704](https://github.com/boa-dev/boa/pull/1704)\n- Implement missing vm operations by @raskad in [#1697](https://github.com/boa-dev/boa/pull/1697)\n- Added fallible allocation to data blocks by @Razican in [#1728](https://github.com/boa-dev/boa/pull/1728)\n- Document CodeBlock by @TheDoctor314 in [#1691](https://github.com/boa-dev/boa/pull/1691)\n- Generic `JsResult` in `context.throw_` methods by @HalidOdat in [#1734](https://github.com/boa-dev/boa/pull/1734)\n- Implement `String.raw( template, ...substitutions )` by @HalidOdat in [#1741](https://github.com/boa-dev/boa/pull/1741)\n- Updated test262 suite and dependencies by @Razican in [#1755](https://github.com/boa-dev/boa/pull/1755)\n- Lexer string interning by @Razican in [#1758](https://github.com/boa-dev/boa/pull/1758)\n- Adjust `compile` and `execute` to avoid clones by @Razican in [#1778](https://github.com/boa-dev/boa/pull/1778)\n- Interner support in the parser by @Razican in [#1765](https://github.com/boa-dev/boa/pull/1765)\n- Convert `Codeblock` variables to `Sym` by @raskad in [#1798](https://github.com/boa-dev/boa/pull/1798)\n- Using production builds for WebAssembly by @Razican in [#1825](https://github.com/boa-dev/boa/pull/1825)\n- Give the arrow function its proper name by @rumpl in [#1832](https://github.com/boa-dev/boa/pull/1832)\n- Unwrap removal by @Razican in [#1842](https://github.com/boa-dev/boa/pull/1842)\n- Feature `JsArray` by @HalidOdat in [#1746](https://github.com/boa-dev/boa/pull/1746)\n- Rename \"Boa\" to boa_engine, moved GC and profiler to their crates by @Razican in [#1844](https://github.com/boa-dev/boa/pull/1844)\n- Added conversions from and to serde_json's Value type by @Razican in [#1851](https://github.com/boa-dev/boa/pull/1851)\n- Toggleable `JsValue` internals displaying by @HalidOdat in [#1865](https://github.com/boa-dev/boa/pull/1865)\n- Implement generator execution by @raskad in [#1790](https://github.com/boa-dev/boa/pull/1790)\n- Feature arrays with empty elements by @HalidOdat in [#1870](https://github.com/boa-dev/boa/pull/1870)\n- Removed reference counted pointers from `JsValue` variants by @Razican in [#1866](https://github.com/boa-dev/boa/pull/1866)\n- Implement `Object.prototype.toLocaleString()` by @HalidOdat in [#1875](https://github.com/boa-dev/boa/pull/1875)\n- Implement `AggregateError` by @HalidOdat in [#1888](https://github.com/boa-dev/boa/pull/1888)\n- Implement destructing assignments for assignment expressions by @raskad in [#1895](https://github.com/boa-dev/boa/pull/1895)\n- Added boa examples by @elasmojs in [#1161](https://github.com/boa-dev/boa/pull/1161)\n\n### Bug Fixes\n\n- Fix BigInt and Number comparison by @HalidOdat [#1887](https://github.com/boa-dev/boa/pull/1887)\n- Fix broken structure links in the documentation by @abhishekc-sharma in [#1612](https://github.com/boa-dev/boa/pull/1612)\n- Use function name from identifiers in assignment expressions by @raskad [#1908](https://github.com/boa-dev/boa/pull/1908)\n- Fix integer parsing by @nrabulinski in [#1614](https://github.com/boa-dev/boa/pull/1614)\n- Fix `Number.toExponential` and `Number.toFixed` by @nrabulinski in [#1620](https://github.com/boa-dev/boa/pull/1620)\n- Badge updates by @atouchet in [#1638](https://github.com/boa-dev/boa/pull/1638)\n- refactor: fix construct_error functions by @RageKnify in [#1703](https://github.com/boa-dev/boa/pull/1703)\n- Fix internal vm tests by @raskad in [#1718](https://github.com/boa-dev/boa/pull/1718)\n- Removed a bunch of warnings and clippy errors by @Razican in [#1754](https://github.com/boa-dev/boa/pull/1754)\n- Fix some broken links in the profiler documentation by @Razican in [#1762](https://github.com/boa-dev/boa/pull/1762)\n- Add proxy handling in `isArray` method by @raskad in [#1777](https://github.com/boa-dev/boa/pull/1777)\n- Copy/paste fix in Proxy error message by @icecream17 in [#1787](https://github.com/boa-dev/boa/pull/1787)\n- Fixed #1768 by @Razican in [#1820](https://github.com/boa-dev/boa/pull/1820)\n- Fix string.prototype methods and add static string methods by @jevancc in [#1123](https://github.com/boa-dev/boa/pull/1123)\n- Handle allocation errors by @y21 in [#1850](https://github.com/boa-dev/boa/pull/1850)\n- Fix wasm use outside browsers by @Razican in [#1846](https://github.com/boa-dev/boa/pull/1846)\n- Add assertion to check that a break label is identified at compile-time by @VTCAKAVSMoACE in [#1852](https://github.com/boa-dev/boa/pull/1852)\n- Correct reference error message by @aaronmunsters in [#1855](https://github.com/boa-dev/boa/pull/1855)\n- Fixing main branch workflows by @Razican in [#1858](https://github.com/boa-dev/boa/pull/1858)\n- Correct pop_on_return behaviour by @VTCAKAVSMoACE in [#1853](https://github.com/boa-dev/boa/pull/1853)\n- Fix equality between objects and `undefined` or `null` by @HalidOdat in [#1872](https://github.com/boa-dev/boa/pull/1872)\n- Removing the panic in favour of an error result by @Razican in [#1874](https://github.com/boa-dev/boa/pull/1874)\n- Make `Object.getOwnPropertyDescriptors` spec compliant by @HalidOdat in [#1876](https://github.com/boa-dev/boa/pull/1876)\n- Make `Error` and `%NativeError%` spec compliant by @HalidOdat in [#1879](https://github.com/boa-dev/boa/pull/1879)\n- Fix `Number.prototype.toString` when passing `undefined` as radix by @HalidOdat in [#1877](https://github.com/boa-dev/boa/pull/1877)\n- Cleanup vm stack on function return by @raskad in [#1880](https://github.com/boa-dev/boa/pull/1880)\n- `%NativeError%.[[prototype]]` should be `Error` constructor by @HalidOdat in [#1883](https://github.com/boa-dev/boa/pull/1883)\n- Make `StringToNumber` spec compliant by @HalidOdat in [#1881](https://github.com/boa-dev/boa/pull/1881)\n- Fix `PropertyKey` to `JsValue` conversion by @HalidOdat in [#1886](https://github.com/boa-dev/boa/pull/1886)\n- Make iterator spec complaint by @HalidOdat in [#1889](https://github.com/boa-dev/boa/pull/1889)\n- Implement `Number.parseInt` and `Number.parseFloat` by @HalidOdat in [#1894](https://github.com/boa-dev/boa/pull/1894)\n- Fix unreachable panics in compile_access by @VTCAKAVSMoACE in [#1861](https://github.com/boa-dev/boa/pull/1861)\n- Continue panic fixes by @VTCAKAVSMoACE in [#1896](https://github.com/boa-dev/boa/pull/1896)\n- Deny const declarations without initializer inside for loops by @jedel1043 in [#1903](https://github.com/boa-dev/boa/pull/1903)\n- Fix try/catch/finally related bugs and add tests by @jedel1043 in [#1901](https://github.com/boa-dev/boa/pull/1901)\n- Compile StatementList after parse passes on negative tests by @raskad in [#1906](https://github.com/boa-dev/boa/pull/1906)\n- Prevent breaks without loop or switch from causing panics by @VTCAKAVSMoACE in [#1860](https://github.com/boa-dev/boa/pull/1860)\n- Fix postfix increment and decrement return values by @raskad in [#1913](https://github.com/boa-dev/boa/pull/1913)\n\n### Internal Improvements\n\n- Rewrite initialization of builtins to use the `BuiltIn` trait by @jedel1043 in [#1586](https://github.com/boa-dev/boa/pull/1586)\n- Unify object creation with `empty` and `from_proto_and_data` methods by @jedel1043 in [#1567](https://github.com/boa-dev/boa/pull/1567)\n- VM Tidy Up by @jasonwilliams in [#1610](https://github.com/boa-dev/boa/pull/1610)\n- Fix master refs to main by @jasonwilliams in [#1637](https://github.com/boa-dev/boa/pull/1637)\n- Refresh vm docs and fix bytecode trace output by @raskad [#1921](https://github.com/boa-dev/boa/pull/1921)\n- Change type of object prototypes to `Option` by @jedel1043 in [#1640](https://github.com/boa-dev/boa/pull/1640)\n- Refactor `Function` internal methods and implement `BoundFunction` objects by @jedel1043 in [#1583](https://github.com/boa-dev/boa/pull/1583)\n- change that verbosity comparison to > 2 by @praveenbakkal in [#1680](https://github.com/boa-dev/boa/pull/1680)\n- Respect rust 1.56 by @RageKnify in [#1681](https://github.com/boa-dev/boa/pull/1681)\n- Add bors to CI by @RageKnify in [#1684](https://github.com/boa-dev/boa/pull/1684)\n- Adding VM conformance output to PR checks by @Razican in [#1685](https://github.com/boa-dev/boa/pull/1685)\n- Start removing non-VM path by @jasonwilliams in [#1747](https://github.com/boa-dev/boa/pull/1747)\n- Using upstream benchmark action by @Razican in [#1753](https://github.com/boa-dev/boa/pull/1753)\n- Fix bors hanging by @RageKnify in [#1767](https://github.com/boa-dev/boa/pull/1767)\n- add more timers on object functions by @jasonwilliams in [#1775](https://github.com/boa-dev/boa/pull/1775)\n- Update the PR benchmarks action by @Razican in [#1774](https://github.com/boa-dev/boa/pull/1774)\n- General code clean-up and new lint addition by @Razican in [#1809](https://github.com/boa-dev/boa/pull/1809)\n- Reduced the size of AST nodes by @Razican in [#1821](https://github.com/boa-dev/boa/pull/1821)\n- Using the new formatting arguments from Rust 1.58 by @Razican in [#1834](https://github.com/boa-dev/boa/pull/1834)\n- Rework RegExp struct to include bitflags field by @aaronmunsters in [#1837](https://github.com/boa-dev/boa/pull/1837)\n- Ignore wastefull `RegExp` tests by @raskad in [#1840](https://github.com/boa-dev/boa/pull/1840)\n- Refactor the environment for runtime performance by @raskad in [#1829](https://github.com/boa-dev/boa/pull/1829)\n- Refactor mapped `Arguments` object by @raskad in [#1849](https://github.com/boa-dev/boa/pull/1849)\n- Fixed dependabot for submodule by @Razican in [#1856](https://github.com/boa-dev/boa/pull/1856)\n- Refactorings for Rust 1.59 by @RageKnify in [#1867](https://github.com/boa-dev/boa/pull/1867)\n- Removing internal deprecated functions by @HalidOdat in [#1854](https://github.com/boa-dev/boa/pull/1854)\n- Remove `toInteger` and document the `string` builtin by @jedel1043 in [#1884](https://github.com/boa-dev/boa/pull/1884)\n- Extract `Intrinsics` struct from `Context` and cleanup names by @jedel1043 in [#1890](https://github.com/boa-dev/boa/pull/1890)\n\n**Full Changelog**: https://github.com/boa-dev/boa/compare/v0.13...v0.14\n\n## [0.13.0 (2021-09-30) - Many new features and refactors](https://github.com/boa-dev/boa/compare/v0.12.0...v0.13.0)\n\nFeature Enhancements:\n\n- [FEATURE #1526](https://github.com/boa-dev/boa/pull/1526): Implement ComputedPropertyName for accessor properties in ObjectLiteral (@raskad)\n- [FEATURE #1365](https://github.com/boa-dev/boa/pull/1365): Implement splice method (@neeldug)\n- [FEATURE #1364](https://github.com/boa-dev/boa/pull/1364): Implement spread for objects (@FrancisMurillo)\n- [FEATURE #1525](https://github.com/boa-dev/boa/pull/1525): Implement Object.preventExtensions() and Object.isExtensible() (@HalidOdat)\n- [FEATURE #1508](https://github.com/boa-dev/boa/pull/1508): Implement Object.values() (@HalidOdat)\n- [FEATURE #1332](https://github.com/boa-dev/boa/pull/1332): Implement Array.prototype.sort (@jedel1043)\n- [FEATURE #1417](https://github.com/boa-dev/boa/pull/1471): Implement Object.keys and Object.entries (@skyne98)\n- [FEATURE #1406](https://github.com/boa-dev/boa/pull/1406): Implement destructuring assignments (@raskad)\n- [FEATURE #1469](https://github.com/boa-dev/boa/pull/1469): Implement String.prototype.replaceAll (@raskad)\n- [FEATURE #1442](https://github.com/boa-dev/boa/pull/1442): Implement closure functions (@HalidOdat)\n- [FEATURE #1390](https://github.com/boa-dev/boa/pull/1390): Implement RegExp named capture groups (@raskad)\n- [FEATURE #1424](https://github.com/boa-dev/boa/pull/1424): Implement Symbol.for and Symbol.keyFor (@HalidOdat)\n- [FEATURE #1375](https://github.com/boa-dev/boa/pull/1375): Implement `at` method for string (@neeldug)\n- [FEATURE #1369](https://github.com/boa-dev/boa/pull/1369): Implement normalize method (@neeldug)\n- [FEATURE #1334](https://github.com/boa-dev/boa/pull/1334): Implement Array.prototype.copyWithin (@jedel1043)\n- [FEATURE #1326](https://github.com/boa-dev/boa/pull/1326): Implement get RegExp[@@species] (@raskad)\n- [FEATURE #1314](https://github.com/boa-dev/boa/pull/1314): Implement RegExp.prototype [ @@search ] ( string ) (@raskad)\n- [FEATURE #1451](https://github.com/boa-dev/boa/pull/1451): Feature prelude module (@HalidOdat)\n- [FEATURE #1523](https://github.com/boa-dev/boa/pull/1523): Allow moving NativeObject variables into closures as external captures (@jedel1043)\n\nBug Fixes:\n\n- [BUG #1521](https://github.com/boa-dev/boa/pull/1521): Added \"js\" feature for getrandom for WebAssembly builds (@Razican)\n- [BUG #1528](https://github.com/boa-dev/boa/pull/1528): Always return undefined from functions that do not return (@raskad)\n- [BUG #1518](https://github.com/boa-dev/boa/pull/1518): Moving a JsObject inside a closure caused a panic (@jedel1043)\n- [BUG #1502](https://github.com/boa-dev/boa/pull/1502): Adjust EnumerableOwnPropertyNames to use all String type property keys (@raskad)\n- [BUG #1415](https://github.com/boa-dev/boa/pull/1415): Fix panic on bigint size (@neeldug)\n- [BUG #1477](https://github.com/boa-dev/boa/pull/1477): Properly handle NaN in new Date() (@raskad)\n- [BUG #1449](https://github.com/boa-dev/boa/pull/1449): Make Array.prototype methods spec compliant (@HalidOdat)\n- [BUG #1353](https://github.com/boa-dev/boa/pull/1353): Make Array.prototype.concat spec compliant (@neeldug)\n- [BUG #1384](https://github.com/boa-dev/boa/pull/1384): bitwise not operation (spec improvements) (@neeldug)\n- [BUG #1374](https://github.com/boa-dev/boa/pull/1374): Match and regexp construct fixes (@neeldug)\n- [BUG #1366](https://github.com/boa-dev/boa/pull/1366): Use lock for map iteration (@joshwd36)\n- [BUG #1360](https://github.com/boa-dev/boa/pull/1360): Adjust a comment to be next to the correct module (@teymour-aldridge)\n- [BUG #1349](https://github.com/boa-dev/boa/pull/1349): Fixes Array.protoype.includes (@neeldug)\n- [BUG #1348](https://github.com/boa-dev/boa/pull/1348): Fixes unshift maximum size (@neeldug)\n- [BUG #1339](https://github.com/boa-dev/boa/pull/1339): Scripts should not be considered in a block (@macmv)\n- [BUG #1312](https://github.com/boa-dev/boa/pull/1312): Fix display for nodes (@macmv)\n- [BUG #1347](https://github.com/boa-dev/boa/pull/1347): Fix stringpad abstract operation (@neeldug)\n- [BUG #1584](https://github.com/boa-dev/boa/pull/1584): Refactor the Math builtin object (spec compliant) (@jedel1043)\n- [BUG #1535](https://github.com/boa-dev/boa/pull/1535): Refactor JSON.parse (@raskad)\n- [BUG #1572](https://github.com/boa-dev/boa/pull/1572): Refactor builtin Map intrinsics to follow more closely the spec (@jedel1043)\n- [BUG #1445](https://github.com/boa-dev/boa/pull/1445): improve map conformance without losing perf (@neeldug)\n- [BUG #1488](https://github.com/boa-dev/boa/pull/1488): Date refactor (@raskad)\n- [BUG #1463](https://github.com/boa-dev/boa/pull/1463): Return function execution result from constructor if the function returned (@raskad)\n- [BUG #1434](https://github.com/boa-dev/boa/pull/1434): Refactor regexp costructor (@raskad)\n- [BUG #1350](https://github.com/boa-dev/boa/pull/1350): Refactor / Implement RegExp functions (@RageKnify) (@raskad)\n- [BUG #1331](https://github.com/boa-dev/boa/pull/1331): Implement missing species getters (@raskad)\n\nInternal Improvements:\n\n- [INTERNAL #1569](https://github.com/boa-dev/boa/pull/1569): Refactor EnvironmentRecordTrait functions (@raskad)\n- [INTERNAL #1464](https://github.com/boa-dev/boa/pull/1464): Optimize integer negation (@HalidOdat)\n- [INTERNAL #1550](https://github.com/boa-dev/boa/pull/1550): Add strict mode flag to Context (@raskad)\n- [INTERNAL #1561](https://github.com/boa-dev/boa/pull/1561): Implement abstract operation GetPrototypeFromConstructor (@jedel1043)\n- [INTERNAL #1309](https://github.com/boa-dev/boa/pull/1309): Implement Display for function objects(@kvnvelasco)\n- [INTERNAL #1492](https://github.com/boa-dev/boa/pull/1492): Implement new get_or_undefined method for `JsValue` (@jedel1043)\n- [INTERNAL #1553](https://github.com/boa-dev/boa/pull/1553): Fix benchmark action in CI (@jedel1043)\n- [INTERNAL #1547](https://github.com/boa-dev/boa/pull/1547): Replace FxHashMap with IndexMap in object properties (@raskad)\n- [INTERNAL #1435](https://github.com/boa-dev/boa/pull/1435): Constant JsStrings (@HalidOdat)\n- [INTERNAL #1499](https://github.com/boa-dev/boa/pull/1499): Updated the Test262 submodule (@Razican)\n- [INTERNAL #1458](https://github.com/boa-dev/boa/pull/1458): Refactor the JS testing system (@bartlomieju)\n- [INTERNAL #1485](https://github.com/boa-dev/boa/pull/1485): Implement abstract operation CreateArrayFromList (@jedel1043)\n- [INTERNAL #1465](https://github.com/boa-dev/boa/pull/1465): Feature throw Error object (@HalidOdat)\n- [INTERNAL #1493](https://github.com/boa-dev/boa/pull/1493): Rename boa::Result to JsResult (@bartlomieju)\n- [INTERNAL #1457](https://github.com/boa-dev/boa/pull/1457): Rename Value to JsValue (@HalidOdat)\n- [INTERNAL #1460](https://github.com/boa-dev/boa/pull/1460): Change StringGetOwnProperty to produce the same strings that the lexer produces (@raskad)\n- [INTERNAL #1425](https://github.com/boa-dev/boa/pull/1425): Extract PropertyMap struct from Object (@jedel1043)\n- [INTERNAL #1432](https://github.com/boa-dev/boa/pull/1432): Proposal of new PropertyDescriptor design (@jedel1043)\n- [INTERNAL #1383](https://github.com/boa-dev/boa/pull/1383): clippy lints and cleanup of old todos (@neeldug)\n- [INTERNAL #1346](https://github.com/boa-dev/boa/pull/1346): Implement gh-page workflow on release (@FrancisMurillo)\n- [INTERNAL #1422](https://github.com/boa-dev/boa/pull/1422): Refactor internal methods and make some builtins spec compliant (@HalidOdat)\n- [INTERNAL #1419](https://github.com/boa-dev/boa/pull/1419): Fix DataDescriptor Value to possibly be empty (@raskad)\n- [INTERNAL #1357](https://github.com/boa-dev/boa/pull/1357): Add Example to Execute a Function of a Script File (@schrieveslaach)\n- [INTERNAL #1408](https://github.com/boa-dev/boa/pull/1408): Refactor JavaScript bigint rust type (@HalidOdat)\n- [INTERNAL #1380](https://github.com/boa-dev/boa/pull/1380): Custom JavaScript string rust type (@HalidOdat)\n- [INTERNAL #1382](https://github.com/boa-dev/boa/pull/1382): Refactor JavaScript symbol rust type (@HalidOdat)\n- [INTERNAL #1361](https://github.com/boa-dev/boa/pull/1361): Redesign bytecode virtual machine (@HalidOdat)\n- [INTERNAL #1381](https://github.com/boa-dev/boa/pull/1381): Fixed documentation warnings (@Razican)\n- [INTERNAL #1352](https://github.com/boa-dev/boa/pull/1352): Respect Rust 1.53 (@RageKnify)\n- [INTERNAL #1356](https://github.com/boa-dev/boa/pull/1356): Respect Rust fmt updates (@RageKnify)\n- [INTERNAL #1338](https://github.com/boa-dev/boa/pull/1338): Fix cargo check errors (@neeldug)\n- [INTERNAL #1329](https://github.com/boa-dev/boa/pull/1329): Allow Value.set_field to throw (@raskad)\n- [INTERNAL #1333](https://github.com/boa-dev/boa/pull/1333): adds condition to avoid triggers from dependabot (@neeldug)\n- [INTERNAL #1337](https://github.com/boa-dev/boa/pull/1337): Fix github actions (@neeldug)\n\n## [0.12.0 (2021-06-07) - `Set`, accessors, `@@toStringTag` and no more panics](https://github.com/boa-dev/boa/compare/v0.11.0...v0.12.0)\n\nFeature Enhancements:\n\n- [FEATURE #1085](https://github.com/boa-dev/boa/pull/1085): Add primitive promotion for method calls on `GetField` (@RageKnify)\n- [FEATURE #1033](https://github.com/boa-dev/boa/pull/1033): Implement `Reflect` built-in object (@tofpie)\n- [FEATURE #1151](https://github.com/boa-dev/boa/pull/1151): Fully implement `EmptyStatement` (@SamuelQZQ)\n- [FEATURE #1158](https://github.com/boa-dev/boa/pull/1158): Include name in verbose results output of `boa-tester` (@0x7D2B)\n- [FEATURE #1225](https://github.com/boa-dev/boa/pull/1225): Implement `Math[ @@toStringTag ]` (@HalidOdat)\n- [FEATURE #1224](https://github.com/boa-dev/boa/pull/1224): Implement `JSON[ @@toStringTag ]` (@HalidOdat)\n- [FEATURE #1222](https://github.com/boa-dev/boa/pull/1222): Implement `Symbol.prototype.description` accessor (@HalidOdat)\n- [FEATURE #1221](https://github.com/boa-dev/boa/pull/1221): Implement `RegExp` flag accessors (@HalidOdat)\n- [FEATURE #1240](https://github.com/boa-dev/boa/pull/1240): Stop ignoring a bunch of tests (@Razican)\n- [FEATURE #1132](https://github.com/boa-dev/boa/pull/1132): Implement `Array.prototype.flat`/`flatMap` (@davimiku)\n- [FEATURE #1235](https://github.com/boa-dev/boa/pull/1235): Implement `Object.assign( target, ...sources )` (@HalidOdat)\n- [FEATURE #1243](https://github.com/boa-dev/boa/pull/1243): Cross realm symbols (@HalidOdat)\n- [FEATURE #1249](https://github.com/boa-dev/boa/pull/1249): Implement `Map.prototype[ @@toStringTag ]` (@wylie39)\n- [FEATURE #1111](https://github.com/boa-dev/boa/pull/1111): Implement `Set` builtin object (@RageKnify)\n- [FEATURE #1265](https://github.com/boa-dev/boa/pull/1265): Implement `BigInt.prototype[ @@toStringTag ]` (@n14littl)\n- [FEATURE #1102](https://github.com/boa-dev/boa/pull/1102): Support Unicode escape in identifier names (@jevancc)\n- [FEATURE #1273](https://github.com/boa-dev/boa/pull/1273): Add default parameter support (@0x7D2B)\n- [FEATURE #1292](https://github.com/boa-dev/boa/pull/1292): Implement `symbol.prototype[ @@ToStringTag ]` (@moadmmh)\n- [FEATURE #1291](https://github.com/boa-dev/boa/pull/1291): Support `GetOwnProperty` for `string` exotic object (@jarkonik)\n- [FEATURE #1296](https://github.com/boa-dev/boa/pull/1296): Added the `$262` object to the Test262 test runner (@Razican)\n- [FEATURE #1127](https://github.com/boa-dev/boa/pull/1127): Implement `Array.of` (@camc)\n\nBug Fixes:\n\n- [BUG #1071](https://github.com/boa-dev/boa/pull/1071): Fix attribute configurable of the length property of arguments (@tofpie)\n- [BUG #1073](https://github.com/boa-dev/boa/pull/1073): Fixed spelling (@vishalsodani)\n- [BUG #1072](https://github.com/boa-dev/boa/pull/1072): Fix `get`/`set` as short method name in `object` (@tofpie)\n- [BUG #1077](https://github.com/boa-dev/boa/pull/1077): Fix panics from multiple borrows of `Map` (@joshwd36)\n- [BUG #1079](https://github.com/boa-dev/boa/pull/1079): Fix lexing escapes in string literal (@jevancc)\n- [BUG #1075](https://github.com/boa-dev/boa/pull/1075): Fix out-of-range panics of `Date` (@jevancc)\n- [BUG #1084](https://github.com/boa-dev/boa/pull/1084): Fix line terminator in string literal (@jevancc)\n- [BUG #1110](https://github.com/boa-dev/boa/pull/1110): Fix parsing floats panics and bugs (@jevancc)\n- [BUG #1202](https://github.com/boa-dev/boa/pull/1202): Fix a typo in `gc.rs` (@teymour-aldridge)\n- [BUG #1201](https://github.com/boa-dev/boa/pull/1201): Return optional value in `to_json` functions (@fermian)\n- [BUG #1223](https://github.com/boa-dev/boa/pull/1223): Update cli name in Readme (@sphinxc0re)\n- [BUG #1175](https://github.com/boa-dev/boa/pull/1175): Handle early errors for declarations in `StatementList` (@0x7D2B)\n- [BUG #1270](https://github.com/boa-dev/boa/pull/1270): Fix `Context::register_global_function()` (@HalidOdat)\n- [BUG #1135](https://github.com/boa-dev/boa/pull/1135): Fix of instructions.rs comment, to_precision impl and rfc changes (@NathanRoyer)\n- [BUG #1272](https://github.com/boa-dev/boa/pull/1272): Fix `Array.prototype.filter` (@tofpie & @Razican)\n- [BUG #1280](https://github.com/boa-dev/boa/pull/1280): Fix slice index panic in `add_rest_param` (@0x7D2B)\n- [BUG #1284](https://github.com/boa-dev/boa/pull/1284): Fix `GcObject` `to_json` mutable borrow panic (@0x7D2B)\n- [BUG #1283](https://github.com/boa-dev/boa/pull/1283): Fix panic in regex execution (@0x7D2B)\n- [BUG #1286](https://github.com/boa-dev/boa/pull/1286): Fix construct usage (@0x7D2B)\n- [BUG #1288](https://github.com/boa-dev/boa/pull/1288): Fixed `Math.hypot.length` bug (@moadmmh)\n- [BUG #1285](https://github.com/boa-dev/boa/pull/1285): Fix environment record panics (@0x7D2B)\n- [BUG #1302](https://github.com/boa-dev/boa/pull/1302): Fix VM branch (@jasonwilliams)\n\nInternal Improvements:\n\n- [INTERNAL #1067](https://github.com/boa-dev/boa/pull/1067): Change `Realm::global_object` field from `Value` to `GcObject` (@RageKnify)\n- [INTERNAL #1048](https://github.com/boa-dev/boa/pull/1048): VM Trace output fixes (@jasonwilliams)\n- [INTERNAL #1109](https://github.com/boa-dev/boa/pull/1109): Define all property methods of constructors (@RageKnify)\n- [INTERNAL #1126](https://github.com/boa-dev/boa/pull/1126): Remove unnecessary wraps for non built-in functions (@RageKnify)\n- [INTERNAL #1044](https://github.com/boa-dev/boa/pull/1044): Removed duplicated code in `vm.run` using macros (@stephanemagnenat)\n- [INTERNAL #1103](https://github.com/boa-dev/boa/pull/1103): Lazy evaluation for cooked template string (@jevancc)\n- [INTERNAL #1156](https://github.com/boa-dev/boa/pull/1156): Rework environment records (@0x7D2B)\n- [INTERNAL #1181](https://github.com/boa-dev/boa/pull/1181): Merge `Const`/`Let`/`Var` `DeclList` into `DeclarationList` (@0x7D2B)\n- [INTERNAL #1234](https://github.com/boa-dev/boa/pull/1234): Separate `Symbol` builtin (@HalidOdat)\n- [INTERNAL #1131](https://github.com/boa-dev/boa/pull/1131): Make environment methods take `&mut Context` (@HalidOdat)\n- [INTERNAL #1271](https://github.com/boa-dev/boa/pull/1271): Make `same_value` and `same_value_zero` static methods (@HalidOdat)\n- [INTERNAL #1276](https://github.com/boa-dev/boa/pull/1276): Cleanup (@Razican)\n- [INTERNAL #1279](https://github.com/boa-dev/boa/pull/1279): Add test comparison to Test262 result compare (@Razican)\n- [INTERNAL #1293](https://github.com/boa-dev/boa/pull/1293): Fix test262 comment formatting (@0x7D2B)\n- [INTERNAL #1294](https://github.com/boa-dev/boa/pull/1294): Don't consider panic fixes as \"new failures\" (@Razican)\n\n## [0.11.0 (2021-01-14) - Faster Parsing & Better compliance](https://github.com/boa-dev/boa/compare/v0.10.0...v0.11.0)\n\nFeature Enhancements:\n\n- [FEATURE #836](https://github.com/boa-dev/boa/pull/836):\n Async/Await parse (@Lan2u)\n- [FEATURE #704](https://github.com/boa-dev/boa/pull/704):\n Implement for...of loops (@joshwd36)\n- [FEATURE #770](https://github.com/boa-dev/boa/pull/770):\n Support for symbols as property keys for `Object.defineProperty` (@georgeroman)\n- [FEATURE #717](https://github.com/boa-dev/boa/pull/717):\n Strict Mode Lex/Parse (@Lan2u)\n- [FEATURE #800](https://github.com/boa-dev/boa/pull/800):\n Implement `console` crate feature - Put `console` object behind a feature flag (@HalidOdat)\n- [FEATURE #804](https://github.com/boa-dev/boa/pull/804):\n Implement `EvalError` (@HalidOdat)\n- [FEATURE #805](https://github.com/boa-dev/boa/pull/805):\n Implement `Function.prototype.call` (@RageKnify)\n- [FEATURE #806](https://github.com/boa-dev/boa/pull/806):\n Implement `URIError` (@HalidOdat)\n- [FEATURE #811](https://github.com/boa-dev/boa/pull/811):\n Implement spread operator using iterator (@croraf)\n- [FEATURE #844](https://github.com/boa-dev/boa/pull/844):\n Allow UnaryExpression with prefix increment/decrement (@croraf)\n- [FEATURE #798](https://github.com/boa-dev/boa/pull/798):\n Implement Object.getOwnPropertyDescriptor() and Object.getOwnPropertyDescriptors() (@JohnDoneth)\n- [FEATURE #847](https://github.com/boa-dev/boa/pull/847):\n Implement Map.prototype.entries() (@croraf)\n- [FEATURE #859](https://github.com/boa-dev/boa/pull/859):\n Implement spec compliant Array constructor (@georgeroman)\n- [FEATURE #874](https://github.com/boa-dev/boa/pull/874):\n Implement Map.prototype.values and Map.prototype.keys (@croraf)\n- [FEATURE #877](https://github.com/boa-dev/boa/pull/877):\n Implement Function.prototype.apply (@georgeroman)\n- [FEATURE #908](https://github.com/boa-dev/boa/pull/908):\n Implementation of `instanceof` operator (@morrien)\n- [FEATURE #935](https://github.com/boa-dev/boa/pull/935):\n Implement String.prototype.codePointAt (@devinus)\n- [FEATURE #961](https://github.com/boa-dev/boa/pull/961):\n Implement the optional `space` parameter in `JSON.stringify` (@tofpie)\n- [FEATURE #962](https://github.com/boa-dev/boa/pull/962):\n Implement Number.prototype.toPrecision (@NathanRoyer)\n- [FEATURE #983](https://github.com/boa-dev/boa/pull/983):\n Implement Object.prototype.isPrototypeOf (@tofpie)\n- [FEATURE #995](https://github.com/boa-dev/boa/pull/995):\n Support Numeric separators (@tofpie)\n- [FEATURE #1013](https://github.com/boa-dev/boa/pull/1013):\n Implement nullish coalescing (?? and ??=) (@tofpie)\n- [FEATURE #987](https://github.com/boa-dev/boa/pull/987):\n Implement property accessors (@tofpie)\n- [FEATURE #1018](https://github.com/boa-dev/boa/pull/1018):\n Implement logical assignment operators (&&= and ||=) (@tofpie)\n- [FEATURE #1019](https://github.com/boa-dev/boa/pull/1019):\n Implement early errors for non-assignable nodes in assignment (@tofpie)\n- [FEATURE #1020](https://github.com/boa-dev/boa/pull/1020):\n Implement Symbol.toPrimitive (@tofpie)\n- [FEATURE #976](https://github.com/boa-dev/boa/pull/976):\n Implement for..in (@tofpie)\n- [FEATURE #1026](https://github.com/boa-dev/boa/pull/1026):\n Implement String.prototype.split (@jevancc)\n- [FEATURE #1047](https://github.com/boa-dev/boa/pull/1047):\n Added syntax highlighting for numbers, identifiers and template literals (@Razican)\n- [FEATURE #1003](https://github.com/boa-dev/boa/pull/1003):\n Improve Unicode support for identifier names (@jevancc)\n\nBug Fixes:\n\n- [BUG #782](https://github.com/boa-dev/boa/pull/782):\n Throw TypeError if regexp is passed to startsWith, endsWith, includes (@pt2121)\n- [BUG #788](https://github.com/boa-dev/boa/pull/788):\n Fixing a duplicated attribute in test262 results (@Razican)\n- [BUG #790](https://github.com/boa-dev/boa/pull/790):\n Throw RangeError when BigInt division by zero occurs (@JohnDoneth)\n- [BUG #785](https://github.com/boa-dev/boa/pull/785):\n Fix zero argument panic in JSON.parse() (@JohnDoneth)\n- [BUG #749](https://github.com/boa-dev/boa/pull/749):\n Fix Error constructors to return rather than throw (@RageKnify)\n- [BUG #777](https://github.com/boa-dev/boa/pull/777):\n Fix cyclic JSON.stringify / primitive conversion stack overflows (@vgel)\n- [BUG #799](https://github.com/boa-dev/boa/pull/799):\n Fix lexer span panic with carriage return (@vgel)\n- [BUG #812](https://github.com/boa-dev/boa/pull/812):\n Fix 2 bugs that caused Test262 to fail (@RageKnify)\n- [BUG #826](https://github.com/boa-dev/boa/pull/826):\n Fix tokenizing Unicode escape sequence in string literal (@HalidOdat)\n- [BUG #825](https://github.com/boa-dev/boa/pull/825):\n calling \"new\" on a primitive value throw a type error (@dlemel8)\n- [BUG #853](https://github.com/boa-dev/boa/pull/853)\n Handle invalid Unicode code point in the string literals (@jevancc)\n- [BUG #870](https://github.com/boa-dev/boa/pull/870)\n Fix JSON stringification for fractional numbers (@georgeroman)\n- [BUG #807](https://github.com/boa-dev/boa/pull/807):\n Make boa::parse emit error on invalid input, not panic (@georgeroman)\n- [BUG #880](https://github.com/boa-dev/boa/pull/880):\n Support more number literals in BigInt's from string constructor (@georgeroman)\n- [BUG #885](https://github.com/boa-dev/boa/pull/885):\n Fix `BigInt.prototype.toString()` radix checks (@georgeroman)\n- [BUG #882](https://github.com/boa-dev/boa/pull/882):\n Fix (panic) remainder by zero (@georgeroman)\n- [BUG #884](https://github.com/boa-dev/boa/pull/884):\n Fix some panics related to BigInt operations (@georgeroman)\n- [BUG #888](https://github.com/boa-dev/boa/pull/888):\n Fix some panics in String.prototype properties (@georgeroman)\n- [BUG #902](https://github.com/boa-dev/boa/pull/902):\n Fix Accessors panics (@HalidOdat)\n- [BUG #959](https://github.com/boa-dev/boa/pull/959):\n Fix Unicode character escape sequence parsing (@tofpie)\n- [BUG #964](https://github.com/boa-dev/boa/pull/964):\n Fix single line comment lexing with CRLF line ending (@tofpie)\n- [BUG #919](https://github.com/boa-dev/boa/pull/919):\n Reduce the number of `Array`-related panics (@jakubfijalkowski)\n- [BUG #968](https://github.com/boa-dev/boa/pull/968):\n Fix unit tests that can be failed due to daylight saving time (@tofpie)\n- [BUG #972](https://github.com/boa-dev/boa/pull/972):\n Fix enumerable attribute on array length property (@tofpie)\n- [BUG #974](https://github.com/boa-dev/boa/pull/974):\n Fix enumerable attribute on string length property (@tofpie)\n- [BUG #981](https://github.com/boa-dev/boa/pull/981):\n Fix prototypes for Number, String and Boolean (@tofpie)\n- [BUG #999](https://github.com/boa-dev/boa/pull/999):\n Fix logical expressions evaluation (@tofpie)\n- [BUG #1001](https://github.com/boa-dev/boa/pull/1001):\n Fix comparison with infinity (@tofpie)\n- [BUG #1004](https://github.com/boa-dev/boa/pull/1004):\n Fix panics surrounding `Object.prototype.hasOwnProperty()` (@HalidOdat)\n- [BUG #1005](https://github.com/boa-dev/boa/pull/1005):\n Fix panics surrounding `Object.defineProperty()` (@HalidOdat)\n- [BUG #1021](https://github.com/boa-dev/boa/pull/1021):\n Fix spread in new and call expressions (@tofpie)\n- [BUG #1023](https://github.com/boa-dev/boa/pull/1023):\n Fix attributes on properties of functions and constructors (@tofpie)\n- [BUG #1017](https://github.com/boa-dev/boa/pull/1017):\n Don't panic when function parameters share names (@AnnikaCodes)\n- [BUG #1024](https://github.com/boa-dev/boa/pull/1024):\n Fix delete when the property is not configurable (@tofpie)\n- [BUG #1027](https://github.com/boa-dev/boa/pull/1027):\n Supress regress errors on invalid escapes for regex (@jasonwilliams\n- [BUG #1031](https://github.com/boa-dev/boa/pull/1031):\n Fixed some extra regex panics (@Razican)\n- [BUG #1049](https://github.com/boa-dev/boa/pull/1049):\n Support overriding the `arguments` variable (@AnnikaCodes)\n- [BUG #1050](https://github.com/boa-dev/boa/pull/1050):\n Remove panic on named capture groups (@Razican)\n- [BUG #1046](https://github.com/boa-dev/boa/pull/1046):\n Remove a few different panics (@Razican)\n- [BUG #1051](https://github.com/boa-dev/boa/pull/1051):\n Fix parsing of arrow functions with 1 argument (@Lan2u)\n- [BUG #1045](https://github.com/boa-dev/boa/pull/1045):\n Add newTarget to construct (@tofpie)\n- [BUG #659](https://github.com/boa-dev/boa/pull/659):\n Error handling in environment (@54k1)\n\nInternal Improvements:\n\n- [INTERNAL #735](https://github.com/boa-dev/boa/pull/735):\n Move exec implementations together with AST node structs (@georgeroman)\n- [INTERNAL #724](https://github.com/boa-dev/boa/pull/724):\n Ignore tests for code coverage count (@HalidOdat)\n- [INTERNAL #768](https://github.com/boa-dev/boa/pull/768)\n Update the benchmark Github action (@Razican)\n- [INTERNAL #722](https://github.com/boa-dev/boa/pull/722):\n `ConstructorBuilder`, `ObjectInitializer`, cache standard objects and fix global object attributes (@HalidOdat)\n- [INTERNAL #783](https://github.com/boa-dev/boa/pull/783):\n New test262 results format (This also reduces the payload size for the website) (@Razican)\n- [INTERNAL #787](https://github.com/boa-dev/boa/pull/787):\n Refactor ast/node/expression into ast/node/call and ast/node/new (@croraf)\n- [INTERNAL #802](https://github.com/boa-dev/boa/pull/802):\n Make `Function.prototype` a function (@HalidOdat)\n- [INTERNAL #746](https://github.com/boa-dev/boa/pull/746):\n Add Object.defineProperties and handle props argument in Object.create (@dvtkrlbs)\n- [INTERNAL #774](https://github.com/boa-dev/boa/pull/774):\n Switch from `regex` to `regress` for ECMA spec-compliant regex implementation (@neeldug)\n- [INTERNAL #794](https://github.com/boa-dev/boa/pull/794):\n Refactor `PropertyDescriptor` (Improved performance) (@HalidOdat)\n- [INTERNAL #824](https://github.com/boa-dev/boa/pull/824):\n [parser Expression] minor expression macro simplification (@croraf)\n- [INTERNAL #833](https://github.com/boa-dev/boa/pull/833):\n Using unstable sort for sorting keys on `to_json()` for GC objects (@Razican)\n- [INTERNAL #837](https://github.com/boa-dev/boa/pull/837):\n Set default-run to `boa` removing need for `--bin` (@RageKnify)\n- [INTERNAL #841](https://github.com/boa-dev/boa/pull/841):\n Minor refactor and rename in eval() method (@croraf)\n- [INTERNAL #840](https://github.com/boa-dev/boa/pull/840):\n fix(profiler): update profiler to match current measureme api (@neeldug)\n- [INTERNAL #838](https://github.com/boa-dev/boa/pull/838):\n style(boa): minor cleanup (@neeldug)\n- [INTERNAL #869](https://github.com/boa-dev/boa/pull/869):\n Updated cache in workflows (@Razican)\n- [INTERNAL #873](https://github.com/boa-dev/boa/pull/873)\n Removed cache from MacOS builds (@Razican)\n- [INTERNAL #835](https://github.com/boa-dev/boa/pull/835):\n Move `Object` internal object methods to `GcObject` (@HalidOdat)\n- [INTERNAL #886](https://github.com/boa-dev/boa/pull/886):\n Support running a specific test/suite in boa_tester (@georgeroman)\n- [INTERNAL #901](https://github.com/boa-dev/boa/pull/901):\n Added \"unimplemented\" syntax errors (@Razican)\n- [INTERNAL #911](https://github.com/boa-dev/boa/pull/911):\n Change Symbol hash to `u64` (@HalidOdat)\n- [INTERNAL #912](https://github.com/boa-dev/boa/pull/912):\n Feature `Context::register_global_property()` (@HalidOdat)\n- [INTERNAL #913](https://github.com/boa-dev/boa/pull/913):\n Added check to ignore semicolon in parser (@AngelOnFira)\n- [INTERNAL #915](https://github.com/boa-dev/boa/pull/915):\n Improve lexer by make cursor iterate over bytes (@jevancc)\n- [INTERNAL #952](https://github.com/boa-dev/boa/pull/952):\n Upgraded rustyline and test262 (@Razican)\n- [INTERNAL #960](https://github.com/boa-dev/boa/pull/960):\n Fix unresolved links in documentation (@tofpie)\n- [INTERNAL #979](https://github.com/boa-dev/boa/pull/979):\n Read file input in bytes instead of string (@tofpie)\n- [INTERNAL #1014](https://github.com/boa-dev/boa/pull/1014):\n StatementList: Rename `statements` to `items` (@AnnikaCodes)\n- [INTERNAL #860](https://github.com/boa-dev/boa/pull/860):\n Investigation into ByteCode Interpreter (@jasonwilliams)\n- [INTERNAL #1042](https://github.com/boa-dev/boa/pull/1042):\n Add receiver parameter to object internal methods (@tofpie)\n- [INTERNAL #1030](https://github.com/boa-dev/boa/pull/1030):\n VM: Implement variable declaration (var, const, and let) (@AnnikaCodes)\n- [INTERNAL #1010](https://github.com/boa-dev/boa/pull/1010):\n Modify environment binding behaviour of function (@54k1)\n\n## [0.10.0 (2020-09-29) - New Lexer & Test 262 Harness](https://github.com/boa-dev/boa/compare/v0.9.0...v0.10.0)\n\nFeature Enhancements:\n\n- [FEATURE #524](https://github.com/boa-dev/boa/pull/525):\n Implement remaining `Math` methods (@mr-rodgers)\n- [FEATURE #562](https://github.com/boa-dev/boa/pull/562):\n Implement remaining `Number` methods (@joshwd36)\n- [FEATURE #536](https://github.com/boa-dev/boa/pull/536):\n Implement `SyntaxError` (@HalidOdat)\n- [FEATURE #543](https://github.com/boa-dev/boa/pull/543):\n Implements `Object.create` builtin method (@croraf)\n- [FEATURE #492](https://github.com/boa-dev/boa/pull/492):\n Switch to [rustyline](https://github.com/kkawakam/rustyline) for the CLI (@IovoslavIovchev & @Razican)\n- [FEATURE #595](https://github.com/boa-dev/boa/pull/595):\n Added syntax highlighting for strings in REPL (@HalidOdat)\n- [FEATURE #586](https://github.com/boa-dev/boa/pull/586):\n Better error formatting and cli color (@HalidOdat)\n- [FEATURE #590](https://github.com/boa-dev/boa/pull/590):\n Added keyword and operator colors and matching bracket validator to REPL (@HalidOdat)\n- [FEATURE #555](https://github.com/boa-dev/boa/pull/555):\n Implement Array.prototype.reduce (@benjaminflin)\n- [FEATURE #550](https://github.com/boa-dev/boa/pull/550):\n Initial implementation of Map() (@joshwd36 & @HalidOdat)\n- [FEATURE #579](https://github.com/boa-dev/boa/pull/579):\n Implement Array.prototype.reduceRight (@benjaminflin)\n- [FEATURE #585](https://github.com/boa-dev/boa/pull/587):\n Implement Well-Known Symbols (@joshwd36)\n- [FEATURE #589](https://github.com/boa-dev/boa/pull/589):\n Implement the comma operator (@KashParty)\n- [FEATURE #341](https://github.com/boa-dev/boa/pull/590):\n Ability to create multiline blocks in boa shell (@HalidOdat)\n- [FEATURE #252](https://github.com/boa-dev/boa/pull/596):\n Implement `Date` (@jcdickinson)\n- [FEATURE #711](https://github.com/boa-dev/boa/pull/711):\n Add support for >>>= (@arpit-saxena)\n- [FEATURE #549](https://github.com/boa-dev/boa/pull/549):\n Implement label statements (@jasonwilliams)\n- [FEATURE #373](https://github.com/boa-dev/boa/pull/373):\n Introduce PropertyKey for field acces (@RageKnify)\n- [FEATURE #627](https://github.com/boa-dev/boa/pull/627):\n Feature native class objects (`NativeObject` and `Class` traits) (@HalidOdat)\n- [FEATURE #694](https://github.com/boa-dev/boa/pull/694):\n Feature `gc` module (@HalidOdat)\n- [FEATURE #656](https://github.com/boa-dev/boa/pull/656):\n Feature `Context` (@HalidOdat)\n- [FEATURE #673](https://github.com/boa-dev/boa/pull/673):\n Add `#[track_caller]` to `GcObject` methods that can panic (@HalidOdat)\n- [FEATURE #661](https://github.com/boa-dev/boa/pull/661):\n Add documentation to `GcObject` methods (@HalidOdat)\n- [FEATURE #662](https://github.com/boa-dev/boa/pull/662):\n Implement `std::error::Error` for `GcObject` borrow errors (@HalidOdat)\n- [FEATURE #660](https://github.com/boa-dev/boa/pull/660):\n Make `GcObject::contruct` not take 'this' (@HalidOdat)\n- [FEATURE #654](https://github.com/boa-dev/boa/pull/654):\n Move `require_object_coercible` to `Value` (@HalidOdat)\n- [FEATURE #603](https://github.com/boa-dev/boa/pull/603):\n Index `PropertyKey`, `Object` iterators and symbol support (@HalidOdat)\n- [FEATURE #637](https://github.com/boa-dev/boa/pull/637):\n Feature `boa::Result` (@HalidOdat)\n- [FEATURE #625](https://github.com/boa-dev/boa/pull/625):\n Moved value operations from `Interpreter` to `Value` (@HalidOdat)\n- [FEATURE #638](https://github.com/boa-dev/boa/pull/638):\n Changed to `Value::to_*int32` => `Value::to_*32` (@HalidOdat)\n\nBug Fixes:\n\n- [BUG #405](https://github.com/boa-dev/boa/issues/405):\n Fix json.stringify symbol handling (@n14little)\n- [BUG #520](https://github.com/boa-dev/boa/pull/520):\n Fix all `Value` operations and add unsigned shift right (@HalidOdat)\n- [BUG #529](https://github.com/boa-dev/boa/pull/529):\n Refactor exec/expression into exec/call and exec/new (@croraf)\n- [BUG #510](https://github.com/boa-dev/boa/issues/510):\n [[Call]] calling an undefined method does not throw (@joshwd36)\n- [BUG #493](https://github.com/boa-dev/boa/pull/493):\n Use correct exponential representation for rational values (@Tropid)\n- [BUG #572](https://github.com/boa-dev/boa/pull/572):\n Spec Compliant `Number.prototype.toString()`, better `Number` object formating and `-0` (@HalidOdat)\n- [BUG #599](https://github.com/boa-dev/boa/pull/599):\n Fixed `String.prototype.indexOf()` bug, when the search string is empty (@HalidOdat)\n- [BUG #615](https://github.com/boa-dev/boa/issues/615):\n Fix abstract relational comparison operators (@HalidOdat)\n- [BUG #608](https://github.com/boa-dev/boa/issues/608):\n `Debug::fmt` Causes Causes a Stack Overflow (@jcdickinson)\n- [BUG #532](https://github.com/boa-dev/boa/issues/532)\n [builtins - Object] Object.getPrototypeOf returning incorrectly (@54k1)\n- [BUG #533](https://github.com/boa-dev/boa/issues/533)\n [exec - function] function.prototype doesn't have own constructor property pointing to this function (@54k1)\n- [BUG #641](https://github.com/boa-dev/boa/issues/641)\n Test new_instance_should_point_to_prototype is not checked correctly (@54k1)\n- [BUG #644](https://github.com/boa-dev/boa/pull/645)\n `undefined` constants panic on execution (@jcdickinson)\n- [BUG #631](https://github.com/boa-dev/boa/pull/645):\n Unexpected result when applying typeof to undefined value (@jcdickinson)\n- [BUG #667](https://github.com/boa-dev/boa/pull/667):\n Fix panic when calling function that mutates itself (@dvtkrlbs)\n- [BUG #668](https://github.com/boa-dev/boa/pull/668):\n Fix clippy on Nightly (@dvtkrlbs)\n- [BUG #582](https://github.com/boa-dev/boa/pull/582):\n Make `String.prototype.repeat()` ECMAScript specification compliant (@HalidOdat)\n- [BUG #541](https://github.com/boa-dev/boa/pull/541):\n Made all `Math` methods spec compliant (@HalidOdat)\n- [BUG #597](https://github.com/boa-dev/boa/pull/597):\n Made `String.prototype.indexOf` spec compliant. (@HalidOdat)\n- [BUG #598](https://github.com/boa-dev/boa/pull/598):\n Made `String.prototype.lastIndexOf()` spec compliant (@HalidOdat)\n- [BUG #583](https://github.com/boa-dev/boa/pull/583):\n Fix string prototype `trim` methods (@HalidOdat)\n- [BUG #728](https://github.com/boa-dev/boa/pull/728):\n Fix bug when setting the length on String objects (@jasonwilliams)\n- [BUG #710](https://github.com/boa-dev/boa/pull/710):\n Fix panic when a self mutating function is constructing an object (@HalidOdat)\n- [BUG #699](https://github.com/boa-dev/boa/pull/699):\n Fix `Value::to_json` order of items in array (@sele9)\n- [BUG #610](https://github.com/boa-dev/boa/pull/610):\n Fix: `String.prototype.replace` substitutions (@RageKnify)\n- [BUG #645](https://github.com/boa-dev/boa/pull/645):\n Fix undefined constant expression evaluation (@jcdickinson)\n- [BUG #643](https://github.com/boa-dev/boa/pull/643):\n Change default return type from null to undefined (@54k1)\n- [BUG #642](https://github.com/boa-dev/boa/pull/642):\n Missing `constructor` field in ordinary functions (@54k1)\n- [BUG #604](https://github.com/boa-dev/boa/pull/604):\n Missing `__proto__` field in functions instances (@54k1)\n- [BUG #561](https://github.com/boa-dev/boa/pull/561):\n Throw a `TypeError` when a non-object is called (@joshwd36)\n- [BUG #748](https://github.com/boa-dev/boa/pull/748):\n Fix parse error throwing a `TypeError`, instead of `SyntaxError` (@iamsaquib8)\n- [BUG #737](https://github.com/boa-dev/boa/pull/737):\n Make `Object.toString()` spec compliant (@RageKnify)\n\nInternal Improvements:\n\n- [INTERNAL #567](https://github.com/boa-dev/boa/pull/567):\n Add ECMAScript test suite (test262) (@Razican)\n- [INTERNAL #559](https://github.com/boa-dev/boa/pull/559):\n New Lexer (@Lan2u @HalidOdat @Razican)\n- [INTERNAL #712](https://github.com/boa-dev/boa/pull/712):\n Refactor: `Value::to_object` to return `GcObject` (@RageKnify)\n- [INTERNAL #544](https://github.com/boa-dev/boa/pull/544):\n Removed `console`s dependency of `InternalState` (@HalidOdat)\n- [INTERNAL #556](https://github.com/boa-dev/boa/pull/556):\n Added benchmark for goal symbol switching (@Razican)\n- [INTERNAL #578](https://github.com/boa-dev/boa/pull/580):\n Extract `prototype` from internal slots (@HalidOdat)\n- [INTERNAL #553](https://github.com/boa-dev/boa/pull/553):\n Refactor Property Descriptor flags (@HalidOdat)\n- [INTERNAL #592](https://github.com/boa-dev/boa/pull/592):\n `RegExp` specialization (@HalidOdat)\n- [INTERNAL #626](https://github.com/boa-dev/boa/pull/626):\n Refactor `Function` (@HalidOdat @Razican)\n- [INTERNAL #564](https://github.com/boa-dev/boa/pull/581):\n Add benchmarks for \"uglified\" JS (@neeldug)\n- [INTERNAL #706](https://github.com/boa-dev/boa/pull/706):\n Cache well known symbols (@HalidOdat)\n- [INTERNAL #723](https://github.com/boa-dev/boa/pull/723):\n Add fast path for string concatenation (@RageKnify)\n- [INTERNAL #689](https://github.com/boa-dev/boa/pull/689):\n Move `object` module to root (@HalidOdat)\n- [INTERNAL #684](https://github.com/boa-dev/boa/pull/684):\n Move `property` module to root (@HalidOdat)\n- [INTERNAL #674](https://github.com/boa-dev/boa/pull/674):\n Move `value` module to root (@HalidOdat)\n- [INTERNAL #693](https://github.com/boa-dev/boa/pull/693):\n Rename `Object::prototype()` and `Object::set_prototype()` (@RageKnify)\n- [INTERNAL #665](https://github.com/boa-dev/boa/pull/665):\n `approx_eq!` macro for `expm1` tests. (@neeldung)\n- [INTERNAL #581](https://github.com/boa-dev/boa/pull/581):\n Added CLEAN_JS and MINI_JS benches (@neeldung)\n- [INTERNAL #640](https://github.com/boa-dev/boa/pull/640):\n Benchmark refactor (@neeldung)\n- [INTERNAL #635](https://github.com/boa-dev/boa/pull/635):\n Add missing ops to exec module (@jarredholman)\n- [INTERNAL #616](https://github.com/boa-dev/boa/pull/616):\n Remove `Value::as_num_to_power()` (@HalidOdat)\n- [INTERNAL #601](https://github.com/boa-dev/boa/pull/601):\n Removed internal_slots from object (@HalidOdat)\n- [INTERNAL #560](https://github.com/boa-dev/boa/pull/560):\n Added benchmarks for full program execution (@Razican)\n- [INTERNAL #547](https://github.com/boa-dev/boa/pull/547):\n Merged `create` into `init` for builtins (@HalidOdat)\n- [INTERNAL #538](https://github.com/boa-dev/boa/pull/538):\n Cleanup and added test for `String.prototype.concat` (@HalidOdat)\n- [INTERNAL #739](https://github.com/boa-dev/boa/pull/739):\n Add release action (@jasonwilliams)\n- [INTERNAL #744](https://github.com/boa-dev/boa/pull/744):\n Add MacOS check and test to CI (@neeldug)\n\n## [0.9.0 (2020-07-03) - Move to Organisation, 78% faster execution time](https://github.com/boa-dev/boa/compare/v0.8.0...v0.9.0)\n\nFeature Enhancements:\n\n- [FEATURE #414](https://github.com/boa-dev/boa/issues/414):\n Implement `Number` object constants (@Lan2u) (@HalidOdat)\n- [FEATURE #345](https://github.com/boa-dev/boa/issues/345):\n Implement the optional `replacer` parameter in `JSON.stringify( value[, replacer [, space] ] )` (@n14little)\n- [FEATURE #480](https://github.com/boa-dev/boa/issues/480):\n Implement global `Infinity` property (@AnirudhKonduru)\n- [FEATURE #410](https://github.com/boa-dev/boa/pull/410):\n Add support for the reviver function to JSON.parse (@abhijeetbhagat)\n- [FEATURE #425](https://github.com/boa-dev/boa/pull/425):\n Specification compliant `ToString` (`to_string`) (@HalidOdat)\n- [FEATURE #442](https://github.com/boa-dev/boa/pull/442):\n Added `TypeError` implementation (@HalidOdat)\n- [FEATURE #450](https://github.com/boa-dev/boa/pull/450):\n Specification compliant `ToBigInt` (`to_bigint`) (@HalidOdat)\n- [FEATURE #455](https://github.com/boa-dev/boa/pull/455):\n TemplateLiteral Basic lexer implementation (@croraf)\n- [FEATURE #447](https://github.com/boa-dev/boa/issues/447):\n parseInt, parseFloat implementation (@Lan2u)\n- [FEATURE #468](https://github.com/boa-dev/boa/pull/468):\n Add BigInt.asIntN() and BigInt.asUintN() functions (@Tropid)\n- [FEATURE #428](https://github.com/boa-dev/boa/issues/428):\n [Feature Request] - Create benchmark for Array manipulation (@abhijeetbhagat)\n- [FEATURE #439](https://github.com/boa-dev/boa/issues/439):\n Implement break handling in switch statements (@Lan2u)\n- [FEATURE #301](https://github.com/boa-dev/boa/issues/301):\n Implementing the switch statement in the new parser (@Lan2u)\n- [FEATURE #120](https://github.com/boa-dev/boa/issues/120):\n Implement `globalThis` (@zanayr)\n- [FEATURE #513](https://github.com/boa-dev/boa/issues/513):\n Implement `Object.is()` method (@tylermorten)\n- [FEATURE #481](https://github.com/boa-dev/boa/issues/481):\n Implement global `undefined` property (@croraf)\n\nBug Fixes:\n\n- [BUG #412](https://github.com/boa-dev/boa/pull/412):\n Fixed parsing if statement without else block preceded by a newline (@HalidOdat)\n- [BUG #409](https://github.com/boa-dev/boa/pull/409):\n Fix function object constructable/callable (@HalidOdat)\n- [BUG #403](https://github.com/boa-dev/boa/issues/403)\n `Value::to_json()` does not handle `undefined` correctly (@n14little)\n- [BUG #443](https://github.com/boa-dev/boa/issues/443):\n HasOwnProperty should call GetOwnProperty and not GetProperty (@n14little)\n- [BUG #210](https://github.com/boa-dev/boa/issues/210):\n builtinfun.length undefined (@Croraf)\n- [BUG #466](https://github.com/boa-dev/boa/issues/466):\n Change `ToPrimitive()` (`to_primitive()`) hint to be an enum, instead of string (@HalidOdat)\n- [BUG #421](https://github.com/boa-dev/boa/issues/421):\n `NaN` is lexed as a number, not as an identifier (@croraf)\n- [BUG #454](https://github.com/boa-dev/boa/issues/454):\n Function declaration returns the function, it should return `undefined` (@croraf)\n- [BUG #482](https://github.com/boa-dev/boa/issues/482):\n Field access should propagate the exception (`Err(_)`) (@neeldug)\n- [BUG #463](https://github.com/boa-dev/boa/issues/463):\n Use of undefined variable should throw an error (@croraf)\n- [BUG #502](https://github.com/boa-dev/boa/pull/502):\n Fixed global objects initialization order (@HalidOdat)\n- [BUG #509](https://github.com/boa-dev/boa/issues/509):\n JSON.stringify(undefined) panics (@n14little)\n- [BUG #514](https://github.com/boa-dev/boa/issues/514):\n Clean up `Math` Methods (@n14little)\n- [BUG #511](https://github.com/boa-dev/boa/issues/511):\n [Call] Usage of \"this\" in methods is not supported (@jasonwilliams)\n\nInternal Improvements\n\n- [INTERNAL #435](https://github.com/boa-dev/boa/issues/435):\n Optimize type comparisons (@Lan2u)\n- [INTERNAL #296](https://github.com/boa-dev/boa/issues/296):\n using measureme for profiling the interpreter (@jasonwilliams)\n- [INTERNAL #419](https://github.com/boa-dev/boa/pull/419):\n Object specialization (fast paths for many objects) (@HalidOdat)\n- [INTERNAL #392](https://github.com/boa-dev/boa/pull/392):\n Execution and Node modulization (@Razican)\n- [INTERNAL #465](https://github.com/boa-dev/boa/issues/465):\n Refactoring Value (decouple `Gc` from `Value`) (@HalidOdat)\n- [INTERNAL #416](https://github.com/boa-dev/boa/pull/416) & [INTERNAL #423](https://github.com/boa-dev/boa/commit/c8218dd91ef3181e048e7a2659a4fbf8d53c7174):\n Update links to boa-dev (@pedropaulosuzuki)\n- [INTERNAL #378](https://github.com/boa-dev/boa/issues/378):\n Code Coverage! (@Lan2u)\n- [INTERNAL #431](https://github.com/boa-dev/boa/pull/431):\n Updates to PR Benchmarks (@Razican)\n- [INTERNAL #427 #429 #430](https://github.com/boa-dev/boa/commit/64dbf13afd15f12f958daa87a3d236dc9af1a9aa):\n Added new benchmarks (@Razican)\n\n## [0.8.0 (2020-05-23) - BigInt, Modularized Parser, Faster Hashing](https://github.com/boa-dev/boa/compare/v0.7.0...v0.8.0)\n\n`v0.8.0` brings more language implementations, such as do..while, function objects and also more recent EcmaScript additions, like BigInt.\nWe have now moved the Web Assembly build into the `wasm` package, plus added a code of conduct for those contributing.\n\nThe parser has been even more modularized in this release making it easier to add new parsing rules.\n\nBoa has migrated it's object implemention to FXHash which brings much improved results over the built-in Rust hashmaps (at the cost of less DOS Protection).\n\nFeature Enhancements:\n\n- [FEATURE #121](https://github.com/boa-dev/boa/issues/121):\n `BigInt` Implemented (@HalidOdat)\n- [FEATURE #293](https://github.com/boa-dev/boa/pull/293):\n Improved documentation of all modules (@HalidOdat)\n- [FEATURE #302](https://github.com/boa-dev/boa/issues/302):\n Implement do..while loop (@ptasz3k)\n- [FEATURE #318](https://github.com/boa-dev/boa/pull/318):\n Added continous integration for windows (@HalidOdat)\n- [FEATURE #290](https://github.com/boa-dev/boa/pull/290):\n Added more build profiles (@Razican)\n- [FEATURE #323](https://github.com/boa-dev/boa/pull/323):\n Aded more benchmarks (@Razican)\n- [FEATURE #326](https://github.com/boa-dev/boa/pull/326):\n Rename Boa CLI (@sphinxc0re)\n- [FEATURE #312](https://github.com/boa-dev/boa/pull/312):\n Added jemallocator for linux targets (@Razican)\n- [FEATURE #339](https://github.com/boa-dev/boa/pull/339):\n Improved Method parsing (@muskuloes)\n- [FEATURE #352](https://github.com/boa-dev/boa/pull/352):\n create boa-wasm package (@muskuloes)\n- [FEATURE #304](https://github.com/boa-dev/boa/pull/304):\n Modularized parser\n- [FEATURE #141](https://github.com/boa-dev/boa/issues/141):\n Implement function objects (@jasonwilliams)\n- [FEATURE #365](https://github.com/boa-dev/boa/issues/365):\n Implement for loop execution (@Razican)\n- [FEATURE #356](https://github.com/boa-dev/boa/issues/356):\n Use Fx Hash to speed up hash maps in the compiler (@Razican)\n- [FEATURE #321](https://github.com/boa-dev/boa/issues/321):\n Implement unary operator execution (@akryvomaz)\n- [FEATURE #379](https://github.com/boa-dev/boa/issues/379):\n Automatic auditing of Boa (@n14little)\n- [FEATURE #264](https://github.com/boa-dev/boa/issues/264):\n Implement `this` (@jasonwilliams)\n- [FEATURE #395](https://github.com/boa-dev/boa/pull/395):\n impl abstract-equality-comparison (@hello2dj)\n- [FEATURE #359](https://github.com/boa-dev/boa/issues/359):\n impl typeof (@RestitutorOrbis)\n- [FEATURE #390](https://github.com/boa-dev/boa/pull/390):\n Modularize try statement parsing (@abhijeetbhagat)\n\nBug fixes:\n\n- [BUG #308](https://github.com/boa-dev/boa/issues/308):\n Assignment operator not working in tests (a = a +1) (@ptasz3k)\n- [BUG #322](https://github.com/boa-dev/boa/issues/322):\n Benchmarks are failing in master (@Razican)\n- [BUG #325](https://github.com/boa-dev/boa/pull/325):\n Put JSON functions on the object, not the prototype (@coolreader18)\n- [BUG #331](https://github.com/boa-dev/boa/issues/331):\n We only get `Const::Num`, never `Const::Int` (@HalidOdat)\n- [BUG #209](https://github.com/boa-dev/boa/issues/209):\n Calling `new Array` with 1 argument doesn't work properly (@HalidOdat)\n- [BUG #266](https://github.com/boa-dev/boa/issues/266):\n Panic assigning named function to variable (@Razican)\n- [BUG #397](https://github.com/boa-dev/boa/pull/397):\n fix `NaN` is lexed as identifier, not as a number (@attliaLin)\n- [BUG #362](https://github.com/boa-dev/boa/pull/362):\n Remove Monaco Editor Webpack Plugin and Manually Vendor Editor Workers (@subhankar-panda)\n- [BUG #406](https://github.com/boa-dev/boa/pull/406):\n Dependency Upgrade (@Razican)\n- [BUG #407](https://github.com/boa-dev/boa/pull/407):\n `String()` wasn't defaulting to empty string on call (@jasonwilliams)\n- [BUG #404](https://github.com/boa-dev/boa/pull/404):\n Fix for 0 length new String(@tylermorten)\n\nCode Of Conduct:\n\n- [COC #384](https://github.com/boa-dev/boa/pull/384):\n Code of conduct added (@Razican)\n\nSecurity:\n\n- [SEC #391](https://github.com/boa-dev/boa/pull/391):\n run security audit daily at midnight. (@n14little)\n\n## [# 0.7.0 (2020-04-13) - New Parser is 67% faster](https://github.com/boa-dev/boa/compare/v0.6.0...v0.7.0)\n\n`v0.7.0` brings a REPL, Improved parser messages and a new parser!\nThis is now the default behaviour of Boa, so running Boa without a file argument will bring you into a javascript shell.\nTests have also been moved to their own files, we had a lot of tests in some modules so it was time to separate.\n\n### New Parser\n\nMost of the work in this release has been on rewriting the parser. A big task taken on by [HalidOdat](https://github.com/HalidOdat), [Razican](https://github.com/Razican) and [myself](https://github.com/jasonwilliams).\n\nThe majority of the old parser was 1 big function (called [`parse`](https://github.com/boa-dev/boa/blob/019033eff066e8c6ba9456139690eb214a0bf61d/boa/src/syntax/parser.rs#L353)) which had some pattern matching on each token coming in.\nThe easy branches could generate expressions (which were basically AST Nodes), the more involved branches would recursively call into the same function, until eventually you had an expression generated.\n\nThis only worked so far, eventually debugging parsing problems were difficult, also more bugs were being raised against the parser which couldn't be fixed.\n\nWe decided to break the parser into more of a state-machine. The initial decision for this was inspired by [Fedor Indutny](https://github.com/indutny) who did a talk at (the last) JSConf EU about how he broke up the old node-parser to make it more maintanable. He goes into more detail here https://www.youtube.com/watch?v=x3k_5Mi66sY&feature=youtu.be&t=530\n\nThe new parser has functions to match the states of parsing in the spec. For example https://tc39.es/ecma262/#prod-VariableDeclaration has a matching function `read_variable_declaration`. This not only makes it better to maintain but easier for new contributors to get involed, as following the parsing logic of the spec is easier than before.\n\nOnce finished some optimisations were added by [HalidOdat](https://github.com/HalidOdat) to use references to the tokens instead of cloning them each time we take them from the lexer.\nThis works because the tokens live just as long as the parser operations do, so we don't need to copy the tokens.\nWhat this brings is a huge performance boost, the parser is 67% faster than before!\n\n![Parser Improvement](./docs/img/parser-graph.png)\n\nFeature enhancements:\n\n- [FEATURE #281](https://github.com/boa-dev/boa/pull/281):\n Rebuild the parser (@jasonwilliams, @Razican, @HalidOdat)\n- [FEATURE #278](https://github.com/boa-dev/boa/pull/278):\n Added the ability to dump the token stream or ast in bin. (@HalidOdat)\n- [FEATURE #253](https://github.com/boa-dev/boa/pull/253):\n Implement Array.isArray (@cisen)\n- [FEATURE](https://github.com/boa-dev/boa/commit/edab5ca6cc10d13265f82fa4bc05d6b432a362fc)\n Switch to normal output instead of debugged output (stdout/stdout) (@jasonwilliams)\n- [FEATURE #258](https://github.com/boa-dev/boa/pull/258):\n Moved test modules to their own files (@Razican)\n- [FEATURE #267](https://github.com/boa-dev/boa/pull/267):\n Add print & REPL functionality to CLI (@JohnDoneth)\n- [FEATURE #268](https://github.com/boa-dev/boa/pull/268):\n Addition of forEach() (@jasonwilliams) (@xSke)\n- [FEATURE #262](https://github.com/boa-dev/boa/pull/262):\n Implement Array.prototype.filter (@Nickforall)\n- [FEATURE #261](https://github.com/boa-dev/boa/pull/261):\n Improved parser error messages (@Razican)\n- [FEATURE #277](https://github.com/boa-dev/boa/pull/277):\n Add a logo to the project (@HalidOdat)\n- [FEATURE #260](https://github.com/boa-dev/boa/pull/260):\n Add methods with f64 std equivelant to Math object (@Nickforall)\n\nBug fixes:\n\n- [BUG #249](https://github.com/boa-dev/boa/pull/249):\n fix(parser): handle trailing comma in object literals (@gomesalexandre)\n- [BUG #244](https://github.com/boa-dev/boa/pull/244):\n Fixed more Lexer Panics (@adumbidiot)\n- [BUG #256](https://github.com/boa-dev/boa/pull/256):\n Fixed comments lexing (@Razican)\n- [BUG #251](https://github.com/boa-dev/boa/issues/251):\n Fixed empty returns (@Razican)\n- [BUG #272](https://github.com/boa-dev/boa/pull/272):\n Fix parsing of floats that start with a zero (@Nickforall)\n- [BUG #240](https://github.com/boa-dev/boa/issues/240):\n Fix parser panic\n- [BUG #273](https://github.com/boa-dev/boa/issues/273):\n new Class().method() has incorrect precedence\n\nDocumentation Updates:\n\n- [DOC #297](https://github.com/boa-dev/boa/pull/297):\n Better user contributed documentation\n\n## [0.6.0 (2020-02-14) - Migration to Workspace Architecture + lexer/parser improvements](https://github.com/boa-dev/boa/compare/v0.5.1...v0.6.0)\n\nThe lexer has had several fixes in this release, including how it parses numbers, scientific notation should be improved.\nOn top of that the lexer no longer panics on errors including Syntax Errors (thanks @adumbidiot), instead you get some output on where the error happened.\n\n### Moving to a workspace architecture\n\nBoa offers both a CLI and a library, initially these were all in the same binary. The downside is\nthose who want to embed boa as-is end up with all of the command-line dependencies.\nSo the time has come to separate out the two, this is normal procedure, this should be analogous to ripgrep\nand the regex crate.\nCargo has great support for workspaces, so this shouldn't be an issue.\n\n### Benchmarks\n\nWe now have [benchmarks which run against master](https://boajs.dev/boa/dev/bench/)!\nThanks to Github Actions these will run automatically a commit is merged.\n\nFeature enhancements:\n\n- [FEATURE #218](https://github.com/boa-dev/boa/pull/218):\n Implement Array.prototype.toString (@cisen)\n- [FEATURE #216](https://github.com/boa-dev/boa/commit/85e9a3526105a600358bd53811e2b022987c6fc8):\n Keep accepting new array elements after spread.\n- [FEATURE #220](https://github.com/boa-dev/boa/pull/220):\n Documentation updates. (@croraf)\n- [FEATURE #226](https://github.com/boa-dev/boa/pull/226):\n add parser benchmark for expressions. (@jasonwilliams)\n- [FEATURE #217](https://github.com/boa-dev/boa/pull/217):\n String.prototype.replace() implemented\n- [FEATURE #247](https://github.com/boa-dev/boa/pull/247):\n Moved to a workspace architecture (@Razican)\n\nBug fixes:\n\n- [BUG #222](https://github.com/boa-dev/boa/pull/222):\n Fixed clippy errors (@IovoslavIovchev)\n- [BUG #228](https://github.com/boa-dev/boa/pull/228):\n [lexer: single-line-comment] Fix bug when single line comment is last line of file (@croraf)\n- [BUG #229](https://github.com/boa-dev/boa/pull/229):\n Replace error throwing with panic in \"Lexer::next()\" (@croraf)\n- [BUG #232/BUG #238](https://github.com/boa-dev/boa/pull/232):\n Clippy checking has been scaled right back to just Perf and Style (@jasonwilliams)\n- [BUG #227](https://github.com/boa-dev/boa/pull/227):\n Array.prototype.toString should be called by ES value (@cisen)\n- [BUG #242](https://github.com/boa-dev/boa/pull/242):\n Fixed some panics in the lexer (@adumbidiot)\n- [BUG #235](https://github.com/boa-dev/boa/pull/235):\n Fixed arithmetic operations with no space (@gomesalexandre)\n- [BUG #245](https://github.com/boa-dev/boa/pull/245):\n Fixed parsing of floats with scientific notation (@adumbidiot)\n\n## [# 0.5.1 (2019-12-02) - Rest / Spread (almost)](https://github.com/boa-dev/boa/compare/v0.5.0...v0.5.1)\n\nFeature enhancements:\n\n- [FEATURE #151](https://github.com/boa-dev/boa/issues/151):\n Implement the Rest/Spread operator (functions and arrays).\n- [FEATURE #193](https://github.com/boa-dev/boa/issues/193):\n Implement macro for setting builtin functions\n- [FEATURE #211](https://github.com/boa-dev/boa/pull/211):\n Better Display support for all Objects (pretty printing)\n\n## [# 0.5.0 (2019-11-06) - Hacktoberfest Release](https://github.com/boa-dev/boa/compare/v0.4.0...v0.5.1)\n\nFeature enhancements:\n\n- [FEATURE #119](https://github.com/boa-dev/boa/issues/119):\n Introduce realm struct to hold realm context and global object.\n- [FEATURE #89](https://github.com/boa-dev/boa/issues/89):\n Implement exponentiation operator. Thanks @arbroween\n- [FEATURE #47](https://github.com/boa-dev/boa/issues/47):\n Add tests for comments in source code. Thanks @Emanon42\n- [FEATURE #137](https://github.com/boa-dev/boa/issues/137):\n Use Monaco theme for the demo page\n- [FEATURE #114](https://github.com/boa-dev/boa/issues/114):\n String.match(regExp) is implemented (@muskuloes)\n- [FEATURE #115](https://github.com/boa-dev/boa/issues/115):\n String.matchAll(regExp) is implemented (@bojan88)\n- [FEATURE #163](https://github.com/boa-dev/boa/issues/163):\n Implement Array.prototype.every() (@letmutx)\n- [FEATURE #165](https://github.com/boa-dev/boa/issues/165):\n Implement Array.prototype.find() (@letmutx)\n- [FEATURE #166](https://github.com/boa-dev/boa/issues/166):\n Implement Array.prototype.findIndex() (@felipe-fg)\n- [FEATURE #39](https://github.com/boa-dev/boa/issues/39):\n Implement block scoped variable declarations (@barskern)\n- [FEATURE #161](https://github.com/boa-dev/boa/pull/161):\n Enable obj[key] = value syntax.\n- [FEATURE #179](https://github.com/boa-dev/boa/issues/179):\n Implement the Tilde operator (@letmutx)\n- [FEATURE #189](https://github.com/boa-dev/boa/pull/189):\n Implement Array.prototype.includes (incl tests) (@simonbrahan)\n- [FEATURE #180](https://github.com/boa-dev/boa/pull/180):\n Implement Array.prototype.slice (@muskuloes @letmutx)\n- [FEATURE #152](https://github.com/boa-dev/boa/issues/152):\n Short Function syntax (no arguments)\n- [FEATURE #164](https://github.com/boa-dev/boa/issues/164):\n Implement Array.prototype.fill() (@bojan88)\n- Array tests: Tests implemented for shift, unshift and reverse, pop and push (@muskuloes)\n- Demo page has been improved, new font plus change on input. Thanks @WofWca\n- [FEATURE #182](https://github.com/boa-dev/boa/pull/182):\n Implement some Number prototype methods (incl tests) (@pop)\n- [FEATURE #34](https://github.com/boa-dev/boa/issues/34):\n Number object and Constructore are implemented (including methods) (@pop)\n- [FEATURE #194](https://github.com/boa-dev/boa/pull/194):\n Array.prototype.map (@IovoslavIovchev)\n- [FEATURE #90](https://github.com/boa-dev/boa/issues/90):\n Symbol Implementation (@jasonwilliams)\n\nBug fixes:\n\n- [BUG #113](https://github.com/boa-dev/boa/issues/113):\n Unassigned variables have default of undefined (@pop)\n- [BUG #61](https://github.com/boa-dev/boa/issues/61):\n Clippy warnings/errors fixed (@korpen)\n- [BUG #147](https://github.com/boa-dev/boa/pull/147):\n Updated object global\n- [BUG #154](https://github.com/boa-dev/boa/issues/154):\n Correctly handle all whitespaces within the lexer\n- Tidy up Globals being added to Global Object. Thanks @DomParfitt\n\n## 0.4.0 (2019-09-25)\n\nv0.4.0 brings quite a big release. The biggest feature to land is the support of regular expressions.\nFunctions now have the arguments object supported and we have a [`debugging`](docs/debugging.md) section in the docs.\n\nFeature enhancements:\n\n- [FEATURE #6](https://github.com/boa-dev/boa/issues/6):\n Support for regex literals. (Big thanks @999eagle)\n- [FEATURE #13](https://github.com/boa-dev/boa/issues/13):\n toLowerCase, toUpperCase, substring, substr and valueOf implemented (thanks @arbroween)\n- Support for `arguments` object within functions\n- `StringData` instead of `PrimitieData` to match spec\n- Native function signatures changed, operations added to match spec\n- Primitives can now be boxed/unboxed when methods are ran on them\n- Spelling edits (thanks @someguynamedmatt)\n- Ability to set global values before interpreter starts (thanks @999eagle)\n- Assign operators implemented (thanks @oll3)\n-\n\nBug fixes:\n\n- [BUG #57](https://github.com/boa-dev/boa/issues/57):\n Fixed issue with stackoverflow by implementing early returns.\n- Allow to re-assign value to an existing binding. (Thanks @oll3)\n\n## 0.3.0 (2019-07-26)\n\n- UnexpectedKeyword(Else) bug fixed https://github.com/boa-dev/boa/issues/38\n- Contributing guide added\n- Ability to specify file - Thanks @callumquick\n- Travis fixes\n- Parser Tests - Thanks @Razican\n- Migrate to dyn traits - Thanks @Atul9\n- Added implementations for Array.prototype: concat(), push(), pop() and join() - Thanks @callumquick\n- Some clippy Issues fixed - Thanks @Razican\n- Objects have been refactored to use structs which are more closely aligned with the specification\n- Benchmarks have been added\n- String and Array specific console.log formats - Thanks @callumquick\n- isPropertyKey implementation added - Thanks @KrisChambers\n- Unit Tests for Array and Strings - Thanks @GalAster\n- typo fix - Thanks @palerdot\n- dist cleanup, thanks @zgotsch\n\n## 0.2.1 (2019-06-30)\n\nSome String prototype methods are implemented.\nThanks to @lennartbuit we have\ntrim/trimStart/trimEnd added to the string prototype\n\nFeature enhancements:\n\n- [String.prototype.concat ( ...args )](https://tc39.es/ecma262/#sec-string.prototype.slice)\n- [String.prototype.endsWith ( searchString [ , endPosition ] )](https://tc39.es/ecma262/#sec-string.prototype.endswith)\n- [String.prototype.includes ( searchString [ , position ] )](https://tc39.es/ecma262/#sec-string.prototype.includes)\n- [String.prototype.indexOf ( searchString [ , position ] )](https://tc39.es/ecma262/#sec-string.prototype.indexof)\n- [String.prototype.lastIndexOf ( searchString [ , position ] )](https://tc39.es/ecma262/#sec-string.prototype.lastindexof)\n- [String.prototype.repeat ( count )](https://tc39.es/ecma262/#sec-string.prototype.repeat)\n- [String.prototype.slice ( start, end )](https://tc39.es/ecma262/#sec-string.prototype.slice)\n- [String.prototype.startsWith ( searchString [ , position ] )](https://tc39.es/ecma262/#sec-string.prototype.startswith)\n\nBug fixes:\n\n- Plenty\n\n## 0.2.0 (2019-06-10)\n\nWorking state reached\n\n- Tests on the lexer, conforms with puncturators and keywords from TC39 specification\n- wasm-bindgen added with working demo in Web Assembly\n- snapshot of boa in a working state for the first time\n" }, { "path": "CODEOWNERS", "content": "# Fallback to all maintainers for common directories.\n\n* @boa-dev/maintainers\n\n# Owned components\n\ncore/engine/src/builtins/intl @jedel1043 @nekevss\ncore/engine/src/builtins/temporal @jasonwilliams @jedel1043 @nekevss\n" }, { "path": "CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nWe as members, contributors, and leaders pledge to make participation in our\ncommunity a harassment-free experience for everyone, regardless of age, body\nsize, visible or invisible disability, ethnicity, sex characteristics, gender\nidentity and expression, level of experience, education, socio-economic status,\nnationality, personal appearance, race, caste, color, religion, or sexual\nidentity and orientation.\n\nWe pledge to act and interact in ways that contribute to an open, welcoming,\ndiverse, inclusive, and healthy community.\n\n## Our Standards\n\nExamples of behavior that contributes to a positive environment for our\ncommunity include:\n\n- Demonstrating empathy and kindness toward other people\n- Being respectful of differing opinions, viewpoints, and experiences\n- Giving and gracefully accepting constructive feedback\n- Accepting responsibility and apologizing to those affected by our mistakes,\n and learning from the experience\n- Focusing on what is best not just for us as individuals, but for the overall\n community\n\nExamples of unacceptable behavior include:\n\n- The use of sexualized language or imagery, and sexual attention or advances of\n any kind\n- Trolling, insulting or derogatory comments, and personal or political attacks\n- Public or private harassment\n- Publishing others' private information, such as a physical or email address,\n without their explicit permission\n- Other conduct which could reasonably be considered inappropriate in a\n professional setting\n\n## Enforcement Responsibilities\n\nCommunity leaders are responsible for clarifying and enforcing our standards of\nacceptable behavior and will take appropriate and fair corrective action in\nresponse to any behavior that they deem inappropriate, threatening, offensive,\nor harmful.\n\nCommunity leaders have the right and responsibility to remove, edit, or reject\ncomments, commits, code, wiki edits, issues, and other contributions that are\nnot aligned to this Code of Conduct, and will communicate reasons for moderation\ndecisions when appropriate.\n\n## Scope\n\nThis Code of Conduct applies within all community spaces, and also applies when\nan individual is officially representing the community in public spaces.\nExamples of representing our community include using an official e-mail address,\nposting via an official social media account, or acting as an appointed\nrepresentative at an online or offline event.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be\nreported to the community leaders responsible for enforcement at\n[Matrix](https://matrix.to/#/#boa:matrix.org) by contacting any of the admins in the space.\nAll complaints will be reviewed and investigated promptly and fairly.\n\nAll community leaders are obligated to respect the privacy and security of the\nreporter of any incident.\n\n## Enforcement Guidelines\n\nCommunity leaders will follow these Community Impact Guidelines in determining\nthe consequences for any action they deem in violation of this Code of Conduct:\n\n### 1. Correction\n\n**Community Impact**: Use of inappropriate language or other behavior deemed\nunprofessional or unwelcome in the community.\n\n**Consequence**: A private, written warning from community leaders, providing\nclarity around the nature of the violation and an explanation of why the\nbehavior was inappropriate. A public apology may be requested.\n\n### 2. Warning\n\n**Community Impact**: A violation through a single incident or series of\nactions.\n\n**Consequence**: A warning with consequences for continued behavior. No\ninteraction with the people involved, including unsolicited interaction with\nthose enforcing the Code of Conduct, for a specified period of time. This\nincludes avoiding interactions in community spaces as well as external channels\nlike social media. Violating these terms may lead to a temporary or permanent\nban.\n\n### 3. Temporary Ban\n\n**Community Impact**: A serious violation of community standards, including\nsustained inappropriate behavior.\n\n**Consequence**: A temporary ban from any sort of interaction or public\ncommunication with the community for a specified period of time. No public or\nprivate interaction with the people involved, including unsolicited interaction\nwith those enforcing the Code of Conduct, is allowed during this period.\nViolating these terms may lead to a permanent ban.\n\n### 4. Permanent Ban\n\n**Community Impact**: Demonstrating a pattern of violation of community\nstandards, including sustained inappropriate behavior, harassment of an\nindividual, or aggression toward or disparagement of classes of individuals.\n\n**Consequence**: A permanent ban from any sort of public interaction within the\ncommunity.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage],\nversion 2.1, available at\n[https://www.contributor-covenant.org/version/2/1/code_of_conduct.html][v2.1].\n\nCommunity Impact Guidelines were inspired by\n[Mozilla's code of conduct enforcement ladder][mozilla coc].\n\nFor answers to common questions about this code of conduct, see the FAQ at\n[https://www.contributor-covenant.org/faq][faq]. Translations are available at\n[https://www.contributor-covenant.org/translations][translations].\n\n[homepage]: https://www.contributor-covenant.org\n[v2.1]: https://www.contributor-covenant.org/version/2/1/code_of_conduct.html\n[mozilla coc]: https://github.com/mozilla/diversity\n[faq]: https://www.contributor-covenant.org/faq\n[translations]: https://www.contributor-covenant.org/translations\n" }, { "path": "CONTRIBUTING.md", "content": "# Contributing to Boa\n\nBoa welcomes contribution from everyone. Here are the guidelines if you are\nthinking of helping out:\n\n## Contributions\n\nContributions to Boa or its dependencies should be made in the form of GitHub\npull requests. Each pull request will be reviewed by a core contributor\n(someone with permission to land patches) and either landed in the main tree or\ngiven feedback for changes that would be required. All contributions should\nfollow this format.\n\nShould you wish to work on an issue, please claim it first by commenting on\nthe GitHub issue that you want to work on it. This is to prevent duplicated\nefforts from contributors on the same issue.\n\nHead over to [issues][issues] and check for \"good first issue\" labels to find\ngood tasks to start with. If you come across words or jargon that do not make\nsense, please ask!\n\nIf you don't already have Rust installed [_rustup_][rustup] is the recommended\ntool to use. It will install Rust and allow you to switch between _nightly_,\n_stable_ and _beta_. You can also install additional components. In Linux, you\ncan run:\n\n```shell\ncurl --proto '=https' --tlsv1.2 -sSf https://sh.rustup.rs | sh\n```\n\nThen simply clone this project and `cargo build`.\n\n### Running the compiler\n\nYou can execute a Boa console by running `cargo run`, and you can compile a list\nof JavaScript files by running `cargo run -- file1.js file2.js` and so on.\n\n### Debugging\n\nKnowing how to debug the interpreter should help you resolve problems quite quickly.\nSee [Debugging](./docs/debugging.md).\n\n### Web Assembly\n\nIf you want to develop on the web assembly side you can run `yarn serve` and then go\nto .\n\n### Setup\n\n#### VSCode Plugins\n\nEither the [Rust (RLS)][rls_vscode] or the [Rust Analyzer][rust-analyzer_vscode]\nextensions are preferred. RLS is easier to set up but some of the development is\nmoving towards Rust Analyzer. Both of these plugins will help you with your Rust\nDevelopment\n\n#### Tasks\n\nThere are some pre-defined tasks in [tasks.json](.vscode/tasks.json)\n\n- Build - shift+cmd/ctrl+b should build and run cargo. You should be able to make changes and run this task.\n- Test - (there is no shortcut, you'll need to make one) - Runs `Cargo Test`.\n I personally set a shortcut of shift+cmd+option+T (or shift+ctrl+alt+T)\n\n## Testing\n\nBoa provides its own test suite, and can also run the official ECMAScript test suite. To run the Boa test\nsuite, you can just run the normal `cargo test`, and to run the full ECMAScript test suite, you can run it\nwith this command:\n\n```shell\ncargo run --release --bin boa_tester -- run -v 2> error.log\n```\n\nThis will run the test suite in verbose mode (you can remove the `-v` part to run it in non-verbose mode),\nand output nice colorings in the terminal. It will also output any panic information into the `error.log` file.\n\nYou can get some more verbose information that tells you the exact name of each test that is being run, useful\nfor debugging purposes by setting up the verbose flag twice, for example `-vv`. If you want to know the output of\neach test that is executed, you can use the triple verbose (`-vvv`) flag.\n\nIf you want to only run one sub-suite or even one test (to just check if you fixed/broke something specific),\nyou can do it with the `-s` parameter, and then passing the path to the sub-suite or test that you want to run. Note\nthat the `-s` parameter value should be a path relative to the `test262` directory. For example, to run the number\ntype tests, use `-s test/language/types/number`.\n\nFinally, if you're using the verbose flag and running a sub suite with a small number of tests, then the output will\nbe more readable if you disable parallelism with the `-d` flag. All together it might look something like:\n\n```shell\ncargo run --release --bin boa_tester -- run -vv -d -s test/language/types/number 2> error.log\n```\n\nTo save test results for later comparison, use the `-o` flag to specify an output directory:\n\n```shell\ncargo run --release --bin boa_tester -- run -o ./test-results\n```\n\n### Comparing Test Results\n\nYou can compare two test suite runs to see what changed:\n\n```shell\ncargo run --release --bin boa_tester -- compare \n```\n\nBoth arguments can be either result files (e.g., `latest.json`) or directories containing test results.\nWhen directories are provided, the tester automatically uses the `latest.json` file from each directory.\n\nFor example:\n\n```shell\n# Compare using directories\ncargo run --release --bin boa_tester -- compare ./test-results-main ./test-results-feature\n\n# Compare using explicit files\ncargo run --release --bin boa_tester -- compare ./test-results-main/latest.json ./test-results-feature/latest.json\n```\n\n## Documentation\n\nTo build the development documentation, run:\n\n```shell\ncargo doc --all-features --document-private-items --workspace\n```\n\nThis will also document all the dependencies on the workspace, which could be heavier in size.\nTo only generate documentation for the workspace members, just add the `--no-deps` flag:\n\n```shell\ncargo doc --all-features --document-private-items --workspace --no-deps\n```\n\n## Reading and Understanding the ECMAScript Specification\n\nMany contributions to Boa involve implementing parts of the [ECMAScript\nLanguage Specification](https://tc39.es/ecma262/), which defines how JavaScript\nbehaves. At first, the spec can seem intimidating, but it quickly becomes\neasier to follow once you get familiar with its structure and notation.\n\nThe specification is written in a pseudo-language designed to describe behavior\nwithout being tied to any particular programming language. It introduces some\nimportant concepts:\n\n- **Abstract operations** – general algorithms (i.e. [`IsCallable`](https://tc39.es/ecma262/#sec-iscallable)),\n which usually map to Rust functions or methods.\n- **Internal slots** – hidden object fields like\n [`[[Prototype]]`](https://tc39.es/ecma262/#sec-ordinary-object-internal-methods-and-internal-slots)\n that correspond to private struct or enum fields in Rust, not accessible to\n JavaScript.\n- **Completion records** – describe how values or exceptions are returned\n ([link](https://tc39.es/ecma262/#sec-completion-record-specification-type)),\n and typically map to `JsResult` types in Rust.\n- **Symbols `?` and `!`** – `? Foo(...)` propagates exceptions mapped to\n propagate `?` operator in rust, while `! Foo(...)` are infallible operations\n and are usually mapped to\n [`Result::expect()`](https://doc.rust-lang.org/std/result/enum.Result.html#method.expect)\n call.\n\nFor an in-depth introduction to these concepts and more, check out [V8’s “Understanding\nthe ECMAScript spec”\nseries](https://v8.dev/blog/tags/understanding-ecmascript), starting with [Part\n1](https://v8.dev/blog/understanding-ecmascript-part-1).\n\nWhen implementing the spec in Boa, try to map your code to the corresponding\nspec steps whenever possible, and indicate in comments which steps are implemented.\nThis makes the code easier to understand, ensures it aligns with the\nspecification, and helps reviewers and future contributors follow the logic.\n\nIf a spec step does not map directly because of Rust limitations or performance\nreasons, just add a note in the code explaining the difference. Being clear\nabout these cases helps others understand your implementation while still\nfollowing the spec as closely as possible.\n\nFor examples of how to implement the specification, check out the built-in\nimplementations in Boa\n[here](https://github.com/boa-dev/boa/tree/main/core/engine/src/builtins).\n\nIf anything in the specification is confusing, don’t hesitate to ask in the\n[Boa Matrix](https://matrix.to/#/#boa:matrix.org) channel.\n\n## Learning Resources\n\nFor contributors looking to learn JavaScript and how it works, check out the [Mozilla Developer Guided Tours](https://www.youtube.com/playlist?list=PLo3w8EB99pqJVPhmYbYdInBvAGarDavh-).\n\n## Communication\n\nWe have a Matrix space, feel free to ask questions here:\n\n\n[issues]: https://github.com/boa-dev/boa/issues\n[rustup]: https://rustup.rs/\n[rls_vscode]: https://marketplace.visualstudio.com/items?itemName=rust-lang.rust\n[rust-analyzer_vscode]: https://marketplace.visualstudio.com/items?itemName=matklad.rust-analyzer\n" }, { "path": "Cargo.toml", "content": "[workspace]\nresolver = \"2\"\nmembers = [\n # CORE\n \"core/*\",\n # FFI\n \"ffi/*\",\n # TESTS\n \"tests/*\",\n # TOOLS\n \"tools/*\",\n # OTHERS\n \"examples\",\n \"cli\",\n # UTILS\n \"utils/*\",\n # BENCHES\n \"benches\",\n]\n\nexclude = [\n \"tests/fuzz\", # Does weird things on Windows tests\n \"tests/src\", # Just a hack to have fuzz inside tests\n \"tests/wpt\", # Should not run WPT by default.\n]\n\n[workspace.package]\nedition = \"2024\"\nversion = \"1.0.0-dev\"\nrust-version = \"1.91.0\"\nauthors = [\"boa-dev\"]\nrepository = \"https://github.com/boa-dev/boa\"\nlicense = \"Unlicense OR MIT\"\ndescription = \"Boa is a Javascript lexer, parser and compiler written in Rust. Currently, it has support for some of the language.\"\n\n[workspace.dependencies]\n\n# Repo Crates\nboa_ast = { version = \"~1.0.0-dev\", path = \"core/ast\" }\nboa_engine = { version = \"~1.0.0-dev\", path = \"core/engine\", default-features = false }\nboa_gc = { version = \"~1.0.0-dev\", path = \"core/gc\" }\nboa_icu_provider = { version = \"~1.0.0-dev\", path = \"core/icu_provider\" }\nboa_interner = { version = \"~1.0.0-dev\", path = \"core/interner\" }\nboa_macros = { version = \"~1.0.0-dev\", path = \"core/macros\" }\nboa_parser = { version = \"~1.0.0-dev\", path = \"core/parser\" }\nboa_runtime = { version = \"~1.0.0-dev\", path = \"core/runtime\" }\nboa_string = { version = \"~1.0.0-dev\", path = \"core/string\" }\n\n# Utility Repo Crates\ntag_ptr = { version = \"~0.1.0\", path = \"utils/tag_ptr\" }\nsmall_btree = { version = \"~0.1.0\", path = \"utils/small_btree\" }\n\n# Shared deps\narbitrary = \"1\"\nbase64 = \"0.22.1\"\nbitflags = \"2.11.0\"\nclap = \"4.5.59\"\ncolored = \"3.1.1\"\ncow-utils = \"0.1.3\"\nfast-float2 = \"0.2.3\"\nhashbrown = \"0.16.1\"\nhttp = { version = \"1.4.0\" }\niana-time-zone = \"0.1.65\"\nindexmap = { version = \"2.13.0\", default-features = false }\nindoc = \"2.0.7\"\nitoa = \"1.0.18\"\njemallocator = \"0.5.4\"\nmimalloc-safe = \"0.1.56\"\nlz4_flex = \"0.13.0\"\nnum-bigint = \"0.4.6\"\nnum-traits = \"0.2.19\"\nonce_cell = { version = \"1.21.3\", default-features = false }\noneshot = \"0.2.1\"\nphf = { version = \"0.13.1\", default-features = false }\npollster = \"0.4.0\"\nregex = \"1.12.3\"\nregress = { version = \"0.11.0\", features = [\"utf16\"] }\nreqwest = { version = \"0.13.2\", default-features = false, features = [\"rustls-no-provider\"] }\nrustls = { version = \"0.23.37\", default-features = false, features = [\"ring\"] }\nrustc-hash = { version = \"2.1.1\", default-features = false }\nserde_json = \"1.0.149\"\nserde = \"1.0.219\"\nstatic_assertions = \"1.1.0\"\ntextwrap = \"0.16.2\"\nthin-vec = \"0.2.14\"\ntime = { version = \"0.3.47\", default-features = false, features = [\n \"local-offset\",\n \"large-dates\",\n \"parsing\",\n \"formatting\",\n \"macros\",\n] }\nlog = \"0.4.29\"\nsimple_logger = \"5.1.0\"\ncargo_metadata = \"0.23.1\"\ntrybuild = \"1.0.116\"\nrayon = \"1.10.0\"\ntoml = \"1.0.7\"\ncolor-eyre = \"0.6.3\"\ncomfy-table = \"7.2.2\"\nserde_repr = \"0.1.20\"\nbus = \"2.4.1\"\nwasm-bindgen = { version = \"0.2.97\", default-features = false }\ngetrandom = { version = \"0.4.2\", default-features = false }\nconsole_error_panic_hook = \"0.1.7\"\nwasm-bindgen-test = \"0.3.64\"\nsmol = \"2.0.2\"\nrustyline = { version = \"17.0.2\", default-features = false }\ndhat = \"0.3.3\"\nquote = \"1.0.45\"\nsyn = { version = \"2.0.116\", default-features = false }\nproc-macro2 = \"1.0\"\nsynstructure = \"0.13\"\nmeasureme = \"12.0.3\"\npaste = \"1.0\"\nrand = \"0.10.0\"\nnum-integer = \"0.1.46\"\nryu-js = \"1.0.2\"\ntap = \"1.0.1\"\nthiserror = { version = \"2.0.18\", default-features = false }\ndashmap = \"6.1.0\"\nnum_enum = \"0.7.6\"\nitertools = { version = \"0.14.0\", default-features = false }\nportable-atomic = \"1.13.1\"\nbytemuck = { version = \"1.25.0\", default-features = false }\narrayvec = \"0.7.6\"\nintrusive-collections = \"0.10.0\"\ncfg-if = \"1.0.4\"\neither = \"1.15.0\"\nsys-locale = \"0.3.2\"\ntimezone_provider = { version = \"0.2.0\" }\ntemporal_rs = { version = \"0.2.0\", default-features = false, features = [\"float64_representable_durations\"] }\nweb-time = \"1.1.0\"\ncriterion = \"0.8.1\"\nfloat-cmp = \"0.10.0\"\nfutures-lite = \"2.6.1\"\ntest-case = \"3.3.1\"\nrstest = \"0.26.1\"\nurl = \"2.5.8\"\ntokio = { version = \"1.50.0\", default-features = false }\nfutures-concurrency = \"7.7.1\"\ndynify = \"0.1.2\"\nfutures-channel = \"0.3.32\"\naligned-vec = \"0.6.4\"\ntemp-env = \"0.3.6\"\nstrum = { version = \"0.28\", features = [\"derive\"] }\nhusky-rs = \"0.3.2\"\nasync-channel = \"2.5.0\"\n\n# ICU4X\n\nicu_provider = { version = \"~2.1.1\", default-features = false }\nicu_locale = { version = \"~2.1.1\", default-features = false }\nicu_locale_core = { version = \"~2.1.1\", default-features = false }\nicu_datetime = { version = \"~2.1.1\", default-features = false }\nicu_time = { version = \"~2.1.1\", default-features = false }\nicu_calendar = { version = \"~2.1.1\", default-features = false }\nicu_collator = { version = \"~2.1.1\", default-features = false }\nicu_plurals = { version = \"~2.1.1\", default-features = false }\nicu_list = { version = \"~2.1.1\", default-features = false }\nicu_casemap = { version = \"~2.1.1\", default-features = false }\nicu_segmenter = { version = \"~2.1.2\", default-features = false }\nicu_provider_export = { version = \"~2.1.1\", default-features = false }\nicu_provider_source = { version = \"~2.1.2\", default-features = false }\nicu_provider_adapters = { version = \"~2.1.1\", default-features = false }\nicu_provider_blob = { version = \"~2.1.1\", default-features = false }\nicu_properties = { version = \"~2.1.2\", default-features = true }\nicu_normalizer = { version = \"~2.1.1\", default-features = false }\nicu_decimal = { version = \"~2.1.1\", default-features = false }\nwriteable = \"~0.6.2\"\ntinystr = \"~0.8.2\"\nyoke = \"~0.8.1\"\nzerofrom = \"~0.1.6\"\nfixed_decimal = \"~0.7.1\"\n\n[workspace.metadata.workspaces]\nallow_branch = \"main\"\n\n# The ci profile, designed to reduce size of target directory\n[profile.ci]\ninherits = \"dev\"\ndebug = false\nincremental = false\n\n# The release profile, used for `cargo build --release`.\n[profile.release]\n# Enables \"fat\" LTO, for faster release builds\nlto = \"fat\"\n# Makes sure that all code is compiled together, for LTO\ncodegen-units = 1\n# Strips debug information and symbols from the binary, reducing its size\nstrip = \"symbols\"\n\n[profile.release-dbg]\ninherits = \"release\"\ndebug = true\nstrip = \"none\"\n\n# The test profile, used for `cargo test`.\n[profile.test]\n# Enables thin local LTO and some optimizations.\nopt-level = 1\n\n# The benchmark profile, used for `cargo bench`.\n[profile.bench]\n# Enables \"fat\" LTO, for faster benchmark builds\nlto = \"fat\"\n# Makes sure that all code is compiled together, for LTO\ncodegen-units = 1\n\n[workspace.lints.rust]\n# rustc lint groups https://doc.rust-lang.org/rustc/lints/groups.html\nwarnings = \"warn\"\nfuture_incompatible = { level = \"warn\", priority = -1 }\nlet_underscore = { level = \"warn\", priority = -1 }\nnonstandard_style = { level = \"warn\", priority = -1 }\nrust_2018_compatibility = { level = \"warn\", priority = -1 }\nrust_2018_idioms = { level = \"warn\", priority = -1 }\nrust_2021_compatibility = { level = \"warn\", priority = -1 }\nunused = { level = \"warn\", priority = -1 }\n\n# rustc allowed-by-default lints https://doc.rust-lang.org/rustc/lints/listing/allowed-by-default.html\nmissing_docs = \"warn\"\nmacro_use_extern_crate = \"warn\"\nmeta_variable_misuse = \"warn\"\nmissing_abi = \"warn\"\nmissing_copy_implementations = \"warn\"\nmissing_debug_implementations = \"warn\"\nnon_ascii_idents = \"warn\"\nnoop_method_call = \"warn\"\nsingle_use_lifetimes = \"warn\"\ntrivial_casts = \"warn\"\ntrivial_numeric_casts = \"warn\"\nunreachable_pub = \"warn\"\nunsafe_op_in_unsafe_fn = \"warn\"\nunused_crate_dependencies = \"warn\"\nunused_import_braces = \"warn\"\nunused_lifetimes = \"warn\"\nunused_qualifications = \"warn\"\nvariant_size_differences = \"warn\"\n\n[workspace.lints.rustdoc]\n# rustdoc lints https://doc.rust-lang.org/rustdoc/lints.html\nbroken_intra_doc_links = \"warn\"\nprivate_intra_doc_links = \"warn\"\nmissing_crate_level_docs = \"warn\"\nprivate_doc_tests = \"warn\"\ninvalid_codeblock_attributes = \"warn\"\ninvalid_rust_codeblocks = \"warn\"\nbare_urls = \"warn\"\n\n[workspace.lints.clippy]\n# clippy allowed by default\ndbg_macro = \"warn\"\nprint_stdout = \"warn\"\nprint_stderr = \"warn\"\n\n# clippy categories https://doc.rust-lang.org/clippy/\nall = { level = \"warn\", priority = -1 }\ncorrectness = { level = \"warn\", priority = -1 }\nsuspicious = { level = \"warn\", priority = -1 }\nstyle = { level = \"warn\", priority = -1 }\ncomplexity = { level = \"warn\", priority = -1 }\nperf = { level = \"warn\", priority = -1 }\npedantic = { level = \"warn\", priority = -1 }\n" }, { "path": "LICENSE-MIT", "content": "MIT License\n\nCopyright (c) 2019 Jason Williams\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "LICENSE-UNLICENSE", "content": "This is free and unencumbered software released into the public domain.\n\nAnyone is free to copy, modify, publish, use, compile, sell, or\ndistribute this software, either in source code form or as a compiled\nbinary, for any purpose, commercial or non-commercial, and by any\nmeans.\n\nIn jurisdictions that recognize copyright laws, the author or authors\nof this software dedicate any and all copyright interest in the\nsoftware to the public domain. We make this dedication for the benefit\nof the public at large and to the detriment of our heirs and\nsuccessors. We intend this dedication to be an overt act of\nrelinquishment in perpetuity of all present and future rights to this\nsoftware under copyright law.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE.\n\nFor more information, please refer to \n" }, { "path": "Makefile.toml", "content": "extend = [\n { path = \"./make/ci.toml\"}\n]\n\n[config]\ndefault_to_workspace = false\n\n[tasks.run-ci]\ndescription = \"Run Boa CI locally\"\nrun_task.name = [\n \"ci-fmt-check\",\n \"ci-lint-all-features\",\n \"ci-lint-no-features\"\n]\n\n[tasks.format]\ninstall_crate = \"rustfmt\"\ncommand = \"cargo\"\nargs = [\"fmt\", \"--all\", \"--\", \"--emit=files\"]\n\n[tasks.test]\ncommand = \"cargo\"\nargs = [\"test\", \"${@}\"]\n\n[tasks.test262]\ncommand = \"cargo\"\nargs = [\"run\", \"@@remove-empty(RELEASE_ARG)\", \"--bin\", \"boa_tester\", \"--\", \"run\", \"${@}\"]\n\n[tasks.bench-js]\ncondition = { env_set = [ \"BOA_DATA_ROOT\" ] }\ncommand = \"cargo\"\nargs = [\"run\", \"--bin\", \"boa\", \"--release\", \"--\", \"@@remove-empty(BOA_DATA_ROOT)bench/bench-v8/combined.js\"]\n\n[tasks.insta-test]\ninstall_crate = \"cargo-insta\"\ncommand = \"cargo\"\nargs = [\"insta\", \"test\", \"-p\", \"insta-bytecode\", \"--review\"]\n\n[tasks.insta-review]\ninstall_crate = \"cargo-insta\"\ncommand = \"cargo\"\nargs = [\"insta\", \"review\", \"--manifest-path\", \"./tests/insta-bytecode/Cargo.toml\"]\n\n[env.development]\nRELEASE_ARG=\"\"\n\n[env.profiling]\nRELEASE_ARG=\"--profile=release-dbg\"\n\n[env.production]\nRELEASE_ARG=\"--release\"\n" }, { "path": "PR_MESSAGE_EXPECT_EXPRESSION.md", "content": "# fix(parser): replace expect_expression panic with try_into_expression error handling\n\n## Summary\n\nReplaces all uses of `expect_expression()` with `try_into_expression()` in the parser, and removes the panicking `expect_expression()` method. When the parser encounters arrow-function parameter list syntax in a context that requires an expression (e.g. conditional operator `a ? b : c`, call expression `foo()`, optional chaining `a?.b`), it now returns a recoverable parse error instead of panicking.\n\n## Motivation\n\nThe `FormalParameterListOrExpression` type represents the grammar ambiguity between `(a, b)` as a comma expression vs `(a, b)` as arrow-function parameters. In contexts like the conditional operator (`x ? y : z`), call expressions (`f()`), and optional chaining (`a?.b`), the left-hand side must be an expression—arrow params are invalid. Previously, call sites used `expect_expression()`, which panics with \"Unexpected arrow-function arguments\" when the parser produced a `FormalParameterList` instead of an `Expression`. This can occur with edge-case input such as `(a) ? 1 : 2` when `(a)` is parsed as a single arrow param. For Boa as an embedded engine or in tooling, panics are unacceptable; the host expects a parse error. The `try_into_expression()` method already existed and returns `Err(Error::General { ... })` with a helpful message (\"invalid arrow-function arguments (parentheses around the arrow-function may help)\"). Replacing `expect_expression()` with `try_into_expression()?` propagates that error instead of panicking, aligning with Boa's stability goals.\n\n## Changes\n\n| Category | Description |\n| ------------ | ----------------------------------------------------------------------------------------------------- |\n| **Replaced** | `lhs.expect_expression()` with `lhs.try_into_expression()?` in conditional expression parser |\n| **Replaced** | `member.expect_expression()` with `member.try_into_expression()?` in left-hand side (call expression) |\n| **Replaced** | `lhs.expect_expression()` with `lhs.try_into_expression()?` in left-hand side (optional expression) |\n| **Removed** | `expect_expression()` method from `FormalParameterListOrExpression` to prevent future misuse |\n\n## Technical Details\n\n- **Files modified:** `core/parser/src/parser/expression/assignment/conditional.rs`, `core/parser/src/parser/expression/left_hand_side/mod.rs`, `core/parser/src/parser/expression/fpl_or_exp.rs`\n- **Lines changed:** ~15 lines across 3 files\n- **Behavioral impact:** Invalid input that previously caused a panic now produces `Err(Error::General { message: \"invalid arrow-function arguments (parentheses around the arrow-function may help)\", position })`. Valid input is unchanged.\n\n## Testing\n\n- [x] `cargo test -p boa_parser` — all 296 tests pass\n- [x] `cargo test -p boa_engine --lib` — all 921 tests pass\n- [x] `cargo clippy` — no warnings\n" }, { "path": "README.md", "content": "# Boa\n\n

\n \n \n \n \n \n \n \n

\n\nBoa is an experimental JavaScript lexer, parser and interpreter written in Rust 🦀, it has support for **more** than 90% of the latest ECMAScript specification. We continuously improve the conformance to keep up with the ever-evolving standard.\n\n[![Build Status][build_badge]][build_link]\n[![codecov](https://codecov.io/gh/boa-dev/boa/branch/main/graph/badge.svg)](https://codecov.io/gh/boa-dev/boa)\n[![Crates.io](https://img.shields.io/crates/v/boa_engine.svg)](https://crates.io/crates/boa_engine)\n[![Docs.rs](https://docs.rs/boa_engine/badge.svg)](https://docs.rs/boa_engine)\n[![Discord](https://img.shields.io/discord/595323158140158003?logo=discord)](https://discord.gg/tUFFk9Y)\n[![Matrix](https://img.shields.io/matrix/boa:matrix.org?logo=matrix)](https://matrix.to/#/#boa:matrix.org)\n\n[build_badge]: https://github.com/boa-dev/boa/actions/workflows/rust.yml/badge.svg?event=push&branch=main\n[build_link]: https://github.com/boa-dev/boa/actions/workflows/rust.yml?query=event%3Apush+branch%3Amain\n\n## ⚡️ Live Demo (Wasm)\n\nTry out the engine now at the live Wasm playground [here](https://boajs.dev/playground)!\n\nPrefer a CLI? Feel free to try out `boa_cli`!\n\n## 📦 Crates\n\nBoa currently publishes and actively maintains the following crates:\n\n- **`boa_ast`** - Boa's ECMAScript Abstract Syntax Tree\n- **`boa_cli`** - Boa's CLI && REPL implementation\n- **`boa_engine`** - Boa's implementation of ECMAScript builtin objects and\n execution\n- **`boa_gc`** - Boa's garbage collector\n- **`boa_interner`** - Boa's string interner\n- **`boa_parser`** - Boa's lexer and parser\n- **`boa_icu_provider`** - Boa's ICU4X data provider\n- **`boa_runtime`** - Boa's WebAPI features\n- **`boa_string`** - Boa's ECMAScript string implementation.\n- **`tag_ptr`** - Utility library that enables a pointer to be associated with a tag of type `usize`.\n\n> [!NOTE]\n>\n> The `Boa` and `boa_unicode` crates are deprecated.\n\n## 🚀 Example\n\nTo start using Boa simply add the `boa_engine` crate to your `Cargo.toml`:\n\n```toml\n[dependencies]\nboa_engine = \"0.21.0\"\n```\n\nThen in `main.rs`, copy the below:\n\n```rust\nuse boa_engine::{Context, Source, JsResult};\n\nfn main() -> JsResult<()> {\n let js_code = r#\"\n let two = 1 + 1;\n let definitely_not_four = two + \"2\";\n\n definitely_not_four\n \"#;\n\n // Instantiate the execution context\n let mut context = Context::default();\n\n // Parse the source code\n let result = context.eval(Source::from_bytes(js_code))?;\n\n println!(\"{}\", result.display());\n\n Ok(())\n}\n\n```\n\nNow, all that's left to do is `cargo run`.\n\nCongrats! You've executed your first JavaScript code using Boa!\n\n## 🔎 Documentation\n\nFor more information on Boa's API, feel free to check out our documentation.\n\n[**API Documentation**](https://docs.rs/boa_engine/latest/boa_engine/)\n\n## 🏅 Conformance\n\nTo know more details about Boa's conformance surrounding the _ECMAScript_ specification,\nyou can check out our _ECMAScript Test262_ test suite results [here](https://boajs.dev/conformance).\n\n## 🪚 Contributing\n\nPlease, check the [CONTRIBUTING.md](CONTRIBUTING.md) file to know how to\ncontribute in the project. You will need Rust installed and an editor. We have\nsome configurations ready for VSCode.\n\n### 🐛 Debugging\n\nCheck [debugging.md](./docs/debugging.md) for more info on debugging.\n\n### 🕸 Web Assembly\n\n> [!IMPORTANT]\n>\n> This only applies to `wasm32-unknown-unknown` target,\n> `WASI` and `Emscripten` target variants are handled automatically.\n\n- Enable the `js` feature flag.\n- Set `RUSTFLAGS='--cfg getrandom_backend=\"wasm_js\"'`\n\nThe `rustflags` can also be set by adding a `.cargo/config.toml` file in the project root directory:\n\n```toml\n[target.wasm32-unknown-unknown]\nrustflags = '--cfg getrandom_backend=\"wasm_js\"'\n```\n\nFor more information see: [`getrandom` WebAssembly Support][getrandom-webassembly-support]\n\n[getrandom-webassembly-support]: https://docs.rs/getrandom/latest/getrandom/index.html#webassembly-support\n\n## ⚙️ Usage\n\n- Clone this repo.\n- Run with `cargo run -- test.js` in the project root directory where `test.js` is a path to an existing JS file with any valid JS code.\n- If any JS doesn't work then it's a bug. Please raise an [issue](https://github.com/boa-dev/boa/issues/)!\n\n### Example\n\n![Example](docs/img/latestDemo.gif)\n\n### Command-line Options\n\n```txt\nUsage: boa [OPTIONS] [FILE]...\n\nArguments:\n [FILE]... The JavaScript file(s) to be evaluated\n\nOptions:\n --strict Run in strict mode\n -a, --dump-ast [] Dump the AST to stdout with the given format [possible values: debug, json, json-pretty]\n -t, --trace Dump the AST to stdout with the given format\n --vi Use vi mode in the REPL\n -O, --optimize\n --optimizer-statistics\n --flowgraph [] Generate instruction flowgraph. Default is Graphviz [possible values: graphviz, mermaid]\n --flowgraph-direction Specifies the direction of the flowgraph. Default is top-top-bottom [possible values: top-to-bottom, bottom-to-top, left-to-right, right-to-left]\n --debug-object Inject debugging object `$boa`\n -m, --module Treats the input files as modules\n -r, --root Root path from where the module resolver will try to load the modules [default: .]\n -h, --help Print help (see more with '--help')\n -V, --version Print version\n```\n\n## 🧭 Roadmap\n\nSee [Milestones](https://github.com/boa-dev/boa/milestones).\n\n## 📊 Benchmarks\n\nThe current benchmarks are taken from v8's benchmark that you can find [here][boa-benchmarks]. You can also view the results of nightly benchmark runs comparing Boa with other JavaScript engines [here](https://boajs.dev/benchmarks).\n\nIf you wish to run the benchmarks locally, then run Boa in release using the `combined.js` script which contains all the sub-benchmarks in the `bench-v8` directory.\n\n```bash\ncargo run --release -p boa_cli -- bench-v8/combined.js\n```\n\n> [!TIP]\n>\n> If you'd like to run only a subset of the benchmarks, you can modify the `Makefile` located in the [`bench-v8` directory][boa-benchmarks].\n> Comment out the benchmarks you don't want to include, then run `make`. After that, you can run Boa using the same command as above.\n\n[boa-benchmarks]: https://github.com/boa-dev/data/tree/benchmarks/bench\n\n## 🧠 Profiling\n\nSee [Profiling](./docs/profiling.md).\n\n## 📆 Changelog\n\nSee [CHANGELOG.md](./CHANGELOG.md).\n\n## 💬 Communication\n\nFeel free to contact us on [Matrix](https://matrix.to/#/#boa:matrix.org) if you have any questions.\nContributor discussions take place on the same Matrix Space if you're interested in contributing.\nWe also have a [Discord](https://discord.gg/tUFFk9Y) for any questions or issues.\n\n## ⚖️ License\n\nThis project is licensed under the [Unlicense](./LICENSE-UNLICENSE) or [MIT](./LICENSE-MIT) licenses, at your option.\n" }, { "path": "SECURITY.md", "content": "# Security Policy\n\n## Supported Versions\n\nUntil we reach the 1.0 version, we only support the latest 0.x release and the current `main`\nbranch. You can find the latest release of Boa in the [GitHub releases][gh_releases] page or\non [crates.io][crate].\n\n[gh_releases]: https://github.com/boa-dev/boa/releases\n[crate]: https://crates.io/crates/boa_engine/versions\n\n## Reporting a Vulnerability\n\nIf you find any potential vulnerability, join our [Matrix](https://matrix.to/#/#boa:matrix.org) space\nand contact anyone who is an admin. Explain how to trigger the vulnerability, where can it be found\nand any recommendation you might have to fix it.\n" }, { "path": "benches/Cargo.toml", "content": "[package]\nname = \"boa_benches\"\nversion = \"0.1.0\"\nedition = \"2024\"\npublish = false\n\n[dependencies]\nboa_engine = { workspace = true, features = [\"intl_bundled\"] }\nboa_runtime.workspace = true\n\n[dev-dependencies]\ncriterion.workspace = true\nwalkdir = \"2\"\n\n[target.x86_64-unknown-linux-gnu.dev-dependencies]\njemallocator.workspace = true\n\n[[bench]]\nname = \"scripts\"\nharness = false\n" }, { "path": "benches/benches/scripts.rs", "content": "#![allow(unused_crate_dependencies, missing_docs)]\nuse boa_engine::{\n Context, JsValue, Source, js_string, optimizer::OptimizerOptions, script::Script,\n};\nuse criterion::{Criterion, criterion_group, criterion_main};\nuse std::{path::Path, time::Duration};\n\n#[cfg(all(target_arch = \"x86_64\", target_os = \"linux\", target_env = \"gnu\"))]\n#[global_allocator]\nstatic ALLOC: jemallocator::Jemalloc = jemallocator::Jemalloc;\n\nfn bench_scripts(c: &mut Criterion) {\n let scripts_dir = Path::new(env!(\"CARGO_MANIFEST_DIR\")).join(\"scripts\");\n\n let scripts: Vec<_> = walkdir::WalkDir::new(&scripts_dir)\n .into_iter()\n .filter_map(|e| e.ok())\n .filter(|e| {\n let path = e.path();\n path.extension().is_some_and(|ext| ext == \"js\")\n && path\n .file_name()\n .is_some_and(|base| !base.display().to_string().starts_with(\"_\"))\n })\n .collect();\n\n for entry in scripts {\n let path = entry.path();\n let code = std::fs::read_to_string(path).unwrap();\n\n // Create a nice benchmark name from the relative path\n let rel_path = path.strip_prefix(&scripts_dir).unwrap().with_extension(\"\");\n let name = rel_path.display().to_string();\n\n let mut group = c.benchmark_group(&name);\n // Use reduced sample size for slow benchmarks (e.g., v8-benches)\n if rel_path.starts_with(\"v8-benches\") {\n group.sample_size(10);\n group.measurement_time(Duration::from_secs(5));\n }\n\n let context = &mut Context::default();\n\n // Disable optimizations\n context.set_optimizer_options(OptimizerOptions::empty());\n\n // Register runtime for console.log support\n boa_runtime::register(\n boa_runtime::extensions::ConsoleExtension(boa_runtime::NullLogger),\n None,\n context,\n )\n .expect(\"Runtime registration failed\");\n\n // Parse and compile once, outside the benchmark loop\n let script = Script::parse(Source::from_bytes(&code), None, context).unwrap();\n script.codeblock(context).unwrap();\n\n // Evaluate once to define the main function\n script.evaluate(context).unwrap();\n\n // Get the main function\n let function = context\n .global_object()\n .get(js_string!(\"main\"), context)\n .unwrap_or_else(|_| panic!(\"No main function defined in script: {}\", path.display()))\n .as_callable()\n .unwrap_or_else(|| panic!(\"'main' is not a function in script: {}\", path.display()))\n .clone();\n\n group.bench_function(\"Execution\", |b| {\n b.iter(|| function.call(&JsValue::undefined(), &[], context));\n });\n group.finish();\n }\n}\n\ncriterion_group!(benches, bench_scripts);\ncriterion_main!(benches);\n" }, { "path": "benches/scripts/basic/call-loop.js", "content": "function f() {}\n\nfunction main() {\n for (let i = 0; i < 100_000; i++) {\n f();\n }\n}\n" }, { "path": "benches/scripts/basic/closure.js", "content": "function outer() {\n let x = 1;\n function middle() {\n let y = 2;\n function inner() {\n return x + y;\n }\n return inner;\n }\n return middle;\n}\nlet f = outer()();\n\nfunction main() {\n for (let n = 0; n < 10_000_000; n++) {\n f();\n }\n}\n" }, { "path": "benches/scripts/basic/nested-loop.js", "content": "const n = 1_000;\n\nfunction main() {\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n; j++) {}\n }\n}\n" }, { "path": "benches/scripts/closures/create.js", "content": "// Measures closure creation overhead: allocation of function objects\n// and captured variable environments inside a hot loop.\nconst kIterationCount = 100_000;\n\nfunction main() {\n let sum = 0;\n for (let i = 0; i < kIterationCount; i++) {\n const x = i;\n const y = i * 2;\n const closure = (z) => x + y + z;\n sum += closure(i + 1);\n }\n return sum;\n}\n" }, { "path": "benches/scripts/closures/invoke.js", "content": "// Measures closure invocation overhead: closures are created once,\n// then called repeatedly to isolate dispatch and variable lookup cost.\nconst kIterationCount = 100_000;\n\nfunction makeCounter(start) {\n let count = start;\n return {\n increment: (n) => {\n count += n;\n return count;\n },\n decrement: (n) => {\n count -= n;\n return count;\n },\n value: () => count,\n };\n}\n\nconst counterA = makeCounter(0);\nconst counterB = makeCounter(1000);\nconst counterC = makeCounter(-500);\n\nfunction main() {\n let sum = 0;\n for (let i = 0; i < kIterationCount; i++) {\n sum += counterA.increment(1);\n sum += counterB.decrement(1);\n sum += counterC.value();\n }\n return sum;\n}\n" }, { "path": "benches/scripts/intl/collator-compare.js", "content": "const kIterationCount = 1000;\nconst collator = new Intl.Collator(\"en\");\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n collator.compare(\"apple\", \"banana\");\n }\n}\n" }, { "path": "benches/scripts/intl/collator-construction.js", "content": "const kIterationCount = 100;\nconst locales = [\"en\", \"de\", \"ja\", \"ar\", \"fr\", \"es\", \"zh\"];\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n for (const locale of locales) {\n new Intl.Collator(locale);\n }\n }\n}\n" }, { "path": "benches/scripts/intl/datetimeformat-construction.js", "content": "const kIterationCount = 100;\nconst locales = [\"en\", \"de\", \"ja\", \"ar\", \"fr\", \"es\", \"zh\"];\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n for (const locale of locales) {\n new Intl.DateTimeFormat(locale);\n }\n }\n}\n" }, { "path": "benches/scripts/intl/datetimeformat-format.js", "content": "const kIterationCount = 1000;\nconst dtf = new Intl.DateTimeFormat(\"en\");\nconst date = new Date(2024, 0, 1);\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n dtf.format(date);\n }\n}\n" }, { "path": "benches/scripts/intl/datetimeformat-with-options.js", "content": "const kIterationCount = 100;\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n new Intl.DateTimeFormat(\"en\", {\n year: \"numeric\",\n month: \"long\",\n day: \"numeric\",\n });\n new Intl.DateTimeFormat(\"en\", {\n hour: \"2-digit\",\n minute: \"2-digit\",\n second: \"2-digit\",\n });\n }\n}\n" }, { "path": "benches/scripts/intl/datetimeformat_resolved_options.js", "content": "const kIterationCount = 1000;\nconst fmt = new Intl.DateTimeFormat(\"en-US\", {\n dateStyle: \"full\",\n timeStyle: \"short\",\n timeZone: \"UTC\",\n});\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n fmt.resolvedOptions();\n }\n}\n" }, { "path": "benches/scripts/intl/listformat-construction.js", "content": "const kIterationCount = 100;\nconst locales = [\"en\", \"de\", \"ja\", \"ar\", \"fr\", \"es\", \"zh\"];\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n for (const locale of locales) {\n new Intl.ListFormat(locale);\n }\n }\n}\n" }, { "path": "benches/scripts/intl/listformat-format.js", "content": "const kIterationCount = 1000;\nconst lf = new Intl.ListFormat(\"en\");\nconst list = [\"apple\", \"banana\", \"cherry\"];\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n lf.format(list);\n }\n}\n" }, { "path": "benches/scripts/intl/numberformat-construction.js", "content": "const kIterationCount = 100;\nconst locales = [\"en\", \"de\", \"ja\", \"ar\", \"fr\", \"es\", \"zh\"];\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n for (const locale of locales) {\n new Intl.NumberFormat(locale);\n }\n }\n}\n" }, { "path": "benches/scripts/intl/numberformat-different-options.js", "content": "const kIterationCount = 100;\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n new Intl.NumberFormat(\"en\", { style: \"currency\", currency: \"USD\" });\n new Intl.NumberFormat(\"en\", { style: \"percent\" });\n new Intl.NumberFormat(\"en\", { notation: \"scientific\" });\n }\n}\n" }, { "path": "benches/scripts/intl/pluralrules-construction.js", "content": "const kIterationCount = 100;\nconst locales = [\"en\", \"de\", \"ja\", \"ar\", \"fr\", \"es\", \"zh\"];\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n for (const locale of locales) {\n new Intl.PluralRules(locale);\n }\n }\n}\n" }, { "path": "benches/scripts/intl/pluralrules-select.js", "content": "const kIterationCount = 1000;\nconst pr = new Intl.PluralRules(\"en\");\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n pr.select(i);\n }\n}\n" }, { "path": "benches/scripts/intl/segmenter-construction.js", "content": "const kIterationCount = 100;\nconst locales = [\"en\", \"de\", \"ja\", \"ar\", \"fr\", \"es\", \"zh\"];\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n for (const locale of locales) {\n new Intl.Segmenter(locale);\n }\n }\n}\n" }, { "path": "benches/scripts/intl/segmenter-segment.js", "content": "const kIterationCount = 100;\nconst segmenter = new Intl.Segmenter(\"en\");\nconst text = \"The quick brown fox jumps over the lazy dog.\";\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n [...segmenter.segment(text)];\n }\n}\n" }, { "path": "benches/scripts/properties/access.js", "content": "// Measures property access performance across varying object shapes:\n// monomorphic (single shape), polymorphic (few shapes), and\n// megamorphic (many shapes) lookup patterns.\nconst kIterationCount = 50_000;\n\n// Monomorphic: always the same object shape.\nfunction monoAccess(obj) {\n return obj.x + obj.y + obj.z;\n}\n\n// Polymorphic: receives objects with a few different shapes.\nfunction polyAccess(obj) {\n return obj.value + obj.id;\n}\n\n// Test data: objects with distinct shapes.\nconst mono = { x: 1, y: 2, z: 3 };\nconst polyA = { value: 10, id: 1, a: \"extra\" };\nconst polyB = { id: 2, b: true, value: 20 };\nconst polyC = { c: null, d: 4, value: 30, id: 3 };\nconst polyD = { value: 40, id: 4, e: [1, 2] };\n\n// Megamorphic: 20 objects, each with a unique shape.\nconst megaObjects = [];\nfor (let i = 0; i < 20; i++) {\n const obj = { value: i * 100, id: i };\n for (let j = 0; j < i; j++) {\n obj[\"prop\" + j] = j;\n }\n megaObjects.push(obj);\n}\n\nfunction main() {\n let sum = 0;\n\n // Monomorphic access (single shape, hot path).\n for (let i = 0; i < kIterationCount; i++) {\n sum += monoAccess(mono);\n }\n\n // Polymorphic access (4 shapes rotating).\n const polyObjs = [polyA, polyB, polyC, polyD];\n for (let i = 0; i < kIterationCount; i++) {\n sum += polyAccess(polyObjs[i % 4]);\n }\n\n // Megamorphic access (20 unique shapes).\n for (let i = 0; i < kIterationCount; i++) {\n sum += polyAccess(megaObjects[i % 20]);\n }\n\n return sum;\n}\n" }, { "path": "benches/scripts/prototypes/chain.js", "content": "// Measures property resolution through prototype chains of varying\n// depth (1, 5, and 10 levels) to quantify chain-walking overhead.\nconst kIterationCount = 100_000;\n\n// Build a prototype chain of the given depth with a base property.\nfunction buildChain(depth) {\n let proto = { baseValue: 42, type: \"root\" };\n for (let i = 0; i < depth; i++) {\n const child = Object.create(proto);\n child[\"level\" + i] = i;\n child[\"name\" + i] = \"node_\" + i;\n proto = child;\n }\n return proto;\n}\n\nconst shallow = buildChain(1);\nconst medium = buildChain(5);\nconst deep = buildChain(10);\n\nfunction main() {\n let sum = 0;\n\n // Shallow chain: 1 prototype hop to reach baseValue.\n for (let i = 0; i < kIterationCount; i++) {\n sum += shallow.baseValue;\n }\n\n // Medium chain: 5 prototype hops.\n for (let i = 0; i < kIterationCount; i++) {\n sum += medium.baseValue;\n }\n\n // Deep chain: 10 prototype hops.\n for (let i = 0; i < kIterationCount; i++) {\n sum += deep.baseValue;\n }\n\n return sum;\n}\n" }, { "path": "benches/scripts/strings/concat.js", "content": "// Measures repeated string concatenation via the += operator,\n// stressing string allocation and garbage collection throughput.\nconst kIterationCount = 10_000;\nconst fragments = [\n \"hello\",\n \" \",\n \"world\",\n \"! \",\n \"foo\",\n \"bar\",\n \"baz\",\n \" \",\n \"qux\",\n \"\\n\",\n];\n\nfunction main() {\n let result = \"\";\n for (let i = 0; i < kIterationCount; i++) {\n result += fragments[i % fragments.length];\n }\n return result.length;\n}\n" }, { "path": "benches/scripts/strings/replace.js", "content": "// Measures String.prototype.replace performance: substring search\n// and per-replacement allocation cost on short strings.\nconst kIterationCount = 10_000;\nconst templates = [\n \"the quick brown fox jumps over the lazy dog\",\n \"a fast red fox leaps across the slow cat\",\n \"one small step for man one giant leap for mankind\",\n];\nconst replacements = [\n [\"fox\", \"cat\"],\n [\"quick\", \"slow\"],\n [\"the\", \"a\"],\n];\n\nfunction main() {\n let result = \"\";\n for (let i = 0; i < kIterationCount; i++) {\n let s = templates[i % templates.length];\n const pair = replacements[i % replacements.length];\n s = s.replace(pair[0], pair[1]);\n result = s;\n }\n return result.length;\n}\n" }, { "path": "benches/scripts/strings/slice.js", "content": "// This script should take a few seconds to run.\nconst kIterationCount = 10_000;\nconst base = \"abcdefghijklmnopqrstuvwxyz\".repeat(10_000_000);\n\nfunction main() {\n for (let i = 0; i < kIterationCount; i++) {\n base.slice(i * 100, i * 100 + 20000);\n }\n}\n" }, { "path": "benches/scripts/strings/split.js", "content": "// This script should take a few seconds to run.\nconst kIterationCount = 10_000;\nconst base = \"abcdefghijklmnopqrstuvwxyz\".repeat(1_000);\n\nfunction main() {\n const k = base.split(\"a\").length;\n console.log(k);\n}\n" }, { "path": "benches/scripts/v8-benches/README.md", "content": "# V8 Benchmarks\n\nThese benchmarks were copied from https://chromium.googlesource.com/v8/v8/+/52ab610bd13/benchmarks/\n" }, { "path": "benches/scripts/v8-benches/crypto.js", "content": "\"use strict\";\n\"use strip\";\n// Copyright 2012 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Simple framework for running the benchmark suites and\n// computing a score based on the timing measurements.\n\n\n// A benchmark has a name (string) and a function that will be run to\n// do the performance measurement. The optional setup and tearDown\n// arguments are functions that will be invoked before and after\n// running the benchmark, but the running time of these functions will\n// not be accounted for in the benchmark score.\nfunction Benchmark(name, run, setup, tearDown) {\n this.name = name;\n this.run = run;\n this.Setup = setup ? setup : function () {\n };\n this.TearDown = tearDown ? tearDown : function () {\n };\n}\n\n\n// Benchmark results hold the benchmark and the measured time used to\n// run the benchmark. The benchmark score is computed later once a\n// full benchmark suite has run to completion.\nfunction BenchmarkResult(benchmark, time) {\n this.benchmark = benchmark;\n this.time = time;\n}\n\n\n// Automatically convert results to numbers. Used by the geometric\n// mean computation.\nBenchmarkResult.prototype.valueOf = function () {\n return this.time;\n};\n\n\n// Suites of benchmarks consist of a name and the set of benchmarks in\n// addition to the reference timing that the final score will be based\n// on. This way, all scores are relative to a reference run and higher\n// scores implies better performance.\nfunction BenchmarkSuite(name, reference, benchmarks) {\n this.name = name;\n this.reference = reference;\n this.benchmarks = benchmarks;\n BenchmarkSuite.suites.push(this);\n}\n\n\n// Keep track of all declared benchmark suites.\nBenchmarkSuite.suites = [];\n\n\n// Scores are not comparable across versions. Bump the version if\n// you're making changes that will affect that scores, e.g. if you add\n// a new benchmark or change an existing one.\nBenchmarkSuite.version = '7';\n\n\n// To make the benchmark results predictable, we replace Math.random\n// with a 100% deterministic alternative.\nMath.random = (function () {\n var seed = 49734321;\n return function () {\n // Robert Jenkins' 32 bit integer hash function.\n seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff;\n seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff;\n seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff;\n seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff;\n seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff;\n seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff;\n return (seed & 0xfffffff) / 0x10000000;\n };\n})();\n\n\n// Runs all registered benchmark suites and optionally yields between\n// each individual benchmark to avoid running for too long in the\n// context of browsers. Once done, the final score is reported to the\n// runner.\nBenchmarkSuite.RunSuites = function (runner) {\n var continuation = null;\n var suites = BenchmarkSuite.suites;\n var length = suites.length;\n BenchmarkSuite.scores = [];\n var index = 0;\n\n function RunStep() {\n while (continuation || index < length) {\n if (continuation) {\n continuation = continuation();\n } else {\n var suite = suites[index++];\n if (runner.NotifyStart) runner.NotifyStart(suite.name);\n continuation = suite.RunStep(runner);\n }\n if (continuation && typeof window != 'undefined' && window.setTimeout) {\n window.setTimeout(RunStep, 25);\n return;\n }\n }\n if (runner.NotifyScore) {\n var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores);\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n runner.NotifyScore(formatted);\n }\n }\n\n RunStep();\n};\n\n\n// Counts the total number of registered benchmarks. Useful for\n// showing progress as a percentage.\nBenchmarkSuite.CountBenchmarks = function () {\n var result = 0;\n var suites = BenchmarkSuite.suites;\n for (var i = 0; i < suites.length; i++) {\n result += suites[i].benchmarks.length;\n }\n return result;\n};\n\n\n// Computes the geometric mean of a set of numbers.\nBenchmarkSuite.GeometricMean = function (numbers) {\n var log = 0;\n for (var i = 0; i < numbers.length; i++) {\n log += Math.log(numbers[i]);\n }\n return Math.pow(Math.E, log / numbers.length);\n};\n\n\n// Converts a score value to a string with at least three significant\n// digits.\nBenchmarkSuite.FormatScore = function (value) {\n if (value > 100) {\n return value.toFixed(0);\n } else {\n return value.toPrecision(3);\n }\n};\n\n// Notifies the runner that we're done running a single benchmark in\n// the benchmark suite. This can be useful to report progress.\nBenchmarkSuite.prototype.NotifyStep = function (result) {\n this.results.push(result);\n if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name);\n};\n\n\n// Notifies the runner that we're done with running a suite and that\n// we have a result which can be reported to the user if needed.\nBenchmarkSuite.prototype.NotifyResult = function () {\n var mean = BenchmarkSuite.GeometricMean(this.results);\n var score = this.reference / mean;\n BenchmarkSuite.scores.push(score);\n if (this.runner.NotifyResult) {\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n this.runner.NotifyResult(this.name, formatted);\n }\n};\n\n\n// Notifies the runner that running a benchmark resulted in an error.\nBenchmarkSuite.prototype.NotifyError = function (error) {\n if (this.runner.NotifyError) {\n this.runner.NotifyError(this.name, error);\n }\n if (this.runner.NotifyStep) {\n this.runner.NotifyStep(this.name);\n }\n};\n\n\n// Runs a single benchmark for at least a second and computes the\n// average time it takes to run a single iteration.\nBenchmarkSuite.prototype.RunSingleBenchmark = function (benchmark, data) {\n function Measure(data) {\n var elapsed = 0;\n var start = new Date();\n for (var n = 0; elapsed < 1000; n++) {\n benchmark.run();\n elapsed = new Date() - start;\n }\n if (data != null) {\n data.runs += n;\n data.elapsed += elapsed;\n }\n }\n\n if (data == null) {\n // Measure the benchmark once for warm up and throw the result\n // away. Return a fresh data object.\n Measure(null);\n return {runs: 0, elapsed: 0};\n } else {\n Measure(data);\n // If we've run too few iterations, we continue for another second.\n if (data.runs < 32) return data;\n var usec = (data.elapsed * 1000) / data.runs;\n this.NotifyStep(new BenchmarkResult(benchmark, usec));\n return null;\n }\n};\n\n\n// This function starts running a suite, but stops between each\n// individual benchmark in the suite and returns a continuation\n// function which can be invoked to run the next benchmark. Once the\n// last benchmark has been executed, null is returned.\nBenchmarkSuite.prototype.RunStep = function (runner) {\n this.results = [];\n this.runner = runner;\n var length = this.benchmarks.length;\n var index = 0;\n var suite = this;\n var data;\n\n // Run the setup, the actual benchmark, and the tear down in three\n // separate steps to allow the framework to yield between any of the\n // steps.\n\n function RunNextSetup() {\n if (index < length) {\n try {\n suite.benchmarks[index].Setup();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextBenchmark;\n }\n suite.NotifyResult();\n return null;\n }\n\n function RunNextBenchmark() {\n try {\n data = suite.RunSingleBenchmark(suite.benchmarks[index], data);\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n // If data is null, we're done with this benchmark.\n return (data == null) ? RunNextTearDown : RunNextBenchmark();\n }\n\n function RunNextTearDown() {\n try {\n suite.benchmarks[index++].TearDown();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextSetup;\n }\n\n // Start out running the setup.\n return RunNextSetup();\n};\n\n\n/*\n * Copyright (c) 2003-2005 Tom Wu\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS-IS\" AND WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY\n * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.\n *\n * IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,\n * INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER\n * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF\n * THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT\n * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n * In addition, the following condition applies:\n *\n * All redistributions must retain an intact copy of this copyright notice\n * and disclaimer.\n */\n\n\n// Basic JavaScript BN library - subset useful for RSA encryption.\n\n// Bits per digit\nvar dbits;\nvar BI_DB;\nvar BI_DM;\nvar BI_DV;\n\nvar BI_FP;\nvar BI_FV;\nvar BI_F1;\nvar BI_F2;\n\n// JavaScript engine analysis\nvar canary = 0xdeadbeefcafe;\nvar j_lm = ((canary & 0xffffff) == 0xefcafe);\n\n// (public) Constructor\nfunction BigInteger(a, b, c) {\n this.array = new Array();\n if (a != null)\n if (\"number\" == typeof a) this.fromNumber(a, b, c);\n else if (b == null && \"string\" != typeof a) this.fromString(a, 256);\n else this.fromString(a, b);\n}\n\n// return new, unset BigInteger\nfunction nbi() {\n return new BigInteger(null);\n}\n\n// am: Compute w_j += (x*this_i), propagate carries,\n// c is initial carry, returns final carry.\n// c < 3*dvalue, x < 2*dvalue, this_i < dvalue\n// We need to select the fastest one that works in this environment.\n\n// am1: use a single mult and divide to get the high bits,\n// max digit bits should be 26 because\n// max internal value = 2*dvalue^2-2*dvalue (< 2^53)\nfunction am1(i, x, w, j, c, n) {\n var this_array = this.array;\n var w_array = w.array;\n while (--n >= 0) {\n var v = x * this_array[i++] + w_array[j] + c;\n c = Math.floor(v / 0x4000000);\n w_array[j++] = v & 0x3ffffff;\n }\n return c;\n}\n\n// am2 avoids a big mult-and-extract completely.\n// Max digit bits should be <= 30 because we do bitwise ops\n// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\nfunction am2(i, x, w, j, c, n) {\n var this_array = this.array;\n var w_array = w.array;\n var xl = x & 0x7fff, xh = x >> 15;\n while (--n >= 0) {\n var l = this_array[i] & 0x7fff;\n var h = this_array[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w_array[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w_array[j++] = l & 0x3fffffff;\n }\n return c;\n}\n\n// Alternately, set max digit bits to 28 since some\n// browsers slow down when dealing with 32-bit numbers.\nfunction am3(i, x, w, j, c, n) {\n var this_array = this.array;\n var w_array = w.array;\n\n var xl = x & 0x3fff, xh = x >> 14;\n while (--n >= 0) {\n var l = this_array[i] & 0x3fff;\n var h = this_array[i++] >> 14;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x3fff) << 14) + w_array[j] + c;\n c = (l >> 28) + (m >> 14) + xh * h;\n w_array[j++] = l & 0xfffffff;\n }\n return c;\n}\n\n// This is tailored to VMs with 2-bit tagging. It makes sure\n// that all the computations stay within the 29 bits available.\nfunction am4(i, x, w, j, c, n) {\n var this_array = this.array;\n var w_array = w.array;\n\n var xl = x & 0x1fff, xh = x >> 13;\n while (--n >= 0) {\n var l = this_array[i] & 0x1fff;\n var h = this_array[i++] >> 13;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x1fff) << 13) + w_array[j] + c;\n c = (l >> 26) + (m >> 13) + xh * h;\n w_array[j++] = l & 0x3ffffff;\n }\n return c;\n}\n\n// am3/28 is best for SM, Rhino, but am4/26 is best for v8.\n// Kestrel (Opera 9.5) gets its best result with am4/26.\n// IE7 does 9% better with am3/28 than with am4/26.\n// Firefox (SM) gets 10% faster with am3/28 than with am4/26.\n\nvar setupEngine = function (fn, bits) {\n BigInteger.prototype.am = fn;\n dbits = bits;\n\n BI_DB = dbits;\n BI_DM = ((1 << dbits) - 1);\n BI_DV = (1 << dbits);\n\n BI_FP = 52;\n BI_FV = Math.pow(2, BI_FP);\n BI_F1 = BI_FP - dbits;\n BI_F2 = 2 * dbits - BI_FP;\n}\n\n\n// Digit conversions\nvar BI_RM = \"0123456789abcdefghijklmnopqrstuvwxyz\";\nvar BI_RC = new Array();\nvar rr, vv;\nrr = \"0\".charCodeAt(0);\nfor (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;\nrr = \"a\".charCodeAt(0);\nfor (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\nrr = \"A\".charCodeAt(0);\nfor (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\n\nfunction int2char(n) {\n return BI_RM.charAt(n);\n}\n\nfunction intAt(s, i) {\n var c = BI_RC[s.charCodeAt(i)];\n return (c == null) ? -1 : c;\n}\n\n// (protected) copy this to r\nfunction bnpCopyTo(r) {\n var this_array = this.array;\n var r_array = r.array;\n\n for (var i = this.t - 1; i >= 0; --i) r_array[i] = this_array[i];\n r.t = this.t;\n r.s = this.s;\n}\n\n// (protected) set from integer value x, -DV <= x < DV\nfunction bnpFromInt(x) {\n var this_array = this.array;\n this.t = 1;\n this.s = (x < 0) ? -1 : 0;\n if (x > 0) this_array[0] = x;\n else if (x < -1) this_array[0] = x + DV;\n else this.t = 0;\n}\n\n// return bigint initialized to value\nfunction nbv(i) {\n var r = nbi();\n r.fromInt(i);\n return r;\n}\n\n// (protected) set from string and radix\nfunction bnpFromString(s, b) {\n var this_array = this.array;\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else {\n this.fromRadix(s, b);\n return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length, mi = false, sh = 0;\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0)\n this_array[this.t++] = x;\n else if (sh + k > BI_DB) {\n this_array[this.t - 1] |= (x & ((1 << (BI_DB - sh)) - 1)) << sh;\n this_array[this.t++] = (x >> (BI_DB - sh));\n } else\n this_array[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= BI_DB) sh -= BI_DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this_array[this.t - 1] |= ((1 << (BI_DB - sh)) - 1) << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n}\n\n// (protected) clamp off excess high words\nfunction bnpClamp() {\n var this_array = this.array;\n var c = this.s & BI_DM;\n while (this.t > 0 && this_array[this.t - 1] == c) --this.t;\n}\n\n// (public) return string representation in given radix\nfunction bnToString(b) {\n var this_array = this.array;\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1 << k) - 1, d, m = false, r = \"\", i = this.t;\n var p = BI_DB - (i * BI_DB) % k;\n if (i-- > 0) {\n if (p < BI_DB && (d = this_array[i] >> p) > 0) {\n m = true;\n r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this_array[i] & ((1 << p) - 1)) << (k - p);\n d |= this_array[--i] >> (p += BI_DB - k);\n } else {\n d = (this_array[i] >> (p -= k)) & km;\n if (p <= 0) {\n p += BI_DB;\n --i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n}\n\n// (public) -this\nfunction bnNegate() {\n var r = nbi();\n BigInteger.ZERO.subTo(this, r);\n return r;\n}\n\n// (public) |this|\nfunction bnAbs() {\n return (this.s < 0) ? this.negate() : this;\n}\n\n// (public) return + if this > a, - if this < a, 0 if equal\nfunction bnCompareTo(a) {\n var this_array = this.array;\n var a_array = a.array;\n\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return r;\n while (--i >= 0) if ((r = this_array[i] - a_array[i]) != 0) return r;\n return 0;\n}\n\n// returns bit length of the integer x\nfunction nbits(x) {\n var r = 1, t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n}\n\n// (public) return the number of bits in \"this\"\nfunction bnBitLength() {\n var this_array = this.array;\n if (this.t <= 0) return 0;\n return BI_DB * (this.t - 1) + nbits(this_array[this.t - 1] ^ (this.s & BI_DM));\n}\n\n// (protected) r = this << n*DB\nfunction bnpDLShiftTo(n, r) {\n var this_array = this.array;\n var r_array = r.array;\n var i;\n for (i = this.t - 1; i >= 0; --i) r_array[i + n] = this_array[i];\n for (i = n - 1; i >= 0; --i) r_array[i] = 0;\n r.t = this.t + n;\n r.s = this.s;\n}\n\n// (protected) r = this >> n*DB\nfunction bnpDRShiftTo(n, r) {\n var this_array = this.array;\n var r_array = r.array;\n for (var i = n; i < this.t; ++i) r_array[i - n] = this_array[i];\n r.t = Math.max(this.t - n, 0);\n r.s = this.s;\n}\n\n// (protected) r = this << n\nfunction bnpLShiftTo(n, r) {\n var this_array = this.array;\n var r_array = r.array;\n var bs = n % BI_DB;\n var cbs = BI_DB - bs;\n var bm = (1 << cbs) - 1;\n var ds = Math.floor(n / BI_DB), c = (this.s << bs) & BI_DM, i;\n for (i = this.t - 1; i >= 0; --i) {\n r_array[i + ds + 1] = (this_array[i] >> cbs) | c;\n c = (this_array[i] & bm) << bs;\n }\n for (i = ds - 1; i >= 0; --i) r_array[i] = 0;\n r_array[ds] = c;\n r.t = this.t + ds + 1;\n r.s = this.s;\n r.clamp();\n}\n\n// (protected) r = this >> n\nfunction bnpRShiftTo(n, r) {\n var this_array = this.array;\n var r_array = r.array;\n r.s = this.s;\n var ds = Math.floor(n / BI_DB);\n if (ds >= this.t) {\n r.t = 0;\n return;\n }\n var bs = n % BI_DB;\n var cbs = BI_DB - bs;\n var bm = (1 << bs) - 1;\n r_array[0] = this_array[ds] >> bs;\n for (var i = ds + 1; i < this.t; ++i) {\n r_array[i - ds - 1] |= (this_array[i] & bm) << cbs;\n r_array[i - ds] = this_array[i] >> bs;\n }\n if (bs > 0) r_array[this.t - ds - 1] |= (this.s & bm) << cbs;\n r.t = this.t - ds;\n r.clamp();\n}\n\n// (protected) r = this - a\nfunction bnpSubTo(a, r) {\n var this_array = this.array;\n var r_array = r.array;\n var a_array = a.array;\n var i = 0, c = 0, m = Math.min(a.t, this.t);\n while (i < m) {\n c += this_array[i] - a_array[i];\n r_array[i++] = c & BI_DM;\n c >>= BI_DB;\n }\n if (a.t < this.t) {\n c -= a.s;\n while (i < this.t) {\n c += this_array[i];\n r_array[i++] = c & BI_DM;\n c >>= BI_DB;\n }\n c += this.s;\n } else {\n c += this.s;\n while (i < a.t) {\n c -= a_array[i];\n r_array[i++] = c & BI_DM;\n c >>= BI_DB;\n }\n c -= a.s;\n }\n r.s = (c < 0) ? -1 : 0;\n if (c < -1) r_array[i++] = BI_DV + c;\n else if (c > 0) r_array[i++] = c;\n r.t = i;\n r.clamp();\n}\n\n// (protected) r = this * a, r != this,a (HAC 14.12)\n// \"this\" should be the larger one if appropriate.\nfunction bnpMultiplyTo(a, r) {\n var this_array = this.array;\n var r_array = r.array;\n var x = this.abs(), y = a.abs();\n var y_array = y.array;\n\n var i = x.t;\n r.t = i + y.t;\n while (--i >= 0) r_array[i] = 0;\n for (i = 0; i < y.t; ++i) r_array[i + x.t] = x.am(0, y_array[i], r, i, 0, x.t);\n r.s = 0;\n r.clamp();\n if (this.s != a.s) BigInteger.ZERO.subTo(r, r);\n}\n\n// (protected) r = this^2, r != this (HAC 14.16)\nfunction bnpSquareTo(r) {\n var x = this.abs();\n var x_array = x.array;\n var r_array = r.array;\n\n var i = r.t = 2 * x.t;\n while (--i >= 0) r_array[i] = 0;\n for (i = 0; i < x.t - 1; ++i) {\n var c = x.am(i, x_array[i], r, 2 * i, 0, 1);\n if ((r_array[i + x.t] += x.am(i + 1, 2 * x_array[i], r, 2 * i + 1, c, x.t - i - 1)) >= BI_DV) {\n r_array[i + x.t] -= BI_DV;\n r_array[i + x.t + 1] = 1;\n }\n }\n if (r.t > 0) r_array[r.t - 1] += x.am(i, x_array[i], r, 2 * i, 0, 1);\n r.s = 0;\n r.clamp();\n}\n\n// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\n// r != q, this != m. q or r may be null.\nfunction bnpDivRemTo(m, q, r) {\n var pm = m.abs();\n if (pm.t <= 0) return;\n var pt = this.abs();\n if (pt.t < pm.t) {\n if (q != null) q.fromInt(0);\n if (r != null) this.copyTo(r);\n return;\n }\n if (r == null) r = nbi();\n var y = nbi(), ts = this.s, ms = m.s;\n var pm_array = pm.array;\n var nsh = BI_DB - nbits(pm_array[pm.t - 1]);\t// normalize modulus\n if (nsh > 0) {\n pm.lShiftTo(nsh, y);\n pt.lShiftTo(nsh, r);\n } else {\n pm.copyTo(y);\n pt.copyTo(r);\n }\n var ys = y.t;\n\n var y_array = y.array;\n var y0 = y_array[ys - 1];\n if (y0 == 0) return;\n var yt = y0 * (1 << BI_F1) + ((ys > 1) ? y_array[ys - 2] >> BI_F2 : 0);\n var d1 = BI_FV / yt, d2 = (1 << BI_F1) / yt, e = 1 << BI_F2;\n var i = r.t, j = i - ys, t = (q == null) ? nbi() : q;\n y.dlShiftTo(j, t);\n\n var r_array = r.array;\n if (r.compareTo(t) >= 0) {\n r_array[r.t++] = 1;\n r.subTo(t, r);\n }\n BigInteger.ONE.dlShiftTo(ys, t);\n t.subTo(y, y);\t// \"negative\" y so we can replace sub with am later\n while (y.t < ys) y_array[y.t++] = 0;\n while (--j >= 0) {\n // Estimate quotient digit\n var qd = (r_array[--i] == y0) ? BI_DM : Math.floor(r_array[i] * d1 + (r_array[i - 1] + e) * d2);\n if ((r_array[i] += y.am(0, qd, r, j, 0, ys)) < qd) {\t// Try it out\n y.dlShiftTo(j, t);\n r.subTo(t, r);\n while (r_array[i] < --qd) r.subTo(t, r);\n }\n }\n if (q != null) {\n r.drShiftTo(ys, q);\n if (ts != ms) BigInteger.ZERO.subTo(q, q);\n }\n r.t = ys;\n r.clamp();\n if (nsh > 0) r.rShiftTo(nsh, r);\t// Denormalize remainder\n if (ts < 0) BigInteger.ZERO.subTo(r, r);\n}\n\n// (public) this mod a\nfunction bnMod(a) {\n var r = nbi();\n this.abs().divRemTo(a, null, r);\n if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);\n return r;\n}\n\n// Modular reduction using \"classic\" algorithm\nfunction Classic(m) {\n this.m = m;\n}\n\nfunction cConvert(x) {\n if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);\n else return x;\n}\n\nfunction cRevert(x) {\n return x;\n}\n\nfunction cReduce(x) {\n x.divRemTo(this.m, null, x);\n}\n\nfunction cMulTo(x, y, r) {\n x.multiplyTo(y, r);\n this.reduce(r);\n}\n\nfunction cSqrTo(x, r) {\n x.squareTo(r);\n this.reduce(r);\n}\n\nClassic.prototype.convert = cConvert;\nClassic.prototype.revert = cRevert;\nClassic.prototype.reduce = cReduce;\nClassic.prototype.mulTo = cMulTo;\nClassic.prototype.sqrTo = cSqrTo;\n\n// (protected) return \"-1/this % 2^DB\"; useful for Mont. reduction\n// justification:\n// xy == 1 (mod m)\n// xy = 1+km\n// xy(2-xy) = (1+km)(1-km)\n// x[y(2-xy)] = 1-k^2m^2\n// x[y(2-xy)] == 1 (mod m^2)\n// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\n// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\n// JS multiply \"overflows\" differently from C/C++, so care is needed here.\nfunction bnpInvDigit() {\n var this_array = this.array;\n if (this.t < 1) return 0;\n var x = this_array[0];\n if ((x & 1) == 0) return 0;\n var y = x & 3;\t\t// y == 1/x mod 2^2\n y = (y * (2 - (x & 0xf) * y)) & 0xf;\t// y == 1/x mod 2^4\n y = (y * (2 - (x & 0xff) * y)) & 0xff;\t// y == 1/x mod 2^8\n y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff;\t// y == 1/x mod 2^16\n // last step - calculate inverse mod DV directly;\n // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\n y = (y * (2 - x * y % BI_DV)) % BI_DV;\t\t// y == 1/x mod 2^dbits\n // we really want the negative inverse, and -DV < y < DV\n return (y > 0) ? BI_DV - y : -y;\n}\n\n// Montgomery reduction\nfunction Montgomery(m) {\n this.m = m;\n this.mp = m.invDigit();\n this.mpl = this.mp & 0x7fff;\n this.mph = this.mp >> 15;\n this.um = (1 << (BI_DB - 15)) - 1;\n this.mt2 = 2 * m.t;\n}\n\n// xR mod m\nfunction montConvert(x) {\n var r = nbi();\n x.abs().dlShiftTo(this.m.t, r);\n r.divRemTo(this.m, null, r);\n if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);\n return r;\n}\n\n// x/R mod m\nfunction montRevert(x) {\n var r = nbi();\n x.copyTo(r);\n this.reduce(r);\n return r;\n}\n\n// x = x/R mod m (HAC 14.32)\nfunction montReduce(x) {\n var x_array = x.array;\n while (x.t <= this.mt2)\t// pad x so am has enough room later\n x_array[x.t++] = 0;\n for (var i = 0; i < this.m.t; ++i) {\n // faster way of calculating u0 = x[i]*mp mod DV\n var j = x_array[i] & 0x7fff;\n var u0 = (j * this.mpl + (((j * this.mph + (x_array[i] >> 15) * this.mpl) & this.um) << 15)) & BI_DM;\n // use am to combine the multiply-shift-add into one call\n j = i + this.m.t;\n x_array[j] += this.m.am(0, u0, x, i, 0, this.m.t);\n // propagate carry\n while (x_array[j] >= BI_DV) {\n x_array[j] -= BI_DV;\n x_array[++j]++;\n }\n }\n x.clamp();\n x.drShiftTo(this.m.t, x);\n if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);\n}\n\n// r = \"x^2/R mod m\"; x != r\nfunction montSqrTo(x, r) {\n x.squareTo(r);\n this.reduce(r);\n}\n\n// r = \"xy/R mod m\"; x,y != r\nfunction montMulTo(x, y, r) {\n x.multiplyTo(y, r);\n this.reduce(r);\n}\n\nMontgomery.prototype.convert = montConvert;\nMontgomery.prototype.revert = montRevert;\nMontgomery.prototype.reduce = montReduce;\nMontgomery.prototype.mulTo = montMulTo;\nMontgomery.prototype.sqrTo = montSqrTo;\n\n// (protected) true iff this is even\nfunction bnpIsEven() {\n var this_array = this.array;\n return ((this.t > 0) ? (this_array[0] & 1) : this.s) == 0;\n}\n\n// (protected) this^e, e < 2^32, doing sqr and mul with \"r\" (HAC 14.79)\nfunction bnpExp(e, z) {\n if (e > 0xffffffff || e < 1) return BigInteger.ONE;\n var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e) - 1;\n g.copyTo(r);\n while (--i >= 0) {\n z.sqrTo(r, r2);\n if ((e & (1 << i)) > 0) z.mulTo(r2, g, r);\n else {\n var t = r;\n r = r2;\n r2 = t;\n }\n }\n return z.revert(r);\n}\n\n// (public) this^e % m, 0 <= e < 2^32\nfunction bnModPowInt(e, m) {\n var z;\n if (e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);\n return this.exp(e, z);\n}\n\n// protected\nBigInteger.prototype.copyTo = bnpCopyTo;\nBigInteger.prototype.fromInt = bnpFromInt;\nBigInteger.prototype.fromString = bnpFromString;\nBigInteger.prototype.clamp = bnpClamp;\nBigInteger.prototype.dlShiftTo = bnpDLShiftTo;\nBigInteger.prototype.drShiftTo = bnpDRShiftTo;\nBigInteger.prototype.lShiftTo = bnpLShiftTo;\nBigInteger.prototype.rShiftTo = bnpRShiftTo;\nBigInteger.prototype.subTo = bnpSubTo;\nBigInteger.prototype.multiplyTo = bnpMultiplyTo;\nBigInteger.prototype.squareTo = bnpSquareTo;\nBigInteger.prototype.divRemTo = bnpDivRemTo;\nBigInteger.prototype.invDigit = bnpInvDigit;\nBigInteger.prototype.isEven = bnpIsEven;\nBigInteger.prototype.exp = bnpExp;\n\n// public\nBigInteger.prototype.toString = bnToString;\nBigInteger.prototype.negate = bnNegate;\nBigInteger.prototype.abs = bnAbs;\nBigInteger.prototype.compareTo = bnCompareTo;\nBigInteger.prototype.bitLength = bnBitLength;\nBigInteger.prototype.mod = bnMod;\nBigInteger.prototype.modPowInt = bnModPowInt;\n\n// \"constants\"\nBigInteger.ZERO = nbv(0);\nBigInteger.ONE = nbv(1);\n// Copyright (c) 2005 Tom Wu\n// All Rights Reserved.\n// See \"LICENSE\" for details.\n\n// Extended JavaScript BN functions, required for RSA private ops.\n\n// (public)\nfunction bnClone() {\n var r = nbi();\n this.copyTo(r);\n return r;\n}\n\n// (public) return value as integer\nfunction bnIntValue() {\n var this_array = this.array;\n if (this.s < 0) {\n if (this.t == 1) return this_array[0] - BI_DV;\n else if (this.t == 0) return -1;\n } else if (this.t == 1) return this_array[0];\n else if (this.t == 0) return 0;\n // assumes 16 < DB < 32\n return ((this_array[1] & ((1 << (32 - BI_DB)) - 1)) << BI_DB) | this_array[0];\n}\n\n// (public) return value as byte\nfunction bnByteValue() {\n var this_array = this.array;\n return (this.t == 0) ? this.s : (this_array[0] << 24) >> 24;\n}\n\n// (public) return value as short (assumes DB>=16)\nfunction bnShortValue() {\n var this_array = this.array;\n return (this.t == 0) ? this.s : (this_array[0] << 16) >> 16;\n}\n\n// (protected) return x s.t. r^x < DV\nfunction bnpChunkSize(r) {\n return Math.floor(Math.LN2 * BI_DB / Math.log(r));\n}\n\n// (public) 0 if this == 0, 1 if this > 0\nfunction bnSigNum() {\n var this_array = this.array;\n if (this.s < 0) return -1;\n else if (this.t <= 0 || (this.t == 1 && this_array[0] <= 0)) return 0;\n else return 1;\n}\n\n// (protected) convert to radix string\nfunction bnpToRadix(b) {\n if (b == null) b = 10;\n if (this.signum() == 0 || b < 2 || b > 36) return \"0\";\n var cs = this.chunkSize(b);\n var a = Math.pow(b, cs);\n var d = nbv(a), y = nbi(), z = nbi(), r = \"\";\n this.divRemTo(d, y, z);\n while (y.signum() > 0) {\n r = (a + z.intValue()).toString(b).substr(1) + r;\n y.divRemTo(d, y, z);\n }\n return z.intValue().toString(b) + r;\n}\n\n// (protected) convert from radix string\nfunction bnpFromRadix(s, b) {\n this.fromInt(0);\n if (b == null) b = 10;\n var cs = this.chunkSize(b);\n var d = Math.pow(b, cs), mi = false, j = 0, w = 0;\n for (var i = 0; i < s.length; ++i) {\n var x = intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\" && this.signum() == 0) mi = true;\n continue;\n }\n w = b * w + x;\n if (++j >= cs) {\n this.dMultiply(d);\n this.dAddOffset(w, 0);\n j = 0;\n w = 0;\n }\n }\n if (j > 0) {\n this.dMultiply(Math.pow(b, j));\n this.dAddOffset(w, 0);\n }\n if (mi) BigInteger.ZERO.subTo(this, this);\n}\n\n// (protected) alternate constructor\nfunction bnpFromNumber(a, b, c) {\n if (\"number\" == typeof b) {\n // new BigInteger(int,int,RNG)\n if (a < 2) this.fromInt(1);\n else {\n this.fromNumber(a, c);\n if (!this.testBit(a - 1))\t// force MSB set\n this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);\n if (this.isEven()) this.dAddOffset(1, 0); // force odd\n while (!this.isProbablePrime(b)) {\n this.dAddOffset(2, 0);\n if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);\n }\n }\n } else {\n // new BigInteger(int,RNG)\n var x = new Array(), t = a & 7;\n x.length = (a >> 3) + 1;\n b.nextBytes(x);\n if (t > 0) x[0] &= ((1 << t) - 1); else x[0] = 0;\n this.fromString(x, 256);\n }\n}\n\n// (public) convert to bigendian byte array\nfunction bnToByteArray() {\n var this_array = this.array;\n var i = this.t, r = new Array();\n r[0] = this.s;\n var p = BI_DB - (i * BI_DB) % 8, d, k = 0;\n if (i-- > 0) {\n if (p < BI_DB && (d = this_array[i] >> p) != (this.s & BI_DM) >> p)\n r[k++] = d | (this.s << (BI_DB - p));\n while (i >= 0) {\n if (p < 8) {\n d = (this_array[i] & ((1 << p) - 1)) << (8 - p);\n d |= this_array[--i] >> (p += BI_DB - 8);\n } else {\n d = (this_array[i] >> (p -= 8)) & 0xff;\n if (p <= 0) {\n p += BI_DB;\n --i;\n }\n }\n if ((d & 0x80) != 0) d |= -256;\n if (k == 0 && (this.s & 0x80) != (d & 0x80)) ++k;\n if (k > 0 || d != this.s) r[k++] = d;\n }\n }\n return r;\n}\n\nfunction bnEquals(a) {\n return (this.compareTo(a) == 0);\n}\n\nfunction bnMin(a) {\n return (this.compareTo(a) < 0) ? this : a;\n}\n\nfunction bnMax(a) {\n return (this.compareTo(a) > 0) ? this : a;\n}\n\n// (protected) r = this op a (bitwise)\nfunction bnpBitwiseTo(a, op, r) {\n var this_array = this.array;\n var a_array = a.array;\n var r_array = r.array;\n var i, f, m = Math.min(a.t, this.t);\n for (i = 0; i < m; ++i) r_array[i] = op(this_array[i], a_array[i]);\n if (a.t < this.t) {\n f = a.s & BI_DM;\n for (i = m; i < this.t; ++i) r_array[i] = op(this_array[i], f);\n r.t = this.t;\n } else {\n f = this.s & BI_DM;\n for (i = m; i < a.t; ++i) r_array[i] = op(f, a_array[i]);\n r.t = a.t;\n }\n r.s = op(this.s, a.s);\n r.clamp();\n}\n\n// (public) this & a\nfunction op_and(x, y) {\n return x & y;\n}\n\nfunction bnAnd(a) {\n var r = nbi();\n this.bitwiseTo(a, op_and, r);\n return r;\n}\n\n// (public) this | a\nfunction op_or(x, y) {\n return x | y;\n}\n\nfunction bnOr(a) {\n var r = nbi();\n this.bitwiseTo(a, op_or, r);\n return r;\n}\n\n// (public) this ^ a\nfunction op_xor(x, y) {\n return x ^ y;\n}\n\nfunction bnXor(a) {\n var r = nbi();\n this.bitwiseTo(a, op_xor, r);\n return r;\n}\n\n// (public) this & ~a\nfunction op_andnot(x, y) {\n return x & ~y;\n}\n\nfunction bnAndNot(a) {\n var r = nbi();\n this.bitwiseTo(a, op_andnot, r);\n return r;\n}\n\n// (public) ~this\nfunction bnNot() {\n var this_array = this.array;\n var r = nbi();\n var r_array = r.array;\n\n for (var i = 0; i < this.t; ++i) r_array[i] = BI_DM & ~this_array[i];\n r.t = this.t;\n r.s = ~this.s;\n return r;\n}\n\n// (public) this << n\nfunction bnShiftLeft(n) {\n var r = nbi();\n if (n < 0) this.rShiftTo(-n, r); else this.lShiftTo(n, r);\n return r;\n}\n\n// (public) this >> n\nfunction bnShiftRight(n) {\n var r = nbi();\n if (n < 0) this.lShiftTo(-n, r); else this.rShiftTo(n, r);\n return r;\n}\n\n// return index of lowest 1-bit in x, x < 2^31\nfunction lbit(x) {\n if (x == 0) return -1;\n var r = 0;\n if ((x & 0xffff) == 0) {\n x >>= 16;\n r += 16;\n }\n if ((x & 0xff) == 0) {\n x >>= 8;\n r += 8;\n }\n if ((x & 0xf) == 0) {\n x >>= 4;\n r += 4;\n }\n if ((x & 3) == 0) {\n x >>= 2;\n r += 2;\n }\n if ((x & 1) == 0) ++r;\n return r;\n}\n\n// (public) returns index of lowest 1-bit (or -1 if none)\nfunction bnGetLowestSetBit() {\n var this_array = this.array;\n for (var i = 0; i < this.t; ++i)\n if (this_array[i] != 0) return i * BI_DB + lbit(this_array[i]);\n if (this.s < 0) return this.t * BI_DB;\n return -1;\n}\n\n// return number of 1 bits in x\nfunction cbit(x) {\n var r = 0;\n while (x != 0) {\n x &= x - 1;\n ++r;\n }\n return r;\n}\n\n// (public) return number of set bits\nfunction bnBitCount() {\n var r = 0, x = this.s & BI_DM;\n for (var i = 0; i < this.t; ++i) r += cbit(this_array[i] ^ x);\n return r;\n}\n\n// (public) true iff nth bit is set\nfunction bnTestBit(n) {\n var this_array = this.array;\n var j = Math.floor(n / BI_DB);\n if (j >= this.t) return (this.s != 0);\n return ((this_array[j] & (1 << (n % BI_DB))) != 0);\n}\n\n// (protected) this op (1<>= BI_DB;\n }\n if (a.t < this.t) {\n c += a.s;\n while (i < this.t) {\n c += this_array[i];\n r_array[i++] = c & BI_DM;\n c >>= BI_DB;\n }\n c += this.s;\n } else {\n c += this.s;\n while (i < a.t) {\n c += a_array[i];\n r_array[i++] = c & BI_DM;\n c >>= BI_DB;\n }\n c += a.s;\n }\n r.s = (c < 0) ? -1 : 0;\n if (c > 0) r_array[i++] = c;\n else if (c < -1) r_array[i++] = BI_DV + c;\n r.t = i;\n r.clamp();\n}\n\n// (public) this + a\nfunction bnAdd(a) {\n var r = nbi();\n this.addTo(a, r);\n return r;\n}\n\n// (public) this - a\nfunction bnSubtract(a) {\n var r = nbi();\n this.subTo(a, r);\n return r;\n}\n\n// (public) this * a\nfunction bnMultiply(a) {\n var r = nbi();\n this.multiplyTo(a, r);\n return r;\n}\n\n// (public) this / a\nfunction bnDivide(a) {\n var r = nbi();\n this.divRemTo(a, r, null);\n return r;\n}\n\n// (public) this % a\nfunction bnRemainder(a) {\n var r = nbi();\n this.divRemTo(a, null, r);\n return r;\n}\n\n// (public) [this/a,this%a]\nfunction bnDivideAndRemainder(a) {\n var q = nbi(), r = nbi();\n this.divRemTo(a, q, r);\n return new Array(q, r);\n}\n\n// (protected) this *= n, this >= 0, 1 < n < DV\nfunction bnpDMultiply(n) {\n var this_array = this.array;\n this_array[this.t] = this.am(0, n - 1, this, 0, 0, this.t);\n ++this.t;\n this.clamp();\n}\n\n// (protected) this += n << w words, this >= 0\nfunction bnpDAddOffset(n, w) {\n var this_array = this.array;\n while (this.t <= w) this_array[this.t++] = 0;\n this_array[w] += n;\n while (this_array[w] >= BI_DV) {\n this_array[w] -= BI_DV;\n if (++w >= this.t) this_array[this.t++] = 0;\n ++this_array[w];\n }\n}\n\n// A \"null\" reducer\nfunction NullExp() {\n}\n\nfunction nNop(x) {\n return x;\n}\n\nfunction nMulTo(x, y, r) {\n x.multiplyTo(y, r);\n}\n\nfunction nSqrTo(x, r) {\n x.squareTo(r);\n}\n\nNullExp.prototype.convert = nNop;\nNullExp.prototype.revert = nNop;\nNullExp.prototype.mulTo = nMulTo;\nNullExp.prototype.sqrTo = nSqrTo;\n\n// (public) this^e\nfunction bnPow(e) {\n return this.exp(e, new NullExp());\n}\n\n// (protected) r = lower n words of \"this * a\", a.t <= n\n// \"this\" should be the larger one if appropriate.\nfunction bnpMultiplyLowerTo(a, n, r) {\n var r_array = r.array;\n var a_array = a.array;\n var i = Math.min(this.t + a.t, n);\n r.s = 0; // assumes a,this >= 0\n r.t = i;\n while (i > 0) r_array[--i] = 0;\n var j;\n for (j = r.t - this.t; i < j; ++i) r_array[i + this.t] = this.am(0, a_array[i], r, i, 0, this.t);\n for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a_array[i], r, i, 0, n - i);\n r.clamp();\n}\n\n// (protected) r = \"this * a\" without lower n words, n > 0\n// \"this\" should be the larger one if appropriate.\nfunction bnpMultiplyUpperTo(a, n, r) {\n var r_array = r.array;\n var a_array = a.array;\n --n;\n var i = r.t = this.t + a.t - n;\n r.s = 0; // assumes a,this >= 0\n while (--i >= 0) r_array[i] = 0;\n for (i = Math.max(n - this.t, 0); i < a.t; ++i)\n r_array[this.t + i - n] = this.am(n - i, a_array[i], r, 0, 0, this.t + i - n);\n r.clamp();\n r.drShiftTo(1, r);\n}\n\n// Barrett modular reduction\nfunction Barrett(m) {\n // setup Barrett\n this.r2 = nbi();\n this.q3 = nbi();\n BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);\n this.mu = this.r2.divide(m);\n this.m = m;\n}\n\nfunction barrettConvert(x) {\n if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);\n else if (x.compareTo(this.m) < 0) return x;\n else {\n var r = nbi();\n x.copyTo(r);\n this.reduce(r);\n return r;\n }\n}\n\nfunction barrettRevert(x) {\n return x;\n}\n\n// x = x mod m (HAC 14.42)\nfunction barrettReduce(x) {\n x.drShiftTo(this.m.t - 1, this.r2);\n if (x.t > this.m.t + 1) {\n x.t = this.m.t + 1;\n x.clamp();\n }\n this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);\n this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);\n while (x.compareTo(this.r2) < 0) x.dAddOffset(1, this.m.t + 1);\n x.subTo(this.r2, x);\n while (x.compareTo(this.m) >= 0) x.subTo(this.m, x);\n}\n\n// r = x^2 mod m; x != r\nfunction barrettSqrTo(x, r) {\n x.squareTo(r);\n this.reduce(r);\n}\n\n// r = x*y mod m; x,y != r\nfunction barrettMulTo(x, y, r) {\n x.multiplyTo(y, r);\n this.reduce(r);\n}\n\nBarrett.prototype.convert = barrettConvert;\nBarrett.prototype.revert = barrettRevert;\nBarrett.prototype.reduce = barrettReduce;\nBarrett.prototype.mulTo = barrettMulTo;\nBarrett.prototype.sqrTo = barrettSqrTo;\n\n// (public) this^e % m (HAC 14.85)\nfunction bnModPow(e, m) {\n var e_array = e.array;\n var i = e.bitLength(), k, r = nbv(1), z;\n if (i <= 0) return r;\n else if (i < 18) k = 1;\n else if (i < 48) k = 3;\n else if (i < 144) k = 4;\n else if (i < 768) k = 5;\n else k = 6;\n if (i < 8)\n z = new Classic(m);\n else if (m.isEven())\n z = new Barrett(m);\n else\n z = new Montgomery(m);\n\n // precomputation\n var g = new Array(), n = 3, k1 = k - 1, km = (1 << k) - 1;\n g[1] = z.convert(this);\n if (k > 1) {\n var g2 = nbi();\n z.sqrTo(g[1], g2);\n while (n <= km) {\n g[n] = nbi();\n z.mulTo(g2, g[n - 2], g[n]);\n n += 2;\n }\n }\n\n var j = e.t - 1, w, is1 = true, r2 = nbi(), t;\n i = nbits(e_array[j]) - 1;\n while (j >= 0) {\n if (i >= k1) w = (e_array[j] >> (i - k1)) & km;\n else {\n w = (e_array[j] & ((1 << (i + 1)) - 1)) << (k1 - i);\n if (j > 0) w |= e_array[j - 1] >> (BI_DB + i - k1);\n }\n\n n = k;\n while ((w & 1) == 0) {\n w >>= 1;\n --n;\n }\n if ((i -= n) < 0) {\n i += BI_DB;\n --j;\n }\n if (is1) {\t// ret == 1, don't bother squaring or multiplying it\n g[w].copyTo(r);\n is1 = false;\n } else {\n while (n > 1) {\n z.sqrTo(r, r2);\n z.sqrTo(r2, r);\n n -= 2;\n }\n if (n > 0) z.sqrTo(r, r2); else {\n t = r;\n r = r2;\n r2 = t;\n }\n z.mulTo(r2, g[w], r);\n }\n\n while (j >= 0 && (e_array[j] & (1 << i)) == 0) {\n z.sqrTo(r, r2);\n t = r;\n r = r2;\n r2 = t;\n if (--i < 0) {\n i = BI_DB - 1;\n --j;\n }\n }\n }\n return z.revert(r);\n}\n\n// (public) gcd(this,a) (HAC 14.54)\nfunction bnGCD(a) {\n var x = (this.s < 0) ? this.negate() : this.clone();\n var y = (a.s < 0) ? a.negate() : a.clone();\n if (x.compareTo(y) < 0) {\n var t = x;\n x = y;\n y = t;\n }\n var i = x.getLowestSetBit(), g = y.getLowestSetBit();\n if (g < 0) return x;\n if (i < g) g = i;\n if (g > 0) {\n x.rShiftTo(g, x);\n y.rShiftTo(g, y);\n }\n while (x.signum() > 0) {\n if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);\n if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);\n if (x.compareTo(y) >= 0) {\n x.subTo(y, x);\n x.rShiftTo(1, x);\n } else {\n y.subTo(x, y);\n y.rShiftTo(1, y);\n }\n }\n if (g > 0) y.lShiftTo(g, y);\n return y;\n}\n\n// (protected) this % n, n < 2^26\nfunction bnpModInt(n) {\n var this_array = this.array;\n if (n <= 0) return 0;\n var d = BI_DV % n, r = (this.s < 0) ? n - 1 : 0;\n if (this.t > 0)\n if (d == 0) r = this_array[0] % n;\n else for (var i = this.t - 1; i >= 0; --i) r = (d * r + this_array[i]) % n;\n return r;\n}\n\n// (public) 1/this % m (HAC 14.61)\nfunction bnModInverse(m) {\n var ac = m.isEven();\n if ((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;\n var u = m.clone(), v = this.clone();\n var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);\n while (u.signum() != 0) {\n while (u.isEven()) {\n u.rShiftTo(1, u);\n if (ac) {\n if (!a.isEven() || !b.isEven()) {\n a.addTo(this, a);\n b.subTo(m, b);\n }\n a.rShiftTo(1, a);\n } else if (!b.isEven()) b.subTo(m, b);\n b.rShiftTo(1, b);\n }\n while (v.isEven()) {\n v.rShiftTo(1, v);\n if (ac) {\n if (!c.isEven() || !d.isEven()) {\n c.addTo(this, c);\n d.subTo(m, d);\n }\n c.rShiftTo(1, c);\n } else if (!d.isEven()) d.subTo(m, d);\n d.rShiftTo(1, d);\n }\n if (u.compareTo(v) >= 0) {\n u.subTo(v, u);\n if (ac) a.subTo(c, a);\n b.subTo(d, b);\n } else {\n v.subTo(u, v);\n if (ac) c.subTo(a, c);\n d.subTo(b, d);\n }\n }\n if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;\n if (d.compareTo(m) >= 0) return d.subtract(m);\n if (d.signum() < 0) d.addTo(m, d); else return d;\n if (d.signum() < 0) return d.add(m); else return d;\n}\n\nvar lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509];\nvar lplim = (1 << 26) / lowprimes[lowprimes.length - 1];\n\n// (public) test primality with certainty >= 1-.5^t\nfunction bnIsProbablePrime(t) {\n var i, x = this.abs();\n var x_array = x.array;\n if (x.t == 1 && x_array[0] <= lowprimes[lowprimes.length - 1]) {\n for (i = 0; i < lowprimes.length; ++i)\n if (x_array[0] == lowprimes[i]) return true;\n return false;\n }\n if (x.isEven()) return false;\n i = 1;\n while (i < lowprimes.length) {\n var m = lowprimes[i], j = i + 1;\n while (j < lowprimes.length && m < lplim) m *= lowprimes[j++];\n m = x.modInt(m);\n while (i < j) if (m % lowprimes[i++] == 0) return false;\n }\n return x.millerRabin(t);\n}\n\n// (protected) true if probably prime (HAC 4.24, Miller-Rabin)\nfunction bnpMillerRabin(t) {\n var n1 = this.subtract(BigInteger.ONE);\n var k = n1.getLowestSetBit();\n if (k <= 0) return false;\n var r = n1.shiftRight(k);\n t = (t + 1) >> 1;\n if (t > lowprimes.length) t = lowprimes.length;\n var a = nbi();\n for (var i = 0; i < t; ++i) {\n a.fromInt(lowprimes[i]);\n var y = a.modPow(r, this);\n if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\n var j = 1;\n while (j++ < k && y.compareTo(n1) != 0) {\n y = y.modPowInt(2, this);\n if (y.compareTo(BigInteger.ONE) == 0) return false;\n }\n if (y.compareTo(n1) != 0) return false;\n }\n }\n return true;\n}\n\n// protected\nBigInteger.prototype.chunkSize = bnpChunkSize;\nBigInteger.prototype.toRadix = bnpToRadix;\nBigInteger.prototype.fromRadix = bnpFromRadix;\nBigInteger.prototype.fromNumber = bnpFromNumber;\nBigInteger.prototype.bitwiseTo = bnpBitwiseTo;\nBigInteger.prototype.changeBit = bnpChangeBit;\nBigInteger.prototype.addTo = bnpAddTo;\nBigInteger.prototype.dMultiply = bnpDMultiply;\nBigInteger.prototype.dAddOffset = bnpDAddOffset;\nBigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\nBigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\nBigInteger.prototype.modInt = bnpModInt;\nBigInteger.prototype.millerRabin = bnpMillerRabin;\n\n// public\nBigInteger.prototype.clone = bnClone;\nBigInteger.prototype.intValue = bnIntValue;\nBigInteger.prototype.byteValue = bnByteValue;\nBigInteger.prototype.shortValue = bnShortValue;\nBigInteger.prototype.signum = bnSigNum;\nBigInteger.prototype.toByteArray = bnToByteArray;\nBigInteger.prototype.equals = bnEquals;\nBigInteger.prototype.min = bnMin;\nBigInteger.prototype.max = bnMax;\nBigInteger.prototype.and = bnAnd;\nBigInteger.prototype.or = bnOr;\nBigInteger.prototype.xor = bnXor;\nBigInteger.prototype.andNot = bnAndNot;\nBigInteger.prototype.not = bnNot;\nBigInteger.prototype.shiftLeft = bnShiftLeft;\nBigInteger.prototype.shiftRight = bnShiftRight;\nBigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\nBigInteger.prototype.bitCount = bnBitCount;\nBigInteger.prototype.testBit = bnTestBit;\nBigInteger.prototype.setBit = bnSetBit;\nBigInteger.prototype.clearBit = bnClearBit;\nBigInteger.prototype.flipBit = bnFlipBit;\nBigInteger.prototype.add = bnAdd;\nBigInteger.prototype.subtract = bnSubtract;\nBigInteger.prototype.multiply = bnMultiply;\nBigInteger.prototype.divide = bnDivide;\nBigInteger.prototype.remainder = bnRemainder;\nBigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\nBigInteger.prototype.modPow = bnModPow;\nBigInteger.prototype.modInverse = bnModInverse;\nBigInteger.prototype.pow = bnPow;\nBigInteger.prototype.gcd = bnGCD;\nBigInteger.prototype.isProbablePrime = bnIsProbablePrime;\n\n// BigInteger interfaces not implemented in jsbn:\n\n// BigInteger(int signum, byte[] magnitude)\n// double doubleValue()\n// float floatValue()\n// int hashCode()\n// long longValue()\n// static BigInteger valueOf(long val)\n// prng4.js - uses Arcfour as a PRNG\n\nfunction Arcfour() {\n this.i = 0;\n this.j = 0;\n this.S = new Array();\n}\n\n// Initialize arcfour context from key, an array of ints, each from [0..255]\nfunction ARC4init(key) {\n var i, j, t;\n for (i = 0; i < 256; ++i)\n this.S[i] = i;\n j = 0;\n for (i = 0; i < 256; ++i) {\n j = (j + this.S[i] + key[i % key.length]) & 255;\n t = this.S[i];\n this.S[i] = this.S[j];\n this.S[j] = t;\n }\n this.i = 0;\n this.j = 0;\n}\n\nfunction ARC4next() {\n var t;\n this.i = (this.i + 1) & 255;\n this.j = (this.j + this.S[this.i]) & 255;\n t = this.S[this.i];\n this.S[this.i] = this.S[this.j];\n this.S[this.j] = t;\n return this.S[(t + this.S[this.i]) & 255];\n}\n\nArcfour.prototype.init = ARC4init;\nArcfour.prototype.next = ARC4next;\n\n// Plug in your RNG constructor here\nfunction prng_newstate() {\n return new Arcfour();\n}\n\n// Pool size must be a multiple of 4 and greater than 32.\n// An array of bytes the size of the pool will be passed to init()\nvar rng_psize = 256;\n// Random number generator - requires a PRNG backend, e.g. prng4.js\n\n// For best results, put code like\n// \n// in your main HTML document.\n\nvar rng_state;\nvar rng_pool;\nvar rng_pptr;\n\n// Mix in a 32-bit integer into the pool\nfunction rng_seed_int(x) {\n rng_pool[rng_pptr++] ^= x & 255;\n rng_pool[rng_pptr++] ^= (x >> 8) & 255;\n rng_pool[rng_pptr++] ^= (x >> 16) & 255;\n rng_pool[rng_pptr++] ^= (x >> 24) & 255;\n if (rng_pptr >= rng_psize) rng_pptr -= rng_psize;\n}\n\n// Mix in the current time (w/milliseconds) into the pool\nfunction rng_seed_time() {\n // Use pre-computed date to avoid making the benchmark\n // results dependent on the current date.\n rng_seed_int(1122926989487);\n}\n\n// Initialize the pool with junk if needed.\nif (rng_pool == null) {\n rng_pool = new Array();\n rng_pptr = 0;\n var t;\n while (rng_pptr < rng_psize) { // extract some randomness from Math.random()\n t = Math.floor(65536 * Math.random());\n rng_pool[rng_pptr++] = t >>> 8;\n rng_pool[rng_pptr++] = t & 255;\n }\n rng_pptr = 0;\n rng_seed_time();\n //rng_seed_int(window.screenX);\n //rng_seed_int(window.screenY);\n}\n\nfunction rng_get_byte() {\n if (rng_state == null) {\n rng_seed_time();\n rng_state = prng_newstate();\n rng_state.init(rng_pool);\n for (rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)\n rng_pool[rng_pptr] = 0;\n rng_pptr = 0;\n //rng_pool = null;\n }\n // TODO: allow reseeding after first request\n return rng_state.next();\n}\n\nfunction rng_get_bytes(ba) {\n var i;\n for (i = 0; i < ba.length; ++i) ba[i] = rng_get_byte();\n}\n\nfunction SecureRandom() {\n}\n\nSecureRandom.prototype.nextBytes = rng_get_bytes;\n// Depends on jsbn.js and rng.js\n\n// convert a (hex) string to a bignum object\nfunction parseBigInt(str, r) {\n return new BigInteger(str, r);\n}\n\nfunction linebrk(s, n) {\n var ret = \"\";\n var i = 0;\n while (i + n < s.length) {\n ret += s.substring(i, i + n) + \"\\n\";\n i += n;\n }\n return ret + s.substring(i, s.length);\n}\n\nfunction byte2Hex(b) {\n if (b < 0x10)\n return \"0\" + b.toString(16);\n else\n return b.toString(16);\n}\n\n// PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint\nfunction pkcs1pad2(s, n) {\n if (n < s.length + 11) {\n alert(\"Message too long for RSA\");\n return null;\n }\n var ba = new Array();\n var i = s.length - 1;\n while (i >= 0 && n > 0) ba[--n] = s.charCodeAt(i--);\n ba[--n] = 0;\n var rng = new SecureRandom();\n var x = new Array();\n while (n > 2) { // random non-zero pad\n x[0] = 0;\n while (x[0] == 0) rng.nextBytes(x);\n ba[--n] = x[0];\n }\n ba[--n] = 2;\n ba[--n] = 0;\n return new BigInteger(ba);\n}\n\n// \"empty\" RSA key constructor\nfunction RSAKey() {\n this.n = null;\n this.e = 0;\n this.d = null;\n this.p = null;\n this.q = null;\n this.dmp1 = null;\n this.dmq1 = null;\n this.coeff = null;\n}\n\n// Set the public key fields N and e from hex strings\nfunction RSASetPublic(N, E) {\n if (N != null && E != null && N.length > 0 && E.length > 0) {\n this.n = parseBigInt(N, 16);\n this.e = parseInt(E, 16);\n } else\n alert(\"Invalid RSA public key\");\n}\n\n// Perform raw public operation on \"x\": return x^e (mod n)\nfunction RSADoPublic(x) {\n return x.modPowInt(this.e, this.n);\n}\n\n// Return the PKCS#1 RSA encryption of \"text\" as an even-length hex string\nfunction RSAEncrypt(text) {\n var m = pkcs1pad2(text, (this.n.bitLength() + 7) >> 3);\n if (m == null) return null;\n var c = this.doPublic(m);\n if (c == null) return null;\n var h = c.toString(16);\n if ((h.length & 1) == 0) return h; else return \"0\" + h;\n}\n\n// Return the PKCS#1 RSA encryption of \"text\" as a Base64-encoded string\n//function RSAEncryptB64(text) {\n// var h = this.encrypt(text);\n// if(h) return hex2b64(h); else return null;\n//}\n\n// protected\nRSAKey.prototype.doPublic = RSADoPublic;\n\n// public\nRSAKey.prototype.setPublic = RSASetPublic;\nRSAKey.prototype.encrypt = RSAEncrypt;\n//RSAKey.prototype.encrypt_b64 = RSAEncryptB64;\n// Depends on rsa.js and jsbn2.js\n\n// Undo PKCS#1 (type 2, random) padding and, if valid, return the plaintext\nfunction pkcs1unpad2(d, n) {\n var b = d.toByteArray();\n var i = 0;\n while (i < b.length && b[i] == 0) ++i;\n if (b.length - i != n - 1 || b[i] != 2)\n return null;\n ++i;\n while (b[i] != 0)\n if (++i >= b.length) return null;\n var ret = \"\";\n while (++i < b.length)\n ret += String.fromCharCode(b[i]);\n return ret;\n}\n\n// Set the private key fields N, e, and d from hex strings\nfunction RSASetPrivate(N, E, D) {\n if (N != null && E != null && N.length > 0 && E.length > 0) {\n this.n = parseBigInt(N, 16);\n this.e = parseInt(E, 16);\n this.d = parseBigInt(D, 16);\n } else\n alert(\"Invalid RSA private key\");\n}\n\n// Set the private key fields N, e, d and CRT params from hex strings\nfunction RSASetPrivateEx(N, E, D, P, Q, DP, DQ, C) {\n if (N != null && E != null && N.length > 0 && E.length > 0) {\n this.n = parseBigInt(N, 16);\n this.e = parseInt(E, 16);\n this.d = parseBigInt(D, 16);\n this.p = parseBigInt(P, 16);\n this.q = parseBigInt(Q, 16);\n this.dmp1 = parseBigInt(DP, 16);\n this.dmq1 = parseBigInt(DQ, 16);\n this.coeff = parseBigInt(C, 16);\n } else\n alert(\"Invalid RSA private key\");\n}\n\n// Generate a new random private key B bits long, using public expt E\nfunction RSAGenerate(B, E) {\n var rng = new SecureRandom();\n var qs = B >> 1;\n this.e = parseInt(E, 16);\n var ee = new BigInteger(E, 16);\n for (; ;) {\n for (; ;) {\n this.p = new BigInteger(B - qs, 1, rng);\n if (this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) break;\n }\n for (; ;) {\n this.q = new BigInteger(qs, 1, rng);\n if (this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) break;\n }\n if (this.p.compareTo(this.q) <= 0) {\n var t = this.p;\n this.p = this.q;\n this.q = t;\n }\n var p1 = this.p.subtract(BigInteger.ONE);\n var q1 = this.q.subtract(BigInteger.ONE);\n var phi = p1.multiply(q1);\n if (phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {\n this.n = this.p.multiply(this.q);\n this.d = ee.modInverse(phi);\n this.dmp1 = this.d.mod(p1);\n this.dmq1 = this.d.mod(q1);\n this.coeff = this.q.modInverse(this.p);\n break;\n }\n }\n}\n\n// Perform raw private operation on \"x\": return x^d (mod n)\nfunction RSADoPrivate(x) {\n if (this.p == null || this.q == null)\n return x.modPow(this.d, this.n);\n\n // TODO: re-calculate any missing CRT params\n var xp = x.mod(this.p).modPow(this.dmp1, this.p);\n var xq = x.mod(this.q).modPow(this.dmq1, this.q);\n\n while (xp.compareTo(xq) < 0)\n xp = xp.add(this.p);\n return xp.subtract(xq).multiply(this.coeff).mod(this.p).multiply(this.q).add(xq);\n}\n\n// Return the PKCS#1 RSA decryption of \"ctext\".\n// \"ctext\" is an even-length hex string and the output is a plain string.\nfunction RSADecrypt(ctext) {\n var c = parseBigInt(ctext, 16);\n var m = this.doPrivate(c);\n if (m == null) return null;\n return pkcs1unpad2(m, (this.n.bitLength() + 7) >> 3);\n}\n\n// Return the PKCS#1 RSA decryption of \"ctext\".\n// \"ctext\" is a Base64-encoded string and the output is a plain string.\n//function RSAB64Decrypt(ctext) {\n// var h = b64tohex(ctext);\n// if(h) return this.decrypt(h); else return null;\n//}\n\n// protected\nRSAKey.prototype.doPrivate = RSADoPrivate;\n\n// public\nRSAKey.prototype.setPrivate = RSASetPrivate;\nRSAKey.prototype.setPrivateEx = RSASetPrivateEx;\nRSAKey.prototype.generate = RSAGenerate;\nRSAKey.prototype.decrypt = RSADecrypt;\n//RSAKey.prototype.b64_decrypt = RSAB64Decrypt;\n\n\nvar nValue = \"a5261939975948bb7a58dffe5ff54e65f0498f9175f5a09288810b8975871e99af3b5dd94057b0fc07535f5f97444504fa35169d461d0d30cf0192e307727c065168c788771c561a9400fb49175e9e6aa4e23fe11af69e9412dd23b0cb6684c4c2429bce139e848ab26d0829073351f4acd36074eafd036a5eb83359d2a698d3\";\nvar eValue = \"10001\";\nvar dValue = \"8e9912f6d3645894e8d38cb58c0db81ff516cf4c7e5a14c7f1eddb1459d2cded4d8d293fc97aee6aefb861859c8b6a3d1dfe710463e1f9ddc72048c09751971c4a580aa51eb523357a3cc48d31cfad1d4a165066ed92d4748fb6571211da5cb14bc11b6e2df7c1a559e6d5ac1cd5c94703a22891464fba23d0d965086277a161\";\nvar pValue = \"d090ce58a92c75233a6486cb0a9209bf3583b64f540c76f5294bb97d285eed33aec220bde14b2417951178ac152ceab6da7090905b478195498b352048f15e7d\";\nvar qValue = \"cab575dc652bb66df15a0359609d51d1db184750c00c6698b90ef3465c99655103edbf0d54c56aec0ce3c4d22592338092a126a0cc49f65a4a30d222b411e58f\";\nvar dmp1Value = \"1a24bca8e273df2f0e47c199bbf678604e7df7215480c77c8db39f49b000ce2cf7500038acfff5433b7d582a01f1826e6f4d42e1c57f5e1fef7b12aabc59fd25\";\nvar dmq1Value = \"3d06982efbbe47339e1f6d36b1216b8a741d410b0c662f54f7118b27b9a4ec9d914337eb39841d8666f3034408cf94f5b62f11c402fc994fe15a05493150d9fd\";\nvar coeffValue = \"3a3e731acd8960b7ff9eb81a7ff93bd1cfa74cbd56987db58b4594fb09c09084db1734c8143f98b602b981aaa9243ca28deb69b5b280ee8dcee0fd2625e53250\";\n\nsetupEngine(am3, 28);\n\nvar TEXT = \"The quick brown fox jumped over the extremely lazy frog! \" +\n \"Now is the time for all good men to come to the party.\";\nvar encrypted;\n\nfunction encrypt() {\n var RSA = new RSAKey();\n RSA.setPublic(nValue, eValue);\n RSA.setPrivateEx(nValue, eValue, dValue, pValue, qValue, dmp1Value, dmq1Value, coeffValue);\n encrypted = RSA.encrypt(TEXT);\n}\n\nfunction decrypt() {\n var RSA = new RSAKey();\n RSA.setPublic(nValue, eValue);\n RSA.setPrivateEx(nValue, eValue, dValue, pValue, qValue, dmp1Value, dmq1Value, coeffValue);\n var decrypted = RSA.decrypt(encrypted);\n if (decrypted != TEXT) {\n throw new Error(\"Crypto operation failed\");\n }\n}\n\n// The code has been adapted for use as a benchmark by Google.\nvar Crypto = new BenchmarkSuite('Crypto', 266181, [\n new Benchmark(\"Encrypt\", encrypt),\n new Benchmark(\"Decrypt\", decrypt)\n]);\n\n/* run_harness.js */\nvar print = console.log;\n\nfunction Run() {\n BenchmarkSuite.RunSuites({\n NotifyStep: ShowProgress,\n NotifyError: AddError,\n NotifyResult: AddResult,\n NotifyScore: AddScore,\n });\n}\n\nvar harnessErrorCount = 0;\n\nfunction ShowProgress(name) {\n print(\"PROGRESS\", name);\n}\n\nfunction AddError(name, error) {\n print(\"ERROR\", name, error);\n print(error.stack);\n harnessErrorCount++;\n}\n\nfunction AddResult(name, result) {\n print(\"RESULT\", name, result);\n}\n\nfunction AddScore(score) {\n print(\"SCORE\", score);\n}\n\nfunction main() {\n Run();\n}\n" }, { "path": "benches/scripts/v8-benches/deltablue.js", "content": "\"use strict\";\n\"use strip\";\n// Copyright 2012 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Simple framework for running the benchmark suites and\n// computing a score based on the timing measurements.\n\n\n// A benchmark has a name (string) and a function that will be run to\n// do the performance measurement. The optional setup and tearDown\n// arguments are functions that will be invoked before and after\n// running the benchmark, but the running time of these functions will\n// not be accounted for in the benchmark score.\nfunction Benchmark(name, run, setup, tearDown) {\n this.name = name;\n this.run = run;\n this.Setup = setup ? setup : function () {\n };\n this.TearDown = tearDown ? tearDown : function () {\n };\n}\n\n\n// Benchmark results hold the benchmark and the measured time used to\n// run the benchmark. The benchmark score is computed later once a\n// full benchmark suite has run to completion.\nfunction BenchmarkResult(benchmark, time) {\n this.benchmark = benchmark;\n this.time = time;\n}\n\n\n// Automatically convert results to numbers. Used by the geometric\n// mean computation.\nBenchmarkResult.prototype.valueOf = function () {\n return this.time;\n};\n\n\n// Suites of benchmarks consist of a name and the set of benchmarks in\n// addition to the reference timing that the final score will be based\n// on. This way, all scores are relative to a reference run and higher\n// scores implies better performance.\nfunction BenchmarkSuite(name, reference, benchmarks) {\n this.name = name;\n this.reference = reference;\n this.benchmarks = benchmarks;\n BenchmarkSuite.suites.push(this);\n}\n\n\n// Keep track of all declared benchmark suites.\nBenchmarkSuite.suites = [];\n\n\n// Scores are not comparable across versions. Bump the version if\n// you're making changes that will affect that scores, e.g. if you add\n// a new benchmark or change an existing one.\nBenchmarkSuite.version = '7';\n\n\n// To make the benchmark results predictable, we replace Math.random\n// with a 100% deterministic alternative.\nMath.random = (function () {\n var seed = 49734321;\n return function () {\n // Robert Jenkins' 32 bit integer hash function.\n seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff;\n seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff;\n seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff;\n seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff;\n seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff;\n seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff;\n return (seed & 0xfffffff) / 0x10000000;\n };\n})();\n\n\n// Runs all registered benchmark suites and optionally yields between\n// each individual benchmark to avoid running for too long in the\n// context of browsers. Once done, the final score is reported to the\n// runner.\nBenchmarkSuite.RunSuites = function (runner) {\n var continuation = null;\n var suites = BenchmarkSuite.suites;\n var length = suites.length;\n BenchmarkSuite.scores = [];\n var index = 0;\n\n function RunStep() {\n while (continuation || index < length) {\n if (continuation) {\n continuation = continuation();\n } else {\n var suite = suites[index++];\n if (runner.NotifyStart) runner.NotifyStart(suite.name);\n continuation = suite.RunStep(runner);\n }\n if (continuation && typeof window != 'undefined' && window.setTimeout) {\n window.setTimeout(RunStep, 25);\n return;\n }\n }\n if (runner.NotifyScore) {\n var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores);\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n runner.NotifyScore(formatted);\n }\n }\n\n RunStep();\n};\n\n\n// Counts the total number of registered benchmarks. Useful for\n// showing progress as a percentage.\nBenchmarkSuite.CountBenchmarks = function () {\n var result = 0;\n var suites = BenchmarkSuite.suites;\n for (var i = 0; i < suites.length; i++) {\n result += suites[i].benchmarks.length;\n }\n return result;\n};\n\n\n// Computes the geometric mean of a set of numbers.\nBenchmarkSuite.GeometricMean = function (numbers) {\n var log = 0;\n for (var i = 0; i < numbers.length; i++) {\n log += Math.log(numbers[i]);\n }\n return Math.pow(Math.E, log / numbers.length);\n};\n\n\n// Converts a score value to a string with at least three significant\n// digits.\nBenchmarkSuite.FormatScore = function (value) {\n if (value > 100) {\n return value.toFixed(0);\n } else {\n return value.toPrecision(3);\n }\n};\n\n// Notifies the runner that we're done running a single benchmark in\n// the benchmark suite. This can be useful to report progress.\nBenchmarkSuite.prototype.NotifyStep = function (result) {\n this.results.push(result);\n if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name);\n};\n\n\n// Notifies the runner that we're done with running a suite and that\n// we have a result which can be reported to the user if needed.\nBenchmarkSuite.prototype.NotifyResult = function () {\n var mean = BenchmarkSuite.GeometricMean(this.results);\n var score = this.reference / mean;\n BenchmarkSuite.scores.push(score);\n if (this.runner.NotifyResult) {\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n this.runner.NotifyResult(this.name, formatted);\n }\n};\n\n\n// Notifies the runner that running a benchmark resulted in an error.\nBenchmarkSuite.prototype.NotifyError = function (error) {\n if (this.runner.NotifyError) {\n this.runner.NotifyError(this.name, error);\n }\n if (this.runner.NotifyStep) {\n this.runner.NotifyStep(this.name);\n }\n};\n\n\n// Runs a single benchmark for at least a second and computes the\n// average time it takes to run a single iteration.\nBenchmarkSuite.prototype.RunSingleBenchmark = function (benchmark, data) {\n function Measure(data) {\n var elapsed = 0;\n var start = new Date();\n for (var n = 0; elapsed < 1000; n++) {\n benchmark.run();\n elapsed = new Date() - start;\n }\n if (data != null) {\n data.runs += n;\n data.elapsed += elapsed;\n }\n }\n\n if (data == null) {\n // Measure the benchmark once for warm up and throw the result\n // away. Return a fresh data object.\n Measure(null);\n return {runs: 0, elapsed: 0};\n } else {\n Measure(data);\n // If we've run too few iterations, we continue for another second.\n if (data.runs < 32) return data;\n var usec = (data.elapsed * 1000) / data.runs;\n this.NotifyStep(new BenchmarkResult(benchmark, usec));\n return null;\n }\n};\n\n\n// This function starts running a suite, but stops between each\n// individual benchmark in the suite and returns a continuation\n// function which can be invoked to run the next benchmark. Once the\n// last benchmark has been executed, null is returned.\nBenchmarkSuite.prototype.RunStep = function (runner) {\n this.results = [];\n this.runner = runner;\n var length = this.benchmarks.length;\n var index = 0;\n var suite = this;\n var data;\n\n // Run the setup, the actual benchmark, and the tear down in three\n // separate steps to allow the framework to yield between any of the\n // steps.\n\n function RunNextSetup() {\n if (index < length) {\n try {\n suite.benchmarks[index].Setup();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextBenchmark;\n }\n suite.NotifyResult();\n return null;\n }\n\n function RunNextBenchmark() {\n try {\n data = suite.RunSingleBenchmark(suite.benchmarks[index], data);\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n // If data is null, we're done with this benchmark.\n return (data == null) ? RunNextTearDown : RunNextBenchmark();\n }\n\n function RunNextTearDown() {\n try {\n suite.benchmarks[index++].TearDown();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextSetup;\n }\n\n // Start out running the setup.\n return RunNextSetup();\n};\n\n// Copyright 2008 the V8 project authors. All rights reserved.\n// Copyright 1996 John Maloney and Mario Wolczko.\n\n// This program is free software; you can redistribute it and/or modify\n// it under the terms of the GNU General Public License as published by\n// the Free Software Foundation; either version 2 of the License, or\n// (at your option) any later version.\n//\n// This program is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU General Public License for more details.\n//\n// You should have received a copy of the GNU General Public License\n// along with this program; if not, write to the Free Software\n// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n\n// This implementation of the DeltaBlue benchmark is derived\n// from the Smalltalk implementation by John Maloney and Mario\n// Wolczko. Some parts have been translated directly, whereas\n// others have been modified more aggresively to make it feel\n// more like a JavaScript program.\n\n\n/**\n * A JavaScript implementation of the DeltaBlue constraint-solving\n * algorithm, as described in:\n *\n * \"The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver\"\n * Bjorn N. Freeman-Benson and John Maloney\n * January 1990 Communications of the ACM,\n * also available as University of Washington TR 89-08-06.\n *\n * Beware: this benchmark is written in a grotesque style where\n * the constraint model is built by side-effects from constructors.\n * I've kept it this way to avoid deviating too much from the original\n * implementation.\n */\n\n\n/* --- O b j e c t M o d e l --- */\n\nObject.prototype.inheritsFrom = function (shuper) {\n function Inheriter() {\n }\n\n Inheriter.prototype = shuper.prototype;\n this.prototype = new Inheriter();\n this.superConstructor = shuper;\n};\n\nfunction OrderedCollection() {\n this.elms = new Array();\n}\n\nOrderedCollection.prototype.add = function (elm) {\n this.elms.push(elm);\n};\n\nOrderedCollection.prototype.at = function (index) {\n return this.elms[index];\n};\n\nOrderedCollection.prototype.size = function () {\n return this.elms.length;\n};\n\nOrderedCollection.prototype.removeFirst = function () {\n return this.elms.pop();\n};\n\nOrderedCollection.prototype.remove = function (elm) {\n var index = 0, skipped = 0;\n for (var i = 0; i < this.elms.length; i++) {\n var value = this.elms[i];\n if (value != elm) {\n this.elms[index] = value;\n index++;\n } else {\n skipped++;\n }\n }\n for (var i = 0; i < skipped; i++)\n this.elms.pop();\n};\n\n/* --- *\n * S t r e n g t h\n * --- */\n\n/**\n * Strengths are used to measure the relative importance of constraints.\n * New strengths may be inserted in the strength hierarchy without\n * disrupting current constraints. Strengths cannot be created outside\n * this class, so pointer comparison can be used for value comparison.\n */\nfunction Strength(strengthValue, name) {\n this.strengthValue = strengthValue;\n this.name = name;\n}\n\nStrength.stronger = function (s1, s2) {\n return s1.strengthValue < s2.strengthValue;\n};\n\nStrength.weaker = function (s1, s2) {\n return s1.strengthValue > s2.strengthValue;\n};\n\nStrength.weakestOf = function (s1, s2) {\n return this.weaker(s1, s2) ? s1 : s2;\n};\n\nStrength.strongest = function (s1, s2) {\n return this.stronger(s1, s2) ? s1 : s2;\n};\n\nStrength.prototype.nextWeaker = function () {\n switch (this.strengthValue) {\n case 0:\n return Strength.STRONG_PREFERRED;\n case 1:\n return Strength.PREFERRED;\n case 2:\n return Strength.STRONG_DEFAULT;\n case 3:\n return Strength.NORMAL;\n case 4:\n return Strength.WEAK_DEFAULT;\n case 5:\n return Strength.WEAKEST;\n }\n};\n\n// Strength constants.\nStrength.REQUIRED = new Strength(0, \"required\");\nStrength.STRONG_PREFERRED = new Strength(1, \"strongPreferred\");\nStrength.PREFERRED = new Strength(2, \"preferred\");\nStrength.STRONG_DEFAULT = new Strength(3, \"strongDefault\");\nStrength.NORMAL = new Strength(4, \"normal\");\nStrength.WEAK_DEFAULT = new Strength(5, \"weakDefault\");\nStrength.WEAKEST = new Strength(6, \"weakest\");\n\n/* --- *\n * C o n s t r a i n t\n * --- */\n\n/**\n * An abstract class representing a system-maintainable relationship\n * (or \"constraint\") between a set of variables. A constraint supplies\n * a strength instance variable; concrete subclasses provide a means\n * of storing the constrained variables and other information required\n * to represent a constraint.\n */\nfunction Constraint(strength) {\n this.strength = strength;\n}\n\n/**\n * Activate this constraint and attempt to satisfy it.\n */\nConstraint.prototype.addConstraint = function () {\n this.addToGraph();\n planner.incrementalAdd(this);\n};\n\n/**\n * Attempt to find a way to enforce this constraint. If successful,\n * record the solution, perhaps modifying the current dataflow\n * graph. Answer the constraint that this constraint overrides, if\n * there is one, or nil, if there isn't.\n * Assume: I am not already satisfied.\n */\nConstraint.prototype.satisfy = function (mark) {\n this.chooseMethod(mark);\n if (!this.isSatisfied()) {\n if (this.strength == Strength.REQUIRED)\n alert(\"Could not satisfy a required constraint!\");\n return null;\n }\n this.markInputs(mark);\n var out = this.output();\n var overridden = out.determinedBy;\n if (overridden != null) overridden.markUnsatisfied();\n out.determinedBy = this;\n if (!planner.addPropagate(this, mark))\n alert(\"Cycle encountered\");\n out.mark = mark;\n return overridden;\n};\n\nConstraint.prototype.destroyConstraint = function () {\n if (this.isSatisfied()) planner.incrementalRemove(this);\n else this.removeFromGraph();\n};\n\n/**\n * Normal constraints are not input constraints. An input constraint\n * is one that depends on external state, such as the mouse, the\n * keybord, a clock, or some arbitraty piece of imperative code.\n */\nConstraint.prototype.isInput = function () {\n return false;\n};\n\n/* --- *\n * U n a r y C o n s t r a i n t\n * --- */\n\n/**\n * Abstract superclass for constraints having a single possible output\n * variable.\n */\nfunction UnaryConstraint(v, strength) {\n UnaryConstraint.superConstructor.call(this, strength);\n this.myOutput = v;\n this.satisfied = false;\n this.addConstraint();\n}\n\nUnaryConstraint.inheritsFrom(Constraint);\n\n/**\n * Adds this constraint to the constraint graph\n */\nUnaryConstraint.prototype.addToGraph = function () {\n this.myOutput.addConstraint(this);\n this.satisfied = false;\n};\n\n/**\n * Decides if this constraint can be satisfied and records that\n * decision.\n */\nUnaryConstraint.prototype.chooseMethod = function (mark) {\n this.satisfied = (this.myOutput.mark != mark)\n && Strength.stronger(this.strength, this.myOutput.walkStrength);\n};\n\n/**\n * Returns true if this constraint is satisfied in the current solution.\n */\nUnaryConstraint.prototype.isSatisfied = function () {\n return this.satisfied;\n};\n\nUnaryConstraint.prototype.markInputs = function (mark) {\n // has no inputs\n};\n\n/**\n * Returns the current output variable.\n */\nUnaryConstraint.prototype.output = function () {\n return this.myOutput;\n};\n\n/**\n * Calculate the walkabout strength, the stay flag, and, if it is\n * 'stay', the value for the current output of this constraint. Assume\n * this constraint is satisfied.\n */\nUnaryConstraint.prototype.recalculate = function () {\n this.myOutput.walkStrength = this.strength;\n this.myOutput.stay = !this.isInput();\n if (this.myOutput.stay) this.execute(); // Stay optimization\n};\n\n/**\n * Records that this constraint is unsatisfied\n */\nUnaryConstraint.prototype.markUnsatisfied = function () {\n this.satisfied = false;\n};\n\nUnaryConstraint.prototype.inputsKnown = function () {\n return true;\n};\n\nUnaryConstraint.prototype.removeFromGraph = function () {\n if (this.myOutput != null) this.myOutput.removeConstraint(this);\n this.satisfied = false;\n};\n\n/* --- *\n * S t a y C o n s t r a i n t\n * --- */\n\n/**\n * Variables that should, with some level of preference, stay the same.\n * Planners may exploit the fact that instances, if satisfied, will not\n * change their output during plan execution. This is called \"stay\n * optimization\".\n */\nfunction StayConstraint(v, str) {\n StayConstraint.superConstructor.call(this, v, str);\n}\n\nStayConstraint.inheritsFrom(UnaryConstraint);\n\nStayConstraint.prototype.execute = function () {\n // Stay constraints do nothing\n};\n\n/* --- *\n * E d i t C o n s t r a i n t\n * --- */\n\n/**\n * A unary input constraint used to mark a variable that the client\n * wishes to change.\n */\nfunction EditConstraint(v, str) {\n EditConstraint.superConstructor.call(this, v, str);\n}\n\nEditConstraint.inheritsFrom(UnaryConstraint);\n\n/**\n * Edits indicate that a variable is to be changed by imperative code.\n */\nEditConstraint.prototype.isInput = function () {\n return true;\n};\n\nEditConstraint.prototype.execute = function () {\n // Edit constraints do nothing\n};\n\n/* --- *\n * B i n a r y C o n s t r a i n t\n * --- */\n\nvar Direction = new Object();\nDirection.NONE = 0;\nDirection.FORWARD = 1;\nDirection.BACKWARD = -1;\n\n/**\n * Abstract superclass for constraints having two possible output\n * variables.\n */\nfunction BinaryConstraint(var1, var2, strength) {\n BinaryConstraint.superConstructor.call(this, strength);\n this.v1 = var1;\n this.v2 = var2;\n this.direction = Direction.NONE;\n this.addConstraint();\n}\n\nBinaryConstraint.inheritsFrom(Constraint);\n\n/**\n * Decides if this constraint can be satisfied and which way it\n * should flow based on the relative strength of the variables related,\n * and record that decision.\n */\nBinaryConstraint.prototype.chooseMethod = function (mark) {\n if (this.v1.mark == mark) {\n this.direction = (this.v2.mark != mark && Strength.stronger(this.strength, this.v2.walkStrength))\n ? Direction.FORWARD\n : Direction.NONE;\n }\n if (this.v2.mark == mark) {\n this.direction = (this.v1.mark != mark && Strength.stronger(this.strength, this.v1.walkStrength))\n ? Direction.BACKWARD\n : Direction.NONE;\n }\n if (Strength.weaker(this.v1.walkStrength, this.v2.walkStrength)) {\n this.direction = Strength.stronger(this.strength, this.v1.walkStrength)\n ? Direction.BACKWARD\n : Direction.NONE;\n } else {\n this.direction = Strength.stronger(this.strength, this.v2.walkStrength)\n ? Direction.FORWARD\n : Direction.BACKWARD\n }\n};\n\n/**\n * Add this constraint to the constraint graph\n */\nBinaryConstraint.prototype.addToGraph = function () {\n this.v1.addConstraint(this);\n this.v2.addConstraint(this);\n this.direction = Direction.NONE;\n};\n\n/**\n * Answer true if this constraint is satisfied in the current solution.\n */\nBinaryConstraint.prototype.isSatisfied = function () {\n return this.direction != Direction.NONE;\n};\n\n/**\n * Mark the input variable with the given mark.\n */\nBinaryConstraint.prototype.markInputs = function (mark) {\n this.input().mark = mark;\n};\n\n/**\n * Returns the current input variable\n */\nBinaryConstraint.prototype.input = function () {\n return (this.direction == Direction.FORWARD) ? this.v1 : this.v2;\n};\n\n/**\n * Returns the current output variable\n */\nBinaryConstraint.prototype.output = function () {\n return (this.direction == Direction.FORWARD) ? this.v2 : this.v1;\n};\n\n/**\n * Calculate the walkabout strength, the stay flag, and, if it is\n * 'stay', the value for the current output of this\n * constraint. Assume this constraint is satisfied.\n */\nBinaryConstraint.prototype.recalculate = function () {\n var ihn = this.input(), out = this.output();\n out.walkStrength = Strength.weakestOf(this.strength, ihn.walkStrength);\n out.stay = ihn.stay;\n if (out.stay) this.execute();\n};\n\n/**\n * Record the fact that this constraint is unsatisfied.\n */\nBinaryConstraint.prototype.markUnsatisfied = function () {\n this.direction = Direction.NONE;\n};\n\nBinaryConstraint.prototype.inputsKnown = function (mark) {\n var i = this.input();\n return i.mark == mark || i.stay || i.determinedBy == null;\n};\n\nBinaryConstraint.prototype.removeFromGraph = function () {\n if (this.v1 != null) this.v1.removeConstraint(this);\n if (this.v2 != null) this.v2.removeConstraint(this);\n this.direction = Direction.NONE;\n};\n\n/* --- *\n * S c a l e C o n s t r a i n t\n * --- */\n\n/**\n * Relates two variables by the linear scaling relationship: \"v2 =\n * (v1 * scale) + offset\". Either v1 or v2 may be changed to maintain\n * this relationship but the scale factor and offset are considered\n * read-only.\n */\nfunction ScaleConstraint(src, scale, offset, dest, strength) {\n this.direction = Direction.NONE;\n this.scale = scale;\n this.offset = offset;\n ScaleConstraint.superConstructor.call(this, src, dest, strength);\n}\n\nScaleConstraint.inheritsFrom(BinaryConstraint);\n\n/**\n * Adds this constraint to the constraint graph.\n */\nScaleConstraint.prototype.addToGraph = function () {\n ScaleConstraint.superConstructor.prototype.addToGraph.call(this);\n this.scale.addConstraint(this);\n this.offset.addConstraint(this);\n};\n\nScaleConstraint.prototype.removeFromGraph = function () {\n ScaleConstraint.superConstructor.prototype.removeFromGraph.call(this);\n if (this.scale != null) this.scale.removeConstraint(this);\n if (this.offset != null) this.offset.removeConstraint(this);\n};\n\nScaleConstraint.prototype.markInputs = function (mark) {\n ScaleConstraint.superConstructor.prototype.markInputs.call(this, mark);\n this.scale.mark = this.offset.mark = mark;\n};\n\n/**\n * Enforce this constraint. Assume that it is satisfied.\n */\nScaleConstraint.prototype.execute = function () {\n if (this.direction == Direction.FORWARD) {\n this.v2.value = this.v1.value * this.scale.value + this.offset.value;\n } else {\n this.v1.value = (this.v2.value - this.offset.value) / this.scale.value;\n }\n}\n\n/**\n * Calculate the walkabout strength, the stay flag, and, if it is\n * 'stay', the value for the current output of this constraint. Assume\n * this constraint is satisfied.\n */\nScaleConstraint.prototype.recalculate = function () {\n var ihn = this.input(), out = this.output();\n out.walkStrength = Strength.weakestOf(this.strength, ihn.walkStrength);\n out.stay = ihn.stay && this.scale.stay && this.offset.stay;\n if (out.stay) this.execute();\n}\n\n/* --- *\n * E q u a l i t y C o n s t r a i n t\n * --- */\n\n/**\n * Constrains two variables to have the same value.\n */\nfunction EqualityConstraint(var1, var2, strength) {\n EqualityConstraint.superConstructor.call(this, var1, var2, strength);\n}\n\nEqualityConstraint.inheritsFrom(BinaryConstraint);\n\n/**\n * Enforce this constraint. Assume that it is satisfied.\n */\nEqualityConstraint.prototype.execute = function () {\n this.output().value = this.input().value;\n}\n\n/* --- *\n * V a r i a b l e\n * --- */\n\n/**\n * A constrained variable. In addition to its value, it maintain the\n * structure of the constraint graph, the current dataflow graph, and\n * various parameters of interest to the DeltaBlue incremental\n * constraint solver.\n **/\nfunction Variable(name, initialValue) {\n this.value = initialValue || 0;\n this.constraints = new OrderedCollection();\n this.determinedBy = null;\n this.mark = 0;\n this.walkStrength = Strength.WEAKEST;\n this.stay = true;\n this.name = name;\n}\n\n/**\n * Add the given constraint to the set of all constraints that refer\n * this variable.\n */\nVariable.prototype.addConstraint = function (c) {\n this.constraints.add(c);\n}\n\n/**\n * Removes all traces of c from this variable.\n */\nVariable.prototype.removeConstraint = function (c) {\n this.constraints.remove(c);\n if (this.determinedBy == c) this.determinedBy = null;\n}\n\n/* --- *\n * P l a n n e r\n * --- */\n\n/**\n * The DeltaBlue planner\n */\nfunction Planner() {\n this.currentMark = 0;\n}\n\n/**\n * Attempt to satisfy the given constraint and, if successful,\n * incrementally update the dataflow graph. Details: If satifying\n * the constraint is successful, it may override a weaker constraint\n * on its output. The algorithm attempts to resatisfy that\n * constraint using some other method. This process is repeated\n * until either a) it reaches a variable that was not previously\n * determined by any constraint or b) it reaches a constraint that\n * is too weak to be satisfied using any of its methods. The\n * variables of constraints that have been processed are marked with\n * a unique mark value so that we know where we've been. This allows\n * the algorithm to avoid getting into an infinite loop even if the\n * constraint graph has an inadvertent cycle.\n */\nPlanner.prototype.incrementalAdd = function (c) {\n var mark = this.newMark();\n var overridden = c.satisfy(mark);\n while (overridden != null)\n overridden = overridden.satisfy(mark);\n}\n\n/**\n * Entry point for retracting a constraint. Remove the given\n * constraint and incrementally update the dataflow graph.\n * Details: Retracting the given constraint may allow some currently\n * unsatisfiable downstream constraint to be satisfied. We therefore collect\n * a list of unsatisfied downstream constraints and attempt to\n * satisfy each one in turn. This list is traversed by constraint\n * strength, strongest first, as a heuristic for avoiding\n * unnecessarily adding and then overriding weak constraints.\n * Assume: c is satisfied.\n */\nPlanner.prototype.incrementalRemove = function (c) {\n var out = c.output();\n c.markUnsatisfied();\n c.removeFromGraph();\n var unsatisfied = this.removePropagateFrom(out);\n var strength = Strength.REQUIRED;\n do {\n for (var i = 0; i < unsatisfied.size(); i++) {\n var u = unsatisfied.at(i);\n if (u.strength == strength)\n this.incrementalAdd(u);\n }\n strength = strength.nextWeaker();\n } while (strength != Strength.WEAKEST);\n}\n\n/**\n * Select a previously unused mark value.\n */\nPlanner.prototype.newMark = function () {\n return ++this.currentMark;\n}\n\n/**\n * Extract a plan for resatisfaction starting from the given source\n * constraints, usually a set of input constraints. This method\n * assumes that stay optimization is desired; the plan will contain\n * only constraints whose output variables are not stay. Constraints\n * that do no computation, such as stay and edit constraints, are\n * not included in the plan.\n * Details: The outputs of a constraint are marked when it is added\n * to the plan under construction. A constraint may be appended to\n * the plan when all its input variables are known. A variable is\n * known if either a) the variable is marked (indicating that has\n * been computed by a constraint appearing earlier in the plan), b)\n * the variable is 'stay' (i.e. it is a constant at plan execution\n * time), or c) the variable is not determined by any\n * constraint. The last provision is for past states of history\n * variables, which are not stay but which are also not computed by\n * any constraint.\n * Assume: sources are all satisfied.\n */\nPlanner.prototype.makePlan = function (sources) {\n var mark = this.newMark();\n var plan = new Plan();\n var todo = sources;\n while (todo.size() > 0) {\n var c = todo.removeFirst();\n if (c.output().mark != mark && c.inputsKnown(mark)) {\n plan.addConstraint(c);\n c.output().mark = mark;\n this.addConstraintsConsumingTo(c.output(), todo);\n }\n }\n return plan;\n}\n\n/**\n * Extract a plan for resatisfying starting from the output of the\n * given constraints, usually a set of input constraints.\n */\nPlanner.prototype.extractPlanFromConstraints = function (constraints) {\n var sources = new OrderedCollection();\n for (var i = 0; i < constraints.size(); i++) {\n var c = constraints.at(i);\n if (c.isInput() && c.isSatisfied())\n // not in plan already and eligible for inclusion\n sources.add(c);\n }\n return this.makePlan(sources);\n}\n\n/**\n * Recompute the walkabout strengths and stay flags of all variables\n * downstream of the given constraint and recompute the actual\n * values of all variables whose stay flag is true. If a cycle is\n * detected, remove the given constraint and answer\n * false. Otherwise, answer true.\n * Details: Cycles are detected when a marked variable is\n * encountered downstream of the given constraint. The sender is\n * assumed to have marked the inputs of the given constraint with\n * the given mark. Thus, encountering a marked node downstream of\n * the output constraint means that there is a path from the\n * constraint's output to one of its inputs.\n */\nPlanner.prototype.addPropagate = function (c, mark) {\n var todo = new OrderedCollection();\n todo.add(c);\n while (todo.size() > 0) {\n var d = todo.removeFirst();\n if (d.output().mark == mark) {\n this.incrementalRemove(c);\n return false;\n }\n d.recalculate();\n this.addConstraintsConsumingTo(d.output(), todo);\n }\n return true;\n}\n\n\n/**\n * Update the walkabout strengths and stay flags of all variables\n * downstream of the given constraint. Answer a collection of\n * unsatisfied constraints sorted in order of decreasing strength.\n */\nPlanner.prototype.removePropagateFrom = function (out) {\n out.determinedBy = null;\n out.walkStrength = Strength.WEAKEST;\n out.stay = true;\n var unsatisfied = new OrderedCollection();\n var todo = new OrderedCollection();\n todo.add(out);\n while (todo.size() > 0) {\n var v = todo.removeFirst();\n for (var i = 0; i < v.constraints.size(); i++) {\n var c = v.constraints.at(i);\n if (!c.isSatisfied())\n unsatisfied.add(c);\n }\n var determining = v.determinedBy;\n for (var i = 0; i < v.constraints.size(); i++) {\n var next = v.constraints.at(i);\n if (next != determining && next.isSatisfied()) {\n next.recalculate();\n todo.add(next.output());\n }\n }\n }\n return unsatisfied;\n}\n\nPlanner.prototype.addConstraintsConsumingTo = function (v, coll) {\n var determining = v.determinedBy;\n var cc = v.constraints;\n for (var i = 0; i < cc.size(); i++) {\n var c = cc.at(i);\n if (c != determining && c.isSatisfied())\n coll.add(c);\n }\n}\n\n/* --- *\n * P l a n\n * --- */\n\n/**\n * A Plan is an ordered list of constraints to be executed in sequence\n * to resatisfy all currently satisfiable constraints in the face of\n * one or more changing inputs.\n */\nfunction Plan() {\n this.v = new OrderedCollection();\n}\n\nPlan.prototype.addConstraint = function (c) {\n this.v.add(c);\n}\n\nPlan.prototype.size = function () {\n return this.v.size();\n}\n\nPlan.prototype.constraintAt = function (index) {\n return this.v.at(index);\n}\n\nPlan.prototype.execute = function () {\n for (var i = 0; i < this.size(); i++) {\n var c = this.constraintAt(i);\n c.execute();\n }\n}\n\n/* --- *\n * M a i n\n * --- */\n\n/**\n * This is the standard DeltaBlue benchmark. A long chain of equality\n * constraints is constructed with a stay constraint on one end. An\n * edit constraint is then added to the opposite end and the time is\n * measured for adding and removing this constraint, and extracting\n * and executing a constraint satisfaction plan. There are two cases.\n * In case 1, the added constraint is stronger than the stay\n * constraint and values must propagate down the entire length of the\n * chain. In case 2, the added constraint is weaker than the stay\n * constraint so it cannot be accomodated. The cost in this case is,\n * of course, very low. Typical situations lie somewhere between these\n * two extremes.\n */\nfunction chainTest(n) {\n planner = new Planner();\n var prev = null, first = null, last = null;\n\n // Build chain of n equality constraints\n for (var i = 0; i <= n; i++) {\n var name = \"v\" + i;\n var v = new Variable(name);\n if (prev != null)\n new EqualityConstraint(prev, v, Strength.REQUIRED);\n if (i == 0) first = v;\n if (i == n) last = v;\n prev = v;\n }\n\n new StayConstraint(last, Strength.STRONG_DEFAULT);\n var edit = new EditConstraint(first, Strength.PREFERRED);\n var edits = new OrderedCollection();\n edits.add(edit);\n var plan = planner.extractPlanFromConstraints(edits);\n for (var i = 0; i < 100; i++) {\n first.value = i;\n plan.execute();\n if (last.value != i)\n alert(\"Chain test failed.\");\n }\n}\n\n/**\n * This test constructs a two sets of variables related to each\n * other by a simple linear transformation (scale and offset). The\n * time is measured to change a variable on either side of the\n * mapping and to change the scale and offset factors.\n */\nfunction projectionTest(n) {\n planner = new Planner();\n var scale = new Variable(\"scale\", 10);\n var offset = new Variable(\"offset\", 1000);\n var src = null, dst = null;\n\n var dests = new OrderedCollection();\n for (var i = 0; i < n; i++) {\n src = new Variable(\"src\" + i, i);\n dst = new Variable(\"dst\" + i, i);\n dests.add(dst);\n new StayConstraint(src, Strength.NORMAL);\n new ScaleConstraint(src, scale, offset, dst, Strength.REQUIRED);\n }\n\n change(src, 17);\n if (dst.value != 1170) alert(\"Projection 1 failed\");\n change(dst, 1050);\n if (src.value != 5) alert(\"Projection 2 failed\");\n change(scale, 5);\n for (var i = 0; i < n - 1; i++) {\n if (dests.at(i).value != i * 5 + 1000)\n alert(\"Projection 3 failed\");\n }\n change(offset, 2000);\n for (var i = 0; i < n - 1; i++) {\n if (dests.at(i).value != i * 5 + 2000)\n alert(\"Projection 4 failed\");\n }\n}\n\nfunction change(v, newValue) {\n var edit = new EditConstraint(v, Strength.PREFERRED);\n var edits = new OrderedCollection();\n edits.add(edit);\n var plan = planner.extractPlanFromConstraints(edits);\n for (var i = 0; i < 10; i++) {\n v.value = newValue;\n plan.execute();\n }\n edit.destroyConstraint();\n}\n\n// Global variable holding the current planner.\nvar planner = null;\n\nfunction deltaBlue() {\n chainTest(100);\n projectionTest(100);\n}\n\nvar DeltaBlue = new BenchmarkSuite('DeltaBlue', 66118, [\n new Benchmark('DeltaBlue', deltaBlue)\n]);\n\n/* run_harness.js */\nvar print = console.log;\n\nfunction Run() {\n BenchmarkSuite.RunSuites({\n NotifyStep: ShowProgress,\n NotifyError: AddError,\n NotifyResult: AddResult,\n NotifyScore: AddScore,\n });\n}\n\nvar harnessErrorCount = 0;\n\nfunction ShowProgress(name) {\n print(\"PROGRESS\", name);\n}\n\nfunction AddError(name, error) {\n print(\"ERROR\", name, error);\n print(error.stack);\n harnessErrorCount++;\n}\n\nfunction AddResult(name, result) {\n print(\"RESULT\", name, result);\n}\n\nfunction AddScore(score) {\n print(\"SCORE\", score);\n}\n\nfunction main() {\n Run();\n}\n" }, { "path": "benches/scripts/v8-benches/earley-boyer.js", "content": "\"use strict\";\n\"use strip\";\n// Copyright 2012 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Simple framework for running the benchmark suites and\n// computing a score based on the timing measurements.\n\n\n// A benchmark has a name (string) and a function that will be run to\n// do the performance measurement. The optional setup and tearDown\n// arguments are functions that will be invoked before and after\n// running the benchmark, but the running time of these functions will\n// not be accounted for in the benchmark score.\nfunction Benchmark(name, run, setup, tearDown) {\n this.name = name;\n this.run = run;\n this.Setup = setup ? setup : function () {\n };\n this.TearDown = tearDown ? tearDown : function () {\n };\n}\n\n\n// Benchmark results hold the benchmark and the measured time used to\n// run the benchmark. The benchmark score is computed later once a\n// full benchmark suite has run to completion.\nfunction BenchmarkResult(benchmark, time) {\n this.benchmark = benchmark;\n this.time = time;\n}\n\n\n// Automatically convert results to numbers. Used by the geometric\n// mean computation.\nBenchmarkResult.prototype.valueOf = function () {\n return this.time;\n};\n\n\n// Suites of benchmarks consist of a name and the set of benchmarks in\n// addition to the reference timing that the final score will be based\n// on. This way, all scores are relative to a reference run and higher\n// scores implies better performance.\nfunction BenchmarkSuite(name, reference, benchmarks) {\n this.name = name;\n this.reference = reference;\n this.benchmarks = benchmarks;\n BenchmarkSuite.suites.push(this);\n}\n\n\n// Keep track of all declared benchmark suites.\nBenchmarkSuite.suites = [];\n\n\n// Scores are not comparable across versions. Bump the version if\n// you're making changes that will affect that scores, e.g. if you add\n// a new benchmark or change an existing one.\nBenchmarkSuite.version = '7';\n\n\n// To make the benchmark results predictable, we replace Math.random\n// with a 100% deterministic alternative.\nMath.random = (function () {\n var seed = 49734321;\n return function () {\n // Robert Jenkins' 32 bit integer hash function.\n seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff;\n seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff;\n seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff;\n seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff;\n seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff;\n seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff;\n return (seed & 0xfffffff) / 0x10000000;\n };\n})();\n\n\n// Runs all registered benchmark suites and optionally yields between\n// each individual benchmark to avoid running for too long in the\n// context of browsers. Once done, the final score is reported to the\n// runner.\nBenchmarkSuite.RunSuites = function (runner) {\n var continuation = null;\n var suites = BenchmarkSuite.suites;\n var length = suites.length;\n BenchmarkSuite.scores = [];\n var index = 0;\n\n function RunStep() {\n while (continuation || index < length) {\n if (continuation) {\n continuation = continuation();\n } else {\n var suite = suites[index++];\n if (runner.NotifyStart) runner.NotifyStart(suite.name);\n continuation = suite.RunStep(runner);\n }\n if (continuation && typeof window != 'undefined' && window.setTimeout) {\n window.setTimeout(RunStep, 25);\n return;\n }\n }\n if (runner.NotifyScore) {\n var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores);\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n runner.NotifyScore(formatted);\n }\n }\n\n RunStep();\n};\n\n\n// Counts the total number of registered benchmarks. Useful for\n// showing progress as a percentage.\nBenchmarkSuite.CountBenchmarks = function () {\n var result = 0;\n var suites = BenchmarkSuite.suites;\n for (var i = 0; i < suites.length; i++) {\n result += suites[i].benchmarks.length;\n }\n return result;\n};\n\n\n// Computes the geometric mean of a set of numbers.\nBenchmarkSuite.GeometricMean = function (numbers) {\n var log = 0;\n for (var i = 0; i < numbers.length; i++) {\n log += Math.log(numbers[i]);\n }\n return Math.pow(Math.E, log / numbers.length);\n};\n\n\n// Converts a score value to a string with at least three significant\n// digits.\nBenchmarkSuite.FormatScore = function (value) {\n if (value > 100) {\n return value.toFixed(0);\n } else {\n return value.toPrecision(3);\n }\n};\n\n// Notifies the runner that we're done running a single benchmark in\n// the benchmark suite. This can be useful to report progress.\nBenchmarkSuite.prototype.NotifyStep = function (result) {\n this.results.push(result);\n if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name);\n};\n\n\n// Notifies the runner that we're done with running a suite and that\n// we have a result which can be reported to the user if needed.\nBenchmarkSuite.prototype.NotifyResult = function () {\n var mean = BenchmarkSuite.GeometricMean(this.results);\n var score = this.reference / mean;\n BenchmarkSuite.scores.push(score);\n if (this.runner.NotifyResult) {\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n this.runner.NotifyResult(this.name, formatted);\n }\n};\n\n\n// Notifies the runner that running a benchmark resulted in an error.\nBenchmarkSuite.prototype.NotifyError = function (error) {\n if (this.runner.NotifyError) {\n this.runner.NotifyError(this.name, error);\n }\n if (this.runner.NotifyStep) {\n this.runner.NotifyStep(this.name);\n }\n};\n\n\n// Runs a single benchmark for at least a second and computes the\n// average time it takes to run a single iteration.\nBenchmarkSuite.prototype.RunSingleBenchmark = function (benchmark, data) {\n function Measure(data) {\n var elapsed = 0;\n var start = new Date();\n for (var n = 0; elapsed < 1000; n++) {\n benchmark.run();\n elapsed = new Date() - start;\n }\n if (data != null) {\n data.runs += n;\n data.elapsed += elapsed;\n }\n }\n\n if (data == null) {\n // Measure the benchmark once for warm up and throw the result\n // away. Return a fresh data object.\n Measure(null);\n return {runs: 0, elapsed: 0};\n } else {\n Measure(data);\n // If we've run too few iterations, we continue for another second.\n if (data.runs < 32) return data;\n var usec = (data.elapsed * 1000) / data.runs;\n this.NotifyStep(new BenchmarkResult(benchmark, usec));\n return null;\n }\n};\n\n\n// This function starts running a suite, but stops between each\n// individual benchmark in the suite and returns a continuation\n// function which can be invoked to run the next benchmark. Once the\n// last benchmark has been executed, null is returned.\nBenchmarkSuite.prototype.RunStep = function (runner) {\n this.results = [];\n this.runner = runner;\n var length = this.benchmarks.length;\n var index = 0;\n var suite = this;\n var data;\n\n // Run the setup, the actual benchmark, and the tear down in three\n // separate steps to allow the framework to yield between any of the\n // steps.\n\n function RunNextSetup() {\n if (index < length) {\n try {\n suite.benchmarks[index].Setup();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextBenchmark;\n }\n suite.NotifyResult();\n return null;\n }\n\n function RunNextBenchmark() {\n try {\n data = suite.RunSingleBenchmark(suite.benchmarks[index], data);\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n // If data is null, we're done with this benchmark.\n return (data == null) ? RunNextTearDown : RunNextBenchmark();\n }\n\n function RunNextTearDown() {\n try {\n suite.benchmarks[index++].TearDown();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextSetup;\n }\n\n // Start out running the setup.\n return RunNextSetup();\n};\n// This file is automatically generated by scheme2js, except for the\n// benchmark harness code at the beginning and end of the file.\n\n/************* GENERATED FILE - DO NOT EDIT *************/\n/************* GENERATED FILE - DO NOT EDIT *************/\n/************* GENERATED FILE - DO NOT EDIT *************/\n/************* GENERATED FILE - DO NOT EDIT *************/\n/************* GENERATED FILE - DO NOT EDIT *************/\n/************* GENERATED FILE - DO NOT EDIT *************/\n/************* GENERATED FILE - DO NOT EDIT *************/\n/************* GENERATED FILE - DO NOT EDIT *************/\n\n/*\n * To use write/prints/... the default-output port has to be set first.\n * Simply setting SC_DEFAULT_OUT and SC_ERROR_OUT to the desired values\n * should do the trick.\n * In the following example the std-out and error-port are redirected to\n * a DIV.\nfunction initRuntime() {\n function escapeHTML(s) {\n\tvar tmp = s;\n\ttmp = tmp.replace(/&/g, \"&\");\n\ttmp = tmp.replace(//g, \">\");\n\ttmp = tmp.replace(/ /g, \" \");\n\ttmp = tmp.replace(/\\n/g, \"
\");\n\ttmp = tmp.replace(/\\t/g, \"    \");\n\treturn tmp;\n\n }\n\n document.write(\"
\");\n SC_DEFAULT_OUT = new sc_GenericOutputPort(\n\tfunction(s) {\n\t var stdout = document.getElementById('stdout');\n\t stdout.innerHTML = stdout.innerHTML + escapeHTML(s);\n\t});\n SC_ERROR_OUT = SC_DEFAULT_OUT;\n}\n*/\n\n\nfunction sc_print_debug() {\n sc_print.apply(null, arguments);\n}\n\n/*** META ((export *js*)) */\nvar sc_JS_GLOBALS = this;\n\nvar __sc_LINE = -1;\nvar __sc_FILE = \"\";\n\n/*** META ((export #t)) */\nfunction sc_alert() {\n var len = arguments.length;\n var s = \"\";\n var i;\n\n for (i = 0; i < len; i++) {\n s += sc_toDisplayString(arguments[i]);\n }\n\n return alert(s);\n}\n\n/*** META ((export #t)) */\nfunction sc_typeof(x) {\n return typeof x;\n}\n\n/*** META ((export #t)) */\nfunction sc_error() {\n var a = [sc_jsstring2symbol(\"*error*\")];\n for (var i = 0; i < arguments.length; i++) {\n a[i + 1] = arguments[i];\n }\n throw a;\n}\n\n/*** META ((export #t)\n (peephole (prefix \"throw \")))\n */\nfunction sc_raise(obj) {\n throw obj;\n}\n\n/*** META ((export with-handler-lambda)) */\nfunction sc_withHandlerLambda(handler, body) {\n try {\n return body();\n } catch (e) {\n if (!e._internalException)\n return handler(e);\n else\n throw e;\n }\n}\n\nvar sc_properties = new Object();\n\n/*** META ((export #t)) */\nfunction sc_putpropBang(sym, key, val) {\n var ht = sc_properties[sym];\n if (!ht) {\n ht = new Object();\n sc_properties[sym] = ht;\n }\n ht[key] = val;\n}\n\n/*** META ((export #t)) */\nfunction sc_getprop(sym, key) {\n var ht = sc_properties[sym];\n if (ht) {\n if (key in ht)\n return ht[key];\n else\n return false;\n } else\n return false;\n}\n\n/*** META ((export #t)) */\nfunction sc_rempropBang(sym, key) {\n var ht = sc_properties[sym];\n if (ht)\n delete ht[key];\n}\n\n/*** META ((export #t)) */\nfunction sc_any2String(o) {\n return jsstring2string(sc_toDisplayString(o));\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \"===\"))\n (type bool))\n */\nfunction sc_isEqv(o1, o2) {\n return (o1 === o2);\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \"===\"))\n (type bool))\n */\nfunction sc_isEq(o1, o2) {\n return (o1 === o2);\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isNumber(n) {\n return (typeof n === \"number\");\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isComplex(n) {\n return sc_isNumber(n);\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isReal(n) {\n return sc_isNumber(n);\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isRational(n) {\n return sc_isReal(n);\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isInteger(n) {\n return (parseInt(n) === n);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \", false\")))\n */\n// we don't have exact numbers...\nfunction sc_isExact(n) {\n return false;\n}\n\n/*** META ((export #t)\n (peephole (postfix \", true\"))\n (type bool))\n */\nfunction sc_isInexact(n) {\n return true;\n}\n\n/*** META ((export = =fx =fl)\n (type bool)\n (peephole (infix 2 2 \"===\")))\n */\nfunction sc_equal(x) {\n for (var i = 1; i < arguments.length; i++)\n if (x !== arguments[i])\n return false;\n return true;\n}\n\n/*** META ((export < = arguments[i])\n return false;\n x = arguments[i];\n }\n return true;\n}\n\n/*** META ((export > >fx >fl)\n (type bool)\n (peephole (infix 2 2 \">\")))\n */\nfunction sc_greater(x, y) {\n for (var i = 1; i < arguments.length; i++) {\n if (x <= arguments[i])\n return false;\n x = arguments[i];\n }\n return true;\n}\n\n/*** META ((export <= <=fx <=fl)\n (type bool)\n (peephole (infix 2 2 \"<=\")))\n */\nfunction sc_lessEqual(x, y) {\n for (var i = 1; i < arguments.length; i++) {\n if (x > arguments[i])\n return false;\n x = arguments[i];\n }\n return true;\n}\n\n/*** META ((export >= >=fl >=fx)\n (type bool)\n (peephole (infix 2 2 \">=\")))\n */\nfunction sc_greaterEqual(x, y) {\n for (var i = 1; i < arguments.length; i++) {\n if (x < arguments[i])\n return false;\n x = arguments[i];\n }\n return true;\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \"=== 0\")))\n */\nfunction sc_isZero(x) {\n return (x === 0);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \"> 0\")))\n */\nfunction sc_isPositive(x) {\n return (x > 0);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \"< 0\")))\n */\nfunction sc_isNegative(x) {\n return (x < 0);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \"%2===1\")))\n */\nfunction sc_isOdd(x) {\n return (x % 2 === 1);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \"%2===0\")))\n */\nfunction sc_isEven(x) {\n return (x % 2 === 0);\n}\n\n/*** META ((export #t)) */\nvar sc_max = Math.max;\n/*** META ((export #t)) */\nvar sc_min = Math.min;\n\n/*** META ((export + +fx +fl)\n (peephole (infix 0 #f \"+\" \"0\")))\n */\nfunction sc_plus() {\n var sum = 0;\n for (var i = 0; i < arguments.length; i++)\n sum += arguments[i];\n return sum;\n}\n\n/*** META ((export * *fx *fl)\n (peephole (infix 0 #f \"*\" \"1\")))\n */\nfunction sc_multi() {\n var product = 1;\n for (var i = 0; i < arguments.length; i++)\n product *= arguments[i];\n return product;\n}\n\n/*** META ((export - -fx -fl)\n (peephole (minus)))\n */\nfunction sc_minus(x) {\n if (arguments.length === 1)\n return -x;\n else {\n var res = x;\n for (var i = 1; i < arguments.length; i++)\n res -= arguments[i];\n return res;\n }\n}\n\n/*** META ((export / /fl)\n (peephole (div)))\n */\nfunction sc_div(x) {\n if (arguments.length === 1)\n return 1 / x;\n else {\n var res = x;\n for (var i = 1; i < arguments.length; i++)\n res /= arguments[i];\n return res;\n }\n}\n\n/*** META ((export #t)) */\nvar sc_abs = Math.abs;\n\n/*** META ((export quotient /fx)\n (peephole (hole 2 \"parseInt(\" x \"/\" y \")\")))\n */\nfunction sc_quotient(x, y) {\n return parseInt(x / y);\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \"%\")))\n */\nfunction sc_remainder(x, y) {\n return x % y;\n}\n\n/*** META ((export #t)\n (peephole (modulo)))\n */\nfunction sc_modulo(x, y) {\n var remainder = x % y;\n // if they don't have the same sign\n if ((remainder * y) < 0)\n return remainder + y;\n else\n return remainder;\n}\n\nfunction sc_euclid_gcd(a, b) {\n var temp;\n if (a === 0) return b;\n if (b === 0) return a;\n if (a < 0) {\n a = -a;\n }\n\n if (b < 0) {\n b = -b;\n }\n\n if (b > a) {\n temp = a;\n a = b;\n b = temp;\n }\n\n while (true) {\n a %= b;\n if (a === 0) {\n return b;\n }\n\n b %= a;\n if (b === 0) {\n return a;\n }\n\n }\n\n return b;\n}\n\n/*** META ((export #t)) */\nfunction sc_gcd() {\n var gcd = 0;\n for (var i = 0; i < arguments.length; i++)\n gcd = sc_euclid_gcd(gcd, arguments[i]);\n return gcd;\n}\n\n/*** META ((export #t)) */\nfunction sc_lcm() {\n var lcm = 1;\n for (var i = 0; i < arguments.length; i++) {\n var f = Math.round(arguments[i] / sc_euclid_gcd(arguments[i], lcm));\n lcm *= Math.abs(f);\n }\n return lcm;\n}\n\n// LIMITATION: numerator and denominator don't make sense in floating point world.\n//var SC_MAX_DECIMALS = 1000000\n//\n// function sc_numerator(x) {\n// var rounded = Math.round(x * SC_MAX_DECIMALS);\n// return Math.round(rounded / sc_euclid_gcd(rounded, SC_MAX_DECIMALS));\n// }\n\n// function sc_denominator(x) {\n// var rounded = Math.round(x * SC_MAX_DECIMALS);\n// return Math.round(SC_MAX_DECIMALS / sc_euclid_gcd(rounded, SC_MAX_DECIMALS));\n// }\n\n/*** META ((export #t)) */\nvar sc_floor = Math.floor;\n/*** META ((export #t)) */\nvar sc_ceiling = Math.ceil;\n/*** META ((export #t)) */\nvar sc_truncate = parseInt;\n/*** META ((export #t)) */\nvar sc_round = Math.round;\n\n// LIMITATION: sc_rationalize doesn't make sense in a floating point world.\n\n/*** META ((export #t)) */\nvar sc_exp = Math.exp;\n/*** META ((export #t)) */\nvar sc_log = Math.log;\n/*** META ((export #t)) */\nvar sc_sin = Math.sin;\n/*** META ((export #t)) */\nvar sc_cos = Math.cos;\n/*** META ((export #t)) */\nvar sc_tan = Math.tan;\n/*** META ((export #t)) */\nvar sc_asin = Math.asin;\n/*** META ((export #t)) */\nvar sc_acos = Math.acos;\n/*** META ((export #t)) */\nvar sc_atan = Math.atan;\n\n/*** META ((export #t)) */\nvar sc_sqrt = Math.sqrt;\n/*** META ((export #t)) */\nvar sc_expt = Math.pow;\n\n// LIMITATION: we don't have complex numbers.\n// LIMITATION: the following functions are hence not implemented.\n// LIMITATION: make-rectangular, make-polar, real-part, imag-part, magnitude, angle\n// LIMITATION: 2 argument atan\n\n/*** META ((export #t)\n (peephole (id)))\n */\nfunction sc_exact2inexact(x) {\n return x;\n}\n\n/*** META ((export #t)\n (peephole (id)))\n */\nfunction sc_inexact2exact(x) {\n return x;\n}\n\nfunction sc_number2jsstring(x, radix) {\n if (radix)\n return x.toString(radix);\n else\n return x.toString();\n}\n\nfunction sc_jsstring2number(s, radix) {\n if (s === \"\") return false;\n\n if (radix) {\n var t = parseInt(s, radix);\n if (!t && t !== 0) return false;\n // verify that each char is in range. (parseInt ignores leading\n // white and trailing chars)\n var allowedChars = \"01234567890abcdefghijklmnopqrstuvwxyz\".substring(0, radix + 1);\n if ((new RegExp(\"^[\" + allowedChars + \"]*$\", \"i\")).test(s))\n return t;\n else return false;\n } else {\n var t = +s; // does not ignore trailing chars.\n if (!t && t !== 0) return false;\n // simply verify that first char is not whitespace.\n var c = s.charAt(0);\n // if +c is 0, but the char is not \"0\", then we have a whitespace.\n if (+c === 0 && c !== \"0\") return false;\n return t;\n }\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (not)))\n */\nfunction sc_not(b) {\n return b === false;\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isBoolean(b) {\n return (b === true) || (b === false);\n}\n\nfunction sc_Pair(car, cdr) {\n this.car = car;\n this.cdr = cdr;\n}\n\nsc_Pair.prototype.toString = function () {\n return sc_toDisplayString(this);\n};\nsc_Pair.prototype.sc_toWriteOrDisplayString = function (writeOrDisplay) {\n var current = this;\n\n var res = \"(\";\n\n while (true) {\n res += writeOrDisplay(current.car);\n if (sc_isPair(current.cdr)) {\n res += \" \";\n current = current.cdr;\n } else if (current.cdr !== null) {\n res += \" . \" + writeOrDisplay(current.cdr);\n break;\n } else // current.cdr == null\n break;\n }\n\n res += \")\";\n\n return res;\n};\nsc_Pair.prototype.sc_toDisplayString = function () {\n return this.sc_toWriteOrDisplayString(sc_toDisplayString);\n};\nsc_Pair.prototype.sc_toWriteString = function () {\n return this.sc_toWriteOrDisplayString(sc_toWriteString);\n};\n\n// sc_Pair.prototype.sc_toWriteCircleString in IO.js\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \" instanceof sc_Pair\")))\n */\nfunction sc_isPair(p) {\n return (p instanceof sc_Pair);\n}\n\nfunction sc_isPairEqual(p1, p2, comp) {\n return (comp(p1.car, p2.car) && comp(p1.cdr, p2.cdr));\n}\n\n/*** META ((export #t)\n (peephole (hole 2 \"new sc_Pair(\" car \", \" cdr \")\")))\n */\nfunction sc_cons(car, cdr) {\n return new sc_Pair(car, cdr);\n}\n\n/*** META ((export cons*)) */\nfunction sc_consStar() {\n var res = arguments[arguments.length - 1];\n for (var i = arguments.length - 2; i >= 0; i--)\n res = new sc_Pair(arguments[i], res);\n return res;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car\")))\n */\nfunction sc_car(p) {\n return p.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr\")))\n */\nfunction sc_cdr(p) {\n return p.cdr;\n}\n\n/*** META ((export #t)\n (peephole (hole 2 p \".car = \" val)))\n */\nfunction sc_setCarBang(p, val) {\n p.car = val;\n}\n\n/*** META ((export #t)\n (peephole (hole 2 p \".cdr = \" val)))\n */\nfunction sc_setCdrBang(p, val) {\n p.cdr = val;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.car\")))\n */\nfunction sc_caar(p) {\n return p.car.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.car\")))\n */\nfunction sc_cadr(p) {\n return p.cdr.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.cdr\")))\n */\nfunction sc_cdar(p) {\n return p.car.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.cdr\")))\n */\nfunction sc_cddr(p) {\n return p.cdr.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.car.car\")))\n */\nfunction sc_caaar(p) {\n return p.car.car.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.cdr.car\")))\n */\nfunction sc_cadar(p) {\n return p.car.cdr.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.car.car\")))\n */\nfunction sc_caadr(p) {\n return p.cdr.car.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.cdr.car\")))\n */\nfunction sc_caddr(p) {\n return p.cdr.cdr.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.car.cdr\")))\n */\nfunction sc_cdaar(p) {\n return p.car.car.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.car.cdr\")))\n */\nfunction sc_cdadr(p) {\n return p.cdr.car.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.cdr.cdr\")))\n */\nfunction sc_cddar(p) {\n return p.car.cdr.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.cdr.cdr\")))\n */\nfunction sc_cdddr(p) {\n return p.cdr.cdr.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.car.car.car\")))\n */\nfunction sc_caaaar(p) {\n return p.car.car.car.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.cdr.car.car\")))\n */\nfunction sc_caadar(p) {\n return p.car.cdr.car.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.car.car.car\")))\n */\nfunction sc_caaadr(p) {\n return p.cdr.car.car.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.cdr.car.car\")))\n */\nfunction sc_caaddr(p) {\n return p.cdr.cdr.car.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.car.car.cdr\")))\n */\nfunction sc_cdaaar(p) {\n return p.car.car.car.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.cdr.car.cdr\")))\n */\nfunction sc_cdadar(p) {\n return p.car.cdr.car.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.car.car.cdr\")))\n */\nfunction sc_cdaadr(p) {\n return p.cdr.car.car.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.cdr.car.cdr\")))\n */\nfunction sc_cdaddr(p) {\n return p.cdr.cdr.car.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.car.cdr.car\")))\n */\nfunction sc_cadaar(p) {\n return p.car.car.cdr.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.cdr.cdr.car\")))\n */\nfunction sc_caddar(p) {\n return p.car.cdr.cdr.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.car.cdr.car\")))\n */\nfunction sc_cadadr(p) {\n return p.cdr.car.cdr.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.cdr.cdr.car\")))\n */\nfunction sc_cadddr(p) {\n return p.cdr.cdr.cdr.car;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.car.cdr.cdr\")))\n */\nfunction sc_cddaar(p) {\n return p.car.car.cdr.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".car.cdr.cdr.cdr\")))\n */\nfunction sc_cdddar(p) {\n return p.car.cdr.cdr.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.car.cdr.cdr\")))\n */\nfunction sc_cddadr(p) {\n return p.cdr.car.cdr.cdr;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".cdr.cdr.cdr.cdr\")))\n */\nfunction sc_cddddr(p) {\n return p.cdr.cdr.cdr.cdr;\n}\n\n/*** META ((export #t)) */\nfunction sc_lastPair(l) {\n if (!sc_isPair(l)) sc_error(\"sc_lastPair: pair expected\");\n var res = l;\n var cdr = l.cdr;\n while (sc_isPair(cdr)) {\n res = cdr;\n cdr = res.cdr;\n }\n return res;\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \" === null\")))\n */\nfunction sc_isNull(o) {\n return (o === null);\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isList(o) {\n var rabbit;\n var turtle;\n\n var rabbit = o;\n var turtle = o;\n while (true) {\n if (rabbit === null ||\n (rabbit instanceof sc_Pair && rabbit.cdr === null))\n return true; // end of list\n else if ((rabbit instanceof sc_Pair) &&\n (rabbit.cdr instanceof sc_Pair)) {\n rabbit = rabbit.cdr.cdr;\n turtle = turtle.cdr;\n if (rabbit === turtle) return false; // cycle\n } else\n return false; // not pair\n }\n}\n\n/*** META ((export #t)) */\nfunction sc_list() {\n var res = null;\n var a = arguments;\n for (var i = a.length - 1; i >= 0; i--)\n res = new sc_Pair(a[i], res);\n return res;\n}\n\n/*** META ((export #t)) */\nfunction sc_iota(num, init) {\n var res = null;\n if (!init) init = 0;\n for (var i = num - 1; i >= 0; i--)\n res = new sc_Pair(i + init, res);\n return res;\n}\n\n/*** META ((export #t)) */\nfunction sc_makeList(nbEls, fill) {\n var res = null;\n for (var i = 0; i < nbEls; i++)\n res = new sc_Pair(fill, res);\n return res;\n}\n\n/*** META ((export #t)) */\nfunction sc_length(l) {\n var res = 0;\n while (l !== null) {\n res++;\n l = l.cdr;\n }\n return res;\n}\n\n/*** META ((export #t)) */\nfunction sc_remq(o, l) {\n var dummy = {cdr: null};\n var tail = dummy;\n while (l !== null) {\n if (l.car !== o) {\n tail.cdr = sc_cons(l.car, null);\n tail = tail.cdr;\n }\n l = l.cdr;\n }\n return dummy.cdr;\n}\n\n/*** META ((export #t)) */\nfunction sc_remqBang(o, l) {\n var dummy = {cdr: null};\n var tail = dummy;\n var needsAssig = true;\n while (l !== null) {\n if (l.car === o) {\n needsAssig = true;\n } else {\n if (needsAssig) {\n tail.cdr = l;\n needsAssig = false;\n }\n tail = l;\n }\n l = l.cdr;\n }\n tail.cdr = null;\n return dummy.cdr;\n}\n\n/*** META ((export #t)) */\nfunction sc_delete(o, l) {\n var dummy = {cdr: null};\n var tail = dummy;\n while (l !== null) {\n if (!sc_isEqual(l.car, o)) {\n tail.cdr = sc_cons(l.car, null);\n tail = tail.cdr;\n }\n l = l.cdr;\n }\n return dummy.cdr;\n}\n\n/*** META ((export #t)) */\nfunction sc_deleteBang(o, l) {\n var dummy = {cdr: null};\n var tail = dummy;\n var needsAssig = true;\n while (l !== null) {\n if (sc_isEqual(l.car, o)) {\n needsAssig = true;\n } else {\n if (needsAssig) {\n tail.cdr = l;\n needsAssig = false;\n }\n tail = l;\n }\n l = l.cdr;\n }\n tail.cdr = null;\n return dummy.cdr;\n}\n\nfunction sc_reverseAppendBang(l1, l2) {\n var res = l2;\n while (l1 !== null) {\n var tmp = res;\n res = l1;\n l1 = l1.cdr;\n res.cdr = tmp;\n }\n return res;\n}\n\nfunction sc_dualAppend(l1, l2) {\n if (l1 === null) return l2;\n if (l2 === null) return l1;\n var rev = sc_reverse(l1);\n return sc_reverseAppendBang(rev, l2);\n}\n\n/*** META ((export #t)) */\nfunction sc_append() {\n if (arguments.length === 0)\n return null;\n var res = arguments[arguments.length - 1];\n for (var i = arguments.length - 2; i >= 0; i--)\n res = sc_dualAppend(arguments[i], res);\n return res;\n}\n\nfunction sc_dualAppendBang(l1, l2) {\n if (l1 === null) return l2;\n if (l2 === null) return l1;\n var tmp = l1;\n while (tmp.cdr !== null) tmp = tmp.cdr;\n tmp.cdr = l2;\n return l1;\n}\n\n/*** META ((export #t)) */\nfunction sc_appendBang() {\n var res = null;\n for (var i = 0; i < arguments.length; i++)\n res = sc_dualAppendBang(res, arguments[i]);\n return res;\n}\n\n/*** META ((export #t)) */\nfunction sc_reverse(l1) {\n var res = null;\n while (l1 !== null) {\n res = sc_cons(l1.car, res);\n l1 = l1.cdr;\n }\n return res;\n}\n\n/*** META ((export #t)) */\nfunction sc_reverseBang(l) {\n return sc_reverseAppendBang(l, null);\n}\n\n/*** META ((export #t)) */\nfunction sc_listTail(l, k) {\n var res = l;\n for (var i = 0; i < k; i++) {\n res = res.cdr;\n }\n return res;\n}\n\n/*** META ((export #t)) */\nfunction sc_listRef(l, k) {\n return sc_listTail(l, k).car;\n}\n\n/* // unoptimized generic versions\nfunction sc_memX(o, l, comp) {\n while (l != null) {\n\tif (comp(l.car, o))\n\t return l;\n\tl = l.cdr;\n }\n return false;\n}\nfunction sc_memq(o, l) { return sc_memX(o, l, sc_isEq); }\nfunction sc_memv(o, l) { return sc_memX(o, l, sc_isEqv); }\nfunction sc_member(o, l) { return sc_memX(o, l, sc_isEqual); }\n*/\n\n/* optimized versions */\n/*** META ((export #t)) */\nfunction sc_memq(o, l) {\n while (l !== null) {\n if (l.car === o)\n return l;\n l = l.cdr;\n }\n return false;\n}\n\n/*** META ((export #t)) */\nfunction sc_memv(o, l) {\n while (l !== null) {\n if (l.car === o)\n return l;\n l = l.cdr;\n }\n return false;\n}\n\n/*** META ((export #t)) */\nfunction sc_member(o, l) {\n while (l !== null) {\n if (sc_isEqual(l.car, o))\n return l;\n l = l.cdr;\n }\n return false;\n}\n\n/* // generic unoptimized versions\nfunction sc_assX(o, al, comp) {\n while (al != null) {\n\tif (comp(al.car.car, o))\n\t return al.car;\n\tal = al.cdr;\n }\n return false;\n}\nfunction sc_assq(o, al) { return sc_assX(o, al, sc_isEq); }\nfunction sc_assv(o, al) { return sc_assX(o, al, sc_isEqv); }\nfunction sc_assoc(o, al) { return sc_assX(o, al, sc_isEqual); }\n*/\n\n// optimized versions\n/*** META ((export #t)) */\nfunction sc_assq(o, al) {\n while (al !== null) {\n if (al.car.car === o)\n return al.car;\n al = al.cdr;\n }\n return false;\n}\n\n/*** META ((export #t)) */\nfunction sc_assv(o, al) {\n while (al !== null) {\n if (al.car.car === o)\n return al.car;\n al = al.cdr;\n }\n return false;\n}\n\n/*** META ((export #t)) */\nfunction sc_assoc(o, al) {\n while (al !== null) {\n if (sc_isEqual(al.car.car, o))\n return al.car;\n al = al.cdr;\n }\n return false;\n}\n\n/* can be used for mutable strings and characters */\nfunction sc_isCharStringEqual(cs1, cs2) {\n return cs1.val === cs2.val;\n}\n\nfunction sc_isCharStringLess(cs1, cs2) {\n return cs1.val < cs2.val;\n}\n\nfunction sc_isCharStringGreater(cs1, cs2) {\n return cs1.val > cs2.val;\n}\n\nfunction sc_isCharStringLessEqual(cs1, cs2) {\n return cs1.val <= cs2.val;\n}\n\nfunction sc_isCharStringGreaterEqual(cs1, cs2) {\n return cs1.val >= cs2.val;\n}\n\nfunction sc_isCharStringCIEqual(cs1, cs2) {\n return cs1.val.toLowerCase() === cs2.val.toLowerCase();\n}\n\nfunction sc_isCharStringCILess(cs1, cs2) {\n return cs1.val.toLowerCase() < cs2.val.toLowerCase();\n}\n\nfunction sc_isCharStringCIGreater(cs1, cs2) {\n return cs1.val.toLowerCase() > cs2.val.toLowerCase();\n}\n\nfunction sc_isCharStringCILessEqual(cs1, cs2) {\n return cs1.val.toLowerCase() <= cs2.val.toLowerCase();\n}\n\nfunction sc_isCharStringCIGreaterEqual(cs1, cs2) {\n return cs1.val.toLowerCase() >= cs2.val.toLowerCase();\n}\n\n\nfunction sc_Char(c) {\n var cached = sc_Char.lazy[c];\n if (cached)\n return cached;\n this.val = c;\n sc_Char.lazy[c] = this;\n // add return, so FF does not complain.\n return undefined;\n}\n\nsc_Char.lazy = new Object();\n// thanks to Eric\nsc_Char.char2readable = {\n \"\\u0000\": \"#\\\\null\",\n \"\\u0007\": \"#\\\\bell\",\n \"\\b\": \"#\\\\backspace\",\n \"\\t\": \"#\\\\tab\",\n \"\\n\": \"#\\\\newline\",\n \"\\f\": \"#\\\\page\",\n \"\\r\": \"#\\\\return\",\n \"\\u001b\": \"#\\\\esc\",\n \" \": \"#\\\\space\",\n \"\\u007f\": \"#\\\\delete\",\n /* poeticless names */\n \"\\u0001\": \"#\\\\soh\",\n \"\\u0002\": \"#\\\\stx\",\n \"\\u0003\": \"#\\\\etx\",\n \"\\u0004\": \"#\\\\eot\",\n \"\\u0005\": \"#\\\\enq\",\n \"\\u0006\": \"#\\\\ack\",\n \"\\u000b\": \"#\\\\vt\",\n \"\\u000e\": \"#\\\\so\",\n \"\\u000f\": \"#\\\\si\",\n \"\\u0010\": \"#\\\\dle\",\n \"\\u0011\": \"#\\\\dc1\",\n \"\\u0012\": \"#\\\\dc2\",\n \"\\u0013\": \"#\\\\dc3\",\n \"\\u0014\": \"#\\\\dc4\",\n \"\\u0015\": \"#\\\\nak\",\n \"\\u0016\": \"#\\\\syn\",\n \"\\u0017\": \"#\\\\etb\",\n \"\\u0018\": \"#\\\\can\",\n \"\\u0019\": \"#\\\\em\",\n \"\\u001a\": \"#\\\\sub\",\n \"\\u001c\": \"#\\\\fs\",\n \"\\u001d\": \"#\\\\gs\",\n \"\\u001e\": \"#\\\\rs\",\n \"\\u001f\": \"#\\\\us\",\n};\n\nsc_Char.readable2char = {\n \"null\": \"\\u0000\",\n \"bell\": \"\\u0007\",\n \"backspace\": \"\\b\",\n \"tab\": \"\\t\",\n \"newline\": \"\\n\",\n \"page\": \"\\f\",\n \"return\": \"\\r\",\n \"escape\": \"\\u001b\",\n \"space\": \" \",\n \"delete\": \"\\u0000\",\n \"soh\": \"\\u0001\",\n \"stx\": \"\\u0002\",\n \"etx\": \"\\u0003\",\n \"eot\": \"\\u0004\",\n \"enq\": \"\\u0005\",\n \"ack\": \"\\u0006\",\n \"bel\": \"\\u0007\",\n \"bs\": \"\\b\",\n \"ht\": \"\\t\",\n \"nl\": \"\\n\",\n \"vt\": \"\\u000b\",\n \"np\": \"\\f\",\n \"cr\": \"\\r\",\n \"so\": \"\\u000e\",\n \"si\": \"\\u000f\",\n \"dle\": \"\\u0010\",\n \"dc1\": \"\\u0011\",\n \"dc2\": \"\\u0012\",\n \"dc3\": \"\\u0013\",\n \"dc4\": \"\\u0014\",\n \"nak\": \"\\u0015\",\n \"syn\": \"\\u0016\",\n \"etb\": \"\\u0017\",\n \"can\": \"\\u0018\",\n \"em\": \"\\u0019\",\n \"sub\": \"\\u001a\",\n \"esc\": \"\\u001b\",\n \"fs\": \"\\u001c\",\n \"gs\": \"\\u001d\",\n \"rs\": \"\\u001e\",\n \"us\": \"\\u001f\",\n \"sp\": \" \",\n \"del\": \"\\u007f\",\n};\n\nsc_Char.prototype.toString = function () {\n return this.val;\n};\n// sc_toDisplayString == toString\nsc_Char.prototype.sc_toWriteString = function () {\n var entry = sc_Char.char2readable[this.val];\n if (entry)\n return entry;\n else\n return \"#\\\\\" + this.val;\n};\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \"instanceof sc_Char\")))\n */\nfunction sc_isChar(c) {\n return (c instanceof sc_Char);\n}\n\n/*** META ((export char=?)\n (type bool)\n (peephole (hole 2 c1 \".val === \" c2 \".val\")))\n */\nvar sc_isCharEqual = sc_isCharStringEqual;\n/*** META ((export char?)\n (type bool)\n (peephole (hole 2 c1 \".val > \" c2 \".val\")))\n */\nvar sc_isCharGreater = sc_isCharStringGreater;\n/*** META ((export char<=?)\n (type bool)\n (peephole (hole 2 c1 \".val <= \" c2 \".val\")))\n */\nvar sc_isCharLessEqual = sc_isCharStringLessEqual;\n/*** META ((export char>=?)\n (type bool)\n (peephole (hole 2 c1 \".val >= \" c2 \".val\")))\n */\nvar sc_isCharGreaterEqual = sc_isCharStringGreaterEqual;\n/*** META ((export char-ci=?)\n (type bool)\n (peephole (hole 2 c1 \".val.toLowerCase() === \" c2 \".val.toLowerCase()\")))\n */\nvar sc_isCharCIEqual = sc_isCharStringCIEqual;\n/*** META ((export char-ci?)\n (type bool)\n (peephole (hole 2 c1 \".val.toLowerCase() > \" c2 \".val.toLowerCase()\")))\n */\nvar sc_isCharCIGreater = sc_isCharStringCIGreater;\n/*** META ((export char-ci<=?)\n (type bool)\n (peephole (hole 2 c1 \".val.toLowerCase() <= \" c2 \".val.toLowerCase()\")))\n */\nvar sc_isCharCILessEqual = sc_isCharStringCILessEqual;\n/*** META ((export char-ci>=?)\n (type bool)\n (peephole (hole 2 c1 \".val.toLowerCase() >= \" c2 \".val.toLowerCase()\")))\n */\nvar sc_isCharCIGreaterEqual = sc_isCharStringCIGreaterEqual;\n\nvar SC_NUMBER_CLASS = \"0123456789\";\nvar SC_WHITESPACE_CLASS = ' \\r\\n\\t\\f';\nvar SC_LOWER_CLASS = 'abcdefghijklmnopqrstuvwxyz';\nvar SC_UPPER_CLASS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';\n\nfunction sc_isCharOfClass(c, cl) {\n return (cl.indexOf(c) != -1);\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isCharAlphabetic(c) {\n return sc_isCharOfClass(c.val, SC_LOWER_CLASS) ||\n sc_isCharOfClass(c.val, SC_UPPER_CLASS);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (hole 1 \"SC_NUMBER_CLASS.indexOf(\" c \".val) != -1\")))\n */\nfunction sc_isCharNumeric(c) {\n return sc_isCharOfClass(c.val, SC_NUMBER_CLASS);\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isCharWhitespace(c) {\n var tmp = c.val;\n return tmp === \" \" || tmp === \"\\r\" || tmp === \"\\n\" || tmp === \"\\t\" || tmp === \"\\f\";\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (hole 1 \"SC_UPPER_CLASS.indexOf(\" c \".val) != -1\")))\n */\nfunction sc_isCharUpperCase(c) {\n return sc_isCharOfClass(c.val, SC_UPPER_CLASS);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (hole 1 \"SC_LOWER_CLASS.indexOf(\" c \".val) != -1\")))\n */\nfunction sc_isCharLowerCase(c) {\n return sc_isCharOfClass(c.val, SC_LOWER_CLASS);\n}\n\n/*** META ((export #t)\n (peephole (postfix \".val.charCodeAt(0)\")))\n */\nfunction sc_char2integer(c) {\n return c.val.charCodeAt(0);\n}\n\n/*** META ((export #t)\n (peephole (hole 1 \"new sc_Char(String.fromCharCode(\" n \"))\")))\n */\nfunction sc_integer2char(n) {\n return new sc_Char(String.fromCharCode(n));\n}\n\n/*** META ((export #t)\n (peephole (hole 1 \"new sc_Char(\" c \".val.toUpperCase())\")))\n */\nfunction sc_charUpcase(c) {\n return new sc_Char(c.val.toUpperCase());\n}\n\n/*** META ((export #t)\n (peephole (hole 1 \"new sc_Char(\" c \".val.toLowerCase())\")))\n */\nfunction sc_charDowncase(c) {\n return new sc_Char(c.val.toLowerCase());\n}\n\nfunction sc_makeJSStringOfLength(k, c) {\n var fill;\n if (c === undefined)\n fill = \" \";\n else\n fill = c;\n var res = \"\";\n var len = 1;\n // every round doubles the size of fill.\n while (k >= len) {\n if (k & len)\n res = res.concat(fill);\n fill = fill.concat(fill);\n len *= 2;\n }\n return res;\n}\n\nfunction sc_makejsString(k, c) {\n var fill;\n if (c)\n fill = c.val;\n else\n fill = \" \";\n return sc_makeJSStringOfLength(k, fill);\n}\n\nfunction sc_jsstring2list(s) {\n var res = null;\n for (var i = s.length - 1; i >= 0; i--)\n res = sc_cons(new sc_Char(s.charAt(i)), res);\n return res;\n}\n\nfunction sc_list2jsstring(l) {\n var a = new Array();\n while (l !== null) {\n a.push(l.car.val);\n l = l.cdr;\n }\n return \"\".concat.apply(\"\", a);\n}\n\nvar sc_Vector = Array;\n\nsc_Vector.prototype.sc_toWriteOrDisplayString = function (writeOrDisplay) {\n if (this.length === 0) return \"#()\";\n\n var res = \"#(\" + writeOrDisplay(this[0]);\n for (var i = 1; i < this.length; i++)\n res += \" \" + writeOrDisplay(this[i]);\n res += \")\";\n return res;\n};\nsc_Vector.prototype.sc_toDisplayString = function () {\n return this.sc_toWriteOrDisplayString(sc_toDisplayString);\n};\nsc_Vector.prototype.sc_toWriteString = function () {\n return this.sc_toWriteOrDisplayString(sc_toWriteString);\n};\n\n/*** META ((export vector? array?)\n (type bool)\n (peephole (postfix \" instanceof sc_Vector\")))\n */\nfunction sc_isVector(v) {\n return (v instanceof sc_Vector);\n}\n\n// only applies to vectors\nfunction sc_isVectorEqual(v1, v2, comp) {\n if (v1.length !== v2.length) return false;\n for (var i = 0; i < v1.length; i++)\n if (!comp(v1[i], v2[i])) return false;\n return true;\n}\n\n/*** META ((export make-vector make-array)) */\nfunction sc_makeVector(size, fill) {\n var a = new sc_Vector(size);\n if (fill !== undefined)\n sc_vectorFillBang(a, fill);\n return a;\n}\n\n/*** META ((export vector array)\n (peephole (vector)))\n */\nfunction sc_vector() {\n var a = new sc_Vector();\n for (var i = 0; i < arguments.length; i++)\n a.push(arguments[i]);\n return a;\n}\n\n/*** META ((export vector-length array-length)\n (peephole (postfix \".length\")))\n */\nfunction sc_vectorLength(v) {\n return v.length;\n}\n\n/*** META ((export vector-ref array-ref)\n (peephole (hole 2 v \"[\" pos \"]\")))\n */\nfunction sc_vectorRef(v, pos) {\n return v[pos];\n}\n\n/*** META ((export vector-set! array-set!)\n (peephole (hole 3 v \"[\" pos \"] = \" val)))\n */\nfunction sc_vectorSetBang(v, pos, val) {\n v[pos] = val;\n}\n\n/*** META ((export vector->list array->list)) */\nfunction sc_vector2list(a) {\n var res = null;\n for (var i = a.length - 1; i >= 0; i--)\n res = sc_cons(a[i], res);\n return res;\n}\n\n/*** META ((export list->vector list->array)) */\nfunction sc_list2vector(l) {\n var a = new sc_Vector();\n while (l !== null) {\n a.push(l.car);\n l = l.cdr;\n }\n return a;\n}\n\n/*** META ((export vector-fill! array-fill!)) */\nfunction sc_vectorFillBang(a, fill) {\n for (var i = 0; i < a.length; i++)\n a[i] = fill;\n}\n\n\n/*** META ((export #t)) */\nfunction sc_copyVector(a, len) {\n if (len <= a.length)\n return a.slice(0, len);\n else {\n var tmp = a.concat();\n tmp.length = len;\n return tmp;\n }\n}\n\n/*** META ((export #t)\n (peephole (hole 3 a \".slice(\" start \",\" end \")\")))\n */\nfunction sc_vectorCopy(a, start, end) {\n return a.slice(start, end);\n}\n\n/*** META ((export #t)) */\nfunction sc_vectorCopyBang(target, tstart, source, sstart, send) {\n if (!sstart) sstart = 0;\n if (!send) send = source.length;\n\n // if target == source we don't want to overwrite not yet copied elements.\n if (tstart <= sstart) {\n for (var i = tstart, j = sstart; j < send; i++, j++) {\n target[i] = source[j];\n }\n } else {\n var diff = send - sstart;\n for (var i = tstart + diff - 1, j = send - 1;\n j >= sstart;\n i--, j--) {\n target[i] = source[j];\n }\n }\n return target;\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (hole 1 \"typeof \" o \" === 'function'\")))\n */\nfunction sc_isProcedure(o) {\n return (typeof o === \"function\");\n}\n\n/*** META ((export #t)) */\nfunction sc_apply(proc) {\n var args = new Array();\n // first part of arguments are not in list-form.\n for (var i = 1; i < arguments.length - 1; i++)\n args.push(arguments[i]);\n var l = arguments[arguments.length - 1];\n while (l !== null) {\n args.push(l.car);\n l = l.cdr;\n }\n return proc.apply(null, args);\n}\n\n/*** META ((export #t)) */\nfunction sc_map(proc, l1) {\n if (l1 === undefined)\n return null;\n // else\n var nbApplyArgs = arguments.length - 1;\n var applyArgs = new Array(nbApplyArgs);\n var revres = null;\n while (l1 !== null) {\n for (var i = 0; i < nbApplyArgs; i++) {\n applyArgs[i] = arguments[i + 1].car;\n arguments[i + 1] = arguments[i + 1].cdr;\n }\n revres = sc_cons(proc.apply(null, applyArgs), revres);\n }\n return sc_reverseAppendBang(revres, null);\n}\n\n/*** META ((export #t)) */\nfunction sc_mapBang(proc, l1) {\n if (l1 === undefined)\n return null;\n // else\n var l1_orig = l1;\n var nbApplyArgs = arguments.length - 1;\n var applyArgs = new Array(nbApplyArgs);\n while (l1 !== null) {\n var tmp = l1;\n for (var i = 0; i < nbApplyArgs; i++) {\n applyArgs[i] = arguments[i + 1].car;\n arguments[i + 1] = arguments[i + 1].cdr;\n }\n tmp.car = proc.apply(null, applyArgs);\n }\n return l1_orig;\n}\n\n/*** META ((export #t)) */\nfunction sc_forEach(proc, l1) {\n if (l1 === undefined)\n return undefined;\n // else\n var nbApplyArgs = arguments.length - 1;\n var applyArgs = new Array(nbApplyArgs);\n while (l1 !== null) {\n for (var i = 0; i < nbApplyArgs; i++) {\n applyArgs[i] = arguments[i + 1].car;\n arguments[i + 1] = arguments[i + 1].cdr;\n }\n proc.apply(null, applyArgs);\n }\n // add return so FF does not complain.\n return undefined;\n}\n\n/*** META ((export #t)) */\nfunction sc_filter(proc, l1) {\n var dummy = {cdr: null};\n var tail = dummy;\n while (l1 !== null) {\n if (proc(l1.car) !== false) {\n tail.cdr = sc_cons(l1.car, null);\n tail = tail.cdr;\n }\n l1 = l1.cdr;\n }\n return dummy.cdr;\n}\n\n/*** META ((export #t)) */\nfunction sc_filterBang(proc, l1) {\n var head = sc_cons(\"dummy\", l1);\n var it = head;\n var next = l1;\n while (next !== null) {\n if (proc(next.car) !== false) {\n it.cdr = next\n it = next;\n }\n next = next.cdr;\n }\n it.cdr = null;\n return head.cdr;\n}\n\nfunction sc_filterMap1(proc, l1) {\n var revres = null;\n while (l1 !== null) {\n var tmp = proc(l1.car)\n if (tmp !== false) revres = sc_cons(tmp, revres);\n l1 = l1.cdr;\n }\n return sc_reverseAppendBang(revres, null);\n}\n\nfunction sc_filterMap2(proc, l1, l2) {\n var revres = null;\n while (l1 !== null) {\n var tmp = proc(l1.car, l2.car);\n if (tmp !== false) revres = sc_cons(tmp, revres);\n l1 = l1.cdr;\n l2 = l2.cdr\n }\n return sc_reverseAppendBang(revres, null);\n}\n\n/*** META ((export #t)) */\nfunction sc_filterMap(proc, l1, l2, l3) {\n if (l2 === undefined)\n return sc_filterMap1(proc, l1);\n else if (l3 === undefined)\n return sc_filterMap2(proc, l1, l2);\n // else\n var nbApplyArgs = arguments.length - 1;\n var applyArgs = new Array(nbApplyArgs);\n var revres = null;\n while (l1 !== null) {\n for (var i = 0; i < nbApplyArgs; i++) {\n applyArgs[i] = arguments[i + 1].car;\n arguments[i + 1] = arguments[i + 1].cdr;\n }\n var tmp = proc.apply(null, applyArgs);\n if (tmp !== false) revres = sc_cons(tmp, revres);\n }\n return sc_reverseAppendBang(revres, null);\n}\n\n/*** META ((export #t)) */\nfunction sc_any(proc, l) {\n var revres = null;\n while (l !== null) {\n var tmp = proc(l.car);\n if (tmp !== false) return tmp;\n l = l.cdr;\n }\n return false;\n}\n\n/*** META ((export any?)\n (peephole (hole 2 \"sc_any(\" proc \",\" l \") !== false\")))\n */\nfunction sc_anyPred(proc, l) {\n return sc_any(proc, l) !== false;\n}\n\n/*** META ((export #t)) */\nfunction sc_every(proc, l) {\n var revres = null;\n var tmp = true;\n while (l !== null) {\n tmp = proc(l.car);\n if (tmp === false) return false;\n l = l.cdr;\n }\n return tmp;\n}\n\n/*** META ((export every?)\n (peephole (hole 2 \"sc_every(\" proc \",\" l \") !== false\")))\n */\nfunction sc_everyPred(proc, l) {\n var tmp = sc_every(proc, l);\n if (tmp !== false) return true;\n return false;\n}\n\n/*** META ((export #t)\n (peephole (postfix \"()\")))\n */\nfunction sc_force(o) {\n return o();\n}\n\n/*** META ((export #t)) */\nfunction sc_makePromise(proc) {\n var isResultReady = false;\n var result = undefined;\n return function () {\n if (!isResultReady) {\n var tmp = proc();\n if (!isResultReady) {\n isResultReady = true;\n result = tmp;\n }\n }\n return result;\n };\n}\n\nfunction sc_Values(values) {\n this.values = values;\n}\n\n/*** META ((export #t)\n (peephole (values)))\n */\nfunction sc_values() {\n if (arguments.length === 1)\n return arguments[0];\n else\n return new sc_Values(arguments);\n}\n\n/*** META ((export #t)) */\nfunction sc_callWithValues(producer, consumer) {\n var produced = producer();\n if (produced instanceof sc_Values)\n return consumer.apply(null, produced.values);\n else\n return consumer(produced);\n}\n\n/*** META ((export #t)) */\nfunction sc_dynamicWind(before, thunk, after) {\n before();\n try {\n var res = thunk();\n return res;\n } finally {\n after();\n }\n}\n\n\n// TODO: eval/scheme-report-environment/null-environment/interaction-environment\n\n// LIMITATION: 'load' doesn't exist without files.\n// LIMITATION: transcript-on/transcript-off doesn't exist without files.\n\n\nfunction sc_Struct(name) {\n this.name = name;\n}\n\nsc_Struct.prototype.sc_toDisplayString = function () {\n return \"#\";\n};\nsc_Struct.prototype.sc_toWriteString = sc_Struct.prototype.sc_toDisplayString;\n\n/*** META ((export #t)\n (peephole (hole 1 \"new sc_Struct(\" name \")\")))\n */\nfunction sc_makeStruct(name) {\n return new sc_Struct(name);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \" instanceof sc_Struct\")))\n */\nfunction sc_isStruct(o) {\n return (o instanceof sc_Struct);\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (hole 2 \"(\" 1 \" instanceof sc_Struct) && ( \" 1 \".name === \" 0 \")\")))\n */\nfunction sc_isStructNamed(name, s) {\n return ((s instanceof sc_Struct) && (s.name === name));\n}\n\n/*** META ((export struct-field)\n (peephole (hole 3 0 \"[\" 2 \"]\")))\n */\nfunction sc_getStructField(s, name, field) {\n return s[field];\n}\n\n/*** META ((export struct-field-set!)\n (peephole (hole 4 0 \"[\" 2 \"] = \" 3)))\n */\nfunction sc_setStructFieldBang(s, name, field, val) {\n s[field] = val;\n}\n\n/*** META ((export #t)\n (peephole (prefix \"~\")))\n */\nfunction sc_bitNot(x) {\n return ~x;\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \"&\")))\n */\nfunction sc_bitAnd(x, y) {\n return x & y;\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \"|\")))\n */\nfunction sc_bitOr(x, y) {\n return x | y;\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \"^\")))\n */\nfunction sc_bitXor(x, y) {\n return x ^ y;\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \"<<\")))\n */\nfunction sc_bitLsh(x, y) {\n return x << y;\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \">>\")))\n */\nfunction sc_bitRsh(x, y) {\n return x >> y;\n}\n\n/*** META ((export #t)\n (peephole (infix 2 2 \">>>\")))\n */\nfunction sc_bitUrsh(x, y) {\n return x >>> y;\n}\n\n/*** META ((export js-field js-property)\n (peephole (hole 2 o \"[\" field \"]\")))\n */\nfunction sc_jsField(o, field) {\n return o[field];\n}\n\n/*** META ((export js-field-set! js-property-set!)\n (peephole (hole 3 o \"[\" field \"] = \" val)))\n */\nfunction sc_setJsFieldBang(o, field, val) {\n return o[field] = val;\n}\n\n/*** META ((export js-field-delete! js-property-delete!)\n (peephole (hole 2 \"delete\" o \"[\" field \"]\")))\n */\nfunction sc_deleteJsFieldBang(o, field) {\n delete o[field];\n}\n\n/*** META ((export #t)\n (peephole (jsCall)))\n */\nfunction sc_jsCall(o, fun) {\n var args = new Array();\n for (var i = 2; i < arguments.length; i++)\n args[i - 2] = arguments[i];\n return fun.apply(o, args);\n}\n\n/*** META ((export #t)\n (peephole (jsMethodCall)))\n */\nfunction sc_jsMethodCall(o, field) {\n var args = new Array();\n for (var i = 2; i < arguments.length; i++)\n args[i - 2] = arguments[i];\n return o[field].apply(o, args);\n}\n\n/*** META ((export new js-new)\n (peephole (jsNew)))\n */\nfunction sc_jsNew(c) {\n var evalStr = \"new c(\";\n evalStr += arguments.length > 1 ? \"arguments[1]\" : \"\";\n for (var i = 2; i < arguments.length; i++)\n evalStr += \", arguments[\" + i + \"]\";\n evalStr += \")\";\n return eval(evalStr);\n}\n\n// ======================== RegExp ====================\n/*** META ((export #t)) */\nfunction sc_pregexp(re) {\n return new RegExp(sc_string2jsstring(re));\n}\n\n/*** META ((export #t)) */\nfunction sc_pregexpMatch(re, s) {\n var reg = (re instanceof RegExp) ? re : sc_pregexp(re);\n var tmp = reg.exec(sc_string2jsstring(s));\n\n if (tmp == null) return false;\n\n var res = null;\n for (var i = tmp.length - 1; i >= 0; i--) {\n if (tmp[i] !== null) {\n res = sc_cons(sc_jsstring2string(tmp[i]), res);\n } else {\n res = sc_cons(false, res);\n }\n }\n return res;\n}\n\n/*** META ((export #t)) */\nfunction sc_pregexpReplace(re, s1, s2) {\n var reg;\n var jss1 = sc_string2jsstring(s1);\n var jss2 = sc_string2jsstring(s2);\n\n if (re instanceof RegExp) {\n if (re.global)\n reg = re;\n else\n reg = new RegExp(re.source);\n } else {\n reg = new RegExp(sc_string2jsstring(re));\n }\n\n return jss1.replace(reg, jss2);\n}\n\n/*** META ((export pregexp-replace*)) */\nfunction sc_pregexpReplaceAll(re, s1, s2) {\n var reg;\n var jss1 = sc_string2jsstring(s1);\n var jss2 = sc_string2jsstring(s2);\n\n if (re instanceof RegExp) {\n if (re.global)\n reg = re;\n else\n reg = new RegExp(re.source, \"g\");\n } else {\n reg = new RegExp(sc_string2jsstring(re), \"g\");\n }\n\n return jss1.replace(reg, jss2);\n}\n\n/*** META ((export #t)) */\nfunction sc_pregexpSplit(re, s) {\n var reg = ((re instanceof RegExp) ?\n re :\n new RegExp(sc_string2jsstring(re)));\n var jss = sc_string2jsstring(s);\n var tmp = jss.split(reg);\n\n if (tmp == null) return false;\n\n return sc_vector2list(tmp);\n}\n\n\n/* =========================================================================== */\n/* Other library stuff */\n\n/* =========================================================================== */\n\n/*** META ((export #t)\n (peephole (hole 1 \"Math.floor(Math.random()*\" 'n \")\")))\n */\nfunction sc_random(n) {\n return Math.floor(Math.random() * n);\n}\n\n/*** META ((export current-date)\n (peephole (hole 0 \"new Date()\")))\n */\nfunction sc_currentDate() {\n return new Date();\n}\n\nfunction sc_Hashtable() {\n}\n\nsc_Hashtable.prototype.toString = function () {\n return \"#{%hashtable}\";\n};\n\n// sc_toWriteString == sc_toDisplayString == toString\n\nfunction sc_HashtableElement(key, val) {\n this.key = key;\n this.val = val;\n}\n\n/*** META ((export #t)\n (peephole (hole 0 \"new sc_Hashtable()\")))\n */\nfunction sc_makeHashtable() {\n return new sc_Hashtable();\n}\n\n/*** META ((export #t)) */\nfunction sc_hashtablePutBang(ht, key, val) {\n var hash = sc_hash(key);\n ht[hash] = new sc_HashtableElement(key, val);\n}\n\n/*** META ((export #t)) */\nfunction sc_hashtableGet(ht, key) {\n var hash = sc_hash(key);\n if (hash in ht)\n return ht[hash].val;\n else\n return false;\n}\n\n/*** META ((export #t)) */\nfunction sc_hashtableForEach(ht, f) {\n for (var v in ht) {\n if (ht[v] instanceof sc_HashtableElement)\n f(ht[v].key, ht[v].val);\n }\n}\n\n/*** META ((export hashtable-contains?)\n (peephole (hole 2 \"sc_hash(\" 1 \") in \" 0)))\n */\nfunction sc_hashtableContains(ht, key) {\n var hash = sc_hash(key);\n if (hash in ht)\n return true;\n else\n return false;\n}\n\nvar SC_HASH_COUNTER = 0;\n\nfunction sc_hash(o) {\n if (o === null)\n return \"null\";\n else if (o === undefined)\n return \"undefined\";\n else if (o === true)\n return \"true\";\n else if (o === false)\n return \"false\";\n else if (typeof o === \"number\")\n return \"num-\" + o;\n else if (typeof o === \"string\")\n return \"jsstr-\" + o;\n else if (o.sc_getHash)\n return o.sc_getHash();\n else\n return sc_counterHash.call(o);\n}\n\nfunction sc_counterHash() {\n if (!this.sc_hash) {\n this.sc_hash = \"hash-\" + SC_HASH_COUNTER;\n SC_HASH_COUNTER++;\n }\n return this.sc_hash;\n}\n\nfunction sc_Trampoline(args, maxTailCalls) {\n this['__trampoline return__'] = true;\n this.args = args;\n this.MAX_TAIL_CALLs = maxTailCalls;\n}\n\n// TODO: call/cc stuff\nsc_Trampoline.prototype.restart = function () {\n var o = this;\n while (true) {\n // set both globals.\n SC_TAIL_OBJECT.calls = o.MAX_TAIL_CALLs - 1;\n var fun = o.args.callee;\n var res = fun.apply(SC_TAIL_OBJECT, o.args);\n if (res instanceof sc_Trampoline)\n o = res;\n else\n return res;\n }\n}\n\n/*** META ((export bind-exit-lambda)) */\nfunction sc_bindExitLambda(proc) {\n var escape_obj = new sc_BindExitException();\n var escape = function (res) {\n escape_obj.res = res;\n throw escape_obj;\n };\n try {\n return proc(escape);\n } catch (e) {\n if (e === escape_obj) {\n return e.res;\n }\n throw e;\n }\n}\n\nfunction sc_BindExitException() {\n this._internalException = true;\n}\n\nvar SC_SCM2JS_GLOBALS = new Object();\n\n// default tail-call depth.\n// normally the program should set it again. but just in case...\nvar SC_TAIL_OBJECT = new Object();\nSC_SCM2JS_GLOBALS.TAIL_OBJECT = SC_TAIL_OBJECT;\n// ======================== I/O =======================\n\n/*------------------------------------------------------------------*/\n\nfunction sc_EOF() {\n}\n\nvar SC_EOF_OBJECT = new sc_EOF();\n\nfunction sc_Port() {\n}\n\n/* --------------- Input ports -------------------------------------*/\n\nfunction sc_InputPort() {\n}\n\nsc_InputPort.prototype = new sc_Port();\n\nsc_InputPort.prototype.peekChar = function () {\n if (!(\"peeked\" in this))\n this.peeked = this.getNextChar();\n return this.peeked;\n}\nsc_InputPort.prototype.readChar = function () {\n var tmp = this.peekChar();\n delete this.peeked;\n return tmp;\n}\nsc_InputPort.prototype.isCharReady = function () {\n return true;\n}\nsc_InputPort.prototype.close = function () {\n // do nothing\n}\n\n/* .............. String port ..........................*/\nfunction sc_ErrorInputPort() {\n}\n\nsc_ErrorInputPort.prototype = new sc_InputPort();\nsc_ErrorInputPort.prototype.getNextChar = function () {\n throw \"can't read from error-port.\";\n};\nsc_ErrorInputPort.prototype.isCharReady = function () {\n return false;\n};\n\n\n/* .............. String port ..........................*/\n\nfunction sc_StringInputPort(jsStr) {\n // we are going to do some charAts on the str.\n // instead of recreating all the time a String-object, we\n // create one in the beginning. (not sure, if this is really an optim)\n this.str = new String(jsStr);\n this.pos = 0;\n}\n\nsc_StringInputPort.prototype = new sc_InputPort();\nsc_StringInputPort.prototype.getNextChar = function () {\n if (this.pos >= this.str.length)\n return SC_EOF_OBJECT;\n return this.str.charAt(this.pos++);\n};\n\n/* ------------- Read and other lib-funs -------------------------------*/\nfunction sc_Token(type, val, pos) {\n this.type = type;\n this.val = val;\n this.pos = pos;\n}\n\nsc_Token.EOF = 0/*EOF*/;\nsc_Token.OPEN_PAR = 1/*OPEN_PAR*/;\nsc_Token.CLOSE_PAR = 2/*CLOSE_PAR*/;\nsc_Token.OPEN_BRACE = 3/*OPEN_BRACE*/;\nsc_Token.CLOSE_BRACE = 4/*CLOSE_BRACE*/;\nsc_Token.OPEN_BRACKET = 5/*OPEN_BRACKET*/;\nsc_Token.CLOSE_BRACKET = 6/*CLOSE_BRACKET*/;\nsc_Token.WHITESPACE = 7/*WHITESPACE*/;\nsc_Token.QUOTE = 8/*QUOTE*/;\nsc_Token.ID = 9/*ID*/;\nsc_Token.DOT = 10/*DOT*/;\nsc_Token.STRING = 11/*STRING*/;\nsc_Token.NUMBER = 12/*NUMBER*/;\nsc_Token.ERROR = 13/*ERROR*/;\nsc_Token.VECTOR_BEGIN = 14/*VECTOR_BEGIN*/;\nsc_Token.TRUE = 15/*TRUE*/;\nsc_Token.FALSE = 16/*FALSE*/;\nsc_Token.UNSPECIFIED = 17/*UNSPECIFIED*/;\nsc_Token.REFERENCE = 18/*REFERENCE*/;\nsc_Token.STORE = 19/*STORE*/;\nsc_Token.CHAR = 20/*CHAR*/;\n\nvar SC_ID_CLASS = SC_LOWER_CLASS + SC_UPPER_CLASS + \"!$%*+-./:<=>?@^_~\";\n\nfunction sc_Tokenizer(port) {\n this.port = port;\n}\n\nsc_Tokenizer.prototype.peekToken = function () {\n if (this.peeked)\n return this.peeked;\n var newToken = this.nextToken();\n this.peeked = newToken;\n return newToken;\n};\nsc_Tokenizer.prototype.readToken = function () {\n var tmp = this.peekToken();\n delete this.peeked;\n return tmp;\n};\nsc_Tokenizer.prototype.nextToken = function () {\n var port = this.port;\n\n function isNumberChar(c) {\n return (c >= \"0\" && c <= \"9\");\n }\n\n function isIdOrNumberChar(c) {\n return SC_ID_CLASS.indexOf(c) != -1 || // ID-char\n (c >= \"0\" && c <= \"9\");\n }\n\n function isWhitespace(c) {\n return c === \" \" || c === \"\\r\" || c === \"\\n\" || c === \"\\t\" || c === \"\\f\";\n }\n\n function isWhitespaceOrEOF(c) {\n return isWhitespace(c) || c === SC_EOF_OBJECT;\n }\n\n function readString() {\n res = \"\";\n while (true) {\n var c = port.readChar();\n switch (c) {\n case '\"':\n return new sc_Token(11/*STRING*/, res);\n case \"\\\\\":\n var tmp = port.readChar();\n switch (tmp) {\n case '0':\n res += \"\\0\";\n break;\n case 'a':\n res += \"\\a\";\n break;\n case 'b':\n res += \"\\b\";\n break;\n case 'f':\n res += \"\\f\";\n break;\n case 'n':\n res += \"\\n\";\n break;\n case 'r':\n res += \"\\r\";\n break;\n case 't':\n res += \"\\t\";\n break;\n case 'v':\n res += \"\\v\";\n break;\n case '\"':\n res += '\"';\n break;\n case '\\\\':\n res += '\\\\';\n break;\n case 'x':\n /* hexa-number */\n var nb = 0;\n while (true) {\n var hexC = port.peekChar();\n if (hexC >= '0' && hexC <= '9') {\n port.readChar();\n nb = nb * 16 + hexC.charCodeAt(0) - '0'.charCodeAt(0);\n } else if (hexC >= 'a' && hexC <= 'f') {\n port.readChar();\n nb = nb * 16 + hexC.charCodeAt(0) - 'a'.charCodeAt(0);\n } else if (hexC >= 'A' && hexC <= 'F') {\n port.readChar();\n nb = nb * 16 + hexC.charCodeAt(0) - 'A'.charCodeAt(0);\n } else {\n // next char isn't part of hex.\n res += String.fromCharCode(nb);\n break;\n }\n }\n break;\n default:\n if (tmp === SC_EOF_OBJECT) {\n return new sc_Token(13/*ERROR*/, \"unclosed string-literal\" + res);\n }\n res += tmp;\n }\n break;\n default:\n if (c === SC_EOF_OBJECT) {\n return new sc_Token(13/*ERROR*/, \"unclosed string-literal\" + res);\n }\n res += c;\n }\n }\n }\n\n function readIdOrNumber(firstChar) {\n var res = firstChar;\n while (isIdOrNumberChar(port.peekChar()))\n res += port.readChar();\n if (isNaN(res))\n return new sc_Token(9/*ID*/, res);\n else\n return new sc_Token(12/*NUMBER*/, res - 0);\n }\n\n function skipWhitespaceAndComments() {\n var done = false;\n while (!done) {\n done = true;\n while (isWhitespace(port.peekChar()))\n port.readChar();\n if (port.peekChar() === ';') {\n port.readChar();\n done = false;\n while (true) {\n curChar = port.readChar();\n if (curChar === SC_EOF_OBJECT ||\n curChar === '\\n')\n break;\n }\n }\n }\n }\n\n function readDot() {\n if (isWhitespace(port.peekChar()))\n return new sc_Token(10/*DOT*/);\n else\n return readIdOrNumber(\".\");\n }\n\n function readSharp() {\n var c = port.readChar();\n if (isWhitespace(c))\n return new sc_Token(13/*ERROR*/, \"bad #-pattern0.\");\n\n // reference\n if (isNumberChar(c)) {\n var nb = c - 0;\n while (isNumberChar(port.peekChar()))\n nb = nb * 10 + (port.readChar() - 0);\n switch (port.readChar()) {\n case '#':\n return new sc_Token(18/*REFERENCE*/, nb);\n case '=':\n return new sc_Token(19/*STORE*/, nb);\n default:\n return new sc_Token(13/*ERROR*/, \"bad #-pattern1.\" + nb);\n }\n }\n\n if (c === \"(\")\n return new sc_Token(14/*VECTOR_BEGIN*/);\n\n if (c === \"\\\\\") { // character\n var tmp = \"\"\n while (!isWhitespaceOrEOF(port.peekChar()))\n tmp += port.readChar();\n switch (tmp.length) {\n case 0: // it's escaping a whitespace char:\n if (sc_isEOFObject(port.peekChar))\n return new sc_Token(13/*ERROR*/, \"bad #-pattern2.\");\n else\n return new sc_Token(20/*CHAR*/, port.readChar());\n case 1:\n return new sc_Token(20/*CHAR*/, tmp);\n default:\n var entry = sc_Char.readable2char[tmp.toLowerCase()];\n if (entry)\n return new sc_Token(20/*CHAR*/, entry);\n else\n return new sc_Token(13/*ERROR*/, \"unknown character description: #\\\\\" + tmp);\n }\n }\n\n // some constants (#t, #f, #unspecified)\n var res;\n var needing;\n switch (c) {\n case 't':\n res = new sc_Token(15/*TRUE*/, true);\n needing = \"\";\n break;\n case 'f':\n res = new sc_Token(16/*FALSE*/, false);\n needing = \"\";\n break;\n case 'u':\n res = new sc_Token(17/*UNSPECIFIED*/, undefined);\n needing = \"nspecified\";\n break;\n default:\n return new sc_Token(13/*ERROR*/, \"bad #-pattern3: \" + c);\n }\n while (true) {\n c = port.peekChar();\n if ((isWhitespaceOrEOF(c) || c === ')') &&\n needing == \"\")\n return res;\n else if (isWhitespace(c) || needing == \"\")\n return new sc_Token(13/*ERROR*/, \"bad #-pattern4 \" + c + \" \" + needing);\n else if (needing.charAt(0) == c) {\n port.readChar(); // consume\n needing = needing.slice(1);\n } else\n return new sc_Token(13/*ERROR*/, \"bad #-pattern5\");\n }\n\n }\n\n skipWhitespaceAndComments();\n var curChar = port.readChar();\n if (curChar === SC_EOF_OBJECT)\n return new sc_Token(0/*EOF*/, curChar);\n switch (curChar) {\n case \" \":\n case \"\\n\":\n case \"\\t\":\n return readWhitespace();\n case \"(\":\n return new sc_Token(1/*OPEN_PAR*/);\n case \")\":\n return new sc_Token(2/*CLOSE_PAR*/);\n case \"{\":\n return new sc_Token(3/*OPEN_BRACE*/);\n case \"}\":\n return new sc_Token(4/*CLOSE_BRACE*/);\n case \"[\":\n return new sc_Token(5/*OPEN_BRACKET*/);\n case \"]\":\n return new sc_Token(6/*CLOSE_BRACKET*/);\n case \"'\":\n return new sc_Token(8/*QUOTE*/);\n case \"#\":\n return readSharp();\n case \".\":\n return readDot();\n case '\"':\n return readString();\n default:\n if (isIdOrNumberChar(curChar))\n return readIdOrNumber(curChar);\n throw \"unexpected character: \" + curChar;\n }\n};\n\nfunction sc_Reader(tokenizer) {\n this.tokenizer = tokenizer;\n this.backref = new Array();\n}\n\nsc_Reader.prototype.read = function () {\n function readList(listBeginType) {\n function matchesPeer(open, close) {\n return open === 1/*OPEN_PAR*/ && close === 2/*CLOSE_PAR*/\n || open === 3/*OPEN_BRACE*/ && close === 4/*CLOSE_BRACE*/\n || open === 5/*OPEN_BRACKET*/ && close === 6/*CLOSE_BRACKET*/;\n }\n\n var res = null;\n\n while (true) {\n var token = tokenizer.peekToken();\n\n switch (token.type) {\n case 2/*CLOSE_PAR*/\n :\n case 4/*CLOSE_BRACE*/\n :\n case 6/*CLOSE_BRACKET*/\n :\n if (matchesPeer(listBeginType, token.type)) {\n tokenizer.readToken(); // consume token\n return sc_reverseBang(res);\n } else\n throw \"closing par doesn't match: \" + listBeginType\n + \" \" + listEndType;\n\n case 0/*EOF*/\n :\n throw \"unexpected end of file\";\n\n case 10/*DOT*/\n :\n tokenizer.readToken(); // consume token\n var cdr = this.read();\n var par = tokenizer.readToken();\n if (!matchesPeer(listBeginType, par.type))\n throw \"closing par doesn't match: \" + listBeginType\n + \" \" + par.type;\n else\n return sc_reverseAppendBang(res, cdr);\n\n\n default:\n res = sc_cons(this.read(), res);\n }\n }\n }\n\n function readQuote() {\n return sc_cons(\"quote\", sc_cons(this.read(), null));\n }\n\n function readVector() {\n // opening-parenthesis is already consumed\n var a = new Array();\n while (true) {\n var token = tokenizer.peekToken();\n switch (token.type) {\n case 2/*CLOSE_PAR*/\n :\n tokenizer.readToken();\n return a;\n\n default:\n a.push(this.read());\n }\n }\n }\n\n function storeRefence(nb) {\n var tmp = this.read();\n this.backref[nb] = tmp;\n return tmp;\n }\n\n function readReference(nb) {\n if (nb in this.backref)\n return this.backref[nb];\n else\n throw \"bad reference: \" + nb;\n }\n\n var tokenizer = this.tokenizer;\n\n var token = tokenizer.readToken();\n\n // handle error\n if (token.type === 13/*ERROR*/)\n throw token.val;\n\n switch (token.type) {\n case 1/*OPEN_PAR*/\n :\n case 3/*OPEN_BRACE*/\n :\n case 5/*OPEN_BRACKET*/\n :\n return readList.call(this, token.type);\n case 8/*QUOTE*/\n :\n return readQuote.call(this);\n case 11/*STRING*/\n :\n return sc_jsstring2string(token.val);\n case 20/*CHAR*/\n :\n return new sc_Char(token.val);\n case 14/*VECTOR_BEGIN*/\n :\n return readVector.call(this);\n case 18/*REFERENCE*/\n :\n return readReference.call(this, token.val);\n case 19/*STORE*/\n :\n return storeRefence.call(this, token.val);\n case 9/*ID*/\n :\n return sc_jsstring2symbol(token.val);\n case 0/*EOF*/\n :\n case 12/*NUMBER*/\n :\n case 15/*TRUE*/\n :\n case 16/*FALSE*/\n :\n case 17/*UNSPECIFIED*/\n :\n return token.val;\n default:\n throw \"unexpected token \" + token.type + \" \" + token.val;\n }\n};\n\n/*** META ((export #t)) */\nfunction sc_read(port) {\n if (port === undefined) // we assume the port hasn't been given.\n port = SC_DEFAULT_IN; // THREAD: shared var...\n var reader = new sc_Reader(new sc_Tokenizer(port));\n return reader.read();\n}\n\n/*** META ((export #t)) */\nfunction sc_readChar(port) {\n if (port === undefined) // we assume the port hasn't been given.\n port = SC_DEFAULT_IN; // THREAD: shared var...\n var t = port.readChar();\n return t === SC_EOF_OBJECT ? t : new sc_Char(t);\n}\n\n/*** META ((export #t)) */\nfunction sc_peekChar(port) {\n if (port === undefined) // we assume the port hasn't been given.\n port = SC_DEFAULT_IN; // THREAD: shared var...\n var t = port.peekChar();\n return t === SC_EOF_OBJECT ? t : new sc_Char(t);\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isCharReady(port) {\n if (port === undefined) // we assume the port hasn't been given.\n port = SC_DEFAULT_IN; // THREAD: shared var...\n return port.isCharReady();\n}\n\n/*** META ((export #t)\n (peephole (postfix \".close()\")))\n */\nfunction sc_closeInputPort(p) {\n return p.close();\n}\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \" instanceof sc_InputPort\")))\n */\nfunction sc_isInputPort(o) {\n return (o instanceof sc_InputPort);\n}\n\n/*** META ((export eof-object?)\n (type bool)\n (peephole (postfix \" === SC_EOF_OBJECT\")))\n */\nfunction sc_isEOFObject(o) {\n return o === SC_EOF_OBJECT;\n}\n\n/*** META ((export #t)\n (peephole (hole 0 \"SC_DEFAULT_IN\")))\n */\nfunction sc_currentInputPort() {\n return SC_DEFAULT_IN;\n}\n\n/* ------------ file operations are not supported -----------*/\n/*** META ((export #t)) */\nfunction sc_callWithInputFile(s, proc) {\n throw \"can't open \" + s;\n}\n\n/*** META ((export #t)) */\nfunction sc_callWithOutputFile(s, proc) {\n throw \"can't open \" + s;\n}\n\n/*** META ((export #t)) */\nfunction sc_withInputFromFile(s, thunk) {\n throw \"can't open \" + s;\n}\n\n/*** META ((export #t)) */\nfunction sc_withOutputToFile(s, thunk) {\n throw \"can't open \" + s;\n}\n\n/*** META ((export #t)) */\nfunction sc_openInputFile(s) {\n throw \"can't open \" + s;\n}\n\n/*** META ((export #t)) */\nfunction sc_openOutputFile(s) {\n throw \"can't open \" + s;\n}\n\n/* ----------------------------------------------------------------------------*/\n/*** META ((export #t)) */\nfunction sc_basename(p) {\n var i = p.lastIndexOf('/');\n\n if (i >= 0)\n return p.substring(i + 1, p.length);\n else\n return '';\n}\n\n/*** META ((export #t)) */\nfunction sc_dirname(p) {\n var i = p.lastIndexOf('/');\n\n if (i >= 0)\n return p.substring(0, i);\n else\n return '';\n}\n\n/* ----------------------------------------------------------------------------*/\n\n/*** META ((export #t)) */\nfunction sc_withInputFromPort(p, thunk) {\n try {\n var tmp = SC_DEFAULT_IN; // THREAD: shared var.\n SC_DEFAULT_IN = p;\n return thunk();\n } finally {\n SC_DEFAULT_IN = tmp;\n }\n}\n\n/*** META ((export #t)) */\nfunction sc_withInputFromString(s, thunk) {\n return sc_withInputFromPort(new sc_StringInputPort(sc_string2jsstring(s)), thunk);\n}\n\n/*** META ((export #t)) */\nfunction sc_withOutputToPort(p, thunk) {\n try {\n var tmp = SC_DEFAULT_OUT; // THREAD: shared var.\n SC_DEFAULT_OUT = p;\n return thunk();\n } finally {\n SC_DEFAULT_OUT = tmp;\n }\n}\n\n/*** META ((export #t)) */\nfunction sc_withOutputToString(thunk) {\n var p = new sc_StringOutputPort();\n sc_withOutputToPort(p, thunk);\n return p.close();\n}\n\n/*** META ((export #t)) */\nfunction sc_withOutputToProcedure(proc, thunk) {\n var t = function (s) {\n proc(sc_jsstring2string(s));\n };\n return sc_withOutputToPort(new sc_GenericOutputPort(t), thunk);\n}\n\n/*** META ((export #t)\n (peephole (hole 0 \"new sc_StringOutputPort()\")))\n */\nfunction sc_openOutputString() {\n return new sc_StringOutputPort();\n}\n\n/*** META ((export #t)) */\nfunction sc_openInputString(str) {\n return new sc_StringInputPort(sc_string2jsstring(str));\n}\n\n/* ----------------------------------------------------------------------------*/\n\nfunction sc_OutputPort() {\n}\n\nsc_OutputPort.prototype = new sc_Port();\nsc_OutputPort.prototype.appendJSString = function (obj) {\n /* do nothing */\n}\nsc_OutputPort.prototype.close = function () {\n /* do nothing */\n}\n\nfunction sc_StringOutputPort() {\n this.res = \"\";\n}\n\nsc_StringOutputPort.prototype = new sc_OutputPort();\nsc_StringOutputPort.prototype.appendJSString = function (s) {\n this.res += s;\n}\nsc_StringOutputPort.prototype.close = function () {\n return sc_jsstring2string(this.res);\n}\n\n/*** META ((export #t)) */\nfunction sc_getOutputString(sp) {\n return sc_jsstring2string(sp.res);\n}\n\n\nfunction sc_ErrorOutputPort() {\n}\n\nsc_ErrorOutputPort.prototype = new sc_OutputPort();\nsc_ErrorOutputPort.prototype.appendJSString = function (s) {\n throw \"don't write on ErrorPort!\";\n}\nsc_ErrorOutputPort.prototype.close = function () {\n /* do nothing */\n}\n\nfunction sc_GenericOutputPort(appendJSString, close) {\n this.appendJSString = appendJSString;\n if (close)\n this.close = close;\n}\n\nsc_GenericOutputPort.prototype = new sc_OutputPort();\n\n/*** META ((export #t)\n (type bool)\n (peephole (postfix \" instanceof sc_OutputPort\")))\n */\nfunction sc_isOutputPort(o) {\n return (o instanceof sc_OutputPort);\n}\n\n/*** META ((export #t)\n (peephole (postfix \".close()\")))\n */\nfunction sc_closeOutputPort(p) {\n return p.close();\n}\n\n/* ------------------ write ---------------------------------------------------*/\n\n/*** META ((export #t)) */\nfunction sc_write(o, p) {\n if (p === undefined) // we assume not given\n p = SC_DEFAULT_OUT;\n p.appendJSString(sc_toWriteString(o));\n}\n\nfunction sc_toWriteString(o) {\n if (o === null)\n return \"()\";\n else if (o === true)\n return \"#t\";\n else if (o === false)\n return \"#f\";\n else if (o === undefined)\n return \"#unspecified\";\n else if (typeof o === 'function')\n return \"#\";\n else if (o.sc_toWriteString)\n return o.sc_toWriteString();\n else\n return o.toString();\n}\n\nfunction sc_escapeWriteString(s) {\n var res = \"\";\n var j = 0;\n for (i = 0; i < s.length; i++) {\n switch (s.charAt(i)) {\n case \"\\0\":\n res += s.substring(j, i) + \"\\\\0\";\n j = i + 1;\n break;\n case \"\\b\":\n res += s.substring(j, i) + \"\\\\b\";\n j = i + 1;\n break;\n case \"\\f\":\n res += s.substring(j, i) + \"\\\\f\";\n j = i + 1;\n break;\n case \"\\n\":\n res += s.substring(j, i) + \"\\\\n\";\n j = i + 1;\n break;\n case \"\\r\":\n res += s.substring(j, i) + \"\\\\r\";\n j = i + 1;\n break;\n case \"\\t\":\n res += s.substring(j, i) + \"\\\\t\";\n j = i + 1;\n break;\n case \"\\v\":\n res += s.substring(j, i) + \"\\\\v\";\n j = i + 1;\n break;\n case '\"':\n res += s.substring(j, i) + '\\\\\"';\n j = i + 1;\n break;\n case \"\\\\\":\n res += s.substring(j, i) + \"\\\\\\\\\";\n j = i + 1;\n break;\n default:\n var c = s.charAt(i);\n if (\"\\a\" !== \"a\" && c == \"\\a\") {\n res += s.substring(j, i) + \"\\\\a\";\n j = i + 1;\n continue;\n }\n if (\"\\v\" !== \"v\" && c == \"\\v\") {\n res += s.substring(j, i) + \"\\\\v\";\n j = i + 1;\n continue;\n }\n //if (s.charAt(i) < ' ' || s.charCodeAt(i) > 127) {\n // CARE: Manuel is this OK with HOP?\n if (s.charAt(i) < ' ') {\n /* non printable character and special chars */\n res += s.substring(j, i) + \"\\\\x\" + s.charCodeAt(i).toString(16);\n j = i + 1;\n }\n // else just let i increase...\n }\n }\n res += s.substring(j, i);\n return res;\n}\n\n/* ------------------ display ---------------------------------------------------*/\n\n/*** META ((export #t)) */\nfunction sc_display(o, p) {\n if (p === undefined) // we assume not given\n p = SC_DEFAULT_OUT;\n p.appendJSString(sc_toDisplayString(o));\n}\n\nfunction sc_toDisplayString(o) {\n if (o === null)\n return \"()\";\n else if (o === true)\n return \"#t\";\n else if (o === false)\n return \"#f\";\n else if (o === undefined)\n return \"#unspecified\";\n else if (typeof o === 'function')\n return \"#\";\n else if (o.sc_toDisplayString)\n return o.sc_toDisplayString();\n else\n return o.toString();\n}\n\n/* ------------------ newline ---------------------------------------------------*/\n\n/*** META ((export #t)) */\nfunction sc_newline(p) {\n if (p === undefined) // we assume not given\n p = SC_DEFAULT_OUT;\n p.appendJSString(\"\\n\");\n}\n\n/* ------------------ write-char ---------------------------------------------------*/\n\n/*** META ((export #t)) */\nfunction sc_writeChar(c, p) {\n if (p === undefined) // we assume not given\n p = SC_DEFAULT_OUT;\n p.appendJSString(c.val);\n}\n\n/* ------------------ write-circle ---------------------------------------------------*/\n\n/*** META ((export #t)) */\nfunction sc_writeCircle(o, p) {\n if (p === undefined) // we assume not given\n p = SC_DEFAULT_OUT;\n p.appendJSString(sc_toWriteCircleString(o));\n}\n\nfunction sc_toWriteCircleString(o) {\n var symb = sc_gensym(\"writeCircle\");\n var nbPointer = new Object();\n nbPointer.nb = 0;\n sc_prepWriteCircle(o, symb, nbPointer);\n return sc_genToWriteCircleString(o, symb);\n}\n\nfunction sc_prepWriteCircle(o, symb, nbPointer) {\n // TODO sc_Struct\n if (o instanceof sc_Pair ||\n o instanceof sc_Vector) {\n if (o[symb] !== undefined) {\n // not the first visit.\n o[symb]++;\n // unless there is already a number, assign one.\n if (!o[symb + \"nb\"]) o[symb + \"nb\"] = nbPointer.nb++;\n return;\n }\n o[symb] = 0;\n if (o instanceof sc_Pair) {\n sc_prepWriteCircle(o.car, symb, nbPointer);\n sc_prepWriteCircle(o.cdr, symb, nbPointer);\n } else {\n for (var i = 0; i < o.length; i++)\n sc_prepWriteCircle(o[i], symb, nbPointer);\n }\n }\n}\n\nfunction sc_genToWriteCircleString(o, symb) {\n if (!(o instanceof sc_Pair ||\n o instanceof sc_Vector))\n return sc_toWriteString(o);\n return o.sc_toWriteCircleString(symb);\n}\n\nsc_Pair.prototype.sc_toWriteCircleString = function (symb, inList) {\n if (this[symb + \"use\"]) { // use-flag is set. Just use it.\n var nb = this[symb + \"nb\"];\n if (this[symb]-- === 0) { // if we are the last use. remove all fields.\n delete this[symb];\n delete this[symb + \"nb\"];\n delete this[symb + \"use\"];\n }\n if (inList)\n return '. #' + nb + '#';\n else\n return '#' + nb + '#';\n }\n if (this[symb]-- === 0) { // if we are the last use. remove all fields.\n delete this[symb];\n delete this[symb + \"nb\"];\n delete this[symb + \"use\"];\n }\n\n var res = \"\";\n\n if (this[symb] !== undefined) { // implies > 0\n this[symb + \"use\"] = true;\n if (inList)\n res += '. #' + this[symb + \"nb\"] + '=';\n else\n res += '#' + this[symb + \"nb\"] + '=';\n inList = false;\n }\n\n if (!inList)\n res += \"(\";\n\n // print car\n res += sc_genToWriteCircleString(this.car, symb);\n\n if (sc_isPair(this.cdr)) {\n res += \" \" + this.cdr.sc_toWriteCircleString(symb, true);\n } else if (this.cdr !== null) {\n res += \" . \" + sc_genToWriteCircleString(this.cdr, symb);\n }\n if (!inList)\n res += \")\";\n return res;\n};\nsc_Vector.prototype.sc_toWriteCircleString = function (symb) {\n if (this[symb + \"use\"]) { // use-flag is set. Just use it.\n var nb = this[symb + \"nb\"];\n if (this[symb]-- === 0) { // if we are the last use. remove all fields.\n delete this[symb];\n delete this[symb + \"nb\"];\n delete this[symb + \"use\"];\n }\n return '#' + nb + '#';\n }\n if (this[symb]-- === 0) { // if we are the last use. remove all fields.\n delete this[symb];\n delete this[symb + \"nb\"];\n delete this[symb + \"use\"];\n }\n\n var res = \"\";\n if (this[symb] !== undefined) { // implies > 0\n this[symb + \"use\"] = true;\n res += '#' + this[symb + \"nb\"] + '=';\n }\n res += \"#(\";\n for (var i = 0; i < this.length; i++) {\n res += sc_genToWriteCircleString(this[i], symb);\n if (i < this.length - 1) res += \" \";\n }\n res += \")\";\n return res;\n};\n\n\n/* ------------------ print ---------------------------------------------------*/\n\n/*** META ((export #t)) */\nfunction sc_print(s) {\n if (arguments.length === 1) {\n sc_display(s);\n sc_newline();\n } else {\n for (var i = 0; i < arguments.length; i++)\n sc_display(arguments[i]);\n sc_newline();\n }\n}\n\n/* ------------------ format ---------------------------------------------------*/\n/*** META ((export #t)) */\nfunction sc_format(s, args) {\n var len = s.length;\n var p = new sc_StringOutputPort();\n var i = 0, j = 1;\n\n while (i < len) {\n var i2 = s.indexOf(\"~\", i);\n\n if (i2 == -1) {\n p.appendJSString(s.substring(i, len));\n return p.close();\n } else {\n if (i2 > i) {\n if (i2 == (len - 1)) {\n p.appendJSString(s.substring(i, len));\n return p.close();\n } else {\n p.appendJSString(s.substring(i, i2));\n i = i2;\n }\n }\n\n switch (s.charCodeAt(i2 + 1)) {\n case 65:\n case 97:\n // a\n sc_display(arguments[j], p);\n i += 2;\n j++;\n break;\n\n case 83:\n case 115:\n // s\n sc_write(arguments[j], p);\n i += 2;\n j++;\n break;\n\n case 86:\n case 118:\n // v\n sc_display(arguments[j], p);\n p.appendJSString(\"\\n\");\n i += 2;\n j++;\n break;\n\n case 67:\n case 99:\n // c\n p.appendJSString(String.fromCharCode(arguments[j]));\n i += 2;\n j++;\n break;\n\n case 88:\n case 120:\n // x\n p.appendJSString(arguments[j].toString(6));\n i += 2;\n j++;\n break;\n\n case 79:\n case 111:\n // o\n p.appendJSString(arguments[j].toString(8));\n i += 2;\n j++;\n break;\n\n case 66:\n case 98:\n // b\n p.appendJSString(arguments[j].toString(2));\n i += 2;\n j++;\n break;\n\n case 37:\n case 110:\n // %, n\n p.appendJSString(\"\\n\");\n i += 2;\n break;\n\n case 114:\n // r\n p.appendJSString(\"\\r\");\n i += 2;\n break;\n\n case 126:\n // ~\n p.appendJSString(\"~\");\n i += 2;\n break;\n\n default:\n sc_error(\"format: illegal ~\"\n + String.fromCharCode(s.charCodeAt(i2 + 1))\n + \" sequence\");\n return \"\";\n }\n }\n }\n\n return p.close();\n}\n\n/* ------------------ global ports ---------------------------------------------------*/\n\nvar SC_DEFAULT_IN = new sc_ErrorInputPort();\nvar SC_DEFAULT_OUT = new sc_ErrorOutputPort();\nvar SC_ERROR_OUT = new sc_ErrorOutputPort();\n\nvar sc_SYMBOL_PREFIX = \"\\u1E9C\";\nvar sc_KEYWORD_PREFIX = \"\\u1E9D\";\n\n/*** META ((export #t)\n (peephole (id))) */\nfunction sc_jsstring2string(s) {\n return s;\n}\n\n/*** META ((export #t)\n (peephole (prefix \"'\\\\u1E9C' +\")))\n */\nfunction sc_jsstring2symbol(s) {\n return sc_SYMBOL_PREFIX + s;\n}\n\n/*** META ((export #t)\n (peephole (id)))\n */\nfunction sc_string2jsstring(s) {\n return s;\n}\n\n/*** META ((export #t)\n (peephole (symbol2jsstring_immutable)))\n */\nfunction sc_symbol2jsstring(s) {\n return s.slice(1);\n}\n\n/*** META ((export #t)\n (peephole (postfix \".slice(1)\")))\n */\nfunction sc_keyword2jsstring(k) {\n return k.slice(1);\n}\n\n/*** META ((export #t)\n (peephole (prefix \"'\\\\u1E9D' +\")))\n */\nfunction sc_jsstring2keyword(s) {\n return sc_KEYWORD_PREFIX + s;\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isKeyword(s) {\n return (typeof s === \"string\") &&\n (s.charAt(0) === sc_KEYWORD_PREFIX);\n}\n\n\n/*** META ((export #t)) */\nvar sc_gensym = function () {\n var counter = 1000;\n return function (sym) {\n counter++;\n if (!sym) sym = sc_SYMBOL_PREFIX;\n return sym + \"s\" + counter + \"~\" + \"^sC-GeNsYm \";\n };\n}();\n\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isEqual(o1, o2) {\n return ((o1 === o2) ||\n (sc_isPair(o1) && sc_isPair(o2)\n && sc_isPairEqual(o1, o2, sc_isEqual)) ||\n (sc_isVector(o1) && sc_isVector(o2)\n && sc_isVectorEqual(o1, o2, sc_isEqual)));\n}\n\n/*** META ((export number->symbol integer->symbol)) */\nfunction sc_number2symbol(x, radix) {\n return sc_SYMBOL_PREFIX + sc_number2jsstring(x, radix);\n}\n\n/*** META ((export number->string integer->string)) */\nvar sc_number2string = sc_number2jsstring;\n\n/*** META ((export #t)) */\nfunction sc_symbol2number(s, radix) {\n return sc_jsstring2number(s.slice(1), radix);\n}\n\n/*** META ((export #t)) */\nvar sc_string2number = sc_jsstring2number;\n\n/*** META ((export #t)\n (peephole (prefix \"+\" s)))\n ;; peephole will only apply if no radix is given.\n */\nfunction sc_string2integer(s, radix) {\n if (!radix) return +s;\n return parseInt(s, radix);\n}\n\n/*** META ((export #t)\n (peephole (prefix \"+\")))\n */\nfunction sc_string2real(s) {\n return +s;\n}\n\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isSymbol(s) {\n return (typeof s === \"string\") &&\n (s.charAt(0) === sc_SYMBOL_PREFIX);\n}\n\n/*** META ((export #t)\n (peephole (symbol2string_immutable)))\n */\nfunction sc_symbol2string(s) {\n return s.slice(1);\n}\n\n/*** META ((export #t)\n (peephole (prefix \"'\\\\u1E9C' +\")))\n */\nfunction sc_string2symbol(s) {\n return sc_SYMBOL_PREFIX + s;\n}\n\n/*** META ((export symbol-append)\n (peephole (symbolAppend_immutable)))\n */\nfunction sc_symbolAppend() {\n var res = sc_SYMBOL_PREFIX;\n for (var i = 0; i < arguments.length; i++)\n res += arguments[i].slice(1);\n return res;\n}\n\n/*** META ((export #t)\n (peephole (postfix \".val\")))\n */\nfunction sc_char2string(c) {\n return c.val;\n}\n\n/*** META ((export #t)\n (peephole (hole 1 \"'\\\\u1E9C' + \" c \".val\")))\n */\nfunction sc_char2symbol(c) {\n return sc_SYMBOL_PREFIX + c.val;\n}\n\n/*** META ((export #t)\n (type bool))\n */\nfunction sc_isString(s) {\n return (typeof s === \"string\") &&\n (s.charAt(0) !== sc_SYMBOL_PREFIX);\n}\n\n/*** META ((export #t)) */\nvar sc_makeString = sc_makejsString;\n\n\n/*** META ((export #t)) */\nfunction sc_string() {\n for (var i = 0; i < arguments.length; i++)\n arguments[i] = arguments[i].val;\n return \"\".concat.apply(\"\", arguments);\n}\n\n/*** META ((export #t)\n (peephole (postfix \".length\")))\n */\nfunction sc_stringLength(s) {\n return s.length;\n}\n\n/*** META ((export #t)) */\nfunction sc_stringRef(s, k) {\n return new sc_Char(s.charAt(k));\n}\n\n/* there's no stringSet in the immutable version\nfunction sc_stringSet(s, k, c)\n*/\n\n\n/*** META ((export string=?)\n (type bool)\n (peephole (hole 2 str1 \" === \" str2)))\n */\nfunction sc_isStringEqual(s1, s2) {\n return s1 === s2;\n}\n\n/*** META ((export string?)\n (type bool)\n (peephole (hole 2 str1 \" > \" str2)))\n */\nfunction sc_isStringGreater(s1, s2) {\n return s1 > s2;\n}\n\n/*** META ((export string<=?)\n (type bool)\n (peephole (hole 2 str1 \" <= \" str2)))\n */\nfunction sc_isStringLessEqual(s1, s2) {\n return s1 <= s2;\n}\n\n/*** META ((export string>=?)\n (type bool)\n (peephole (hole 2 str1 \" >= \" str2)))\n */\nfunction sc_isStringGreaterEqual(s1, s2) {\n return s1 >= s2;\n}\n\n/*** META ((export string-ci=?)\n (type bool)\n (peephole (hole 2 str1 \".toLowerCase() === \" str2 \".toLowerCase()\")))\n */\nfunction sc_isStringCIEqual(s1, s2) {\n return s1.toLowerCase() === s2.toLowerCase();\n}\n\n/*** META ((export string-ci?)\n (type bool)\n (peephole (hole 2 str1 \".toLowerCase() > \" str2 \".toLowerCase()\")))\n */\nfunction sc_isStringCIGreater(s1, s2) {\n return s1.toLowerCase() > s2.toLowerCase();\n}\n\n/*** META ((export string-ci<=?)\n (type bool)\n (peephole (hole 2 str1 \".toLowerCase() <= \" str2 \".toLowerCase()\")))\n */\nfunction sc_isStringCILessEqual(s1, s2) {\n return s1.toLowerCase() <= s2.toLowerCase();\n}\n\n/*** META ((export string-ci>=?)\n (type bool)\n (peephole (hole 2 str1 \".toLowerCase() >= \" str2 \".toLowerCase()\")))\n */\nfunction sc_isStringCIGreaterEqual(s1, s2) {\n return s1.toLowerCase() >= s2.toLowerCase();\n}\n\n/*** META ((export #t)\n (peephole (hole 3 s \".substring(\" start \", \" end \")\")))\n */\nfunction sc_substring(s, start, end) {\n return s.substring(start, end);\n}\n\n/*** META ((export #t))\n */\nfunction sc_isSubstring_at(s1, s2, i) {\n return s2 == s1.substring(i, i + s2.length);\n}\n\n/*** META ((export #t)\n (peephole (infix 0 #f \"+\" \"''\")))\n */\nfunction sc_stringAppend() {\n return \"\".concat.apply(\"\", arguments);\n}\n\n/*** META ((export #t)) */\nvar sc_string2list = sc_jsstring2list;\n\n/*** META ((export #t)) */\nvar sc_list2string = sc_list2jsstring;\n\n/*** META ((export #t)\n (peephole (id)))\n */\nfunction sc_stringCopy(s) {\n return s;\n}\n\n/* there's no string-fill in the immutable version\nfunction sc_stringFill(s, c)\n*/\n\n/*** META ((export #t)\n (peephole (postfix \".slice(1)\")))\n */\nfunction sc_keyword2string(o) {\n return o.slice(1);\n}\n\n/*** META ((export #t)\n (peephole (prefix \"'\\\\u1E9D' +\")))\n */\nfunction sc_string2keyword(o) {\n return sc_KEYWORD_PREFIX + o;\n}\n\nString.prototype.sc_toDisplayString = function () {\n if (this.charAt(0) === sc_SYMBOL_PREFIX)\n // TODO: care for symbols with spaces (escape-chars symbols).\n return this.slice(1);\n else if (this.charAt(0) === sc_KEYWORD_PREFIX)\n return \":\" + this.slice(1);\n else\n return this.toString();\n};\n\nString.prototype.sc_toWriteString = function () {\n if (this.charAt(0) === sc_SYMBOL_PREFIX)\n // TODO: care for symbols with spaces (escape-chars symbols).\n return this.slice(1);\n else if (this.charAt(0) === sc_KEYWORD_PREFIX)\n return \":\" + this.slice(1);\n else\n return '\"' + sc_escapeWriteString(this) + '\"';\n};\n/* Exported Variables */\nvar BgL_testzd2boyerzd2;\nvar BgL_nboyerzd2benchmarkzd2;\nvar BgL_setupzd2boyerzd2;\n/* End Exports */\n\nvar translate_term_nboyer;\nvar translate_args_nboyer;\nvar untranslate_term_nboyer;\nvar BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer;\nvar BgL_sc_za2symbolzd2recordszd2alistza2_2z00_nboyer;\nvar translate_alist_nboyer;\nvar apply_subst_nboyer;\nvar apply_subst_lst_nboyer;\nvar tautologyp_nboyer;\nvar if_constructor_nboyer;\nvar rewrite_count_nboyer;\nvar rewrite_nboyer;\nvar rewrite_args_nboyer;\nvar unify_subst_nboyer;\nvar one_way_unify1_nboyer;\nvar false_term_nboyer;\nvar true_term_nboyer;\nvar trans_of_implies1_nboyer;\nvar is_term_equal_nboyer;\nvar is_term_member_nboyer;\nvar const_nboyer;\nvar sc_const_3_nboyer;\nvar sc_const_4_nboyer;\n{\n (sc_const_4_nboyer = (new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair(\"\\u1E9Cu\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair(\"\\u1E9Cu\", (new sc_Pair(\"\\u1E9Cw\", null)))))), null)))))), null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cw\", null)))))), null)))))));\n (sc_const_3_nboyer = sc_list((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccompile\", (new sc_Pair(\"\\u1E9Cform\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccodegen\", (new sc_Pair((new sc_Pair(\"\\u1E9Coptimize\", (new sc_Pair(\"\\u1E9Cform\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), null)))))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ceqp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgreaterp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clesseqp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgreatereqp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cboolean\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cf\", null)), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ciff\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ceven1\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Codd\", (new sc_Pair((new sc_Pair(\"\\u1E9Csub1\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccountps-\", (new sc_Pair(\"\\u1E9Cl\", (new sc_Pair(\"\\u1E9Cpred\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccountps-loop\", (new sc_Pair(\"\\u1E9Cl\", (new sc_Pair(\"\\u1E9Cpred\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cfact-\", (new sc_Pair(\"\\u1E9Ci\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfact-loop\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair((1), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse-\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Creverse-loop\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdivides\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cassume-true\", (new sc_Pair(\"\\u1E9Cvar\", (new sc_Pair(\"\\u1E9Calist\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cvar\", (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), null)))))), (new sc_Pair(\"\\u1E9Calist\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cassume-false\", (new sc_Pair(\"\\u1E9Cvar\", (new sc_Pair(\"\\u1E9Calist\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cvar\", (new sc_Pair((new sc_Pair(\"\\u1E9Cf\", null)), null)))))), (new sc_Pair(\"\\u1E9Calist\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctautology-checker\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctautologyp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnormalize\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cfalsify\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfalsify1\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnormalize\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cprime\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))), null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cprime1\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Csub1\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair(\"\\u1E9Cp\", (new sc_Pair(\"\\u1E9Cq\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cq\", (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Cf\", null)), null)))))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cf\", null)), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair(\"\\u1E9Cp\", (new sc_Pair(\"\\u1E9Cq\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cp\", (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cq\", (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Cf\", null)), null)))))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair(\"\\u1E9Cp\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cf\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cimplies\", (new sc_Pair(\"\\u1E9Cp\", (new sc_Pair(\"\\u1E9Cq\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cq\", (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Cf\", null)), null)))))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", (new sc_Pair(\"\\u1E9Cc\", null)))))))), (new sc_Pair(\"\\u1E9Cd\", (new sc_Pair(\"\\u1E9Ce\", null)))))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cb\", (new sc_Pair(\"\\u1E9Cd\", (new sc_Pair(\"\\u1E9Ce\", null)))))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair(\"\\u1E9Cc\", (new sc_Pair(\"\\u1E9Cd\", (new sc_Pair(\"\\u1E9Ce\", null)))))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Ca\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cb\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cc\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cb\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cc\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus-tree\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus-tree\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus-tree\", (new sc_Pair(\"\\u1E9Cy\", null)))), (new sc_Pair(\"\\u1E9Ca\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus-tree\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus-fringe\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Ca\", null)))))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair(\"\\u1E9Cb\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair(\"\\u1E9Ca\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cexec\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair(\"\\u1E9Cpds\", (new sc_Pair(\"\\u1E9Cenvrn\", null)))))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cexec\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((new sc_Pair(\"\\u1E9Cexec\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cpds\", (new sc_Pair(\"\\u1E9Cenvrn\", null)))))))), (new sc_Pair(\"\\u1E9Cenvrn\", null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmc-flatten\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair((new sc_Pair(\"\\u1E9Cflatten\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cb\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clength\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Clength\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair((new sc_Pair(\"\\u1E9Cintersect\", (new sc_Pair(\"\\u1E9Cb\", (new sc_Pair(\"\\u1E9Cc\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cc\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnth\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), (new sc_Pair(\"\\u1E9Ci\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cexp\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cj\", (new sc_Pair(\"\\u1E9Ck\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair((new sc_Pair(\"\\u1E9Cexp\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cj\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cexp\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Ck\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cexp\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cj\", (new sc_Pair(\"\\u1E9Ck\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cexp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cexp\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cj\", null)))))), (new sc_Pair(\"\\u1E9Ck\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse-loop\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse-loop\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccount-list\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair((new sc_Pair(\"\\u1E9Csort-lp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccount-list\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccount-list\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cc\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cb\", (new sc_Pair(\"\\u1E9Cc\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((new sc_Pair(\"\\u1E9Cquotient\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-eval\", (new sc_Pair((new sc_Pair(\"\\u1E9Cbig-plus1\", (new sc_Pair(\"\\u1E9Cl\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cbase\", null)))))))), (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-eval\", (new sc_Pair(\"\\u1E9Cl\", (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair(\"\\u1E9Ci\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-eval\", (new sc_Pair((new sc_Pair(\"\\u1E9Cbig-plus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cbase\", null)))))))))), (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-eval\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-eval\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cbase\", null)))))), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((1), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cquotient\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cj\", null)))))), (new sc_Pair(\"\\u1E9Ci\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Ci\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cj\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cj\", (new sc_Pair((1), null)))))), null)))), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-eval\", (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-rep\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Ci\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-eval\", (new sc_Pair((new sc_Pair(\"\\u1E9Cbig-plus\", (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-rep\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cpower-rep\", (new sc_Pair(\"\\u1E9Cj\", (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), (new sc_Pair(\"\\u1E9Cbase\", null)))))))))), (new sc_Pair(\"\\u1E9Cbase\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cj\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgcd\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cgcd\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnth\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair(\"\\u1E9Ci\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnth\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Ci\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnth\", (new sc_Pair(\"\\u1E9Cb\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair((new sc_Pair(\"\\u1E9Clength\", (new sc_Pair(\"\\u1E9Ca\", null)))), null)))))), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Cc\", (new sc_Pair(\"\\u1E9Cw\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cc\", (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cw\", (new sc_Pair(\"\\u1E9Cx\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cb\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cc\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cb\", (new sc_Pair(\"\\u1E9Cc\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))), (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cz\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgcd\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgcd\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cvalue\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnormalize\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cvalue\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Ca\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cflatten\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnlistp\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clistp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgopher\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Clistp\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Csamefringe\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cflatten\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cflatten\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgreatest-factor\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cy\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((1), null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgreatest-factor\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((1), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((1), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgreatest-factor\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cy\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((1), null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), null)))))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes-list\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes-list\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes-list\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cprime-list\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cprime-list\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cprime-list\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cw\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cz\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cw\", (new sc_Pair((1), null)))))), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgreatereqp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cor\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cand\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((1), null)))))), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((1), null)))))), (new sc_Pair(sc_list(\"\\u1E9Cand\", (new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), null)))), (new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair(\"\\u1E9Cb\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), null)))), (new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Ca\", null)))), (new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cb\", null)))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Csub1\", (new sc_Pair(\"\\u1E9Ca\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Csub1\", (new sc_Pair(\"\\u1E9Cb\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair((new sc_Pair(\"\\u1E9Clength\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdelete\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cl\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Clength\", (new sc_Pair(\"\\u1E9Cl\", null)))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cl\", null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Csort2\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdelete\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cl\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cdelete\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Csort2\", (new sc_Pair(\"\\u1E9Cl\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdsort\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Csort2\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clength\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cx1\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cx2\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cx3\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cx4\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cx5\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair(\"\\u1E9Cx6\", (new sc_Pair(\"\\u1E9Cx7\", null)))))), null)))))), null)))))), null)))))), null)))))), null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((6), (new sc_Pair((new sc_Pair(\"\\u1E9Clength\", (new sc_Pair(\"\\u1E9Cx7\", null)))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair((2), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cquotient\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair((2), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cquotient\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair((2), null)))))), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Csigma\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), (new sc_Pair(\"\\u1E9Ci\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cquotient\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair(\"\\u1E9Ci\", null)))), null)))))), (new sc_Pair((2), null)))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cy\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cz\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnot\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cz\", null)))), null)))))), null)))))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus-tree\", (new sc_Pair((new sc_Pair(\"\\u1E9Cdelete\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))), (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus-tree\", (new sc_Pair(\"\\u1E9Cy\", null)))), (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Ca\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cmeaning\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus-tree\", (new sc_Pair(\"\\u1E9Cy\", null)))), (new sc_Pair(\"\\u1E9Ca\", null)))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cadd1\", (new sc_Pair(\"\\u1E9Cy\", null)))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnumberp\", (new sc_Pair(\"\\u1E9Cy\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnth\", (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), (new sc_Pair(\"\\u1E9Ci\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Ci\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clast\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Clistp\", (new sc_Pair(\"\\u1E9Cb\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Clast\", (new sc_Pair(\"\\u1E9Cb\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Clistp\", (new sc_Pair(\"\\u1E9Ca\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccar\", (new sc_Pair((new sc_Pair(\"\\u1E9Clast\", (new sc_Pair(\"\\u1E9Ca\", null)))), null)))), (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair(\"\\u1E9Cb\", null)))))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ct\", null)), (new sc_Pair(\"\\u1E9Cz\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cf\", null)), (new sc_Pair(\"\\u1E9Cz\", null)))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cassignment\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Cassignedp\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cassignment\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Ca\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cassignment\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cb\", null)))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccar\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgopher\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Clistp\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccar\", (new sc_Pair((new sc_Pair(\"\\u1E9Cflatten\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cflatten\", (new sc_Pair((new sc_Pair(\"\\u1E9Ccdr\", (new sc_Pair((new sc_Pair(\"\\u1E9Cgopher\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Clistp\", (new sc_Pair(\"\\u1E9Cx\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccdr\", (new sc_Pair((new sc_Pair(\"\\u1E9Cflatten\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Ccons\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), null)))))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cquotient\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cx\", null)))))), (new sc_Pair(\"\\u1E9Cy\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Czerop\", (new sc_Pair(\"\\u1E9Cy\", null)))), (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Cfix\", (new sc_Pair(\"\\u1E9Cx\", null)))), null)))))))), null)))))), (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cget\", (new sc_Pair(\"\\u1E9Cj\", (new sc_Pair((new sc_Pair(\"\\u1E9Cset\", (new sc_Pair(\"\\u1E9Ci\", (new sc_Pair(\"\\u1E9Cval\", (new sc_Pair(\"\\u1E9Cmem\", null)))))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cif\", (new sc_Pair((new sc_Pair(\"\\u1E9Ceqp\", (new sc_Pair(\"\\u1E9Cj\", (new sc_Pair(\"\\u1E9Ci\", null)))))), (new sc_Pair(\"\\u1E9Cval\", (new sc_Pair((new sc_Pair(\"\\u1E9Cget\", (new sc_Pair(\"\\u1E9Cj\", (new sc_Pair(\"\\u1E9Cmem\", null)))))), null)))))))), null))))))));\n (const_nboyer = (new sc_Pair((new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cf\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cc\", (new sc_Pair((new sc_Pair(\"\\u1E9Czero\", null)), null)))))), null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cy\", (new sc_Pair(\"\\u1E9Cf\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair((new sc_Pair(\"\\u1E9Ctimes\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Cc\", (new sc_Pair(\"\\u1E9Cd\", null)))))), null)))))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cz\", (new sc_Pair(\"\\u1E9Cf\", (new sc_Pair((new sc_Pair(\"\\u1E9Creverse\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair((new sc_Pair(\"\\u1E9Cappend\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cnil\", null)), null)))))), null)))), null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cu\", (new sc_Pair(\"\\u1E9Cequal\", (new sc_Pair((new sc_Pair(\"\\u1E9Cplus\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cdifference\", (new sc_Pair(\"\\u1E9Cx\", (new sc_Pair(\"\\u1E9Cy\", null)))))), null)))))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cw\", (new sc_Pair(\"\\u1E9Clessp\", (new sc_Pair((new sc_Pair(\"\\u1E9Cremainder\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair(\"\\u1E9Cb\", null)))))), (new sc_Pair((new sc_Pair(\"\\u1E9Cmember\", (new sc_Pair(\"\\u1E9Ca\", (new sc_Pair((new sc_Pair(\"\\u1E9Clength\", (new sc_Pair(\"\\u1E9Cb\", null)))), null)))))), null)))))))), null)))))))))));\n BgL_nboyerzd2benchmarkzd2 = function () {\n var args = null;\n for (var sc_tmp = arguments.length - 1; sc_tmp >= 0; sc_tmp--) {\n args = sc_cons(arguments[sc_tmp], args);\n }\n var n;\n return ((n = ((args === null) ? (0) : (args.car))), (BgL_setupzd2boyerzd2()), (BgL_runzd2benchmarkzd2((\"nboyer\" + (sc_number2string(n))), (1), function () {\n return (BgL_testzd2boyerzd2(n));\n }, function (rewrites) {\n if ((sc_isNumber(rewrites)))\n switch (n) {\n case (0):\n return (rewrites === (95024));\n break;\n case (1):\n return (rewrites === (591777));\n break;\n case (2):\n return (rewrites === (1813975));\n break;\n case (3):\n return (rewrites === (5375678));\n break;\n case (4):\n return (rewrites === (16445406));\n break;\n case (5):\n return (rewrites === (51507739));\n break;\n default:\n return true;\n break;\n }\n else\n return false;\n })));\n };\n BgL_setupzd2boyerzd2 = function () {\n return true;\n };\n BgL_testzd2boyerzd2 = function () {\n return true;\n };\n translate_term_nboyer = function (term) {\n var lst;\n return (!(term instanceof sc_Pair) ? term : (new sc_Pair((BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer((term.car))), ((lst = (term.cdr)), ((lst === null) ? null : (new sc_Pair((translate_term_nboyer((lst.car))), (translate_args_nboyer((lst.cdr))))))))));\n };\n translate_args_nboyer = function (lst) {\n var sc_lst_5;\n var term;\n return ((lst === null) ? null : (new sc_Pair(((term = (lst.car)), (!(term instanceof sc_Pair) ? term : (new sc_Pair((BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer((term.car))), (translate_args_nboyer((term.cdr))))))), ((sc_lst_5 = (lst.cdr)), ((sc_lst_5 === null) ? null : (new sc_Pair((translate_term_nboyer((sc_lst_5.car))), (translate_args_nboyer((sc_lst_5.cdr))))))))));\n };\n untranslate_term_nboyer = function (term) {\n var optrOpnd;\n var tail1131;\n var L1127;\n var falseHead1130;\n var symbol_record;\n if (!(term instanceof sc_Pair))\n return term;\n else {\n (falseHead1130 = (new sc_Pair(null, null)));\n (L1127 = (term.cdr));\n (tail1131 = falseHead1130);\n while (!(L1127 === null)) {\n {\n (tail1131.cdr = (new sc_Pair((untranslate_term_nboyer((L1127.car))), null)));\n (tail1131 = (tail1131.cdr));\n (L1127 = (L1127.cdr));\n }\n }\n (optrOpnd = (falseHead1130.cdr));\n return (new sc_Pair(((symbol_record = (term.car)), (symbol_record[(0)])), optrOpnd));\n }\n };\n BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer = function (sym) {\n var r;\n var x;\n return ((x = (sc_assq(sym, BgL_sc_za2symbolzd2recordszd2alistza2_2z00_nboyer))), ((x !== false) ? (x.cdr) : ((r = [sym, null]), (BgL_sc_za2symbolzd2recordszd2alistza2_2z00_nboyer = (new sc_Pair((new sc_Pair(sym, r)), BgL_sc_za2symbolzd2recordszd2alistza2_2z00_nboyer))), r)));\n };\n (BgL_sc_za2symbolzd2recordszd2alistza2_2z00_nboyer = null);\n translate_alist_nboyer = function (alist) {\n var sc_alist_6;\n var term;\n return ((alist === null) ? null : (new sc_Pair((new sc_Pair((alist.car.car), ((term = (alist.car.cdr)), (!(term instanceof sc_Pair) ? term : (new sc_Pair((BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer((term.car))), (translate_args_nboyer((term.cdr))))))))), ((sc_alist_6 = (alist.cdr)), ((sc_alist_6 === null) ? null : (new sc_Pair((new sc_Pair((sc_alist_6.car.car), (translate_term_nboyer((sc_alist_6.car.cdr))))), (translate_alist_nboyer((sc_alist_6.cdr))))))))));\n };\n apply_subst_nboyer = function (alist, term) {\n var lst;\n var temp_temp;\n return (!(term instanceof sc_Pair) ? ((temp_temp = (sc_assq(term, alist))), ((temp_temp !== false) ? (temp_temp.cdr) : term)) : (new sc_Pair((term.car), ((lst = (term.cdr)), ((lst === null) ? null : (new sc_Pair((apply_subst_nboyer(alist, (lst.car))), (apply_subst_lst_nboyer(alist, (lst.cdr))))))))));\n };\n apply_subst_lst_nboyer = function (alist, lst) {\n var sc_lst_7;\n return ((lst === null) ? null : (new sc_Pair((apply_subst_nboyer(alist, (lst.car))), ((sc_lst_7 = (lst.cdr)), ((sc_lst_7 === null) ? null : (new sc_Pair((apply_subst_nboyer(alist, (sc_lst_7.car))), (apply_subst_lst_nboyer(alist, (sc_lst_7.cdr))))))))));\n };\n tautologyp_nboyer = function (sc_x_11, true_lst, false_lst) {\n var tmp1125;\n var x;\n var tmp1126;\n var sc_x_8;\n var sc_tmp1125_9;\n var sc_tmp1126_10;\n var sc_x_11;\n var true_lst;\n var false_lst;\n while (true) {\n if ((((sc_tmp1126_10 = (is_term_equal_nboyer(sc_x_11, true_term_nboyer))), ((sc_tmp1126_10 !== false) ? sc_tmp1126_10 : (is_term_member_nboyer(sc_x_11, true_lst)))) !== false))\n return true;\n else if ((((sc_tmp1125_9 = (is_term_equal_nboyer(sc_x_11, false_term_nboyer))), ((sc_tmp1125_9 !== false) ? sc_tmp1125_9 : (is_term_member_nboyer(sc_x_11, false_lst)))) !== false))\n return false;\n else if (!(sc_x_11 instanceof sc_Pair))\n return false;\n else if (((sc_x_11.car) === if_constructor_nboyer))\n if ((((sc_x_8 = (sc_x_11.cdr.car)), (tmp1126 = (is_term_equal_nboyer(sc_x_8, true_term_nboyer))), ((tmp1126 !== false) ? tmp1126 : (is_term_member_nboyer(sc_x_8, true_lst)))) !== false))\n (sc_x_11 = (sc_x_11.cdr.cdr.car));\n else if ((((x = (sc_x_11.cdr.car)), (tmp1125 = (is_term_equal_nboyer(x, false_term_nboyer))), ((tmp1125 !== false) ? tmp1125 : (is_term_member_nboyer(x, false_lst)))) !== false))\n (sc_x_11 = (sc_x_11.cdr.cdr.cdr.car));\n else if (((tautologyp_nboyer((sc_x_11.cdr.cdr.car), (new sc_Pair((sc_x_11.cdr.car), true_lst)), false_lst)) !== false)) {\n (false_lst = (new sc_Pair((sc_x_11.cdr.car), false_lst)));\n (sc_x_11 = (sc_x_11.cdr.cdr.cdr.car));\n } else\n return false;\n else\n return false;\n }\n };\n (if_constructor_nboyer = \"\\u1E9C*\");\n (rewrite_count_nboyer = (0));\n rewrite_nboyer = function (term) {\n var term2;\n var sc_term_12;\n var lst;\n var symbol_record;\n var sc_lst_13;\n {\n (++rewrite_count_nboyer);\n if (!(term instanceof sc_Pair))\n return term;\n else {\n (sc_term_12 = (new sc_Pair((term.car), ((sc_lst_13 = (term.cdr)), ((sc_lst_13 === null) ? null : (new sc_Pair((rewrite_nboyer((sc_lst_13.car))), (rewrite_args_nboyer((sc_lst_13.cdr))))))))));\n (lst = ((symbol_record = (term.car)), (symbol_record[(1)])));\n while (true) {\n if ((lst === null))\n return sc_term_12;\n else if ((((term2 = ((lst.car).cdr.car)), (unify_subst_nboyer = null), (one_way_unify1_nboyer(sc_term_12, term2))) !== false))\n return (rewrite_nboyer((apply_subst_nboyer(unify_subst_nboyer, ((lst.car).cdr.cdr.car)))));\n else\n (lst = (lst.cdr));\n }\n }\n }\n };\n rewrite_args_nboyer = function (lst) {\n var sc_lst_14;\n return ((lst === null) ? null : (new sc_Pair((rewrite_nboyer((lst.car))), ((sc_lst_14 = (lst.cdr)), ((sc_lst_14 === null) ? null : (new sc_Pair((rewrite_nboyer((sc_lst_14.car))), (rewrite_args_nboyer((sc_lst_14.cdr))))))))));\n };\n (unify_subst_nboyer = \"\\u1E9C*\");\n one_way_unify1_nboyer = function (term1, term2) {\n var lst1;\n var lst2;\n var temp_temp;\n if (!(term2 instanceof sc_Pair)) {\n (temp_temp = (sc_assq(term2, unify_subst_nboyer)));\n if ((temp_temp !== false))\n return (is_term_equal_nboyer(term1, (temp_temp.cdr)));\n else if ((sc_isNumber(term2)))\n return (sc_isEqual(term1, term2));\n else {\n (unify_subst_nboyer = (new sc_Pair((new sc_Pair(term2, term1)), unify_subst_nboyer)));\n return true;\n }\n } else if (!(term1 instanceof sc_Pair))\n return false;\n else if (((term1.car) === (term2.car))) {\n (lst1 = (term1.cdr));\n (lst2 = (term2.cdr));\n while (true) {\n if ((lst1 === null))\n return (lst2 === null);\n else if ((lst2 === null))\n return false;\n else if (((one_way_unify1_nboyer((lst1.car), (lst2.car))) !== false)) {\n (lst1 = (lst1.cdr));\n (lst2 = (lst2.cdr));\n } else\n return false;\n }\n } else\n return false;\n };\n (false_term_nboyer = \"\\u1E9C*\");\n (true_term_nboyer = \"\\u1E9C*\");\n trans_of_implies1_nboyer = function (n) {\n var sc_n_15;\n return ((sc_isEqual(n, (1))) ? (sc_list(\"\\u1E9Cimplies\", (0), (1))) : (sc_list(\"\\u1E9Cand\", (sc_list(\"\\u1E9Cimplies\", (n - (1)), n)), ((sc_n_15 = (n - (1))), ((sc_isEqual(sc_n_15, (1))) ? (sc_list(\"\\u1E9Cimplies\", (0), (1))) : (sc_list(\"\\u1E9Cand\", (sc_list(\"\\u1E9Cimplies\", (sc_n_15 - (1)), sc_n_15)), (trans_of_implies1_nboyer((sc_n_15 - (1)))))))))));\n };\n is_term_equal_nboyer = function (x, y) {\n var lst1;\n var lst2;\n var r2;\n var r1;\n if ((x instanceof sc_Pair))\n if ((y instanceof sc_Pair))\n if ((((r1 = (x.car)), (r2 = (y.car)), (r1 === r2)) !== false)) {\n (lst1 = (x.cdr));\n (lst2 = (y.cdr));\n while (true) {\n if ((lst1 === null))\n return (lst2 === null);\n else if ((lst2 === null))\n return false;\n else if (((is_term_equal_nboyer((lst1.car), (lst2.car))) !== false)) {\n (lst1 = (lst1.cdr));\n (lst2 = (lst2.cdr));\n } else\n return false;\n }\n } else\n return false;\n else\n return false;\n else\n return (sc_isEqual(x, y));\n };\n is_term_member_nboyer = function (x, lst) {\n var x;\n var lst;\n while (true) {\n if ((lst === null))\n return false;\n else if (((is_term_equal_nboyer(x, (lst.car))) !== false))\n return true;\n else\n (lst = (lst.cdr));\n }\n };\n BgL_setupzd2boyerzd2 = function () {\n var symbol_record;\n var value;\n var BgL_sc_symbolzd2record_16zd2;\n var sym;\n var sc_sym_17;\n var term;\n var lst;\n var sc_term_18;\n var sc_term_19;\n {\n (BgL_sc_za2symbolzd2recordszd2alistza2_2z00_nboyer = null);\n (if_constructor_nboyer = (BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer(\"\\u1E9Cif\")));\n (false_term_nboyer = ((sc_term_19 = (new sc_Pair(\"\\u1E9Cf\", null))), (!(sc_term_19 instanceof sc_Pair) ? sc_term_19 : (new sc_Pair((BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer((sc_term_19.car))), (translate_args_nboyer((sc_term_19.cdr))))))));\n (true_term_nboyer = ((sc_term_18 = (new sc_Pair(\"\\u1E9Ct\", null))), (!(sc_term_18 instanceof sc_Pair) ? sc_term_18 : (new sc_Pair((BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer((sc_term_18.car))), (translate_args_nboyer((sc_term_18.cdr))))))));\n (lst = sc_const_3_nboyer);\n while (!(lst === null)) {\n {\n (term = (lst.car));\n if (((term instanceof sc_Pair) && (((term.car) === \"\\u1E9Cequal\") && ((term.cdr.car) instanceof sc_Pair)))) {\n (sc_sym_17 = ((term.cdr.car).car));\n (value = (new sc_Pair((!(term instanceof sc_Pair) ? term : (new sc_Pair((BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer((term.car))), (translate_args_nboyer((term.cdr)))))), ((sym = ((term.cdr.car).car)), (BgL_sc_symbolzd2record_16zd2 = (BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer(sym))), (BgL_sc_symbolzd2record_16zd2[(1)])))));\n (symbol_record = (BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer(sc_sym_17)));\n (symbol_record[(1)] = value);\n } else\n (sc_error(\"ADD-LEMMA did not like term: \", term));\n (lst = (lst.cdr));\n }\n }\n return true;\n }\n };\n BgL_testzd2boyerzd2 = function (n) {\n var optrOpnd;\n var term;\n var sc_n_20;\n var answer;\n var sc_term_21;\n var sc_term_22;\n {\n (rewrite_count_nboyer = (0));\n (term = sc_const_4_nboyer);\n (sc_n_20 = n);\n while (!(sc_n_20 === 0)) {\n {\n (term = (sc_list(\"\\u1E9Cor\", term, (new sc_Pair(\"\\u1E9Cf\", null)))));\n (--sc_n_20);\n }\n }\n (sc_term_22 = term);\n if (!(sc_term_22 instanceof sc_Pair))\n (optrOpnd = sc_term_22);\n else\n (optrOpnd = (new sc_Pair((BgL_sc_symbolzd2ze3symbolzd2record_1ze3_nboyer((sc_term_22.car))), (translate_args_nboyer((sc_term_22.cdr))))));\n (sc_term_21 = (apply_subst_nboyer(((const_nboyer === null) ? null : (new sc_Pair((new sc_Pair((const_nboyer.car.car), (translate_term_nboyer((const_nboyer.car.cdr))))), (translate_alist_nboyer((const_nboyer.cdr)))))), optrOpnd)));\n (answer = (tautologyp_nboyer((rewrite_nboyer(sc_term_21)), null, null)));\n (sc_write(rewrite_count_nboyer));\n (sc_display(\" rewrites\"));\n (sc_newline());\n if ((answer !== false))\n return rewrite_count_nboyer;\n else\n return false;\n }\n };\n}\n/* Exported Variables */\nvar BgL_parsezd2ze3nbzd2treesze3;\nvar BgL_earleyzd2benchmarkzd2;\nvar BgL_parsezd2ze3parsedzf3zc2;\nvar test;\nvar BgL_parsezd2ze3treesz31;\nvar BgL_makezd2parserzd2;\n/* End Exports */\n\nvar const_earley;\n{\n (const_earley = (new sc_Pair((new sc_Pair(\"\\u1E9Cs\", (new sc_Pair((new sc_Pair(\"\\u1E9Ca\", null)), (new sc_Pair((new sc_Pair(\"\\u1E9Cs\", (new sc_Pair(\"\\u1E9Cs\", null)))), null)))))), null)));\n BgL_makezd2parserzd2 = function (grammar, lexer) {\n var i;\n var parser_descr;\n var def_loop;\n var nb_nts;\n var names;\n var steps;\n var predictors;\n var enders;\n var starters;\n var nts;\n var sc_names_1;\n var sc_steps_2;\n var sc_predictors_3;\n var sc_enders_4;\n var sc_starters_5;\n var nb_confs;\n var BgL_sc_defzd2loop_6zd2;\n var BgL_sc_nbzd2nts_7zd2;\n var sc_nts_8;\n var BgL_sc_defzd2loop_9zd2;\n var ind;\n {\n ind = function (nt, sc_nts_10) {\n var i;\n {\n (i = ((sc_nts_10.length) - (1)));\n while (true) {\n if ((i >= (0)))\n if ((sc_isEqual((sc_nts_10[i]), nt)))\n return i;\n else\n (--i);\n else\n return false;\n }\n }\n };\n (sc_nts_8 = ((BgL_sc_defzd2loop_9zd2 = function (defs, sc_nts_11) {\n var rule_loop;\n var head;\n var def;\n return ((defs instanceof sc_Pair) ? ((def = (defs.car)), (head = (def.car)), (rule_loop = function (rules, sc_nts_12) {\n var nt;\n var l;\n var sc_nts_13;\n var rule;\n if ((rules instanceof sc_Pair)) {\n (rule = (rules.car));\n (l = rule);\n (sc_nts_13 = sc_nts_12);\n while ((l instanceof sc_Pair)) {\n {\n (nt = (l.car));\n (l = (l.cdr));\n (sc_nts_13 = (((sc_member(nt, sc_nts_13)) !== false) ? sc_nts_13 : (new sc_Pair(nt, sc_nts_13))));\n }\n }\n return (rule_loop((rules.cdr), sc_nts_13));\n } else\n return (BgL_sc_defzd2loop_9zd2((defs.cdr), sc_nts_12));\n }), (rule_loop((def.cdr), (((sc_member(head, sc_nts_11)) !== false) ? sc_nts_11 : (new sc_Pair(head, sc_nts_11)))))) : (sc_list2vector((sc_reverse(sc_nts_11)))));\n }), (BgL_sc_defzd2loop_9zd2(grammar, null))));\n (BgL_sc_nbzd2nts_7zd2 = (sc_nts_8.length));\n (nb_confs = (((BgL_sc_defzd2loop_6zd2 = function (defs, BgL_sc_nbzd2confs_14zd2) {\n var rule_loop;\n var def;\n return ((defs instanceof sc_Pair) ? ((def = (defs.car)), (rule_loop = function (rules, BgL_sc_nbzd2confs_15zd2) {\n var l;\n var BgL_sc_nbzd2confs_16zd2;\n var rule;\n if ((rules instanceof sc_Pair)) {\n (rule = (rules.car));\n (l = rule);\n (BgL_sc_nbzd2confs_16zd2 = BgL_sc_nbzd2confs_15zd2);\n while ((l instanceof sc_Pair)) {\n {\n (l = (l.cdr));\n (++BgL_sc_nbzd2confs_16zd2);\n }\n }\n return (rule_loop((rules.cdr), (BgL_sc_nbzd2confs_16zd2 + (1))));\n } else\n return (BgL_sc_defzd2loop_6zd2((defs.cdr), BgL_sc_nbzd2confs_15zd2));\n }), (rule_loop((def.cdr), BgL_sc_nbzd2confs_14zd2))) : BgL_sc_nbzd2confs_14zd2);\n }), (BgL_sc_defzd2loop_6zd2(grammar, (0)))) + BgL_sc_nbzd2nts_7zd2));\n (sc_starters_5 = (sc_makeVector(BgL_sc_nbzd2nts_7zd2, null)));\n (sc_enders_4 = (sc_makeVector(BgL_sc_nbzd2nts_7zd2, null)));\n (sc_predictors_3 = (sc_makeVector(BgL_sc_nbzd2nts_7zd2, null)));\n (sc_steps_2 = (sc_makeVector(nb_confs, false)));\n (sc_names_1 = (sc_makeVector(nb_confs, false)));\n (nts = sc_nts_8);\n (starters = sc_starters_5);\n (enders = sc_enders_4);\n (predictors = sc_predictors_3);\n (steps = sc_steps_2);\n (names = sc_names_1);\n (nb_nts = (sc_nts_8.length));\n (i = (nb_nts - (1)));\n while ((i >= (0))) {\n {\n (sc_steps_2[i] = (i - nb_nts));\n (sc_names_1[i] = (sc_list((sc_nts_8[i]), (0))));\n (sc_enders_4[i] = (sc_list(i)));\n (--i);\n }\n }\n def_loop = function (defs, conf) {\n var rule_loop;\n var head;\n var def;\n return ((defs instanceof sc_Pair) ? ((def = (defs.car)), (head = (def.car)), (rule_loop = function (rules, conf, rule_num) {\n var i;\n var sc_i_17;\n var nt;\n var l;\n var sc_conf_18;\n var sc_i_19;\n var rule;\n if ((rules instanceof sc_Pair)) {\n (rule = (rules.car));\n (names[conf] = (sc_list(head, rule_num)));\n (sc_i_19 = (ind(head, nts)));\n (starters[sc_i_19] = (new sc_Pair(conf, (starters[sc_i_19]))));\n (l = rule);\n (sc_conf_18 = conf);\n while ((l instanceof sc_Pair)) {\n {\n (nt = (l.car));\n (steps[sc_conf_18] = (ind(nt, nts)));\n (sc_i_17 = (ind(nt, nts)));\n (predictors[sc_i_17] = (new sc_Pair(sc_conf_18, (predictors[sc_i_17]))));\n (l = (l.cdr));\n (++sc_conf_18);\n }\n }\n (steps[sc_conf_18] = ((ind(head, nts)) - nb_nts));\n (i = (ind(head, nts)));\n (enders[i] = (new sc_Pair(sc_conf_18, (enders[i]))));\n return (rule_loop((rules.cdr), (sc_conf_18 + (1)), (rule_num + (1))));\n } else\n return (def_loop((defs.cdr), conf));\n }), (rule_loop((def.cdr), conf, (1)))) : undefined);\n };\n (def_loop(grammar, (sc_nts_8.length)));\n (parser_descr = [lexer, sc_nts_8, sc_starters_5, sc_enders_4, sc_predictors_3, sc_steps_2, sc_names_1]);\n return function (input) {\n var optrOpnd;\n var sc_optrOpnd_20;\n var sc_optrOpnd_21;\n var sc_optrOpnd_22;\n var loop1;\n var BgL_sc_stateza2_23za2;\n var toks;\n var BgL_sc_nbzd2nts_24zd2;\n var sc_steps_25;\n var sc_enders_26;\n var state_num;\n var BgL_sc_statesza2_27za2;\n var states;\n var i;\n var conf;\n var l;\n var tok_nts;\n var sc_i_28;\n var sc_i_29;\n var l1;\n var l2;\n var tok;\n var tail1129;\n var L1125;\n var goal_enders;\n var BgL_sc_statesza2_30za2;\n var BgL_sc_nbzd2nts_31zd2;\n var BgL_sc_nbzd2confs_32zd2;\n var nb_toks;\n var goal_starters;\n var sc_states_33;\n var BgL_sc_nbzd2confs_34zd2;\n var BgL_sc_nbzd2toks_35zd2;\n var sc_toks_36;\n var falseHead1128;\n var sc_names_37;\n var sc_steps_38;\n var sc_predictors_39;\n var sc_enders_40;\n var sc_starters_41;\n var sc_nts_42;\n var lexer;\n var sc_ind_43;\n var make_states;\n var BgL_sc_confzd2setzd2getza2_44za2;\n var conf_set_merge_new_bang;\n var conf_set_adjoin;\n var BgL_sc_confzd2setzd2adjoinza2_45za2;\n var BgL_sc_confzd2setzd2adjoinza2za2_46z00;\n var conf_set_union;\n var forw;\n var is_parsed;\n var deriv_trees;\n var BgL_sc_derivzd2treesza2_47z70;\n var nb_deriv_trees;\n var BgL_sc_nbzd2derivzd2treesza2_48za2;\n {\n sc_ind_43 = function (nt, sc_nts_49) {\n var i;\n {\n (i = ((sc_nts_49.length) - (1)));\n while (true) {\n if ((i >= (0)))\n if ((sc_isEqual((sc_nts_49[i]), nt)))\n return i;\n else\n (--i);\n else\n return false;\n }\n }\n };\n make_states = function (BgL_sc_nbzd2toks_50zd2, BgL_sc_nbzd2confs_51zd2) {\n var v;\n var i;\n var sc_states_52;\n {\n (sc_states_52 = (sc_makeVector((BgL_sc_nbzd2toks_50zd2 + (1)), false)));\n (i = BgL_sc_nbzd2toks_50zd2);\n while ((i >= (0))) {\n {\n (v = (sc_makeVector((BgL_sc_nbzd2confs_51zd2 + (1)), false)));\n (v[(0)] = (-1));\n (sc_states_52[i] = v);\n (--i);\n }\n }\n return sc_states_52;\n }\n };\n BgL_sc_confzd2setzd2getza2_44za2 = function (state, BgL_sc_statezd2num_53zd2, sc_conf_54) {\n var conf_set;\n var BgL_sc_confzd2set_55zd2;\n return ((BgL_sc_confzd2set_55zd2 = (state[(sc_conf_54 + (1))])), ((BgL_sc_confzd2set_55zd2 !== false) ? BgL_sc_confzd2set_55zd2 : ((conf_set = (sc_makeVector((BgL_sc_statezd2num_53zd2 + (6)), false))), (conf_set[(1)] = (-3)), (conf_set[(2)] = (-1)), (conf_set[(3)] = (-1)), (conf_set[(4)] = (-1)), (state[(sc_conf_54 + (1))] = conf_set), conf_set)));\n };\n conf_set_merge_new_bang = function (conf_set) {\n return ((conf_set[((conf_set[(1)]) + (5))] = (conf_set[(4)])), (conf_set[(1)] = (conf_set[(3)])), (conf_set[(3)] = (-1)), (conf_set[(4)] = (-1)));\n };\n conf_set_adjoin = function (state, conf_set, sc_conf_56, i) {\n var tail;\n return ((tail = (conf_set[(3)])), (conf_set[(i + (5))] = (-1)), (conf_set[(tail + (5))] = i), (conf_set[(3)] = i), ((tail < (0)) ? ((conf_set[(0)] = (state[(0)])), (state[(0)] = sc_conf_56)) : undefined));\n };\n BgL_sc_confzd2setzd2adjoinza2_45za2 = function (sc_states_57, BgL_sc_statezd2num_58zd2, l, i) {\n var conf_set;\n var sc_conf_59;\n var l1;\n var state;\n {\n (state = (sc_states_57[BgL_sc_statezd2num_58zd2]));\n (l1 = l);\n while ((l1 instanceof sc_Pair)) {\n {\n (sc_conf_59 = (l1.car));\n (conf_set = (BgL_sc_confzd2setzd2getza2_44za2(state, BgL_sc_statezd2num_58zd2, sc_conf_59)));\n if (((conf_set[(i + (5))]) === false)) {\n (conf_set_adjoin(state, conf_set, sc_conf_59, i));\n (l1 = (l1.cdr));\n } else\n (l1 = (l1.cdr));\n }\n }\n return undefined;\n }\n };\n BgL_sc_confzd2setzd2adjoinza2za2_46z00 = function (sc_states_60, BgL_sc_statesza2_61za2, BgL_sc_statezd2num_62zd2, sc_conf_63, i) {\n var BgL_sc_confzd2setza2_64z70;\n var BgL_sc_stateza2_65za2;\n var conf_set;\n var state;\n return ((state = (sc_states_60[BgL_sc_statezd2num_62zd2])), ((((conf_set = (state[(sc_conf_63 + (1))])), ((conf_set !== false) ? (conf_set[(i + (5))]) : false)) !== false) ? ((BgL_sc_stateza2_65za2 = (BgL_sc_statesza2_61za2[BgL_sc_statezd2num_62zd2])), (BgL_sc_confzd2setza2_64z70 = (BgL_sc_confzd2setzd2getza2_44za2(BgL_sc_stateza2_65za2, BgL_sc_statezd2num_62zd2, sc_conf_63))), (((BgL_sc_confzd2setza2_64z70[(i + (5))]) === false) ? (conf_set_adjoin(BgL_sc_stateza2_65za2, BgL_sc_confzd2setza2_64z70, sc_conf_63, i)) : undefined), true) : false));\n };\n conf_set_union = function (state, conf_set, sc_conf_66, other_set) {\n var i;\n {\n (i = (other_set[(2)]));\n while ((i >= (0))) {\n if (((conf_set[(i + (5))]) === false)) {\n (conf_set_adjoin(state, conf_set, sc_conf_66, i));\n (i = (other_set[(i + (5))]));\n } else\n (i = (other_set[(i + (5))]));\n }\n return undefined;\n }\n };\n forw = function (sc_states_67, BgL_sc_statezd2num_68zd2, sc_starters_69, sc_enders_70, sc_predictors_71, sc_steps_72, sc_nts_73) {\n var next_set;\n var next;\n var conf_set;\n var ender;\n var l;\n var starter_set;\n var starter;\n var sc_l_74;\n var sc_loop1_75;\n var head;\n var BgL_sc_confzd2set_76zd2;\n var BgL_sc_statezd2num_77zd2;\n var state;\n var sc_states_78;\n var preds;\n var BgL_sc_confzd2set_79zd2;\n var step;\n var sc_conf_80;\n var BgL_sc_nbzd2nts_81zd2;\n var sc_state_82;\n {\n (sc_state_82 = (sc_states_67[BgL_sc_statezd2num_68zd2]));\n (BgL_sc_nbzd2nts_81zd2 = (sc_nts_73.length));\n while (true) {\n {\n (sc_conf_80 = (sc_state_82[(0)]));\n if ((sc_conf_80 >= (0))) {\n (step = (sc_steps_72[sc_conf_80]));\n (BgL_sc_confzd2set_79zd2 = (sc_state_82[(sc_conf_80 + (1))]));\n (head = (BgL_sc_confzd2set_79zd2[(4)]));\n (sc_state_82[(0)] = (BgL_sc_confzd2set_79zd2[(0)]));\n (conf_set_merge_new_bang(BgL_sc_confzd2set_79zd2));\n if ((step >= (0))) {\n (sc_l_74 = (sc_starters_69[step]));\n while ((sc_l_74 instanceof sc_Pair)) {\n {\n (starter = (sc_l_74.car));\n (starter_set = (BgL_sc_confzd2setzd2getza2_44za2(sc_state_82, BgL_sc_statezd2num_68zd2, starter)));\n if (((starter_set[(BgL_sc_statezd2num_68zd2 + (5))]) === false)) {\n (conf_set_adjoin(sc_state_82, starter_set, starter, BgL_sc_statezd2num_68zd2));\n (sc_l_74 = (sc_l_74.cdr));\n } else\n (sc_l_74 = (sc_l_74.cdr));\n }\n }\n (l = (sc_enders_70[step]));\n while ((l instanceof sc_Pair)) {\n {\n (ender = (l.car));\n if ((((conf_set = (sc_state_82[(ender + (1))])), ((conf_set !== false) ? (conf_set[(BgL_sc_statezd2num_68zd2 + (5))]) : false)) !== false)) {\n (next = (sc_conf_80 + (1)));\n (next_set = (BgL_sc_confzd2setzd2getza2_44za2(sc_state_82, BgL_sc_statezd2num_68zd2, next)));\n (conf_set_union(sc_state_82, next_set, next, BgL_sc_confzd2set_79zd2));\n (l = (l.cdr));\n } else\n (l = (l.cdr));\n }\n }\n } else {\n (preds = (sc_predictors_71[(step + BgL_sc_nbzd2nts_81zd2)]));\n (sc_states_78 = sc_states_67);\n (state = sc_state_82);\n (BgL_sc_statezd2num_77zd2 = BgL_sc_statezd2num_68zd2);\n (BgL_sc_confzd2set_76zd2 = BgL_sc_confzd2set_79zd2);\n sc_loop1_75 = function (l) {\n var sc_state_83;\n var BgL_sc_nextzd2set_84zd2;\n var sc_next_85;\n var pred_set;\n var i;\n var pred;\n if ((l instanceof sc_Pair)) {\n (pred = (l.car));\n (i = head);\n while ((i >= (0))) {\n {\n (pred_set = ((sc_state_83 = (sc_states_78[i])), (sc_state_83[(pred + (1))])));\n if ((pred_set !== false)) {\n (sc_next_85 = (pred + (1)));\n (BgL_sc_nextzd2set_84zd2 = (BgL_sc_confzd2setzd2getza2_44za2(state, BgL_sc_statezd2num_77zd2, sc_next_85)));\n (conf_set_union(state, BgL_sc_nextzd2set_84zd2, sc_next_85, pred_set));\n }\n (i = (BgL_sc_confzd2set_76zd2[(i + (5))]));\n }\n }\n return (sc_loop1_75((l.cdr)));\n } else\n return undefined;\n };\n (sc_loop1_75(preds));\n }\n } else\n return undefined;\n }\n }\n }\n };\n is_parsed = function (nt, i, j, sc_nts_86, sc_enders_87, sc_states_88) {\n var conf_set;\n var state;\n var sc_conf_89;\n var l;\n var BgL_sc_ntza2_90za2;\n {\n (BgL_sc_ntza2_90za2 = (sc_ind_43(nt, sc_nts_86)));\n if ((BgL_sc_ntza2_90za2 !== false)) {\n (sc_nts_86.length);\n (l = (sc_enders_87[BgL_sc_ntza2_90za2]));\n while (true) {\n if ((l instanceof sc_Pair)) {\n (sc_conf_89 = (l.car));\n if ((((state = (sc_states_88[j])), (conf_set = (state[(sc_conf_89 + (1))])), ((conf_set !== false) ? (conf_set[(i + (5))]) : false)) !== false))\n return true;\n else\n (l = (l.cdr));\n } else\n return false;\n }\n } else\n return false;\n }\n };\n deriv_trees = function (sc_conf_91, i, j, sc_enders_92, sc_steps_93, sc_names_94, sc_toks_95, sc_states_96, BgL_sc_nbzd2nts_97zd2) {\n var sc_loop1_98;\n var prev;\n var name;\n return ((name = (sc_names_94[sc_conf_91])), ((name !== false) ? ((sc_conf_91 < BgL_sc_nbzd2nts_97zd2) ? (sc_list((sc_list(name, ((sc_toks_95[i]).car))))) : (sc_list((sc_list(name))))) : ((prev = (sc_conf_91 - (1))), (sc_loop1_98 = function (l1, l2) {\n var loop2;\n var ender_set;\n var state;\n var ender;\n var l1;\n var l2;\n while (true) {\n if ((l1 instanceof sc_Pair)) {\n (ender = (l1.car));\n (ender_set = ((state = (sc_states_96[j])), (state[(ender + (1))])));\n if ((ender_set !== false)) {\n loop2 = function (k, l2) {\n var loop3;\n var ender_trees;\n var prev_trees;\n var conf_set;\n var sc_state_99;\n var k;\n var l2;\n while (true) {\n if ((k >= (0)))\n if (((k >= i) && (((sc_state_99 = (sc_states_96[k])), (conf_set = (sc_state_99[(prev + (1))])), ((conf_set !== false) ? (conf_set[(i + (5))]) : false)) !== false))) {\n (prev_trees = (deriv_trees(prev, i, k, sc_enders_92, sc_steps_93, sc_names_94, sc_toks_95, sc_states_96, BgL_sc_nbzd2nts_97zd2)));\n (ender_trees = (deriv_trees(ender, k, j, sc_enders_92, sc_steps_93, sc_names_94, sc_toks_95, sc_states_96, BgL_sc_nbzd2nts_97zd2)));\n loop3 = function (l3, l2) {\n var l4;\n var sc_l2_100;\n var ender_tree;\n if ((l3 instanceof sc_Pair)) {\n (ender_tree = (sc_list((l3.car))));\n (l4 = prev_trees);\n (sc_l2_100 = l2);\n while ((l4 instanceof sc_Pair)) {\n {\n (sc_l2_100 = (new sc_Pair((sc_append((l4.car), ender_tree)), sc_l2_100)));\n (l4 = (l4.cdr));\n }\n }\n return (loop3((l3.cdr), sc_l2_100));\n } else\n return (loop2((ender_set[(k + (5))]), l2));\n };\n return (loop3(ender_trees, l2));\n } else\n (k = (ender_set[(k + (5))]));\n else\n return (sc_loop1_98((l1.cdr), l2));\n }\n };\n return (loop2((ender_set[(2)]), l2));\n } else\n (l1 = (l1.cdr));\n } else\n return l2;\n }\n }), (sc_loop1_98((sc_enders_92[(sc_steps_93[prev])]), null)))));\n };\n BgL_sc_derivzd2treesza2_47z70 = function (nt, i, j, sc_nts_101, sc_enders_102, sc_steps_103, sc_names_104, sc_toks_105, sc_states_106) {\n var conf_set;\n var state;\n var sc_conf_107;\n var l;\n var trees;\n var BgL_sc_nbzd2nts_108zd2;\n var BgL_sc_ntza2_109za2;\n {\n (BgL_sc_ntza2_109za2 = (sc_ind_43(nt, sc_nts_101)));\n if ((BgL_sc_ntza2_109za2 !== false)) {\n (BgL_sc_nbzd2nts_108zd2 = (sc_nts_101.length));\n (l = (sc_enders_102[BgL_sc_ntza2_109za2]));\n (trees = null);\n while ((l instanceof sc_Pair)) {\n {\n (sc_conf_107 = (l.car));\n if ((((state = (sc_states_106[j])), (conf_set = (state[(sc_conf_107 + (1))])), ((conf_set !== false) ? (conf_set[(i + (5))]) : false)) !== false)) {\n (l = (l.cdr));\n (trees = (sc_append((deriv_trees(sc_conf_107, i, j, sc_enders_102, sc_steps_103, sc_names_104, sc_toks_105, sc_states_106, BgL_sc_nbzd2nts_108zd2)), trees)));\n } else\n (l = (l.cdr));\n }\n }\n return trees;\n } else\n return false;\n }\n };\n nb_deriv_trees = function (sc_conf_110, i, j, sc_enders_111, sc_steps_112, sc_toks_113, sc_states_114, BgL_sc_nbzd2nts_115zd2) {\n var sc_loop1_116;\n var tmp1124;\n var prev;\n return ((prev = (sc_conf_110 - (1))), ((((tmp1124 = (sc_conf_110 < BgL_sc_nbzd2nts_115zd2)), ((tmp1124 !== false) ? tmp1124 : ((sc_steps_112[prev]) < (0)))) !== false) ? (1) : ((sc_loop1_116 = function (l, sc_n_118) {\n var nb_ender_trees;\n var nb_prev_trees;\n var conf_set;\n var state;\n var k;\n var n;\n var ender_set;\n var sc_state_117;\n var ender;\n var l;\n var sc_n_118;\n while (true) {\n if ((l instanceof sc_Pair)) {\n (ender = (l.car));\n (ender_set = ((sc_state_117 = (sc_states_114[j])), (sc_state_117[(ender + (1))])));\n if ((ender_set !== false)) {\n (k = (ender_set[(2)]));\n (n = sc_n_118);\n while ((k >= (0))) {\n if (((k >= i) && (((state = (sc_states_114[k])), (conf_set = (state[(prev + (1))])), ((conf_set !== false) ? (conf_set[(i + (5))]) : false)) !== false))) {\n (nb_prev_trees = (nb_deriv_trees(prev, i, k, sc_enders_111, sc_steps_112, sc_toks_113, sc_states_114, BgL_sc_nbzd2nts_115zd2)));\n (nb_ender_trees = (nb_deriv_trees(ender, k, j, sc_enders_111, sc_steps_112, sc_toks_113, sc_states_114, BgL_sc_nbzd2nts_115zd2)));\n (k = (ender_set[(k + (5))]));\n (n += (nb_prev_trees * nb_ender_trees));\n } else\n (k = (ender_set[(k + (5))]));\n }\n return (sc_loop1_116((l.cdr), n));\n } else\n (l = (l.cdr));\n } else\n return sc_n_118;\n }\n }), (sc_loop1_116((sc_enders_111[(sc_steps_112[prev])]), (0))))));\n };\n BgL_sc_nbzd2derivzd2treesza2_48za2 = function (nt, i, j, sc_nts_119, sc_enders_120, sc_steps_121, sc_toks_122, sc_states_123) {\n var conf_set;\n var state;\n var sc_conf_124;\n var l;\n var nb_trees;\n var BgL_sc_nbzd2nts_125zd2;\n var BgL_sc_ntza2_126za2;\n {\n (BgL_sc_ntza2_126za2 = (sc_ind_43(nt, sc_nts_119)));\n if ((BgL_sc_ntza2_126za2 !== false)) {\n (BgL_sc_nbzd2nts_125zd2 = (sc_nts_119.length));\n (l = (sc_enders_120[BgL_sc_ntza2_126za2]));\n (nb_trees = (0));\n while ((l instanceof sc_Pair)) {\n {\n (sc_conf_124 = (l.car));\n if ((((state = (sc_states_123[j])), (conf_set = (state[(sc_conf_124 + (1))])), ((conf_set !== false) ? (conf_set[(i + (5))]) : false)) !== false)) {\n (l = (l.cdr));\n (nb_trees = ((nb_deriv_trees(sc_conf_124, i, j, sc_enders_120, sc_steps_121, sc_toks_122, sc_states_123, BgL_sc_nbzd2nts_125zd2)) + nb_trees));\n } else\n (l = (l.cdr));\n }\n }\n return nb_trees;\n } else\n return false;\n }\n };\n (lexer = (parser_descr[(0)]));\n (sc_nts_42 = (parser_descr[(1)]));\n (sc_starters_41 = (parser_descr[(2)]));\n (sc_enders_40 = (parser_descr[(3)]));\n (sc_predictors_39 = (parser_descr[(4)]));\n (sc_steps_38 = (parser_descr[(5)]));\n (sc_names_37 = (parser_descr[(6)]));\n (falseHead1128 = (new sc_Pair(null, null)));\n (L1125 = (lexer(input)));\n (tail1129 = falseHead1128);\n while (!(L1125 === null)) {\n {\n (tok = (L1125.car));\n (l1 = (tok.cdr));\n (l2 = null);\n while ((l1 instanceof sc_Pair)) {\n {\n (sc_i_29 = (sc_ind_43((l1.car), sc_nts_42)));\n if ((sc_i_29 !== false)) {\n (l1 = (l1.cdr));\n (l2 = (new sc_Pair(sc_i_29, l2)));\n } else\n (l1 = (l1.cdr));\n }\n }\n (sc_optrOpnd_22 = (new sc_Pair((tok.car), (sc_reverse(l2)))));\n (sc_optrOpnd_21 = (new sc_Pair(sc_optrOpnd_22, null)));\n (tail1129.cdr = sc_optrOpnd_21);\n (tail1129 = (tail1129.cdr));\n (L1125 = (L1125.cdr));\n }\n }\n (sc_optrOpnd_20 = (falseHead1128.cdr));\n (sc_toks_36 = (sc_list2vector(sc_optrOpnd_20)));\n (BgL_sc_nbzd2toks_35zd2 = (sc_toks_36.length));\n (BgL_sc_nbzd2confs_34zd2 = (sc_steps_38.length));\n (sc_states_33 = (make_states(BgL_sc_nbzd2toks_35zd2, BgL_sc_nbzd2confs_34zd2)));\n (goal_starters = (sc_starters_41[(0)]));\n (BgL_sc_confzd2setzd2adjoinza2_45za2(sc_states_33, (0), goal_starters, (0)));\n (forw(sc_states_33, (0), sc_starters_41, sc_enders_40, sc_predictors_39, sc_steps_38, sc_nts_42));\n (sc_i_28 = (0));\n while ((sc_i_28 < BgL_sc_nbzd2toks_35zd2)) {\n {\n (tok_nts = ((sc_toks_36[sc_i_28]).cdr));\n (BgL_sc_confzd2setzd2adjoinza2_45za2(sc_states_33, (sc_i_28 + (1)), tok_nts, sc_i_28));\n (forw(sc_states_33, (sc_i_28 + (1)), sc_starters_41, sc_enders_40, sc_predictors_39, sc_steps_38, sc_nts_42));\n (++sc_i_28);\n }\n }\n (nb_toks = (sc_toks_36.length));\n (BgL_sc_nbzd2confs_32zd2 = (sc_steps_38.length));\n (BgL_sc_nbzd2nts_31zd2 = (sc_nts_42.length));\n (BgL_sc_statesza2_30za2 = (make_states(nb_toks, BgL_sc_nbzd2confs_32zd2)));\n (goal_enders = (sc_enders_40[(0)]));\n (l = goal_enders);\n while ((l instanceof sc_Pair)) {\n {\n (conf = (l.car));\n (BgL_sc_confzd2setzd2adjoinza2za2_46z00(sc_states_33, BgL_sc_statesza2_30za2, nb_toks, conf, (0)));\n (l = (l.cdr));\n }\n }\n (i = nb_toks);\n while ((i >= (0))) {\n {\n (states = sc_states_33);\n (BgL_sc_statesza2_27za2 = BgL_sc_statesza2_30za2);\n (state_num = i);\n (sc_enders_26 = sc_enders_40);\n (sc_steps_25 = sc_steps_38);\n (BgL_sc_nbzd2nts_24zd2 = BgL_sc_nbzd2nts_31zd2);\n (toks = sc_toks_36);\n (BgL_sc_stateza2_23za2 = (BgL_sc_statesza2_30za2[i]));\n loop1 = function () {\n var sc_loop1_127;\n var prev;\n var BgL_sc_statesza2_128za2;\n var sc_states_129;\n var j;\n var i;\n var sc_i_130;\n var head;\n var conf_set;\n var sc_conf_131;\n {\n (sc_conf_131 = (BgL_sc_stateza2_23za2[(0)]));\n if ((sc_conf_131 >= (0))) {\n (conf_set = (BgL_sc_stateza2_23za2[(sc_conf_131 + (1))]));\n (head = (conf_set[(4)]));\n (BgL_sc_stateza2_23za2[(0)] = (conf_set[(0)]));\n (conf_set_merge_new_bang(conf_set));\n (sc_i_130 = head);\n while ((sc_i_130 >= (0))) {\n {\n (i = sc_i_130);\n (j = state_num);\n (sc_states_129 = states);\n (BgL_sc_statesza2_128za2 = BgL_sc_statesza2_27za2);\n (prev = (sc_conf_131 - (1)));\n if (((sc_conf_131 >= BgL_sc_nbzd2nts_24zd2) && ((sc_steps_25[prev]) >= (0)))) {\n sc_loop1_127 = function (l) {\n var k;\n var ender_set;\n var state;\n var ender;\n var l;\n while (true) {\n if ((l instanceof sc_Pair)) {\n (ender = (l.car));\n (ender_set = ((state = (sc_states_129[j])), (state[(ender + (1))])));\n if ((ender_set !== false)) {\n (k = (ender_set[(2)]));\n while ((k >= (0))) {\n {\n if ((k >= i))\n if (((BgL_sc_confzd2setzd2adjoinza2za2_46z00(sc_states_129, BgL_sc_statesza2_128za2, k, prev, i)) !== false))\n (BgL_sc_confzd2setzd2adjoinza2za2_46z00(sc_states_129, BgL_sc_statesza2_128za2, j, ender, k));\n (k = (ender_set[(k + (5))]));\n }\n }\n return (sc_loop1_127((l.cdr)));\n } else\n (l = (l.cdr));\n } else\n return undefined;\n }\n };\n (sc_loop1_127((sc_enders_26[(sc_steps_25[prev])])));\n }\n (sc_i_130 = (conf_set[(sc_i_130 + (5))]));\n }\n }\n return (loop1());\n } else\n return undefined;\n }\n };\n (loop1());\n (--i);\n }\n }\n (optrOpnd = BgL_sc_statesza2_30za2);\n return [sc_nts_42, sc_starters_41, sc_enders_40, sc_predictors_39, sc_steps_38, sc_names_37, sc_toks_36, optrOpnd, is_parsed, BgL_sc_derivzd2treesza2_47z70, BgL_sc_nbzd2derivzd2treesza2_48za2];\n }\n };\n }\n };\n BgL_parsezd2ze3parsedzf3zc2 = function (parse, nt, i, j) {\n var is_parsed;\n var states;\n var enders;\n var nts;\n return ((nts = (parse[(0)])), (enders = (parse[(2)])), (states = (parse[(7)])), (is_parsed = (parse[(8)])), (is_parsed(nt, i, j, nts, enders, states)));\n };\n BgL_parsezd2ze3treesz31 = function (parse, nt, i, j) {\n var BgL_sc_derivzd2treesza2_132z70;\n var states;\n var toks;\n var names;\n var steps;\n var enders;\n var nts;\n return ((nts = (parse[(0)])), (enders = (parse[(2)])), (steps = (parse[(4)])), (names = (parse[(5)])), (toks = (parse[(6)])), (states = (parse[(7)])), (BgL_sc_derivzd2treesza2_132z70 = (parse[(9)])), (BgL_sc_derivzd2treesza2_132z70(nt, i, j, nts, enders, steps, names, toks, states)));\n };\n BgL_parsezd2ze3nbzd2treesze3 = function (parse, nt, i, j) {\n var BgL_sc_nbzd2derivzd2treesza2_133za2;\n var states;\n var toks;\n var steps;\n var enders;\n var nts;\n return ((nts = (parse[(0)])), (enders = (parse[(2)])), (steps = (parse[(4)])), (toks = (parse[(6)])), (states = (parse[(7)])), (BgL_sc_nbzd2derivzd2treesza2_133za2 = (parse[(10)])), (BgL_sc_nbzd2derivzd2treesza2_133za2(nt, i, j, nts, enders, steps, toks, states)));\n };\n test = function (k) {\n var x;\n var p;\n return ((p = (BgL_makezd2parserzd2(const_earley, function (l) {\n var sc_x_134;\n var tail1134;\n var L1130;\n var falseHead1133;\n {\n (falseHead1133 = (new sc_Pair(null, null)));\n (tail1134 = falseHead1133);\n (L1130 = l);\n while (!(L1130 === null)) {\n {\n (tail1134.cdr = (new sc_Pair(((sc_x_134 = (L1130.car)), (sc_list(sc_x_134, sc_x_134))), null)));\n (tail1134 = (tail1134.cdr));\n (L1130 = (L1130.cdr));\n }\n }\n return (falseHead1133.cdr);\n }\n }))), (x = (p((sc_vector2list((sc_makeVector(k, \"\\u1E9Ca\"))))))), (sc_length((BgL_parsezd2ze3treesz31(x, \"\\u1E9Cs\", (0), k)))));\n };\n BgL_earleyzd2benchmarkzd2 = function () {\n var args = null;\n for (var sc_tmp = arguments.length - 1; sc_tmp >= 0; sc_tmp--) {\n args = sc_cons(arguments[sc_tmp], args);\n }\n var k;\n return ((k = ((args === null) ? (7) : (args.car))), (BgL_runzd2benchmarkzd2(\"earley\", (1), function () {\n return (test(k));\n }, function (result) {\n return ((sc_display(result)), (sc_newline()), result == 132);\n })));\n };\n}\n\n\n/************* END OF GENERATED CODE *************/\n// Invoke this function to run a benchmark.\n// The first argument is a string identifying the benchmark.\n// The second argument is the number of times to run the benchmark.\n// The third argument is a function that runs the benchmark.\n// The fourth argument is a unary function that warns if the result\n// returned by the benchmark is incorrect.\n//\n// Example:\n// RunBenchmark(\"new Array()\",\n// 1,\n// function () { new Array(1000000); }\n// function (v) {\n// return (v instanceof Array) && (v.length == 1000000);\n// });\n\nSC_DEFAULT_OUT = new sc_GenericOutputPort(function (s) {\n});\nSC_ERROR_OUT = SC_DEFAULT_OUT;\n\nfunction RunBenchmark(name, count, run, warn) {\n for (var n = 0; n < count; ++n) {\n var result = run();\n if (!warn(result)) {\n throw new Error(\"Earley or Boyer did incorrect number of rewrites\");\n }\n }\n}\n\nvar BgL_runzd2benchmarkzd2 = RunBenchmark;\n\nvar EarleyBoyer = new BenchmarkSuite('EarleyBoyer', 666463, [\n new Benchmark(\"Earley\", function () {\n BgL_earleyzd2benchmarkzd2();\n }),\n new Benchmark(\"Boyer\", function () {\n BgL_nboyerzd2benchmarkzd2();\n })\n]);\n\n/* run_harness.js */\nvar print = console.log;\n\nfunction Run() {\n BenchmarkSuite.RunSuites({\n NotifyStep: ShowProgress,\n NotifyError: AddError,\n NotifyResult: AddResult,\n NotifyScore: AddScore,\n });\n}\n\nvar harnessErrorCount = 0;\n\nfunction ShowProgress(name) {\n print(\"PROGRESS\", name);\n}\n\nfunction AddError(name, error) {\n print(\"ERROR\", name, error);\n print(error.stack);\n harnessErrorCount++;\n}\n\nfunction AddResult(name, result) {\n print(\"RESULT\", name, result);\n}\n\nfunction AddScore(score) {\n print(\"SCORE\", score);\n}\n\nfunction main() {\n Run();\n}\n" }, { "path": "benches/scripts/v8-benches/navier-stokes.js", "content": "\"use strict\";\n\"use strip\";\n// Copyright 2012 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Simple framework for running the benchmark suites and\n// computing a score based on the timing measurements.\n\n\n// A benchmark has a name (string) and a function that will be run to\n// do the performance measurement. The optional setup and tearDown\n// arguments are functions that will be invoked before and after\n// running the benchmark, but the running time of these functions will\n// not be accounted for in the benchmark score.\nfunction Benchmark(name, run, setup, tearDown) {\n this.name = name;\n this.run = run;\n this.Setup = setup ? setup : function () {\n };\n this.TearDown = tearDown ? tearDown : function () {\n };\n}\n\n\n// Benchmark results hold the benchmark and the measured time used to\n// run the benchmark. The benchmark score is computed later once a\n// full benchmark suite has run to completion.\nfunction BenchmarkResult(benchmark, time) {\n this.benchmark = benchmark;\n this.time = time;\n}\n\n\n// Automatically convert results to numbers. Used by the geometric\n// mean computation.\nBenchmarkResult.prototype.valueOf = function () {\n return this.time;\n};\n\n\n// Suites of benchmarks consist of a name and the set of benchmarks in\n// addition to the reference timing that the final score will be based\n// on. This way, all scores are relative to a reference run and higher\n// scores implies better performance.\nfunction BenchmarkSuite(name, reference, benchmarks) {\n this.name = name;\n this.reference = reference;\n this.benchmarks = benchmarks;\n BenchmarkSuite.suites.push(this);\n}\n\n\n// Keep track of all declared benchmark suites.\nBenchmarkSuite.suites = [];\n\n\n// Scores are not comparable across versions. Bump the version if\n// you're making changes that will affect that scores, e.g. if you add\n// a new benchmark or change an existing one.\nBenchmarkSuite.version = '7';\n\n\n// To make the benchmark results predictable, we replace Math.random\n// with a 100% deterministic alternative.\nMath.random = (function () {\n var seed = 49734321;\n return function () {\n // Robert Jenkins' 32 bit integer hash function.\n seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff;\n seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff;\n seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff;\n seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff;\n seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff;\n seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff;\n return (seed & 0xfffffff) / 0x10000000;\n };\n})();\n\n\n// Runs all registered benchmark suites and optionally yields between\n// each individual benchmark to avoid running for too long in the\n// context of browsers. Once done, the final score is reported to the\n// runner.\nBenchmarkSuite.RunSuites = function (runner) {\n var continuation = null;\n var suites = BenchmarkSuite.suites;\n var length = suites.length;\n BenchmarkSuite.scores = [];\n var index = 0;\n\n function RunStep() {\n while (continuation || index < length) {\n if (continuation) {\n continuation = continuation();\n } else {\n var suite = suites[index++];\n if (runner.NotifyStart) runner.NotifyStart(suite.name);\n continuation = suite.RunStep(runner);\n }\n if (continuation && typeof window != 'undefined' && window.setTimeout) {\n window.setTimeout(RunStep, 25);\n return;\n }\n }\n if (runner.NotifyScore) {\n var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores);\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n runner.NotifyScore(formatted);\n }\n }\n\n RunStep();\n};\n\n\n// Counts the total number of registered benchmarks. Useful for\n// showing progress as a percentage.\nBenchmarkSuite.CountBenchmarks = function () {\n var result = 0;\n var suites = BenchmarkSuite.suites;\n for (var i = 0; i < suites.length; i++) {\n result += suites[i].benchmarks.length;\n }\n return result;\n};\n\n\n// Computes the geometric mean of a set of numbers.\nBenchmarkSuite.GeometricMean = function (numbers) {\n var log = 0;\n for (var i = 0; i < numbers.length; i++) {\n log += Math.log(numbers[i]);\n }\n return Math.pow(Math.E, log / numbers.length);\n};\n\n\n// Converts a score value to a string with at least three significant\n// digits.\nBenchmarkSuite.FormatScore = function (value) {\n if (value > 100) {\n return value.toFixed(0);\n } else {\n return value.toPrecision(3);\n }\n};\n\n// Notifies the runner that we're done running a single benchmark in\n// the benchmark suite. This can be useful to report progress.\nBenchmarkSuite.prototype.NotifyStep = function (result) {\n this.results.push(result);\n if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name);\n};\n\n\n// Notifies the runner that we're done with running a suite and that\n// we have a result which can be reported to the user if needed.\nBenchmarkSuite.prototype.NotifyResult = function () {\n var mean = BenchmarkSuite.GeometricMean(this.results);\n var score = this.reference / mean;\n BenchmarkSuite.scores.push(score);\n if (this.runner.NotifyResult) {\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n this.runner.NotifyResult(this.name, formatted);\n }\n};\n\n\n// Notifies the runner that running a benchmark resulted in an error.\nBenchmarkSuite.prototype.NotifyError = function (error) {\n if (this.runner.NotifyError) {\n this.runner.NotifyError(this.name, error);\n }\n if (this.runner.NotifyStep) {\n this.runner.NotifyStep(this.name);\n }\n};\n\n\n// Runs a single benchmark for at least a second and computes the\n// average time it takes to run a single iteration.\nBenchmarkSuite.prototype.RunSingleBenchmark = function (benchmark, data) {\n function Measure(data) {\n var elapsed = 0;\n var start = new Date();\n for (var n = 0; elapsed < 1000; n++) {\n benchmark.run();\n elapsed = new Date() - start;\n }\n if (data != null) {\n data.runs += n;\n data.elapsed += elapsed;\n }\n }\n\n if (data == null) {\n // Measure the benchmark once for warm up and throw the result\n // away. Return a fresh data object.\n Measure(null);\n return {runs: 0, elapsed: 0};\n } else {\n Measure(data);\n // If we've run too few iterations, we continue for another second.\n if (data.runs < 32) return data;\n var usec = (data.elapsed * 1000) / data.runs;\n this.NotifyStep(new BenchmarkResult(benchmark, usec));\n return null;\n }\n};\n\n\n// This function starts running a suite, but stops between each\n// individual benchmark in the suite and returns a continuation\n// function which can be invoked to run the next benchmark. Once the\n// last benchmark has been executed, null is returned.\nBenchmarkSuite.prototype.RunStep = function (runner) {\n this.results = [];\n this.runner = runner;\n var length = this.benchmarks.length;\n var index = 0;\n var suite = this;\n var data;\n\n // Run the setup, the actual benchmark, and the tear down in three\n // separate steps to allow the framework to yield between any of the\n // steps.\n\n function RunNextSetup() {\n if (index < length) {\n try {\n suite.benchmarks[index].Setup();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextBenchmark;\n }\n suite.NotifyResult();\n return null;\n }\n\n function RunNextBenchmark() {\n try {\n data = suite.RunSingleBenchmark(suite.benchmarks[index], data);\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n // If data is null, we're done with this benchmark.\n return (data == null) ? RunNextTearDown : RunNextBenchmark();\n }\n\n function RunNextTearDown() {\n try {\n suite.benchmarks[index++].TearDown();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextSetup;\n }\n\n // Start out running the setup.\n return RunNextSetup();\n};\n\n/**\n * Copyright 2012 the V8 project authors. All rights reserved.\n * Copyright 2009 Oliver Hunt \n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n */\n\nvar solver = null;\n\nfunction runNavierStokes() {\n solver.update();\n}\n\nfunction setupNavierStokes() {\n solver = new FluidField(null);\n solver.setResolution(128, 128);\n solver.setIterations(20);\n solver.setDisplayFunction(function () {\n });\n solver.setUICallback(prepareFrame);\n solver.reset();\n}\n\nfunction tearDownNavierStokes() {\n solver = null;\n}\n\nfunction addPoints(field) {\n var n = 64;\n for (var i = 1; i <= n; i++) {\n field.setVelocity(i, i, n, n);\n field.setDensity(i, i, 5);\n field.setVelocity(i, n - i, -n, -n);\n field.setDensity(i, n - i, 20);\n field.setVelocity(128 - i, n + i, -n, -n);\n field.setDensity(128 - i, n + i, 30);\n }\n}\n\nvar framesTillAddingPoints = 0;\nvar framesBetweenAddingPoints = 5;\n\nfunction prepareFrame(field) {\n if (framesTillAddingPoints == 0) {\n addPoints(field);\n framesTillAddingPoints = framesBetweenAddingPoints;\n framesBetweenAddingPoints++;\n } else {\n framesTillAddingPoints--;\n }\n}\n\n// Code from Oliver Hunt (http://nerget.com/fluidSim/pressure.js) starts here.\nfunction FluidField(canvas) {\n function addFields(x, s, dt) {\n for (var i = 0; i < size; i++) x[i] += dt * s[i];\n }\n\n function set_bnd(b, x) {\n if (b === 1) {\n for (var i = 1; i <= width; i++) {\n x[i] = x[i + rowSize];\n x[i + (height + 1) * rowSize] = x[i + height * rowSize];\n }\n\n for (var j = 1; i <= height; i++) {\n x[j * rowSize] = -x[1 + j * rowSize];\n x[(width + 1) + j * rowSize] = -x[width + j * rowSize];\n }\n } else if (b === 2) {\n for (var i = 1; i <= width; i++) {\n x[i] = -x[i + rowSize];\n x[i + (height + 1) * rowSize] = -x[i + height * rowSize];\n }\n\n for (var j = 1; j <= height; j++) {\n x[j * rowSize] = x[1 + j * rowSize];\n x[(width + 1) + j * rowSize] = x[width + j * rowSize];\n }\n } else {\n for (var i = 1; i <= width; i++) {\n x[i] = x[i + rowSize];\n x[i + (height + 1) * rowSize] = x[i + height * rowSize];\n }\n\n for (var j = 1; j <= height; j++) {\n x[j * rowSize] = x[1 + j * rowSize];\n x[(width + 1) + j * rowSize] = x[width + j * rowSize];\n }\n }\n var maxEdge = (height + 1) * rowSize;\n x[0] = 0.5 * (x[1] + x[rowSize]);\n x[maxEdge] = 0.5 * (x[1 + maxEdge] + x[height * rowSize]);\n x[(width + 1)] = 0.5 * (x[width] + x[(width + 1) + rowSize]);\n x[(width + 1) + maxEdge] = 0.5 * (x[width + maxEdge] + x[(width + 1) + height * rowSize]);\n }\n\n function lin_solve(b, x, x0, a, c) {\n if (a === 0 && c === 1) {\n for (var j = 1; j <= height; j++) {\n var currentRow = j * rowSize;\n ++currentRow;\n for (var i = 0; i < width; i++) {\n x[currentRow] = x0[currentRow];\n ++currentRow;\n }\n }\n set_bnd(b, x);\n } else {\n var invC = 1 / c;\n for (var k = 0; k < iterations; k++) {\n for (var j = 1; j <= height; j++) {\n var lastRow = (j - 1) * rowSize;\n var currentRow = j * rowSize;\n var nextRow = (j + 1) * rowSize;\n var lastX = x[currentRow];\n ++currentRow;\n for (var i = 1; i <= width; i++)\n lastX = x[currentRow] = (x0[currentRow] + a * (lastX + x[++currentRow] + x[++lastRow] + x[++nextRow])) * invC;\n }\n set_bnd(b, x);\n }\n }\n }\n\n function diffuse(b, x, x0, dt) {\n var a = 0;\n lin_solve(b, x, x0, a, 1 + 4 * a);\n }\n\n function lin_solve2(x, x0, y, y0, a, c) {\n if (a === 0 && c === 1) {\n for (var j = 1; j <= height; j++) {\n var currentRow = j * rowSize;\n ++currentRow;\n for (var i = 0; i < width; i++) {\n x[currentRow] = x0[currentRow];\n y[currentRow] = y0[currentRow];\n ++currentRow;\n }\n }\n set_bnd(1, x);\n set_bnd(2, y);\n } else {\n var invC = 1 / c;\n for (var k = 0; k < iterations; k++) {\n for (var j = 1; j <= height; j++) {\n var lastRow = (j - 1) * rowSize;\n var currentRow = j * rowSize;\n var nextRow = (j + 1) * rowSize;\n var lastX = x[currentRow];\n var lastY = y[currentRow];\n ++currentRow;\n for (var i = 1; i <= width; i++) {\n lastX = x[currentRow] = (x0[currentRow] + a * (lastX + x[currentRow] + x[lastRow] + x[nextRow])) * invC;\n lastY = y[currentRow] = (y0[currentRow] + a * (lastY + y[++currentRow] + y[++lastRow] + y[++nextRow])) * invC;\n }\n }\n set_bnd(1, x);\n set_bnd(2, y);\n }\n }\n }\n\n function diffuse2(x, x0, y, y0, dt) {\n var a = 0;\n lin_solve2(x, x0, y, y0, a, 1 + 4 * a);\n }\n\n function advect(b, d, d0, u, v, dt) {\n var Wdt0 = dt * width;\n var Hdt0 = dt * height;\n var Wp5 = width + 0.5;\n var Hp5 = height + 0.5;\n for (var j = 1; j <= height; j++) {\n var pos = j * rowSize;\n for (var i = 1; i <= width; i++) {\n var x = i - Wdt0 * u[++pos];\n var y = j - Hdt0 * v[pos];\n if (x < 0.5)\n x = 0.5;\n else if (x > Wp5)\n x = Wp5;\n var i0 = x | 0;\n var i1 = i0 + 1;\n if (y < 0.5)\n y = 0.5;\n else if (y > Hp5)\n y = Hp5;\n var j0 = y | 0;\n var j1 = j0 + 1;\n var s1 = x - i0;\n var s0 = 1 - s1;\n var t1 = y - j0;\n var t0 = 1 - t1;\n var row1 = j0 * rowSize;\n var row2 = j1 * rowSize;\n d[pos] = s0 * (t0 * d0[i0 + row1] + t1 * d0[i0 + row2]) + s1 * (t0 * d0[i1 + row1] + t1 * d0[i1 + row2]);\n }\n }\n set_bnd(b, d);\n }\n\n function project(u, v, p, div) {\n var h = -0.5 / Math.sqrt(width * height);\n for (var j = 1; j <= height; j++) {\n var row = j * rowSize;\n var previousRow = (j - 1) * rowSize;\n var prevValue = row - 1;\n var currentRow = row;\n var nextValue = row + 1;\n var nextRow = (j + 1) * rowSize;\n for (var i = 1; i <= width; i++) {\n div[++currentRow] = h * (u[++nextValue] - u[++prevValue] + v[++nextRow] - v[++previousRow]);\n p[currentRow] = 0;\n }\n }\n set_bnd(0, div);\n set_bnd(0, p);\n\n lin_solve(0, p, div, 1, 4);\n var wScale = 0.5 * width;\n var hScale = 0.5 * height;\n for (var j = 1; j <= height; j++) {\n var prevPos = j * rowSize - 1;\n var currentPos = j * rowSize;\n var nextPos = j * rowSize + 1;\n var prevRow = (j - 1) * rowSize;\n var currentRow = j * rowSize;\n var nextRow = (j + 1) * rowSize;\n\n for (var i = 1; i <= width; i++) {\n u[++currentPos] -= wScale * (p[++nextPos] - p[++prevPos]);\n v[currentPos] -= hScale * (p[++nextRow] - p[++prevRow]);\n }\n }\n set_bnd(1, u);\n set_bnd(2, v);\n }\n\n function dens_step(x, x0, u, v, dt) {\n addFields(x, x0, dt);\n diffuse(0, x0, x, dt);\n advect(0, x, x0, u, v, dt);\n }\n\n function vel_step(u, v, u0, v0, dt) {\n addFields(u, u0, dt);\n addFields(v, v0, dt);\n var temp = u0;\n u0 = u;\n u = temp;\n var temp = v0;\n v0 = v;\n v = temp;\n diffuse2(u, u0, v, v0, dt);\n project(u, v, u0, v0);\n var temp = u0;\n u0 = u;\n u = temp;\n var temp = v0;\n v0 = v;\n v = temp;\n advect(1, u, u0, u0, v0, dt);\n advect(2, v, v0, u0, v0, dt);\n project(u, v, u0, v0);\n }\n\n var uiCallback = function (d, u, v) {\n };\n\n function Field(dens, u, v) {\n // Just exposing the fields here rather than using accessors is a measurable win during display (maybe 5%)\n // but makes the code ugly.\n this.setDensity = function (x, y, d) {\n dens[(x + 1) + (y + 1) * rowSize] = d;\n }\n this.getDensity = function (x, y) {\n return dens[(x + 1) + (y + 1) * rowSize];\n }\n this.setVelocity = function (x, y, xv, yv) {\n u[(x + 1) + (y + 1) * rowSize] = xv;\n v[(x + 1) + (y + 1) * rowSize] = yv;\n }\n this.getXVelocity = function (x, y) {\n return u[(x + 1) + (y + 1) * rowSize];\n }\n this.getYVelocity = function (x, y) {\n return v[(x + 1) + (y + 1) * rowSize];\n }\n this.width = function () {\n return width;\n }\n this.height = function () {\n return height;\n }\n }\n\n function queryUI(d, u, v) {\n for (var i = 0; i < size; i++)\n u[i] = v[i] = d[i] = 0.0;\n uiCallback(new Field(d, u, v));\n }\n\n this.update = function () {\n queryUI(dens_prev, u_prev, v_prev);\n vel_step(u, v, u_prev, v_prev, dt);\n dens_step(dens, dens_prev, u, v, dt);\n displayFunc(new Field(dens, u, v));\n }\n this.setDisplayFunction = function (func) {\n displayFunc = func;\n }\n\n this.iterations = function () {\n return iterations;\n }\n this.setIterations = function (iters) {\n if (iters > 0 && iters <= 100)\n iterations = iters;\n }\n this.setUICallback = function (callback) {\n uiCallback = callback;\n }\n var iterations = 10;\n var visc = 0.5;\n var dt = 0.1;\n var dens;\n var dens_prev;\n var u;\n var u_prev;\n var v;\n var v_prev;\n var width;\n var height;\n var rowSize;\n var size;\n var displayFunc;\n\n function reset() {\n rowSize = width + 2;\n size = (width + 2) * (height + 2);\n dens = new Array(size);\n dens_prev = new Array(size);\n u = new Array(size);\n u_prev = new Array(size);\n v = new Array(size);\n v_prev = new Array(size);\n for (var i = 0; i < size; i++)\n dens_prev[i] = u_prev[i] = v_prev[i] = dens[i] = u[i] = v[i] = 0;\n }\n\n this.reset = reset;\n this.setResolution = function (hRes, wRes) {\n var res = wRes * hRes;\n if (res > 0 && res < 1000000 && (wRes != width || hRes != height)) {\n width = wRes;\n height = hRes;\n reset();\n return true;\n }\n return false;\n }\n this.setResolution(64, 64);\n}\n\nvar NavierStokes = new BenchmarkSuite('NavierStokes', 1484000,\n [new Benchmark('NavierStokes',\n runNavierStokes,\n setupNavierStokes,\n tearDownNavierStokes)]);\n\n\n/* run_harness.js */\nvar print = console.log;\n\nfunction Run() {\n BenchmarkSuite.RunSuites({\n NotifyStep: ShowProgress,\n NotifyError: AddError,\n NotifyResult: AddResult,\n NotifyScore: AddScore,\n });\n}\n\nvar harnessErrorCount = 0;\n\nfunction ShowProgress(name) {\n print(\"PROGRESS\", name);\n}\n\nfunction AddError(name, error) {\n print(\"ERROR\", name, error);\n print(error.stack);\n harnessErrorCount++;\n}\n\nfunction AddResult(name, result) {\n print(\"RESULT\", name, result);\n}\n\nfunction AddScore(score) {\n print(\"SCORE\", score);\n}\n\nfunction main() {\n Run();\n}\n" }, { "path": "benches/scripts/v8-benches/raytrace.js", "content": "\"use strict\";\n\"use strip\";\n// Copyright 2012 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Simple framework for running the benchmark suites and\n// computing a score based on the timing measurements.\n\n\n// A benchmark has a name (string) and a function that will be run to\n// do the performance measurement. The optional setup and tearDown\n// arguments are functions that will be invoked before and after\n// running the benchmark, but the running time of these functions will\n// not be accounted for in the benchmark score.\nfunction Benchmark(name, run, setup, tearDown) {\n this.name = name;\n this.run = run;\n this.Setup = setup ? setup : function () {\n };\n this.TearDown = tearDown ? tearDown : function () {\n };\n}\n\n\n// Benchmark results hold the benchmark and the measured time used to\n// run the benchmark. The benchmark score is computed later once a\n// full benchmark suite has run to completion.\nfunction BenchmarkResult(benchmark, time) {\n this.benchmark = benchmark;\n this.time = time;\n}\n\n\n// Automatically convert results to numbers. Used by the geometric\n// mean computation.\nBenchmarkResult.prototype.valueOf = function () {\n return this.time;\n};\n\n\n// Suites of benchmarks consist of a name and the set of benchmarks in\n// addition to the reference timing that the final score will be based\n// on. This way, all scores are relative to a reference run and higher\n// scores implies better performance.\nfunction BenchmarkSuite(name, reference, benchmarks) {\n this.name = name;\n this.reference = reference;\n this.benchmarks = benchmarks;\n BenchmarkSuite.suites.push(this);\n}\n\n\n// Keep track of all declared benchmark suites.\nBenchmarkSuite.suites = [];\n\n\n// Scores are not comparable across versions. Bump the version if\n// you're making changes that will affect that scores, e.g. if you add\n// a new benchmark or change an existing one.\nBenchmarkSuite.version = '7';\n\n\n// To make the benchmark results predictable, we replace Math.random\n// with a 100% deterministic alternative.\nMath.random = (function () {\n var seed = 49734321;\n return function () {\n // Robert Jenkins' 32 bit integer hash function.\n seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff;\n seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff;\n seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff;\n seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff;\n seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff;\n seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff;\n return (seed & 0xfffffff) / 0x10000000;\n };\n})();\n\n\n// Runs all registered benchmark suites and optionally yields between\n// each individual benchmark to avoid running for too long in the\n// context of browsers. Once done, the final score is reported to the\n// runner.\nBenchmarkSuite.RunSuites = function (runner) {\n var continuation = null;\n var suites = BenchmarkSuite.suites;\n var length = suites.length;\n BenchmarkSuite.scores = [];\n var index = 0;\n\n function RunStep() {\n while (continuation || index < length) {\n if (continuation) {\n continuation = continuation();\n } else {\n var suite = suites[index++];\n if (runner.NotifyStart) runner.NotifyStart(suite.name);\n continuation = suite.RunStep(runner);\n }\n if (continuation && typeof window != 'undefined' && window.setTimeout) {\n window.setTimeout(RunStep, 25);\n return;\n }\n }\n if (runner.NotifyScore) {\n var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores);\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n runner.NotifyScore(formatted);\n }\n }\n\n RunStep();\n};\n\n\n// Counts the total number of registered benchmarks. Useful for\n// showing progress as a percentage.\nBenchmarkSuite.CountBenchmarks = function () {\n var result = 0;\n var suites = BenchmarkSuite.suites;\n for (var i = 0; i < suites.length; i++) {\n result += suites[i].benchmarks.length;\n }\n return result;\n};\n\n\n// Computes the geometric mean of a set of numbers.\nBenchmarkSuite.GeometricMean = function (numbers) {\n var log = 0;\n for (var i = 0; i < numbers.length; i++) {\n log += Math.log(numbers[i]);\n }\n return Math.pow(Math.E, log / numbers.length);\n};\n\n\n// Converts a score value to a string with at least three significant\n// digits.\nBenchmarkSuite.FormatScore = function (value) {\n if (value > 100) {\n return value.toFixed(0);\n } else {\n return value.toPrecision(3);\n }\n};\n\n// Notifies the runner that we're done running a single benchmark in\n// the benchmark suite. This can be useful to report progress.\nBenchmarkSuite.prototype.NotifyStep = function (result) {\n this.results.push(result);\n if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name);\n};\n\n\n// Notifies the runner that we're done with running a suite and that\n// we have a result which can be reported to the user if needed.\nBenchmarkSuite.prototype.NotifyResult = function () {\n var mean = BenchmarkSuite.GeometricMean(this.results);\n var score = this.reference / mean;\n BenchmarkSuite.scores.push(score);\n if (this.runner.NotifyResult) {\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n this.runner.NotifyResult(this.name, formatted);\n }\n};\n\n\n// Notifies the runner that running a benchmark resulted in an error.\nBenchmarkSuite.prototype.NotifyError = function (error) {\n if (this.runner.NotifyError) {\n this.runner.NotifyError(this.name, error);\n }\n if (this.runner.NotifyStep) {\n this.runner.NotifyStep(this.name);\n }\n};\n\n\n// Runs a single benchmark for at least a second and computes the\n// average time it takes to run a single iteration.\nBenchmarkSuite.prototype.RunSingleBenchmark = function (benchmark, data) {\n function Measure(data) {\n var elapsed = 0;\n var start = new Date();\n for (var n = 0; elapsed < 1000; n++) {\n benchmark.run();\n elapsed = new Date() - start;\n }\n if (data != null) {\n data.runs += n;\n data.elapsed += elapsed;\n }\n }\n\n if (data == null) {\n // Measure the benchmark once for warm up and throw the result\n // away. Return a fresh data object.\n Measure(null);\n return {runs: 0, elapsed: 0};\n } else {\n Measure(data);\n // If we've run too few iterations, we continue for another second.\n if (data.runs < 32) return data;\n var usec = (data.elapsed * 1000) / data.runs;\n this.NotifyStep(new BenchmarkResult(benchmark, usec));\n return null;\n }\n};\n\n\n// This function starts running a suite, but stops between each\n// individual benchmark in the suite and returns a continuation\n// function which can be invoked to run the next benchmark. Once the\n// last benchmark has been executed, null is returned.\nBenchmarkSuite.prototype.RunStep = function (runner) {\n this.results = [];\n this.runner = runner;\n var length = this.benchmarks.length;\n var index = 0;\n var suite = this;\n var data;\n\n // Run the setup, the actual benchmark, and the tear down in three\n // separate steps to allow the framework to yield between any of the\n // steps.\n\n function RunNextSetup() {\n if (index < length) {\n try {\n suite.benchmarks[index].Setup();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextBenchmark;\n }\n suite.NotifyResult();\n return null;\n }\n\n function RunNextBenchmark() {\n try {\n data = suite.RunSingleBenchmark(suite.benchmarks[index], data);\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n // If data is null, we're done with this benchmark.\n return (data == null) ? RunNextTearDown : RunNextBenchmark();\n }\n\n function RunNextTearDown() {\n try {\n suite.benchmarks[index++].TearDown();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextSetup;\n }\n\n // Start out running the setup.\n return RunNextSetup();\n};\n\n// The ray tracer code in this file is written by Adam Burmister. It\n// is available in its original form from:\n//\n// http://labs.flog.nz.co/raytracer/\n//\n// It has been modified slightly by Google to work as a standalone\n// benchmark, but the all the computational code remains\n// untouched. This file also contains a copy of parts of the Prototype\n// JavaScript framework which is used by the ray tracer.\n\n// Variable used to hold a number that can be used to verify that\n// the scene was ray traced correctly.\nvar checkNumber;\n\n\n// ------------------------------------------------------------------------\n// ------------------------------------------------------------------------\n\n// The following is a copy of parts of the Prototype JavaScript library:\n\n// Prototype JavaScript framework, version 1.5.0\n// (c) 2005-2007 Sam Stephenson\n//\n// Prototype is freely distributable under the terms of an MIT-style license.\n// For details, see the Prototype web site: http://prototype.conio.net/\n\nvar Class = {\n create: function () {\n return function () {\n this.initialize.apply(this, arguments);\n }\n }\n};\n\n\nObject.extend = function (destination, source) {\n for (var property in source) {\n destination[property] = source[property];\n }\n return destination;\n};\n\n\n// ------------------------------------------------------------------------\n// ------------------------------------------------------------------------\n\n// The rest of this file is the actual ray tracer written by Adam\n// Burmister. It's a concatenation of the following files:\n//\n// flog/color.js\n// flog/light.js\n// flog/vector.js\n// flog/ray.js\n// flog/scene.js\n// flog/material/basematerial.js\n// flog/material/solid.js\n// flog/material/chessboard.js\n// flog/shape/baseshape.js\n// flog/shape/sphere.js\n// flog/shape/plane.js\n// flog/intersectioninfo.js\n// flog/camera.js\n// flog/background.js\n// flog/engine.js\n\n\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Color = Class.create();\n\nFlog.RayTracer.Color.prototype = {\n red: 0.0,\n green: 0.0,\n blue: 0.0,\n\n initialize: function (r, g, b) {\n if (!r) r = 0.0;\n if (!g) g = 0.0;\n if (!b) b = 0.0;\n\n this.red = r;\n this.green = g;\n this.blue = b;\n },\n\n add: function (c1, c2) {\n var result = new Flog.RayTracer.Color(0, 0, 0);\n\n result.red = c1.red + c2.red;\n result.green = c1.green + c2.green;\n result.blue = c1.blue + c2.blue;\n\n return result;\n },\n\n addScalar: function (c1, s) {\n var result = new Flog.RayTracer.Color(0, 0, 0);\n\n result.red = c1.red + s;\n result.green = c1.green + s;\n result.blue = c1.blue + s;\n\n result.limit();\n\n return result;\n },\n\n subtract: function (c1, c2) {\n var result = new Flog.RayTracer.Color(0, 0, 0);\n\n result.red = c1.red - c2.red;\n result.green = c1.green - c2.green;\n result.blue = c1.blue - c2.blue;\n\n return result;\n },\n\n multiply: function (c1, c2) {\n var result = new Flog.RayTracer.Color(0, 0, 0);\n\n result.red = c1.red * c2.red;\n result.green = c1.green * c2.green;\n result.blue = c1.blue * c2.blue;\n\n return result;\n },\n\n multiplyScalar: function (c1, f) {\n var result = new Flog.RayTracer.Color(0, 0, 0);\n\n result.red = c1.red * f;\n result.green = c1.green * f;\n result.blue = c1.blue * f;\n\n return result;\n },\n\n divideFactor: function (c1, f) {\n var result = new Flog.RayTracer.Color(0, 0, 0);\n\n result.red = c1.red / f;\n result.green = c1.green / f;\n result.blue = c1.blue / f;\n\n return result;\n },\n\n limit: function () {\n this.red = (this.red > 0.0) ? ((this.red > 1.0) ? 1.0 : this.red) : 0.0;\n this.green = (this.green > 0.0) ? ((this.green > 1.0) ? 1.0 : this.green) : 0.0;\n this.blue = (this.blue > 0.0) ? ((this.blue > 1.0) ? 1.0 : this.blue) : 0.0;\n },\n\n distance: function (color) {\n var d = Math.abs(this.red - color.red) + Math.abs(this.green - color.green) + Math.abs(this.blue - color.blue);\n return d;\n },\n\n blend: function (c1, c2, w) {\n var result = new Flog.RayTracer.Color(0, 0, 0);\n result = Flog.RayTracer.Color.prototype.add(\n Flog.RayTracer.Color.prototype.multiplyScalar(c1, 1 - w),\n Flog.RayTracer.Color.prototype.multiplyScalar(c2, w)\n );\n return result;\n },\n\n brightness: function () {\n var r = Math.floor(this.red * 255);\n var g = Math.floor(this.green * 255);\n var b = Math.floor(this.blue * 255);\n return (r * 77 + g * 150 + b * 29) >> 8;\n },\n\n toString: function () {\n var r = Math.floor(this.red * 255);\n var g = Math.floor(this.green * 255);\n var b = Math.floor(this.blue * 255);\n\n return \"rgb(\" + r + \",\" + g + \",\" + b + \")\";\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Light = Class.create();\n\nFlog.RayTracer.Light.prototype = {\n position: null,\n color: null,\n intensity: 10.0,\n\n initialize: function (pos, color, intensity) {\n this.position = pos;\n this.color = color;\n this.intensity = (intensity ? intensity : 10.0);\n },\n\n toString: function () {\n return 'Light [' + this.position.x + ',' + this.position.y + ',' + this.position.z + ']';\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Vector = Class.create();\n\nFlog.RayTracer.Vector.prototype = {\n x: 0.0,\n y: 0.0,\n z: 0.0,\n\n initialize: function (x, y, z) {\n this.x = (x ? x : 0);\n this.y = (y ? y : 0);\n this.z = (z ? z : 0);\n },\n\n copy: function (vector) {\n this.x = vector.x;\n this.y = vector.y;\n this.z = vector.z;\n },\n\n normalize: function () {\n var m = this.magnitude();\n return new Flog.RayTracer.Vector(this.x / m, this.y / m, this.z / m);\n },\n\n magnitude: function () {\n return Math.sqrt((this.x * this.x) + (this.y * this.y) + (this.z * this.z));\n },\n\n cross: function (w) {\n return new Flog.RayTracer.Vector(\n -this.z * w.y + this.y * w.z,\n this.z * w.x - this.x * w.z,\n -this.y * w.x + this.x * w.y);\n },\n\n dot: function (w) {\n return this.x * w.x + this.y * w.y + this.z * w.z;\n },\n\n add: function (v, w) {\n return new Flog.RayTracer.Vector(w.x + v.x, w.y + v.y, w.z + v.z);\n },\n\n subtract: function (v, w) {\n if (!w || !v) throw 'Vectors must be defined [' + v + ',' + w + ']';\n return new Flog.RayTracer.Vector(v.x - w.x, v.y - w.y, v.z - w.z);\n },\n\n multiplyVector: function (v, w) {\n return new Flog.RayTracer.Vector(v.x * w.x, v.y * w.y, v.z * w.z);\n },\n\n multiplyScalar: function (v, w) {\n return new Flog.RayTracer.Vector(v.x * w, v.y * w, v.z * w);\n },\n\n toString: function () {\n return 'Vector [' + this.x + ',' + this.y + ',' + this.z + ']';\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Ray = Class.create();\n\nFlog.RayTracer.Ray.prototype = {\n position: null,\n direction: null,\n initialize: function (pos, dir) {\n this.position = pos;\n this.direction = dir;\n },\n\n toString: function () {\n return 'Ray [' + this.position + ',' + this.direction + ']';\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Scene = Class.create();\n\nFlog.RayTracer.Scene.prototype = {\n camera: null,\n shapes: [],\n lights: [],\n background: null,\n\n initialize: function () {\n this.camera = new Flog.RayTracer.Camera(\n new Flog.RayTracer.Vector(0, 0, -5),\n new Flog.RayTracer.Vector(0, 0, 1),\n new Flog.RayTracer.Vector(0, 1, 0)\n );\n this.shapes = new Array();\n this.lights = new Array();\n this.background = new Flog.RayTracer.Background(new Flog.RayTracer.Color(0, 0, 0.5), 0.2);\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\nif (typeof (Flog.RayTracer.Material) == 'undefined') Flog.RayTracer.Material = {};\n\nFlog.RayTracer.Material.BaseMaterial = Class.create();\n\nFlog.RayTracer.Material.BaseMaterial.prototype = {\n\n gloss: 2.0, // [0...infinity] 0 = matt\n transparency: 0.0, // 0=opaque\n reflection: 0.0, // [0...infinity] 0 = no reflection\n refraction: 0.50,\n hasTexture: false,\n\n initialize: function () {\n\n },\n\n getColor: function (u, v) {\n\n },\n\n wrapUp: function (t) {\n t = t % 2.0;\n if (t < -1) t += 2.0;\n if (t >= 1) t -= 2.0;\n return t;\n },\n\n toString: function () {\n return 'Material [gloss=' + this.gloss + ', transparency=' + this.transparency + ', hasTexture=' + this.hasTexture + ']';\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Material.Solid = Class.create();\n\nFlog.RayTracer.Material.Solid.prototype = Object.extend(\n new Flog.RayTracer.Material.BaseMaterial(), {\n initialize: function (color, reflection, refraction, transparency, gloss) {\n this.color = color;\n this.reflection = reflection;\n this.transparency = transparency;\n this.gloss = gloss;\n this.hasTexture = false;\n },\n\n getColor: function (u, v) {\n return this.color;\n },\n\n toString: function () {\n return 'SolidMaterial [gloss=' + this.gloss + ', transparency=' + this.transparency + ', hasTexture=' + this.hasTexture + ']';\n }\n }\n);\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Material.Chessboard = Class.create();\n\nFlog.RayTracer.Material.Chessboard.prototype = Object.extend(\n new Flog.RayTracer.Material.BaseMaterial(), {\n colorEven: null,\n colorOdd: null,\n density: 0.5,\n\n initialize: function (colorEven, colorOdd, reflection, transparency, gloss, density) {\n this.colorEven = colorEven;\n this.colorOdd = colorOdd;\n this.reflection = reflection;\n this.transparency = transparency;\n this.gloss = gloss;\n this.density = density;\n this.hasTexture = true;\n },\n\n getColor: function (u, v) {\n var t = this.wrapUp(u * this.density) * this.wrapUp(v * this.density);\n\n if (t < 0.0)\n return this.colorEven;\n else\n return this.colorOdd;\n },\n\n toString: function () {\n return 'ChessMaterial [gloss=' + this.gloss + ', transparency=' + this.transparency + ', hasTexture=' + this.hasTexture + ']';\n }\n }\n);\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\nif (typeof (Flog.RayTracer.Shape) == 'undefined') Flog.RayTracer.Shape = {};\n\nFlog.RayTracer.Shape.Sphere = Class.create();\n\nFlog.RayTracer.Shape.Sphere.prototype = {\n initialize: function (pos, radius, material) {\n this.radius = radius;\n this.position = pos;\n this.material = material;\n },\n\n intersect: function (ray) {\n var info = new Flog.RayTracer.IntersectionInfo();\n info.shape = this;\n\n var dst = Flog.RayTracer.Vector.prototype.subtract(ray.position, this.position);\n\n var B = dst.dot(ray.direction);\n var C = dst.dot(dst) - (this.radius * this.radius);\n var D = (B * B) - C;\n\n if (D > 0) { // intersection!\n info.isHit = true;\n info.distance = (-B) - Math.sqrt(D);\n info.position = Flog.RayTracer.Vector.prototype.add(\n ray.position,\n Flog.RayTracer.Vector.prototype.multiplyScalar(\n ray.direction,\n info.distance\n )\n );\n info.normal = Flog.RayTracer.Vector.prototype.subtract(\n info.position,\n this.position\n ).normalize();\n\n info.color = this.material.getColor(0, 0);\n } else {\n info.isHit = false;\n }\n return info;\n },\n\n toString: function () {\n return 'Sphere [position=' + this.position + ', radius=' + this.radius + ']';\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\nif (typeof (Flog.RayTracer.Shape) == 'undefined') Flog.RayTracer.Shape = {};\n\nFlog.RayTracer.Shape.Plane = Class.create();\n\nFlog.RayTracer.Shape.Plane.prototype = {\n d: 0.0,\n\n initialize: function (pos, d, material) {\n this.position = pos;\n this.d = d;\n this.material = material;\n },\n\n intersect: function (ray) {\n var info = new Flog.RayTracer.IntersectionInfo();\n\n var Vd = this.position.dot(ray.direction);\n if (Vd == 0) return info; // no intersection\n\n var t = -(this.position.dot(ray.position) + this.d) / Vd;\n if (t <= 0) return info;\n\n info.shape = this;\n info.isHit = true;\n info.position = Flog.RayTracer.Vector.prototype.add(\n ray.position,\n Flog.RayTracer.Vector.prototype.multiplyScalar(\n ray.direction,\n t\n )\n );\n info.normal = this.position;\n info.distance = t;\n\n if (this.material.hasTexture) {\n var vU = new Flog.RayTracer.Vector(this.position.y, this.position.z, -this.position.x);\n var vV = vU.cross(this.position);\n var u = info.position.dot(vU);\n var v = info.position.dot(vV);\n info.color = this.material.getColor(u, v);\n } else {\n info.color = this.material.getColor(0, 0);\n }\n\n return info;\n },\n\n toString: function () {\n return 'Plane [' + this.position + ', d=' + this.d + ']';\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.IntersectionInfo = Class.create();\n\nFlog.RayTracer.IntersectionInfo.prototype = {\n isHit: false,\n hitCount: 0,\n shape: null,\n position: null,\n normal: null,\n color: null,\n distance: null,\n\n initialize: function () {\n this.color = new Flog.RayTracer.Color(0, 0, 0);\n },\n\n toString: function () {\n return 'Intersection [' + this.position + ']';\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Camera = Class.create();\n\nFlog.RayTracer.Camera.prototype = {\n position: null,\n lookAt: null,\n equator: null,\n up: null,\n screen: null,\n\n initialize: function (pos, lookAt, up) {\n this.position = pos;\n this.lookAt = lookAt;\n this.up = up;\n this.equator = lookAt.normalize().cross(this.up);\n this.screen = Flog.RayTracer.Vector.prototype.add(this.position, this.lookAt);\n },\n\n getRay: function (vx, vy) {\n var pos = Flog.RayTracer.Vector.prototype.subtract(\n this.screen,\n Flog.RayTracer.Vector.prototype.subtract(\n Flog.RayTracer.Vector.prototype.multiplyScalar(this.equator, vx),\n Flog.RayTracer.Vector.prototype.multiplyScalar(this.up, vy)\n )\n );\n pos.y = pos.y * -1;\n var dir = Flog.RayTracer.Vector.prototype.subtract(\n pos,\n this.position\n );\n\n var ray = new Flog.RayTracer.Ray(pos, dir.normalize());\n\n return ray;\n },\n\n toString: function () {\n return 'Ray []';\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Background = Class.create();\n\nFlog.RayTracer.Background.prototype = {\n color: null,\n ambience: 0.0,\n\n initialize: function (color, ambience) {\n this.color = color;\n this.ambience = ambience;\n }\n}\n/* Fake a Flog.* namespace */\nif (typeof (Flog) == 'undefined') var Flog = {};\nif (typeof (Flog.RayTracer) == 'undefined') Flog.RayTracer = {};\n\nFlog.RayTracer.Engine = Class.create();\n\nFlog.RayTracer.Engine.prototype = {\n canvas: null, /* 2d context we can render to */\n\n initialize: function (options) {\n this.options = Object.extend({\n canvasHeight: 100,\n canvasWidth: 100,\n pixelWidth: 2,\n pixelHeight: 2,\n renderDiffuse: false,\n renderShadows: false,\n renderHighlights: false,\n renderReflections: false,\n rayDepth: 2\n }, options || {});\n\n this.options.canvasHeight /= this.options.pixelHeight;\n this.options.canvasWidth /= this.options.pixelWidth;\n\n /* TODO: dynamically include other scripts */\n },\n\n setPixel: function (x, y, color) {\n var pxW, pxH;\n pxW = this.options.pixelWidth;\n pxH = this.options.pixelHeight;\n\n if (this.canvas) {\n this.canvas.fillStyle = color.toString();\n this.canvas.fillRect(x * pxW, y * pxH, pxW, pxH);\n } else {\n if (x === y) {\n checkNumber += color.brightness();\n }\n // print(x * pxW, y * pxH, pxW, pxH);\n }\n },\n\n renderScene: function (scene, canvas) {\n checkNumber = 0;\n /* Get canvas */\n if (canvas) {\n this.canvas = canvas.getContext(\"2d\");\n } else {\n this.canvas = null;\n }\n\n var canvasHeight = this.options.canvasHeight;\n var canvasWidth = this.options.canvasWidth;\n\n for (var y = 0; y < canvasHeight; y++) {\n for (var x = 0; x < canvasWidth; x++) {\n var yp = y * 1.0 / canvasHeight * 2 - 1;\n var xp = x * 1.0 / canvasWidth * 2 - 1;\n\n var ray = scene.camera.getRay(xp, yp);\n\n var color = this.getPixelColor(ray, scene);\n\n this.setPixel(x, y, color);\n }\n }\n if (checkNumber !== 2321) {\n throw new Error(\"Scene rendered incorrectly\");\n }\n },\n\n getPixelColor: function (ray, scene) {\n var info = this.testIntersection(ray, scene, null);\n if (info.isHit) {\n var color = this.rayTrace(info, ray, scene, 0);\n return color;\n }\n return scene.background.color;\n },\n\n testIntersection: function (ray, scene, exclude) {\n var hits = 0;\n var best = new Flog.RayTracer.IntersectionInfo();\n best.distance = 2000;\n\n for (var i = 0; i < scene.shapes.length; i++) {\n var shape = scene.shapes[i];\n\n if (shape != exclude) {\n var info = shape.intersect(ray);\n if (info.isHit && info.distance >= 0 && info.distance < best.distance) {\n best = info;\n hits++;\n }\n }\n }\n best.hitCount = hits;\n return best;\n },\n\n getReflectionRay: function (P, N, V) {\n var c1 = -N.dot(V);\n var R1 = Flog.RayTracer.Vector.prototype.add(\n Flog.RayTracer.Vector.prototype.multiplyScalar(N, 2 * c1),\n V\n );\n return new Flog.RayTracer.Ray(P, R1);\n },\n\n rayTrace: function (info, ray, scene, depth) {\n // Calc ambient\n var color = Flog.RayTracer.Color.prototype.multiplyScalar(info.color, scene.background.ambience);\n var oldColor = color;\n var shininess = Math.pow(10, info.shape.material.gloss + 1);\n\n for (var i = 0; i < scene.lights.length; i++) {\n var light = scene.lights[i];\n\n // Calc diffuse lighting\n var v = Flog.RayTracer.Vector.prototype.subtract(\n light.position,\n info.position\n ).normalize();\n\n if (this.options.renderDiffuse) {\n var L = v.dot(info.normal);\n if (L > 0.0) {\n color = Flog.RayTracer.Color.prototype.add(\n color,\n Flog.RayTracer.Color.prototype.multiply(\n info.color,\n Flog.RayTracer.Color.prototype.multiplyScalar(\n light.color,\n L\n )\n )\n );\n }\n }\n\n // The greater the depth the more accurate the colours, but\n // this is exponentially (!) expensive\n if (depth <= this.options.rayDepth) {\n // calculate reflection ray\n if (this.options.renderReflections && info.shape.material.reflection > 0) {\n var reflectionRay = this.getReflectionRay(info.position, info.normal, ray.direction);\n var refl = this.testIntersection(reflectionRay, scene, info.shape);\n\n if (refl.isHit && refl.distance > 0) {\n refl.color = this.rayTrace(refl, reflectionRay, scene, depth + 1);\n } else {\n refl.color = scene.background.color;\n }\n\n color = Flog.RayTracer.Color.prototype.blend(\n color,\n refl.color,\n info.shape.material.reflection\n );\n }\n\n // Refraction\n /* TODO */\n }\n\n /* Render shadows and highlights */\n\n var shadowInfo = new Flog.RayTracer.IntersectionInfo();\n\n if (this.options.renderShadows) {\n var shadowRay = new Flog.RayTracer.Ray(info.position, v);\n\n shadowInfo = this.testIntersection(shadowRay, scene, info.shape);\n if (shadowInfo.isHit && shadowInfo.shape != info.shape /*&& shadowInfo.shape.type != 'PLANE'*/) {\n var vA = Flog.RayTracer.Color.prototype.multiplyScalar(color, 0.5);\n var dB = (0.5 * Math.pow(shadowInfo.shape.material.transparency, 0.5));\n color = Flog.RayTracer.Color.prototype.addScalar(vA, dB);\n }\n }\n\n // Phong specular highlights\n if (this.options.renderHighlights && !shadowInfo.isHit && info.shape.material.gloss > 0) {\n var Lv = Flog.RayTracer.Vector.prototype.subtract(\n info.shape.position,\n light.position\n ).normalize();\n\n var E = Flog.RayTracer.Vector.prototype.subtract(\n scene.camera.position,\n info.shape.position\n ).normalize();\n\n var H = Flog.RayTracer.Vector.prototype.subtract(\n E,\n Lv\n ).normalize();\n\n var glossWeight = Math.pow(Math.max(info.normal.dot(H), 0), shininess);\n color = Flog.RayTracer.Color.prototype.add(\n Flog.RayTracer.Color.prototype.multiplyScalar(light.color, glossWeight),\n color\n );\n }\n }\n color.limit();\n return color;\n }\n};\n\n\nfunction renderScene() {\n var scene = new Flog.RayTracer.Scene();\n\n scene.camera = new Flog.RayTracer.Camera(\n new Flog.RayTracer.Vector(0, 0, -15),\n new Flog.RayTracer.Vector(-0.2, 0, 5),\n new Flog.RayTracer.Vector(0, 1, 0)\n );\n\n scene.background = new Flog.RayTracer.Background(\n new Flog.RayTracer.Color(0.5, 0.5, 0.5),\n 0.4\n );\n\n var sphere = new Flog.RayTracer.Shape.Sphere(\n new Flog.RayTracer.Vector(-1.5, 1.5, 2),\n 1.5,\n new Flog.RayTracer.Material.Solid(\n new Flog.RayTracer.Color(0, 0.5, 0.5),\n 0.3,\n 0.0,\n 0.0,\n 2.0\n )\n );\n\n var sphere1 = new Flog.RayTracer.Shape.Sphere(\n new Flog.RayTracer.Vector(1, 0.25, 1),\n 0.5,\n new Flog.RayTracer.Material.Solid(\n new Flog.RayTracer.Color(0.9, 0.9, 0.9),\n 0.1,\n 0.0,\n 0.0,\n 1.5\n )\n );\n\n var plane = new Flog.RayTracer.Shape.Plane(\n new Flog.RayTracer.Vector(0.1, 0.9, -0.5).normalize(),\n 1.2,\n new Flog.RayTracer.Material.Chessboard(\n new Flog.RayTracer.Color(1, 1, 1),\n new Flog.RayTracer.Color(0, 0, 0),\n 0.2,\n 0.0,\n 1.0,\n 0.7\n )\n );\n\n scene.shapes.push(plane);\n scene.shapes.push(sphere);\n scene.shapes.push(sphere1);\n\n var light = new Flog.RayTracer.Light(\n new Flog.RayTracer.Vector(5, 10, -1),\n new Flog.RayTracer.Color(0.8, 0.8, 0.8)\n );\n\n var light1 = new Flog.RayTracer.Light(\n new Flog.RayTracer.Vector(-3, 5, -15),\n new Flog.RayTracer.Color(0.8, 0.8, 0.8),\n 100\n );\n\n scene.lights.push(light);\n scene.lights.push(light1);\n\n var imageWidth = 100; // $F('imageWidth');\n var imageHeight = 100; // $F('imageHeight');\n var pixelSize = \"5,5\".split(','); // $F('pixelSize').split(',');\n var renderDiffuse = true; // $F('renderDiffuse');\n var renderShadows = true; // $F('renderShadows');\n var renderHighlights = true; // $F('renderHighlights');\n var renderReflections = true; // $F('renderReflections');\n var rayDepth = 2;//$F('rayDepth');\n\n var raytracer = new Flog.RayTracer.Engine(\n {\n canvasWidth: imageWidth,\n canvasHeight: imageHeight,\n pixelWidth: pixelSize[0],\n pixelHeight: pixelSize[1],\n \"renderDiffuse\": renderDiffuse,\n \"renderHighlights\": renderHighlights,\n \"renderShadows\": renderShadows,\n \"renderReflections\": renderReflections,\n \"rayDepth\": rayDepth\n }\n );\n\n raytracer.renderScene(scene, null, 0);\n}\n\nvar RayTrace = new BenchmarkSuite('RayTrace', 739989, [\n new Benchmark('RayTrace', renderScene)\n]);\n\n\n/* run_harness.js */\nvar print = console.log;\n\nfunction Run() {\n BenchmarkSuite.RunSuites({\n NotifyStep: ShowProgress,\n NotifyError: AddError,\n NotifyResult: AddResult,\n NotifyScore: AddScore,\n });\n}\n\nvar harnessErrorCount = 0;\n\nfunction ShowProgress(name) {\n print(\"PROGRESS\", name);\n}\n\nfunction AddError(name, error) {\n print(\"ERROR\", name, error);\n print(error.stack);\n harnessErrorCount++;\n}\n\nfunction AddResult(name, result) {\n print(\"RESULT\", name, result);\n}\n\nfunction AddScore(score) {\n print(\"SCORE\", score);\n}\n\nfunction main() {\n Run();\n}\n" }, { "path": "benches/scripts/v8-benches/regexp.js", "content": "\"use strict\";\n\"use strip\";\n// Copyright 2012 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Simple framework for running the benchmark suites and\n// computing a score based on the timing measurements.\n\n\n// A benchmark has a name (string) and a function that will be run to\n// do the performance measurement. The optional setup and tearDown\n// arguments are functions that will be invoked before and after\n// running the benchmark, but the running time of these functions will\n// not be accounted for in the benchmark score.\nfunction Benchmark(name, run, setup, tearDown) {\n this.name = name;\n this.run = run;\n this.Setup = setup ? setup : function () {\n };\n this.TearDown = tearDown ? tearDown : function () {\n };\n}\n\n\n// Benchmark results hold the benchmark and the measured time used to\n// run the benchmark. The benchmark score is computed later once a\n// full benchmark suite has run to completion.\nfunction BenchmarkResult(benchmark, time) {\n this.benchmark = benchmark;\n this.time = time;\n}\n\n\n// Automatically convert results to numbers. Used by the geometric\n// mean computation.\nBenchmarkResult.prototype.valueOf = function () {\n return this.time;\n};\n\n\n// Suites of benchmarks consist of a name and the set of benchmarks in\n// addition to the reference timing that the final score will be based\n// on. This way, all scores are relative to a reference run and higher\n// scores implies better performance.\nfunction BenchmarkSuite(name, reference, benchmarks) {\n this.name = name;\n this.reference = reference;\n this.benchmarks = benchmarks;\n BenchmarkSuite.suites.push(this);\n}\n\n\n// Keep track of all declared benchmark suites.\nBenchmarkSuite.suites = [];\n\n\n// Scores are not comparable across versions. Bump the version if\n// you're making changes that will affect that scores, e.g. if you add\n// a new benchmark or change an existing one.\nBenchmarkSuite.version = '7';\n\n\n// To make the benchmark results predictable, we replace Math.random\n// with a 100% deterministic alternative.\nMath.random = (function () {\n var seed = 49734321;\n return function () {\n // Robert Jenkins' 32 bit integer hash function.\n seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff;\n seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff;\n seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff;\n seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff;\n seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff;\n seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff;\n return (seed & 0xfffffff) / 0x10000000;\n };\n})();\n\n\n// Runs all registered benchmark suites and optionally yields between\n// each individual benchmark to avoid running for too long in the\n// context of browsers. Once done, the final score is reported to the\n// runner.\nBenchmarkSuite.RunSuites = function (runner) {\n var continuation = null;\n var suites = BenchmarkSuite.suites;\n var length = suites.length;\n BenchmarkSuite.scores = [];\n var index = 0;\n\n function RunStep() {\n while (continuation || index < length) {\n if (continuation) {\n continuation = continuation();\n } else {\n var suite = suites[index++];\n if (runner.NotifyStart) runner.NotifyStart(suite.name);\n continuation = suite.RunStep(runner);\n }\n if (continuation && typeof window != 'undefined' && window.setTimeout) {\n window.setTimeout(RunStep, 25);\n return;\n }\n }\n if (runner.NotifyScore) {\n var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores);\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n runner.NotifyScore(formatted);\n }\n }\n\n RunStep();\n};\n\n\n// Counts the total number of registered benchmarks. Useful for\n// showing progress as a percentage.\nBenchmarkSuite.CountBenchmarks = function () {\n var result = 0;\n var suites = BenchmarkSuite.suites;\n for (var i = 0; i < suites.length; i++) {\n result += suites[i].benchmarks.length;\n }\n return result;\n};\n\n\n// Computes the geometric mean of a set of numbers.\nBenchmarkSuite.GeometricMean = function (numbers) {\n var log = 0;\n for (var i = 0; i < numbers.length; i++) {\n log += Math.log(numbers[i]);\n }\n return Math.pow(Math.E, log / numbers.length);\n};\n\n\n// Converts a score value to a string with at least three significant\n// digits.\nBenchmarkSuite.FormatScore = function (value) {\n if (value > 100) {\n return value.toFixed(0);\n } else {\n return value.toPrecision(3);\n }\n};\n\n// Notifies the runner that we're done running a single benchmark in\n// the benchmark suite. This can be useful to report progress.\nBenchmarkSuite.prototype.NotifyStep = function (result) {\n this.results.push(result);\n if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name);\n};\n\n\n// Notifies the runner that we're done with running a suite and that\n// we have a result which can be reported to the user if needed.\nBenchmarkSuite.prototype.NotifyResult = function () {\n var mean = BenchmarkSuite.GeometricMean(this.results);\n var score = this.reference / mean;\n BenchmarkSuite.scores.push(score);\n if (this.runner.NotifyResult) {\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n this.runner.NotifyResult(this.name, formatted);\n }\n};\n\n\n// Notifies the runner that running a benchmark resulted in an error.\nBenchmarkSuite.prototype.NotifyError = function (error) {\n if (this.runner.NotifyError) {\n this.runner.NotifyError(this.name, error);\n }\n if (this.runner.NotifyStep) {\n this.runner.NotifyStep(this.name);\n }\n};\n\n\n// Runs a single benchmark for at least a second and computes the\n// average time it takes to run a single iteration.\nBenchmarkSuite.prototype.RunSingleBenchmark = function (benchmark, data) {\n function Measure(data) {\n var elapsed = 0;\n var start = new Date();\n for (var n = 0; elapsed < 1000; n++) {\n benchmark.run();\n elapsed = new Date() - start;\n }\n if (data != null) {\n data.runs += n;\n data.elapsed += elapsed;\n }\n }\n\n if (data == null) {\n // Measure the benchmark once for warm up and throw the result\n // away. Return a fresh data object.\n Measure(null);\n return {runs: 0, elapsed: 0};\n } else {\n Measure(data);\n // If we've run too few iterations, we continue for another second.\n if (data.runs < 32) return data;\n var usec = (data.elapsed * 1000) / data.runs;\n this.NotifyStep(new BenchmarkResult(benchmark, usec));\n return null;\n }\n};\n\n\n// This function starts running a suite, but stops between each\n// individual benchmark in the suite and returns a continuation\n// function which can be invoked to run the next benchmark. Once the\n// last benchmark has been executed, null is returned.\nBenchmarkSuite.prototype.RunStep = function (runner) {\n this.results = [];\n this.runner = runner;\n var length = this.benchmarks.length;\n var index = 0;\n var suite = this;\n var data;\n\n // Run the setup, the actual benchmark, and the tear down in three\n // separate steps to allow the framework to yield between any of the\n // steps.\n\n function RunNextSetup() {\n if (index < length) {\n try {\n suite.benchmarks[index].Setup();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextBenchmark;\n }\n suite.NotifyResult();\n return null;\n }\n\n function RunNextBenchmark() {\n try {\n data = suite.RunSingleBenchmark(suite.benchmarks[index], data);\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n // If data is null, we're done with this benchmark.\n return (data == null) ? RunNextTearDown : RunNextBenchmark();\n }\n\n function RunNextTearDown() {\n try {\n suite.benchmarks[index++].TearDown();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextSetup;\n }\n\n // Start out running the setup.\n return RunNextSetup();\n};\n\n// Copyright 2010 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Automatically generated on 2009-01-30. Manually updated on 2010-09-17.\n\n// This benchmark is generated by loading 50 of the most popular pages\n// on the web and logging all regexp operations performed. Each\n// operation is given a weight that is calculated from an estimate of\n// the popularity of the pages where it occurs and the number of times\n// it is executed while loading each page. Furthermore the literal\n// letters in the data are encoded using ROT13 in a way that does not\n// affect how the regexps match their input. Finally the strings are\n// scrambled to exercise the regexp engine on different input strings.\n\n\nvar RegExp = new BenchmarkSuite('RegExp', 910985, [\n new Benchmark(\"RegExp\", RegExpRun, RegExpSetup, RegExpTearDown)\n]);\n\nvar regExpBenchmark = null;\n\nfunction RegExpSetup() {\n regExpBenchmark = new RegExpBenchmark();\n RegExpRun(); // run once to get system initialized\n}\n\nfunction RegExpRun() {\n regExpBenchmark.run();\n}\n\nfunction RegExpTearDown() {\n regExpBenchmark = null;\n}\n\n// Returns an array of n different variants of the input string str.\n// The variants are computed by randomly rotating one random\n// character.\nfunction computeInputVariants(str, n) {\n var variants = [str];\n for (var i = 1; i < n; i++) {\n var pos = Math.floor(Math.random() * str.length);\n var chr = String.fromCharCode((str.charCodeAt(pos) + Math.floor(Math.random() * 128)) % 128);\n variants[i] = str.substring(0, pos) + chr + str.substring(pos + 1, str.length);\n }\n return variants;\n}\n\nfunction RegExpBenchmark() {\n var re0 = /^ba/;\n var re1 = /(((\\w+):\\/\\/)([^\\/:]*)(:(\\d+))?)?([^#?]*)(\\?([^#]*))?(#(.*))?/;\n var re2 = /^\\s*|\\s*$/g;\n var re3 = /\\bQBZPbageby_cynprubyqre\\b/;\n var re4 = /,/;\n var re5 = /\\bQBZPbageby_cynprubyqre\\b/g;\n var re6 = /^[\\s\\xa0]+|[\\s\\xa0]+$/g;\n var re7 = /(\\d*)(\\D*)/g;\n var re8 = /=/;\n var re9 = /(^|\\s)lhv\\-h(\\s|$)/;\n var str0 = 'Zbmvyyn/5.0 (Jvaqbjf; H; Jvaqbjf AG 5.1; ra-HF) NccyrJroXvg/528.9 (XUGZY, yvxr Trpxb) Puebzr/2.0.157.0 Fnsnev/528.9';\n var re10 = /\\#/g;\n var re11 = /\\./g;\n var re12 = /'/g;\n var re13 = /\\?[\\w\\W]*(sevraqvq|punaaryvq|tebhcvq)=([^\\&\\?#]*)/i;\n var str1 = 'Fubpxjnir Synfu 9.0 e115';\n var re14 = /\\s+/g;\n var re15 = /^\\s*(\\S*(\\s+\\S+)*)\\s*$/;\n var re16 = /(-[a-z])/i;\n\n var s0 = computeInputVariants('pyvpx', 6511);\n var s1 = computeInputVariants('uggc://jjj.snprobbx.pbz/ybtva.cuc', 1844);\n var s2 = computeInputVariants('QBZPbageby_cynprubyqre', 739);\n var s3 = computeInputVariants('uggc://jjj.snprobbx.pbz/', 598);\n var s4 = computeInputVariants('uggc://jjj.snprobbx.pbz/fepu.cuc', 454);\n var s5 = computeInputVariants('qqqq, ZZZ q, llll', 352);\n var s6 = computeInputVariants('vachggrkg QBZPbageby_cynprubyqre', 312);\n var s7 = computeInputVariants('/ZlFcnprUbzrcntr/Vaqrk-FvgrUbzr,10000000', 282);\n var s8 = computeInputVariants('vachggrkg', 177);\n var s9 = computeInputVariants('528.9', 170);\n var s10 = computeInputVariants('528', 170);\n var s11 = computeInputVariants('VCPhygher=ra-HF', 156);\n var s12 = computeInputVariants('CersreerqPhygher=ra-HF', 156);\n var s13 = computeInputVariants('xrlcerff', 144);\n var s14 = computeInputVariants('521', 139);\n var s15 = computeInputVariants(str0, 139);\n var s16 = computeInputVariants('qvi .so_zrah', 137);\n var s17 = computeInputVariants('qvi.so_zrah', 137);\n var s18 = computeInputVariants('uvqqra_ryrz', 117);\n var s19 = computeInputVariants('sevraqfgre_naba=nvq%3Qn6ss9p85n868ro9s059pn854735956o3%26ers%3Q%26df%3Q%26vpgl%3QHF', 95);\n var s20 = computeInputVariants('uggc://ubzr.zlfcnpr.pbz/vaqrk.psz', 93);\n var s21 = computeInputVariants(str1, 92);\n var s22 = computeInputVariants('svefg', 85);\n var s23 = computeInputVariants('uggc://cebsvyr.zlfcnpr.pbz/vaqrk.psz', 85);\n var s24 = computeInputVariants('ynfg', 85);\n var s25 = computeInputVariants('qvfcynl', 85);\n\n function runBlock0() {\n for (var i = 0; i < 6511; i++) {\n re0.exec(s0[i]);\n }\n for (var i = 0; i < 1844; i++) {\n re1.exec(s1[i]);\n }\n for (var i = 0; i < 739; i++) {\n s2[i].replace(re2, '');\n }\n for (var i = 0; i < 598; i++) {\n re1.exec(s3[i]);\n }\n for (var i = 0; i < 454; i++) {\n re1.exec(s4[i]);\n }\n for (var i = 0; i < 352; i++) {\n /qqqq|qqq|qq|q|ZZZZ|ZZZ|ZZ|Z|llll|ll|l|uu|u|UU|U|zz|z|ff|f|gg|g|sss|ss|s|mmm|mm|m/g.exec(s5[i]);\n }\n for (var i = 0; i < 312; i++) {\n re3.exec(s6[i]);\n }\n for (var i = 0; i < 282; i++) {\n re4.exec(s7[i]);\n }\n for (var i = 0; i < 177; i++) {\n s8[i].replace(re5, '');\n }\n for (var i = 0; i < 170; i++) {\n s9[i].replace(re6, '');\n re7.exec(s10[i]);\n }\n for (var i = 0; i < 156; i++) {\n re8.exec(s11[i]);\n re8.exec(s12[i]);\n }\n for (var i = 0; i < 144; i++) {\n re0.exec(s13[i]);\n }\n for (var i = 0; i < 139; i++) {\n s14[i].replace(re6, '');\n re7.exec(s14[i]);\n re9.exec('');\n /JroXvg\\/(\\S+)/.exec(s15[i]);\n }\n for (var i = 0; i < 137; i++) {\n s16[i].replace(re10, '');\n s16[i].replace(/\\[/g, '');\n s17[i].replace(re11, '');\n }\n for (var i = 0; i < 117; i++) {\n s18[i].replace(re2, '');\n }\n for (var i = 0; i < 95; i++) {\n /(?:^|;)\\s*sevraqfgre_ynat=([^;]*)/.exec(s19[i]);\n }\n for (var i = 0; i < 93; i++) {\n s20[i].replace(re12, '');\n re13.exec(s20[i]);\n }\n for (var i = 0; i < 92; i++) {\n s21[i].replace(/([a-zA-Z]|\\s)+/, '');\n }\n for (var i = 0; i < 85; i++) {\n s22[i].replace(re14, '');\n s22[i].replace(re15, '');\n s23[i].replace(re12, '');\n s24[i].replace(re14, '');\n s24[i].replace(re15, '');\n re16.exec(s25[i]);\n re13.exec(s23[i]);\n }\n }\n\n var re17 = /(^|[^\\\\])\\\"\\\\\\/Qngr\\((-?[0-9]+)\\)\\\\\\/\\\"/g;\n var str2 = '{\"anzr\":\"\",\"ahzoreSbezng\":{\"PheeraplQrpvznyQvtvgf\":2,\"PheeraplQrpvznyFrcnengbe\":\".\",\"VfErnqBayl\":gehr,\"PheeraplTebhcFvmrf\":[3],\"AhzoreTebhcFvmrf\":[3],\"CrepragTebhcFvmrf\":[3],\"PheeraplTebhcFrcnengbe\":\",\",\"PheeraplFlzoby\":\"\\xa4\",\"AnAFlzoby\":\"AnA\",\"PheeraplArtngvirCnggrea\":0,\"AhzoreArtngvirCnggrea\":1,\"CrepragCbfvgvirCnggrea\":0,\"CrepragArtngvirCnggrea\":0,\"ArtngvirVasvavglFlzoby\":\"-Vasvavgl\",\"ArtngvirFvta\":\"-\",\"AhzoreQrpvznyQvtvgf\":2,\"AhzoreQrpvznyFrcnengbe\":\".\",\"AhzoreTebhcFrcnengbe\":\",\",\"PheeraplCbfvgvirCnggrea\":0,\"CbfvgvirVasvavglFlzoby\":\"Vasvavgl\",\"CbfvgvirFvta\":\"+\",\"CrepragQrpvznyQvtvgf\":2,\"CrepragQrpvznyFrcnengbe\":\".\",\"CrepragTebhcFrcnengbe\":\",\",\"CrepragFlzoby\":\"%\",\"CreZvyyrFlzoby\":\"\\u2030\",\"AngvirQvtvgf\":[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"],\"QvtvgFhofgvghgvba\":1},\"qngrGvzrSbezng\":{\"NZQrfvtangbe\":\"NZ\",\"Pnyraqne\":{\"ZvaFhccbegrqQngrGvzr\":\"@-62135568000000@\",\"ZnkFhccbegrqQngrGvzr\":\"@253402300799999@\",\"NytbevguzGlcr\":1,\"PnyraqneGlcr\":1,\"Renf\":[1],\"GjbQvtvgLrneZnk\":2029,\"VfErnqBayl\":gehr},\"QngrFrcnengbe\":\"/\",\"SvefgQnlBsJrrx\":0,\"PnyraqneJrrxEhyr\":0,\"ShyyQngrGvzrCnggrea\":\"qqqq, qq ZZZZ llll UU:zz:ff\",\"YbatQngrCnggrea\":\"qqqq, qq ZZZZ llll\",\"YbatGvzrCnggrea\":\"UU:zz:ff\",\"ZbaguQnlCnggrea\":\"ZZZZ qq\",\"CZQrfvtangbe\":\"CZ\",\"ESP1123Cnggrea\":\"qqq, qq ZZZ llll UU\\':\\'zz\\':\\'ff \\'TZG\\'\",\"FubegQngrCnggrea\":\"ZZ/qq/llll\",\"FubegGvzrCnggrea\":\"UU:zz\",\"FbegnoyrQngrGvzrCnggrea\":\"llll\\'-\\'ZZ\\'-\\'qq\\'G\\'UU\\':\\'zz\\':\\'ff\",\"GvzrFrcnengbe\":\":\",\"HavirefnyFbegnoyrQngrGvzrCnggrea\":\"llll\\'-\\'ZZ\\'-\\'qq UU\\':\\'zz\\':\\'ff\\'M\\'\",\"LrneZbaguCnggrea\":\"llll ZZZZ\",\"NooerivngrqQnlAnzrf\":[\"Fha\",\"Zba\",\"Ghr\",\"Jrq\",\"Guh\",\"Sev\",\"Fng\"],\"FubegrfgQnlAnzrf\":[\"Fh\",\"Zb\",\"Gh\",\"Jr\",\"Gu\",\"Se\",\"Fn\"],\"QnlAnzrf\":[\"Fhaqnl\",\"Zbaqnl\",\"Ghrfqnl\",\"Jrqarfqnl\",\"Guhefqnl\",\"Sevqnl\",\"Fngheqnl\"],\"NooerivngrqZbaguAnzrf\":[\"Wna\",\"Sro\",\"Zne\",\"Nce\",\"Znl\",\"Wha\",\"Why\",\"Nht\",\"Frc\",\"Bpg\",\"Abi\",\"Qrp\",\"\"],\"ZbaguAnzrf\":[\"Wnahnel\",\"Sroehnel\",\"Znepu\",\"Ncevy\",\"Znl\",\"Whar\",\"Whyl\",\"Nhthfg\",\"Frcgrzore\",\"Bpgbore\",\"Abirzore\",\"Qrprzore\",\"\"],\"VfErnqBayl\":gehr,\"AngvirPnyraqneAnzr\":\"Tertbevna Pnyraqne\",\"NooerivngrqZbaguTravgvirAnzrf\":[\"Wna\",\"Sro\",\"Zne\",\"Nce\",\"Znl\",\"Wha\",\"Why\",\"Nht\",\"Frc\",\"Bpg\",\"Abi\",\"Qrp\",\"\"],\"ZbaguTravgvirAnzrf\":[\"Wnahnel\",\"Sroehnel\",\"Znepu\",\"Ncevy\",\"Znl\",\"Whar\",\"Whyl\",\"Nhthfg\",\"Frcgrzore\",\"Bpgbore\",\"Abirzore\",\"Qrprzore\",\"\"]}}';\n var str3 = '{\"anzr\":\"ra-HF\",\"ahzoreSbezng\":{\"PheeraplQrpvznyQvtvgf\":2,\"PheeraplQrpvznyFrcnengbe\":\".\",\"VfErnqBayl\":snyfr,\"PheeraplTebhcFvmrf\":[3],\"AhzoreTebhcFvmrf\":[3],\"CrepragTebhcFvmrf\":[3],\"PheeraplTebhcFrcnengbe\":\",\",\"PheeraplFlzoby\":\"$\",\"AnAFlzoby\":\"AnA\",\"PheeraplArtngvirCnggrea\":0,\"AhzoreArtngvirCnggrea\":1,\"CrepragCbfvgvirCnggrea\":0,\"CrepragArtngvirCnggrea\":0,\"ArtngvirVasvavglFlzoby\":\"-Vasvavgl\",\"ArtngvirFvta\":\"-\",\"AhzoreQrpvznyQvtvgf\":2,\"AhzoreQrpvznyFrcnengbe\":\".\",\"AhzoreTebhcFrcnengbe\":\",\",\"PheeraplCbfvgvirCnggrea\":0,\"CbfvgvirVasvavglFlzoby\":\"Vasvavgl\",\"CbfvgvirFvta\":\"+\",\"CrepragQrpvznyQvtvgf\":2,\"CrepragQrpvznyFrcnengbe\":\".\",\"CrepragTebhcFrcnengbe\":\",\",\"CrepragFlzoby\":\"%\",\"CreZvyyrFlzoby\":\"\\u2030\",\"AngvirQvtvgf\":[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"],\"QvtvgFhofgvghgvba\":1},\"qngrGvzrSbezng\":{\"NZQrfvtangbe\":\"NZ\",\"Pnyraqne\":{\"ZvaFhccbegrqQngrGvzr\":\"@-62135568000000@\",\"ZnkFhccbegrqQngrGvzr\":\"@253402300799999@\",\"NytbevguzGlcr\":1,\"PnyraqneGlcr\":1,\"Renf\":[1],\"GjbQvtvgLrneZnk\":2029,\"VfErnqBayl\":snyfr},\"QngrFrcnengbe\":\"/\",\"SvefgQnlBsJrrx\":0,\"PnyraqneJrrxEhyr\":0,\"ShyyQngrGvzrCnggrea\":\"qqqq, ZZZZ qq, llll u:zz:ff gg\",\"YbatQngrCnggrea\":\"qqqq, ZZZZ qq, llll\",\"YbatGvzrCnggrea\":\"u:zz:ff gg\",\"ZbaguQnlCnggrea\":\"ZZZZ qq\",\"CZQrfvtangbe\":\"CZ\",\"ESP1123Cnggrea\":\"qqq, qq ZZZ llll UU\\':\\'zz\\':\\'ff \\'TZG\\'\",\"FubegQngrCnggrea\":\"Z/q/llll\",\"FubegGvzrCnggrea\":\"u:zz gg\",\"FbegnoyrQngrGvzrCnggrea\":\"llll\\'-\\'ZZ\\'-\\'qq\\'G\\'UU\\':\\'zz\\':\\'ff\",\"GvzrFrcnengbe\":\":\",\"HavirefnyFbegnoyrQngrGvzrCnggrea\":\"llll\\'-\\'ZZ\\'-\\'qq UU\\':\\'zz\\':\\'ff\\'M\\'\",\"LrneZbaguCnggrea\":\"ZZZZ, llll\",\"NooerivngrqQnlAnzrf\":[\"Fha\",\"Zba\",\"Ghr\",\"Jrq\",\"Guh\",\"Sev\",\"Fng\"],\"FubegrfgQnlAnzrf\":[\"Fh\",\"Zb\",\"Gh\",\"Jr\",\"Gu\",\"Se\",\"Fn\"],\"QnlAnzrf\":[\"Fhaqnl\",\"Zbaqnl\",\"Ghrfqnl\",\"Jrqarfqnl\",\"Guhefqnl\",\"Sevqnl\",\"Fngheqnl\"],\"NooerivngrqZbaguAnzrf\":[\"Wna\",\"Sro\",\"Zne\",\"Nce\",\"Znl\",\"Wha\",\"Why\",\"Nht\",\"Frc\",\"Bpg\",\"Abi\",\"Qrp\",\"\"],\"ZbaguAnzrf\":[\"Wnahnel\",\"Sroehnel\",\"Znepu\",\"Ncevy\",\"Znl\",\"Whar\",\"Whyl\",\"Nhthfg\",\"Frcgrzore\",\"Bpgbore\",\"Abirzore\",\"Qrprzore\",\"\"],\"VfErnqBayl\":snyfr,\"AngvirPnyraqneAnzr\":\"Tertbevna Pnyraqne\",\"NooerivngrqZbaguTravgvirAnzrf\":[\"Wna\",\"Sro\",\"Zne\",\"Nce\",\"Znl\",\"Wha\",\"Why\",\"Nht\",\"Frc\",\"Bpg\",\"Abi\",\"Qrp\",\"\"],\"ZbaguTravgvirAnzrf\":[\"Wnahnel\",\"Sroehnel\",\"Znepu\",\"Ncevy\",\"Znl\",\"Whar\",\"Whyl\",\"Nhthfg\",\"Frcgrzore\",\"Bpgbore\",\"Abirzore\",\"Qrprzore\",\"\"]}}';\n var str4 = 'HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str5 = 'HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var re18 = /^\\s+|\\s+$/g;\n var str6 = 'uggc://jjj.snprobbx.pbz/vaqrk.cuc';\n var re19 = /(?:^|\\s+)ba(?:\\s+|$)/;\n var re20 = /[+, ]/;\n var re21 = /ybnqrq|pbzcyrgr/;\n var str7 = ';;jvaqbj.IjPurpxZbhfrCbfvgvbaNQ_VQ=shapgvba(r){vs(!r)ine r=jvaqbj.rirag;ine c=-1;vs(d1)c=d1.EbyybssCnary;ine bo=IjTrgBow(\"IjCnayNQ_VQ_\"+c);vs(bo&&bo.fglyr.ivfvovyvgl==\"ivfvoyr\"){ine fns=IjFns?8:0;ine pheK=r.pyvragK+IjBOFpe(\"U\")+fns,pheL=r.pyvragL+IjBOFpe(\"I\")+fns;ine y=IjBOEC(NQ_VQ,bo,\"Y\"),g=IjBOEC(NQ_VQ,bo,\"G\");ine e=y+d1.Cnaryf[c].Jvqgu,o=g+d1.Cnaryf[c].Urvtug;vs((pheKe)||(pheLo)){vs(jvaqbj.IjBaEbyybssNQ_VQ)IjBaEbyybssNQ_VQ(c);ryfr IjPybfrNq(NQ_VQ,c,gehr,\"\");}ryfr erghea;}IjPnapryZbhfrYvfgrareNQ_VQ();};;jvaqbj.IjFrgEbyybssCnaryNQ_VQ=shapgvba(c){ine z=\"zbhfrzbir\",q=qbphzrag,s=IjPurpxZbhfrCbfvgvbaNQ_VQ;c=IjTc(NQ_VQ,c);vs(d1&&d1.EbyybssCnary>-1)IjPnapryZbhfrYvfgrareNQ_VQ();vs(d1)d1.EbyybssCnary=c;gel{vs(q.nqqRiragYvfgrare)q.nqqRiragYvfgrare(z,s,snyfr);ryfr vs(q.nggnpuRirag)q.nggnpuRirag(\"ba\"+z,s);}pngpu(r){}};;jvaqbj.IjPnapryZbhfrYvfgrareNQ_VQ=shapgvba(){ine z=\"zbhfrzbir\",q=qbphzrag,s=IjPurpxZbhfrCbfvgvbaNQ_VQ;vs(d1)d1.EbyybssCnary=-1;gel{vs(q.erzbirRiragYvfgrare)q.erzbirRiragYvfgrare(z,s,snyfr);ryfr vs(q.qrgnpuRirag)q.qrgnpuRirag(\"ba\"+z,s);}pngpu(r){}};;d1.IjTc=d2(n,c){ine nq=d1;vs(vfAnA(c)){sbe(ine v=0;v0){vs(nq.FzV.yratgu>0)nq.FzV+=\"/\";nq.FzV+=vh[v];nq.FtZ[nq.FtZ.yratgu]=snyfr;}}};;d1.IjYvzvg0=d2(n,f){ine nq=d1,vh=f.fcyvg(\"/\");sbe(ine v=0;v0){vs(nq.OvC.yratgu>0)nq.OvC+=\"/\";nq.OvC+=vh[v];}}};;d1.IjRVST=d2(n,c){jvaqbj[\"IjCnayNQ_VQ_\"+c+\"_Bow\"]=IjTrgBow(\"IjCnayNQ_VQ_\"+c+\"_Bow\");vs(jvaqbj[\"IjCnayNQ_VQ_\"+c+\"_Bow\"]==ahyy)frgGvzrbhg(\"IjRVST(NQ_VQ,\"+c+\")\",d1.rvsg);};;d1.IjNavzSHC=d2(n,c){ine nq=d1;vs(c>nq.Cnaryf.yratgu)erghea;ine cna=nq.Cnaryf[c],nn=gehr,on=gehr,yn=gehr,en=gehr,cn=nq.Cnaryf[0],sf=nq.ShF,j=cn.Jvqgu,u=cn.Urvtug;vs(j==\"100%\"){j=sf;en=snyfr;yn=snyfr;}vs(u==\"100%\"){u=sf;nn=snyfr;on=snyfr;}vs(cn.YnY==\"Y\")yn=snyfr;vs(cn.YnY==\"E\")en=snyfr;vs(cn.GnY==\"G\")nn=snyfr;vs(cn.GnY==\"O\")on=snyfr;ine k=0,l=0;fjvgpu(nq.NshP%8){pnfr 0:oernx;pnfr 1:vs(nn)l=-sf;oernx;pnfr 2:k=j-sf;oernx;pnfr 3:vs(en)k=j;oernx;pnfr 4:k=j-sf;l=u-sf;oernx;pnfr 5:k=j-sf;vs(on)l=u;oernx;pnfr 6:l=u-sf;oernx;pnfr 7:vs(yn)k=-sf;l=u-sf;oernx;}vs(nq.NshP++ 0)||(nethzragf.yratgu==3&&bG>0))){pyrneGvzrbhg(cay.UgU);cay.UgU=frgGvzrbhg(cay.UvqrNpgvba,(nethzragf.yratgu==3?bG:cay.UvqrGvzrbhgInyhr));}};;d1.IjErfrgGvzrbhg=d2(n,c,bG){c=IjTc(n,c);IjPnapryGvzrbhg(n,c);riny(\"IjFgnegGvzrbhg(NQ_VQ,c\"+(nethzragf.yratgu==3?\",bG\":\"\")+\")\");};;d1.IjErfrgNyyGvzrbhgf=d2(n){sbe(ine c=0;c]/g;\n var str15 = 'FrffvbaQQS2=s6r4579npn4rn2135s904r0s75pp1o5334p6s6pospo12696; ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669316860113296&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=; AFP_zp_dfctwzs-aowb_80=44132r503660';\n var str16 = 'FrffvbaQQS2=s6r4579npn4rn2135s904r0s75pp1o5334p6s6pospo12696; AFP_zp_dfctwzs-aowb_80=44132r503660; __hgzm=144631658.1231363638.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.965867047679498800.1231363638.1231363638.1231363638.1; __hgzo=144631658.0.10.1231363638; __hgzp=144631658; ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669316860113296&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str17 = 'uggc://tbbtyrnqf.t.qbhoyrpyvpx.arg/cntrnq/nqf?pyvrag=pn-svz_zlfcnpr_zlfcnpr-ubzrcntr_wf&qg=1231363621014&uy=ra&nqfnsr=uvtu&br=hgs8&ahz_nqf=4&bhgchg=wf&nqgrfg=bss&pbeeryngbe=1231363621014&punaary=svz_zlfcnpr_ubzrcntr_abgybttrqva%2Psvz_zlfcnpr_aba_HTP%2Psvz_zlfcnpr_havgrq-fgngrf&hey=uggc%3N%2S%2Scebsvyr.zlfcnpr.pbz%2Svaqrk.psz&nq_glcr=grkg&rvq=6083027&rn=0&sez=0&tn_ivq=348699119.1231363624&tn_fvq=1231363624&tn_uvq=895511034&synfu=9.0.115&h_u=768&h_j=1024&h_nu=738&h_nj=1024&h_pq=24&h_gm=-480&h_uvf=2&h_wnin=gehr&h_acyht=7&h_azvzr=22';\n var str18 = 'uggc://jjj.yrobapbva.se/yv';\n var str19 = 'ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669316860113296&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str20 = 'ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669316860113296&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n\n var s67 = computeInputVariants('e115', 27);\n var s68 = computeInputVariants('qvfcynl', 27);\n var s69 = computeInputVariants('cbfvgvba', 27);\n var s70 = computeInputVariants('uggc://jjj.zlfcnpr.pbz/', 27);\n var s71 = computeInputVariants('cntrivrj', 27);\n var s72 = computeInputVariants('VC=74.125.75.3', 27);\n var s73 = computeInputVariants('ra', 27);\n var s74 = computeInputVariants(str10, 27);\n var s75 = computeInputVariants(str11, 27);\n var s76 = computeInputVariants(str12, 27);\n var s77 = computeInputVariants(str17, 27);\n var s78 = computeInputVariants(str18, 27);\n\n function runBlock3() {\n for (var i = 0; i < 27; i++) {\n s67[i].replace(/[A-Za-z]/g, '');\n }\n for (var i = 0; i < 23; i++) {\n s68[i].replace(re27, '');\n s69[i].replace(re27, '');\n }\n for (var i = 0; i < 22; i++) {\n 'unaqyr'.replace(re14, '');\n 'unaqyr'.replace(re15, '');\n 'yvar'.replace(re14, '');\n 'yvar'.replace(re15, '');\n 'cnerag puebzr6 fvatyr1 gno'.replace(re14, '');\n 'cnerag puebzr6 fvatyr1 gno'.replace(re15, '');\n 'fyvqre'.replace(re14, '');\n 'fyvqre'.replace(re15, '');\n re28.exec('');\n }\n for (var i = 0; i < 21; i++) {\n s70[i].replace(re12, '');\n re13.exec(s70[i]);\n }\n for (var i = 0; i < 20; i++) {\n s71[i].replace(re29, '');\n s71[i].replace(re30, '');\n re19.exec('ynfg');\n re19.exec('ba svefg');\n re8.exec(s72[i]);\n }\n for (var i = 0; i < 19; i++) {\n re31.exec(s73[i]);\n }\n for (var i = 0; i < 18; i++) {\n s74[i].split(re32);\n s75[i].split(re32);\n s76[i].replace(re33, '');\n re8.exec('144631658.0.10.1231363570');\n re8.exec('144631658.1231363570.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.3426875219718084000.1231363570.1231363570.1231363570.1');\n re8.exec(str13);\n re8.exec(str14);\n re8.exec('__hgzn=144631658.3426875219718084000.1231363570.1231363570.1231363570.1');\n re8.exec('__hgzo=144631658.0.10.1231363570');\n re8.exec('__hgzm=144631658.1231363570.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re34.exec(s74[i]);\n re34.exec(s75[i]);\n }\n for (var i = 0; i < 17; i++) {\n s15[i].match(/zfvr/gi);\n s15[i].match(/bcren/gi);\n str15.split(re32);\n str16.split(re32);\n 'ohggba'.replace(re14, '');\n 'ohggba'.replace(re15, '');\n 'puvyq p1 svefg sylbhg pybfrq'.replace(re14, '');\n 'puvyq p1 svefg sylbhg pybfrq'.replace(re15, '');\n 'pvgvrf'.replace(re14, '');\n 'pvgvrf'.replace(re15, '');\n 'pybfrq'.replace(re14, '');\n 'pybfrq'.replace(re15, '');\n 'qry'.replace(re14, '');\n 'qry'.replace(re15, '');\n 'uqy_zba'.replace(re14, '');\n 'uqy_zba'.replace(re15, '');\n s77[i].replace(re33, '');\n s78[i].replace(/%3P/g, '');\n s78[i].replace(/%3R/g, '');\n s78[i].replace(/%3q/g, '');\n s78[i].replace(re35, '');\n 'yvaxyvfg16'.replace(re14, '');\n 'yvaxyvfg16'.replace(re15, '');\n 'zvahf'.replace(re14, '');\n 'zvahf'.replace(re15, '');\n 'bcra'.replace(re14, '');\n 'bcra'.replace(re15, '');\n 'cnerag puebzr5 fvatyr1 ps NU'.replace(re14, '');\n 'cnerag puebzr5 fvatyr1 ps NU'.replace(re15, '');\n 'cynlre'.replace(re14, '');\n 'cynlre'.replace(re15, '');\n 'cyhf'.replace(re14, '');\n 'cyhf'.replace(re15, '');\n 'cb_uqy'.replace(re14, '');\n 'cb_uqy'.replace(re15, '');\n 'hyJVzt'.replace(re14, '');\n 'hyJVzt'.replace(re15, '');\n re8.exec('144631658.0.10.1231363638');\n re8.exec('144631658.1231363638.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.965867047679498800.1231363638.1231363638.1231363638.1');\n re8.exec('4413268q3660');\n re8.exec('4ss747o77904333q374or84qrr1s9r0nprp8r5q81534o94n');\n re8.exec('SbeprqRkcvengvba=633669321699093060');\n re8.exec('VC=74.125.75.20');\n re8.exec(str19);\n re8.exec(str20);\n re8.exec('AFP_zp_tfwsbrg-aowb_80=4413268q3660');\n re8.exec('FrffvbaQQS2=4ss747o77904333q374or84qrr1s9r0nprp8r5q81534o94n');\n re8.exec('__hgzn=144631658.965867047679498800.1231363638.1231363638.1231363638.1');\n re8.exec('__hgzo=144631658.0.10.1231363638');\n re8.exec('__hgzm=144631658.1231363638.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re34.exec(str15);\n re34.exec(str16);\n }\n }\n\n var re36 = /uers|fep|fryrpgrq/;\n var re37 = /\\s*([+>~\\s])\\s*([a-zA-Z#.*:\\[])/g;\n var re38 = /^(\\w+|\\*)$/;\n var str21 = 'FrffvbaQQS2=s15q53p9n372sn76npr13o271n4s3p5r29p235746p908p58; ZFPhygher=VC=66.249.85.130&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669358527244818&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var str22 = 'FrffvbaQQS2=s15q53p9n372sn76npr13o271n4s3p5r29p235746p908p58; __hgzm=144631658.1231367822.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.4127520630321984500.1231367822.1231367822.1231367822.1; __hgzo=144631658.0.10.1231367822; __hgzp=144631658; ZFPhygher=VC=66.249.85.130&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669358527244818&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str23 = 'uggc://tbbtyrnqf.t.qbhoyrpyvpx.arg/cntrnq/nqf?pyvrag=pn-svz_zlfcnpr_zlfcnpr-ubzrcntr_wf&qg=1231367803797&uy=ra&nqfnsr=uvtu&br=hgs8&ahz_nqf=4&bhgchg=wf&nqgrfg=bss&pbeeryngbe=1231367803797&punaary=svz_zlfcnpr_ubzrcntr_abgybttrqva%2Psvz_zlfcnpr_aba_HTP%2Psvz_zlfcnpr_havgrq-fgngrf&hey=uggc%3N%2S%2Szrffntvat.zlfcnpr.pbz%2Svaqrk.psz&nq_glcr=grkg&rvq=6083027&rn=0&sez=0&tn_ivq=1192552091.1231367807&tn_fvq=1231367807&tn_uvq=1155446857&synfu=9.0.115&h_u=768&h_j=1024&h_nu=738&h_nj=1024&h_pq=24&h_gm=-480&h_uvf=2&h_wnin=gehr&h_acyht=7&h_azvzr=22';\n var str24 = 'ZFPhygher=VC=66.249.85.130&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669358527244818&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str25 = 'ZFPhygher=VC=66.249.85.130&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669358527244818&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var str26 = 'hy.ynat-fryrpgbe';\n var re39 = /\\\\/g;\n var re40 = / /g;\n var re41 = /\\/\\xc4\\/t/;\n var re42 = /\\/\\xd6\\/t/;\n var re43 = /\\/\\xdc\\/t/;\n var re44 = /\\/\\xdf\\/t/;\n var re45 = /\\/\\xe4\\/t/;\n var re46 = /\\/\\xf6\\/t/;\n var re47 = /\\/\\xfc\\/t/;\n var re48 = /\\W/g;\n var re49 = /uers|fep|fglyr/;\n var s79 = computeInputVariants(str21, 16);\n var s80 = computeInputVariants(str22, 16);\n var s81 = computeInputVariants(str23, 16);\n var s82 = computeInputVariants(str26, 16);\n\n function runBlock4() {\n for (var i = 0; i < 16; i++) {\n ''.replace(/\\*/g, '');\n /\\bnpgvir\\b/.exec('npgvir');\n /sversbk/i.exec(s15[i]);\n re36.exec('glcr');\n /zfvr/i.exec(s15[i]);\n /bcren/i.exec(s15[i]);\n }\n for (var i = 0; i < 15; i++) {\n s79[i].split(re32);\n s80[i].split(re32);\n 'uggc://ohyyrgvaf.zlfcnpr.pbz/vaqrk.psz'.replace(re12, '');\n s81[i].replace(re33, '');\n 'yv'.replace(re37, '');\n 'yv'.replace(re18, '');\n re8.exec('144631658.0.10.1231367822');\n re8.exec('144631658.1231367822.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.4127520630321984500.1231367822.1231367822.1231367822.1');\n re8.exec(str24);\n re8.exec(str25);\n re8.exec('__hgzn=144631658.4127520630321984500.1231367822.1231367822.1231367822.1');\n re8.exec('__hgzo=144631658.0.10.1231367822');\n re8.exec('__hgzm=144631658.1231367822.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re34.exec(s79[i]);\n re34.exec(s80[i]);\n /\\.([\\w-]+)|\\[(\\w+)(?:([!*^$~|]?=)[\"']?(.*?)[\"']?)?\\]|:([\\w-]+)(?:\\([\"']?(.*?)?[\"']?\\)|$)/g.exec(s82[i]);\n re13.exec('uggc://ohyyrgvaf.zlfcnpr.pbz/vaqrk.psz');\n re38.exec('yv');\n }\n for (var i = 0; i < 14; i++) {\n ''.replace(re18, '');\n '9.0 e115'.replace(/(\\s+e|\\s+o[0-9]+)/, '');\n 'Funer guvf tnqtrg'.replace(//g, '');\n 'Funer guvf tnqtrg'.replace(re39, '');\n 'uggc://cebsvyrrqvg.zlfcnpr.pbz/vaqrk.psz'.replace(re12, '');\n 'grnfre'.replace(re40, '');\n 'grnfre'.replace(re41, '');\n 'grnfre'.replace(re42, '');\n 'grnfre'.replace(re43, '');\n 'grnfre'.replace(re44, '');\n 'grnfre'.replace(re45, '');\n 'grnfre'.replace(re46, '');\n 'grnfre'.replace(re47, '');\n 'grnfre'.replace(re48, '');\n re16.exec('znetva-gbc');\n re16.exec('cbfvgvba');\n re19.exec('gno1');\n re9.exec('qz');\n re9.exec('qg');\n re9.exec('zbqobk');\n re9.exec('zbqobkva');\n re9.exec('zbqgvgyr');\n re13.exec('uggc://cebsvyrrqvg.zlfcnpr.pbz/vaqrk.psz');\n re26.exec('/vt/znvytnqtrg');\n re49.exec('glcr');\n }\n }\n\n var re50 = /(?:^|\\s+)fryrpgrq(?:\\s+|$)/;\n var re51 = /\\&/g;\n var re52 = /\\+/g;\n var re53 = /\\?/g;\n var re54 = /\\t/g;\n var re55 = /(\\$\\{nqiHey\\})|(\\$nqiHey\\b)/g;\n var re56 = /(\\$\\{cngu\\})|(\\$cngu\\b)/g;\n\n function runBlock5() {\n for (var i = 0; i < 13; i++) {\n 'purpx'.replace(re14, '');\n 'purpx'.replace(re15, '');\n 'pvgl'.replace(re14, '');\n 'pvgl'.replace(re15, '');\n 'qrpe fyvqrgrkg'.replace(re14, '');\n 'qrpe fyvqrgrkg'.replace(re15, '');\n 'svefg fryrpgrq'.replace(re14, '');\n 'svefg fryrpgrq'.replace(re15, '');\n 'uqy_rag'.replace(re14, '');\n 'uqy_rag'.replace(re15, '');\n 'vape fyvqrgrkg'.replace(re14, '');\n 'vape fyvqrgrkg'.replace(re15, '');\n 'vachggrkg QBZPbageby_cynprubyqre'.replace(re5, '');\n 'cnerag puebzr6 fvatyr1 gno fryrpgrq'.replace(re14, '');\n 'cnerag puebzr6 fvatyr1 gno fryrpgrq'.replace(re15, '');\n 'cb_guz'.replace(re14, '');\n 'cb_guz'.replace(re15, '');\n 'fhozvg'.replace(re14, '');\n 'fhozvg'.replace(re15, '');\n re50.exec('');\n /NccyrJroXvg\\/([^\\s]*)/.exec(s15[i]);\n /XUGZY/.exec(s15[i]);\n }\n for (var i = 0; i < 12; i++) {\n '${cebg}://${ubfg}${cngu}/${dz}'.replace(/(\\$\\{cebg\\})|(\\$cebg\\b)/g, '');\n '1'.replace(re40, '');\n '1'.replace(re10, '');\n '1'.replace(re51, '');\n '1'.replace(re52, '');\n '1'.replace(re53, '');\n '1'.replace(re39, '');\n '1'.replace(re54, '');\n '9.0 e115'.replace(/^(.*)\\..*$/, '');\n '9.0 e115'.replace(/^.*e(.*)$/, '');\n ''.replace(re55, '');\n ''.replace(re55, '');\n s21[i].replace(/^.*\\s+(\\S+\\s+\\S+$)/, '');\n 'tzk%2Subzrcntr%2Sfgneg%2Sqr%2S'.replace(re30, '');\n 'tzk'.replace(re30, '');\n 'uggc://${ubfg}${cngu}/${dz}'.replace(/(\\$\\{ubfg\\})|(\\$ubfg\\b)/g, '');\n 'uggc://nqpyvrag.hvzfrei.arg${cngu}/${dz}'.replace(re56, '');\n 'uggc://nqpyvrag.hvzfrei.arg/wf.at/${dz}'.replace(/(\\$\\{dz\\})|(\\$dz\\b)/g, '');\n 'frpgvba'.replace(re29, '');\n 'frpgvba'.replace(re30, '');\n 'fvgr'.replace(re29, '');\n 'fvgr'.replace(re30, '');\n 'fcrpvny'.replace(re29, '');\n 'fcrpvny'.replace(re30, '');\n re36.exec('anzr');\n /e/.exec('9.0 e115');\n }\n }\n\n var re57 = /##yv4##/gi;\n var re58 = /##yv16##/gi;\n var re59 = /##yv19##/gi;\n var str27 = '##yv4##Cbjreshy Zvpebfbsg grpuabybtl urycf svtug fcnz naq vzcebir frphevgl.##yv19##Trg zber qbar gunaxf gb terngre rnfr naq fcrrq.##yv16##Ybgf bs fgbentr (5 TO) - zber pbby fghss ba gur jnl.##OE## ##OE## ##N##Yrnea zber##/N##';\n var str28 = 'Cbjreshy Zvpebfbsg grpuabybtl urycf svtug fcnz naq vzcebir frphevgl.##yv19##Trg zber qbar gunaxf gb terngre rnfr naq fcrrq.##yv16##Ybgf bs fgbentr (5 TO) - zber pbby fghss ba gur jnl.##OE## ##OE## ##N##Yrnea zber##/N##';\n var str29 = 'Cbjreshy Zvpebfbsg grpuabybtl urycf svtug fcnz naq vzcebir frphevgl.##yv19##Trg zber qbar gunaxf gb terngre rnfr naq fcrrq.Ybgf bs fgbentr (5 TO) - zber pbby fghss ba gur jnl.##OE## ##OE## ##N##Yrnea zber##/N##';\n var str30 = 'Cbjreshy Zvpebfbsg grpuabybtl urycf svtug fcnz naq vzcebir frphevgl.Trg zber qbar gunaxf gb terngre rnfr naq fcrrq.Ybgf bs fgbentr (5 TO) - zber pbby fghss ba gur jnl.##OE## ##OE## ##N##Yrnea zber##/N##';\n var str31 = 'Cbjreshy Zvpebfbsg grpuabybtl urycf svtug fcnz naq vzcebir frphevgl.Trg zber qbar gunaxf gb terngre rnfr naq fcrrq.Ybgf bs fgbentr (5 TO) - zber pbby fghss ba gur jnl. ##N##Yrnea zber##/N##';\n var str32 = 'Cbjreshy Zvpebfbsg grpuabybtl urycf svtug fcnz naq vzcebir frphevgl.Trg zber qbar gunaxf gb terngre rnfr naq fcrrq.Ybgf bs fgbentr (5 TO) - zber pbby fghss ba gur jnl. Yrnea zber##/N##';\n var str33 = 'Bar Jvaqbjf Yvir VQ trgf lbh vagb Ubgznvy, Zrffratre, Kobk YVIR \\u2014 naq bgure cynprf lbh frr #~#argjbexybtb#~#';\n var re60 = /(?:^|\\s+)bss(?:\\s+|$)/;\n var re61 = /^(([^:\\/?#]+):)?(\\/\\/([^\\/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?$/;\n var re62 = /^[^<]*(<(.|\\s)+>)[^>]*$|^#(\\w+)$/;\n var str34 = '${1}://${2}${3}${4}${5}';\n var str35 = ' O=6gnyg0g4znrrn&o=3&f=gc; Q=_lyu=K3bQZGSxnT4lZzD3OS9GNmV3ZGLkAQxRpTyxNmRlZmRmAmNkAQLRqTImqNZjOUEgpTjQnJ5xMKtgoN--; SCF=qy';\n var s83 = computeInputVariants(str27, 11);\n var s84 = computeInputVariants(str28, 11);\n var s85 = computeInputVariants(str29, 11);\n var s86 = computeInputVariants(str30, 11);\n var s87 = computeInputVariants(str31, 11);\n var s88 = computeInputVariants(str32, 11);\n var s89 = computeInputVariants(str33, 11);\n var s90 = computeInputVariants(str34, 11);\n\n function runBlock6() {\n for (var i = 0; i < 11; i++) {\n s83[i].replace(/##yv0##/gi, '');\n s83[i].replace(re57, '');\n s84[i].replace(re58, '');\n s85[i].replace(re59, '');\n s86[i].replace(/##\\/o##/gi, '');\n s86[i].replace(/##\\/v##/gi, '');\n s86[i].replace(/##\\/h##/gi, '');\n s86[i].replace(/##o##/gi, '');\n s86[i].replace(/##oe##/gi, '');\n s86[i].replace(/##v##/gi, '');\n s86[i].replace(/##h##/gi, '');\n s87[i].replace(/##n##/gi, '');\n s88[i].replace(/##\\/n##/gi, '');\n s89[i].replace(/#~#argjbexybtb#~#/g, '');\n / Zbovyr\\//.exec(s15[i]);\n /##yv1##/gi.exec(s83[i]);\n /##yv10##/gi.exec(s84[i]);\n /##yv11##/gi.exec(s84[i]);\n /##yv12##/gi.exec(s84[i]);\n /##yv13##/gi.exec(s84[i]);\n /##yv14##/gi.exec(s84[i]);\n /##yv15##/gi.exec(s84[i]);\n re58.exec(s84[i]);\n /##yv17##/gi.exec(s85[i]);\n /##yv18##/gi.exec(s85[i]);\n re59.exec(s85[i]);\n /##yv2##/gi.exec(s83[i]);\n /##yv20##/gi.exec(s86[i]);\n /##yv21##/gi.exec(s86[i]);\n /##yv22##/gi.exec(s86[i]);\n /##yv23##/gi.exec(s86[i]);\n /##yv3##/gi.exec(s83[i]);\n re57.exec(s83[i]);\n /##yv5##/gi.exec(s84[i]);\n /##yv6##/gi.exec(s84[i]);\n /##yv7##/gi.exec(s84[i]);\n /##yv8##/gi.exec(s84[i]);\n /##yv9##/gi.exec(s84[i]);\n re8.exec('473qq1rs0n2r70q9qo1pq48n021s9468ron90nps048p4p29');\n re8.exec('SbeprqRkcvengvba=633669325184628362');\n re8.exec('FrffvbaQQS2=473qq1rs0n2r70q9qo1pq48n021s9468ron90nps048p4p29');\n /AbxvnA[^\\/]*/.exec(s15[i]);\n }\n for (var i = 0; i < 10; i++) {\n ' bss'.replace(/(?:^|\\s+)bss(?:\\s+|$)/g, '');\n s90[i].replace(/(\\$\\{0\\})|(\\$0\\b)/g, '');\n s90[i].replace(/(\\$\\{1\\})|(\\$1\\b)/g, '');\n s90[i].replace(/(\\$\\{pbzcyrgr\\})|(\\$pbzcyrgr\\b)/g, '');\n s90[i].replace(/(\\$\\{sentzrag\\})|(\\$sentzrag\\b)/g, '');\n s90[i].replace(/(\\$\\{ubfgcbeg\\})|(\\$ubfgcbeg\\b)/g, '');\n s90[i].replace(re56, '');\n s90[i].replace(/(\\$\\{cebgbpby\\})|(\\$cebgbpby\\b)/g, '');\n s90[i].replace(/(\\$\\{dhrel\\})|(\\$dhrel\\b)/g, '');\n 'nqfvmr'.replace(re29, '');\n 'nqfvmr'.replace(re30, '');\n 'uggc://${2}${3}${4}${5}'.replace(/(\\$\\{2\\})|(\\$2\\b)/g, '');\n 'uggc://wf.hv-cbegny.qr${3}${4}${5}'.replace(/(\\$\\{3\\})|(\\$3\\b)/g, '');\n 'arjf'.replace(re40, '');\n 'arjf'.replace(re41, '');\n 'arjf'.replace(re42, '');\n 'arjf'.replace(re43, '');\n 'arjf'.replace(re44, '');\n 'arjf'.replace(re45, '');\n 'arjf'.replace(re46, '');\n 'arjf'.replace(re47, '');\n 'arjf'.replace(re48, '');\n / PC=i=(\\d+)&oe=(.)/.exec(str35);\n re60.exec(' ');\n re60.exec(' bss');\n re60.exec('');\n re19.exec(' ');\n re19.exec('svefg ba');\n re19.exec('ynfg vtaber');\n re19.exec('ba');\n re9.exec('scnq so ');\n re9.exec('zrqvgobk');\n re9.exec('hsgy');\n re9.exec('lhv-h');\n /Fnsnev|Xbadhrebe|XUGZY/gi.exec(s15[i]);\n re61.exec('uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/onfr.wf');\n re62.exec('#Ybtva_rznvy');\n }\n }\n\n var re63 = /\\{0\\}/g;\n var str36 = 'FrffvbaQQS2=4ss747o77904333q374or84qrr1s9r0nprp8r5q81534o94n; ZFPhygher=VC=74.125.75.20&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669321699093060&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=; AFP_zp_tfwsbrg-aowb_80=4413268q3660';\n var str37 = 'FrffvbaQQS2=4ss747o77904333q374or84qrr1s9r0nprp8r5q81534o94n; AFP_zp_tfwsbrg-aowb_80=4413268q3660; __hgzm=144631658.1231364074.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.2294274870215848400.1231364074.1231364074.1231364074.1; __hgzo=144631658.0.10.1231364074; __hgzp=144631658; ZFPhygher=VC=74.125.75.20&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669321699093060&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str38 = 'uggc://tbbtyrnqf.t.qbhoyrpyvpx.arg/cntrnq/nqf?pyvrag=pn-svz_zlfcnpr_zlfcnpr-ubzrcntr_wf&qg=1231364057761&uy=ra&nqfnsr=uvtu&br=hgs8&ahz_nqf=4&bhgchg=wf&nqgrfg=bss&pbeeryngbe=1231364057761&punaary=svz_zlfcnpr_ubzrcntr_abgybttrqva%2Psvz_zlfcnpr_aba_HTP%2Psvz_zlfcnpr_havgrq-fgngrf&hey=uggc%3N%2S%2Ssevraqf.zlfcnpr.pbz%2Svaqrk.psz&nq_glcr=grkg&rvq=6083027&rn=0&sez=0&tn_ivq=1667363813.1231364061&tn_fvq=1231364061&tn_uvq=1917563877&synfu=9.0.115&h_u=768&h_j=1024&h_nu=738&h_nj=1024&h_pq=24&h_gm=-480&h_uvf=2&h_wnin=gehr&h_acyht=7&h_azvzr=22';\n var str39 = 'ZFPhygher=VC=74.125.75.20&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669321699093060&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str40 = 'ZFPhygher=VC=74.125.75.20&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669321699093060&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var s91 = computeInputVariants(str36, 9);\n var s92 = computeInputVariants(str37, 9);\n var s93 = computeInputVariants(str38, 9);\n\n function runBlock7() {\n for (var i = 0; i < 9; i++) {\n '0'.replace(re40, '');\n '0'.replace(re10, '');\n '0'.replace(re51, '');\n '0'.replace(re52, '');\n '0'.replace(re53, '');\n '0'.replace(re39, '');\n '0'.replace(re54, '');\n 'Lrf'.replace(re40, '');\n 'Lrf'.replace(re10, '');\n 'Lrf'.replace(re51, '');\n 'Lrf'.replace(re52, '');\n 'Lrf'.replace(re53, '');\n 'Lrf'.replace(re39, '');\n 'Lrf'.replace(re54, '');\n }\n for (var i = 0; i < 8; i++) {\n 'Pybfr {0}'.replace(re63, '');\n 'Bcra {0}'.replace(re63, '');\n s91[i].split(re32);\n s92[i].split(re32);\n 'puvyq p1 svefg gnournqref'.replace(re14, '');\n 'puvyq p1 svefg gnournqref'.replace(re15, '');\n 'uqy_fcb'.replace(re14, '');\n 'uqy_fcb'.replace(re15, '');\n 'uvag'.replace(re14, '');\n 'uvag'.replace(re15, '');\n s93[i].replace(re33, '');\n 'yvfg'.replace(re14, '');\n 'yvfg'.replace(re15, '');\n 'at_bhgre'.replace(re30, '');\n 'cnerag puebzr5 qbhoyr2 NU'.replace(re14, '');\n 'cnerag puebzr5 qbhoyr2 NU'.replace(re15, '');\n 'cnerag puebzr5 dhnq5 ps NU osyvax zbarl'.replace(re14, '');\n 'cnerag puebzr5 dhnq5 ps NU osyvax zbarl'.replace(re15, '');\n 'cnerag puebzr6 fvatyr1'.replace(re14, '');\n 'cnerag puebzr6 fvatyr1'.replace(re15, '');\n 'cb_qrs'.replace(re14, '');\n 'cb_qrs'.replace(re15, '');\n 'gnopbagrag'.replace(re14, '');\n 'gnopbagrag'.replace(re15, '');\n 'iv_svefg_gvzr'.replace(re30, '');\n /(^|.)(ronl|qri-ehf3.wbg)(|fgberf|zbgbef|yvirnhpgvbaf|jvxv|rkcerff|punggre).(pbz(|.nh|.pa|.ux|.zl|.ft|.oe|.zk)|pb(.hx|.xe|.am)|pn|qr|se|vg|ay|or|ng|pu|vr|va|rf|cy|cu|fr)$/i.exec('cntrf.ronl.pbz');\n re8.exec('144631658.0.10.1231364074');\n re8.exec('144631658.1231364074.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.2294274870215848400.1231364074.1231364074.1231364074.1');\n re8.exec('4413241q3660');\n re8.exec('SbeprqRkcvengvba=633669357391353591');\n re8.exec(str39);\n re8.exec(str40);\n re8.exec('AFP_zp_kkk-gdzogv_80=4413241q3660');\n re8.exec('FrffvbaQQS2=p98s8o9q42nr21or1r61pqorn1n002nsss569635984s6qp7');\n re8.exec('__hgzn=144631658.2294274870215848400.1231364074.1231364074.1231364074.1');\n re8.exec('__hgzo=144631658.0.10.1231364074');\n re8.exec('__hgzm=144631658.1231364074.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('p98s8o9q42nr21or1r61pqorn1n002nsss569635984s6qp7');\n re34.exec(s91[i]);\n re34.exec(s92[i]);\n }\n }\n\n var re64 = /\\b[a-z]/g;\n var re65 = /^uggc:\\/\\//;\n var re66 = /(?:^|\\s+)qvfnoyrq(?:\\s+|$)/;\n var str41 = 'uggc://cebsvyr.zlfcnpr.pbz/Zbqhyrf/Nccyvpngvbaf/Cntrf/Pnainf.nfck';\n\n function runBlock8() {\n for (var i = 0; i < 7; i++) {\n s21[i].match(/\\d+/g);\n 'nsgre'.replace(re64, '');\n 'orsber'.replace(re64, '');\n 'obggbz'.replace(re64, '');\n 'ohvygva_jrngure.kzy'.replace(re65, '');\n 'ohggba'.replace(re37, '');\n 'ohggba'.replace(re18, '');\n 'qngrgvzr.kzy'.replace(re65, '');\n 'uggc://eff.paa.pbz/eff/paa_gbcfgbevrf.eff'.replace(re65, '');\n 'vachg'.replace(re37, '');\n 'vachg'.replace(re18, '');\n 'vafvqr'.replace(re64, '');\n 'cbvagre'.replace(re27, '');\n 'cbfvgvba'.replace(/[A-Z]/g, '');\n 'gbc'.replace(re27, '');\n 'gbc'.replace(re64, '');\n 'hy'.replace(re37, '');\n 'hy'.replace(re18, '');\n str26.replace(re37, '');\n str26.replace(re18, '');\n 'lbhghor_vtbbtyr/i2/lbhghor.kzy'.replace(re65, '');\n 'm-vaqrk'.replace(re27, '');\n /#([\\w-]+)/.exec(str26);\n re16.exec('urvtug');\n re16.exec('znetvaGbc');\n re16.exec('jvqgu');\n re19.exec('gno0 svefg ba');\n re19.exec('gno0 ba');\n re19.exec('gno4 ynfg');\n re19.exec('gno4');\n re19.exec('gno5');\n re19.exec('gno6');\n re19.exec('gno7');\n re19.exec('gno8');\n /NqborNVE\\/([^\\s]*)/.exec(s15[i]);\n /NccyrJroXvg\\/([^ ]*)/.exec(s15[i]);\n /XUGZY/gi.exec(s15[i]);\n /^(?:obql|ugzy)$/i.exec('YV');\n re38.exec('ohggba');\n re38.exec('vachg');\n re38.exec('hy');\n re38.exec(str26);\n /^(\\w+|\\*)/.exec(str26);\n /znp|jva|yvahk/i.exec('Jva32');\n /eton?\\([\\d\\s,]+\\)/.exec('fgngvp');\n }\n for (var i = 0; i < 6; i++) {\n ''.replace(/\\r/g, '');\n '/'.replace(re40, '');\n '/'.replace(re10, '');\n '/'.replace(re51, '');\n '/'.replace(re52, '');\n '/'.replace(re53, '');\n '/'.replace(re39, '');\n '/'.replace(re54, '');\n 'uggc://zfacbegny.112.2b7.arg/o/ff/zfacbegnyubzr/1/U.7-cqi-2/{0}?[NDO]&{1}&{2}&[NDR]'.replace(re63, '');\n str41.replace(re12, '');\n 'uggc://jjj.snprobbx.pbz/fepu.cuc'.replace(re23, '');\n 'freivpr'.replace(re40, '');\n 'freivpr'.replace(re41, '');\n 'freivpr'.replace(re42, '');\n 'freivpr'.replace(re43, '');\n 'freivpr'.replace(re44, '');\n 'freivpr'.replace(re45, '');\n 'freivpr'.replace(re46, '');\n 'freivpr'.replace(re47, '');\n 'freivpr'.replace(re48, '');\n /((ZFVR\\s+([6-9]|\\d\\d)\\.))/.exec(s15[i]);\n re66.exec('');\n re50.exec('fryrpgrq');\n re8.exec('8sqq78r9n442851q565599o401385sp3s04r92rnn7o19ssn');\n re8.exec('SbeprqRkcvengvba=633669340386893867');\n re8.exec('VC=74.125.75.17');\n re8.exec('FrffvbaQQS2=8sqq78r9n442851q565599o401385sp3s04r92rnn7o19ssn');\n /Xbadhrebe|Fnsnev|XUGZY/.exec(s15[i]);\n re13.exec(str41);\n re49.exec('unfsbphf');\n }\n }\n\n var re67 = /zrah_byq/g;\n var str42 = 'FrffvbaQQS2=473qq1rs0n2r70q9qo1pq48n021s9468ron90nps048p4p29; ZFPhygher=VC=74.125.75.3&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669325184628362&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var str43 = 'FrffvbaQQS2=473qq1rs0n2r70q9qo1pq48n021s9468ron90nps048p4p29; __hgzm=144631658.1231364380.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.3931862196947939300.1231364380.1231364380.1231364380.1; __hgzo=144631658.0.10.1231364380; __hgzp=144631658; ZFPhygher=VC=74.125.75.3&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669325184628362&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str44 = 'uggc://tbbtyrnqf.t.qbhoyrpyvpx.arg/cntrnq/nqf?pyvrag=pn-svz_zlfcnpr_vzntrf_wf&qg=1231364373088&uy=ra&nqfnsr=uvtu&br=hgs8&ahz_nqf=4&bhgchg=wf&nqgrfg=bss&pbeeryngbe=1231364373088&punaary=svz_zlfcnpr_hfre-ivrj-pbzzragf%2Psvz_zlfcnpr_havgrq-fgngrf&hey=uggc%3N%2S%2Spbzzrag.zlfcnpr.pbz%2Svaqrk.psz&nq_glcr=grkg&rvq=6083027&rn=0&sez=0&tn_ivq=1158737789.1231364375&tn_fvq=1231364375&tn_uvq=415520832&synfu=9.0.115&h_u=768&h_j=1024&h_nu=738&h_nj=1024&h_pq=24&h_gm=-480&h_uvf=2&h_wnin=gehr&h_acyht=7&h_azvzr=22';\n var str45 = 'ZFPhygher=VC=74.125.75.3&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669325184628362&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str46 = 'ZFPhygher=VC=74.125.75.3&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669325184628362&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var re68 = /^([#.]?)((?:[\\w\\u0128-\\uffff*_-]|\\\\.)*)/;\n var re69 = /\\{1\\}/g;\n var re70 = /\\s+/;\n var re71 = /(\\$\\{4\\})|(\\$4\\b)/g;\n var re72 = /(\\$\\{5\\})|(\\$5\\b)/g;\n var re73 = /\\{2\\}/g;\n var re74 = /[^+>] [^+>]/;\n var re75 = /\\bucpyv\\s*=\\s*([^;]*)/i;\n var re76 = /\\bucuvqr\\s*=\\s*([^;]*)/i;\n var re77 = /\\bucfie\\s*=\\s*([^;]*)/i;\n var re78 = /\\bhfucjrn\\s*=\\s*([^;]*)/i;\n var re79 = /\\bmvc\\s*=\\s*([^;]*)/i;\n var re80 = /^((?:[\\w\\u0128-\\uffff*_-]|\\\\.)+)(#)((?:[\\w\\u0128-\\uffff*_-]|\\\\.)+)/;\n var re81 = /^([>+~])\\s*(\\w*)/i;\n var re82 = /^>\\s*((?:[\\w\\u0128-\\uffff*_-]|\\\\.)+)/;\n var re83 = /^[\\s[]?shapgvba/;\n var re84 = /v\\/g.tvs#(.*)/i;\n var str47 = '#Zbq-Vasb-Vasb-WninFpevcgUvag';\n var str48 = ',n.svryqOgaPnapry';\n var str49 = 'FrffvbaQQS2=p98s8o9q42nr21or1r61pqorn1n002nsss569635984s6qp7; ZFPhygher=VC=74.125.75.3&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669357391353591&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=; AFP_zp_kkk-gdzogv_80=4413241q3660';\n var str50 = 'FrffvbaQQS2=p98s8o9q42nr21or1r61pqorn1n002nsss569635984s6qp7; AFP_zp_kkk-gdzogv_80=4413241q3660; AFP_zp_kkk-aowb_80=4413235p3660; __hgzm=144631658.1231367708.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.2770915348920628700.1231367708.1231367708.1231367708.1; __hgzo=144631658.0.10.1231367708; __hgzp=144631658; ZFPhygher=VC=74.125.75.3&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669357391353591&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str51 = 'uggc://tbbtyrnqf.t.qbhoyrpyvpx.arg/cntrnq/nqf?pyvrag=pn-svz_zlfcnpr_zlfcnpr-ubzrcntr_wf&qg=1231367691141&uy=ra&nqfnsr=uvtu&br=hgs8&ahz_nqf=4&bhgchg=wf&nqgrfg=bss&pbeeryngbe=1231367691141&punaary=svz_zlfcnpr_ubzrcntr_abgybttrqva%2Psvz_zlfcnpr_aba_HTP%2Psvz_zlfcnpr_havgrq-fgngrf&hey=uggc%3N%2S%2Sjjj.zlfcnpr.pbz%2S&nq_glcr=grkg&rvq=6083027&rn=0&sez=0&tn_ivq=320757904.1231367694&tn_fvq=1231367694&tn_uvq=1758792003&synfu=9.0.115&h_u=768&h_j=1024&h_nu=738&h_nj=1024&h_pq=24&h_gm=-480&h_uvf=2&h_wnin=gehr&h_acyht=7&h_azvzr=22';\n var str52 = 'uggc://zfacbegny.112.2b7.arg/o/ff/zfacbegnyubzr/1/U.7-cqi-2/f55332979829981?[NDO]&aqu=1&g=7%2S0%2S2009%2014%3N38%3N42%203%20480&af=zfacbegny&cntrAnzr=HF%20UCZFSGJ&t=uggc%3N%2S%2Sjjj.zfa.pbz%2S&f=1024k768&p=24&x=L&oj=994&ou=634&uc=A&{2}&[NDR]';\n var str53 = 'cnerag puebzr6 fvatyr1 gno fryrpgrq ovaq qbhoyr2 ps';\n var str54 = 'ZFPhygher=VC=74.125.75.3&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669357391353591&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str55 = 'ZFPhygher=VC=74.125.75.3&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669357391353591&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var str56 = 'ne;ng;nh;or;oe;pn;pu;py;pa;qr;qx;rf;sv;se;to;ux;vq;vr;va;vg;wc;xe;zk;zl;ay;ab;am;cu;cy;cg;eh;fr;ft;gu;ge;gj;mn;';\n var str57 = 'ZP1=I=3&THVQ=6nnpr9q661804s33nnop45nosqp17q85; zu=ZFSG; PHYGHER=RA-HF; SyvtugTebhcVq=97; SyvtugVq=OnfrCntr; ucfie=Z:5|S:5|G:5|R:5|Q:oyh|J:S; ucpyv=J.U|Y.|F.|E.|H.Y|P.|U.; hfucjrn=jp:HFPN0746; ZHVQ=Q783SN9O14054831N4869R51P0SO8886&GHVQ=1';\n var str58 = 'ZP1=I=3&THVQ=6nnpr9q661804s33nnop45nosqp17q85; zu=ZFSG; PHYGHER=RA-HF; SyvtugTebhcVq=97; SyvtugVq=OnfrCntr; ucfie=Z:5|S:5|G:5|R:5|Q:oyh|J:S; ucpyv=J.U|Y.|F.|E.|H.Y|P.|U.; hfucjrn=jp:HFPN0746; ZHVQ=Q783SN9O14054831N4869R51P0SO8886';\n var str59 = 'ZP1=I=3&THVQ=6nnpr9q661804s33nnop45nosqp17q85; zu=ZFSG; PHYGHER=RA-HF; SyvtugTebhcVq=97; SyvtugVq=OnfrCntr; ucfie=Z:5|S:5|G:5|R:5|Q:oyh|J:S; ucpyv=J.U|Y.|F.|E.|H.Y|P.|U.; hfucjrn=jp:HFPN0746; ZHVQ=Q783SN9O14054831N4869R51P0SO8886; mvc=m:94043|yn:37.4154|yb:-122.0585|p:HF|ue:1';\n var str60 = 'ZP1=I=3&THVQ=6nnpr9q661804s33nnop45nosqp17q85; zu=ZFSG; PHYGHER=RA-HF; SyvtugTebhcVq=97; SyvtugVq=OnfrCntr; ucfie=Z:5|S:5|G:5|R:5|Q:oyh|J:S; ucpyv=J.U|Y.|F.|E.|H.Y|P.|U.; hfucjrn=jp:HFPN0746; ZHVQ=Q783SN9O14054831N4869R51P0SO8886; mvc=m:94043|yn:37.4154|yb:-122.0585|p:HF';\n var str61 = 'uggc://gx2.fgp.f-zfa.pbz/oe/uc/11/ra-hf/pff/v/g.tvs#uggc://gx2.fgo.f-zfa.pbz/v/29/4RQP4969777N048NPS4RRR3PO2S7S.wct';\n var str62 = 'uggc://gx2.fgp.f-zfa.pbz/oe/uc/11/ra-hf/pff/v/g.tvs#uggc://gx2.fgo.f-zfa.pbz/v/OQ/63NP9O94NS5OQP1249Q9S1ROP7NS3.wct';\n var str63 = 'zbmvyyn/5.0 (jvaqbjf; h; jvaqbjf ag 5.1; ra-hf) nccyrjroxvg/528.9 (xugzy, yvxr trpxb) puebzr/2.0.157.0 fnsnev/528.9';\n var s94 = computeInputVariants(str42, 5);\n var s95 = computeInputVariants(str43, 5);\n var s96 = computeInputVariants(str44, 5);\n var s97 = computeInputVariants(str47, 5);\n var s98 = computeInputVariants(str48, 5);\n var s99 = computeInputVariants(str49, 5);\n var s100 = computeInputVariants(str50, 5);\n var s101 = computeInputVariants(str51, 5);\n var s102 = computeInputVariants(str52, 5);\n var s103 = computeInputVariants(str53, 5);\n\n function runBlock9() {\n for (var i = 0; i < 5; i++) {\n s94[i].split(re32);\n s95[i].split(re32);\n 'svz_zlfcnpr_hfre-ivrj-pbzzragf,svz_zlfcnpr_havgrq-fgngrf'.split(re20);\n s96[i].replace(re33, '');\n 'zrah_arj zrah_arj_gbttyr zrah_gbttyr'.replace(re67, '');\n 'zrah_byq zrah_byq_gbttyr zrah_gbttyr'.replace(re67, '');\n re8.exec('102n9o0o9pq60132qn0337rr867p75953502q2s27s2s5r98');\n re8.exec('144631658.0.10.1231364380');\n re8.exec('144631658.1231364380.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.3931862196947939300.1231364380.1231364380.1231364380.1');\n re8.exec('441326q33660');\n re8.exec('SbeprqRkcvengvba=633669341278771470');\n re8.exec(str45);\n re8.exec(str46);\n re8.exec('AFP_zp_dfctwzssrwh-aowb_80=441326q33660');\n re8.exec('FrffvbaQQS2=102n9o0o9pq60132qn0337rr867p75953502q2s27s2s5r98');\n re8.exec('__hgzn=144631658.3931862196947939300.1231364380.1231364380.1231364380.1');\n re8.exec('__hgzo=144631658.0.10.1231364380');\n re8.exec('__hgzm=144631658.1231364380.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n }\n for (var i = 0; i < 4; i++) {\n ' yvfg1'.replace(re14, '');\n ' yvfg1'.replace(re15, '');\n ' yvfg2'.replace(re14, '');\n ' yvfg2'.replace(re15, '');\n ' frneputebhc1'.replace(re14, '');\n ' frneputebhc1'.replace(re15, '');\n s97[i].replace(re68, '');\n s97[i].replace(re18, '');\n ''.replace(/&/g, '');\n ''.replace(re35, '');\n '(..-{0})(\\|(\\d+)|)'.replace(re63, '');\n s98[i].replace(re18, '');\n '//vzt.jro.qr/vij/FC/${cngu}/${anzr}/${inyhr}?gf=${abj}'.replace(re56, '');\n '//vzt.jro.qr/vij/FC/tzk_uc/${anzr}/${inyhr}?gf=${abj}'.replace(/(\\$\\{anzr\\})|(\\$anzr\\b)/g, '');\n 'Jvaqbjf Yvir Ubgznvy{1}'.replace(re69, '');\n '{0}{1}'.replace(re63, '');\n '{1}'.replace(re69, '');\n '{1}'.replace(re63, '');\n 'Vzntrf'.replace(re15, '');\n 'ZFA'.replace(re15, '');\n 'Zncf'.replace(re15, '');\n 'Zbq-Vasb-Vasb-WninFpevcgUvag'.replace(re39, '');\n 'Arjf'.replace(re15, '');\n s99[i].split(re32);\n s100[i].split(re32);\n 'Ivqrb'.replace(re15, '');\n 'Jro'.replace(re15, '');\n 'n'.replace(re39, '');\n 'nwnkFgneg'.split(re70);\n 'nwnkFgbc'.split(re70);\n 'ovaq'.replace(re14, '');\n 'ovaq'.replace(re15, '');\n 'oevatf lbh zber. Zber fcnpr (5TO), zber frphevgl, fgvyy serr.'.replace(re63, '');\n 'puvyq p1 svefg qrpx'.replace(re14, '');\n 'puvyq p1 svefg qrpx'.replace(re15, '');\n 'puvyq p1 svefg qbhoyr2'.replace(re14, '');\n 'puvyq p1 svefg qbhoyr2'.replace(re15, '');\n 'puvyq p2 ynfg'.replace(re14, '');\n 'puvyq p2 ynfg'.replace(re15, '');\n 'puvyq p2'.replace(re14, '');\n 'puvyq p2'.replace(re15, '');\n 'puvyq p3'.replace(re14, '');\n 'puvyq p3'.replace(re15, '');\n 'puvyq p4 ynfg'.replace(re14, '');\n 'puvyq p4 ynfg'.replace(re15, '');\n 'pbclevtug'.replace(re14, '');\n 'pbclevtug'.replace(re15, '');\n 'qZFAZR_1'.replace(re14, '');\n 'qZFAZR_1'.replace(re15, '');\n 'qbhoyr2 ps'.replace(re14, '');\n 'qbhoyr2 ps'.replace(re15, '');\n 'qbhoyr2'.replace(re14, '');\n 'qbhoyr2'.replace(re15, '');\n 'uqy_arj'.replace(re14, '');\n 'uqy_arj'.replace(re15, '');\n 'uc_fubccvatobk'.replace(re30, '');\n 'ugzy%2Rvq'.replace(re29, '');\n 'ugzy%2Rvq'.replace(re30, '');\n s101[i].replace(re33, '');\n 'uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/cebgbglcr.wf${4}${5}'.replace(re71, '');\n 'uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/cebgbglcr.wf${5}'.replace(re72, '');\n s102[i].replace(re73, '');\n 'uggc://zfacbegny.112.2b7.arg/o/ff/zfacbegnyubzr/1/U.7-cqi-2/f55332979829981?[NDO]&{1}&{2}&[NDR]'.replace(re69, '');\n 'vztZFSG'.replace(re14, '');\n 'vztZFSG'.replace(re15, '');\n 'zfasbbg1 ps'.replace(re14, '');\n 'zfasbbg1 ps'.replace(re15, '');\n s103[i].replace(re14, '');\n s103[i].replace(re15, '');\n 'cnerag puebzr6 fvatyr1 gno fryrpgrq ovaq'.replace(re14, '');\n 'cnerag puebzr6 fvatyr1 gno fryrpgrq ovaq'.replace(re15, '');\n 'cevznel'.replace(re14, '');\n 'cevznel'.replace(re15, '');\n 'erpgnatyr'.replace(re30, '');\n 'frpbaqnel'.replace(re14, '');\n 'frpbaqnel'.replace(re15, '');\n 'haybnq'.split(re70);\n '{0}{1}1'.replace(re63, '');\n '|{1}1'.replace(re69, '');\n /(..-HF)(\\|(\\d+)|)/i.exec('xb-xe,ra-va,gu-gu');\n re4.exec('/ZlFcnprNccf/NccPnainf,45000012');\n re8.exec('144631658.0.10.1231367708');\n re8.exec('144631658.1231367708.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.2770915348920628700.1231367708.1231367708.1231367708.1');\n re8.exec('4413235p3660');\n re8.exec('441327q73660');\n re8.exec('9995p6rp12rrnr893334ro7nq70o7p64p69rqn844prs1473');\n re8.exec('SbeprqRkcvengvba=633669350559478880');\n re8.exec(str54);\n re8.exec(str55);\n re8.exec('AFP_zp_dfctwzs-aowb_80=441327q73660');\n re8.exec('AFP_zp_kkk-aowb_80=4413235p3660');\n re8.exec('FrffvbaQQS2=9995p6rp12rrnr893334ro7nq70o7p64p69rqn844prs1473');\n re8.exec('__hgzn=144631658.2770915348920628700.1231367708.1231367708.1231367708.1');\n re8.exec('__hgzo=144631658.0.10.1231367708');\n re8.exec('__hgzm=144631658.1231367708.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re34.exec(s99[i]);\n re34.exec(s100[i]);\n /ZFVR\\s+5[.]01/.exec(s15[i]);\n /HF(?=;)/i.exec(str56);\n re74.exec(s97[i]);\n re28.exec('svefg npgvir svefgNpgvir');\n re28.exec('ynfg');\n /\\bp:(..)/i.exec('m:94043|yn:37.4154|yb:-122.0585|p:HF');\n re75.exec(str57);\n re75.exec(str58);\n re76.exec(str57);\n re76.exec(str58);\n re77.exec(str57);\n re77.exec(str58);\n /\\bhfucce\\s*=\\s*([^;]*)/i.exec(str59);\n re78.exec(str57);\n re78.exec(str58);\n /\\bjci\\s*=\\s*([^;]*)/i.exec(str59);\n re79.exec(str58);\n re79.exec(str60);\n re79.exec(str59);\n /\\|p:([a-z]{2})/i.exec('m:94043|yn:37.4154|yb:-122.0585|p:HF|ue:1');\n re80.exec(s97[i]);\n re61.exec('cebgbglcr.wf');\n re68.exec(s97[i]);\n re81.exec(s97[i]);\n re82.exec(s97[i]);\n /^Fubpxjnir Synfu (\\d)/.exec(s21[i]);\n /^Fubpxjnir Synfu (\\d+)/.exec(s21[i]);\n re83.exec('[bowrpg tybony]');\n re62.exec(s97[i]);\n re84.exec(str61);\n re84.exec(str62);\n /jroxvg/.exec(str63);\n }\n }\n\n var re85 = /eaq_zbqobkva/;\n var str64 = '1231365729213';\n var str65 = '74.125.75.3-1057165600.29978900';\n var str66 = '74.125.75.3-1057165600.29978900.1231365730214';\n var str67 = 'Frnepu%20Zvpebfbsg.pbz';\n var str68 = 'FrffvbaQQS2=8sqq78r9n442851q565599o401385sp3s04r92rnn7o19ssn; ZFPhygher=VC=74.125.75.17&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669340386893867&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var str69 = 'FrffvbaQQS2=8sqq78r9n442851q565599o401385sp3s04r92rnn7o19ssn; __hgzm=144631658.1231365779.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.1877536177953918500.1231365779.1231365779.1231365779.1; __hgzo=144631658.0.10.1231365779; __hgzp=144631658; ZFPhygher=VC=74.125.75.17&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669340386893867&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str70 = 'I=3%26THVQ=757q3ss871q44o7o805n8113n5p72q52';\n var str71 = 'I=3&THVQ=757q3ss871q44o7o805n8113n5p72q52';\n var str72 = 'uggc://tbbtyrnqf.t.qbhoyrpyvpx.arg/cntrnq/nqf?pyvrag=pn-svz_zlfcnpr_zlfcnpr-ubzrcntr_wf&qg=1231365765292&uy=ra&nqfnsr=uvtu&br=hgs8&ahz_nqf=4&bhgchg=wf&nqgrfg=bss&pbeeryngbe=1231365765292&punaary=svz_zlfcnpr_ubzrcntr_abgybttrqva%2Psvz_zlfcnpr_aba_HTP%2Psvz_zlfcnpr_havgrq-fgngrf&hey=uggc%3N%2S%2Sohyyrgvaf.zlfcnpr.pbz%2Svaqrk.psz&nq_glcr=grkg&rvq=6083027&rn=0&sez=0&tn_ivq=1579793869.1231365768&tn_fvq=1231365768&tn_uvq=2056210897&synfu=9.0.115&h_u=768&h_j=1024&h_nu=738&h_nj=1024&h_pq=24&h_gm=-480&h_uvf=2&h_wnin=gehr&h_acyht=7&h_azvzr=22';\n var str73 = 'frnepu.zvpebfbsg.pbz';\n var str74 = 'frnepu.zvpebfbsg.pbz/';\n var str75 = 'ZFPhygher=VC=74.125.75.17&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669340386893867&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str76 = 'ZFPhygher=VC=74.125.75.17&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669340386893867&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n\n function runBlock10() {\n for (var i = 0; i < 3; i++) {\n '%3Szxg=ra-HF'.replace(re39, '');\n '-8'.replace(re40, '');\n '-8'.replace(re10, '');\n '-8'.replace(re51, '');\n '-8'.replace(re52, '');\n '-8'.replace(re53, '');\n '-8'.replace(re39, '');\n '-8'.replace(re54, '');\n '1.5'.replace(re40, '');\n '1.5'.replace(re10, '');\n '1.5'.replace(re51, '');\n '1.5'.replace(re52, '');\n '1.5'.replace(re53, '');\n '1.5'.replace(re39, '');\n '1.5'.replace(re54, '');\n '1024k768'.replace(re40, '');\n '1024k768'.replace(re10, '');\n '1024k768'.replace(re51, '');\n '1024k768'.replace(re52, '');\n '1024k768'.replace(re53, '');\n '1024k768'.replace(re39, '');\n '1024k768'.replace(re54, '');\n str64.replace(re40, '');\n str64.replace(re10, '');\n str64.replace(re51, '');\n str64.replace(re52, '');\n str64.replace(re53, '');\n str64.replace(re39, '');\n str64.replace(re54, '');\n '14'.replace(re40, '');\n '14'.replace(re10, '');\n '14'.replace(re51, '');\n '14'.replace(re52, '');\n '14'.replace(re53, '');\n '14'.replace(re39, '');\n '14'.replace(re54, '');\n '24'.replace(re40, '');\n '24'.replace(re10, '');\n '24'.replace(re51, '');\n '24'.replace(re52, '');\n '24'.replace(re53, '');\n '24'.replace(re39, '');\n '24'.replace(re54, '');\n str65.replace(re40, '');\n str65.replace(re10, '');\n str65.replace(re51, '');\n str65.replace(re52, '');\n str65.replace(re53, '');\n str65.replace(re39, '');\n str65.replace(re54, '');\n str66.replace(re40, '');\n str66.replace(re10, '');\n str66.replace(re51, '');\n str66.replace(re52, '');\n str66.replace(re53, '');\n str66.replace(re39, '');\n str66.replace(re54, '');\n '9.0'.replace(re40, '');\n '9.0'.replace(re10, '');\n '9.0'.replace(re51, '');\n '9.0'.replace(re52, '');\n '9.0'.replace(re53, '');\n '9.0'.replace(re39, '');\n '9.0'.replace(re54, '');\n '994k634'.replace(re40, '');\n '994k634'.replace(re10, '');\n '994k634'.replace(re51, '');\n '994k634'.replace(re52, '');\n '994k634'.replace(re53, '');\n '994k634'.replace(re39, '');\n '994k634'.replace(re54, '');\n '?zxg=ra-HF'.replace(re40, '');\n '?zxg=ra-HF'.replace(re10, '');\n '?zxg=ra-HF'.replace(re51, '');\n '?zxg=ra-HF'.replace(re52, '');\n '?zxg=ra-HF'.replace(re53, '');\n '?zxg=ra-HF'.replace(re54, '');\n 'PAA.pbz'.replace(re25, '');\n 'PAA.pbz'.replace(re12, '');\n 'PAA.pbz'.replace(re39, '');\n 'Qngr & Gvzr'.replace(re25, '');\n 'Qngr & Gvzr'.replace(re12, '');\n 'Qngr & Gvzr'.replace(re39, '');\n 'Frnepu Zvpebfbsg.pbz'.replace(re40, '');\n 'Frnepu Zvpebfbsg.pbz'.replace(re54, '');\n str67.replace(re10, '');\n str67.replace(re51, '');\n str67.replace(re52, '');\n str67.replace(re53, '');\n str67.replace(re39, '');\n str68.split(re32);\n str69.split(re32);\n str70.replace(re52, '');\n str70.replace(re53, '');\n str70.replace(re39, '');\n str71.replace(re40, '');\n str71.replace(re10, '');\n str71.replace(re51, '');\n str71.replace(re54, '');\n 'Jrngure'.replace(re25, '');\n 'Jrngure'.replace(re12, '');\n 'Jrngure'.replace(re39, '');\n 'LbhGhor'.replace(re25, '');\n 'LbhGhor'.replace(re12, '');\n 'LbhGhor'.replace(re39, '');\n str72.replace(re33, '');\n 'erzbgr_vsenzr_1'.replace(/^erzbgr_vsenzr_/, '');\n str73.replace(re40, '');\n str73.replace(re10, '');\n str73.replace(re51, '');\n str73.replace(re52, '');\n str73.replace(re53, '');\n str73.replace(re39, '');\n str73.replace(re54, '');\n str74.replace(re40, '');\n str74.replace(re10, '');\n str74.replace(re51, '');\n str74.replace(re52, '');\n str74.replace(re53, '');\n str74.replace(re39, '');\n str74.replace(re54, '');\n 'lhv-h'.replace(/\\-/g, '');\n re9.exec('p');\n re9.exec('qz p');\n re9.exec('zbqynory');\n re9.exec('lhv-h svefg');\n re8.exec('144631658.0.10.1231365779');\n re8.exec('144631658.1231365779.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.1877536177953918500.1231365779.1231365779.1231365779.1');\n re8.exec(str75);\n re8.exec(str76);\n re8.exec('__hgzn=144631658.1877536177953918500.1231365779.1231365779.1231365779.1');\n re8.exec('__hgzo=144631658.0.10.1231365779');\n re8.exec('__hgzm=144631658.1231365779.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re34.exec(str68);\n re34.exec(str69);\n /^$/.exec('');\n re31.exec('qr');\n /^znk\\d+$/.exec('');\n /^zva\\d+$/.exec('');\n /^erfgber$/.exec('');\n re85.exec('zbqobkva zbqobk_abcnqqvat ');\n re85.exec('zbqgvgyr');\n re85.exec('eaq_zbqobkva ');\n re85.exec('eaq_zbqgvgyr ');\n /frpgvba\\d+_pbagragf/.exec('obggbz_ani');\n }\n }\n\n var re86 = /;\\s*/;\n var re87 = /(\\$\\{inyhr\\})|(\\$inyhr\\b)/g;\n var re88 = /(\\$\\{abj\\})|(\\$abj\\b)/g;\n var re89 = /\\s+$/;\n var re90 = /^\\s+/;\n var re91 = /(\\\\\\\"|\\x00-|\\x1f|\\x7f-|\\x9f|\\u00ad|\\u0600-|\\u0604|\\u070f|\\u17b4|\\u17b5|\\u200c-|\\u200f|\\u2028-|\\u202f|\\u2060-|\\u206f|\\ufeff|\\ufff0-|\\uffff)/g;\n var re92 = /^(:)([\\w-]+)\\(\"?'?(.*?(\\(.*?\\))?[^(]*?)\"?'?\\)/;\n var re93 = /^([:.#]*)((?:[\\w\\u0128-\\uffff*_-]|\\\\.)+)/;\n var re94 = /^(\\[) *@?([\\w-]+) *([!*$^~=]*) *('?\"?)(.*?)\\4 *\\]/;\n var str77 = '#fubhgobk .pybfr';\n var str78 = 'FrffvbaQQS2=102n9o0o9pq60132qn0337rr867p75953502q2s27s2s5r98; ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669341278771470&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=; AFP_zp_dfctwzssrwh-aowb_80=441326q33660';\n var str79 = 'FrffvbaQQS2=102n9o0o9pq60132qn0337rr867p75953502q2s27s2s5r98; AFP_zp_dfctwzssrwh-aowb_80=441326q33660; __hgzm=144631658.1231365869.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.1670816052019209000.1231365869.1231365869.1231365869.1; __hgzo=144631658.0.10.1231365869; __hgzp=144631658; ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669341278771470&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str80 = 'FrffvbaQQS2=9995p6rp12rrnr893334ro7nq70o7p64p69rqn844prs1473; ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669350559478880&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=; AFP_zp_dfctwzs-aowb_80=441327q73660';\n var str81 = 'FrffvbaQQS2=9995p6rp12rrnr893334ro7nq70o7p64p69rqn844prs1473; AFP_zp_dfctwzs-aowb_80=441327q73660; __hgzm=144631658.1231367054.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar); __hgzn=144631658.1796080716621419500.1231367054.1231367054.1231367054.1; __hgzo=144631658.0.10.1231367054; __hgzp=144631658; ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669350559478880&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str82 = '[glcr=fhozvg]';\n var str83 = 'n.svryqOga,n.svryqOgaPnapry';\n var str84 = 'n.svryqOgaPnapry';\n var str85 = 'oyvpxchaxg';\n var str86 = 'qvi.bow-nppbeqvba qg';\n var str87 = 'uggc://tbbtyrnqf.t.qbhoyrpyvpx.arg/cntrnq/nqf?pyvrag=pn-svz_zlfcnpr_nccf_wf&qg=1231367052227&uy=ra&nqfnsr=uvtu&br=hgs8&ahz_nqf=4&bhgchg=wf&nqgrfg=bss&pbeeryngbe=1231367052227&punaary=svz_zlfcnpr_nccf-pnainf%2Psvz_zlfcnpr_havgrq-fgngrf&hey=uggc%3N%2S%2Scebsvyr.zlfcnpr.pbz%2SZbqhyrf%2SNccyvpngvbaf%2SCntrf%2SPnainf.nfck&nq_glcr=grkg&rvq=6083027&rn=0&sez=1&tn_ivq=716357910.1231367056&tn_fvq=1231367056&tn_uvq=1387206491&synfu=9.0.115&h_u=768&h_j=1024&h_nu=738&h_nj=1024&h_pq=24&h_gm=-480&h_uvf=2&h_wnin=gehr&h_acyht=7&h_azvzr=22';\n var str88 = 'uggc://tbbtyrnqf.t.qbhoyrpyvpx.arg/cntrnq/nqf?pyvrag=pn-svz_zlfcnpr_zlfcnpr-ubzrcntr_wf&qg=1231365851658&uy=ra&nqfnsr=uvtu&br=hgs8&ahz_nqf=4&bhgchg=wf&nqgrfg=bss&pbeeryngbe=1231365851658&punaary=svz_zlfcnpr_ubzrcntr_abgybttrqva%2Psvz_zlfcnpr_aba_HTP%2Psvz_zlfcnpr_havgrq-fgngrf&hey=uggc%3N%2S%2Scebsvyrrqvg.zlfcnpr.pbz%2Svaqrk.psz&nq_glcr=grkg&rvq=6083027&rn=0&sez=0&tn_ivq=1979828129.1231365855&tn_fvq=1231365855&tn_uvq=2085229649&synfu=9.0.115&h_u=768&h_j=1024&h_nu=738&h_nj=1024&h_pq=24&h_gm=-480&h_uvf=2&h_wnin=gehr&h_acyht=7&h_azvzr=22';\n var str89 = 'uggc://zfacbegny.112.2b7.arg/o/ff/zfacbegnyubzr/1/U.7-cqi-2/f55023338617756?[NDO]&aqu=1&g=7%2S0%2S2009%2014%3N12%3N47%203%20480&af=zfacbegny&cntrAnzr=HF%20UCZFSGJ&t=uggc%3N%2S%2Sjjj.zfa.pbz%2S&f=0k0&p=43835816&x=A&oj=994&ou=634&uc=A&{2}&[NDR]';\n var str90 = 'zrgn[anzr=nwnkHey]';\n var str91 = 'anpuevpugra';\n var str92 = 'b oS={\\'oT\\':1.1};x $8n(B){z(B!=o9)};x $S(B){O(!$8n(B))z A;O(B.4L)z\\'T\\';b S=7t B;O(S==\\'2P\\'&&B.p4){23(B.7f){12 1:z\\'T\\';12 3:z/\\S/.2g(B.8M)?\\'ox\\':\\'oh\\'}}O(S==\\'2P\\'||S==\\'x\\'){23(B.nE){12 2V:z\\'1O\\';12 7I:z\\'5a\\';12 18:z\\'4B\\'}O(7t B.I==\\'4F\\'){O(B.3u)z\\'pG\\';O(B.8e)z\\'1p\\'}}z S};x $2p(){b 4E={};Z(b v=0;v<1p.I;v++){Z(b X 1o 1p[v]){b nc=1p[v][X];b 6E=4E[X];O(6E&&$S(nc)==\\'2P\\'&&$S(6E)==\\'2P\\')4E[X]=$2p(6E,nc);17 4E[X]=nc}}z 4E};b $E=7p.E=x(){b 1d=1p;O(!1d[1])1d=[p,1d[0]];Z(b X 1o 1d[1])1d[0][X]=1d[1][X];z 1d[0]};b $4D=7p.pJ=x(){Z(b v=0,y=1p.I;v-1:p.3F(2R)>-1},nX:x(){z p.3y(/([.*+?^${}()|[\\]\\/\\\\])/t,\\'\\\\$1\\')}});2V.E({5V:x(1O){O(p.I<3)z A;O(p.I==4&&p[3]==0&&!1O)z\\'p5\\';b 3P=[];Z(b v=0;v<3;v++){b 52=(p[v]-0).4h(16);3P.1x((52.I==1)?\\'0\\'+52:52)}z 1O?3P:\\'#\\'+3P.2u(\\'\\')},5U:x(1O){O(p.I!=3)z A;b 1i=[];Z(b v=0;v<3;v++){1i.1x(5K((p[v].I==1)?p[v]+p[v]:p[v],16))}z 1O?1i:\\'1i(\\'+1i.2u(\\',\\')+\\')\\'}});7F.E({3n:x(P){b J=p;P=$2p({\\'L\\':J,\\'V\\':A,\\'1p\\':1S,\\'2x\\':A,\\'4s\\':A,\\'6W\\':A},P);O($2O(P.1p)&&$S(P.1p)!=\\'1O\\')P.1p=[P.1p];z x(V){b 1d;O(P.V){V=V||H.V;1d=[(P.V===1r)?V:Y P.V(V)];O(P.1p)1d.E(P.1p)}17 1d=P.1p||1p;b 3C=x(){z J.3H($5S(P';\n var str93 = 'hagreunyghat';\n var str94 = 'ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669341278771470&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str95 = 'ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&Pbhagel=IIZ%3Q&SbeprqRkcvengvba=633669350559478880&gvzrMbar=-8&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R%3Q';\n var str96 = 'ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669341278771470&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var str97 = 'ZFPhygher=VC=74.125.75.1&VCPhygher=ra-HF&CersreerqPhygher=ra-HF&CersreerqPhygherCraqvat=&Pbhagel=IIZ=&SbeprqRkcvengvba=633669350559478880&gvzrMbar=0&HFEYBP=DKWyLHAiMTH9AwHjWxAcqUx9GJ91oaEunJ4tIzyyqlMQo3IhqUW5D29xMG1IHlMQo3IhqUW5GzSgMG1Iozy0MJDtH3EuqTImWxEgLHAiMTH9BQN3WxkuqTy0qJEyCGZ3YwDkBGVzGT9hM2y0qJEyCF0kZwVhZQH3APMDo3A0LJkQo2EyCGx0ZQDmWyWyM2yiox5uoJH9D0R=';\n var str98 = 'shapgvba (){Cuk.Nccyvpngvba.Frghc.Pber();Cuk.Nccyvpngvba.Frghc.Nwnk();Cuk.Nccyvpngvba.Frghc.Synfu();Cuk.Nccyvpngvba.Frghc.Zbqhyrf()}';\n\n function runBlock11() {\n for (var i = 0; i < 2; i++) {\n ' .pybfr'.replace(re18, '');\n ' n.svryqOgaPnapry'.replace(re18, '');\n ' qg'.replace(re18, '');\n str77.replace(re68, '');\n str77.replace(re18, '');\n ''.replace(re39, '');\n ''.replace(/^/, '');\n ''.split(re86);\n '*'.replace(re39, '');\n '*'.replace(re68, '');\n '*'.replace(re18, '');\n '.pybfr'.replace(re68, '');\n '.pybfr'.replace(re18, '');\n '//vzt.jro.qr/vij/FC/tzk_uc/fperra/${inyhr}?gf=${abj}'.replace(re87, '');\n '//vzt.jro.qr/vij/FC/tzk_uc/fperra/1024?gf=${abj}'.replace(re88, '');\n '//vzt.jro.qr/vij/FC/tzk_uc/jvafvmr/${inyhr}?gf=${abj}'.replace(re87, '');\n '//vzt.jro.qr/vij/FC/tzk_uc/jvafvmr/992/608?gf=${abj}'.replace(re88, '');\n '300k120'.replace(re30, '');\n '300k250'.replace(re30, '');\n '310k120'.replace(re30, '');\n '310k170'.replace(re30, '');\n '310k250'.replace(re30, '');\n '9.0 e115'.replace(/^.*\\.(.*)\\s.*$/, '');\n 'Nppbeqvba'.replace(re2, '');\n 'Nxghryy\\x0a'.replace(re89, '');\n 'Nxghryy\\x0a'.replace(re90, '');\n 'Nccyvpngvba'.replace(re2, '');\n 'Oyvpxchaxg\\x0a'.replace(re89, '');\n 'Oyvpxchaxg\\x0a'.replace(re90, '');\n 'Svanamra\\x0a'.replace(re89, '');\n 'Svanamra\\x0a'.replace(re90, '');\n 'Tnzrf\\x0a'.replace(re89, '');\n 'Tnzrf\\x0a'.replace(re90, '');\n 'Ubebfxbc\\x0a'.replace(re89, '');\n 'Ubebfxbc\\x0a'.replace(re90, '');\n 'Xvab\\x0a'.replace(re89, '');\n 'Xvab\\x0a'.replace(re90, '');\n 'Zbqhyrf'.replace(re2, '');\n 'Zhfvx\\x0a'.replace(re89, '');\n 'Zhfvx\\x0a'.replace(re90, '');\n 'Anpuevpugra\\x0a'.replace(re89, '');\n 'Anpuevpugra\\x0a'.replace(re90, '');\n 'Cuk'.replace(re2, '');\n 'ErdhrfgSvavfu'.split(re70);\n 'ErdhrfgSvavfu.NWNK.Cuk'.split(re70);\n 'Ebhgr\\x0a'.replace(re89, '');\n 'Ebhgr\\x0a'.replace(re90, '');\n str78.split(re32);\n str79.split(re32);\n str80.split(re32);\n str81.split(re32);\n 'Fcbeg\\x0a'.replace(re89, '');\n 'Fcbeg\\x0a'.replace(re90, '');\n 'GI-Fcbg\\x0a'.replace(re89, '');\n 'GI-Fcbg\\x0a'.replace(re90, '');\n 'Gbhe\\x0a'.replace(re89, '');\n 'Gbhe\\x0a'.replace(re90, '');\n 'Hagreunyghat\\x0a'.replace(re89, '');\n 'Hagreunyghat\\x0a'.replace(re90, '');\n 'Ivqrb\\x0a'.replace(re89, '');\n 'Ivqrb\\x0a'.replace(re90, '');\n 'Jrggre\\x0a'.replace(re89, '');\n 'Jrggre\\x0a'.replace(re90, '');\n str82.replace(re68, '');\n str82.replace(re18, '');\n str83.replace(re68, '');\n str83.replace(re18, '');\n str84.replace(re68, '');\n str84.replace(re18, '');\n 'nqiFreivprObk'.replace(re30, '');\n 'nqiFubccvatObk'.replace(re30, '');\n 'nwnk'.replace(re39, '');\n 'nxghryy'.replace(re40, '');\n 'nxghryy'.replace(re41, '');\n 'nxghryy'.replace(re42, '');\n 'nxghryy'.replace(re43, '');\n 'nxghryy'.replace(re44, '');\n 'nxghryy'.replace(re45, '');\n 'nxghryy'.replace(re46, '');\n 'nxghryy'.replace(re47, '');\n 'nxghryy'.replace(re48, '');\n str85.replace(re40, '');\n str85.replace(re41, '');\n str85.replace(re42, '');\n str85.replace(re43, '');\n str85.replace(re44, '');\n str85.replace(re45, '');\n str85.replace(re46, '');\n str85.replace(re47, '');\n str85.replace(re48, '');\n 'pngrtbel'.replace(re29, '');\n 'pngrtbel'.replace(re30, '');\n 'pybfr'.replace(re39, '');\n 'qvi'.replace(re39, '');\n str86.replace(re68, '');\n str86.replace(re18, '');\n 'qg'.replace(re39, '');\n 'qg'.replace(re68, '');\n 'qg'.replace(re18, '');\n 'rzorq'.replace(re39, '');\n 'rzorq'.replace(re68, '');\n 'rzorq'.replace(re18, '');\n 'svryqOga'.replace(re39, '');\n 'svryqOgaPnapry'.replace(re39, '');\n 'svz_zlfcnpr_nccf-pnainf,svz_zlfcnpr_havgrq-fgngrf'.split(re20);\n 'svanamra'.replace(re40, '');\n 'svanamra'.replace(re41, '');\n 'svanamra'.replace(re42, '');\n 'svanamra'.replace(re43, '');\n 'svanamra'.replace(re44, '');\n 'svanamra'.replace(re45, '');\n 'svanamra'.replace(re46, '');\n 'svanamra'.replace(re47, '');\n 'svanamra'.replace(re48, '');\n 'sbphf'.split(re70);\n 'sbphf.gno sbphfva.gno'.split(re70);\n 'sbphfva'.split(re70);\n 'sbez'.replace(re39, '');\n 'sbez.nwnk'.replace(re68, '');\n 'sbez.nwnk'.replace(re18, '');\n 'tnzrf'.replace(re40, '');\n 'tnzrf'.replace(re41, '');\n 'tnzrf'.replace(re42, '');\n 'tnzrf'.replace(re43, '');\n 'tnzrf'.replace(re44, '');\n 'tnzrf'.replace(re45, '');\n 'tnzrf'.replace(re46, '');\n 'tnzrf'.replace(re47, '');\n 'tnzrf'.replace(re48, '');\n 'ubzrcntr'.replace(re30, '');\n 'ubebfxbc'.replace(re40, '');\n 'ubebfxbc'.replace(re41, '');\n 'ubebfxbc'.replace(re42, '');\n 'ubebfxbc'.replace(re43, '');\n 'ubebfxbc'.replace(re44, '');\n 'ubebfxbc'.replace(re45, '');\n 'ubebfxbc'.replace(re46, '');\n 'ubebfxbc'.replace(re47, '');\n 'ubebfxbc'.replace(re48, '');\n 'uc_cebzbobk_ugzy%2Puc_cebzbobk_vzt'.replace(re30, '');\n 'uc_erpgnatyr'.replace(re30, '');\n str87.replace(re33, '');\n str88.replace(re33, '');\n 'uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/onfr.wf${4}${5}'.replace(re71, '');\n 'uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/onfr.wf${5}'.replace(re72, '');\n 'uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/qlaYvo.wf${4}${5}'.replace(re71, '');\n 'uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/qlaYvo.wf${5}'.replace(re72, '');\n 'uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/rssrpgYvo.wf${4}${5}'.replace(re71, '');\n 'uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/rssrpgYvo.wf${5}'.replace(re72, '');\n str89.replace(re73, '');\n 'uggc://zfacbegny.112.2b7.arg/o/ff/zfacbegnyubzr/1/U.7-cqi-2/f55023338617756?[NDO]&{1}&{2}&[NDR]'.replace(re69, '');\n str6.replace(re23, '');\n 'xvab'.replace(re40, '');\n 'xvab'.replace(re41, '');\n 'xvab'.replace(re42, '');\n 'xvab'.replace(re43, '');\n 'xvab'.replace(re44, '');\n 'xvab'.replace(re45, '');\n 'xvab'.replace(re46, '');\n 'xvab'.replace(re47, '');\n 'xvab'.replace(re48, '');\n 'ybnq'.split(re70);\n 'zrqvnzbqgno lhv-anifrg lhv-anifrg-gbc'.replace(re18, '');\n 'zrgn'.replace(re39, '');\n str90.replace(re68, '');\n str90.replace(re18, '');\n 'zbhfrzbir'.split(re70);\n 'zbhfrzbir.gno'.split(re70);\n str63.replace(/^.*jroxvg\\/(\\d+(\\.\\d+)?).*$/, '');\n 'zhfvx'.replace(re40, '');\n 'zhfvx'.replace(re41, '');\n 'zhfvx'.replace(re42, '');\n 'zhfvx'.replace(re43, '');\n 'zhfvx'.replace(re44, '');\n 'zhfvx'.replace(re45, '');\n 'zhfvx'.replace(re46, '');\n 'zhfvx'.replace(re47, '');\n 'zhfvx'.replace(re48, '');\n 'zlfcnpr_nccf_pnainf'.replace(re52, '');\n str91.replace(re40, '');\n str91.replace(re41, '');\n str91.replace(re42, '');\n str91.replace(re43, '');\n str91.replace(re44, '');\n str91.replace(re45, '');\n str91.replace(re46, '');\n str91.replace(re47, '');\n str91.replace(re48, '');\n 'anzr'.replace(re39, '');\n str92.replace(/\\b\\w+\\b/g, '');\n 'bow-nppbeqvba'.replace(re39, '');\n 'bowrpg'.replace(re39, '');\n 'bowrpg'.replace(re68, '');\n 'bowrpg'.replace(re18, '');\n 'cnenzf%2Rfglyrf'.replace(re29, '');\n 'cnenzf%2Rfglyrf'.replace(re30, '');\n 'cbchc'.replace(re30, '');\n 'ebhgr'.replace(re40, '');\n 'ebhgr'.replace(re41, '');\n 'ebhgr'.replace(re42, '');\n 'ebhgr'.replace(re43, '');\n 'ebhgr'.replace(re44, '');\n 'ebhgr'.replace(re45, '');\n 'ebhgr'.replace(re46, '');\n 'ebhgr'.replace(re47, '');\n 'ebhgr'.replace(re48, '');\n 'freivprobk_uc'.replace(re30, '');\n 'fubccvatobk_uc'.replace(re30, '');\n 'fubhgobk'.replace(re39, '');\n 'fcbeg'.replace(re40, '');\n 'fcbeg'.replace(re41, '');\n 'fcbeg'.replace(re42, '');\n 'fcbeg'.replace(re43, '');\n 'fcbeg'.replace(re44, '');\n 'fcbeg'.replace(re45, '');\n 'fcbeg'.replace(re46, '');\n 'fcbeg'.replace(re47, '');\n 'fcbeg'.replace(re48, '');\n 'gbhe'.replace(re40, '');\n 'gbhe'.replace(re41, '');\n 'gbhe'.replace(re42, '');\n 'gbhe'.replace(re43, '');\n 'gbhe'.replace(re44, '');\n 'gbhe'.replace(re45, '');\n 'gbhe'.replace(re46, '');\n 'gbhe'.replace(re47, '');\n 'gbhe'.replace(re48, '');\n 'gi-fcbg'.replace(re40, '');\n 'gi-fcbg'.replace(re41, '');\n 'gi-fcbg'.replace(re42, '');\n 'gi-fcbg'.replace(re43, '');\n 'gi-fcbg'.replace(re44, '');\n 'gi-fcbg'.replace(re45, '');\n 'gi-fcbg'.replace(re46, '');\n 'gi-fcbg'.replace(re47, '');\n 'gi-fcbg'.replace(re48, '');\n 'glcr'.replace(re39, '');\n 'haqrsvarq'.replace(/\\//g, '');\n str93.replace(re40, '');\n str93.replace(re41, '');\n str93.replace(re42, '');\n str93.replace(re43, '');\n str93.replace(re44, '');\n str93.replace(re45, '');\n str93.replace(re46, '');\n str93.replace(re47, '');\n str93.replace(re48, '');\n 'ivqrb'.replace(re40, '');\n 'ivqrb'.replace(re41, '');\n 'ivqrb'.replace(re42, '');\n 'ivqrb'.replace(re43, '');\n 'ivqrb'.replace(re44, '');\n 'ivqrb'.replace(re45, '');\n 'ivqrb'.replace(re46, '');\n 'ivqrb'.replace(re47, '');\n 'ivqrb'.replace(re48, '');\n 'ivfvgf=1'.split(re86);\n 'jrggre'.replace(re40, '');\n 'jrggre'.replace(re41, '');\n 'jrggre'.replace(re42, '');\n 'jrggre'.replace(re43, '');\n 'jrggre'.replace(re44, '');\n 'jrggre'.replace(re45, '');\n 'jrggre'.replace(re46, '');\n 'jrggre'.replace(re47, '');\n 'jrggre'.replace(re48, '');\n /#[a-z0-9]+$/i.exec('uggc://jjj.fpuhryreim.arg/Qrsnhyg');\n re66.exec('fryrpgrq');\n /(?:^|\\s+)lhv-ani(?:\\s+|$)/.exec('sff lhv-ani');\n /(?:^|\\s+)lhv-anifrg(?:\\s+|$)/.exec('zrqvnzbqgno lhv-anifrg');\n /(?:^|\\s+)lhv-anifrg-gbc(?:\\s+|$)/.exec('zrqvnzbqgno lhv-anifrg');\n re91.exec('GnoThvq');\n re91.exec('thvq');\n /(pbzcngvoyr|jroxvg)/.exec(str63);\n /.+(?:ei|vg|en|vr)[\\/: ]([\\d.]+)/.exec(str63);\n re8.exec('144631658.0.10.1231365869');\n re8.exec('144631658.0.10.1231367054');\n re8.exec('144631658.1231365869.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.1231367054.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('144631658.1670816052019209000.1231365869.1231365869.1231365869.1');\n re8.exec('144631658.1796080716621419500.1231367054.1231367054.1231367054.1');\n re8.exec(str94);\n re8.exec(str95);\n re8.exec(str96);\n re8.exec(str97);\n re8.exec('__hgzn=144631658.1670816052019209000.1231365869.1231365869.1231365869.1');\n re8.exec('__hgzn=144631658.1796080716621419500.1231367054.1231367054.1231367054.1');\n re8.exec('__hgzo=144631658.0.10.1231365869');\n re8.exec('__hgzo=144631658.0.10.1231367054');\n re8.exec('__hgzm=144631658.1231365869.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re8.exec('__hgzm=144631658.1231367054.1.1.hgzpfe=(qverpg)|hgzppa=(qverpg)|hgzpzq=(abar)');\n re34.exec(str78);\n re34.exec(str79);\n re34.exec(str81);\n re74.exec(str77);\n re74.exec('*');\n re74.exec(str82);\n re74.exec(str83);\n re74.exec(str86);\n re74.exec('rzorq');\n re74.exec('sbez.nwnk');\n re74.exec(str90);\n re74.exec('bowrpg');\n /\\/onfr.wf(\\?.+)?$/.exec('/uggc://wf.hv-cbegny.qr/tzk/ubzr/wf/20080602/onfr.wf');\n re28.exec('uvag ynfgUvag ynfg');\n re75.exec('');\n re76.exec('');\n re77.exec('');\n re78.exec('');\n re80.exec(str77);\n re80.exec('*');\n re80.exec('.pybfr');\n re80.exec(str82);\n re80.exec(str83);\n re80.exec(str84);\n re80.exec(str86);\n re80.exec('qg');\n re80.exec('rzorq');\n re80.exec('sbez.nwnk');\n re80.exec(str90);\n re80.exec('bowrpg');\n re61.exec('qlaYvo.wf');\n re61.exec('rssrpgYvo.wf');\n re61.exec('uggc://jjj.tzk.arg/qr/?fgnghf=uvajrvf');\n re92.exec(' .pybfr');\n re92.exec(' n.svryqOgaPnapry');\n re92.exec(' qg');\n re92.exec(str48);\n re92.exec('.nwnk');\n re92.exec('.svryqOga,n.svryqOgaPnapry');\n re92.exec('.svryqOgaPnapry');\n re92.exec('.bow-nppbeqvba qg');\n re68.exec(str77);\n re68.exec('*');\n re68.exec('.pybfr');\n re68.exec(str82);\n re68.exec(str83);\n re68.exec(str84);\n re68.exec(str86);\n re68.exec('qg');\n re68.exec('rzorq');\n re68.exec('sbez.nwnk');\n re68.exec(str90);\n re68.exec('bowrpg');\n re93.exec(' .pybfr');\n re93.exec(' n.svryqOgaPnapry');\n re93.exec(' qg');\n re93.exec(str48);\n re93.exec('.nwnk');\n re93.exec('.svryqOga,n.svryqOgaPnapry');\n re93.exec('.svryqOgaPnapry');\n re93.exec('.bow-nppbeqvba qg');\n re81.exec(str77);\n re81.exec('*');\n re81.exec(str48);\n re81.exec('.pybfr');\n re81.exec(str82);\n re81.exec(str83);\n re81.exec(str84);\n re81.exec(str86);\n re81.exec('qg');\n re81.exec('rzorq');\n re81.exec('sbez.nwnk');\n re81.exec(str90);\n re81.exec('bowrpg');\n re94.exec(' .pybfr');\n re94.exec(' n.svryqOgaPnapry');\n re94.exec(' qg');\n re94.exec(str48);\n re94.exec('.nwnk');\n re94.exec('.svryqOga,n.svryqOgaPnapry');\n re94.exec('.svryqOgaPnapry');\n re94.exec('.bow-nppbeqvba qg');\n re94.exec('[anzr=nwnkHey]');\n re94.exec(str82);\n re31.exec('rf');\n re31.exec('wn');\n re82.exec(str77);\n re82.exec('*');\n re82.exec(str48);\n re82.exec('.pybfr');\n re82.exec(str82);\n re82.exec(str83);\n re82.exec(str84);\n re82.exec(str86);\n re82.exec('qg');\n re82.exec('rzorq');\n re82.exec('sbez.nwnk');\n re82.exec(str90);\n re82.exec('bowrpg');\n re83.exec(str98);\n re83.exec('shapgvba sbphf() { [angvir pbqr] }');\n re62.exec('#Ybtva');\n re62.exec('#Ybtva_cnffjbeq');\n re62.exec(str77);\n re62.exec('#fubhgobkWf');\n re62.exec('#fubhgobkWfReebe');\n re62.exec('#fubhgobkWfFhpprff');\n re62.exec('*');\n re62.exec(str82);\n re62.exec(str83);\n re62.exec(str86);\n re62.exec('rzorq');\n re62.exec('sbez.nwnk');\n re62.exec(str90);\n re62.exec('bowrpg');\n re49.exec('pbagrag');\n re24.exec(str6);\n /xbadhrebe/.exec(str63);\n /znp/.exec('jva32');\n /zbmvyyn/.exec(str63);\n /zfvr/.exec(str63);\n /ag\\s5\\.1/.exec(str63);\n /bcren/.exec(str63);\n /fnsnev/.exec(str63);\n /jva/.exec('jva32');\n /jvaqbjf/.exec(str63);\n }\n }\n\n function run() {\n for (var i = 0; i < 5; i++) {\n runBlock0();\n runBlock1();\n runBlock2();\n runBlock3();\n runBlock4();\n runBlock5();\n runBlock6();\n runBlock7();\n runBlock8();\n runBlock9();\n runBlock10();\n runBlock11();\n }\n }\n\n this.run = run;\n}\n\n/* run_harness.js */\nvar print = console.log;\n\nfunction Run() {\n BenchmarkSuite.RunSuites({\n NotifyStep: ShowProgress,\n NotifyError: AddError,\n NotifyResult: AddResult,\n NotifyScore: AddScore,\n });\n}\n\nvar harnessErrorCount = 0;\n\nfunction ShowProgress(name) {\n print(\"PROGRESS\", name);\n}\n\nfunction AddError(name, error) {\n print(\"ERROR\", name, error);\n print(error.stack);\n harnessErrorCount++;\n}\n\nfunction AddResult(name, result) {\n print(\"RESULT\", name, result);\n}\n\nfunction AddScore(score) {\n print(\"SCORE\", score);\n}\n\nfunction main() {\n Run();\n}\n" }, { "path": "benches/scripts/v8-benches/richards.js", "content": "\"use strict\";\n\"use strip\";\n// Copyright 2012 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Simple framework for running the benchmark suites and\n// computing a score based on the timing measurements.\n\n\n// A benchmark has a name (string) and a function that will be run to\n// do the performance measurement. The optional setup and tearDown\n// arguments are functions that will be invoked before and after\n// running the benchmark, but the running time of these functions will\n// not be accounted for in the benchmark score.\nfunction Benchmark(name, run, setup, tearDown) {\n this.name = name;\n this.run = run;\n this.Setup = setup ? setup : function () {\n };\n this.TearDown = tearDown ? tearDown : function () {\n };\n}\n\n\n// Benchmark results hold the benchmark and the measured time used to\n// run the benchmark. The benchmark score is computed later once a\n// full benchmark suite has run to completion.\nfunction BenchmarkResult(benchmark, time) {\n this.benchmark = benchmark;\n this.time = time;\n}\n\n\n// Automatically convert results to numbers. Used by the geometric\n// mean computation.\nBenchmarkResult.prototype.valueOf = function () {\n return this.time;\n};\n\n\n// Suites of benchmarks consist of a name and the set of benchmarks in\n// addition to the reference timing that the final score will be based\n// on. This way, all scores are relative to a reference run and higher\n// scores implies better performance.\nfunction BenchmarkSuite(name, reference, benchmarks) {\n this.name = name;\n this.reference = reference;\n this.benchmarks = benchmarks;\n BenchmarkSuite.suites.push(this);\n}\n\n\n// Keep track of all declared benchmark suites.\nBenchmarkSuite.suites = [];\n\n\n// Scores are not comparable across versions. Bump the version if\n// you're making changes that will affect that scores, e.g. if you add\n// a new benchmark or change an existing one.\nBenchmarkSuite.version = '7';\n\n\n// To make the benchmark results predictable, we replace Math.random\n// with a 100% deterministic alternative.\nMath.random = (function () {\n var seed = 49734321;\n return function () {\n // Robert Jenkins' 32 bit integer hash function.\n seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff;\n seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff;\n seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff;\n seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff;\n seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff;\n seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff;\n return (seed & 0xfffffff) / 0x10000000;\n };\n})();\n\n\n// Runs all registered benchmark suites and optionally yields between\n// each individual benchmark to avoid running for too long in the\n// context of browsers. Once done, the final score is reported to the\n// runner.\nBenchmarkSuite.RunSuites = function (runner) {\n var continuation = null;\n var suites = BenchmarkSuite.suites;\n var length = suites.length;\n BenchmarkSuite.scores = [];\n var index = 0;\n\n function RunStep() {\n while (continuation || index < length) {\n if (continuation) {\n continuation = continuation();\n } else {\n var suite = suites[index++];\n if (runner.NotifyStart) runner.NotifyStart(suite.name);\n continuation = suite.RunStep(runner);\n }\n if (continuation && typeof window != 'undefined' && window.setTimeout) {\n window.setTimeout(RunStep, 25);\n return;\n }\n }\n if (runner.NotifyScore) {\n var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores);\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n runner.NotifyScore(formatted);\n }\n }\n\n RunStep();\n};\n\n\n// Counts the total number of registered benchmarks. Useful for\n// showing progress as a percentage.\nBenchmarkSuite.CountBenchmarks = function () {\n var result = 0;\n var suites = BenchmarkSuite.suites;\n for (var i = 0; i < suites.length; i++) {\n result += suites[i].benchmarks.length;\n }\n return result;\n};\n\n\n// Computes the geometric mean of a set of numbers.\nBenchmarkSuite.GeometricMean = function (numbers) {\n var log = 0;\n for (var i = 0; i < numbers.length; i++) {\n log += Math.log(numbers[i]);\n }\n return Math.pow(Math.E, log / numbers.length);\n};\n\n\n// Converts a score value to a string with at least three significant\n// digits.\nBenchmarkSuite.FormatScore = function (value) {\n if (value > 100) {\n return value.toFixed(0);\n } else {\n return value.toPrecision(3);\n }\n};\n\n// Notifies the runner that we're done running a single benchmark in\n// the benchmark suite. This can be useful to report progress.\nBenchmarkSuite.prototype.NotifyStep = function (result) {\n this.results.push(result);\n if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name);\n};\n\n\n// Notifies the runner that we're done with running a suite and that\n// we have a result which can be reported to the user if needed.\nBenchmarkSuite.prototype.NotifyResult = function () {\n var mean = BenchmarkSuite.GeometricMean(this.results);\n var score = this.reference / mean;\n BenchmarkSuite.scores.push(score);\n if (this.runner.NotifyResult) {\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n this.runner.NotifyResult(this.name, formatted);\n }\n};\n\n\n// Notifies the runner that running a benchmark resulted in an error.\nBenchmarkSuite.prototype.NotifyError = function (error) {\n if (this.runner.NotifyError) {\n this.runner.NotifyError(this.name, error);\n }\n if (this.runner.NotifyStep) {\n this.runner.NotifyStep(this.name);\n }\n};\n\n\n// Runs a single benchmark for at least a second and computes the\n// average time it takes to run a single iteration.\nBenchmarkSuite.prototype.RunSingleBenchmark = function (benchmark, data) {\n function Measure(data) {\n var elapsed = 0;\n var start = new Date();\n for (var n = 0; elapsed < 1000; n++) {\n benchmark.run();\n elapsed = new Date() - start;\n }\n if (data != null) {\n data.runs += n;\n data.elapsed += elapsed;\n }\n }\n\n if (data == null) {\n // Measure the benchmark once for warm up and throw the result\n // away. Return a fresh data object.\n Measure(null);\n return {runs: 0, elapsed: 0};\n } else {\n Measure(data);\n // If we've run too few iterations, we continue for another second.\n if (data.runs < 32) return data;\n var usec = (data.elapsed * 1000) / data.runs;\n this.NotifyStep(new BenchmarkResult(benchmark, usec));\n return null;\n }\n};\n\n\n// This function starts running a suite, but stops between each\n// individual benchmark in the suite and returns a continuation\n// function which can be invoked to run the next benchmark. Once the\n// last benchmark has been executed, null is returned.\nBenchmarkSuite.prototype.RunStep = function (runner) {\n this.results = [];\n this.runner = runner;\n var length = this.benchmarks.length;\n var index = 0;\n var suite = this;\n var data;\n\n // Run the setup, the actual benchmark, and the tear down in three\n // separate steps to allow the framework to yield between any of the\n // steps.\n\n function RunNextSetup() {\n if (index < length) {\n try {\n suite.benchmarks[index].Setup();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextBenchmark;\n }\n suite.NotifyResult();\n return null;\n }\n\n function RunNextBenchmark() {\n try {\n data = suite.RunSingleBenchmark(suite.benchmarks[index], data);\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n // If data is null, we're done with this benchmark.\n return (data == null) ? RunNextTearDown : RunNextBenchmark();\n }\n\n function RunNextTearDown() {\n try {\n suite.benchmarks[index++].TearDown();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextSetup;\n }\n\n // Start out running the setup.\n return RunNextSetup();\n};\n\n\n// Copyright 2006-2008 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n// This is a JavaScript implementation of the Richards\n// benchmark from:\n//\n// http://www.cl.cam.ac.uk/~mr10/Bench.html\n//\n// The benchmark was originally implemented in BCPL by\n// Martin Richards.\n\n\n/**\n * The Richards benchmark simulates the task dispatcher of an\n * operating system.\n **/\nfunction runRichards() {\n var scheduler = new Scheduler();\n scheduler.addIdleTask(ID_IDLE, 0, null, COUNT);\n\n var queue = new Packet(null, ID_WORKER, KIND_WORK);\n queue = new Packet(queue, ID_WORKER, KIND_WORK);\n scheduler.addWorkerTask(ID_WORKER, 1000, queue);\n\n queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);\n queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);\n queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);\n scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);\n\n queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);\n queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);\n queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);\n scheduler.addHandlerTask(ID_HANDLER_B, 3000, queue);\n\n scheduler.addDeviceTask(ID_DEVICE_A, 4000, null);\n\n scheduler.addDeviceTask(ID_DEVICE_B, 5000, null);\n\n scheduler.schedule();\n\n if (scheduler.queueCount != EXPECTED_QUEUE_COUNT ||\n scheduler.holdCount != EXPECTED_HOLD_COUNT) {\n var msg =\n \"Error during execution: queueCount = \" + scheduler.queueCount +\n \", holdCount = \" + scheduler.holdCount + \".\";\n throw new Error(msg);\n }\n}\n\nvar COUNT = 1000;\n\n/**\n * These two constants specify how many times a packet is queued and\n * how many times a task is put on hold in a correct run of richards.\n * They don't have any meaning a such but are characteristic of a\n * correct run so if the actual queue or hold count is different from\n * the expected there must be a bug in the implementation.\n **/\nvar EXPECTED_QUEUE_COUNT = 2322;\nvar EXPECTED_HOLD_COUNT = 928;\n\n\n/**\n * A scheduler can be used to schedule a set of tasks based on their relative\n * priorities. Scheduling is done by maintaining a list of task control blocks\n * which holds tasks and the data queue they are processing.\n * @constructor\n */\nfunction Scheduler() {\n this.queueCount = 0;\n this.holdCount = 0;\n this.blocks = new Array(NUMBER_OF_IDS);\n this.list = null;\n this.currentTcb = null;\n this.currentId = null;\n}\n\nvar ID_IDLE = 0;\nvar ID_WORKER = 1;\nvar ID_HANDLER_A = 2;\nvar ID_HANDLER_B = 3;\nvar ID_DEVICE_A = 4;\nvar ID_DEVICE_B = 5;\nvar NUMBER_OF_IDS = 6;\n\nvar KIND_DEVICE = 0;\nvar KIND_WORK = 1;\n\n/**\n * Add an idle task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n * @param {int} count the number of times to schedule the task\n */\nScheduler.prototype.addIdleTask = function (id, priority, queue, count) {\n this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));\n};\n\n/**\n * Add a work task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n */\nScheduler.prototype.addWorkerTask = function (id, priority, queue) {\n this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));\n};\n\n/**\n * Add a handler task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n */\nScheduler.prototype.addHandlerTask = function (id, priority, queue) {\n this.addTask(id, priority, queue, new HandlerTask(this));\n};\n\n/**\n * Add a handler task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n */\nScheduler.prototype.addDeviceTask = function (id, priority, queue) {\n this.addTask(id, priority, queue, new DeviceTask(this));\n};\n\n/**\n * Add the specified task and mark it as running.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n * @param {Task} task the task to add\n */\nScheduler.prototype.addRunningTask = function (id, priority, queue, task) {\n this.addTask(id, priority, queue, task);\n this.currentTcb.setRunning();\n};\n\n/**\n * Add the specified task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n * @param {Task} task the task to add\n */\nScheduler.prototype.addTask = function (id, priority, queue, task) {\n this.currentTcb = new TaskControlBlock(this.list, id, priority, queue, task);\n this.list = this.currentTcb;\n this.blocks[id] = this.currentTcb;\n};\n\n/**\n * Execute the tasks managed by this scheduler.\n */\nScheduler.prototype.schedule = function () {\n this.currentTcb = this.list;\n while (this.currentTcb != null) {\n if (this.currentTcb.isHeldOrSuspended()) {\n this.currentTcb = this.currentTcb.link;\n } else {\n this.currentId = this.currentTcb.id;\n this.currentTcb = this.currentTcb.run();\n }\n }\n};\n\n/**\n * Release a task that is currently blocked and return the next block to run.\n * @param {int} id the id of the task to suspend\n */\nScheduler.prototype.release = function (id) {\n var tcb = this.blocks[id];\n if (tcb == null) return tcb;\n tcb.markAsNotHeld();\n if (tcb.priority > this.currentTcb.priority) {\n return tcb;\n } else {\n return this.currentTcb;\n }\n};\n\n/**\n * Block the currently executing task and return the next task control block\n * to run. The blocked task will not be made runnable until it is explicitly\n * released, even if new work is added to it.\n */\nScheduler.prototype.holdCurrent = function () {\n this.holdCount++;\n this.currentTcb.markAsHeld();\n return this.currentTcb.link;\n};\n\n/**\n * Suspend the currently executing task and return the next task control block\n * to run. If new work is added to the suspended task it will be made runnable.\n */\nScheduler.prototype.suspendCurrent = function () {\n this.currentTcb.markAsSuspended();\n return this.currentTcb;\n};\n\n/**\n * Add the specified packet to the end of the worklist used by the task\n * associated with the packet and make the task runnable if it is currently\n * suspended.\n * @param {Packet} packet the packet to add\n */\nScheduler.prototype.queue = function (packet) {\n var t = this.blocks[packet.id];\n if (t == null) return t;\n this.queueCount++;\n packet.link = null;\n packet.id = this.currentId;\n return t.checkPriorityAdd(this.currentTcb, packet);\n};\n\n/**\n * A task control block manages a task and the queue of work packages associated\n * with it.\n * @param {TaskControlBlock} link the preceding block in the linked block list\n * @param {int} id the id of this block\n * @param {int} priority the priority of this block\n * @param {Packet} queue the queue of packages to be processed by the task\n * @param {Task} task the task\n * @constructor\n */\nfunction TaskControlBlock(link, id, priority, queue, task) {\n this.link = link;\n this.id = id;\n this.priority = priority;\n this.queue = queue;\n this.task = task;\n if (queue == null) {\n this.state = STATE_SUSPENDED;\n } else {\n this.state = STATE_SUSPENDED_RUNNABLE;\n }\n}\n\n/**\n * The task is running and is currently scheduled.\n */\nvar STATE_RUNNING = 0;\n\n/**\n * The task has packets left to process.\n */\nvar STATE_RUNNABLE = 1;\n\n/**\n * The task is not currently running. The task is not blocked as such and may\n * be started by the scheduler.\n */\nvar STATE_SUSPENDED = 2;\n\n/**\n * The task is blocked and cannot be run until it is explicitly released.\n */\nvar STATE_HELD = 4;\n\nvar STATE_SUSPENDED_RUNNABLE = STATE_SUSPENDED | STATE_RUNNABLE;\nvar STATE_NOT_HELD = ~STATE_HELD;\n\nTaskControlBlock.prototype.setRunning = function () {\n this.state = STATE_RUNNING;\n};\n\nTaskControlBlock.prototype.markAsNotHeld = function () {\n this.state = this.state & STATE_NOT_HELD;\n};\n\nTaskControlBlock.prototype.markAsHeld = function () {\n this.state = this.state | STATE_HELD;\n};\n\nTaskControlBlock.prototype.isHeldOrSuspended = function () {\n return (this.state & STATE_HELD) != 0 || (this.state == STATE_SUSPENDED);\n};\n\nTaskControlBlock.prototype.markAsSuspended = function () {\n this.state = this.state | STATE_SUSPENDED;\n};\n\nTaskControlBlock.prototype.markAsRunnable = function () {\n this.state = this.state | STATE_RUNNABLE;\n};\n\n/**\n * Runs this task, if it is ready to be run, and returns the next task to run.\n */\nTaskControlBlock.prototype.run = function () {\n var packet;\n if (this.state == STATE_SUSPENDED_RUNNABLE) {\n packet = this.queue;\n this.queue = packet.link;\n if (this.queue == null) {\n this.state = STATE_RUNNING;\n } else {\n this.state = STATE_RUNNABLE;\n }\n } else {\n packet = null;\n }\n return this.task.run(packet);\n};\n\n/**\n * Adds a packet to the worklist of this block's task, marks this as runnable if\n * necessary, and returns the next runnable object to run (the one\n * with the highest priority).\n */\nTaskControlBlock.prototype.checkPriorityAdd = function (task, packet) {\n if (this.queue == null) {\n this.queue = packet;\n this.markAsRunnable();\n if (this.priority > task.priority) return this;\n } else {\n this.queue = packet.addTo(this.queue);\n }\n return task;\n};\n\nTaskControlBlock.prototype.toString = function () {\n return \"tcb { \" + this.task + \"@\" + this.state + \" }\";\n};\n\n/**\n * An idle task doesn't do any work itself but cycles control between the two\n * device tasks.\n * @param {Scheduler} scheduler the scheduler that manages this task\n * @param {int} v1 a seed value that controls how the device tasks are scheduled\n * @param {int} count the number of times this task should be scheduled\n * @constructor\n */\nfunction IdleTask(scheduler, v1, count) {\n this.scheduler = scheduler;\n this.v1 = v1;\n this.count = count;\n}\n\nIdleTask.prototype.run = function (packet) {\n this.count--;\n if (this.count == 0) return this.scheduler.holdCurrent();\n if ((this.v1 & 1) == 0) {\n this.v1 = this.v1 >> 1;\n return this.scheduler.release(ID_DEVICE_A);\n } else {\n this.v1 = (this.v1 >> 1) ^ 0xD008;\n return this.scheduler.release(ID_DEVICE_B);\n }\n};\n\nIdleTask.prototype.toString = function () {\n return \"IdleTask\";\n};\n\n/**\n * A task that suspends itself after each time it has been run to simulate\n * waiting for data from an external device.\n * @param {Scheduler} scheduler the scheduler that manages this task\n * @constructor\n */\nfunction DeviceTask(scheduler) {\n this.scheduler = scheduler;\n this.v1 = null;\n}\n\nDeviceTask.prototype.run = function (packet) {\n if (packet == null) {\n if (this.v1 == null) return this.scheduler.suspendCurrent();\n var v = this.v1;\n this.v1 = null;\n return this.scheduler.queue(v);\n } else {\n this.v1 = packet;\n return this.scheduler.holdCurrent();\n }\n};\n\nDeviceTask.prototype.toString = function () {\n return \"DeviceTask\";\n};\n\n/**\n * A task that manipulates work packets.\n * @param {Scheduler} scheduler the scheduler that manages this task\n * @param {int} v1 a seed used to specify how work packets are manipulated\n * @param {int} v2 another seed used to specify how work packets are manipulated\n * @constructor\n */\nfunction WorkerTask(scheduler, v1, v2) {\n this.scheduler = scheduler;\n this.v1 = v1;\n this.v2 = v2;\n}\n\nWorkerTask.prototype.run = function (packet) {\n if (packet == null) {\n return this.scheduler.suspendCurrent();\n } else {\n if (this.v1 == ID_HANDLER_A) {\n this.v1 = ID_HANDLER_B;\n } else {\n this.v1 = ID_HANDLER_A;\n }\n packet.id = this.v1;\n packet.a1 = 0;\n for (var i = 0; i < DATA_SIZE; i++) {\n this.v2++;\n if (this.v2 > 26) this.v2 = 1;\n packet.a2[i] = this.v2;\n }\n return this.scheduler.queue(packet);\n }\n};\n\nWorkerTask.prototype.toString = function () {\n return \"WorkerTask\";\n};\n\n/**\n * A task that manipulates work packets and then suspends itself.\n * @param {Scheduler} scheduler the scheduler that manages this task\n * @constructor\n */\nfunction HandlerTask(scheduler) {\n this.scheduler = scheduler;\n this.v1 = null;\n this.v2 = null;\n}\n\nHandlerTask.prototype.run = function (packet) {\n if (packet != null) {\n if (packet.kind == KIND_WORK) {\n this.v1 = packet.addTo(this.v1);\n } else {\n this.v2 = packet.addTo(this.v2);\n }\n }\n if (this.v1 != null) {\n var count = this.v1.a1;\n var v;\n if (count < DATA_SIZE) {\n if (this.v2 != null) {\n v = this.v2;\n this.v2 = this.v2.link;\n v.a1 = this.v1.a2[count];\n this.v1.a1 = count + 1;\n return this.scheduler.queue(v);\n }\n } else {\n v = this.v1;\n this.v1 = this.v1.link;\n return this.scheduler.queue(v);\n }\n }\n return this.scheduler.suspendCurrent();\n};\n\nHandlerTask.prototype.toString = function () {\n return \"HandlerTask\";\n};\n\n/* --- *\n * P a c k e t\n * --- */\n\nvar DATA_SIZE = 4;\n\n/**\n * A simple package of data that is manipulated by the tasks. The exact layout\n * of the payload data carried by a packet is not importaint, and neither is the\n * nature of the work performed on packets by the tasks.\n *\n * Besides carrying data, packets form linked lists and are hence used both as\n * data and worklists.\n * @param {Packet} link the tail of the linked list of packets\n * @param {int} id an ID for this packet\n * @param {int} kind the type of this packet\n * @constructor\n */\nfunction Packet(link, id, kind) {\n this.link = link;\n this.id = id;\n this.kind = kind;\n this.a1 = 0;\n this.a2 = new Array(DATA_SIZE);\n}\n\n/**\n * Add this packet to the end of a worklist, and return the worklist.\n * @param {Packet} queue the worklist to add this packet to\n */\nPacket.prototype.addTo = function (queue) {\n this.link = null;\n if (queue == null) return this;\n var peek, next = queue;\n while ((peek = next.link) != null)\n next = peek;\n next.link = this;\n return queue;\n};\n\nPacket.prototype.toString = function () {\n return \"Packet\";\n};\n\nvar Richards = new BenchmarkSuite('Richards', 35302, [\n new Benchmark(\"Richards\", runRichards)\n]);\n\n/* run_harness.js */\nvar print = console.log;\n\nfunction Run() {\n BenchmarkSuite.RunSuites({\n NotifyStep: ShowProgress,\n NotifyError: AddError,\n NotifyResult: AddResult,\n NotifyScore: AddScore,\n });\n}\n\nvar harnessErrorCount = 0;\n\nfunction ShowProgress(name) {\n print(\"PROGRESS\", name);\n}\n\nfunction AddError(name, error) {\n print(\"ERROR\", name, error);\n print(error.stack);\n harnessErrorCount++;\n}\n\nfunction AddResult(name, result) {\n print(\"RESULT\", name, result);\n}\n\nfunction AddScore(score) {\n print(\"SCORE\", score);\n}\n\nfunction main() {\n Run();\n}\n" }, { "path": "benches/scripts/v8-benches/splay.js", "content": "\"use strict\";\n\"use strip\";\n// Copyright 2012 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Simple framework for running the benchmark suites and\n// computing a score based on the timing measurements.\n\n\n// A benchmark has a name (string) and a function that will be run to\n// do the performance measurement. The optional setup and tearDown\n// arguments are functions that will be invoked before and after\n// running the benchmark, but the running time of these functions will\n// not be accounted for in the benchmark score.\nfunction Benchmark(name, run, setup, tearDown) {\n this.name = name;\n this.run = run;\n this.Setup = setup ? setup : function () {\n };\n this.TearDown = tearDown ? tearDown : function () {\n };\n}\n\n\n// Benchmark results hold the benchmark and the measured time used to\n// run the benchmark. The benchmark score is computed later once a\n// full benchmark suite has run to completion.\nfunction BenchmarkResult(benchmark, time) {\n this.benchmark = benchmark;\n this.time = time;\n}\n\n\n// Automatically convert results to numbers. Used by the geometric\n// mean computation.\nBenchmarkResult.prototype.valueOf = function () {\n return this.time;\n};\n\n\n// Suites of benchmarks consist of a name and the set of benchmarks in\n// addition to the reference timing that the final score will be based\n// on. This way, all scores are relative to a reference run and higher\n// scores implies better performance.\nfunction BenchmarkSuite(name, reference, benchmarks) {\n this.name = name;\n this.reference = reference;\n this.benchmarks = benchmarks;\n BenchmarkSuite.suites.push(this);\n}\n\n\n// Keep track of all declared benchmark suites.\nBenchmarkSuite.suites = [];\n\n\n// Scores are not comparable across versions. Bump the version if\n// you're making changes that will affect that scores, e.g. if you add\n// a new benchmark or change an existing one.\nBenchmarkSuite.version = '7';\n\n\n// To make the benchmark results predictable, we replace Math.random\n// with a 100% deterministic alternative.\nMath.random = (function () {\n var seed = 49734321;\n return function () {\n // Robert Jenkins' 32 bit integer hash function.\n seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff;\n seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff;\n seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff;\n seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff;\n seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff;\n seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff;\n return (seed & 0xfffffff) / 0x10000000;\n };\n})();\n\n\n// Runs all registered benchmark suites and optionally yields between\n// each individual benchmark to avoid running for too long in the\n// context of browsers. Once done, the final score is reported to the\n// runner.\nBenchmarkSuite.RunSuites = function (runner) {\n var continuation = null;\n var suites = BenchmarkSuite.suites;\n var length = suites.length;\n BenchmarkSuite.scores = [];\n var index = 0;\n\n function RunStep() {\n while (continuation || index < length) {\n if (continuation) {\n continuation = continuation();\n } else {\n var suite = suites[index++];\n if (runner.NotifyStart) runner.NotifyStart(suite.name);\n continuation = suite.RunStep(runner);\n }\n if (continuation && typeof window != 'undefined' && window.setTimeout) {\n window.setTimeout(RunStep, 25);\n return;\n }\n }\n if (runner.NotifyScore) {\n var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores);\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n runner.NotifyScore(formatted);\n }\n }\n\n RunStep();\n};\n\n\n// Counts the total number of registered benchmarks. Useful for\n// showing progress as a percentage.\nBenchmarkSuite.CountBenchmarks = function () {\n var result = 0;\n var suites = BenchmarkSuite.suites;\n for (var i = 0; i < suites.length; i++) {\n result += suites[i].benchmarks.length;\n }\n return result;\n};\n\n\n// Computes the geometric mean of a set of numbers.\nBenchmarkSuite.GeometricMean = function (numbers) {\n var log = 0;\n for (var i = 0; i < numbers.length; i++) {\n log += Math.log(numbers[i]);\n }\n return Math.pow(Math.E, log / numbers.length);\n};\n\n\n// Converts a score value to a string with at least three significant\n// digits.\nBenchmarkSuite.FormatScore = function (value) {\n if (value > 100) {\n return value.toFixed(0);\n } else {\n return value.toPrecision(3);\n }\n};\n\n// Notifies the runner that we're done running a single benchmark in\n// the benchmark suite. This can be useful to report progress.\nBenchmarkSuite.prototype.NotifyStep = function (result) {\n this.results.push(result);\n if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name);\n};\n\n\n// Notifies the runner that we're done with running a suite and that\n// we have a result which can be reported to the user if needed.\nBenchmarkSuite.prototype.NotifyResult = function () {\n var mean = BenchmarkSuite.GeometricMean(this.results);\n var score = this.reference / mean;\n BenchmarkSuite.scores.push(score);\n if (this.runner.NotifyResult) {\n var formatted = BenchmarkSuite.FormatScore(100 * score);\n this.runner.NotifyResult(this.name, formatted);\n }\n};\n\n\n// Notifies the runner that running a benchmark resulted in an error.\nBenchmarkSuite.prototype.NotifyError = function (error) {\n if (this.runner.NotifyError) {\n this.runner.NotifyError(this.name, error);\n }\n if (this.runner.NotifyStep) {\n this.runner.NotifyStep(this.name);\n }\n};\n\n\n// Runs a single benchmark for at least a second and computes the\n// average time it takes to run a single iteration.\nBenchmarkSuite.prototype.RunSingleBenchmark = function (benchmark, data) {\n function Measure(data) {\n var elapsed = 0;\n var start = new Date();\n for (var n = 0; elapsed < 1000; n++) {\n benchmark.run();\n elapsed = new Date() - start;\n }\n if (data != null) {\n data.runs += n;\n data.elapsed += elapsed;\n }\n }\n\n if (data == null) {\n // Measure the benchmark once for warm up and throw the result\n // away. Return a fresh data object.\n Measure(null);\n return {runs: 0, elapsed: 0};\n } else {\n Measure(data);\n // If we've run too few iterations, we continue for another second.\n if (data.runs < 32) return data;\n var usec = (data.elapsed * 1000) / data.runs;\n this.NotifyStep(new BenchmarkResult(benchmark, usec));\n return null;\n }\n};\n\n\n// This function starts running a suite, but stops between each\n// individual benchmark in the suite and returns a continuation\n// function which can be invoked to run the next benchmark. Once the\n// last benchmark has been executed, null is returned.\nBenchmarkSuite.prototype.RunStep = function (runner) {\n this.results = [];\n this.runner = runner;\n var length = this.benchmarks.length;\n var index = 0;\n var suite = this;\n var data;\n\n // Run the setup, the actual benchmark, and the tear down in three\n // separate steps to allow the framework to yield between any of the\n // steps.\n\n function RunNextSetup() {\n if (index < length) {\n try {\n suite.benchmarks[index].Setup();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextBenchmark;\n }\n suite.NotifyResult();\n return null;\n }\n\n function RunNextBenchmark() {\n try {\n data = suite.RunSingleBenchmark(suite.benchmarks[index], data);\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n // If data is null, we're done with this benchmark.\n return (data == null) ? RunNextTearDown : RunNextBenchmark();\n }\n\n function RunNextTearDown() {\n try {\n suite.benchmarks[index++].TearDown();\n } catch (e) {\n suite.NotifyError(e);\n return null;\n }\n return RunNextSetup;\n }\n\n // Start out running the setup.\n return RunNextSetup();\n};\n\n// Copyright 2009 the V8 project authors. All rights reserved.\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following\n// disclaimer in the documentation and/or other materials provided\n// with the distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// This benchmark is based on a JavaScript log processing module used\n// by the V8 profiler to generate execution time profiles for runs of\n// JavaScript applications, and it effectively measures how fast the\n// JavaScript engine is at allocating nodes and reclaiming the memory\n// used for old nodes. Because of the way splay trees work, the engine\n// also has to deal with a lot of changes to the large tree object\n// graph.\n\n// Configuration.\nvar kSplayTreeSize = 8000;\nvar kSplayTreeModifications = 80;\nvar kSplayTreePayloadDepth = 5;\n\nvar splayTree = null;\n\n\nfunction GeneratePayloadTree(depth, tag) {\n if (depth == 0) {\n return {\n array: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9],\n string: 'String for key ' + tag + ' in leaf node'\n };\n } else {\n return {\n left: GeneratePayloadTree(depth - 1, tag),\n right: GeneratePayloadTree(depth - 1, tag)\n };\n }\n}\n\n\nfunction GenerateKey() {\n // The benchmark framework guarantees that Math.random is\n // deterministic; see base.js.\n return Math.random();\n}\n\n\nfunction InsertNewNode() {\n // Insert new node with a unique key.\n var key;\n do {\n key = GenerateKey();\n } while (splayTree.find(key) != null);\n var payload = GeneratePayloadTree(kSplayTreePayloadDepth, String(key));\n splayTree.insert(key, payload);\n return key;\n}\n\n\nfunction SplaySetup() {\n splayTree = new SplayTree();\n for (var i = 0; i < kSplayTreeSize; i++) InsertNewNode();\n}\n\n\nfunction SplayTearDown() {\n // Allow the garbage collector to reclaim the memory\n // used by the splay tree no matter how we exit the\n // tear down function.\n var keys = splayTree.exportKeys();\n splayTree = null;\n\n // Verify that the splay tree has the right size.\n var length = keys.length;\n if (length != kSplayTreeSize) {\n throw new Error(\"Splay tree has wrong size\");\n }\n\n // Verify that the splay tree has sorted, unique keys.\n for (var i = 0; i < length - 1; i++) {\n if (keys[i] >= keys[i + 1]) {\n throw new Error(\"Splay tree not sorted\");\n }\n }\n}\n\n\nfunction SplayRun() {\n // Replace a few nodes in the splay tree.\n for (var i = 0; i < kSplayTreeModifications; i++) {\n var key = InsertNewNode();\n var greatest = splayTree.findGreatestLessThan(key);\n if (greatest == null) splayTree.remove(key);\n else splayTree.remove(greatest.key);\n }\n}\n\n\n/**\n * Constructs a Splay tree. A splay tree is a self-balancing binary\n * search tree with the additional property that recently accessed\n * elements are quick to access again. It performs basic operations\n * such as insertion, look-up and removal in O(log(n)) amortized time.\n *\n * @constructor\n */\nfunction SplayTree() {\n}\n\n\n/**\n * Pointer to the root node of the tree.\n *\n * @type {SplayTree.Node}\n * @private\n */\nSplayTree.prototype.root_ = null;\n\n\n/**\n * @return {boolean} Whether the tree is empty.\n */\nSplayTree.prototype.isEmpty = function () {\n return !this.root_;\n};\n\n\n/**\n * Inserts a node into the tree with the specified key and value if\n * the tree does not already contain a node with the specified key. If\n * the value is inserted, it becomes the root of the tree.\n *\n * @param {number} key Key to insert into the tree.\n * @param {*} value Value to insert into the tree.\n */\nSplayTree.prototype.insert = function (key, value) {\n if (this.isEmpty()) {\n this.root_ = new SplayTree.Node(key, value);\n return;\n }\n // Splay on the key to move the last node on the search path for\n // the key to the root of the tree.\n this.splay_(key);\n if (this.root_.key == key) {\n return;\n }\n var node = new SplayTree.Node(key, value);\n if (key > this.root_.key) {\n node.left = this.root_;\n node.right = this.root_.right;\n this.root_.right = null;\n } else {\n node.right = this.root_;\n node.left = this.root_.left;\n this.root_.left = null;\n }\n this.root_ = node;\n};\n\n\n/**\n * Removes a node with the specified key from the tree if the tree\n * contains a node with this key. The removed node is returned. If the\n * key is not found, an exception is thrown.\n *\n * @param {number} key Key to find and remove from the tree.\n * @return {SplayTree.Node} The removed node.\n */\nSplayTree.prototype.remove = function (key) {\n if (this.isEmpty()) {\n throw Error('Key not found: ' + key);\n }\n this.splay_(key);\n if (this.root_.key != key) {\n throw Error('Key not found: ' + key);\n }\n var removed = this.root_;\n if (!this.root_.left) {\n this.root_ = this.root_.right;\n } else {\n var right = this.root_.right;\n this.root_ = this.root_.left;\n // Splay to make sure that the new root has an empty right child.\n this.splay_(key);\n // Insert the original right child as the right child of the new\n // root.\n this.root_.right = right;\n }\n return removed;\n};\n\n\n/**\n * Returns the node having the specified key or null if the tree doesn't contain\n * a node with the specified key.\n *\n * @param {number} key Key to find in the tree.\n * @return {SplayTree.Node} Node having the specified key.\n */\nSplayTree.prototype.find = function (key) {\n if (this.isEmpty()) {\n return null;\n }\n this.splay_(key);\n return this.root_.key == key ? this.root_ : null;\n};\n\n\n/**\n * @return {SplayTree.Node} Node having the maximum key value.\n */\nSplayTree.prototype.findMax = function (opt_startNode) {\n if (this.isEmpty()) {\n return null;\n }\n var current = opt_startNode || this.root_;\n while (current.right) {\n current = current.right;\n }\n return current;\n};\n\n\n/**\n * @return {SplayTree.Node} Node having the maximum key value that\n * is less than the specified key value.\n */\nSplayTree.prototype.findGreatestLessThan = function (key) {\n if (this.isEmpty()) {\n return null;\n }\n // Splay on the key to move the node with the given key or the last\n // node on the search path to the top of the tree.\n this.splay_(key);\n // Now the result is either the root node or the greatest node in\n // the left subtree.\n if (this.root_.key < key) {\n return this.root_;\n } else if (this.root_.left) {\n return this.findMax(this.root_.left);\n } else {\n return null;\n }\n};\n\n\n/**\n * @return {Array<*>} An array containing all the keys of tree's nodes.\n */\nSplayTree.prototype.exportKeys = function () {\n var result = [];\n if (!this.isEmpty()) {\n this.root_.traverse_(function (node) {\n result.push(node.key);\n });\n }\n return result;\n};\n\n\n/**\n * Perform the splay operation for the given key. Moves the node with\n * the given key to the top of the tree. If no node has the given\n * key, the last node on the search path is moved to the top of the\n * tree. This is the simplified top-down splaying algorithm from:\n * \"Self-adjusting Binary Search Trees\" by Sleator and Tarjan\n *\n * @param {number} key Key to splay the tree on.\n * @private\n */\nSplayTree.prototype.splay_ = function (key) {\n if (this.isEmpty()) {\n return;\n }\n // Create a dummy node. The use of the dummy node is a bit\n // counter-intuitive: The right child of the dummy node will hold\n // the L tree of the algorithm. The left child of the dummy node\n // will hold the R tree of the algorithm. Using a dummy node, left\n // and right will always be nodes and we avoid special cases.\n var dummy, left, right;\n dummy = left = right = new SplayTree.Node(null, null);\n var current = this.root_;\n while (true) {\n if (key < current.key) {\n if (!current.left) {\n break;\n }\n if (key < current.left.key) {\n // Rotate right.\n var tmp = current.left;\n current.left = tmp.right;\n tmp.right = current;\n current = tmp;\n if (!current.left) {\n break;\n }\n }\n // Link right.\n right.left = current;\n right = current;\n current = current.left;\n } else if (key > current.key) {\n if (!current.right) {\n break;\n }\n if (key > current.right.key) {\n // Rotate left.\n var tmp = current.right;\n current.right = tmp.left;\n tmp.left = current;\n current = tmp;\n if (!current.right) {\n break;\n }\n }\n // Link left.\n left.right = current;\n left = current;\n current = current.right;\n } else {\n break;\n }\n }\n // Assemble.\n left.right = current.left;\n right.left = current.right;\n current.left = dummy.right;\n current.right = dummy.left;\n this.root_ = current;\n};\n\n\n/**\n * Constructs a Splay tree node.\n *\n * @param {number} key Key.\n * @param {*} value Value.\n */\nSplayTree.Node = function (key, value) {\n this.key = key;\n this.value = value;\n};\n\n\n/**\n * @type {SplayTree.Node}\n */\nSplayTree.Node.prototype.left = null;\n\n\n/**\n * @type {SplayTree.Node}\n */\nSplayTree.Node.prototype.right = null;\n\n\n/**\n * Performs an ordered traversal of the subtree starting at\n * this SplayTree.Node.\n *\n * @param {function(SplayTree.Node)} f Visitor function.\n * @private\n */\nSplayTree.Node.prototype.traverse_ = function (f) {\n var current = this;\n while (current) {\n var left = current.left;\n if (left) left.traverse_(f);\n f(current);\n current = current.right;\n }\n};\n\nvar Splay = new BenchmarkSuite('Splay', 81491, [\n new Benchmark(\"Splay\", SplayRun, SplaySetup, SplayTearDown)\n]);\n\n/* run_harness.js */\nvar print = console.log;\n\nfunction Run() {\n BenchmarkSuite.RunSuites({\n NotifyStep: ShowProgress,\n NotifyError: AddError,\n NotifyResult: AddResult,\n NotifyScore: AddScore,\n });\n}\n\nvar harnessErrorCount = 0;\n\nfunction ShowProgress(name) {\n print(\"PROGRESS\", name);\n}\n\nfunction AddError(name, error) {\n print(\"ERROR\", name, error);\n print(error.stack);\n harnessErrorCount++;\n}\n\nfunction AddResult(name, result) {\n print(\"RESULT\", name, result);\n}\n\nfunction AddScore(score) {\n print(\"SCORE\", score);\n}\n\nfunction main() {\n Run();\n}\n" }, { "path": "benches/src/lib.rs", "content": "#![allow(unused_crate_dependencies)]\n" }, { "path": "cli/ABOUT.md", "content": "# About Boa\n\nBoa is an open-source, experimental ECMAScript Engine written in Rust for\nlexing, parsing and executing ECMAScript/JavaScript. Currently, Boa supports some\nof the [language][boa-conformance]. More information can be viewed at [Boa's\nwebsite][boa-web].\n\nTry out the most recent release with Boa's live demo\n[playground][boa-playground].\n\n## Boa Crates\n\n- [**`boa_cli`**][cli] - Boa's CLI && REPL implementation\n- [**`boa_ast`**][ast] - Boa's ECMAScript Abstract Syntax Tree.\n- [**`boa_engine`**][engine] - Boa's implementation of ECMAScript builtin objects and execution.\n- [**`boa_gc`**][gc] - Boa's garbage collector.\n- [**`boa_icu_provider`**][icu] - Boa's ICU4X data provider.\n- [**`boa_interner`**][interner] - Boa's string interner.\n- [**`boa_macros`**][macros] - Boa's macros.\n- [**`boa_parser`**][parser] - Boa's lexer and parser.\n- [**`boa_runtime`**][runtime] - Boa's `WebAPI` features.\n- [**`boa_string`**][string] - Boa's ECMAScript string implementation.\n- [**`boa_wintertc`**][wintertc] - Boa's `WinterTC` (TC55) Minimum Common Web API implementation.\n- [**`tag_ptr`**][tag_ptr] - Utility library that enables a pointer to be associated with a tag of type `usize`.\n- [**`small_btree`**][small_btree] - Utility library that adds the `SmallBTreeMap` data structure.\n\n[boa-conformance]: https://boajs.dev/conformance\n[boa-web]: https://boajs.dev/\n[boa-playground]: https://boajs.dev/playground\n[ast]: https://docs.rs/boa_ast/latest/boa_ast/index.html\n[engine]: https://docs.rs/boa_engine/latest/boa_engine/index.html\n[gc]: https://docs.rs/boa_gc/latest/boa_gc/index.html\n[interner]: https://docs.rs/boa_interner/latest/boa_interner/index.html\n[parser]: https://docs.rs/boa_parser/latest/boa_parser/index.html\n[icu]: https://docs.rs/boa_icu_provider/latest/boa_icu_provider/index.html\n[runtime]: https://docs.rs/boa_runtime/latest/boa_runtime/index.html\n[string]: https://docs.rs/boa_string/latest/boa_string/index.html\n[wintertc]: https://docs.rs/boa_wintertc/latest/boa_wintertc/index.html\n[tag_ptr]: https://docs.rs/tag_ptr/latest/tag_ptr/index.html\n[small_btree]: https://docs.rs/small_btree/latest/small_btree/index.html\n[macros]: https://docs.rs/boa_macros/latest/boa_macros/index.html\n[cli]: https://crates.io/crates/boa_cli\n" }, { "path": "cli/Cargo.toml", "content": "[package]\nname = \"boa_cli\"\nkeywords = [\"javascript\", \"compiler\", \"js\", \"cli\"]\ncategories = [\"command-line-utilities\"]\ndefault-run = \"boa\"\ndescription.workspace = true\nversion.workspace = true\nedition.workspace = true\nauthors.workspace = true\nlicense.workspace = true\nrepository.workspace = true\nrust-version.workspace = true\n\n[dependencies]\nboa_engine = { workspace = true, features = [\"deser\", \"float16\", \"flowgraph\", \"temporal\", \"trace\", \"xsum\"] }\nboa_parser.workspace = true\nboa_gc.workspace = true\nboa_runtime.workspace = true\nrustyline = { workspace = true, features = [\"derive\", \"with-file-history\"] }\nclap = { workspace = true, features = [\"derive\"] }\nserde_json.workspace = true\ncolored.workspace = true\nregex.workspace = true\nphf = { workspace = true, features = [\"macros\"] }\ndhat = { workspace = true, optional = true }\ncolor-eyre.workspace = true\ncow-utils.workspace = true\nfutures-concurrency.workspace = true\nfutures-lite.workspace = true\nasync-channel.workspace = true\nrustls.workspace = true\n\n[features]\ndefault = [\n \"boa_engine/annex-b\",\n \"boa_engine/experimental\",\n \"boa_engine/intl_bundled\",\n \"boa_engine/native-backtrace\",\n \"fast-allocator\",\n \"fetch\",\n]\ndhat = [\"dep:dhat\"]\nfast-allocator = [\"dep:mimalloc-safe\", \"dep:jemallocator\"]\nfetch = [\"boa_runtime/fetch\", \"boa_runtime/reqwest-blocking\"]\n\n[target.x86_64-unknown-linux-gnu.dependencies]\njemallocator = { workspace = true, optional = true }\n\n[target.'cfg(target_os = \"windows\")'.dependencies]\nmimalloc-safe = { workspace = true, optional = true, features = [\n \"skip_collect_on_exit\",\n] }\n\n[[bin]]\nname = \"boa\"\ndoc = false\npath = \"src/main.rs\"\n\n[lints]\nworkspace = true\n\n[package.metadata.docs.rs]\nall-features = true\n" }, { "path": "cli/README.md", "content": "# Boa CLI\n\nBoa CLI is `Boa`'s REPL implementation to execute `JavaScript` directly from\nyour CLI.\n\n## Installation\n\n`boa_cli` can be installed directly via `Cargo`.\n\n```shell\n cargo install boa_cli\n```\n\n\n\n## Usage\n\n\n\n\nOnce installed, your good to go!\n\nTo execute some JavaScript source code, navigate to the directory of your choice and type:\n\n```shell\n boa test.js\n```\n\nOr if you'd like to use Boa's REPL, simply type:\n\n```shell\n boa\n```\n\nYou can also pipe JavaScript into Boa:\n\n```shell\n echo 'console.log(1 + 2)' | boa\n cat script.js | boa\n boa < script.js\n```\n\n## CLI Options\n\n```txt\nUsage: boa [OPTIONS] [FILE]...\n\nArguments:\n [FILE]... The JavaScript file(s) to be evaluated\n\nOptions:\n --strict Run in strict mode\n -a, --dump-ast [] Dump the AST to stdout with the given format [possible values: debug, json, json-pretty]\n -t, --trace Dump the AST to stdout with the given format\n --vi Use vi mode in the REPL\n -O, --optimize Enable bytecode compiler optimizations\n --optimizer-statistics Print optimizer statistics (requires -O)\n --flowgraph [] Generate instruction flowgraph. Default is Graphviz [possible values: graphviz, mermaid]\n --flowgraph-direction Specifies the direction of the flowgraph. Default is top-top-bottom [possible values: top-to-bottom, bottom-to-top, left-to-right, right-to-left]\n --debug-object Inject debugging object `$boa`\n -m, --module Treats the input files as modules\n -r, --root Root path from where the module resolver will try to load the modules [default: .]\n -e, --expression Execute a JavaScript expression then exit\n -q, --quiet Suppress the welcome banner when starting the REPL\n -h, --help Print help (see more with '--help')\n -V, --version Print version\n```\n\n## REPL Commands\n\nWhen running the interactive REPL (`boa` with no file arguments), the following\ndot-commands are available:\n\n| Command | Description |\n| -------------- | ----------------------------------- |\n| `.help` | Show available REPL commands |\n| `.exit` | Exit the REPL |\n| `.clear` | Clear the terminal screen |\n| `.load ` | Load and evaluate a JavaScript file |\n\nYou can also press `Ctrl+C` to abort the current expression, or `Ctrl+D` to exit.\n\n## Features\n\nBoa's CLI currently has a variety of features (as listed in `Options`).\n\nFeatures include:\n\n- Implemented runtime features (please note that only `Console` is currently implemented)\n- AST Visibility: View the compiled Boa AST (--dump-ast)\n- Tracing: Enabling a vm tracing when executing any JavaScript\n- Flowgraphs: View a generated (with various provided options)\n- Debugging: Boa's CLI comes with an implemented `$boa` debug object with various functionality (see documentation).\n\nHave an idea for a feature? Feel free to submit an issue and/or contribute!\n" }, { "path": "cli/src/debug/function.rs", "content": "use boa_engine::{\n Context, JsArgs, JsNativeError, JsObject, JsResult, JsValue, NativeFunction,\n builtins::function::OrdinaryFunction,\n js_string,\n object::ObjectInitializer,\n vm::flowgraph::{Direction, Graph},\n};\nuse cow_utils::CowUtils;\n\nuse crate::FlowgraphFormat;\n\nfn flowgraph_parse_format_option(value: &JsValue) -> JsResult {\n if value.is_undefined() {\n return Ok(FlowgraphFormat::Mermaid);\n }\n if let Some(string) = value.as_string() {\n return match string.to_std_string_escaped().cow_to_lowercase().as_ref() {\n \"mermaid\" => Ok(FlowgraphFormat::Mermaid),\n \"graphviz\" => Ok(FlowgraphFormat::Graphviz),\n format => Err(JsNativeError::typ()\n .with_message(format!(\"Unknown format type '{format}'\"))\n .into()),\n };\n }\n Err(JsNativeError::typ()\n .with_message(\"format type must be a string\")\n .into())\n}\n\nfn flowgraph_parse_direction_option(value: &JsValue) -> JsResult {\n if value.is_undefined() {\n return Ok(Direction::LeftToRight);\n }\n if let Some(string) = value.as_string() {\n return match string.to_std_string_escaped().cow_to_lowercase().as_ref() {\n \"leftright\" | \"lr\" => Ok(Direction::LeftToRight),\n \"rightleft\" | \"rl\" => Ok(Direction::RightToLeft),\n \"topbottom\" | \"tb\" => Ok(Direction::TopToBottom),\n \"bottomtop\" | \"bt \" => Ok(Direction::BottomToTop),\n direction => Err(JsNativeError::typ()\n .with_message(format!(\"Unknown direction type '{direction}'\"))\n .into()),\n };\n }\n Err(JsNativeError::typ()\n .with_message(\"direction type must be a string\")\n .into())\n}\n\n/// Get functions instruction flowgraph\nfn flowgraph(_this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let Some(value) = args.first() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected function argument\")\n .into());\n };\n let Some(object) = value.as_object() else {\n return Err(JsNativeError::typ()\n .with_message(format!(\"expected object, got {}\", value.type_of()))\n .into());\n };\n let mut format = FlowgraphFormat::Mermaid;\n let mut direction = Direction::LeftToRight;\n if let Some(arguments) = args.get(1) {\n if let Some(arguments) = arguments.as_object() {\n format = flowgraph_parse_format_option(&arguments.get(js_string!(\"format\"), context)?)?;\n direction = flowgraph_parse_direction_option(\n &arguments.get(js_string!(\"direction\"), context)?,\n )?;\n } else {\n format = flowgraph_parse_format_option(arguments)?;\n }\n }\n let Some(function) = object.downcast_ref::() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected an ordinary function object\")\n .into());\n };\n let code = function.codeblock();\n let mut graph = Graph::new(direction);\n code.to_graph(graph.subgraph(String::default()));\n let result = match format {\n FlowgraphFormat::Graphviz => graph.to_graphviz_format(),\n FlowgraphFormat::Mermaid => graph.to_mermaid_format(),\n };\n Ok(JsValue::new(js_string!(result)))\n}\n\nfn bytecode(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let Some(value) = args.first() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected function argument\")\n .into());\n };\n\n let Some(object) = value.as_object() else {\n return Err(JsNativeError::typ()\n .with_message(format!(\"expected object, got {}\", value.type_of()))\n .into());\n };\n let Some(function) = object.downcast_ref::() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected an ordinary function object\")\n .into());\n };\n let code = function.codeblock();\n\n println!(\"{code}\");\n\n Ok(JsValue::undefined())\n}\n\nfn set_trace_flag_in_function_object(object: &JsObject, value: bool) -> JsResult<()> {\n let Some(function) = object.downcast_ref::() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected an ordinary function object\")\n .into());\n };\n let code = function.codeblock();\n code.set_traceable(value);\n Ok(())\n}\n\n/// Trace function.\nfn trace(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let value = args.get_or_undefined(0);\n let this = args.get_or_undefined(1);\n\n let Some(callable) = value.as_callable() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected callable object\")\n .into());\n };\n\n let arguments = args.get(2..).unwrap_or(&[]);\n\n set_trace_flag_in_function_object(&callable, true)?;\n let result = callable.call(this, arguments, context);\n set_trace_flag_in_function_object(&callable, false)?;\n\n result\n}\n\nfn traceable(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let value = args.get_or_undefined(0);\n let traceable = args.get_or_undefined(1).to_boolean();\n\n let Some(callable) = value.as_callable() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected callable object\")\n .into());\n };\n\n set_trace_flag_in_function_object(&callable, traceable)?;\n\n Ok(value.clone())\n}\n\npub(super) fn create_object(context: &mut Context) -> JsObject {\n ObjectInitializer::new(context)\n .function(\n NativeFunction::from_fn_ptr(flowgraph),\n js_string!(\"flowgraph\"),\n 1,\n )\n .function(\n NativeFunction::from_fn_ptr(bytecode),\n js_string!(\"bytecode\"),\n 1,\n )\n .function(NativeFunction::from_fn_ptr(trace), js_string!(\"trace\"), 1)\n .function(\n NativeFunction::from_fn_ptr(traceable),\n js_string!(\"traceable\"),\n 2,\n )\n .build()\n}\n" }, { "path": "cli/src/debug/gc.rs", "content": "use boa_engine::{\n Context, JsObject, JsResult, JsValue, NativeFunction, js_string, object::ObjectInitializer,\n};\n\n/// Trigger garbage collection.\nfn collect(_: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n boa_gc::force_collect();\n Ok(JsValue::undefined())\n}\n\npub(super) fn create_object(context: &mut Context) -> JsObject {\n ObjectInitializer::new(context)\n .function(\n NativeFunction::from_fn_ptr(collect),\n js_string!(\"collect\"),\n 0,\n )\n .build()\n}\n" }, { "path": "cli/src/debug/limits.rs", "content": "use boa_engine::{\n Context, JsArgs, JsNativeError, JsObject, JsResult, JsValue, NativeFunction, js_string,\n object::{FunctionObjectBuilder, ObjectInitializer},\n property::Attribute,\n};\n\nfn get_loop(_: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n let max = context.runtime_limits().loop_iteration_limit();\n Ok(JsValue::from(max))\n}\n\nfn set_loop(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let value = args.get_or_undefined(0).to_length(context)?;\n context.runtime_limits_mut().set_loop_iteration_limit(value);\n Ok(JsValue::undefined())\n}\n\nfn get_stack(_: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n let max = context.runtime_limits().stack_size_limit();\n Ok(JsValue::from(max))\n}\n\nfn set_stack(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let value = args.get_or_undefined(0).to_length(context)?;\n let Ok(value) = value.try_into() else {\n return Err(JsNativeError::range()\n .with_message(format!(\"Argument {value} greater than usize::MAX\"))\n .into());\n };\n context.runtime_limits_mut().set_stack_size_limit(value);\n Ok(JsValue::undefined())\n}\n\nfn get_recursion(_: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n let max = context.runtime_limits().recursion_limit();\n Ok(JsValue::from(max))\n}\n\nfn set_recursion(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let value = args.get_or_undefined(0).to_length(context)?;\n let Ok(value) = value.try_into() else {\n return Err(JsNativeError::range()\n .with_message(format!(\"Argument {value} greater than usize::MAX\"))\n .into());\n };\n context.runtime_limits_mut().set_recursion_limit(value);\n Ok(JsValue::undefined())\n}\n\nfn get_backtrace(_: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n let max = context.runtime_limits().backtrace_limit();\n Ok(JsValue::from(max))\n}\n\nfn set_backtrace(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let value = args.get_or_undefined(0).to_length(context)?;\n let Ok(value) = value.try_into() else {\n return Err(JsNativeError::range()\n .with_message(format!(\"Argument {value} greater than usize::MAX\"))\n .into());\n };\n context.runtime_limits_mut().set_backtrace_limit(value);\n Ok(JsValue::undefined())\n}\n\npub(super) fn create_object(context: &mut Context) -> JsObject {\n let get_loop =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(get_loop))\n .name(js_string!(\"get loop\"))\n .length(0)\n .build();\n let set_loop =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(set_loop))\n .name(js_string!(\"set loop\"))\n .length(1)\n .build();\n\n let get_stack =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(get_stack))\n .name(js_string!(\"get stack\"))\n .length(0)\n .build();\n let set_stack =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(set_stack))\n .name(js_string!(\"set stack\"))\n .length(1)\n .build();\n\n let get_recursion =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(get_recursion))\n .name(js_string!(\"get recursion\"))\n .length(0)\n .build();\n let set_recursion =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(set_recursion))\n .name(js_string!(\"set recursion\"))\n .length(1)\n .build();\n let get_backtrace =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(get_backtrace))\n .name(js_string!(\"get backtrace\"))\n .length(0)\n .build();\n let set_backtrace =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(set_backtrace))\n .name(js_string!(\"set backtrace\"))\n .length(1)\n .build();\n\n ObjectInitializer::new(context)\n .accessor(\n js_string!(\"loop\"),\n Some(get_loop),\n Some(set_loop),\n Attribute::WRITABLE | Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE,\n )\n .accessor(\n js_string!(\"stack\"),\n Some(get_stack),\n Some(set_stack),\n Attribute::WRITABLE | Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE,\n )\n .accessor(\n js_string!(\"recursion\"),\n Some(get_recursion),\n Some(set_recursion),\n Attribute::WRITABLE | Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE,\n )\n .accessor(\n js_string!(\"backtrace\"),\n Some(get_backtrace),\n Some(set_backtrace),\n Attribute::WRITABLE | Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE,\n )\n .build()\n}\n" }, { "path": "cli/src/debug/mod.rs", "content": "// Allow lint so it, doesn't warn about `JsResult<>` unneeded return on functions.\n#![allow(clippy::unnecessary_wraps)]\n\nuse boa_engine::{Context, JsObject, js_string, object::ObjectInitializer, property::Attribute};\n\nmod function;\nmod gc;\nmod limits;\nmod object;\nmod optimizer;\nmod realm;\nmod shape;\nmod string;\n\nfn create_boa_object(context: &mut Context) -> JsObject {\n let function_module = function::create_object(context);\n let object_module = object::create_object(context);\n let shape_module = shape::create_object(context);\n let optimizer_module = optimizer::create_object(context);\n let gc_module = gc::create_object(context);\n let realm_module = realm::create_object(context);\n let limits_module = limits::create_object(context);\n let string_module = string::create_string(context);\n\n ObjectInitializer::new(context)\n .property(\n js_string!(\"function\"),\n function_module,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"object\"),\n object_module,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"shape\"),\n shape_module,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"optimizer\"),\n optimizer_module,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"gc\"),\n gc_module,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"realm\"),\n realm_module,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"limits\"),\n limits_module,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"string\"),\n string_module,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .build()\n}\n\n#[allow(clippy::redundant_pub_crate)]\npub(crate) fn init_boa_debug_object(context: &mut Context) {\n let boa_object = create_boa_object(context);\n context\n .register_global_property(\n js_string!(\"$boa\"),\n boa_object,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .expect(\"cannot fail with the default object\");\n}\n" }, { "path": "cli/src/debug/object.rs", "content": "use boa_engine::{\n Context, JsNativeError, JsObject, JsResult, JsValue, NativeFunction, js_string,\n object::{IndexProperties, ObjectInitializer},\n};\n\n/// Returns objects pointer in memory.\nfn id(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let Some(value) = args.first() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected object argument\")\n .into());\n };\n\n let Some(object) = value.as_object() else {\n return Err(JsNativeError::typ()\n .with_message(format!(\"expected object, got {}\", value.type_of()))\n .into());\n };\n\n let ptr: *const _ = object.as_ref();\n Ok(js_string!(format!(\"0x{:X}\", ptr.cast::<()>() as usize)).into())\n}\n\n/// Returns objects pointer in memory.\nfn indexed_storage_type(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let Some(value) = args.first() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected object argument\")\n .into());\n };\n\n let Some(object) = value.as_object() else {\n return Err(JsNativeError::typ()\n .with_message(format!(\"expected object, got {}\", value.type_of()))\n .into());\n };\n\n let typ = match object.borrow().properties().index_properties() {\n IndexProperties::DenseI32(_) => \"DenseI32\",\n IndexProperties::DenseF64(_) => \"DenseF64\",\n IndexProperties::DenseElement(_) => \"DenseElement\",\n IndexProperties::SparseElement(_) => \"SparseElement\",\n IndexProperties::SparseProperty(_) => \"SparseProperty\",\n };\n Ok(js_string!(typ).into())\n}\n\npub(super) fn create_object(context: &mut Context) -> JsObject {\n ObjectInitializer::new(context)\n .function(NativeFunction::from_fn_ptr(id), js_string!(\"id\"), 1)\n .function(\n NativeFunction::from_fn_ptr(indexed_storage_type),\n js_string!(\"indexedStorageType\"),\n 1,\n )\n .build()\n}\n" }, { "path": "cli/src/debug/optimizer.rs", "content": "use boa_engine::{\n Context, JsArgs, JsObject, JsResult, JsValue, NativeFunction, js_string,\n object::{FunctionObjectBuilder, ObjectInitializer},\n optimizer::OptimizerOptions,\n property::Attribute,\n};\n\nfn get_constant_folding(_: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n Ok(context\n .optimizer_options()\n .contains(OptimizerOptions::CONSTANT_FOLDING)\n .into())\n}\n\nfn set_constant_folding(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let value = args.get_or_undefined(0).to_boolean();\n let mut options = context.optimizer_options();\n options.set(OptimizerOptions::CONSTANT_FOLDING, value);\n context.set_optimizer_options(options);\n Ok(JsValue::undefined())\n}\n\nfn get_statistics(_: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n Ok(context\n .optimizer_options()\n .contains(OptimizerOptions::STATISTICS)\n .into())\n}\n\nfn set_statistics(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let value = args.get_or_undefined(0).to_boolean();\n let mut options = context.optimizer_options();\n options.set(OptimizerOptions::STATISTICS, value);\n context.set_optimizer_options(options);\n Ok(JsValue::undefined())\n}\n\npub(super) fn create_object(context: &mut Context) -> JsObject {\n let get_constant_folding = FunctionObjectBuilder::new(\n context.realm(),\n NativeFunction::from_fn_ptr(get_constant_folding),\n )\n .name(\"get constantFolding\")\n .length(0)\n .build();\n let set_constant_folding = FunctionObjectBuilder::new(\n context.realm(),\n NativeFunction::from_fn_ptr(set_constant_folding),\n )\n .name(\"set constantFolding\")\n .length(1)\n .build();\n\n let get_statistics =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(get_statistics))\n .name(\"get statistics\")\n .length(0)\n .build();\n let set_statistics =\n FunctionObjectBuilder::new(context.realm(), NativeFunction::from_fn_ptr(set_statistics))\n .name(\"set statistics\")\n .length(1)\n .build();\n ObjectInitializer::new(context)\n .accessor(\n js_string!(\"constantFolding\"),\n Some(get_constant_folding),\n Some(set_constant_folding),\n Attribute::WRITABLE | Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE,\n )\n .accessor(\n js_string!(\"statistics\"),\n Some(get_statistics),\n Some(set_statistics),\n Attribute::WRITABLE | Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE,\n )\n .build()\n}\n" }, { "path": "cli/src/debug/realm.rs", "content": "use boa_engine::{\n Context, JsObject, JsResult, JsValue, NativeFunction, js_string, object::ObjectInitializer,\n};\n\n/// Creates a new ECMAScript Realm and returns the global object of the realm.\nfn create(_: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n let context = &mut Context::default();\n\n Ok(context.global_object().into())\n}\n\npub(super) fn create_object(context: &mut Context) -> JsObject {\n ObjectInitializer::new(context)\n .function(NativeFunction::from_fn_ptr(create), js_string!(\"create\"), 0)\n .build()\n}\n" }, { "path": "cli/src/debug/shape.rs", "content": "use boa_engine::{\n Context, JsArgs, JsNativeError, JsObject, JsResult, JsValue, NativeFunction, js_string,\n object::ObjectInitializer,\n};\n\nfn get_object(args: &[JsValue], position: usize) -> JsResult {\n let value = args.get_or_undefined(position);\n\n let Some(object) = value.as_object() else {\n return Err(JsNativeError::typ()\n .with_message(format!(\n \"expected object in argument position {position}, got {}\",\n value.type_of()\n ))\n .into());\n };\n\n Ok(object)\n}\n\n/// Returns object's shape pointer in memory.\nfn id(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let object = get_object(args, 0)?;\n let object = object.borrow();\n let shape = object.shape();\n Ok(js_string!(format!(\"0x{:X}\", shape.to_addr_usize())).into())\n}\n\n/// Returns object's shape type.\nfn r#type(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let object = get_object(args, 0)?;\n let object = object.borrow();\n let shape = object.shape();\n\n Ok(if shape.is_shared() {\n js_string!(\"shared\")\n } else {\n js_string!(\"unique\")\n }\n .into())\n}\n\n/// Returns object's shape type.\nfn same(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let lhs = get_object(args, 0)?;\n let rhs = get_object(args, 1)?;\n\n let lhs_shape_ptr = {\n let object = lhs.borrow();\n let shape = object.shape();\n shape.to_addr_usize()\n };\n\n let rhs_shape_ptr = {\n let object = rhs.borrow();\n let shape = object.shape();\n shape.to_addr_usize()\n };\n\n Ok(JsValue::new(lhs_shape_ptr == rhs_shape_ptr))\n}\n\npub(super) fn create_object(context: &mut Context) -> JsObject {\n ObjectInitializer::new(context)\n .function(NativeFunction::from_fn_ptr(id), js_string!(\"id\"), 1)\n .function(NativeFunction::from_fn_ptr(r#type), js_string!(\"type\"), 1)\n .function(NativeFunction::from_fn_ptr(same), js_string!(\"same\"), 2)\n .build()\n}\n" }, { "path": "cli/src/debug/string.rs", "content": "use boa_engine::{\n Context, JsNativeError, JsObject, JsResult, JsValue, NativeFunction, js_string,\n object::ObjectInitializer, property::Attribute, string::JsStrVariant,\n};\n\nfn storage(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let Some(value) = args.first() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected string argument\")\n .into());\n };\n\n let Some(string) = value.as_string() else {\n return Err(JsNativeError::typ()\n .with_message(format!(\"expected string, got {}\", value.type_of()))\n .into());\n };\n\n let storage = if string.is_static() { \"static\" } else { \"heap\" };\n Ok(js_string!(storage).into())\n}\n\nfn encoding(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n let Some(value) = args.first() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected string argument\")\n .into());\n };\n\n let Some(string) = value.as_string() else {\n return Err(JsNativeError::typ()\n .with_message(format!(\"expected string, got {}\", value.type_of()))\n .into());\n };\n\n let str = string.as_str();\n let encoding = match str.variant() {\n JsStrVariant::Latin1(_) => \"latin1\",\n JsStrVariant::Utf16(_) => \"utf16\",\n };\n Ok(js_string!(encoding).into())\n}\n\nfn summary(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let Some(value) = args.first() else {\n return Err(JsNativeError::typ()\n .with_message(\"expected string argument\")\n .into());\n };\n\n let Some(string) = value.as_string() else {\n return Err(JsNativeError::typ()\n .with_message(format!(\"expected string, got {}\", value.type_of()))\n .into());\n };\n\n let storage = if string.is_static() { \"static\" } else { \"heap\" };\n let encoding = match string.as_str().variant() {\n JsStrVariant::Latin1(_) => \"latin1\",\n JsStrVariant::Utf16(_) => \"utf16\",\n };\n\n let summary = ObjectInitializer::new(context)\n .property(js_string!(\"storage\"), js_string!(storage), Attribute::all())\n .property(\n js_string!(\"encoding\"),\n js_string!(encoding),\n Attribute::all(),\n )\n .build();\n\n Ok(summary.into())\n}\n\npub(super) fn create_string(context: &mut Context) -> JsObject {\n ObjectInitializer::new(context)\n .function(\n NativeFunction::from_fn_ptr(storage),\n js_string!(\"storage\"),\n 1,\n )\n .function(\n NativeFunction::from_fn_ptr(encoding),\n js_string!(\"encoding\"),\n 1,\n )\n .function(\n NativeFunction::from_fn_ptr(summary),\n js_string!(\"summary\"),\n 1,\n )\n .build()\n}\n" }, { "path": "cli/src/executor.rs", "content": "use std::{\n cell::RefCell,\n collections::{BTreeMap, VecDeque},\n mem,\n rc::Rc,\n};\n\nuse boa_engine::{\n Context, JsResult,\n context::time::JsInstant,\n job::{GenericJob, Job, JobExecutor, NativeAsyncJob, PromiseJob, TimeoutJob},\n};\nuse futures_concurrency::future::FutureGroup;\nuse futures_lite::{StreamExt, future};\n\nuse crate::{logger::SharedExternalPrinterLogger, uncaught_job_error};\n\npub(crate) struct Executor {\n promise_jobs: RefCell>,\n async_jobs: RefCell>,\n timeout_jobs: RefCell>>,\n generic_jobs: RefCell>,\n finalization_registry_jobs: RefCell>,\n\n printer: SharedExternalPrinterLogger,\n}\n\nimpl Executor {\n pub(crate) fn new(printer: SharedExternalPrinterLogger) -> Self {\n Self {\n promise_jobs: RefCell::default(),\n async_jobs: RefCell::default(),\n timeout_jobs: RefCell::default(),\n generic_jobs: RefCell::default(),\n finalization_registry_jobs: RefCell::default(),\n printer,\n }\n }\n\n pub(crate) fn clear(&self) {\n self.promise_jobs.borrow_mut().clear();\n self.async_jobs.borrow_mut().clear();\n self.timeout_jobs.borrow_mut().clear();\n self.generic_jobs.borrow_mut().clear();\n }\n\n fn is_empty(&self) -> bool {\n self.promise_jobs.borrow().is_empty()\n && self.async_jobs.borrow().is_empty()\n && self.timeout_jobs.borrow().is_empty()\n && self.generic_jobs.borrow().is_empty()\n }\n\n fn drain_timeout_jobs(&self, context: &mut Context) {\n let now = context.clock().now();\n\n let mut timeouts_borrow = self.timeout_jobs.borrow_mut();\n let mut jobs_to_keep = timeouts_borrow.split_off(&now);\n jobs_to_keep.retain(|_, jobs| {\n jobs.retain(|job| !job.is_cancelled());\n !jobs.is_empty()\n });\n let jobs_to_run = mem::replace(&mut *timeouts_borrow, jobs_to_keep);\n drop(timeouts_borrow);\n\n for jobs in jobs_to_run.into_values() {\n for job in jobs {\n if !job.is_cancelled()\n && let Err(e) = job.call(context)\n {\n self.printer.print(uncaught_job_error(&e));\n }\n }\n }\n }\n\n fn drain_generic_jobs(&self, context: &mut Context) {\n let job = self.generic_jobs.borrow_mut().pop_front();\n if let Some(generic) = job\n && let Err(err) = generic.call(context)\n {\n self.printer.print(uncaught_job_error(&err));\n }\n }\n}\n\nimpl JobExecutor for Executor {\n fn enqueue_job(self: Rc, job: Job, context: &mut Context) {\n match job {\n Job::PromiseJob(job) => self.promise_jobs.borrow_mut().push_back(job),\n Job::AsyncJob(job) => self.async_jobs.borrow_mut().push_back(job),\n Job::TimeoutJob(job) => {\n let now = context.clock().now();\n self.timeout_jobs\n .borrow_mut()\n .entry(now + job.timeout())\n .or_default()\n .push(job);\n }\n Job::GenericJob(job) => self.generic_jobs.borrow_mut().push_back(job),\n Job::FinalizationRegistryCleanupJob(job) => {\n self.finalization_registry_jobs.borrow_mut().push_back(job);\n }\n job => self.printer.print(format!(\"unsupported job type {job:?}\")),\n }\n }\n\n fn run_jobs(self: Rc, context: &mut Context) -> JsResult<()> {\n future::block_on(self.run_jobs_async(&RefCell::new(context)))\n }\n\n async fn run_jobs_async(self: Rc, context: &RefCell<&mut Context>) -> JsResult<()> {\n let mut group = FutureGroup::new();\n let mut fr_group = FutureGroup::new();\n\n loop {\n for job in mem::take(&mut *self.async_jobs.borrow_mut()) {\n group.insert(job.call(context));\n }\n\n for job in mem::take(&mut *self.finalization_registry_jobs.borrow_mut()) {\n fr_group.insert(job.call(context));\n }\n\n if let Some(Err(e)) = future::poll_once(group.next()).await.flatten() {\n self.printer.print(uncaught_job_error(&e));\n }\n\n // We particularly want to make this check here such that the\n // event loop is cancelled almost immediately after the channel with\n // the reader gets closed.\n if self.is_empty() && group.is_empty() {\n // Run finalizers with a lower priority than every other type of\n // job.\n if let Some(Err(e)) = future::poll_once(fr_group.next()).await.flatten() {\n self.printer.print(uncaught_job_error(&e));\n }\n\n // Finalizers could enqueue new jobs, so we cannot just exit.\n if self.is_empty() {\n return Ok(());\n }\n }\n\n {\n let context = &mut context.borrow_mut();\n self.drain_timeout_jobs(context);\n self.drain_generic_jobs(context);\n\n let jobs = mem::take(&mut *self.promise_jobs.borrow_mut());\n for job in jobs {\n if let Err(e) = job.call(context) {\n self.printer.print(uncaught_job_error(&e));\n }\n }\n }\n context.borrow_mut().clear_kept_objects();\n\n future::yield_now().await;\n }\n }\n}\n" }, { "path": "cli/src/helper.rs", "content": "use boa_engine::{ast::scope::Scope, interner::Interner};\nuse boa_parser::Source;\nuse colored::{Color, Colorize};\nuse phf::{Set, phf_set};\nuse regex::{Captures, Regex, Replacer};\nuse rustyline::{\n Completer, Helper, Hinter,\n error::ReadlineError,\n highlight::{CmdKind, Highlighter},\n validate::{ValidationContext, ValidationResult, Validator},\n};\nuse std::borrow::Cow::{self, Borrowed};\n\nconst STRING_COLOR: Color = Color::Green;\nconst KEYWORD_COLOR: Color = Color::Yellow;\nconst PROPERTY_COLOR: Color = Color::Magenta;\nconst OPERATOR_COLOR: Color = Color::TrueColor {\n r: 214,\n g: 95,\n b: 26,\n};\nconst UNDEFINED_COLOR: Color = Color::TrueColor {\n r: 100,\n g: 100,\n b: 100,\n};\nconst NUMBER_COLOR: Color = Color::TrueColor {\n r: 26,\n g: 214,\n b: 175,\n};\nconst IDENTIFIER_COLOR: Color = Color::TrueColor {\n r: 26,\n g: 160,\n b: 214,\n};\n\nconst READLINE_COLOR: Color = Color::Cyan;\n\n#[allow(clippy::upper_case_acronyms, clippy::redundant_pub_crate)]\n#[derive(Completer, Helper, Hinter)]\npub(crate) struct RLHelper {\n strict: bool,\n highlighter: LineHighlighter,\n colored_prompt: String,\n}\n\nimpl RLHelper {\n pub(crate) fn new(prompt: &str, strict: bool) -> Self {\n Self {\n highlighter: LineHighlighter::new(),\n strict,\n colored_prompt: prompt.color(READLINE_COLOR).bold().to_string(),\n }\n }\n}\n\nimpl Validator for RLHelper {\n fn validate(\n &self,\n context: &mut ValidationContext<'_>,\n ) -> Result {\n let mut parser = boa_parser::Parser::new(Source::from_bytes(context.input()));\n if self.strict {\n parser.set_strict();\n }\n\n match parser.parse_script(&Scope::new_global(), &mut Interner::new()) {\n // Skip scope analysis errors, those can be caused by not having the\n // context's Scope to resolve variables.\n Ok(_) | Err(boa_parser::Error::ScopeAnalysis { .. }) => {\n Ok(ValidationResult::Valid(None))\n }\n Err(boa_parser::Error::AbruptEnd) => Ok(ValidationResult::Incomplete),\n Err(err) => Ok(ValidationResult::Invalid(Some(format!(\n \"\\n{} {}\",\n \"Uncaught SyntaxError\".red(),\n err.to_string().red()\n )))),\n }\n }\n\n fn validate_while_typing(&self) -> bool {\n false\n }\n}\n\nimpl Highlighter for RLHelper {\n fn highlight<'l>(&self, line: &'l str, pos: usize) -> Cow<'l, str> {\n self.highlighter.highlight(line, pos)\n }\n\n // Must match signature of Highlighter::highlight_prompt, can't elide lifetimes.\n #[allow(single_use_lifetimes)]\n fn highlight_prompt<'b, 's: 'b, 'p: 'b>(\n &'s self,\n prompt: &'p str,\n default: bool,\n ) -> Cow<'b, str> {\n if default {\n Borrowed(&self.colored_prompt)\n } else {\n Borrowed(prompt)\n }\n }\n\n fn highlight_hint<'h>(&self, hint: &'h str) -> Cow<'h, str> {\n hint.into()\n }\n\n fn highlight_candidate<'c>(\n &self,\n candidate: &'c str,\n _completion: rustyline::CompletionType,\n ) -> Cow<'c, str> {\n self.highlighter.highlight(candidate, 0)\n }\n\n fn highlight_char(&self, line: &str, _: usize, _: CmdKind) -> bool {\n !line.is_empty()\n }\n}\n\nstatic KEYWORDS: Set<&'static str> = phf_set! {\n \"break\",\n \"case\",\n \"catch\",\n \"class\",\n \"const\",\n \"continue\",\n \"default\",\n \"delete\",\n \"do\",\n \"else\",\n \"export\",\n \"extends\",\n \"finally\",\n \"for\",\n \"function\",\n \"if\",\n \"import\",\n \"instanceof\",\n \"new\",\n \"return\",\n \"super\",\n \"switch\",\n \"this\",\n \"throw\",\n \"try\",\n \"typeof\",\n \"var\",\n \"void\",\n \"while\",\n \"with\",\n \"yield\",\n \"await\",\n \"enum\",\n \"let\",\n};\n\nstruct LineHighlighter {\n regex: Regex,\n}\n\nimpl LineHighlighter {\n fn new() -> Self {\n // Precompiles the regex to avoid creating it again after every highlight\n let regex = Regex::new(\n r#\"(?x)\n (?P\\b[$_\\p{ID_Start}][$_\\p{ID_Continue}\\u{200C}\\u{200D}]*\\b) |\n (?P\"([^\"\\\\]|\\\\.)*\") |\n (?P'([^'\\\\]|\\\\.)*') |\n (?P`([^`\\\\]|\\\\.)*`) |\n (?P[+\\-/*%~^!&|=<>;:]) |\n (?P0[bB][01](_?[01])*n?|0[oO][0-7](_?[0-7])*n?|0[xX][0-9a-fA-F](_?[0-9a-fA-F])*n?|(([0-9](_?[0-9])*\\.([0-9](_?[0-9])*)?)|(([0-9](_?[0-9])*)?\\.[0-9](_?[0-9])*)|([0-9](_?[0-9])*))([eE][+-]?[0-9](_?[0-9])*)?n?)\"#,\n ).expect(\"could not compile regular expression\");\n\n Self { regex }\n }\n}\n\nimpl Highlighter for LineHighlighter {\n fn highlight<'l>(&self, line: &'l str, _: usize) -> Cow<'l, str> {\n use std::fmt::Write;\n\n struct Colorizer;\n\n impl Replacer for Colorizer {\n // Changing to map_or_else moves the handling of \"identifier\" after all other kinds,\n // which reads worse than this version.\n #[allow(clippy::option_if_let_else)]\n fn replace_append(&mut self, caps: &Captures<'_>, dst: &mut String) {\n let colored = if let Some(cap) = caps.name(\"identifier\") {\n let cap = cap.as_str();\n\n let colored = match cap {\n \"true\" | \"false\" | \"null\" | \"Infinity\" | \"globalThis\" => {\n cap.color(PROPERTY_COLOR)\n }\n \"undefined\" => cap.color(UNDEFINED_COLOR),\n identifier if KEYWORDS.contains(identifier) => {\n cap.color(KEYWORD_COLOR).bold()\n }\n _ => cap.color(IDENTIFIER_COLOR),\n };\n\n Some(colored)\n } else if let Some(cap) = caps\n .name(\"string_double_quote\")\n .or_else(|| caps.name(\"string_single_quote\"))\n .or_else(|| caps.name(\"template_literal\"))\n {\n Some(cap.as_str().color(STRING_COLOR))\n } else if let Some(cap) = caps.name(\"op\") {\n Some(cap.as_str().color(OPERATOR_COLOR))\n } else {\n caps.name(\"number\")\n .map(|cap| cap.as_str().color(NUMBER_COLOR))\n };\n\n if let Some(colored) = colored {\n write!(dst, \"{colored}\").expect(\"could not append data to dst\");\n } else {\n dst.push_str(&caps[0]);\n }\n }\n }\n self.regex.replace_all(line, Colorizer)\n }\n}\n" }, { "path": "cli/src/logger.rs", "content": "use boa_engine::{Context, Finalize, JsResult, Trace};\nuse boa_runtime::{ConsoleState, Logger};\nuse rustyline::ExternalPrinter;\nuse std::fmt::Debug;\nuse std::io::Write;\nuse std::sync::{Arc, Mutex};\n\n#[derive(Clone, Trace, Finalize)]\npub(crate) struct SharedExternalPrinterLogger {\n #[unsafe_ignore_trace]\n inner: Arc>>>,\n}\n\nimpl SharedExternalPrinterLogger {\n pub(crate) fn new() -> Self {\n Self {\n inner: Arc::new(Mutex::new(None)),\n }\n }\n\n pub(crate) fn set(&self, inner: T) {\n self.inner\n .lock()\n .expect(\"printer lock failed\")\n .replace(Box::new(inner));\n }\n\n pub(crate) fn print(&self, message: String) {\n if let Some(l) = &mut *self.inner.lock().expect(\"printer lock failed\") {\n // Ignore errors, there's nothing we can do at this point.\n drop(l.print(message));\n } else {\n drop(std::io::stdout().write_all(message.as_bytes()));\n }\n }\n}\n\nimpl Debug for SharedExternalPrinterLogger {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n f.debug_struct(\"SharedExternalPrinterLogger\").finish()\n }\n}\n\nimpl Logger for SharedExternalPrinterLogger {\n #[inline]\n fn log(&self, msg: String, state: &ConsoleState, _context: &mut Context) -> JsResult<()> {\n let indent = state.indent();\n self.print(format!(\"{msg:>indent$}\\n\"));\n Ok(())\n }\n\n #[inline]\n fn info(&self, msg: String, state: &ConsoleState, context: &mut Context) -> JsResult<()> {\n self.log(msg, state, context)\n }\n\n #[inline]\n fn warn(&self, msg: String, state: &ConsoleState, context: &mut Context) -> JsResult<()> {\n self.log(msg, state, context)\n }\n\n #[inline]\n fn error(&self, msg: String, state: &ConsoleState, _context: &mut Context) -> JsResult<()> {\n let indent = state.indent();\n self.print(format!(\"{msg:>indent$}\\n\"));\n Ok(())\n }\n}\n" }, { "path": "cli/src/main.rs", "content": "//! A CLI implementation for `boa_engine` that comes complete with file execution and a REPL.\n#![doc = include_str!(\"../ABOUT.md\")]\n#![doc(\n html_logo_url = \"https://raw.githubusercontent.com/boa-dev/boa/main/assets/logo_black.svg\",\n html_favicon_url = \"https://raw.githubusercontent.com/boa-dev/boa/main/assets/logo_black.svg\"\n)]\n#![cfg_attr(not(test), deny(clippy::unwrap_used))]\n#![allow(clippy::print_stdout, clippy::print_stderr)]\n\nmod debug;\nmod executor;\nmod helper;\nmod logger;\n\nuse crate::executor::Executor;\nuse crate::logger::SharedExternalPrinterLogger;\nuse async_channel::Sender;\nuse boa_engine::JsValue;\nuse boa_engine::error::JsErasedError;\nuse boa_engine::job::NativeAsyncJob;\nuse boa_engine::{\n Context, JsError, Source,\n builtins::promise::PromiseState,\n context::ContextBuilder,\n module::{Module, SimpleModuleLoader},\n optimizer::OptimizerOptions,\n script::Script,\n vm::flowgraph::{Direction, Graph},\n};\nuse boa_parser::source::ReadChar;\nuse clap::{Parser, ValueEnum, ValueHint};\nuse color_eyre::{\n Result, Section,\n eyre::{WrapErr, eyre},\n};\nuse colored::Colorize;\nuse debug::init_boa_debug_object;\nuse rustyline::{EditMode, Editor, config::Config, error::ReadlineError};\nuse std::time::{Duration, Instant};\nuse std::{\n fs::OpenOptions,\n io::{self, IsTerminal, Read, Write},\n path::{Path, PathBuf},\n rc::Rc,\n thread,\n};\n\n// ----\n\n#[cfg(all(\n target_arch = \"x86_64\",\n target_os = \"linux\",\n target_env = \"gnu\",\n feature = \"dhat\"\n))]\nuse jemallocator as _;\n\n#[cfg(all(\n target_arch = \"x86_64\",\n target_os = \"linux\",\n target_env = \"gnu\",\n feature = \"fast-allocator\",\n not(feature = \"dhat\")\n))]\n#[global_allocator]\nstatic ALLOC: jemallocator::Jemalloc = jemallocator::Jemalloc;\n\n#[cfg(all(target_os = \"windows\", feature = \"dhat\"))]\nuse mimalloc_safe as _;\n\n#[cfg(all(\n target_os = \"windows\",\n feature = \"fast-allocator\",\n not(feature = \"dhat\")\n))]\n#[global_allocator]\nstatic ALLOC: mimalloc_safe::MiMalloc = mimalloc_safe::MiMalloc;\n\n#[cfg(feature = \"dhat\")]\n#[global_allocator]\nstatic ALLOC: dhat::Alloc = dhat::Alloc;\n\n/// CLI configuration for Boa.\nstatic CLI_HISTORY: &str = \".boa_history\";\n\n// Added #[allow(clippy::option_option)] because to StructOpt an Option>\n// is an optional argument that optionally takes a value ([--opt=[val]]).\n// https://docs.rs/structopt/0.3.11/structopt/#type-magic\n#[derive(Debug, Parser)]\n#[command(author, version, about, name = \"boa\")]\n#[allow(clippy::struct_excessive_bools)] // NOTE: Allow having more than 3 bools in struct\nstruct Opt {\n /// The JavaScript file(s) to be evaluated.\n #[arg(name = \"FILE\", value_hint = ValueHint::FilePath)]\n files: Vec,\n\n /// Run in strict mode.\n #[arg(long)]\n strict: bool,\n\n /// Dump the AST to stdout with the given format.\n #[arg(\n long,\n short = 'a',\n value_name = \"FORMAT\",\n ignore_case = true,\n value_enum,\n conflicts_with = \"graph\"\n )]\n #[allow(clippy::option_option)]\n dump_ast: Option>,\n\n /// Dump the AST to stdout with the given format.\n #[arg(long, short, conflicts_with = \"graph\")]\n trace: bool,\n\n /// Use vi mode in the REPL\n #[arg(long = \"vi\")]\n vi_mode: bool,\n\n /// Report parsing and execution timings.\n #[arg(long)]\n time: bool,\n\n #[arg(long, short = 'O', group = \"optimizer\")]\n optimize: bool,\n\n #[arg(long, requires = \"optimizer\")]\n optimizer_statistics: bool,\n\n /// Generate instruction flowgraph. Default is Graphviz.\n #[arg(\n long,\n value_name = \"FORMAT\",\n ignore_case = true,\n value_enum,\n group = \"graph\"\n )]\n #[allow(clippy::option_option)]\n flowgraph: Option>,\n\n /// Specifies the direction of the flowgraph. Default is top-top-bottom.\n #[arg(\n long,\n value_name = \"FORMAT\",\n ignore_case = true,\n value_enum,\n requires = \"graph\"\n )]\n flowgraph_direction: Option,\n\n /// Inject debugging object `$boa`.\n #[arg(long)]\n debug_object: bool,\n\n /// Treats the input files as modules.\n #[arg(long, short = 'm', group = \"mod\")]\n module: bool,\n\n /// Root path from where the module resolver will try to load the modules.\n #[arg(long, short = 'r', default_value_os_t = PathBuf::from(\".\"), requires = \"mod\")]\n root: PathBuf,\n\n /// Execute a JavaScript expression then exit. Files (see above) will be\n /// executed prior to the expression.\n #[arg(long, short = 'e')]\n expression: Option,\n\n /// Suppress the welcome banner when starting the REPL.\n #[arg(long, short = 'q')]\n quiet: bool,\n}\n\nimpl Opt {\n /// Returns whether a dump flag has been used.\n const fn has_dump_flag(&self) -> bool {\n self.dump_ast.is_some()\n }\n}\n\n/// The different types of format available for dumping.\n#[derive(Debug, Copy, Clone, Default, ValueEnum)]\nenum DumpFormat {\n // NOTE: This can easily support other formats just by\n // adding a field to this enum and adding the necessary\n // implementation. Example: Toml, Html, etc.\n //\n // NOTE: The fields of this enum are not doc comments because\n // arg_enum! macro does not support it.\n /// This is the default format that you get from `std::fmt::Debug`.\n #[default]\n Debug,\n\n /// This is a minified json format.\n Json,\n\n /// This is a pretty printed json format.\n JsonPretty,\n}\n\n/// Represents the format of the instruction flowgraph.\n#[derive(Debug, Clone, Copy, ValueEnum)]\nenum FlowgraphFormat {\n /// Generates in graphviz format: .\n Graphviz,\n /// Generates in mermaid format: .\n Mermaid,\n}\n\n/// Represents the direction of the instruction flowgraph.\n#[derive(Debug, Clone, Copy, ValueEnum)]\nenum FlowgraphDirection {\n TopToBottom,\n BottomToTop,\n LeftToRight,\n RightToLeft,\n}\n\nstruct Timer<'a> {\n name: &'static str,\n start: Instant,\n counters: &'a mut Vec<(&'static str, Duration)>,\n}\n\nimpl Drop for Timer<'_> {\n fn drop(&mut self) {\n self.counters.push((self.name, self.start.elapsed()));\n }\n}\n\nstruct Counters {\n counters: Option>,\n}\n\nimpl Counters {\n fn new(enabled: bool) -> Self {\n Self {\n counters: enabled.then_some(Vec::new()),\n }\n }\n\n fn new_timer(&mut self, name: &'static str) -> Option> {\n self.counters.as_mut().map(|counters| Timer {\n name,\n start: Instant::now(),\n counters,\n })\n }\n}\n\nimpl Drop for Counters {\n fn drop(&mut self) {\n let Some(counters) = self.counters.take() else {\n return;\n };\n if counters.is_empty() {\n return;\n }\n\n let max_width = counters\n .iter()\n .map(|(name, _)| name.len())\n .max()\n .unwrap_or(0)\n .max(\"Total\".len())\n + 1; // +1 for the colon\n\n let mut total = Duration::ZERO;\n eprintln!();\n for (name, elapsed) in &counters {\n eprintln!(\n \"{: 1 {\n eprintln!(\"{:(src: Source<'_, R>, args: &Opt, context: &mut Context) -> Result<()> {\n if let Some(arg) = args.dump_ast {\n let mut counters = Counters::new(args.time);\n let arg = arg.unwrap_or_default();\n let mut parser = boa_parser::Parser::new(src);\n let dump =\n if args.module {\n let scope = context.realm().scope().clone();\n let module = {\n let _timer = counters.new_timer(\"Parsing\");\n parser\n .parse_module(&scope, context.interner_mut())\n .map_err(|e| eyre!(\"Uncaught SyntaxError: {e}\"))?\n };\n let _timer = counters.new_timer(\"AST generation\");\n match arg {\n DumpFormat::Json => serde_json::to_string(&module)\n .expect(\"could not convert AST to a JSON string\"),\n DumpFormat::JsonPretty => serde_json::to_string_pretty(&module)\n .expect(\"could not convert AST to a pretty JSON string\"),\n DumpFormat::Debug => format!(\"{module:#?}\"),\n }\n } else {\n let scope = context.realm().scope().clone();\n let mut script = {\n let _timer = counters.new_timer(\"Parsing\");\n parser\n .parse_script(&scope, context.interner_mut())\n .map_err(|e| eyre!(\"Uncaught SyntaxError: {e}\"))?\n };\n\n if args.optimize {\n context.optimize_statement_list(script.statements_mut());\n }\n\n let _timer = counters.new_timer(\"AST generation\");\n match arg {\n DumpFormat::Json => serde_json::to_string(&script)\n .expect(\"could not convert AST to a JSON string\"),\n DumpFormat::JsonPretty => serde_json::to_string_pretty(&script)\n .expect(\"could not convert AST to a pretty JSON string\"),\n DumpFormat::Debug => format!(\"{script:#?}\"),\n }\n };\n drop(counters);\n println!(\"{dump}\");\n }\n\n Ok(())\n}\n\nfn generate_flowgraph(\n context: &mut Context,\n src: Source<'_, R>,\n format: FlowgraphFormat,\n direction: Option,\n) -> Result {\n let script = Script::parse(src, None, context).map_err(|e| e.into_erased(context))?;\n let code = script\n .codeblock(context)\n .map_err(|e| e.into_erased(context))?;\n let direction = match direction {\n Some(FlowgraphDirection::TopToBottom) | None => Direction::TopToBottom,\n Some(FlowgraphDirection::BottomToTop) => Direction::BottomToTop,\n Some(FlowgraphDirection::LeftToRight) => Direction::LeftToRight,\n Some(FlowgraphDirection::RightToLeft) => Direction::RightToLeft,\n };\n let mut graph = Graph::new(direction);\n code.to_graph(graph.subgraph(String::default()));\n let result = match format {\n FlowgraphFormat::Graphviz => graph.to_graphviz_format(),\n FlowgraphFormat::Mermaid => graph.to_mermaid_format(),\n };\n Ok(result)\n}\n\n#[must_use]\nfn uncaught_error(error: &JsError) -> String {\n format!(\n \"{} {}\\n\",\n \"Uncaught Error:\".red().bold(),\n error.to_string().red()\n )\n}\n\n#[must_use]\nfn uncaught_job_error(error: &JsError) -> String {\n format!(\n \"{} {}\\n\",\n \"Uncaught Error (during job evaluation):\".red().bold(),\n error.to_string().red()\n )\n}\n\nfn evaluate_expr(\n line: &str,\n args: &Opt,\n context: &mut Context,\n printer: &SharedExternalPrinterLogger,\n) -> Result<()> {\n if args.has_dump_flag() {\n dump(Source::from_bytes(line), args, context)?;\n } else if let Some(flowgraph) = args.flowgraph {\n match generate_flowgraph(\n context,\n Source::from_bytes(line),\n flowgraph.unwrap_or(FlowgraphFormat::Graphviz),\n args.flowgraph_direction,\n ) {\n Ok(v) => println!(\"{v}\"),\n Err(v) => eprintln!(\"{v:?}\"),\n }\n } else {\n let mut counters = Counters::new(args.time);\n let script = {\n let _timer = counters.new_timer(\"Parsing\");\n Script::parse(Source::from_bytes(line), None, context)\n };\n\n match script {\n Ok(script) => {\n let result = {\n let _timer = counters.new_timer(\"Execution\");\n let result = script.evaluate(context);\n if let Err(err) = context.run_jobs() {\n printer.print(uncaught_job_error(&err));\n }\n result\n };\n match result {\n Ok(v) => printer.print(format!(\"{}\\n\", v.display())),\n Err(ref v) => printer.print(uncaught_error(v)),\n }\n }\n Err(ref v) => printer.print(uncaught_error(v)),\n }\n }\n\n Ok(())\n}\n\nfn evaluate_file(\n file: &Path,\n args: &Opt,\n context: &mut Context,\n loader: &SimpleModuleLoader,\n printer: &SharedExternalPrinterLogger,\n) -> Result<()> {\n if args.has_dump_flag() {\n return dump(Source::from_filepath(file)?, args, context);\n }\n\n if let Some(flowgraph) = args.flowgraph {\n let flowgraph = generate_flowgraph(\n context,\n Source::from_filepath(file)?,\n flowgraph.unwrap_or(FlowgraphFormat::Graphviz),\n args.flowgraph_direction,\n )?;\n\n println!(\"{flowgraph}\");\n\n return Ok(());\n }\n\n if args.module {\n let source = Source::from_filepath(file)?;\n let mut counters = Counters::new(args.time);\n let module = {\n let _timer = counters.new_timer(\"Parsing\");\n Module::parse(source, None, context)\n };\n let module = module.map_err(|e| e.into_erased(context))?;\n\n loader.insert(\n file.canonicalize()\n .wrap_err(\"could not canonicalize input file path\")?,\n module.clone(),\n );\n\n let promise = {\n let _timer = counters.new_timer(\"Execution\");\n let promise = module.load_link_evaluate(context);\n context.run_jobs().map_err(|err| err.into_erased(context))?;\n Ok::<_, JsErasedError>(promise)\n }?;\n let result = promise.state();\n\n return match result {\n PromiseState::Pending => Err(eyre!(\"module didn't execute\")),\n PromiseState::Fulfilled(_) => Ok(()),\n PromiseState::Rejected(err) => {\n Err(JsError::from_opaque(err).into_erased(context).into())\n }\n };\n }\n\n let source = Source::from_filepath(file)?;\n let mut counters = Counters::new(args.time);\n let script = {\n let _timer = counters.new_timer(\"Parsing\");\n Script::parse(source, None, context)\n };\n let script = script.map_err(|e| e.into_erased(context))?;\n\n let result = {\n let _timer = counters.new_timer(\"Execution\");\n let result = script.evaluate(context);\n context.run_jobs().map_err(|err| err.into_erased(context))?;\n result\n };\n\n match result {\n Ok(v) => {\n if !v.is_undefined() {\n println!(\"{}\", v.display());\n }\n }\n Err(v) => printer.print(uncaught_error(&v)),\n }\n\n Ok(())\n}\n\nfn evaluate_files(\n args: &Opt,\n context: &mut Context,\n loader: &SimpleModuleLoader,\n printer: &SharedExternalPrinterLogger,\n) -> Result<()> {\n for file in &args.files {\n evaluate_file(file, args, context, loader, printer)?;\n }\n Ok(())\n}\n\n#[expect(clippy::too_many_lines)]\nfn main() -> Result<()> {\n color_eyre::config::HookBuilder::default()\n .display_location_section(false)\n .display_env_section(false)\n .install()?;\n\n rustls::crypto::ring::default_provider()\n .install_default()\n .map_err(|_| eyre!(\"could not install ring as the default crypto provider\"))?;\n\n #[cfg(feature = \"dhat\")]\n let _profiler = dhat::Profiler::new_heap();\n\n let args = Opt::parse();\n\n // A channel of expressions to run.\n let (sender, receiver) = async_channel::unbounded();\n let printer = SharedExternalPrinterLogger::new();\n\n let executor = Rc::new(Executor::new(printer.clone()));\n let loader = Rc::new(SimpleModuleLoader::new(&args.root).map_err(|e| eyre!(e.to_string()))?);\n let context = &mut ContextBuilder::new()\n .job_executor(executor.clone())\n .module_loader(loader.clone())\n .build()\n .map_err(|e| eyre!(e.to_string()))?;\n\n // Strict mode\n context.strict(args.strict);\n\n // Add `console`.\n add_runtime(printer.clone(), context);\n\n // Trace Output\n context.set_trace(args.trace);\n\n if args.debug_object {\n init_boa_debug_object(context);\n }\n\n // Configure optimizer options\n let mut optimizer_options = OptimizerOptions::empty();\n optimizer_options.set(OptimizerOptions::STATISTICS, args.optimizer_statistics);\n optimizer_options.set(OptimizerOptions::OPTIMIZE_ALL, args.optimize);\n context.set_optimizer_options(optimizer_options);\n\n if !args.files.is_empty() {\n evaluate_files(&args, context, &loader, &printer)?;\n\n if let Some(ref expr) = args.expression {\n evaluate_expr(expr, &args, context, &printer)?;\n }\n\n return Ok(());\n } else if let Some(ref expr) = args.expression {\n evaluate_expr(expr, &args, context, &printer)?;\n return Ok(());\n } else if !io::stdin().is_terminal() {\n let mut input = String::new();\n io::stdin()\n .read_to_string(&mut input)\n .wrap_err(\"failed to read stdin\")?;\n return if input.is_empty() {\n Ok(())\n } else {\n evaluate_expr(&input, &args, context, &printer)\n };\n }\n\n // Print the welcome banner unless --quiet is passed.\n if !args.quiet {\n let version = env!(\"CARGO_PKG_VERSION\");\n println!(\"{}\", format!(\"Welcome to Boa v{version}\").bold());\n println!(\n \"Type {} for more information, {} to exit.\",\n \"\\\".help\\\"\".green(),\n \"Ctrl+D\".green()\n );\n println!();\n }\n\n let handle = start_readline_thread(sender, printer.clone(), args.vi_mode, args.strict);\n\n // TODO: Replace the `__BOA_LOAD_FILE__` string sentinel with a `CliCommand` enum\n // (e.g. `Exec(String)` / `LoadFile(PathBuf)`) for type-safe cross-thread communication.\n let exec = executor.clone();\n let eval_loop = NativeAsyncJob::new(async move |context| {\n while let Ok(line) = receiver.recv().await {\n let printer_clone = printer.clone();\n\n if let Some(file_path) = line.strip_prefix(\"__BOA_LOAD_FILE__:\") {\n let path = Path::new(file_path);\n if path.exists() {\n let mut context = context.borrow_mut();\n if let Err(e) =\n evaluate_file(path, &args, &mut context, &loader, &printer_clone)\n {\n printer_clone.print(format!(\"{e}\\n\"));\n }\n } else {\n printer_clone.print(format!(\n \"{} file '{}' not found\\n\",\n \"Error:\".red().bold(),\n file_path\n ));\n }\n continue;\n }\n\n // schedule a new evaluation job that can run asynchronously\n // with the other evaluations.\n let eval_script = NativeAsyncJob::new(async move |context| {\n let script =\n match Script::parse(Source::from_bytes(&line), None, &mut context.borrow_mut())\n {\n Ok(script) => script,\n Err(err) => {\n printer_clone.print(uncaught_error(&err));\n return Ok(JsValue::undefined());\n }\n };\n\n // TODO: would be better to avoid blocking until the\n // script finishes executing, but need to think about how\n // to change the API of `evaluate_async` to enable that.\n // (or I guess we could also implement web workers)\n let value = match script.evaluate(&mut context.borrow_mut()) {\n Ok(value) => value,\n Err(err) => {\n printer_clone.print(uncaught_job_error(&err));\n return Ok(JsValue::undefined());\n }\n };\n\n printer_clone.print(format!(\"{}\\n\", value.display()));\n\n Ok(JsValue::undefined())\n });\n context.borrow_mut().enqueue_job(eval_script.into());\n }\n // channel was closed, so clear the executor queue to abort all\n // pending jobs and exit.\n exec.clear();\n Ok(JsValue::undefined())\n });\n context.enqueue_job(eval_loop.into());\n\n let result = context.run_jobs().map_err(|e| e.into_erased(context));\n\n handle.join().expect(\"failed to join thread\");\n\n Ok(result?)\n}\n\nfn readline_thread_main(\n sender: &Sender,\n printer_out: &SharedExternalPrinterLogger,\n vi_mode: bool,\n strict: bool,\n) -> Result<()> {\n let config = Config::builder()\n .keyseq_timeout(Some(1))\n .edit_mode(if vi_mode {\n EditMode::Vi\n } else {\n EditMode::Emacs\n })\n .build();\n\n let mut editor =\n Editor::with_config(config).wrap_err(\"failed to set the editor configuration\")?;\n if let Ok(printer) = editor.create_external_printer() {\n printer_out.set(printer);\n }\n\n // Check if the history file exists. If it doesn't, create it.\n OpenOptions::new()\n .read(true)\n .write(true)\n .create(true)\n .truncate(false)\n .open(CLI_HISTORY)?;\n editor\n .load_history(CLI_HISTORY)\n .wrap_err(\"failed to read history file `.boa_history`\")?;\n let readline = \">> \";\n editor.set_helper(Some(helper::RLHelper::new(readline, strict)));\n\n loop {\n match editor.readline(readline).map(|l| l.trim().to_string()) {\n Ok(line) if line == \".exit\" => break,\n Err(ReadlineError::Eof) => break,\n Err(ReadlineError::Interrupted) => {\n println!(\"(To exit, press Ctrl+D or type .exit)\");\n }\n\n Ok(ref line) if line == \".help\" => {\n println!(\"REPL Commands:\");\n println!(\" {} Show this help message\", \".help\".green());\n println!(\" {} Exit the REPL\", \".exit\".green());\n println!(\" {} Clear the terminal screen\", \".clear\".green());\n println!(\n \" {} Load and evaluate a JavaScript file\",\n \".load \".green()\n );\n println!();\n println!(\"Press {} to abort the current expression.\", \"Ctrl+C\".bold());\n println!(\"Press {} to exit the REPL.\", \"Ctrl+D\".bold());\n }\n\n Ok(ref line) if line == \".clear\" => {\n print!(\"\\x1B[2J\\x1B[3J\\x1B[1;1H\");\n io::stdout().flush().ok();\n }\n\n Ok(ref line) if line == \".load\" || line.starts_with(\".load \") => {\n let file = line.strip_prefix(\".load\").unwrap_or(\"\").trim();\n if file.is_empty() {\n eprintln!(\"{}\", \"Usage: .load \".yellow());\n } else {\n sender.send_blocking(format!(\"__BOA_LOAD_FILE__:{file}\"))?;\n thread::sleep(Duration::from_millis(10));\n }\n }\n\n Ok(line) => {\n editor.add_history_entry(&line).map_err(io::Error::other)?;\n sender.send_blocking(line)?;\n thread::sleep(Duration::from_millis(10));\n }\n\n Err(err) => {\n let final_error = eyre!(\"could not read the next line of the input\");\n let final_error = if let Err(e) = editor.save_history(CLI_HISTORY) {\n final_error.error(e)\n } else {\n final_error\n };\n return Err(final_error.error(err));\n }\n }\n }\n\n editor.save_history(CLI_HISTORY)?;\n\n Ok(())\n}\n\n/// Create the readline thread which sends lines from stdin back to the main thread.\nfn start_readline_thread(\n sender: Sender,\n printer_out: SharedExternalPrinterLogger,\n vi_mode: bool,\n strict: bool,\n) -> thread::JoinHandle<()> {\n thread::spawn(\n move || match readline_thread_main(&sender, &printer_out, vi_mode, strict) {\n Ok(()) => {}\n Err(e) => eprintln!(\"readline thread failed: {e}\"),\n },\n )\n}\n\n/// Adds the CLI runtime to the context with default options.\nfn add_runtime(printer: SharedExternalPrinterLogger, context: &mut Context) {\n boa_runtime::register(\n (\n boa_runtime::extensions::ConsoleExtension(printer),\n #[cfg(feature = \"fetch\")]\n boa_runtime::extensions::FetchExtension(\n boa_runtime::fetch::BlockingReqwestFetcher::default(),\n ),\n ),\n None,\n context,\n )\n .expect(\"should not fail while registering the runtime\");\n}\n" }, { "path": "clippy.toml", "content": "doc-valid-idents = ['ECMAScript', 'JavaScript', 'SpiderMonkey', 'GitHub']\nallow-print-in-tests = true\ndisallowed-methods = [\n { path = \"str::to_ascii_lowercase\", reason = \"To avoid memory allocation, use `cow_utils::CowUtils::cow_to_ascii_lowercase` instead.\" },\n { path = \"str::to_ascii_uppercase\", reason = \"To avoid memory allocation, use `cow_utils::CowUtils::cow_to_ascii_uppercase` instead.\" },\n { path = \"str::to_lowercase\", reason = \"To avoid memory allocation, use `cow_utils::CowUtils::cow_to_lowercase` instead.\" },\n { path = \"str::to_uppercase\", reason = \"To avoid memory allocation, use `cow_utils::CowUtils::cow_to_uppercase` instead.\" },\n { path = \"str::replace\", reason = \"To avoid memory allocation, use `cow_utils::CowUtils::cow_replace` instead.\" },\n { path = \"str::replacen\", reason = \"To avoid memory allocation, use `cow_utils::CowUtils::cow_replacen` instead.\" },\n]\n" }, { "path": "core/ast/ABOUT.md", "content": "# About Boa\n\nBoa is an open-source, experimental ECMAScript Engine written in Rust for\nlexing, parsing and executing ECMAScript/JavaScript. Currently, Boa supports some\nof the [language][boa-conformance]. More information can be viewed at [Boa's\nwebsite][boa-web].\n\nTry out the most recent release with Boa's live demo\n[playground][boa-playground].\n\n## Boa Crates\n\n- [**`boa_cli`**][cli] - Boa's CLI && REPL implementation\n- [**`boa_ast`**][ast] - Boa's ECMAScript Abstract Syntax Tree.\n- [**`boa_engine`**][engine] - Boa's implementation of ECMAScript builtin objects and execution.\n- [**`boa_gc`**][gc] - Boa's garbage collector.\n- [**`boa_icu_provider`**][icu] - Boa's ICU4X data provider.\n- [**`boa_interner`**][interner] - Boa's string interner.\n- [**`boa_macros`**][macros] - Boa's macros.\n- [**`boa_parser`**][parser] - Boa's lexer and parser.\n- [**`boa_runtime`**][runtime] - Boa's `WebAPI` features.\n- [**`boa_string`**][string] - Boa's ECMAScript string implementation.\n- [**`boa_wintertc`**][wintertc] - Boa's `WinterTC` (TC55) Minimum Common Web API implementation.\n- [**`tag_ptr`**][tag_ptr] - Utility library that enables a pointer to be associated with a tag of type `usize`.\n- [**`small_btree`**][small_btree] - Utility library that adds the `SmallBTreeMap` data structure.\n\n[boa-conformance]: https://boajs.dev/conformance\n[boa-web]: https://boajs.dev/\n[boa-playground]: https://boajs.dev/playground\n[ast]: https://docs.rs/boa_ast/latest/boa_ast/index.html\n[engine]: https://docs.rs/boa_engine/latest/boa_engine/index.html\n[gc]: https://docs.rs/boa_gc/latest/boa_gc/index.html\n[interner]: https://docs.rs/boa_interner/latest/boa_interner/index.html\n[parser]: https://docs.rs/boa_parser/latest/boa_parser/index.html\n[icu]: https://docs.rs/boa_icu_provider/latest/boa_icu_provider/index.html\n[runtime]: https://docs.rs/boa_runtime/latest/boa_runtime/index.html\n[string]: https://docs.rs/boa_string/latest/boa_string/index.html\n[wintertc]: https://docs.rs/boa_wintertc/latest/boa_wintertc/index.html\n[tag_ptr]: https://docs.rs/tag_ptr/latest/tag_ptr/index.html\n[small_btree]: https://docs.rs/small_btree/latest/small_btree/index.html\n[macros]: https://docs.rs/boa_macros/latest/boa_macros/index.html\n[cli]: https://crates.io/crates/boa_cli\n" }, { "path": "core/ast/Cargo.toml", "content": "[package]\nname = \"boa_ast\"\ndescription = \"Abstract Syntax Tree definition for the Boa JavaScript engine.\"\nkeywords = [\"javascript\", \"js\", \"syntax\", \"ast\"]\ncategories = [\"parser-implementations\", \"compilers\"]\nversion.workspace = true\nedition.workspace = true\nauthors.workspace = true\nlicense.workspace = true\nrepository.workspace = true\nrust-version.workspace = true\n\n[features]\nannex-b = []\nserde = [\"dep:serde\", \"boa_interner/serde\", \"bitflags/serde\", \"num-bigint/serde\"]\narbitrary = [\"dep:arbitrary\", \"boa_interner/arbitrary\", \"num-bigint/arbitrary\"]\n\n[dependencies]\nboa_interner.workspace = true\nboa_macros.workspace = true\nboa_string.workspace = true\nrustc-hash = { workspace = true, features = [\"std\"] }\nbitflags.workspace = true\nnum-bigint.workspace = true\nserde = { workspace = true, features = [\"derive\"], optional = true }\narbitrary = { workspace = true, features = [\"derive\"], optional = true }\nindexmap.workspace = true\nstrum.workspace = true\n\n[lints]\nworkspace = true\n\n[package.metadata.docs.rs]\nall-features = true\n" }, { "path": "core/ast/src/declaration/export.rs", "content": "//! Export declaration AST nodes.\n//!\n//! This module contains `export` declaration AST nodes.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript specification][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-exports\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/export\n\nuse super::{ImportAttribute, ModuleSpecifier, VarDeclaration};\nuse crate::{\n Declaration, Expression,\n function::{\n AsyncFunctionDeclaration, AsyncGeneratorDeclaration, ClassDeclaration, FunctionDeclaration,\n GeneratorDeclaration,\n },\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::Sym;\nuse std::ops::ControlFlow;\n\n/// The kind of re-export in an [`ExportDeclaration`].\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq, Eq)]\npub enum ReExportKind {\n /// Namespaced Re-export (`export * as name from \"module-name\"`).\n Namespaced {\n /// Reexported name for the imported module.\n name: Option,\n },\n /// Re-export list (`export { export1, export2 as alias2 } from \"module-name\"`).\n Named {\n /// List of the required re-exports of the re-exported module.\n names: Box<[ExportSpecifier]>,\n },\n}\n\nimpl VisitWith for ReExportKind {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Namespaced { name: Some(name) } => visitor.visit_sym(name),\n Self::Namespaced { name: None } => ControlFlow::Continue(()),\n Self::Named { names } => {\n for name in &**names {\n visitor.visit_export_specifier(name)?;\n }\n ControlFlow::Continue(())\n }\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Namespaced { name: Some(name) } => visitor.visit_sym_mut(name),\n Self::Namespaced { name: None } => ControlFlow::Continue(()),\n Self::Named { names } => {\n for name in &mut **names {\n visitor.visit_export_specifier_mut(name)?;\n }\n ControlFlow::Continue(())\n }\n }\n }\n}\n\n/// An export declaration AST node.\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ExportDeclaration\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, PartialEq)]\npub enum ExportDeclaration {\n /// Re-export.\n ReExport {\n /// The kind of reexport declared.\n kind: ReExportKind,\n /// Reexported module specifier.\n specifier: ModuleSpecifier,\n /// Re-export attributes.\n attributes: Box<[ImportAttribute]>,\n },\n /// List of exports.\n List(Box<[ExportSpecifier]>),\n /// Variable statement export.\n VarStatement(VarDeclaration),\n /// Declaration export.\n Declaration(Declaration),\n /// Default function export.\n DefaultFunctionDeclaration(FunctionDeclaration),\n /// Default generator export.\n DefaultGeneratorDeclaration(GeneratorDeclaration),\n /// Default async function export.\n DefaultAsyncFunctionDeclaration(AsyncFunctionDeclaration),\n /// Default async generator export.\n DefaultAsyncGeneratorDeclaration(AsyncGeneratorDeclaration),\n /// Default class declaration export.\n DefaultClassDeclaration(Box),\n /// Default assignment expression export.\n DefaultAssignmentExpression(Expression),\n}\n\nimpl VisitWith for ExportDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::ReExport {\n specifier,\n kind,\n attributes,\n } => {\n visitor.visit_module_specifier(specifier)?;\n visitor.visit_re_export_kind(kind)?;\n for attribute in &**attributes {\n visitor.visit_import_attribute(attribute)?;\n }\n ControlFlow::Continue(())\n }\n Self::List(list) => {\n for item in &**list {\n visitor.visit_export_specifier(item)?;\n }\n ControlFlow::Continue(())\n }\n Self::VarStatement(var) => visitor.visit_var_declaration(var),\n Self::Declaration(decl) => visitor.visit_declaration(decl),\n Self::DefaultFunctionDeclaration(f) => visitor.visit_function_declaration(f),\n Self::DefaultGeneratorDeclaration(g) => visitor.visit_generator_declaration(g),\n Self::DefaultAsyncFunctionDeclaration(af) => {\n visitor.visit_async_function_declaration(af)\n }\n Self::DefaultAsyncGeneratorDeclaration(ag) => {\n visitor.visit_async_generator_declaration(ag)\n }\n Self::DefaultClassDeclaration(c) => visitor.visit_class_declaration(c),\n Self::DefaultAssignmentExpression(expr) => visitor.visit_expression(expr),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::ReExport {\n specifier,\n kind,\n attributes,\n } => {\n visitor.visit_module_specifier_mut(specifier)?;\n visitor.visit_re_export_kind_mut(kind)?;\n for attribute in &mut **attributes {\n visitor.visit_import_attribute_mut(attribute)?;\n }\n ControlFlow::Continue(())\n }\n Self::List(list) => {\n for item in &mut **list {\n visitor.visit_export_specifier_mut(item)?;\n }\n ControlFlow::Continue(())\n }\n Self::VarStatement(var) => visitor.visit_var_declaration_mut(var),\n Self::Declaration(decl) => visitor.visit_declaration_mut(decl),\n Self::DefaultFunctionDeclaration(f) => visitor.visit_function_declaration_mut(f),\n Self::DefaultGeneratorDeclaration(g) => visitor.visit_generator_declaration_mut(g),\n Self::DefaultAsyncFunctionDeclaration(af) => {\n visitor.visit_async_function_declaration_mut(af)\n }\n Self::DefaultAsyncGeneratorDeclaration(ag) => {\n visitor.visit_async_generator_declaration_mut(ag)\n }\n Self::DefaultClassDeclaration(c) => visitor.visit_class_declaration_mut(c),\n Self::DefaultAssignmentExpression(expr) => visitor.visit_expression_mut(expr),\n }\n }\n}\n\n/// Export specifier\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ExportSpecifier\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, Copy, PartialEq, Eq)]\npub struct ExportSpecifier {\n alias: Sym,\n private_name: Sym,\n string_literal: bool,\n}\n\nimpl ExportSpecifier {\n /// Creates a new [`ExportSpecifier`].\n #[inline]\n #[must_use]\n pub const fn new(alias: Sym, private_name: Sym, string_literal: bool) -> Self {\n Self {\n alias,\n private_name,\n string_literal,\n }\n }\n\n /// Gets the original alias.\n #[inline]\n #[must_use]\n pub const fn alias(self) -> Sym {\n self.alias\n }\n\n /// Gets the private name of the export inside the module.\n #[inline]\n #[must_use]\n pub const fn private_name(self) -> Sym {\n self.private_name\n }\n\n /// Returns `true` if the private name of the specifier was a `StringLiteral`.\n #[inline]\n #[must_use]\n pub const fn string_literal(&self) -> bool {\n self.string_literal\n }\n}\n\nimpl VisitWith for ExportSpecifier {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_sym(&self.alias)?;\n visitor.visit_sym(&self.private_name)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_sym_mut(&mut self.alias)?;\n visitor.visit_sym_mut(&mut self.private_name)\n }\n}\n\n/// The name under which a reexported binding is exported by a module.\n///\n/// This differs slightly from the spec, since `[[ImportName]]` can be either a name, `all-but-default`\n/// or `all`, but the last two exports can be identified with the `export_name` field from\n/// [`ExportEntry`], which joins both variants into a single `Star` variant.\n#[derive(Debug, Clone, Copy)]\npub enum ReExportImportName {\n /// A binding of the imported module.\n Name(Sym),\n /// All exports of the module.\n Star,\n}\n\n/// [`ExportEntry`][spec] record.\n///\n/// [spec]: https://tc39.es/ecma262/#table-exportentry-records\n#[derive(Debug, Clone)]\npub enum ExportEntry {\n /// An ordinary export entry\n Ordinary(LocalExportEntry),\n /// A star reexport entry.\n StarReExport {\n /// The module from where this reexport will import.\n module_request: Sym,\n /// The import attributes for this reexport.\n attributes: Box<[ImportAttribute]>,\n },\n /// A reexport entry with an export name.\n ReExport(IndirectExportEntry),\n}\n\nimpl From for ExportEntry {\n fn from(v: IndirectExportEntry) -> Self {\n Self::ReExport(v)\n }\n}\n\nimpl From for ExportEntry {\n fn from(v: LocalExportEntry) -> Self {\n Self::Ordinary(v)\n }\n}\n\n/// A local export entry\n#[derive(Debug, Clone, Copy)]\npub struct LocalExportEntry {\n local_name: Sym,\n export_name: Sym,\n}\n\nimpl LocalExportEntry {\n /// Creates a new `LocalExportEntry`.\n #[must_use]\n pub const fn new(local_name: Sym, export_name: Sym) -> Self {\n Self {\n local_name,\n export_name,\n }\n }\n\n /// Gets the local name of this export entry.\n #[must_use]\n pub const fn local_name(&self) -> Sym {\n self.local_name\n }\n\n /// Gets the export name of this export entry.\n #[must_use]\n pub const fn export_name(&self) -> Sym {\n self.export_name\n }\n}\n\n/// A reexported export entry.\n#[derive(Debug, Clone)]\npub struct IndirectExportEntry {\n module_request: Sym,\n import_name: ReExportImportName,\n export_name: Sym,\n attributes: Box<[ImportAttribute]>,\n}\n\nimpl IndirectExportEntry {\n /// Creates a new `IndirectExportEntry`.\n #[must_use]\n pub fn new(\n module_request: Sym,\n import_name: ReExportImportName,\n export_name: Sym,\n attributes: Box<[ImportAttribute]>,\n ) -> Self {\n Self {\n module_request,\n import_name,\n export_name,\n attributes,\n }\n }\n\n /// Gets the module from where this entry reexports.\n #[must_use]\n pub const fn module_request(&self) -> Sym {\n self.module_request\n }\n\n /// Gets the import name of the reexport.\n #[must_use]\n pub const fn import_name(&self) -> ReExportImportName {\n self.import_name\n }\n\n /// Gets the public alias of the reexport.\n #[must_use]\n pub const fn export_name(&self) -> Sym {\n self.export_name\n }\n\n /// Gets the import attributes.\n #[must_use]\n pub fn attributes(&self) -> &[ImportAttribute] {\n &self.attributes\n }\n}\n" }, { "path": "core/ast/src/declaration/import.rs", "content": "//! Import declaration AST nodes.\n//!\n//! This module contains `import` declaration AST nodes.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript specification][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-imports\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/import\n\nuse std::ops::ControlFlow;\n\nuse crate::{\n expression::Identifier,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::Sym;\n\nuse super::{ImportAttribute, ModuleSpecifier};\n\n/// The kind of import in an [`ImportDeclaration`].\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq, Eq)]\npub enum ImportKind {\n /// Default (`import defaultName from \"module-name\"`) or unnamed (`import \"module-name\"`).\n DefaultOrUnnamed,\n /// Namespaced import (`import * as name from \"module-name\"`).\n Namespaced {\n /// Binding for the namespace created from the exports of the imported module.\n binding: Identifier,\n },\n /// Import list (`import { export1, export2 as alias2 } from \"module-name\"`).\n Named {\n /// List of the required exports of the imported module.\n names: Box<[ImportSpecifier]>,\n },\n}\n\nimpl VisitWith for ImportKind {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::DefaultOrUnnamed => ControlFlow::Continue(()),\n Self::Namespaced { binding } => visitor.visit_identifier(binding),\n Self::Named { names } => {\n for name in &**names {\n visitor.visit_import_specifier(name)?;\n }\n ControlFlow::Continue(())\n }\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::DefaultOrUnnamed => ControlFlow::Continue(()),\n Self::Namespaced { binding } => visitor.visit_identifier_mut(binding),\n Self::Named { names } => {\n for name in &mut **names {\n visitor.visit_import_specifier_mut(name)?;\n }\n ControlFlow::Continue(())\n }\n }\n }\n}\n\n/// An import declaration AST node.\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ImportDeclaration\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, PartialEq, Eq)]\npub struct ImportDeclaration {\n /// Binding for the default export of `specifier`.\n default: Option,\n /// See [`ImportKind`].\n kind: ImportKind,\n /// Module specifier.\n specifier: ModuleSpecifier,\n /// Import attributes.\n attributes: Box<[ImportAttribute]>,\n}\n\nimpl ImportDeclaration {\n /// Creates a new import declaration.\n #[inline]\n #[must_use]\n pub fn new(\n default: Option,\n kind: ImportKind,\n specifier: ModuleSpecifier,\n attributes: Box<[ImportAttribute]>,\n ) -> Self {\n Self {\n default,\n kind,\n specifier,\n attributes,\n }\n }\n\n /// Gets the binding for the default export of the module.\n #[inline]\n #[must_use]\n pub const fn default(&self) -> Option {\n self.default\n }\n\n /// Gets the module specifier of the import declaration.\n #[inline]\n #[must_use]\n pub const fn specifier(&self) -> ModuleSpecifier {\n self.specifier\n }\n\n /// Gets the import kind of the import declaration.\n #[inline]\n #[must_use]\n pub const fn kind(&self) -> &ImportKind {\n &self.kind\n }\n\n /// Gets the import attributes of the import declaration.\n #[inline]\n #[must_use]\n pub const fn attributes(&self) -> &[ImportAttribute] {\n &self.attributes\n }\n}\n\nimpl VisitWith for ImportDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(default) = &self.default {\n visitor.visit_identifier(default)?;\n }\n visitor.visit_import_kind(&self.kind)?;\n visitor.visit_module_specifier(&self.specifier)?;\n for attribute in &*self.attributes {\n visitor.visit_import_attribute(attribute)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(default) = &mut self.default {\n visitor.visit_identifier_mut(default)?;\n }\n visitor.visit_import_kind_mut(&mut self.kind)?;\n visitor.visit_module_specifier_mut(&mut self.specifier)?;\n for attribute in &mut *self.attributes {\n visitor.visit_import_attribute_mut(attribute)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// Import specifier\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ImportSpecifier\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\npub struct ImportSpecifier {\n binding: Identifier,\n export_name: Sym,\n}\n\nimpl ImportSpecifier {\n /// Creates a new [`ImportSpecifier`].\n #[inline]\n #[must_use]\n pub const fn new(binding: Identifier, export_name: Sym) -> Self {\n Self {\n binding,\n export_name,\n }\n }\n\n /// Gets the binding of the import specifier.\n #[inline]\n #[must_use]\n pub const fn binding(self) -> Identifier {\n self.binding\n }\n\n /// Gets the optional export name of the import.\n #[inline]\n #[must_use]\n pub const fn export_name(self) -> Sym {\n self.export_name\n }\n}\n\nimpl VisitWith for ImportSpecifier {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_identifier(&self.binding)?;\n visitor.visit_sym(&self.export_name)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_identifier_mut(&mut self.binding)?;\n visitor.visit_sym_mut(&mut self.export_name)\n }\n}\n\n/// The name under which the imported binding is exported by a module.\n#[derive(Debug, Clone, Copy)]\npub enum ImportName {\n /// The namespace object of the imported module.\n Namespace,\n /// A binding of the imported module.\n Name(Sym),\n}\n\n/// [`ImportEntry`][spec] record.\n///\n/// [spec]: https://tc39.es/ecma262/#table-importentry-record-fields\n#[derive(Debug, Clone)]\npub struct ImportEntry {\n module_request: Sym,\n import_name: ImportName,\n local_name: Identifier,\n attributes: Box<[ImportAttribute]>,\n}\n\nimpl ImportEntry {\n /// Creates a new `ImportEntry`.\n #[must_use]\n pub fn new(\n module_request: Sym,\n import_name: ImportName,\n local_name: Identifier,\n attributes: Box<[ImportAttribute]>,\n ) -> Self {\n Self {\n module_request,\n import_name,\n local_name,\n attributes,\n }\n }\n\n /// Gets the module from where the binding must be imported.\n #[must_use]\n pub const fn module_request(&self) -> Sym {\n self.module_request\n }\n\n /// Gets the import name of the imported binding.\n #[must_use]\n pub const fn import_name(&self) -> ImportName {\n self.import_name\n }\n\n /// Gets the local name of the imported binding.\n #[must_use]\n pub const fn local_name(&self) -> Identifier {\n self.local_name\n }\n\n /// Gets the import attributes.\n #[must_use]\n pub fn attributes(&self) -> &[ImportAttribute] {\n &self.attributes\n }\n}\n" }, { "path": "core/ast/src/declaration/mod.rs", "content": "//! The [`Declaration`] Parse Node, as defined by the [spec].\n//!\n//! ECMAScript declarations include:\n//! - [Lexical][lex] declarations (`let`, `const`).\n//! - [Function][fun] declarations (`function`, `async function`).\n//! - [Class][class] declarations.\n//!\n//! See [*Difference between statements and declarations*][diff] for an explanation on why `Declaration`s\n//! and `Statement`s are distinct nodes.\n//!\n//! [spec]: https://tc39.es/ecma262/#prod-Declaration\n//! [lex]: https://tc39.es/ecma262/#prod-LexicalDeclaration\n//! [fun]: https://tc39.es/ecma262/#prod-HoistableDeclaration\n//! [class]: https://tc39.es/ecma262/#prod-ClassDeclaration\n//! [diff]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements#difference_between_statements_and_declarations\n\nuse super::function::{\n AsyncFunctionDeclaration, AsyncGeneratorDeclaration, FunctionDeclaration, GeneratorDeclaration,\n};\nuse crate::{\n function::ClassDeclaration,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, Sym, ToIndentedString, ToInternedString};\nuse core::ops::ControlFlow;\n\nmod export;\nmod import;\nmod variable;\n\npub use export::*;\npub use import::*;\npub use variable::*;\n\n/// The `Declaration` Parse Node.\n///\n/// See the [module level documentation][self] for more information.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum Declaration {\n /// See [`FunctionDeclaration`]\n FunctionDeclaration(FunctionDeclaration),\n\n /// See [`GeneratorDeclaration`]\n GeneratorDeclaration(GeneratorDeclaration),\n\n /// See [`AsyncFunctionDeclaration`]\n AsyncFunctionDeclaration(AsyncFunctionDeclaration),\n\n /// See [`AsyncGeneratorDeclaration`]\n AsyncGeneratorDeclaration(AsyncGeneratorDeclaration),\n\n /// See [`ClassDeclaration`]\n ClassDeclaration(Box),\n\n /// See [`LexicalDeclaration`]\n Lexical(LexicalDeclaration),\n}\n\nimpl ToIndentedString for Declaration {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n match self {\n Self::FunctionDeclaration(f) => f.to_indented_string(interner, indentation),\n Self::GeneratorDeclaration(g) => g.to_indented_string(interner, indentation),\n Self::AsyncFunctionDeclaration(af) => af.to_indented_string(interner, indentation),\n Self::AsyncGeneratorDeclaration(ag) => ag.to_indented_string(interner, indentation),\n Self::ClassDeclaration(c) => c.to_indented_string(interner, indentation),\n Self::Lexical(l) => {\n let mut s = l.to_interned_string(interner);\n s.push(';');\n s\n }\n }\n }\n}\n\nimpl VisitWith for Declaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::FunctionDeclaration(f) => visitor.visit_function_declaration(f),\n Self::GeneratorDeclaration(g) => visitor.visit_generator_declaration(g),\n Self::AsyncFunctionDeclaration(af) => visitor.visit_async_function_declaration(af),\n Self::AsyncGeneratorDeclaration(ag) => visitor.visit_async_generator_declaration(ag),\n Self::ClassDeclaration(c) => visitor.visit_class_declaration(c),\n Self::Lexical(ld) => visitor.visit_lexical_declaration(ld),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::FunctionDeclaration(f) => visitor.visit_function_declaration_mut(f),\n Self::GeneratorDeclaration(g) => visitor.visit_generator_declaration_mut(g),\n Self::AsyncFunctionDeclaration(af) => visitor.visit_async_function_declaration_mut(af),\n Self::AsyncGeneratorDeclaration(ag) => {\n visitor.visit_async_generator_declaration_mut(ag)\n }\n Self::ClassDeclaration(c) => visitor.visit_class_declaration_mut(c),\n Self::Lexical(ld) => visitor.visit_lexical_declaration_mut(ld),\n }\n }\n}\n\n/// Module specifier.\n///\n/// This is equivalent to the [`ModuleSpecifier`] production.\n///\n/// [`FromClause`]: https://tc39.es/ecma262/#prod-ModuleSpecifier\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, Copy, PartialEq, Eq)]\npub struct ModuleSpecifier {\n module: Sym,\n}\n\nimpl ModuleSpecifier {\n /// Creates a `ModuleSpecifier` from a `Sym`.\n #[must_use]\n pub const fn new(module: Sym) -> Self {\n Self { module }\n }\n\n /// Gets the inner `Sym` of the module specifier.\n #[inline]\n #[must_use]\n pub const fn sym(self) -> Sym {\n self.module\n }\n}\n\nimpl From for ModuleSpecifier {\n #[inline]\n fn from(module: Sym) -> Self {\n Self::new(module)\n }\n}\n\nimpl VisitWith for ModuleSpecifier {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_sym(&self.module)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_sym_mut(&mut self.module)\n }\n}\n\n/// An import attribute entry in an [`ImportDeclaration`].\n///\n/// This is a key-value pair, where the key is an identifier or string literal,\n/// and the value is a string literal.\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-imports\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, Copy, PartialEq, Eq)]\npub struct ImportAttribute {\n key: Sym,\n value: Sym,\n}\n\nimpl ImportAttribute {\n /// Creates a new `ImportAttribute`.\n #[inline]\n #[must_use]\n pub const fn new(key: Sym, value: Sym) -> Self {\n Self { key, value }\n }\n\n /// Gets the attribute key.\n #[inline]\n #[must_use]\n pub const fn key(self) -> Sym {\n self.key\n }\n\n /// Gets the attribute value.\n #[inline]\n #[must_use]\n pub const fn value(self) -> Sym {\n self.value\n }\n}\n\nimpl VisitWith for ImportAttribute {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_sym(&self.key)?;\n visitor.visit_sym(&self.value)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_sym_mut(&mut self.key)?;\n visitor.visit_sym_mut(&mut self.value)\n }\n}\n" }, { "path": "core/ast/src/declaration/variable.rs", "content": "//! Variable related declarations.\n\nuse super::Declaration;\nuse crate::{\n Statement,\n expression::{Expression, Identifier},\n join_nodes,\n pattern::Pattern,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::{convert::TryFrom, fmt::Write as _, ops::ControlFlow};\n\n/// A [`var`][var] statement, also called [`VariableStatement`][varstmt] in the spec.\n///\n/// The scope of a variable declared with `var` is its current execution context, which is either\n/// the enclosing function or, for variables declared outside any function, global. If you\n/// re-declare a ECMAScript variable, it will not lose its value.\n///\n/// Although a bit confusing, `VarDeclaration`s are not considered [`Declaration`]s by the spec.\n/// This is partly because it has very different semantics from `let` and `const` declarations, but\n/// also because a `var` statement can be labelled just like any other [`Statement`]:\n///\n/// ```javascript\n/// label: var a = 5;\n/// a;\n/// ```\n///\n/// returns `5` as the value of the statement list, while:\n///\n/// ```javascript\n/// label: let a = 5;\n/// a;\n/// ```\n/// throws a `SyntaxError`.\n///\n/// `var` declarations, wherever they occur, are processed before any code is executed. This is\n/// called [hoisting].\n///\n/// [var]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/var\n/// [varstmt]: https://tc39.es/ecma262/#prod-VariableStatement\n/// [hoisting]: https://developer.mozilla.org/en-US/docs/Glossary/Hoisting\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct VarDeclaration(pub VariableList);\n\nimpl From for Statement {\n fn from(var: VarDeclaration) -> Self {\n Self::Var(var)\n }\n}\n\nimpl ToInternedString for VarDeclaration {\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\"var {}\", self.0.to_interned_string(interner))\n }\n}\n\nimpl VisitWith for VarDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_variable_list(&self.0)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_variable_list_mut(&mut self.0)\n }\n}\n\n/// A **[lexical declaration]** defines variables that are scoped to the lexical environment of\n/// the variable declaration.\n///\n/// [lexical declaration]: https://tc39.es/ecma262/#sec-let-and-const-declarations\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum LexicalDeclaration {\n /// A [const] variable creates a constant whose scope can be either global or local\n /// to the block in which it is declared.\n ///\n /// An initializer for a constant is required. You must specify its value in the same statement\n /// in which it's declared. (This makes sense, given that it can't be changed later)\n ///\n /// [const]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/const\n Const(VariableList),\n\n /// A [let] variable is limited to a scope of a block statement, or expression on\n /// which it is used, unlike the `var` keyword, which defines a variable globally, or locally to\n /// an entire function regardless of block scope.\n ///\n /// Just like const, `let` does not create properties of the window object when declared\n /// globally (in the top-most scope).\n ///\n /// If a let declaration does not have an initializer, the variable is assigned the value `undefined`.\n ///\n /// [let]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/let\n Let(VariableList),\n\n /// A [using] declaration creates a block-scoped resource that is automatically\n /// disposed when control exits the block.\n ///\n /// [using]: https://tc39.es/proposal-explicit-resource-management/\n Using(VariableList),\n\n /// An [await using] declaration creates a block-scoped resource that is automatically\n /// disposed asynchronously when control exits the block.\n ///\n /// [await using]: https://tc39.es/proposal-explicit-resource-management/\n AwaitUsing(VariableList),\n}\n\nimpl LexicalDeclaration {\n /// Gets the inner variable list of the `LexicalDeclaration`\n #[must_use]\n pub const fn variable_list(&self) -> &VariableList {\n match self {\n Self::Const(list) | Self::Let(list) | Self::Using(list) | Self::AwaitUsing(list) => {\n list\n }\n }\n }\n\n /// Returns `true` if the declaration is a `const` declaration.\n #[must_use]\n pub const fn is_const(&self) -> bool {\n matches!(self, Self::Const(_))\n }\n}\n\nimpl From for Declaration {\n fn from(lex: LexicalDeclaration) -> Self {\n Self::Lexical(lex)\n }\n}\n\nimpl ToInternedString for LexicalDeclaration {\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\n \"{} {}\",\n match &self {\n Self::Let(_) => \"let\",\n Self::Const(_) => \"const\",\n Self::Using(_) => \"using\",\n Self::AwaitUsing(_) => \"await using\",\n },\n self.variable_list().to_interned_string(interner)\n )\n }\n}\n\nimpl VisitWith for LexicalDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Const(vars) | Self::Let(vars) | Self::Using(vars) | Self::AwaitUsing(vars) => {\n visitor.visit_variable_list(vars)\n }\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Const(vars) | Self::Let(vars) | Self::Using(vars) | Self::AwaitUsing(vars) => {\n visitor.visit_variable_list_mut(vars)\n }\n }\n }\n}\n\n/// List of variables in a variable declaration.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct VariableList {\n list: Box<[Variable]>,\n}\n\nimpl VariableList {\n /// Creates a variable list if the provided list of [`Variable`] is not empty.\n #[must_use]\n pub fn new(list: Box<[Variable]>) -> Option {\n if list.is_empty() {\n return None;\n }\n\n Some(Self { list })\n }\n}\n\nimpl AsRef<[Variable]> for VariableList {\n fn as_ref(&self) -> &[Variable] {\n &self.list\n }\n}\n\nimpl ToInternedString for VariableList {\n fn to_interned_string(&self, interner: &Interner) -> String {\n join_nodes(interner, self.list.as_ref())\n }\n}\n\nimpl VisitWith for VariableList {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for variable in &*self.list {\n visitor.visit_variable(variable)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for variable in &mut *self.list {\n visitor.visit_variable_mut(variable)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// The error returned by the [`VariableList::try_from`] function.\n#[derive(Debug, Copy, Clone, PartialEq, Eq)]\npub struct TryFromVariableListError(());\n\nimpl std::fmt::Display for TryFromVariableListError {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n \"provided list of variables cannot be empty\".fmt(f)\n }\n}\n\nimpl TryFrom> for VariableList {\n type Error = TryFromVariableListError;\n\n fn try_from(value: Box<[Variable]>) -> Result {\n Self::new(value).ok_or(TryFromVariableListError(()))\n }\n}\n\nimpl TryFrom> for VariableList {\n type Error = TryFromVariableListError;\n\n fn try_from(value: Vec) -> Result {\n Self::try_from(value.into_boxed_slice())\n }\n}\n\n/// Variable represents a variable declaration of some kind.\n///\n/// For `let` and `const` declarations this type represents a [`LexicalBinding`][spec1]\n///\n/// For `var` declarations this type represents a [`VariableDeclaration`][spec2]\n///\n/// More information:\n/// - [ECMAScript reference: 14.3 Declarations and the Variable Statement][spec3]\n///\n/// [spec1]: https://tc39.es/ecma262/#prod-LexicalBinding\n/// [spec2]: https://tc39.es/ecma262/#prod-VariableDeclaration\n/// [spec3]: https://tc39.es/ecma262/#sec-declarations-and-the-variable-statement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Variable {\n binding: Binding,\n init: Option,\n}\n\nimpl ToInternedString for Variable {\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = self.binding.to_interned_string(interner);\n\n if let Some(ref init) = self.init {\n let _ = write!(buf, \" = {}\", init.to_interned_string(interner));\n }\n buf\n }\n}\n\nimpl Variable {\n /// Creates a new variable declaration from a `BindingIdentifier`.\n #[inline]\n #[must_use]\n pub const fn from_identifier(ident: Identifier, init: Option) -> Self {\n Self {\n binding: Binding::Identifier(ident),\n init,\n }\n }\n\n /// Creates a new variable declaration from a `Pattern`.\n #[inline]\n #[must_use]\n pub const fn from_pattern(pattern: Pattern, init: Option) -> Self {\n Self {\n binding: Binding::Pattern(pattern),\n init,\n }\n }\n /// Gets the variable declaration binding.\n #[must_use]\n pub const fn binding(&self) -> &Binding {\n &self.binding\n }\n\n /// Gets the initialization expression for the variable declaration, if any.\n #[inline]\n #[must_use]\n pub const fn init(&self) -> Option<&Expression> {\n self.init.as_ref()\n }\n}\n\nimpl VisitWith for Variable {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_binding(&self.binding)?;\n if let Some(init) = &self.init {\n visitor.visit_expression(init)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_binding_mut(&mut self.binding)?;\n if let Some(init) = &mut self.init {\n visitor.visit_expression_mut(init)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// Binding represents either an individual binding or a binding pattern.\n///\n/// More information:\n/// - [ECMAScript reference: 14.3 Declarations and the Variable Statement][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-declarations-and-the-variable-statement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum Binding {\n /// A single identifier binding.\n Identifier(Identifier),\n /// A pattern binding.\n Pattern(Pattern),\n}\n\nimpl From for Binding {\n fn from(id: Identifier) -> Self {\n Self::Identifier(id)\n }\n}\n\nimpl From for Binding {\n fn from(pat: Pattern) -> Self {\n Self::Pattern(pat)\n }\n}\n\nimpl ToInternedString for Binding {\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self {\n Self::Identifier(id) => id.to_interned_string(interner),\n Self::Pattern(pattern) => pattern.to_interned_string(interner),\n }\n }\n}\n\nimpl VisitWith for Binding {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Identifier(id) => visitor.visit_identifier(id),\n Self::Pattern(pattern) => visitor.visit_pattern(pattern),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Identifier(id) => visitor.visit_identifier_mut(id),\n Self::Pattern(pattern) => visitor.visit_pattern_mut(pattern),\n }\n }\n}\n" }, { "path": "core/ast/src/expression/access.rs", "content": "//! Property access expressions, as defined by the [spec].\n//!\n//! [Property access expressions][access] provide two ways to access properties of an object: *dot notation*\n//! and *bracket notation*.\n//! - *Dot notation* is mostly used when the name of the property is static, and a valid Javascript\n//! identifier e.g. `obj.prop`, `arr.$val`.\n//! - *Bracket notation* is used when the name of the property is either variable, not a valid\n//! identifier or a symbol e.g. `arr[var]`, `arr[5]`, `arr[Symbol.iterator]`.\n//!\n//! A property access expression can be represented by a [`SimplePropertyAccess`] (`x.y`), a\n//! [`PrivatePropertyAccess`] (`x.#y`) or a [`SuperPropertyAccess`] (`super[\"y\"]`), each of them with\n//! slightly different semantics overall.\n//!\n//! [spec]: https://tc39.es/ecma262/multipage/ecmascript-language-expressions.html#sec-property-accessors\n//! [access]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Property_Accessors\n\nuse crate::expression::Expression;\nuse crate::function::PrivateName;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{Span, Spanned};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse super::Identifier;\n\n/// A property access field.\n///\n/// See the [module level documentation][self] for more information.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum PropertyAccessField {\n /// A constant property field, such as `x.prop`.\n Const(Identifier),\n /// An expression property field, such as `x[\"val\"]`.\n Expr(Box),\n}\n\nimpl Spanned for PropertyAccessField {\n #[inline]\n fn span(&self) -> Span {\n match self {\n Self::Const(identifier) => identifier.span(),\n Self::Expr(expression) => expression.span(),\n }\n }\n}\n\nimpl From for PropertyAccessField {\n #[inline]\n fn from(id: Identifier) -> Self {\n Self::Const(id)\n }\n}\n\nimpl From for PropertyAccessField {\n #[inline]\n fn from(expr: Expression) -> Self {\n Self::Expr(Box::new(expr))\n }\n}\n\nimpl VisitWith for PropertyAccessField {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Const(sym) => visitor.visit_sym(sym.sym_ref()),\n Self::Expr(expr) => visitor.visit_expression(expr),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Const(sym) => visitor.visit_sym_mut(sym.sym_mut()),\n Self::Expr(expr) => visitor.visit_expression_mut(&mut *expr),\n }\n }\n}\n\n/// A property access expression.\n///\n/// See the [module level documentation][self] for more information.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum PropertyAccess {\n /// A simple property access (`x.prop`).\n Simple(SimplePropertyAccess),\n /// A property access of a private property (`x.#priv`).\n Private(PrivatePropertyAccess),\n /// A property access of a `super` reference. (`super[\"prop\"]`).\n Super(SuperPropertyAccess),\n}\n\nimpl Spanned for PropertyAccess {\n #[inline]\n fn span(&self) -> Span {\n match self {\n Self::Simple(access) => access.span(),\n Self::Private(access) => access.span(),\n Self::Super(access) => access.span(),\n }\n }\n}\n\nimpl ToInternedString for PropertyAccess {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self {\n Self::Simple(s) => s.to_interned_string(interner),\n Self::Private(p) => p.to_interned_string(interner),\n Self::Super(s) => s.to_interned_string(interner),\n }\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(access: PropertyAccess) -> Self {\n Self::PropertyAccess(access)\n }\n}\n\nimpl VisitWith for PropertyAccess {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Simple(spa) => visitor.visit_simple_property_access(spa),\n Self::Private(ppa) => visitor.visit_private_property_access(ppa),\n Self::Super(supa) => visitor.visit_super_property_access(supa),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Simple(spa) => visitor.visit_simple_property_access_mut(spa),\n Self::Private(ppa) => visitor.visit_private_property_access_mut(ppa),\n Self::Super(supa) => visitor.visit_super_property_access_mut(supa),\n }\n }\n}\n\n/// A simple property access, where the target object is an [`Expression`].\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct SimplePropertyAccess {\n target: Box,\n field: PropertyAccessField,\n}\n\nimpl SimplePropertyAccess {\n /// Gets the target object of the property access.\n #[inline]\n #[must_use]\n pub const fn target(&self) -> &Expression {\n &self.target\n }\n\n /// Gets the accessed field of the target object.\n #[inline]\n #[must_use]\n pub const fn field(&self) -> &PropertyAccessField {\n &self.field\n }\n\n /// Creates a `PropertyAccess` AST Expression.\n pub fn new(target: Expression, field: F) -> Self\n where\n F: Into,\n {\n Self {\n target: target.into(),\n field: field.into(),\n }\n }\n}\n\nimpl Spanned for SimplePropertyAccess {\n #[inline]\n fn span(&self) -> Span {\n Span::new(self.target.span().start(), self.field.span().end())\n }\n}\n\nimpl ToInternedString for SimplePropertyAccess {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n let target = self.target.to_interned_string(interner);\n match self.field {\n PropertyAccessField::Const(ident) => {\n format!(\"{target}.{}\", interner.resolve_expect(ident.sym()))\n }\n PropertyAccessField::Expr(ref expr) => {\n format!(\"{target}[{}]\", expr.to_interned_string(interner))\n }\n }\n }\n}\n\nimpl From for PropertyAccess {\n #[inline]\n fn from(access: SimplePropertyAccess) -> Self {\n Self::Simple(access)\n }\n}\n\nimpl VisitWith for SimplePropertyAccess {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.target)?;\n visitor.visit_property_access_field(&self.field)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.target)?;\n visitor.visit_property_access_field_mut(&mut self.field)\n }\n}\n\n/// An access expression to a class object's [private fields][mdn].\n///\n/// Private property accesses differ slightly from plain property accesses, since the accessed\n/// property must be prefixed by `#`, and the bracket notation is not allowed. For example,\n/// `this.#a` is a valid private property access.\n///\n/// This expression corresponds to the [`MemberExpression.PrivateIdentifier`][spec] production.\n///\n/// [spec]: https://tc39.es/ecma262/#prod-MemberExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes/Private_class_fields\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct PrivatePropertyAccess {\n target: Box,\n field: PrivateName,\n span: Span,\n}\n\nimpl PrivatePropertyAccess {\n /// Creates a `GetPrivateField` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(value: Expression, field: PrivateName, span: Span) -> Self {\n Self {\n target: value.into(),\n field,\n span,\n }\n }\n\n /// Gets the original object from where to get the field from.\n #[inline]\n #[must_use]\n pub const fn target(&self) -> &Expression {\n &self.target\n }\n\n /// Gets the name of the field to retrieve.\n #[inline]\n #[must_use]\n pub const fn field(&self) -> PrivateName {\n self.field\n }\n}\n\nimpl Spanned for PrivatePropertyAccess {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for PrivatePropertyAccess {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\n \"{}.#{}\",\n self.target.to_interned_string(interner),\n interner.resolve_expect(self.field.description())\n )\n }\n}\n\nimpl From for PropertyAccess {\n #[inline]\n fn from(access: PrivatePropertyAccess) -> Self {\n Self::Private(access)\n }\n}\n\nimpl VisitWith for PrivatePropertyAccess {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.target)?;\n visitor.visit_private_name(&self.field)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.target)?;\n visitor.visit_private_name_mut(&mut self.field)\n }\n}\n\n/// A property access of an object's parent, as defined by the [spec].\n///\n/// A `SuperPropertyAccess` is much like a regular [`PropertyAccess`], but where its `target` object\n/// is not a regular object, but a reference to the parent object of the current object ([`super`][mdn]).\n///\n/// [spec]: https://tc39.es/ecma262/#prod-SuperProperty\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/super\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct SuperPropertyAccess {\n field: PropertyAccessField,\n span: Span,\n}\n\nimpl SuperPropertyAccess {\n /// Creates a new property access field node.\n #[must_use]\n pub const fn new(field: PropertyAccessField, span: Span) -> Self {\n Self { field, span }\n }\n\n /// Gets the name of the field to retrieve.\n #[inline]\n #[must_use]\n pub const fn field(&self) -> &PropertyAccessField {\n &self.field\n }\n}\n\nimpl Spanned for SuperPropertyAccess {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for SuperPropertyAccess {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n match &self.field {\n PropertyAccessField::Const(field) => {\n format!(\"super.{}\", interner.resolve_expect(field.sym()))\n }\n PropertyAccessField::Expr(field) => {\n format!(\"super[{}]\", field.to_interned_string(interner))\n }\n }\n }\n}\n\nimpl From for PropertyAccess {\n #[inline]\n fn from(access: SuperPropertyAccess) -> Self {\n Self::Super(access)\n }\n}\n\nimpl VisitWith for SuperPropertyAccess {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_property_access_field(&self.field)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_property_access_field_mut(&mut self.field)\n }\n}\n" }, { "path": "core/ast/src/expression/await.rs", "content": "//! Await expression Expression.\n\nuse core::ops::ControlFlow;\n\nuse super::Expression;\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\n\n/// An await expression is used within an async function to pause execution and wait for a\n/// promise to resolve.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-AwaitExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/await\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Await {\n target: Box,\n span: Span,\n}\n\nimpl Await {\n /// Create a new [`Await`] node.\n #[must_use]\n pub const fn new(target: Box, span: Span) -> Self {\n Self { target, span }\n }\n\n /// Return the target expression that should be awaited.\n #[inline]\n #[must_use]\n pub const fn target(&self) -> &Expression {\n &self.target\n }\n}\n\nimpl Spanned for Await {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for Await {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\"await {}\", self.target.to_indented_string(interner, 0))\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(awaitexpr: Await) -> Self {\n Self::Await(awaitexpr)\n }\n}\n\nimpl VisitWith for Await {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.target)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.target)\n }\n}\n" }, { "path": "core/ast/src/expression/call.rs", "content": "use crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{Span, Spanned, join_nodes};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse super::Expression;\n\n/// Calling the function actually performs the specified actions with the indicated parameters.\n///\n/// Defining a function does not execute it. Defining it simply names the function and\n/// specifies what to do when the function is called. Functions must be in scope when they are\n/// called, but the function declaration can be hoisted. The scope of a function is the\n/// function in which it is declared (or the entire program, if it is declared at the top\n/// level).\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-CallExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Functions#Calling_functions\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Call {\n function: Box,\n args: Box<[Expression]>,\n span: Span,\n}\n\nimpl Call {\n /// Creates a new `Call` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(function: Expression, args: Box<[Expression]>, span: Span) -> Self {\n Self {\n function: Box::new(function),\n args,\n span,\n }\n }\n\n /// Gets the target function of this call expression.\n #[inline]\n #[must_use]\n pub const fn function(&self) -> &Expression {\n &self.function\n }\n\n /// Retrieves the arguments passed to the function.\n #[inline]\n #[must_use]\n pub const fn args(&self) -> &[Expression] {\n &self.args\n }\n}\n\nimpl Spanned for Call {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for Call {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\n \"{}({})\",\n self.function.to_interned_string(interner),\n join_nodes(interner, &self.args)\n )\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(call: Call) -> Self {\n Self::Call(call)\n }\n}\n\nimpl VisitWith for Call {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.function)?;\n for expr in &*self.args {\n visitor.visit_expression(expr)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.function)?;\n for expr in &mut *self.args {\n visitor.visit_expression_mut(expr)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// The `super` keyword is used to access and call functions on an object's parent.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-SuperCall\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/super\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct SuperCall {\n args: Box<[Expression]>,\n span: Span,\n}\n\nimpl SuperCall {\n /// Creates a new `SuperCall` AST node.\n pub fn new(args: A, span: Span) -> Self\n where\n A: Into>,\n {\n Self {\n args: args.into(),\n span,\n }\n }\n\n /// Retrieves the arguments of the super call.\n #[must_use]\n pub const fn arguments(&self) -> &[Expression] {\n &self.args\n }\n}\n\nimpl Spanned for SuperCall {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for SuperCall {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\"super({})\", join_nodes(interner, &self.args))\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(call: SuperCall) -> Self {\n Self::SuperCall(call)\n }\n}\n\nimpl VisitWith for SuperCall {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for expr in &*self.args {\n visitor.visit_expression(expr)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for expr in &mut *self.args {\n visitor.visit_expression_mut(expr)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// The phase of a dynamic import call.\n///\n/// Determines how the imported module is handled:\n/// - `Evaluation` (default): `import(specifier)` — loads, links, and evaluates the module.\n/// - `Defer`: `import.defer(specifier)` — deferred evaluation of the module.\n/// - `Source`: `import.source(specifier)` — source phase import.\n///\n/// More information:\n/// - [import-defer proposal][defer]\n/// - [source-phase-imports proposal][source]\n///\n/// [defer]: https://github.com/tc39/proposal-defer-import-eval\n/// [source]: https://github.com/tc39/proposal-source-phase-imports\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Default)]\npub enum ImportPhase {\n /// `import(specifier)` — standard dynamic import.\n #[default]\n Evaluation,\n /// `import.defer(specifier)` — deferred import evaluation.\n Defer,\n /// `import.source(specifier)` — source phase import.\n Source,\n}\n\n/// The `import()` syntax, commonly called dynamic import, is a function-like expression that allows\n/// loading an ECMAScript module asynchronously and dynamically into a potentially non-module\n/// environment.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ImportCall\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/import\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ImportCall {\n specifier: Box,\n options: Option>,\n phase: ImportPhase,\n span: Span,\n}\n\nimpl ImportCall {\n /// Creates a new `ImportCall` AST node.\n #[inline]\n #[must_use]\n pub fn new(specifier: S, options: Option, phase: ImportPhase, span: Span) -> Self\n where\n S: Into,\n {\n Self {\n specifier: Box::new(specifier.into()),\n options: options.map(Box::new),\n phase,\n span,\n }\n }\n\n /// Retrieves the specifier (first argument) of the import call.\n #[inline]\n #[must_use]\n pub const fn specifier(&self) -> &Expression {\n &self.specifier\n }\n\n /// Retrieves the options (second argument) of the import call, if present.\n ///\n /// This is used for import attributes:\n /// ```js\n /// import(\"foo.json\", { with: { type: \"json\" } })\n /// ```\n #[inline]\n #[must_use]\n pub fn options(&self) -> Option<&Expression> {\n self.options.as_deref()\n }\n\n /// Returns the phase of this import call.\n #[inline]\n #[must_use]\n pub const fn phase(&self) -> ImportPhase {\n self.phase\n }\n\n /// Gets the module specifier of the import call.\n ///\n /// This is an alias for [`Self::specifier`] for backwards compatibility.\n #[inline]\n #[must_use]\n #[deprecated(since = \"0.21.0\", note = \"use `specifier` instead\")]\n pub const fn argument(&self) -> &Expression {\n &self.specifier\n }\n}\n\nimpl Spanned for ImportCall {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for ImportCall {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n let phase_str = match self.phase {\n ImportPhase::Evaluation => \"\",\n ImportPhase::Defer => \".defer\",\n ImportPhase::Source => \".source\",\n };\n if let Some(options) = &self.options {\n format!(\n \"import{}({}, {})\",\n phase_str,\n self.specifier.to_interned_string(interner),\n options.to_interned_string(interner)\n )\n } else {\n format!(\n \"import{}({})\",\n phase_str,\n self.specifier.to_interned_string(interner)\n )\n }\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(call: ImportCall) -> Self {\n Self::ImportCall(call)\n }\n}\n\nimpl VisitWith for ImportCall {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.specifier)?;\n if let Some(options) = &self.options {\n visitor.visit_expression(options)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.specifier)?;\n if let Some(options) = &mut self.options {\n visitor.visit_expression_mut(options)?;\n }\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/expression/identifier.rs", "content": "//! Local identifier Expression.\n\nuse crate::{\n Span, Spanned, ToStringEscaped,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, Sym, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse super::Expression;\n\n/// List of reserved keywords exclusive to strict mode.\npub const RESERVED_IDENTIFIERS_STRICT: [Sym; 9] = [\n Sym::IMPLEMENTS,\n Sym::INTERFACE,\n Sym::LET,\n Sym::PACKAGE,\n Sym::PRIVATE,\n Sym::PROTECTED,\n Sym::PUBLIC,\n Sym::STATIC,\n Sym::YIELD,\n];\n\n/// An `identifier` is a sequence of characters in the code that identifies a variable,\n/// function, or property.\n///\n/// In ECMAScript, identifiers are case-sensitive and can contain Unicode letters, $, _, and\n/// digits (0-9), but may not start with a digit.\n///\n/// An identifier differs from a string in that a string is data, while an identifier is part\n/// of the code. In JavaScript, there is no way to convert identifiers to strings, but\n/// sometimes it is possible to parse strings into identifiers.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-Identifier\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Glossary/Identifier\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\npub struct Identifier {\n ident: Sym,\n span: Span,\n}\n\nimpl PartialEq for Identifier {\n #[inline]\n fn eq(&self, other: &Sym) -> bool {\n self.ident == *other\n }\n}\n\nimpl PartialEq for Sym {\n #[inline]\n fn eq(&self, other: &Identifier) -> bool {\n *self == other.ident\n }\n}\n\nimpl Identifier {\n /// Creates a new identifier AST Expression.\n #[inline]\n #[must_use]\n pub const fn new(ident: Sym, span: Span) -> Self {\n Self { ident, span }\n }\n\n /// Retrieves the identifier's string symbol in the interner.\n #[inline]\n #[must_use]\n pub const fn sym(self) -> Sym {\n self.ident\n }\n\n /// Retrieves the identifier's string symbol in the interner.\n #[inline]\n #[must_use]\n pub const fn sym_ref(&self) -> &Sym {\n &self.ident\n }\n\n /// Retrieves the identifier's string symbol in the interner.\n #[inline]\n #[must_use]\n pub const fn sym_mut(&mut self) -> &mut Sym {\n &mut self.ident\n }\n}\n\nimpl Spanned for Identifier {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for Identifier {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n interner.resolve_expect(self.ident).join(\n String::from,\n ToStringEscaped::to_string_escaped,\n true,\n )\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(local: Identifier) -> Self {\n Self::Identifier(local)\n }\n}\n\nimpl VisitWith for Identifier {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_sym(&self.ident)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_sym_mut(&mut self.ident)\n }\n}\n" }, { "path": "core/ast/src/expression/import_meta.rs", "content": "//! `import.meta` ECMAScript expression.\n\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse super::Expression;\n\n/// ECMAScript's `ImportMeta` expression AST node.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\npub struct ImportMeta {\n span: Span,\n}\n\nimpl ImportMeta {\n /// Creates a new [`ImportMeta`] AST Expression.\n #[inline]\n #[must_use]\n pub const fn new(span: Span) -> Self {\n Self { span }\n }\n}\n\nimpl Spanned for ImportMeta {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(value: ImportMeta) -> Self {\n Expression::ImportMeta(value)\n }\n}\n\nimpl ToInternedString for ImportMeta {\n #[inline]\n fn to_interned_string(&self, _interner: &Interner) -> String {\n String::from(\"import.meta\")\n }\n}\n\nimpl VisitWith for ImportMeta {\n fn visit_with<'a, V>(&'a self, _visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, _visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/expression/literal/array.rs", "content": "//! Array declaration Expression.\n\nuse crate::expression::Expression;\nuse crate::expression::operator::assign::{AssignOp, AssignTarget};\nuse crate::pattern::{ArrayPattern, ArrayPatternElement, Pattern};\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{Span, Spanned};\nuse boa_interner::{Interner, Sym, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// An array is an ordered collection of data (either primitive or object depending upon the\n/// language).\n///\n/// Arrays are used to store multiple values in a single variable.\n/// This is compared to a variable that can store only one value.\n///\n/// Each item in an array has a number attached to it, called a numeric index, that allows you\n/// to access it. In JavaScript, arrays start at index zero and can be manipulated with various\n/// methods.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ArrayLiteral\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ArrayLiteral {\n arr: Box<[Option]>,\n has_trailing_comma_spread: bool,\n span: Span,\n}\n\nimpl ArrayLiteral {\n /// Creates a new array literal.\n pub fn new(array: A, has_trailing_comma_spread: bool, span: Span) -> Self\n where\n A: Into]>>,\n {\n Self {\n arr: array.into(),\n has_trailing_comma_spread,\n span,\n }\n }\n\n /// Indicates if a spread operator in the array literal has a trailing comma.\n /// This is a syntax error in some cases.\n #[must_use]\n pub const fn has_trailing_comma_spread(&self) -> bool {\n self.has_trailing_comma_spread\n }\n\n /// Converts this `ArrayLiteral` into an [`ArrayPattern`].\n #[must_use]\n pub fn to_pattern(&self, strict: bool) -> Option {\n if self.has_trailing_comma_spread() {\n return None;\n }\n\n let mut bindings = Vec::new();\n for (i, expr) in self.arr.iter().enumerate() {\n let Some(expr) = expr else {\n bindings.push(ArrayPatternElement::Elision);\n continue;\n };\n match expr {\n Expression::Identifier(ident) => {\n if strict && *ident == Sym::ARGUMENTS {\n return None;\n }\n\n bindings.push(ArrayPatternElement::SingleName {\n ident: *ident,\n default_init: None,\n });\n }\n Expression::Spread(spread) => {\n match spread.target() {\n Expression::Identifier(ident) => {\n bindings.push(ArrayPatternElement::SingleNameRest { ident: *ident });\n }\n Expression::PropertyAccess(access) => {\n bindings.push(ArrayPatternElement::PropertyAccessRest {\n access: access.clone(),\n });\n }\n Expression::ArrayLiteral(array) => {\n let pattern = array.to_pattern(strict)?.into();\n bindings.push(ArrayPatternElement::PatternRest { pattern });\n }\n Expression::ObjectLiteral(object) => {\n let pattern = object.to_pattern(strict)?.into();\n bindings.push(ArrayPatternElement::PatternRest { pattern });\n }\n _ => return None,\n }\n if i + 1 != self.arr.len() {\n return None;\n }\n }\n Expression::Assign(assign) => {\n if assign.op() != AssignOp::Assign {\n return None;\n }\n match assign.lhs() {\n AssignTarget::Identifier(ident) => {\n let mut init = assign.rhs().clone();\n init.set_anonymous_function_definition_name(ident);\n bindings.push(ArrayPatternElement::SingleName {\n ident: *ident,\n default_init: Some(init),\n });\n }\n AssignTarget::Access(access) => {\n bindings.push(ArrayPatternElement::PropertyAccess {\n access: access.clone(),\n default_init: Some(assign.rhs().clone()),\n });\n }\n AssignTarget::Pattern(pattern) => match pattern {\n Pattern::Object(pattern) => {\n bindings.push(ArrayPatternElement::Pattern {\n pattern: Pattern::Object(pattern.clone()),\n default_init: Some(assign.rhs().clone()),\n });\n }\n Pattern::Array(pattern) => {\n bindings.push(ArrayPatternElement::Pattern {\n pattern: Pattern::Array(pattern.clone()),\n default_init: Some(assign.rhs().clone()),\n });\n }\n },\n }\n }\n Expression::ArrayLiteral(array) => {\n let pattern = array.to_pattern(strict)?.into();\n bindings.push(ArrayPatternElement::Pattern {\n pattern,\n default_init: None,\n });\n }\n Expression::ObjectLiteral(object) => {\n let pattern = object.to_pattern(strict)?.into();\n bindings.push(ArrayPatternElement::Pattern {\n pattern,\n default_init: None,\n });\n }\n Expression::PropertyAccess(access) => {\n bindings.push(ArrayPatternElement::PropertyAccess {\n access: access.clone(),\n default_init: None,\n });\n }\n _ => return None,\n }\n }\n Some(ArrayPattern::new(bindings.into(), self.span))\n }\n}\n\nimpl Spanned for ArrayLiteral {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl AsRef<[Option]> for ArrayLiteral {\n #[inline]\n fn as_ref(&self) -> &[Option] {\n &self.arr\n }\n}\n\nimpl AsMut<[Option]> for ArrayLiteral {\n #[inline]\n fn as_mut(&mut self) -> &mut [Option] {\n &mut self.arr\n }\n}\n\nimpl ToInternedString for ArrayLiteral {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = String::from(\"[\");\n let mut elements = self.arr.iter().peekable();\n\n while let Some(element) = elements.next() {\n if let Some(e) = element {\n buf.push_str(&e.to_interned_string(interner));\n if elements.peek().is_some() {\n buf.push_str(\", \");\n }\n } else if elements.peek().is_some() {\n buf.push_str(\", \");\n } else {\n buf.push(',');\n }\n }\n buf.push(']');\n buf\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(arr: ArrayLiteral) -> Self {\n Self::ArrayLiteral(arr)\n }\n}\n\nimpl VisitWith for ArrayLiteral {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for expr in self.arr.iter().flatten() {\n visitor.visit_expression(expr)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for expr in self.arr.iter_mut().flatten() {\n visitor.visit_expression_mut(expr)?;\n }\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/expression/literal/mod.rs", "content": "//! This module contains all literal expressions, which represents the primitive values in ECMAScript.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-primary-expression-literals\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#Literals\n\nmod array;\nmod object;\nmod template;\n\npub use array::ArrayLiteral;\nuse core::ops::ControlFlow;\npub use object::{ObjectLiteral, ObjectMethodDefinition, PropertyDefinition};\npub use template::{TemplateElement, TemplateLiteral};\n\nuse crate::{\n LinearSpan, LinearSpanIgnoreEq, Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, Sym, ToInternedString};\nuse num_bigint::BigInt;\n\nuse super::Expression;\n\n/// Literals represent values in ECMAScript.\n///\n/// These are fixed values **not variables** that you literally provide in your script.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-primary-expression-literals\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#Literals\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, PartialEq)]\npub struct Literal {\n kind: LiteralKind,\n span: Span,\n linear_span: LinearSpanIgnoreEq,\n}\n\nimpl Literal {\n /// Create a new [`Literal`].\n #[inline]\n #[must_use]\n pub fn new>(kind: T, span: Span) -> Self {\n Self {\n kind: kind.into(),\n span,\n linear_span: LinearSpanIgnoreEq(LinearSpan::default()),\n }\n }\n\n /// Create a new [`Literal`] with a [`LinearSpan`] for source text tracking.\n #[inline]\n #[must_use]\n pub fn with_linear_span>(\n kind: T,\n span: Span,\n linear_span: LinearSpan,\n ) -> Self {\n Self {\n kind: kind.into(),\n span,\n linear_span: LinearSpanIgnoreEq(linear_span),\n }\n }\n\n /// Get reference to the [`LiteralKind`] of [`Literal`].\n #[inline]\n #[must_use]\n pub const fn kind(&self) -> &LiteralKind {\n &self.kind\n }\n\n /// Get mutable reference to the [`LiteralKind`] of [`Literal`].\n #[inline]\n #[must_use]\n pub const fn kind_mut(&mut self) -> &mut LiteralKind {\n &mut self.kind\n }\n\n /// Get the [`LinearSpan`] of this literal in the source text.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Get position of the node.\n #[inline]\n #[must_use]\n pub const fn as_string(&self) -> Option {\n if let LiteralKind::String(sym) = self.kind() {\n return Some(*sym);\n }\n None\n }\n\n /// Check if [`Literal`] is a [`LiteralKind::Undefined`].\n #[inline]\n #[must_use]\n pub const fn is_undefined(&self) -> bool {\n matches!(self.kind(), LiteralKind::Undefined)\n }\n}\n\nimpl Spanned for Literal {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(lit: Literal) -> Self {\n Self::Literal(lit)\n }\n}\n\nimpl ToInternedString for Literal {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n self.kind().to_interned_string(interner)\n }\n}\n\nimpl VisitWith for Literal {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let LiteralKind::String(sym) = &self.kind {\n visitor.visit_sym(sym)\n } else {\n ControlFlow::Continue(())\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let LiteralKind::String(sym) = &mut self.kind {\n visitor.visit_sym_mut(sym)\n } else {\n ControlFlow::Continue(())\n }\n }\n}\n\n/// Literals represent values in ECMAScript.\n///\n/// These are fixed values **not variables** that you literally provide in your script.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-primary-expression-literals\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#Literals\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, PartialEq)]\npub enum LiteralKind {\n /// A string literal is zero or more characters enclosed in double (`\"`) or single (`'`) quotation marks.\n ///\n /// A string must be delimited by quotation marks of the same type (that is, either both single quotation marks, or both double quotation marks).\n /// You can call any of the String object's methods on a string literal value.\n /// ECMAScript automatically converts the string literal to a temporary String object,\n /// calls the method, then discards the temporary String object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-terms-and-definitions-string-value\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#String_literals\n String(Sym),\n\n /// A floating-point number literal.\n ///\n /// The exponent part is an \"`e`\" or \"`E`\" followed by an integer, which can be signed (preceded by \"`+`\" or \"`-`\").\n /// A floating-point literal must have at least one digit, and either a decimal point or \"`e`\" (or \"`E`\").\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-terms-and-definitions-number-value\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#Floating-point_literals\n Num(f64),\n\n /// Integer types can be expressed in decimal (base 10), hexadecimal (base 16), octal (base 8) and binary (base 2).\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-terms-and-definitions-number-value\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#Numeric_literals\n Int(i32),\n\n /// `BigInt` provides a way to represent whole numbers larger than the largest number ECMAScript\n /// can reliably represent with the `Number` primitive.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-terms-and-definitions-bigint-value\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#Numeric_literals\n BigInt(Box),\n\n /// The Boolean type has two literal values: `true` and `false`.\n ///\n /// The Boolean object is a wrapper around the primitive Boolean data type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-terms-and-definitions-boolean-value\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#Boolean_literals\n Bool(bool),\n\n /// In JavaScript, `null` is marked as one of the primitive values, cause it's behaviour is seemingly primitive.\n ///\n /// In computer science, a null value represents a reference that points,\n /// generally intentionally, to a nonexistent or invalid object or address.\n /// The meaning of a null reference varies among language implementations.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-null-value\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Glossary/null\n Null,\n\n /// This represents the JavaScript `undefined` value, it does not reference the `undefined` global variable,\n /// it will directly evaluate to `undefined`.\n ///\n /// NOTE: This is used for optimizations.\n Undefined,\n}\n\n/// Manual implementation, because `Undefined` is never constructed during parsing.\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for LiteralKind {\n fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n let c = >::arbitrary(u)? % 6;\n match c {\n 0 => Ok(Self::String(::arbitrary(u)?)),\n 1 => Ok(Self::Num(::arbitrary(u)?)),\n 2 => Ok(Self::Int(::arbitrary(u)?)),\n 3 => Ok(Self::BigInt(Box::new(\n ::arbitrary(u)?,\n ))),\n 4 => Ok(Self::Bool(::arbitrary(u)?)),\n 5 => Ok(Self::Null),\n _ => unreachable!(),\n }\n }\n}\n\nimpl From for LiteralKind {\n #[inline]\n fn from(string: Sym) -> Self {\n Self::String(string)\n }\n}\n\nimpl From for LiteralKind {\n #[inline]\n fn from(num: f64) -> Self {\n Self::Num(num)\n }\n}\n\nimpl From for LiteralKind {\n #[inline]\n fn from(i: i32) -> Self {\n Self::Int(i)\n }\n}\n\nimpl From for LiteralKind {\n #[inline]\n fn from(i: BigInt) -> Self {\n Self::BigInt(Box::new(i))\n }\n}\n\nimpl From> for LiteralKind {\n #[inline]\n fn from(i: Box) -> Self {\n Self::BigInt(i)\n }\n}\n\nimpl From for LiteralKind {\n #[inline]\n fn from(b: bool) -> Self {\n Self::Bool(b)\n }\n}\n\nimpl ToInternedString for LiteralKind {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n match *self {\n Self::String(st) => {\n format!(\"\\\"{}\\\"\", interner.resolve_expect(st))\n }\n Self::Num(num) => num.to_string(),\n Self::Int(num) => num.to_string(),\n Self::BigInt(ref num) => format!(\"{num}n\"),\n Self::Bool(v) => v.to_string(),\n Self::Null => \"null\".to_owned(),\n Self::Undefined => \"undefined\".to_owned(),\n }\n }\n}\n" }, { "path": "core/ast/src/expression/literal/object.rs", "content": "//! Object Expression.\n\nuse crate::{\n LinearPosition, LinearSpan, LinearSpanIgnoreEq, Span, Spanned, block_to_string,\n expression::{\n Expression, Identifier, RESERVED_IDENTIFIERS_STRICT,\n operator::assign::{AssignOp, AssignTarget},\n },\n function::{FormalParameterList, FunctionBody},\n join_nodes,\n operations::{ContainsSymbol, contains},\n pattern::{ObjectPattern, ObjectPatternElement},\n property::{MethodDefinitionKind, PropertyName},\n scope::FunctionScopes,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, Sym, ToIndentedString, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// Objects in ECMAScript may be defined as an unordered collection of related data, of\n/// primitive or reference types, in the form of “key: value” pairs.\n///\n/// Objects can be initialized using `new Object()`, `Object.create()`, or using the literal\n/// notation.\n///\n/// An object initializer is an expression that describes the initialization of an\n/// [`Object`][object]. Objects consist of properties, which are used to describe an object.\n/// Values of object properties can either contain [`primitive`][primitive] data types or other\n/// objects.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ObjectLiteral\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Object_initializer\n/// [object]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object\n/// [primitive]: https://developer.mozilla.org/en-US/docs/Glossary/primitive\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ObjectLiteral {\n properties: Box<[PropertyDefinition]>,\n span: Span,\n}\n\nimpl ObjectLiteral {\n /// Create a new [`ObjectLiteral`].\n #[inline]\n #[must_use]\n pub fn new(properties: T, span: Span) -> Self\n where\n T: Into>,\n {\n Self {\n properties: properties.into(),\n span,\n }\n }\n\n /// Gets the object literal properties\n #[inline]\n #[must_use]\n pub const fn properties(&self) -> &[PropertyDefinition] {\n &self.properties\n }\n\n /// Converts the object literal into an [`ObjectPattern`].\n #[must_use]\n pub fn to_pattern(&self, strict: bool) -> Option {\n let mut bindings = Vec::new();\n for (i, property) in self.properties.iter().enumerate() {\n match property {\n PropertyDefinition::IdentifierReference(ident) if strict && *ident == Sym::EVAL => {\n return None;\n }\n PropertyDefinition::IdentifierReference(ident) => {\n if strict && RESERVED_IDENTIFIERS_STRICT.contains(&ident.sym()) {\n return None;\n }\n\n bindings.push(ObjectPatternElement::SingleName {\n ident: *ident,\n name: PropertyName::Literal(*ident),\n default_init: None,\n });\n }\n PropertyDefinition::Property(name, expr) => match (name, expr) {\n (PropertyName::Literal(name), Expression::Identifier(ident))\n if name.sym() == ident.sym() =>\n {\n if strict && *name == Sym::EVAL {\n return None;\n }\n if strict && RESERVED_IDENTIFIERS_STRICT.contains(&name.sym()) {\n return None;\n }\n\n bindings.push(ObjectPatternElement::SingleName {\n ident: *ident,\n name: PropertyName::Literal(*name),\n default_init: None,\n });\n }\n (PropertyName::Literal(name), Expression::Identifier(ident)) => {\n bindings.push(ObjectPatternElement::SingleName {\n ident: *ident,\n name: PropertyName::Literal(*name),\n default_init: None,\n });\n }\n (PropertyName::Literal(name), Expression::ObjectLiteral(object)) => {\n let pattern = object.to_pattern(strict)?.into();\n bindings.push(ObjectPatternElement::Pattern {\n name: PropertyName::Literal(*name),\n pattern,\n default_init: None,\n });\n }\n (PropertyName::Literal(name), Expression::ArrayLiteral(array)) => {\n let pattern = array.to_pattern(strict)?.into();\n bindings.push(ObjectPatternElement::Pattern {\n name: PropertyName::Literal(*name),\n pattern,\n default_init: None,\n });\n }\n (_, Expression::Assign(assign)) => {\n if assign.op() != AssignOp::Assign {\n return None;\n }\n match assign.lhs() {\n AssignTarget::Identifier(ident) => {\n if let Some(name) = name.literal() {\n if name.sym() == ident.sym() {\n if strict && name == Sym::EVAL {\n return None;\n }\n if strict\n && RESERVED_IDENTIFIERS_STRICT.contains(&name.sym())\n {\n return None;\n }\n }\n let mut init = assign.rhs().clone();\n init.set_anonymous_function_definition_name(ident);\n bindings.push(ObjectPatternElement::SingleName {\n ident: *ident,\n name: PropertyName::Literal(name),\n default_init: Some(init),\n });\n } else {\n return None;\n }\n }\n AssignTarget::Pattern(pattern) => {\n bindings.push(ObjectPatternElement::Pattern {\n name: name.clone(),\n pattern: pattern.clone(),\n default_init: Some(assign.rhs().clone()),\n });\n }\n AssignTarget::Access(access) => {\n bindings.push(ObjectPatternElement::AssignmentPropertyAccess {\n name: name.clone(),\n access: access.clone(),\n default_init: Some(assign.rhs().clone()),\n });\n }\n }\n }\n (_, Expression::PropertyAccess(access)) => {\n bindings.push(ObjectPatternElement::AssignmentPropertyAccess {\n name: name.clone(),\n access: access.clone(),\n default_init: None,\n });\n }\n (PropertyName::Computed(name), Expression::Identifier(ident)) => {\n bindings.push(ObjectPatternElement::SingleName {\n ident: *ident,\n name: PropertyName::Computed(name.clone()),\n default_init: None,\n });\n }\n _ => return None,\n },\n PropertyDefinition::SpreadObject(spread) => {\n match spread {\n Expression::Identifier(ident) => {\n bindings.push(ObjectPatternElement::RestProperty { ident: *ident });\n }\n Expression::PropertyAccess(access) => {\n bindings.push(ObjectPatternElement::AssignmentRestPropertyAccess {\n access: access.clone(),\n });\n }\n _ => return None,\n }\n if i + 1 != self.properties.len() {\n return None;\n }\n }\n PropertyDefinition::MethodDefinition(_) => return None,\n PropertyDefinition::CoverInitializedName(ident, expr) => {\n if strict && [Sym::EVAL, Sym::ARGUMENTS].contains(&ident.sym()) {\n return None;\n }\n let mut expr = expr.clone();\n expr.set_anonymous_function_definition_name(ident);\n bindings.push(ObjectPatternElement::SingleName {\n ident: *ident,\n name: PropertyName::Literal(*ident),\n default_init: Some(expr),\n });\n }\n }\n }\n\n Some(ObjectPattern::new(bindings.into(), self.span))\n }\n}\n\nimpl Spanned for ObjectLiteral {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToIndentedString for ObjectLiteral {\n fn to_indented_string(&self, interner: &Interner, indent_n: usize) -> String {\n let mut buf = \"{\\n\".to_owned();\n let indentation = \" \".repeat(indent_n + 1);\n for property in &*self.properties {\n match property {\n PropertyDefinition::IdentifierReference(ident) => {\n let _ = writeln!(\n buf,\n \"{indentation}{},\",\n interner.resolve_expect(ident.sym())\n );\n }\n PropertyDefinition::Property(key, value) => {\n let _ = writeln!(\n buf,\n \"{indentation}{}: {},\",\n key.to_interned_string(interner),\n value.to_no_indent_string(interner, indent_n + 1)\n );\n }\n PropertyDefinition::SpreadObject(key) => {\n let _ = writeln!(buf, \"{indentation}...{},\", key.to_interned_string(interner));\n }\n PropertyDefinition::MethodDefinition(m) => {\n buf.push_str(&m.to_indented_string(interner, indent_n));\n }\n PropertyDefinition::CoverInitializedName(ident, expr) => {\n let _ = writeln!(\n buf,\n \"{indentation}{} = {},\",\n interner.resolve_expect(ident.sym()),\n expr.to_no_indent_string(interner, indent_n + 1)\n );\n }\n }\n }\n let _ = write!(buf, \"{}}}\", \" \".repeat(indent_n));\n\n buf\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(obj: ObjectLiteral) -> Self {\n Self::ObjectLiteral(obj)\n }\n}\n\nimpl VisitWith for ObjectLiteral {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for pd in &*self.properties {\n visitor.visit_property_definition(pd)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for pd in &mut *self.properties {\n visitor.visit_property_definition_mut(pd)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// Describes the definition of a property within an object literal.\n///\n/// A property has a name (a string) and a value (primitive, method, or object reference).\n/// Note that when we say that \"a property holds an object\", that is shorthand for \"a property holds an object reference\".\n/// This distinction matters because the original referenced object remains unchanged when you change the property's value.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-PropertyDefinition\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Glossary/property/JavaScript\n// TODO: Support all features: https://tc39.es/ecma262/#prod-PropertyDefinition\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum PropertyDefinition {\n /// Puts a variable into an object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-IdentifierReference\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Object_initializer#Property_definitions\n IdentifierReference(Identifier),\n\n /// Binds a property name to a JavaScript value.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-PropertyDefinition\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Object_initializer#Property_definitions\n Property(PropertyName, Expression),\n\n /// A property of an object can also refer to a function or a getter or setter method.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-MethodDefinition\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Object_initializer#Method_definitions\n MethodDefinition(ObjectMethodDefinition),\n\n /// The Rest/Spread Properties for ECMAScript proposal (stage 4) adds spread properties to object literals.\n /// It copies own enumerable properties from a provided object onto a new object.\n ///\n /// Shallow-cloning (excluding `prototype`) or merging objects is now possible using a shorter syntax than `Object.assign()`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-PropertyDefinition\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Object_initializer#Spread_properties\n SpreadObject(Expression),\n\n /// Cover grammar for when an object literal is used as an object binding pattern.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-CoverInitializedName\n CoverInitializedName(Identifier, Expression),\n}\n\nimpl VisitWith for PropertyDefinition {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::IdentifierReference(id) => visitor.visit_identifier(id),\n Self::Property(pn, expr) => {\n visitor.visit_property_name(pn)?;\n visitor.visit_expression(expr)\n }\n Self::MethodDefinition(m) => visitor.visit_object_method_definition(m),\n Self::SpreadObject(expr) => visitor.visit_expression(expr),\n Self::CoverInitializedName(id, expr) => {\n visitor.visit_identifier(id)?;\n visitor.visit_expression(expr)\n }\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::IdentifierReference(id) => visitor.visit_identifier_mut(id),\n Self::Property(pn, expr) => {\n visitor.visit_property_name_mut(pn)?;\n visitor.visit_expression_mut(expr)\n }\n Self::MethodDefinition(m) => visitor.visit_object_method_definition_mut(m),\n Self::SpreadObject(expr) => visitor.visit_expression_mut(expr),\n Self::CoverInitializedName(id, expr) => {\n visitor.visit_identifier_mut(id)?;\n visitor.visit_expression_mut(expr)\n }\n }\n }\n}\n\n/// A method definition.\n///\n/// This type is specific to object method definitions.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-MethodDefinition\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ObjectMethodDefinition {\n pub(crate) name: PropertyName,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) contains_direct_eval: bool,\n kind: MethodDefinitionKind,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n}\n\nimpl ObjectMethodDefinition {\n /// Creates a new object method definition.\n #[inline]\n #[must_use]\n pub fn new(\n name: PropertyName,\n parameters: FormalParameterList,\n body: FunctionBody,\n kind: MethodDefinitionKind,\n start_linear_pos: LinearPosition,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n let linear_span = LinearSpan::new(start_linear_pos, body.linear_pos_end()).into();\n\n Self {\n name,\n parameters,\n body,\n contains_direct_eval,\n kind,\n scopes: FunctionScopes::default(),\n linear_span,\n }\n }\n\n /// Returns the name of the object method definition.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> &PropertyName {\n &self.name\n }\n\n /// Returns the parameters of the object method definition.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Returns the body of the object method definition.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns the kind of the object method definition.\n #[inline]\n #[must_use]\n pub const fn kind(&self) -> MethodDefinitionKind {\n self.kind\n }\n\n /// Gets the scopes of the object method definition.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the object method definition contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl ToIndentedString for ObjectMethodDefinition {\n fn to_indented_string(&self, interner: &Interner, indent_n: usize) -> String {\n let indentation = \" \".repeat(indent_n + 1);\n let prefix = match &self.kind {\n MethodDefinitionKind::Get => \"get \",\n MethodDefinitionKind::Set => \"set \",\n MethodDefinitionKind::Ordinary => \"\",\n MethodDefinitionKind::Generator => \"*\",\n MethodDefinitionKind::AsyncGenerator => \"async *\",\n MethodDefinitionKind::Async => \"async \",\n };\n let name = self.name.to_interned_string(interner);\n let parameters = join_nodes(interner, self.parameters.as_ref());\n let body = block_to_string(&self.body.statements, interner, indent_n + 1);\n format!(\"{indentation}{prefix}{name}({parameters}) {body},\\n\")\n }\n}\n\nimpl VisitWith for ObjectMethodDefinition {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_property_name(&self.name)?;\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_property_name_mut(&mut self.name)?;\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/expression/literal/template.rs", "content": "//! Template literal Expression.\n\nuse crate::{\n Span, Spanned,\n expression::Expression,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, Sym, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// Template literals are string literals allowing embedded expressions.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Template_literals\n/// [spec]: https://tc39.es/ecma262/#sec-template-literals\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, PartialEq)]\npub struct TemplateLiteral {\n elements: Box<[TemplateElement]>,\n span: Span,\n}\n\n/// Manual implementation, because string and expression in the element list must always appear in order.\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for TemplateLiteral {\n fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n let len = u.arbitrary_len::>()?;\n\n let mut elements = Vec::with_capacity(len);\n for i in 0..len {\n if i & 1 == 0 {\n elements.push(TemplateElement::String(\n ::arbitrary(u)?,\n ));\n } else {\n elements.push(TemplateElement::Expr(Expression::arbitrary(u)?));\n }\n }\n\n Ok(Self::new(elements.into_boxed_slice(), Span::arbitrary(u)?))\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(tem: TemplateLiteral) -> Self {\n Self::TemplateLiteral(tem)\n }\n}\n\nimpl TemplateLiteral {\n /// Creates a new `TemplateLiteral` from a list of [`TemplateElement`]s.\n #[inline]\n #[must_use]\n pub fn new(elements: Box<[TemplateElement]>, span: Span) -> Self {\n Self { elements, span }\n }\n\n /// Gets the element list of this `TemplateLiteral`.\n #[must_use]\n pub const fn elements(&self) -> &[TemplateElement] {\n &self.elements\n }\n}\n\nimpl Spanned for TemplateLiteral {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for TemplateLiteral {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = \"`\".to_owned();\n\n for elt in &self.elements {\n match elt {\n TemplateElement::String(s) => {\n let _ = write!(buf, \"{}\", interner.resolve_expect(*s));\n }\n TemplateElement::Expr(n) => {\n let _ = write!(buf, \"${{{}}}\", n.to_interned_string(interner));\n }\n }\n }\n buf.push('`');\n\n buf\n }\n}\n\nimpl VisitWith for TemplateLiteral {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for element in &*self.elements {\n visitor.visit_template_element(element)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for element in &mut *self.elements {\n visitor.visit_template_element_mut(element)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// An element found within a [`TemplateLiteral`].\n///\n/// The [spec] doesn't define an element akin to `TemplateElement`. However, the AST defines this\n/// node as the equivalent of the components found in a template literal.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-template-literals\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum TemplateElement {\n /// A simple string.\n String(Sym),\n /// An expression that is evaluated and replaced by its string representation.\n Expr(Expression),\n}\n\nimpl VisitWith for TemplateElement {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::String(sym) => visitor.visit_sym(sym),\n Self::Expr(expr) => visitor.visit_expression(expr),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::String(sym) => visitor.visit_sym_mut(sym),\n Self::Expr(expr) => visitor.visit_expression_mut(expr),\n }\n }\n}\n" }, { "path": "core/ast/src/expression/mod.rs", "content": "//! The [`Expression`] Parse Node, as defined by the [spec].\n//!\n//! ECMAScript expressions include:\n//! - [Primary][primary] expressions (`this`, function expressions, literals).\n//! - [Left hand side][lhs] expressions (accessors, `new` operator, `super`).\n//! - [operator] expressions.\n//!\n//! [spec]: https://tc39.es/ecma262/#prod-Expression\n//! [primary]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#primary_expressions\n//! [lhs]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#left-hand-side_expressions\n\nuse self::{\n access::PropertyAccess,\n literal::{ArrayLiteral, ObjectLiteral, TemplateLiteral},\n operator::{Assign, Binary, BinaryInPrivate, Conditional, Unary, Update},\n};\nuse super::{\n Spanned, Statement,\n function::AsyncArrowFunction,\n function::{\n ArrowFunction, AsyncFunctionExpression, AsyncGeneratorExpression, ClassExpression,\n FunctionExpression, GeneratorExpression,\n },\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::ops::ControlFlow;\nuse literal::Literal;\n\nmod r#await;\nmod call;\nmod identifier;\nmod import_meta;\nmod new;\nmod new_target;\nmod optional;\nmod parenthesized;\nmod regexp;\nmod spread;\nmod tagged_template;\nmod this;\nmod r#yield;\n\nuse crate::{\n Span,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\npub use r#await::Await;\npub use call::{Call, ImportCall, ImportPhase, SuperCall};\npub use identifier::{Identifier, RESERVED_IDENTIFIERS_STRICT};\npub use import_meta::ImportMeta;\npub use new::New;\npub use new_target::NewTarget;\npub use optional::{Optional, OptionalOperation, OptionalOperationKind};\npub use parenthesized::Parenthesized;\npub use regexp::RegExpLiteral;\npub use spread::Spread;\npub use tagged_template::TaggedTemplate;\npub use this::This;\npub use r#yield::Yield;\n\npub mod access;\npub mod literal;\npub mod operator;\n\n/// The `Expression` Parse Node.\n///\n/// See the [module level documentation][self] for more information.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, PartialEq)]\npub enum Expression {\n /// The ECMAScript `this` keyword refers to the object it belongs to.\n ///\n /// A property of an execution context (global, function or eval) that,\n /// in non–strict mode, is always a reference to an object and in strict\n /// mode can be any value.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-this-keyword\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/this\n This(This),\n\n /// See [`Identifier`].\n Identifier(Identifier),\n\n /// See [`Literal`].\n Literal(Literal),\n\n /// See [`RegExpLiteral`].\n RegExpLiteral(RegExpLiteral),\n\n /// See [`ArrayLiteral`].\n ArrayLiteral(ArrayLiteral),\n\n /// See [`ObjectLiteral`].\n ObjectLiteral(ObjectLiteral),\n\n /// See [`Spread`],\n Spread(Spread),\n\n /// See [`FunctionExpression`].\n FunctionExpression(FunctionExpression),\n\n /// See [`ArrowFunction`].\n ArrowFunction(ArrowFunction),\n\n /// See [`AsyncArrowFunction`].\n AsyncArrowFunction(AsyncArrowFunction),\n\n /// See [`GeneratorExpression`].\n GeneratorExpression(GeneratorExpression),\n\n /// See [`AsyncFunctionExpression`].\n AsyncFunctionExpression(AsyncFunctionExpression),\n\n /// See [`AsyncGeneratorExpression`].\n AsyncGeneratorExpression(AsyncGeneratorExpression),\n\n /// See [`ClassExpression`].\n ClassExpression(Box),\n\n /// See [`TemplateLiteral`].\n TemplateLiteral(TemplateLiteral),\n\n /// See [`PropertyAccess`].\n PropertyAccess(PropertyAccess),\n\n /// See [`New`].\n New(New),\n\n /// See [`Call`].\n Call(Call),\n\n /// See [`SuperCall`].\n SuperCall(SuperCall),\n\n /// See [`ImportCall`].\n ImportCall(ImportCall),\n\n /// See [`Optional`].\n Optional(Optional),\n\n /// See [`TaggedTemplate`].\n TaggedTemplate(TaggedTemplate),\n\n /// The `new.target` pseudo-property expression.\n NewTarget(NewTarget),\n\n /// The `import.meta` pseudo-property expression.\n ImportMeta(ImportMeta),\n\n /// See [`Assign`].\n Assign(Assign),\n\n /// See [`Unary`].\n Unary(Unary),\n\n /// See [`Unary`].\n Update(Update),\n\n /// See [`Binary`].\n Binary(Binary),\n\n /// See [`BinaryInPrivate`].\n BinaryInPrivate(BinaryInPrivate),\n\n /// See [`Conditional`].\n Conditional(Conditional),\n\n /// See [`Await`].\n Await(Await),\n\n /// See [`Yield`].\n Yield(Yield),\n\n /// See [`Parenthesized`].\n Parenthesized(Parenthesized),\n}\n\nimpl Expression {\n /// Implements the display formatting with indentation.\n ///\n /// This will not prefix the value with any indentation. If you want to prefix this with proper\n /// indents, use [`to_indented_string()`](Self::to_indented_string).\n pub(crate) fn to_no_indent_string(&self, interner: &Interner, indentation: usize) -> String {\n match self {\n Self::This(this) => this.to_interned_string(interner),\n Self::Identifier(id) => id.to_interned_string(interner),\n Self::Literal(lit) => lit.to_interned_string(interner),\n Self::ArrayLiteral(arr) => arr.to_interned_string(interner),\n Self::ObjectLiteral(o) => o.to_indented_string(interner, indentation),\n Self::Spread(sp) => sp.to_interned_string(interner),\n Self::FunctionExpression(f) => f.to_indented_string(interner, indentation),\n Self::AsyncArrowFunction(f) => f.to_indented_string(interner, indentation),\n Self::ArrowFunction(arrf) => arrf.to_indented_string(interner, indentation),\n Self::ClassExpression(cl) => cl.to_indented_string(interner, indentation),\n Self::GeneratorExpression(r#gen) => r#gen.to_indented_string(interner, indentation),\n Self::AsyncFunctionExpression(asf) => asf.to_indented_string(interner, indentation),\n Self::AsyncGeneratorExpression(asgen) => {\n asgen.to_indented_string(interner, indentation)\n }\n Self::TemplateLiteral(tem) => tem.to_interned_string(interner),\n Self::PropertyAccess(prop) => prop.to_interned_string(interner),\n Self::New(new) => new.to_interned_string(interner),\n Self::Call(call) => call.to_interned_string(interner),\n Self::SuperCall(supc) => supc.to_interned_string(interner),\n Self::ImportCall(impc) => impc.to_interned_string(interner),\n Self::Optional(opt) => opt.to_interned_string(interner),\n Self::NewTarget(new_target) => new_target.to_interned_string(interner),\n Self::ImportMeta(import_meta) => import_meta.to_interned_string(interner),\n Self::TaggedTemplate(tag) => tag.to_interned_string(interner),\n Self::Assign(assign) => assign.to_interned_string(interner),\n Self::Unary(unary) => unary.to_interned_string(interner),\n Self::Update(update) => update.to_interned_string(interner),\n Self::Binary(bin) => bin.to_interned_string(interner),\n Self::BinaryInPrivate(bin) => bin.to_interned_string(interner),\n Self::Conditional(cond) => cond.to_interned_string(interner),\n Self::Await(aw) => aw.to_interned_string(interner),\n Self::Yield(yi) => yi.to_interned_string(interner),\n Self::Parenthesized(expr) => expr.to_interned_string(interner),\n Self::RegExpLiteral(regexp) => regexp.to_interned_string(interner),\n }\n }\n\n /// Returns if the expression is a function definition without a name.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-isanonymousfunctiondefinition\n #[must_use]\n #[inline]\n pub const fn is_anonymous_function_definition(&self) -> bool {\n match self {\n Self::ArrowFunction(f) => f.name().is_none(),\n Self::AsyncArrowFunction(f) => f.name().is_none(),\n Self::FunctionExpression(f) => f.name().is_none(),\n Self::GeneratorExpression(f) => f.name().is_none(),\n Self::AsyncGeneratorExpression(f) => f.name().is_none(),\n Self::AsyncFunctionExpression(f) => f.name().is_none(),\n Self::ClassExpression(f) => f.name().is_none(),\n Self::Parenthesized(p) => p.expression().is_anonymous_function_definition(),\n _ => false,\n }\n }\n\n /// Sets the name of an anonymous function definition.\n ///\n /// This is used to set the name of a function expression when it is assigned to a variable.\n /// If the function already has a name, this does nothing.\n pub fn set_anonymous_function_definition_name(&mut self, name: &Identifier) {\n match self {\n Self::ArrowFunction(f) if f.name().is_none() => f.name = Some(*name),\n Self::AsyncArrowFunction(f) if f.name().is_none() => f.name = Some(*name),\n Self::FunctionExpression(f) if f.name().is_none() => f.name = Some(*name),\n Self::GeneratorExpression(f) if f.name().is_none() => f.name = Some(*name),\n Self::AsyncGeneratorExpression(f) if f.name().is_none() => f.name = Some(*name),\n Self::AsyncFunctionExpression(f) if f.name().is_none() => f.name = Some(*name),\n Self::ClassExpression(f) if f.name().is_none() => f.name = Some(*name),\n Self::Parenthesized(p) => p.expression.set_anonymous_function_definition_name(name),\n _ => {}\n }\n }\n\n /// Returns the expression without any outer parenthesized expressions.\n #[must_use]\n #[inline]\n pub const fn flatten(&self) -> &Self {\n let mut expression = self;\n while let Self::Parenthesized(p) = expression {\n expression = p.expression();\n }\n expression\n }\n}\n\nimpl Spanned for Expression {\n #[inline]\n fn span(&self) -> Span {\n match self {\n Self::This(this) => this.span(),\n Self::Identifier(id) => id.span(),\n Self::Literal(lit) => lit.span(),\n Self::ArrayLiteral(arr) => arr.span(),\n Self::ObjectLiteral(o) => o.span(),\n Self::Spread(sp) => sp.span(),\n Self::FunctionExpression(f) => f.span(),\n Self::AsyncArrowFunction(f) => f.span(),\n Self::ArrowFunction(arrf) => arrf.span(),\n Self::ClassExpression(cl) => cl.span(),\n Self::GeneratorExpression(r#gen) => r#gen.span(),\n Self::AsyncFunctionExpression(asf) => asf.span(),\n Self::AsyncGeneratorExpression(asgen) => asgen.span(),\n Self::TemplateLiteral(tem) => tem.span(),\n Self::PropertyAccess(prop) => prop.span(),\n Self::New(new) => new.span(),\n Self::Call(call) => call.span(),\n Self::SuperCall(supc) => supc.span(),\n Self::ImportCall(impc) => impc.span(),\n Self::Optional(opt) => opt.span(),\n Self::NewTarget(new_target) => new_target.span(),\n Self::ImportMeta(import_meta) => import_meta.span(),\n Self::TaggedTemplate(tag) => tag.span(),\n Self::Assign(assign) => assign.span(),\n Self::Unary(unary) => unary.span(),\n Self::Update(update) => update.span(),\n Self::Binary(bin) => bin.span(),\n Self::BinaryInPrivate(bin) => bin.span(),\n Self::Conditional(cond) => cond.span(),\n Self::Await(aw) => aw.span(),\n Self::Yield(yi) => yi.span(),\n Self::Parenthesized(expr) => expr.span(),\n Self::RegExpLiteral(regexp) => regexp.span(),\n }\n }\n}\n\nimpl From for Statement {\n #[inline]\n fn from(expr: Expression) -> Self {\n Self::Expression(expr)\n }\n}\n\nimpl ToIndentedString for Expression {\n #[inline]\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n self.to_no_indent_string(interner, indentation)\n }\n}\n\nimpl VisitWith for Expression {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::This(this) => visitor.visit_this(this),\n Self::Identifier(id) => visitor.visit_identifier(id),\n Self::Literal(lit) => visitor.visit_literal(lit),\n Self::RegExpLiteral(regexp) => visitor.visit_reg_exp_literal(regexp),\n Self::ArrayLiteral(arlit) => visitor.visit_array_literal(arlit),\n Self::ObjectLiteral(olit) => visitor.visit_object_literal(olit),\n Self::Spread(sp) => visitor.visit_spread(sp),\n Self::FunctionExpression(f) => visitor.visit_function_expression(f),\n Self::ArrowFunction(af) => visitor.visit_arrow_function(af),\n Self::AsyncArrowFunction(af) => visitor.visit_async_arrow_function(af),\n Self::GeneratorExpression(g) => visitor.visit_generator_expression(g),\n Self::AsyncFunctionExpression(af) => visitor.visit_async_function_expression(af),\n Self::AsyncGeneratorExpression(ag) => visitor.visit_async_generator_expression(ag),\n Self::ClassExpression(c) => visitor.visit_class_expression(c),\n Self::TemplateLiteral(tlit) => visitor.visit_template_literal(tlit),\n Self::PropertyAccess(pa) => visitor.visit_property_access(pa),\n Self::New(n) => visitor.visit_new(n),\n Self::Call(c) => visitor.visit_call(c),\n Self::SuperCall(sc) => visitor.visit_super_call(sc),\n Self::ImportCall(ic) => visitor.visit_import_call(ic),\n Self::Optional(opt) => visitor.visit_optional(opt),\n Self::TaggedTemplate(tt) => visitor.visit_tagged_template(tt),\n Self::Assign(a) => visitor.visit_assign(a),\n Self::Unary(u) => visitor.visit_unary(u),\n Self::Update(u) => visitor.visit_update(u),\n Self::Binary(b) => visitor.visit_binary(b),\n Self::BinaryInPrivate(b) => visitor.visit_binary_in_private(b),\n Self::Conditional(c) => visitor.visit_conditional(c),\n Self::Await(a) => visitor.visit_await(a),\n Self::Yield(y) => visitor.visit_yield(y),\n Self::Parenthesized(e) => visitor.visit_parenthesized(e),\n Self::NewTarget(new_target) => visitor.visit_new_target(new_target),\n Self::ImportMeta(import_meta) => visitor.visit_import_meta(import_meta),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::This(this) => visitor.visit_this_mut(this),\n Self::Identifier(id) => visitor.visit_identifier_mut(id),\n Self::Literal(lit) => visitor.visit_literal_mut(lit),\n Self::RegExpLiteral(regexp) => visitor.visit_reg_exp_literal_mut(regexp),\n Self::ArrayLiteral(arlit) => visitor.visit_array_literal_mut(arlit),\n Self::ObjectLiteral(olit) => visitor.visit_object_literal_mut(olit),\n Self::Spread(sp) => visitor.visit_spread_mut(sp),\n Self::FunctionExpression(f) => visitor.visit_function_expression_mut(f),\n Self::ArrowFunction(af) => visitor.visit_arrow_function_mut(af),\n Self::AsyncArrowFunction(af) => visitor.visit_async_arrow_function_mut(af),\n Self::GeneratorExpression(g) => visitor.visit_generator_expression_mut(g),\n Self::AsyncFunctionExpression(af) => visitor.visit_async_function_expression_mut(af),\n Self::AsyncGeneratorExpression(ag) => visitor.visit_async_generator_expression_mut(ag),\n Self::ClassExpression(c) => visitor.visit_class_expression_mut(c),\n Self::TemplateLiteral(tlit) => visitor.visit_template_literal_mut(tlit),\n Self::PropertyAccess(pa) => visitor.visit_property_access_mut(pa),\n Self::New(n) => visitor.visit_new_mut(n),\n Self::Call(c) => visitor.visit_call_mut(c),\n Self::SuperCall(sc) => visitor.visit_super_call_mut(sc),\n Self::ImportCall(ic) => visitor.visit_import_call_mut(ic),\n Self::Optional(opt) => visitor.visit_optional_mut(opt),\n Self::TaggedTemplate(tt) => visitor.visit_tagged_template_mut(tt),\n Self::Assign(a) => visitor.visit_assign_mut(a),\n Self::Unary(u) => visitor.visit_unary_mut(u),\n Self::Update(u) => visitor.visit_update_mut(u),\n Self::Binary(b) => visitor.visit_binary_mut(b),\n Self::BinaryInPrivate(b) => visitor.visit_binary_in_private_mut(b),\n Self::Conditional(c) => visitor.visit_conditional_mut(c),\n Self::Await(a) => visitor.visit_await_mut(a),\n Self::Yield(y) => visitor.visit_yield_mut(y),\n Self::Parenthesized(e) => visitor.visit_parenthesized_mut(e),\n Self::NewTarget(new_target) => visitor.visit_new_target_mut(new_target),\n Self::ImportMeta(import_meta) => visitor.visit_import_meta_mut(import_meta),\n }\n }\n}\n" }, { "path": "core/ast/src/expression/new.rs", "content": "use crate::expression::Call;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{Span, Spanned};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse super::Expression;\n\n/// The `new` operator lets developers create an instance of a user-defined object type or of\n/// one of the built-in object types that has a constructor function.\n///\n/// The new keyword does the following things:\n/// - Creates a blank, plain JavaScript object;\n/// - Links (sets the constructor of) this object to another object;\n/// - Passes the newly created object from Step 1 as the this context;\n/// - Returns this if the function doesn't return its own object.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-NewExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/new\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct New {\n call: Call,\n}\n\nimpl New {\n /// Gets the constructor of the new expression.\n #[inline]\n #[must_use]\n pub const fn constructor(&self) -> &Expression {\n self.call.function()\n }\n\n /// Retrieves the arguments passed to the constructor.\n #[inline]\n #[must_use]\n pub const fn arguments(&self) -> &[Expression] {\n self.call.args()\n }\n\n /// Returns the inner call expression.\n #[must_use]\n pub const fn call(&self) -> &Call {\n &self.call\n }\n}\n\nimpl From for New {\n #[inline]\n fn from(call: Call) -> Self {\n Self { call }\n }\n}\n\nimpl Spanned for New {\n #[inline]\n fn span(&self) -> Span {\n self.call.span()\n }\n}\n\nimpl ToInternedString for New {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\"new {}\", self.call.to_interned_string(interner))\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(new: New) -> Self {\n Self::New(new)\n }\n}\n\nimpl VisitWith for New {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_call(&self.call)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_call_mut(&mut self.call)\n }\n}\n" }, { "path": "core/ast/src/expression/new_target.rs", "content": "//! `target.new` ECMAScript expression.\n\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse super::Expression;\n\n/// ECMAScript's `NewTarget` expression AST node.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\npub struct NewTarget {\n span: Span,\n}\n\nimpl NewTarget {\n /// Creates a new [`NewTarget`] AST Expression.\n #[inline]\n #[must_use]\n pub const fn new(span: Span) -> Self {\n Self { span }\n }\n}\n\nimpl Spanned for NewTarget {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(value: NewTarget) -> Self {\n Expression::NewTarget(value)\n }\n}\n\nimpl ToInternedString for NewTarget {\n #[inline]\n fn to_interned_string(&self, _interner: &Interner) -> String {\n String::from(\"new.target\")\n }\n}\n\nimpl VisitWith for NewTarget {\n fn visit_with<'a, V>(&'a self, _visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, _visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/expression/operator/assign/mod.rs", "content": "#![allow(clippy::doc_link_with_quotes)]\n\n//! Assignment expression nodes, as defined by the [spec].\n//!\n//! An [assignment operator][mdn] assigns a value to its left operand based on the value of its right\n//! operand. Almost any [`LeftHandSideExpression`][lhs] Parse Node can be the target of a simple\n//! assignment expression (`=`). However, the compound assignment operations such as `%=` or `??=`\n//! only allow [\"simple\"][simple] left hand side expressions as an assignment target.\n//!\n//! [spec]: https://tc39.es/ecma262/#prod-AssignmentExpression\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators\n//! [lhs]: https://tc39.es/ecma262/#prod-LeftHandSideExpression\n//! [simple]: https://tc39.es/ecma262/#sec-static-semantics-assignmenttargettype\n\nmod op;\n\nuse core::ops::ControlFlow;\npub use op::*;\n\nuse boa_interner::{Interner, Sym, ToInternedString};\n\nuse crate::{\n Span, Spanned,\n expression::{Expression, access::PropertyAccess, identifier::Identifier},\n pattern::Pattern,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\n\n/// An assignment operator expression.\n///\n/// See the [module level documentation][self] for more information.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Assign {\n op: AssignOp,\n lhs: Box,\n rhs: Box,\n}\n\nimpl Assign {\n /// Creates an `Assign` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(op: AssignOp, lhs: AssignTarget, rhs: Expression) -> Self {\n Self {\n op,\n lhs: Box::new(lhs),\n rhs: Box::new(rhs),\n }\n }\n\n /// Gets the operator of the assignment operation.\n #[inline]\n #[must_use]\n pub const fn op(&self) -> AssignOp {\n self.op\n }\n\n /// Gets the left hand side of the assignment operation.\n #[inline]\n #[must_use]\n pub const fn lhs(&self) -> &AssignTarget {\n &self.lhs\n }\n\n /// Gets the right hand side of the assignment operation.\n #[inline]\n #[must_use]\n pub const fn rhs(&self) -> &Expression {\n &self.rhs\n }\n}\n\nimpl Spanned for Assign {\n #[inline]\n fn span(&self) -> Span {\n Span::new(self.lhs.span().start(), self.rhs.span().end())\n }\n}\n\nimpl ToInternedString for Assign {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\n \"{} {} {}\",\n self.lhs.to_interned_string(interner),\n self.op,\n self.rhs.to_interned_string(interner)\n )\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(op: Assign) -> Self {\n Self::Assign(op)\n }\n}\n\nimpl VisitWith for Assign {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_assign_target(&self.lhs)?;\n visitor.visit_expression(&self.rhs)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_assign_target_mut(&mut self.lhs)?;\n visitor.visit_expression_mut(&mut self.rhs)\n }\n}\n\n/// The valid left-hand-side expressions of an assignment operator. Also called\n/// [`LeftHandSideExpression`][spec] in the spec.\n///\n/// [spec]: hhttps://tc39.es/ecma262/#prod-LeftHandSideExpression\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum AssignTarget {\n /// A simple identifier, such as `a`.\n Identifier(Identifier),\n /// A property access, such as `a.prop`.\n Access(PropertyAccess),\n /// A pattern assignment, such as `{a, b, ...c}`.\n Pattern(Pattern),\n}\n\nimpl AssignTarget {\n /// Converts the left-hand-side Expression of an assignment expression into an [`AssignTarget`].\n /// Returns `None` if the given Expression is an invalid left-hand-side for a assignment expression.\n #[must_use]\n pub fn from_expression(expression: &Expression, strict: bool) -> Option {\n match expression {\n Expression::ObjectLiteral(object) => {\n let pattern = object.to_pattern(strict)?;\n Some(Self::Pattern(pattern.into()))\n }\n Expression::ArrayLiteral(array) => {\n let pattern = array.to_pattern(strict)?;\n Some(Self::Pattern(pattern.into()))\n }\n e => Self::from_expression_simple(e, strict),\n }\n }\n\n /// Converts the left-hand-side Expression of an assignment expression into an [`AssignTarget`].\n /// Returns `None` if the given Expression is an invalid left-hand-side for a assignment expression.\n ///\n /// The `AssignmentTargetType` of the expression must be `simple`.\n #[must_use]\n pub fn from_expression_simple(expression: &Expression, strict: bool) -> Option {\n match expression {\n Expression::Identifier(id)\n if strict && (id.sym() == Sym::EVAL || id.sym() == Sym::ARGUMENTS) =>\n {\n None\n }\n Expression::Identifier(id) => Some(Self::Identifier(*id)),\n Expression::PropertyAccess(access) => Some(Self::Access(access.clone())),\n Expression::Parenthesized(p) => Self::from_expression_simple(p.expression(), strict),\n _ => None,\n }\n }\n}\n\nimpl Spanned for AssignTarget {\n #[inline]\n fn span(&self) -> Span {\n match self {\n AssignTarget::Identifier(identifier) => identifier.span(),\n AssignTarget::Access(property_access) => property_access.span(),\n AssignTarget::Pattern(pattern) => pattern.span(),\n }\n }\n}\n\nimpl ToInternedString for AssignTarget {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self {\n Self::Identifier(id) => id.to_interned_string(interner),\n Self::Access(access) => access.to_interned_string(interner),\n Self::Pattern(pattern) => pattern.to_interned_string(interner),\n }\n }\n}\n\nimpl From for AssignTarget {\n #[inline]\n fn from(target: Identifier) -> Self {\n Self::Identifier(target)\n }\n}\n\nimpl VisitWith for AssignTarget {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Identifier(id) => visitor.visit_identifier(id),\n Self::Access(pa) => visitor.visit_property_access(pa),\n Self::Pattern(pat) => visitor.visit_pattern(pat),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Identifier(id) => visitor.visit_identifier_mut(id),\n Self::Access(pa) => visitor.visit_property_access_mut(pa),\n Self::Pattern(pat) => visitor.visit_pattern_mut(pat),\n }\n }\n}\n" }, { "path": "core/ast/src/expression/operator/assign/op.rs", "content": "/// An assignment operator assigns a value to its left operand based on the value of its right operand.\n///\n/// The simple assignment operator is equal (`=`), which assigns the value of its right operand to its\n/// left operand. That is, `x = y` assigns the value of `y to x`.\n///\n/// There are also compound assignment operators that are shorthand for the operations\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Expressions_and_Operators#Assignment\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum AssignOp {\n /// The assignment operator assigns the value of the right operand to the left operand.\n ///\n /// Syntax: `x = y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment\n Assign,\n\n /// The addition assignment operator adds the value of the right operand to a variable and assigns the result to the variable.\n ///\n /// Syntax: `x += y`\n ///\n /// The types of the two operands determine the behavior of the addition assignment operator. Addition or concatenation is possible.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Addition_assignment\n Add,\n\n /// The subtraction assignment operator subtracts the value of the right operand from a variable and assigns the result to the variable.\n ///\n /// Syntax: `x -= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Subtraction_assignment\n Sub,\n\n /// The multiplication assignment operator multiplies a variable by the value of the right operand and assigns the result to the variable.\n ///\n /// Syntax: `x *= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Multiplication_assignment\n Mul,\n\n /// The division assignment operator divides a variable by the value of the right operand and assigns the result to the variable.\n ///\n /// Syntax: `x /= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Division_assignment\n Div,\n\n /// The remainder assignment operator divides a variable by the value of the right operand and assigns the remainder to the variable.\n ///\n /// Syntax: `x %= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Remainder_assignment\n Mod,\n\n /// The exponentiation assignment operator raises the value of a variable to the power of the right operand.\n ///\n /// Syntax: `x ** y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Exponentiation_assignment\n Exp,\n\n /// The bitwise AND assignment operator uses the binary representation of both operands, does a bitwise AND operation on\n /// them and assigns the result to the variable.\n ///\n /// Syntax: `x &= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Bitwise_AND_assignment\n And,\n\n /// The bitwise OR assignment operator uses the binary representation of both operands, does a bitwise OR operation on\n /// them and assigns the result to the variable.\n ///\n /// Syntax: `x |= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Bitwise_OR_assignment\n Or,\n\n /// The bitwise XOR assignment operator uses the binary representation of both operands, does a bitwise XOR operation on\n /// them and assigns the result to the variable.\n ///\n /// Syntax: `x ^= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Bitwise_XOR_assignment\n Xor,\n\n /// The left shift assignment operator moves the specified amount of bits to the left and assigns the result to the variable.\n ///\n /// Syntax: `x <<= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Left_shift_assignment\n Shl,\n\n /// The right shift assignment operator moves the specified amount of bits to the right and assigns the result to the variable.\n ///\n /// Syntax: `x >>= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Assignment_Operators#Right_shift_assignment\n Shr,\n\n /// The unsigned right shift assignment operator moves the specified amount of bits to the right and assigns the result to the variable.\n ///\n /// Syntax: `x >>>= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Unsigned_right_shift_assignment\n Ushr,\n\n /// The logical and assignment operator only assigns if the target variable is truthy.\n ///\n /// Syntax: `x &&= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Logical_AND_assignment\n BoolAnd,\n\n /// The logical or assignment operator only assigns if the target variable is falsy.\n ///\n /// Syntax: `x ||= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Logical_OR_assignment\n BoolOr,\n\n /// The logical nullish assignment operator only assigns if the target variable is nullish (null or undefined).\n ///\n /// Syntax: `x ??= y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Logical_nullish_assignment\n Coalesce,\n}\n\nimpl AssignOp {\n /// Retrieves the operation as a static string.\n const fn as_str(self) -> &'static str {\n match self {\n Self::Assign => \"=\",\n Self::Add => \"+=\",\n Self::Sub => \"-=\",\n Self::Mul => \"*=\",\n Self::Exp => \"**=\",\n Self::Div => \"/=\",\n Self::Mod => \"%=\",\n Self::And => \"&=\",\n Self::Or => \"|=\",\n Self::Xor => \"^=\",\n Self::Shl => \"<<=\",\n Self::Shr => \">>=\",\n Self::Ushr => \">>>=\",\n Self::BoolAnd => \"&&=\",\n Self::BoolOr => \"||=\",\n Self::Coalesce => \"??=\",\n }\n }\n}\n\nimpl std::fmt::Display for AssignOp {\n #[inline]\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n write!(f, \"{}\", self.as_str())\n }\n}\n" }, { "path": "core/ast/src/expression/operator/binary/mod.rs", "content": "//! Binary expression nodes.\n//!\n//! A Binary expression comprises any operation between two expressions (excluding assignments),\n//! such as:\n//! - [Logic operations][logic] (`||`, `&&`).\n//! - [Relational math][relat] (`==`, `<`).\n//! - [Bit manipulation][bit] (`^`, `|`).\n//! - [Arithmetic][arith] (`+`, `%`).\n//! - The [comma operator][comma] (`,`)\n//!\n//! [logic]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#binary_logical_operators\n//! [relat]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#relational_operators\n//! [bit]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#binary_bitwise_operators\n//! [arith]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#arithmetic_operators\n//! [comma]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comma_Operator\n\nmod op;\n\nuse crate::{\n Span, Spanned,\n expression::Expression,\n function::PrivateName,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\npub use op::*;\n\n/// Binary operations require two operands, one before the operator and one after the operator.\n///\n/// See the [module level documentation][self] for more information.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Binary {\n op: BinaryOp,\n lhs: Box,\n rhs: Box,\n}\n\nimpl Binary {\n /// Creates a `BinOp` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(op: BinaryOp, lhs: Expression, rhs: Expression) -> Self {\n Self {\n op,\n lhs: Box::new(lhs),\n rhs: Box::new(rhs),\n }\n }\n\n /// Gets the binary operation of the Expression.\n #[inline]\n #[must_use]\n pub const fn op(&self) -> BinaryOp {\n self.op\n }\n\n /// Gets the left hand side of the binary operation.\n #[inline]\n #[must_use]\n pub const fn lhs(&self) -> &Expression {\n &self.lhs\n }\n\n /// Gets the right hand side of the binary operation.\n #[inline]\n #[must_use]\n pub const fn rhs(&self) -> &Expression {\n &self.rhs\n }\n\n /// Gets the left hand side of the binary operation.\n #[inline]\n #[must_use]\n pub fn lhs_mut(&mut self) -> &mut Expression {\n &mut self.lhs\n }\n\n /// Gets the right hand side of the binary operation.\n #[inline]\n #[must_use]\n pub fn rhs_mut(&mut self) -> &mut Expression {\n &mut self.rhs\n }\n}\n\nimpl Spanned for Binary {\n #[inline]\n fn span(&self) -> Span {\n Span::new(self.lhs.span().start(), self.rhs.span().end())\n }\n}\n\nimpl ToInternedString for Binary {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\n \"{} {} {}\",\n self.lhs.to_interned_string(interner),\n self.op,\n self.rhs.to_interned_string(interner)\n )\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(op: Binary) -> Self {\n Self::Binary(op)\n }\n}\n\nimpl VisitWith for Binary {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.lhs)?;\n visitor.visit_expression(&self.rhs)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.lhs)?;\n visitor.visit_expression_mut(&mut self.rhs)\n }\n}\n\n/// Binary [relational][relat] `In` expression with a private name on the left hand side.\n///\n/// Because the left hand side must be a private name, this is a separate type from [`Binary`].\n///\n/// [relat]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#relational_operators\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct BinaryInPrivate {\n lhs: PrivateName,\n rhs: Box,\n}\n\nimpl BinaryInPrivate {\n /// Creates a `BinaryInPrivate` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(lhs: PrivateName, rhs: Expression) -> Self {\n Self {\n lhs,\n rhs: Box::new(rhs),\n }\n }\n\n /// Gets the left hand side of the binary operation.\n #[inline]\n #[must_use]\n pub const fn lhs(&self) -> &PrivateName {\n &self.lhs\n }\n\n /// Gets the right hand side of the binary operation.\n #[inline]\n #[must_use]\n pub const fn rhs(&self) -> &Expression {\n &self.rhs\n }\n}\n\nimpl Spanned for BinaryInPrivate {\n #[inline]\n fn span(&self) -> Span {\n Span::new(self.lhs.span().start(), self.rhs.span().end())\n }\n}\n\nimpl ToInternedString for BinaryInPrivate {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\n \"#{} in {}\",\n interner.resolve_expect(self.lhs.description()),\n self.rhs.to_interned_string(interner)\n )\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(op: BinaryInPrivate) -> Self {\n Self::BinaryInPrivate(op)\n }\n}\n\nimpl VisitWith for BinaryInPrivate {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_private_name(&self.lhs)?;\n visitor.visit_expression(&self.rhs)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_private_name_mut(&mut self.lhs)?;\n visitor.visit_expression_mut(&mut self.rhs)\n }\n}\n" }, { "path": "core/ast/src/expression/operator/binary/op.rs", "content": "//! This module implements various structure for logic handling.\n\nuse std::fmt::{Display, Formatter, Result};\n\n/// This represents a binary operation between two values.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum BinaryOp {\n /// Numeric operation.\n ///\n /// see: [`NumOp`](enum.NumOp.html)\n Arithmetic(ArithmeticOp),\n\n /// Bitwise operation.\n ///\n /// see: [`BitOp`](enum.BitOp.html).\n Bitwise(BitwiseOp),\n\n /// Comparative operation.\n ///\n /// see: [`CompOp`](enum.CompOp.html).\n Relational(RelationalOp),\n\n /// Logical operation.\n ///\n /// see: [`LogOp`](enum.LogOp.html).\n Logical(LogicalOp),\n\n /// Comma operation.\n Comma,\n}\n\nimpl From for BinaryOp {\n #[inline]\n fn from(op: ArithmeticOp) -> Self {\n Self::Arithmetic(op)\n }\n}\n\nimpl From for BinaryOp {\n #[inline]\n fn from(op: BitwiseOp) -> Self {\n Self::Bitwise(op)\n }\n}\n\nimpl From for BinaryOp {\n #[inline]\n fn from(op: RelationalOp) -> Self {\n Self::Relational(op)\n }\n}\n\nimpl From for BinaryOp {\n #[inline]\n fn from(op: LogicalOp) -> Self {\n Self::Logical(op)\n }\n}\n\nimpl BinaryOp {\n /// Retrieves the operation as a static string.\n const fn as_str(self) -> &'static str {\n match self {\n Self::Arithmetic(ref op) => op.as_str(),\n Self::Bitwise(ref op) => op.as_str(),\n Self::Relational(ref op) => op.as_str(),\n Self::Logical(ref op) => op.as_str(),\n Self::Comma => \",\",\n }\n }\n}\n\nimpl Display for BinaryOp {\n #[inline]\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.as_str())\n }\n}\n\n/// Arithmetic operators take numerical values (either literals or variables)\n/// as their operands and return a single numerical value.\n///\n/// More information:\n/// - [MDN documentation][mdn]\n///\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Expressions_and_Operators#Arithmetic\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum ArithmeticOp {\n /// The addition operator produces the sum of numeric operands or string concatenation.\n ///\n /// Syntax: `x + y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec].\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-addition-operator-plus\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Addition\n Add,\n\n /// The subtraction operator subtracts the two operands, producing their difference.\n ///\n /// Syntax: `x - y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec].\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-subtraction-operator-minus\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Subtraction\n Sub,\n\n /// The division operator produces the quotient of its operands where the left operand\n /// is the dividend and the right operand is the divisor.\n ///\n /// Syntax: `x / y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-MultiplicativeOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Division\n Div,\n\n /// The multiplication operator produces the product of the operands.\n ///\n /// Syntax: `x * y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-MultiplicativeExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Multiplication\n Mul,\n\n /// The exponentiation operator returns the result of raising the first operand to\n /// the power of the second operand.\n ///\n /// Syntax: `x ** y`\n ///\n /// The exponentiation operator is right-associative. a ** b ** c is equal to a ** (b ** c).\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-exp-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Exponentiation\n Exp,\n\n /// The remainder operator returns the remainder left over when one operand is divided by a second operand.\n ///\n /// Syntax: `x % y`\n ///\n /// The remainder operator always takes the sign of the dividend.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-MultiplicativeOperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Remainder\n Mod,\n}\n\nimpl ArithmeticOp {\n /// Retrieves the operation as a static string.\n const fn as_str(self) -> &'static str {\n match self {\n Self::Add => \"+\",\n Self::Sub => \"-\",\n Self::Div => \"/\",\n Self::Mul => \"*\",\n Self::Exp => \"**\",\n Self::Mod => \"%\",\n }\n }\n}\n\nimpl Display for ArithmeticOp {\n #[inline]\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.as_str())\n }\n}\n\n/// A bitwise operator is an operator used to perform bitwise operations\n/// on bit patterns or binary numerals that involve the manipulation of individual bits.\n///\n/// More information:\n/// - [MDN documentation][mdn]\n///\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Expressions_and_Operators#Bitwise\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum BitwiseOp {\n /// Performs the AND operation on each pair of bits. a AND b yields 1 only if both a and b are 1.\n ///\n /// Syntax: `x & y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-BitwiseANDExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Bitwise_AND\n And,\n\n /// Performs the OR operation on each pair of bits. a OR b yields 1 if either a or b is 1.\n ///\n /// Syntax: `x | y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-BitwiseORExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Bitwise_OR\n Or,\n\n /// Performs the XOR operation on each pair of bits. a XOR b yields 1 if a and b are different.\n ///\n /// Syntax: `x ^ y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-BitwiseXORExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Bitwise_XOR\n Xor,\n\n /// This operator shifts the first operand the specified number of bits to the left.\n ///\n /// Syntax: `x << y`\n ///\n /// Excess bits shifted off to the left are discarded. Zero bits are shifted in from the right.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-left-shift-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Left_shift\n Shl,\n\n /// This operator shifts the first operand the specified number of bits to the right.\n ///\n /// Syntax: `x >> y`\n ///\n /// Excess bits shifted off to the right are discarded. Copies of the leftmost bit\n /// are shifted in from the left. Since the new leftmost bit has the same value as\n /// the previous leftmost bit, the sign bit (the leftmost bit) does not change.\n /// Hence the name \"sign-propagating\".\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-signed-right-shift-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Right_shift\n Shr,\n\n /// This operator shifts the first operand the specified number of bits to the right.\n ///\n /// Syntax: `x >>> y`\n ///\n /// Excess bits shifted off to the right are discarded. Zero bits are shifted in\n /// from the left. The sign bit becomes 0, so the result is always non-negative.\n /// Unlike the other bitwise operators, zero-fill right shift returns an unsigned 32-bit integer.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-unsigned-right-shift-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Unsigned_right_shift\n UShr,\n}\n\nimpl BitwiseOp {\n /// Retrieves the operation as a static string.\n const fn as_str(self) -> &'static str {\n match self {\n Self::And => \"&\",\n Self::Or => \"|\",\n Self::Xor => \"^\",\n Self::Shl => \"<<\",\n Self::Shr => \">>\",\n Self::UShr => \">>>\",\n }\n }\n}\n\nimpl Display for BitwiseOp {\n #[inline]\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.as_str())\n }\n}\n\n/// A relational operator compares its operands and returns a logical value based on whether the relation is true.\n///\n/// The operands can be numerical, string, logical, or object values. Strings are compared based on standard\n/// lexicographical ordering, using Unicode values. In most cases, if the two operands are not of the same type,\n/// JavaScript attempts to convert them to an appropriate type for the comparison. This behavior generally results in\n/// comparing the operands numerically. The sole exceptions to type conversion within comparisons involve the `===` and `!==`\n/// operators, which perform strict equality and inequality comparisons. These operators do not attempt to convert the operands\n/// to compatible types before checking equality.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: tc39.es/ecma262/#sec-testing-and-comparison-operations\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Expressions_and_Operators#Comparison\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum RelationalOp {\n /// The equality operator converts the operands if they are not of the same type, then applies\n /// strict comparison.\n ///\n /// Syntax: `y == y`\n ///\n /// If both operands are objects, then JavaScript compares internal references which are equal\n /// when operands refer to the same object in memory.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-abstract-equality-comparison\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Equality\n Equal,\n\n /// The inequality operator returns `true` if the operands are not equal.\n ///\n /// Syntax: `x != y`\n ///\n /// If the two operands are not of the same type, JavaScript attempts to convert the operands\n /// to an appropriate type for the comparison. If both operands are objects, then JavaScript\n /// compares internal references which are not equal when operands refer to different objects\n /// in memory.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-EqualityExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Inequality\n NotEqual,\n\n /// The identity operator returns `true` if the operands are strictly equal **with no type\n /// conversion**.\n ///\n /// Syntax: `x === y`\n ///\n /// Returns `true` if the operands are equal and of the same type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-strict-equality-comparison\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Identity\n StrictEqual,\n\n /// The non-identity operator returns `true` if the operands **are not equal and/or not of the\n /// same type**.\n ///\n /// Syntax: `x !== y`\n ///\n /// Returns `true` if the operands are of the same type but not equal, or are of different type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-EqualityExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Nonidentity>\n StrictNotEqual,\n\n /// The greater than operator returns `true` if the left operand is greater than the right\n /// operand.\n ///\n /// Syntax: `x > y`\n ///\n /// Returns `true` if the left operand is greater than the right operand.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-RelationalExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Greater_than_operator\n GreaterThan,\n\n /// The greater than or equal operator returns `true` if the left operand is greater than or\n /// equal to the right operand.\n ///\n /// Syntax: `x >= y`\n ///\n /// Returns `true` if the left operand is greater than the right operand.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-RelationalExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Greater_than_operator\n GreaterThanOrEqual,\n\n /// The less than operator returns `true` if the left operand is less than the right operand.\n ///\n /// Syntax: `x < y`\n ///\n /// Returns `true` if the left operand is less than the right operand.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-RelationalExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Less_than_operator\n LessThan,\n\n /// The less than or equal operator returns `true` if the left operand is less than or equal to\n /// the right operand.\n ///\n /// Syntax: `x <= y`\n ///\n /// Returns `true` if the left operand is less than or equal to the right operand.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-RelationalExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Less_than_or_equal_operator\n LessThanOrEqual,\n\n /// The `in` operator returns `true` if the specified property is in the specified object or\n /// its prototype chain.\n ///\n /// Syntax: `prop in object`\n ///\n /// Returns `true` the specified property is in the specified object or its prototype chain.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-RelationalExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/in\n In,\n\n /// The `instanceof` operator returns `true` if the specified object is an instance of the\n /// right hand side object.\n ///\n /// Syntax: `obj instanceof Object`\n ///\n /// Returns `true` the `prototype` property of the right hand side constructor appears anywhere\n /// in the prototype chain of the object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-RelationalExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/instanceof\n InstanceOf,\n}\n\nimpl RelationalOp {\n /// Retrieves the operation as a static string.\n const fn as_str(self) -> &'static str {\n match self {\n Self::Equal => \"==\",\n Self::NotEqual => \"!=\",\n Self::StrictEqual => \"===\",\n Self::StrictNotEqual => \"!==\",\n Self::GreaterThan => \">\",\n Self::GreaterThanOrEqual => \">=\",\n Self::LessThan => \"<\",\n Self::LessThanOrEqual => \"<=\",\n Self::In => \"in\",\n Self::InstanceOf => \"instanceof\",\n }\n }\n}\n\nimpl Display for RelationalOp {\n #[inline]\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.as_str())\n }\n}\n\n/// Logical operators are typically used with Boolean (logical) values; when they are, they return a Boolean value.\n///\n/// However, the `&&` and `||` operators actually return the value of one of the specified operands,\n/// so if these operators are used with non-Boolean values, they may return a non-Boolean value.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-binary-logical-operators\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Expressions_and_Operators#Logical\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum LogicalOp {\n /// The logical AND operator returns the value of the first operand if it can be coerced into `false`;\n /// otherwise, it returns the second operand.\n ///\n /// Syntax: `x && y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-LogicalANDExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Logical_Operators#Logical_AND\n And,\n\n /// The logical OR operator returns the value the first operand if it can be coerced into `true`;\n /// otherwise, it returns the second operand.\n ///\n /// Syntax: `x || y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-LogicalORExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Logical_Operators#Logical_OR\n Or,\n\n /// The nullish coalescing operator is a logical operator that returns the second operand\n /// when its first operand is null or undefined, and otherwise returns its first operand.\n ///\n /// Syntax: `x ?? y`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-CoalesceExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Nullish_coalescing_operator\n Coalesce,\n}\n\nimpl LogicalOp {\n /// Retrieves the operation as a static string.\n const fn as_str(self) -> &'static str {\n match self {\n Self::And => \"&&\",\n Self::Or => \"||\",\n Self::Coalesce => \"??\",\n }\n }\n}\n\nimpl Display for LogicalOp {\n #[inline]\n fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n write!(f, \"{}\", self.as_str())\n }\n}\n" }, { "path": "core/ast/src/expression/operator/conditional.rs", "content": "use crate::{\n Span, Spanned,\n expression::Expression,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// The `conditional` (ternary) operation is the only ECMAScript operation that takes three\n/// operands.\n///\n/// This operation takes three operands: a condition followed by a question mark (`?`),\n/// then an expression to execute `if` the condition is truthy followed by a colon (`:`),\n/// and finally the expression to execute if the condition is `false`.\n/// This operator is frequently used as a shortcut for the `if` statement.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ConditionalExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Grammar_and_types#Literals\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Conditional {\n condition: Box,\n if_true: Box,\n if_false: Box,\n}\n\nimpl Conditional {\n /// Gets the condition of the `Conditional` expression.\n #[inline]\n #[must_use]\n pub const fn condition(&self) -> &Expression {\n &self.condition\n }\n\n /// Gets the expression returned if `condition` is truthy.\n #[inline]\n #[must_use]\n pub const fn if_true(&self) -> &Expression {\n &self.if_true\n }\n\n /// Gets the expression returned if `condition` is falsy.\n #[inline]\n #[must_use]\n pub const fn if_false(&self) -> &Expression {\n &self.if_false\n }\n\n /// Creates a `Conditional` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(condition: Expression, if_true: Expression, if_false: Expression) -> Self {\n Self {\n condition: Box::new(condition),\n if_true: Box::new(if_true),\n if_false: Box::new(if_false),\n }\n }\n}\n\nimpl Spanned for Conditional {\n #[inline]\n fn span(&self) -> Span {\n Span::new(self.condition.span().start(), self.if_false.span().end())\n }\n}\n\nimpl ToInternedString for Conditional {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\n \"{} ? {} : {}\",\n self.condition().to_interned_string(interner),\n self.if_true().to_interned_string(interner),\n self.if_false().to_interned_string(interner)\n )\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(cond_op: Conditional) -> Self {\n Self::Conditional(cond_op)\n }\n}\n\nimpl VisitWith for Conditional {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.condition)?;\n visitor.visit_expression(&self.if_true)?;\n visitor.visit_expression(&self.if_false)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.condition)?;\n visitor.visit_expression_mut(&mut self.if_true)?;\n visitor.visit_expression_mut(&mut self.if_false)\n }\n}\n" }, { "path": "core/ast/src/expression/operator/mod.rs", "content": "//! Operator expression nodes.\n//!\n//! An [operator][op] expression is an expression that takes an operator (such as `+`, `typeof`, `+=`)\n//! and one or more expressions and returns an expression as a result.\n//! An operator expression can be any of the following:\n//!\n//! - A [`Unary`] expression.\n//! - A [`Update`] expression.\n//! - A [`Assign`] expression.\n//! - A [`Binary`] expression.\n//! - A [`Conditional`] expression.\n//!\n//! [op]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators\n\nmod conditional;\n\npub mod assign;\npub mod binary;\npub mod unary;\npub mod update;\n\npub use self::{\n assign::Assign,\n binary::{Binary, BinaryInPrivate},\n conditional::Conditional,\n unary::Unary,\n update::Update,\n};\n" }, { "path": "core/ast/src/expression/operator/unary/mod.rs", "content": "//! Unary expression nodes.\n//!\n//! A unary expression comprises any operation applied to a single expression. Some examples include:\n//!\n//! - The [`delete`][del] operator.\n//! - The [bitwise NOT][not] operator (`~`).\n//!\n//! The full list of valid unary operators is defined in [`UnaryOp`].\n//!\n//! [del]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/delete\n//! [not]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_NOT\nmod op;\n\nuse crate::{\n Span, Spanned,\n expression::Expression,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\npub use op::*;\n\n/// A unary expression is an operation with only one operand.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-UnaryExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Expressions_and_Operators#Unary_operators\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Unary {\n op: UnaryOp,\n target: Box,\n span: Span,\n}\n\nimpl Unary {\n /// Creates a new `UnaryOp` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(op: UnaryOp, target: Expression, span: Span) -> Self {\n Self {\n op,\n target: Box::new(target),\n span,\n }\n }\n\n /// Gets the unary operation of the Expression.\n #[inline]\n #[must_use]\n pub const fn op(&self) -> UnaryOp {\n self.op\n }\n\n /// Gets the target of this unary operator.\n #[inline]\n #[must_use]\n pub fn target(&self) -> &Expression {\n self.target.as_ref()\n }\n\n /// Gets the target of this unary operator.\n #[inline]\n #[must_use]\n pub fn target_mut(&mut self) -> &mut Expression {\n self.target.as_mut()\n }\n}\n\nimpl Spanned for Unary {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for Unary {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\"{} {}\", self.op, self.target.to_interned_string(interner))\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(op: Unary) -> Self {\n Self::Unary(op)\n }\n}\n\nimpl VisitWith for Unary {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.target)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.target)\n }\n}\n" }, { "path": "core/ast/src/expression/operator/unary/op.rs", "content": "/// A unary operator is one that takes a single operand/argument and performs an operation.\n///\n/// A unary operation is an operation with only one operand. This operand comes either\n/// before or after the operator. Unary operators are more efficient than standard JavaScript\n/// function calls.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-UnaryExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Expressions_and_Operators#Unary\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum UnaryOp {\n /// The unary negation operator precedes its operand and negates it.\n ///\n /// Syntax: `-x`\n ///\n /// Converts non-numbers data types to numbers like unary plus,\n /// however, it performs an additional operation, negation.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-unary-minus-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Unary_negation\n Minus,\n\n /// The unary plus operator attempts to convert the operand into a number, if it isn't already.\n ///\n /// Syntax: `+x`\n ///\n /// Although unary negation (`-`) also can convert non-numbers, unary plus is the fastest and preferred\n /// way of converting something into a number, because it does not perform any other operations on the number.\n /// It can convert `string` representations of integers and floats, as well as the non-string values `true`, `false`, and `null`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-unary-plus-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Unary_plus\n Plus,\n\n /// Returns `false` if its single operand can be converted to `true`; otherwise, returns `true`.\n ///\n /// Syntax: `!x`\n ///\n /// Boolean values simply get inverted: `!true === false` and `!false === true`.\n /// Non-boolean values get converted to boolean values first, then are negated.\n /// This means that it is possible to use a couple of NOT operators in series to explicitly\n /// force the conversion of any value to the corresponding boolean primitive.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-logical-not-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Logical_Operators#Logical_NOT\n Not,\n\n /// Performs the NOT operator on each bit.\n ///\n /// Syntax: `~x`\n ///\n /// NOT `a` yields the inverted value (or one's complement) of `a`.\n /// Bitwise `NOT`ing any number x yields -(x + 1). For example, ~-5 yields 4.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-bitwise-not-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Bitwise_NOT\n Tilde,\n\n /// The `typeof` operator returns a string indicating the type of the unevaluated operand.\n ///\n /// Syntax: `typeof x` or `typeof(x)`\n ///\n /// The `typeof` is a JavaScript keyword that will return the type of a variable when you call it.\n /// You can use this to validate function parameters or check if variables are defined.\n /// There are other uses as well.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-typeof-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof\n TypeOf,\n\n /// The JavaScript `delete` operator removes a property from an object.\n ///\n /// Syntax: `delete x`\n ///\n /// Unlike what common belief suggests, the delete operator has nothing to do with\n /// directly freeing memory. Memory management is done indirectly via breaking references.\n /// If no more references to the same property are held, it is eventually released automatically.\n ///\n /// The `delete` operator returns `true` for all cases except when the property is an\n /// [own](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/hasOwnProperty)\n /// [non-configurable](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Errors/Cant_delete)\n /// property, in which case, `false` is returned in non-strict mode.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-delete-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/delete\n Delete,\n\n /// The `void` operator evaluates the given `expression` and then returns `undefined`.\n ///\n /// Syntax: `void x`\n ///\n /// This operator allows evaluating expressions that produce a value into places where an\n /// expression that evaluates to `undefined` is desired.\n /// The `void` operator is often used merely to obtain the `undefined` primitive value, usually using `void(0)`\n /// (which is equivalent to `void 0`). In these cases, the global variable undefined can be used.\n ///\n /// When using an [immediately-invoked function expression](https://developer.mozilla.org/en-US/docs/Glossary/IIFE),\n /// `void` can be used to force the function keyword to be treated as an expression instead of a declaration.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-void-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/void\n Void,\n}\n\nimpl UnaryOp {\n /// Retrieves the operation as a static string.\n const fn as_str(self) -> &'static str {\n match self {\n Self::Plus => \"+\",\n Self::Minus => \"-\",\n Self::Not => \"!\",\n Self::Tilde => \"~\",\n Self::Delete => \"delete\",\n Self::TypeOf => \"typeof\",\n Self::Void => \"void\",\n }\n }\n}\n\nimpl std::fmt::Display for UnaryOp {\n #[inline]\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n write!(f, \"{}\", self.as_str())\n }\n}\n" }, { "path": "core/ast/src/expression/operator/update/mod.rs", "content": "//! Update expression nodes.\n//!\n//! A update expression increments or decrements it's operand and returns a value\n//!\n//! - [Increment and decrement operations][mdn] (`++`, `--`).\n//!\n//! The full list of valid update operators is defined in [`UpdateOp`].\n//!\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#increment_and_decrement\nmod op;\n\nuse crate::{\n Expression, Span, Spanned,\n expression::{Identifier, access::PropertyAccess},\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\npub use op::*;\n\n/// A update expression is an operation with only one operand.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-UpdateExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#increment_and_decrement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Update {\n op: UpdateOp,\n target: Box,\n span: Span,\n}\n\nimpl Update {\n /// Creates a new `Update` AST expression.\n #[inline]\n #[must_use]\n pub fn new(op: UpdateOp, target: UpdateTarget, span: Span) -> Self {\n Self {\n op,\n target: Box::new(target),\n span,\n }\n }\n\n /// Gets the update operation of the expression.\n #[inline]\n #[must_use]\n pub const fn op(&self) -> UpdateOp {\n self.op\n }\n\n /// Gets the target of this update operator.\n #[inline]\n #[must_use]\n pub fn target(&self) -> &UpdateTarget {\n self.target.as_ref()\n }\n}\n\nimpl Spanned for Update {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for Update {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self.op {\n UpdateOp::IncrementPost | UpdateOp::DecrementPost => {\n format!(\"{}{}\", self.target.to_interned_string(interner), self.op)\n }\n UpdateOp::IncrementPre | UpdateOp::DecrementPre => {\n format!(\"{}{}\", self.op, self.target.to_interned_string(interner))\n }\n }\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(op: Update) -> Self {\n Self::Update(op)\n }\n}\n\nimpl VisitWith for Update {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self.target.as_ref() {\n UpdateTarget::Identifier(ident) => visitor.visit_identifier(ident),\n UpdateTarget::PropertyAccess(access) => visitor.visit_property_access(access),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match &mut *self.target {\n UpdateTarget::Identifier(ident) => visitor.visit_identifier_mut(ident),\n UpdateTarget::PropertyAccess(access) => visitor.visit_property_access_mut(access),\n }\n }\n}\n\n/// A update expression can only be performed on identifier expressions or property access expressions.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-UpdateExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#increment_and_decrement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum UpdateTarget {\n /// An [`Identifier`] expression.\n Identifier(Identifier),\n\n /// An [`PropertyAccess`] expression.\n PropertyAccess(PropertyAccess),\n}\n\nimpl ToInternedString for UpdateTarget {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self {\n Self::Identifier(identifier) => identifier.to_interned_string(interner),\n Self::PropertyAccess(access) => access.to_interned_string(interner),\n }\n }\n}\n" }, { "path": "core/ast/src/expression/operator/update/op.rs", "content": "/// A update operator is one that takes a single operand/argument and performs an operation.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-UpdateExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators#increment_and_decrement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum UpdateOp {\n /// The increment operator increments (adds one to) its operand and returns a value.\n ///\n /// Syntax: `x++`\n ///\n /// This operator increments and returns the value after incrementing.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-postfix-increment-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Increment\n IncrementPost,\n\n /// The increment operator increments (adds one to) its operand and returns a value.\n ///\n /// Syntax: `++x`\n ///\n /// This operator increments and returns the value before incrementing.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-prefix-increment-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Increment\n IncrementPre,\n\n /// The decrement operator decrements (subtracts one from) its operand and returns a value.\n ///\n /// Syntax: `x--`\n ///\n /// This operator decrements and returns the value before decrementing.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-postfix-decrement-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Decrement\n DecrementPost,\n\n /// The decrement operator decrements (subtracts one from) its operand and returns a value.\n ///\n /// Syntax: `--x`\n ///\n /// This operator decrements the operand and returns the value after decrementing.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-prefix-decrement-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Decrement\n DecrementPre,\n}\n\nimpl UpdateOp {\n /// Retrieves the operation as a static string.\n const fn as_str(self) -> &'static str {\n match self {\n Self::IncrementPost | Self::IncrementPre => \"++\",\n Self::DecrementPost | Self::DecrementPre => \"--\",\n }\n }\n}\n\nimpl std::fmt::Display for UpdateOp {\n #[inline]\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n write!(f, \"{}\", self.as_str())\n }\n}\n" }, { "path": "core/ast/src/expression/optional.rs", "content": "use super::{Expression, access::PropertyAccessField};\nuse crate::{\n Span, Spanned,\n function::PrivateName,\n join_nodes,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// List of valid operations in an [`Optional`] chain.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum OptionalOperationKind {\n /// A property access (`a?.prop`).\n SimplePropertyAccess {\n /// The field accessed.\n field: PropertyAccessField,\n },\n /// A private property access (`a?.#prop`).\n PrivatePropertyAccess {\n /// The private property accessed.\n field: PrivateName,\n },\n /// A function call (`a?.(arg)`).\n Call {\n /// The args passed to the function call.\n args: Box<[Expression]>,\n },\n}\n\nimpl VisitWith for OptionalOperationKind {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::SimplePropertyAccess { field } => visitor.visit_property_access_field(field),\n Self::PrivatePropertyAccess { field } => visitor.visit_private_name(field),\n Self::Call { args } => {\n for arg in args {\n visitor.visit_expression(arg)?;\n }\n ControlFlow::Continue(())\n }\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::SimplePropertyAccess { field } => visitor.visit_property_access_field_mut(field),\n Self::PrivatePropertyAccess { field } => visitor.visit_private_name_mut(field),\n Self::Call { args } => {\n for arg in args.iter_mut() {\n visitor.visit_expression_mut(arg)?;\n }\n ControlFlow::Continue(())\n }\n }\n }\n}\n\n/// Operation within an [`Optional`] chain.\n///\n/// An operation within an `Optional` chain can be either shorted or non-shorted. A shorted operation\n/// (`?.item`) will force the expression to return `undefined` if the target is `undefined` or `null`.\n/// In contrast, a non-shorted operation (`.prop`) will try to access the property, even if the target\n/// is `undefined` or `null`.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct OptionalOperation {\n kind: OptionalOperationKind,\n shorted: bool,\n span: Span,\n}\n\nimpl OptionalOperation {\n /// Creates a new `OptionalOperation`.\n #[inline]\n #[must_use]\n pub const fn new(kind: OptionalOperationKind, shorted: bool, span: Span) -> Self {\n Self {\n kind,\n shorted,\n span,\n }\n }\n /// Gets the kind of operation.\n #[inline]\n #[must_use]\n pub const fn kind(&self) -> &OptionalOperationKind {\n &self.kind\n }\n\n /// Returns `true` if the operation short-circuits the [`Optional`] chain when the target is\n /// `undefined` or `null`.\n #[inline]\n #[must_use]\n pub const fn shorted(&self) -> bool {\n self.shorted\n }\n}\n\nimpl Spanned for OptionalOperation {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for OptionalOperation {\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = if self.shorted {\n String::from(\"?.\")\n } else {\n if let OptionalOperationKind::SimplePropertyAccess {\n field: PropertyAccessField::Const(name),\n } = &self.kind\n {\n return format!(\".{}\", interner.resolve_expect(name.sym()));\n }\n\n if let OptionalOperationKind::PrivatePropertyAccess { field } = &self.kind {\n return format!(\".#{}\", interner.resolve_expect(field.description()));\n }\n\n String::new()\n };\n match &self.kind {\n OptionalOperationKind::SimplePropertyAccess { field } => match field {\n PropertyAccessField::Const(name) => {\n buf.push_str(&interner.resolve_expect(name.sym()).to_string());\n }\n PropertyAccessField::Expr(expr) => {\n let _ = write!(buf, \"[{}]\", expr.to_interned_string(interner));\n }\n },\n OptionalOperationKind::PrivatePropertyAccess { field } => {\n let _ = write!(buf, \"#{}\", interner.resolve_expect(field.description()));\n }\n OptionalOperationKind::Call { args } => {\n let _ = write!(buf, \"({})\", join_nodes(interner, args));\n }\n }\n buf\n }\n}\n\nimpl VisitWith for OptionalOperation {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_optional_operation_kind(&self.kind)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_optional_operation_kind_mut(&mut self.kind)\n }\n}\n\n/// An optional chain expression, as defined by the [spec].\n///\n/// [Optional chaining][mdn] allows for short-circuiting property accesses and function calls, which\n/// will return `undefined` instead of returning an error if the access target or the call is\n/// either `undefined` or `null`.\n///\n/// An example of optional chaining:\n///\n/// ```Javascript\n/// const adventurer = {\n/// name: 'Alice',\n/// cat: {\n/// name: 'Dinah'\n/// }\n/// };\n///\n/// console.log(adventurer.cat?.name); // Dinah\n/// console.log(adventurer.dog?.name); // undefined\n/// ```\n///\n/// [spec]: https://tc39.es/ecma262/multipage/ecmascript-language-expressions.html#prod-OptionalExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Optional_chaining\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Optional {\n target: Box,\n chain: Box<[OptionalOperation]>,\n span: Span,\n}\n\nimpl Optional {\n /// Creates a new `Optional` expression.\n #[inline]\n #[must_use]\n pub fn new(target: Expression, chain: Box<[OptionalOperation]>, span: Span) -> Self {\n Self {\n target: Box::new(target),\n chain,\n span,\n }\n }\n\n /// Gets the target of this `Optional` expression.\n #[inline]\n #[must_use]\n pub fn target(&self) -> &Expression {\n self.target.as_ref()\n }\n\n /// Gets the chain of accesses and calls that will be applied to the target at runtime.\n #[inline]\n #[must_use]\n pub fn chain(&self) -> &[OptionalOperation] {\n self.chain.as_ref()\n }\n}\n\nimpl Spanned for Optional {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl From for Expression {\n fn from(opt: Optional) -> Self {\n Self::Optional(opt)\n }\n}\n\nimpl ToInternedString for Optional {\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = self.target.to_interned_string(interner);\n\n for item in &*self.chain {\n buf.push_str(&item.to_interned_string(interner));\n }\n\n buf\n }\n}\n\nimpl VisitWith for Optional {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.target)?;\n for op in &*self.chain {\n visitor.visit_optional_operation(op)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.target)?;\n for op in &mut *self.chain {\n visitor.visit_optional_operation_mut(op)?;\n }\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/expression/parenthesized.rs", "content": "use super::Expression;\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// A parenthesized expression.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-grouping-operator\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Grouping\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Parenthesized {\n pub(crate) expression: Box,\n span: Span,\n}\n\nimpl Parenthesized {\n /// Creates a parenthesized expression.\n #[inline]\n #[must_use]\n pub fn new(expression: Expression, span: Span) -> Self {\n Self {\n expression: Box::new(expression),\n span,\n }\n }\n\n /// Gets the expression of this parenthesized expression.\n #[inline]\n #[must_use]\n pub const fn expression(&self) -> &Expression {\n &self.expression\n }\n}\n\nimpl Spanned for Parenthesized {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl From for Expression {\n fn from(p: Parenthesized) -> Self {\n Self::Parenthesized(p)\n }\n}\n\nimpl ToInternedString for Parenthesized {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\"({})\", self.expression.to_interned_string(interner))\n }\n}\n\nimpl VisitWith for Parenthesized {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.expression)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.expression)\n }\n}\n" }, { "path": "core/ast/src/expression/regexp.rs", "content": "//! This module contains the ECMAScript representation regular expressions.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-literals-regular-expression-literals\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_expressions\n\nuse std::ops::ControlFlow;\n\nuse boa_interner::{Interner, Sym, ToInternedString};\n\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\n\nuse super::Expression;\n\n/// Regular expressions in ECMAScript.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-literals-regular-expression-literals\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_expressions\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\npub struct RegExpLiteral {\n pattern: Sym,\n flags: Sym,\n span: Span,\n}\n\nimpl RegExpLiteral {\n /// Create a new [`RegExpLiteral`].\n #[inline]\n #[must_use]\n pub const fn new(pattern: Sym, flags: Sym, span: Span) -> Self {\n Self {\n pattern,\n flags,\n span,\n }\n }\n\n /// Get the pattern part of the [`RegExpLiteral`].\n #[inline]\n #[must_use]\n pub const fn pattern(&self) -> Sym {\n self.pattern\n }\n\n /// Get the flags part of the [`RegExpLiteral`].\n #[inline]\n #[must_use]\n pub const fn flags(&self) -> Sym {\n self.flags\n }\n}\n\nimpl Spanned for RegExpLiteral {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for RegExpLiteral {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n let pattern = interner.resolve_expect(self.pattern);\n let flags = interner.resolve_expect(self.flags);\n format!(\"/{pattern}/{flags}\")\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(value: RegExpLiteral) -> Self {\n Self::RegExpLiteral(value)\n }\n}\n\nimpl VisitWith for RegExpLiteral {\n #[inline]\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_sym(&self.pattern)?;\n visitor.visit_sym(&self.flags)\n }\n\n #[inline]\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_sym_mut(&mut self.pattern)?;\n visitor.visit_sym_mut(&mut self.flags)\n }\n}\n" }, { "path": "core/ast/src/expression/spread.rs", "content": "use boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\n\nuse super::Expression;\n\n/// The `spread` operator allows an iterable such as an array expression or string to be\n/// expanded.\n///\n/// Syntax: `...x`\n///\n/// It expands array expressions or strings in places where zero or more arguments (for\n/// function calls) or elements (for array literals)\n/// are expected, or an object expression to be expanded in places where zero or more key-value\n/// pairs (for object literals) are expected.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-SpreadElement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Spread_syntax\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Spread {\n target: Box,\n span: Span,\n}\n\nimpl Spread {\n /// Creates a [`Spread`] AST Expression.\n #[inline]\n #[must_use]\n pub fn new(target: Expression, span: Span) -> Self {\n Self {\n target: Box::new(target),\n span,\n }\n }\n\n /// Gets the target expression to be expanded by the spread operator.\n #[inline]\n #[must_use]\n pub const fn target(&self) -> &Expression {\n &self.target\n }\n}\n\nimpl Spanned for Spread {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for Spread {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\"...{}\", self.target().to_interned_string(interner))\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(spread: Spread) -> Self {\n Self::Spread(spread)\n }\n}\n\nimpl VisitWith for Spread {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.target)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.target)\n }\n}\n" }, { "path": "core/ast/src/expression/tagged_template.rs", "content": "use super::Expression;\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, Sym, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// A [`TaggedTemplate`][moz] expression, as defined by the [spec].\n///\n/// `TaggedTemplate`s are a type of template literals that are parsed by a custom function to generate\n/// arbitrary objects from the inner strings and expressions.\n///\n/// [moz]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Template_literals#tagged_templates\n/// [spec]: https://tc39.es/ecma262/#sec-tagged-templates\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct TaggedTemplate {\n tag: Box,\n raws: Box<[Sym]>,\n cookeds: Box<[Option]>,\n exprs: Box<[Expression]>,\n identifier: u64,\n span: Span,\n}\n\nimpl TaggedTemplate {\n /// Creates a new tagged template with a tag, the list of raw strings, the cooked strings and\n /// the expressions.\n #[inline]\n #[must_use]\n pub fn new(\n tag: Expression,\n raws: Box<[Sym]>,\n cookeds: Box<[Option]>,\n exprs: Box<[Expression]>,\n identifier: u64,\n span: Span,\n ) -> Self {\n Self {\n tag: tag.into(),\n raws,\n cookeds,\n exprs,\n identifier,\n span,\n }\n }\n\n /// Gets the tag function of the template.\n #[inline]\n #[must_use]\n pub const fn tag(&self) -> &Expression {\n &self.tag\n }\n\n /// Gets the inner raw strings of the template.\n #[inline]\n #[must_use]\n pub const fn raws(&self) -> &[Sym] {\n &self.raws\n }\n\n /// Gets the cooked strings of the template.\n #[inline]\n #[must_use]\n pub const fn cookeds(&self) -> &[Option] {\n &self.cookeds\n }\n\n /// Gets the interpolated expressions of the template.\n #[inline]\n #[must_use]\n pub const fn exprs(&self) -> &[Expression] {\n &self.exprs\n }\n\n /// Gets the unique identifier of the template.\n #[inline]\n #[must_use]\n pub const fn identifier(&self) -> u64 {\n self.identifier\n }\n}\n\nimpl Spanned for TaggedTemplate {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToInternedString for TaggedTemplate {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = format!(\"{}`\", self.tag.to_interned_string(interner));\n let mut exprs = self.exprs.iter();\n\n for raw in &self.raws {\n let _ = write!(buf, \"{}\", interner.resolve_expect(*raw));\n if let Some(expr) = exprs.next() {\n let _ = write!(buf, \"${{{}}}\", expr.to_interned_string(interner));\n }\n }\n buf.push('`');\n\n buf\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(template: TaggedTemplate) -> Self {\n Self::TaggedTemplate(template)\n }\n}\n\nimpl VisitWith for TaggedTemplate {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.tag)?;\n for raw in &*self.raws {\n visitor.visit_sym(raw)?;\n }\n for cooked in self.cookeds.iter().flatten() {\n visitor.visit_sym(cooked)?;\n }\n for expr in &*self.exprs {\n visitor.visit_expression(expr)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.tag)?;\n for raw in &mut *self.raws {\n visitor.visit_sym_mut(raw)?;\n }\n for cooked in self.cookeds.iter_mut().flatten() {\n visitor.visit_sym_mut(cooked)?;\n }\n for expr in &mut *self.exprs {\n visitor.visit_expression_mut(expr)?;\n }\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/expression/this.rs", "content": "//! `this` ECMAScript expression.\n\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse super::Expression;\n\n/// ECMAScript's `this` expression AST node.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\npub struct This {\n span: Span,\n}\n\nimpl This {\n /// Creates a new This AST Expression.\n #[inline]\n #[must_use]\n pub const fn new(span: Span) -> Self {\n Self { span }\n }\n}\n\nimpl Spanned for This {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(value: This) -> Self {\n Expression::This(value)\n }\n}\n\nimpl ToInternedString for This {\n #[inline]\n fn to_interned_string(&self, _interner: &Interner) -> String {\n String::from(\"this\")\n }\n}\n\nimpl VisitWith for This {\n fn visit_with<'a, V>(&'a self, _visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, _visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/expression/yield.rs", "content": "use boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse crate::{\n Span, Spanned,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\n\nuse super::Expression;\n\n/// The `yield` keyword is used to pause and resume a generator function\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-YieldExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/yield\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Yield {\n target: Option>,\n delegate: bool,\n span: Span,\n}\n\nimpl Yield {\n /// Creates a [`Yield`] AST Expression.\n #[inline]\n #[must_use]\n pub fn new(expr: Option, delegate: bool, span: Span) -> Self {\n Self {\n target: expr.map(Box::new),\n delegate,\n span,\n }\n }\n\n /// Gets the target expression of this `Yield` statement.\n #[inline]\n pub fn target(&self) -> Option<&Expression> {\n self.target.as_ref().map(Box::as_ref)\n }\n\n /// Returns `true` if this `Yield` statement delegates to another generator or iterable object.\n #[inline]\n #[must_use]\n pub const fn delegate(&self) -> bool {\n self.delegate\n }\n}\n\nimpl Spanned for Yield {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(r#yield: Yield) -> Self {\n Self::Yield(r#yield)\n }\n}\n\nimpl ToInternedString for Yield {\n #[inline]\n fn to_interned_string(&self, interner: &Interner) -> String {\n let y = if self.delegate { \"yield*\" } else { \"yield\" };\n if let Some(ex) = self.target() {\n format!(\"{y} {}\", ex.to_interned_string(interner))\n } else {\n y.to_owned()\n }\n }\n}\n\nimpl VisitWith for Yield {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(expr) = &self.target {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(expr) = &mut self.target {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n}\n" }, { "path": "core/ast/src/function/arrow_function.rs", "content": "use super::{FormalParameterList, FunctionBody};\nuse crate::operations::{ContainsSymbol, contains};\nuse crate::scope::FunctionScopes;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{LinearSpan, LinearSpanIgnoreEq, Span, Spanned};\nuse crate::{\n expression::{Expression, Identifier},\n join_nodes,\n};\nuse boa_interner::{Interner, ToIndentedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// An arrow function expression, as defined by the [spec].\n///\n/// An [arrow function][mdn] expression is a syntactically compact alternative to a regular function\n/// expression. Arrow function expressions are ill suited as methods, and they cannot be used as\n/// constructors. Arrow functions cannot be used as constructors and will throw an error when\n/// used with new.\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ArrowFunction\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/Arrow_functions\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ArrowFunction {\n pub(crate) name: Option,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n span: Span,\n}\n\nimpl ArrowFunction {\n /// Creates a new `ArrowFunctionDecl` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(\n name: Option,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n span: Span,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n span,\n }\n }\n\n /// Gets the name of the arrow function.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Option {\n self.name\n }\n\n /// Sets the name of the arrow function.\n #[inline]\n pub fn set_name(&mut self, name: Option) {\n self.name = name;\n }\n\n /// Gets the list of parameters of the arrow function.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the arrow function.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns the scopes of the arrow function.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the arrow function contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl Spanned for ArrowFunction {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToIndentedString for ArrowFunction {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = format!(\"({}\", join_nodes(interner, self.parameters.as_ref()));\n if self.body().statements().is_empty() {\n buf.push_str(\") => {}\");\n } else {\n let _ = write!(\n buf,\n \") => {{\\n{}{}}}\",\n self.body.to_indented_string(interner, indentation + 1),\n \" \".repeat(indentation)\n );\n }\n buf\n }\n}\n\nimpl From for Expression {\n fn from(decl: ArrowFunction) -> Self {\n Self::ArrowFunction(decl)\n }\n}\n\nimpl VisitWith for ArrowFunction {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(ident) = &self.name {\n visitor.visit_identifier(ident)?;\n }\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(ident) = &mut self.name {\n visitor.visit_identifier_mut(ident)?;\n }\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/function/async_arrow_function.rs", "content": "use super::{FormalParameterList, FunctionBody};\nuse crate::operations::{ContainsSymbol, contains};\nuse crate::scope::FunctionScopes;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{LinearSpan, LinearSpanIgnoreEq, Span, Spanned};\nuse crate::{\n expression::{Expression, Identifier},\n join_nodes,\n};\nuse boa_interner::{Interner, ToIndentedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// An async arrow function expression, as defined by the [spec].\n///\n/// An [async arrow function][mdn] expression is a syntactically compact alternative to a regular function\n/// expression. Arrow function expressions are ill suited as methods, and they cannot be used as\n/// constructors. Arrow functions cannot be used as constructors and will throw an error when\n/// used with new.\n///\n/// [spec]: https://tc39.es/ecma262/#prod-AsyncArrowFunction\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/Arrow_functions\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct AsyncArrowFunction {\n pub(crate) name: Option,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n\n span: Span,\n}\n\nimpl AsyncArrowFunction {\n /// Creates a new `AsyncArrowFunction` AST Expression.\n #[inline]\n #[must_use]\n pub fn new(\n name: Option,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n span: Span,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n span,\n }\n }\n\n /// Gets the name of the async arrow function.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Option {\n self.name\n }\n\n /// Sets the name of the async arrow function.\n #[inline]\n pub fn set_name(&mut self, name: Option) {\n self.name = name;\n }\n\n /// Gets the list of parameters of the async arrow function.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the async arrow function.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns the scopes of the async arrow function.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the function declaration contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl Spanned for AsyncArrowFunction {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToIndentedString for AsyncArrowFunction {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = format!(\"async ({}\", join_nodes(interner, self.parameters.as_ref()));\n if self.body().statements().is_empty() {\n buf.push_str(\") => {}\");\n } else {\n let _ = write!(\n buf,\n \") => {{\\n{}{}}}\",\n self.body.to_indented_string(interner, indentation + 1),\n \" \".repeat(indentation)\n );\n }\n buf\n }\n}\n\nimpl From for Expression {\n fn from(decl: AsyncArrowFunction) -> Self {\n Self::AsyncArrowFunction(decl)\n }\n}\n\nimpl VisitWith for AsyncArrowFunction {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(ident) = &self.name {\n visitor.visit_identifier(ident)?;\n }\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(ident) = &mut self.name {\n visitor.visit_identifier_mut(ident)?;\n }\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/function/async_function.rs", "content": "//! Async Function Expression.\n\nuse super::{FormalParameterList, FunctionBody};\nuse crate::{\n Declaration, LinearSpan, LinearSpanIgnoreEq, Span, Spanned, block_to_string,\n expression::{Expression, Identifier},\n join_nodes,\n operations::{ContainsSymbol, contains},\n scope::{FunctionScopes, Scope},\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// An async function declaration.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-AsyncFunctionDeclaration\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct AsyncFunctionDeclaration {\n name: Identifier,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n}\n\nimpl AsyncFunctionDeclaration {\n /// Creates a new async function declaration.\n #[inline]\n #[must_use]\n pub fn new(\n name: Identifier,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n }\n }\n\n /// Gets the name of the async function declaration.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Identifier {\n self.name\n }\n\n /// Gets the list of parameters of the async function declaration.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the async function declaration.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Gets the scopes of the async function declaration.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the async function declaration contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl ToIndentedString for AsyncFunctionDeclaration {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"async function {}({}) {}\",\n interner.resolve_expect(self.name.sym()),\n join_nodes(interner, self.parameters.as_ref()),\n block_to_string(&self.body.statements, interner, indentation)\n )\n }\n}\n\nimpl VisitWith for AsyncFunctionDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_identifier(&self.name)?;\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_identifier_mut(&mut self.name)?;\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n\nimpl From for Declaration {\n #[inline]\n fn from(f: AsyncFunctionDeclaration) -> Self {\n Self::AsyncFunctionDeclaration(f)\n }\n}\n\n/// An async function expression.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-AsyncFunctionExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct AsyncFunctionExpression {\n pub(crate) name: Option,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) has_binding_identifier: bool,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) name_scope: Option,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n\n span: Span,\n}\n\nimpl AsyncFunctionExpression {\n /// Creates a new async function expression.\n #[inline]\n #[must_use]\n pub fn new(\n name: Option,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n has_binding_identifier: bool,\n span: Span,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n has_binding_identifier,\n name_scope: None,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n span,\n }\n }\n\n /// Gets the name of the async function expression.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Option {\n self.name\n }\n\n /// Gets the list of parameters of the async function expression.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the async function expression.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns whether the async function expression has a binding identifier.\n #[inline]\n #[must_use]\n pub const fn has_binding_identifier(&self) -> bool {\n self.has_binding_identifier\n }\n\n /// Gets the name scope of the async function expression.\n #[inline]\n #[must_use]\n pub const fn name_scope(&self) -> Option<&Scope> {\n self.name_scope.as_ref()\n }\n\n /// Gets the scopes of the async function expression.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the async function expression contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl Spanned for AsyncFunctionExpression {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToIndentedString for AsyncFunctionExpression {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = \"async function\".to_owned();\n if self.has_binding_identifier\n && let Some(name) = self.name\n {\n let _ = write!(buf, \" {}\", interner.resolve_expect(name.sym()));\n }\n let _ = write!(buf, \"({}\", join_nodes(interner, self.parameters.as_ref()));\n if self.body().statements().is_empty() {\n buf.push_str(\") {}\");\n } else {\n let _ = write!(\n buf,\n \") {{\\n{}{}}}\",\n self.body.to_indented_string(interner, indentation + 1),\n \" \".repeat(indentation)\n );\n }\n buf\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(expr: AsyncFunctionExpression) -> Self {\n Self::AsyncFunctionExpression(expr)\n }\n}\n\nimpl VisitWith for AsyncFunctionExpression {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(ident) = &self.name {\n visitor.visit_identifier(ident)?;\n }\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(ident) = &mut self.name {\n visitor.visit_identifier_mut(ident)?;\n }\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/function/async_generator.rs", "content": "//! Async Generator Expression\n\nuse super::{FormalParameterList, FunctionBody};\nuse crate::operations::{ContainsSymbol, contains};\nuse crate::scope::{FunctionScopes, Scope};\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{\n Declaration, Spanned, block_to_string,\n expression::{Expression, Identifier},\n join_nodes,\n};\nuse crate::{LinearSpan, LinearSpanIgnoreEq, Span};\nuse boa_interner::{Interner, ToIndentedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// An async generator declaration.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-AsyncGeneratorDeclaration\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function*\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct AsyncGeneratorDeclaration {\n name: Identifier,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n}\n\nimpl AsyncGeneratorDeclaration {\n /// Creates a new async generator declaration.\n #[inline]\n #[must_use]\n pub fn new(\n name: Identifier,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n }\n }\n\n /// Gets the name of the async generator declaration.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Identifier {\n self.name\n }\n\n /// Gets the list of parameters of the async generator declaration.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the async generator declaration.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Gets the scopes of the async generator declaration.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the async generator declaration contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl ToIndentedString for AsyncGeneratorDeclaration {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"async function* {}({}) {}\",\n interner.resolve_expect(self.name.sym()),\n join_nodes(interner, self.parameters.as_ref()),\n block_to_string(&self.body.statements, interner, indentation)\n )\n }\n}\n\nimpl VisitWith for AsyncGeneratorDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_identifier(&self.name)?;\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_identifier_mut(&mut self.name)?;\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n\nimpl From for Declaration {\n #[inline]\n fn from(f: AsyncGeneratorDeclaration) -> Self {\n Self::AsyncGeneratorDeclaration(f)\n }\n}\n\n/// An async generator expression.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-AsyncGeneratorExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function*\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct AsyncGeneratorExpression {\n pub(crate) name: Option,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) has_binding_identifier: bool,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) name_scope: Option,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n\n span: Span,\n}\n\nimpl AsyncGeneratorExpression {\n /// Creates a new async generator expression.\n #[inline]\n #[must_use]\n pub fn new(\n name: Option,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n has_binding_identifier: bool,\n span: Span,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n has_binding_identifier,\n name_scope: None,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n span,\n }\n }\n\n /// Gets the name of the async generator expression.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Option {\n self.name\n }\n\n /// Gets the list of parameters of the async generator expression.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the async generator expression.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns whether the async generator expression has a binding identifier.\n #[inline]\n #[must_use]\n pub const fn has_binding_identifier(&self) -> bool {\n self.has_binding_identifier\n }\n\n /// Gets the name scope of the async generator expression.\n #[inline]\n #[must_use]\n pub const fn name_scope(&self) -> Option<&Scope> {\n self.name_scope.as_ref()\n }\n\n /// Gets the scopes of the async generator expression.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the async generator expression contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl Spanned for AsyncGeneratorExpression {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToIndentedString for AsyncGeneratorExpression {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = \"async function*\".to_owned();\n if self.has_binding_identifier\n && let Some(name) = self.name\n {\n let _ = write!(buf, \" {}\", interner.resolve_expect(name.sym()));\n }\n let _ = write!(\n buf,\n \"({}) {}\",\n join_nodes(interner, self.parameters.as_ref()),\n block_to_string(&self.body.statements, interner, indentation)\n );\n\n buf\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(expr: AsyncGeneratorExpression) -> Self {\n Self::AsyncGeneratorExpression(expr)\n }\n}\n\nimpl VisitWith for AsyncGeneratorExpression {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(ident) = &self.name {\n visitor.visit_identifier(ident)?;\n }\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(ident) = &mut self.name {\n visitor.visit_identifier_mut(ident)?;\n }\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/function/class.rs", "content": "use super::{FormalParameterList, FunctionBody, FunctionExpression};\nuse crate::{\n Declaration, LinearPosition, LinearSpan, LinearSpanIgnoreEq, Span, Spanned, block_to_string,\n expression::{Expression, Identifier},\n join_nodes,\n operations::{ContainsSymbol, contains},\n property::{MethodDefinitionKind, PropertyName},\n scope::{FunctionScopes, Scope},\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, Sym, ToIndentedString, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\nuse std::hash::Hash;\n\n/// A class declaration.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ClassDeclaration\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/class\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ClassDeclaration {\n name: Identifier,\n pub(crate) super_ref: Option,\n pub(crate) constructor: Option,\n pub(crate) elements: Box<[ClassElement]>,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) name_scope: Scope,\n}\n\nimpl ClassDeclaration {\n /// Creates a new class declaration.\n #[inline]\n #[must_use]\n pub fn new(\n name: Identifier,\n super_ref: Option,\n constructor: Option,\n elements: Box<[ClassElement]>,\n ) -> Self {\n Self {\n name,\n super_ref,\n constructor,\n elements,\n name_scope: Scope::default(),\n }\n }\n\n /// Returns the name of the class declaration.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Identifier {\n self.name\n }\n\n /// Returns the super class ref of the class declaration.\n #[inline]\n #[must_use]\n pub const fn super_ref(&self) -> Option<&Expression> {\n self.super_ref.as_ref()\n }\n\n /// Returns the constructor of the class declaration.\n #[inline]\n #[must_use]\n pub const fn constructor(&self) -> Option<&FunctionExpression> {\n self.constructor.as_ref()\n }\n\n /// Gets the list of all fields defined on the class declaration.\n #[inline]\n #[must_use]\n pub const fn elements(&self) -> &[ClassElement] {\n &self.elements\n }\n\n /// Gets the scope containing the class name binding.\n #[inline]\n #[must_use]\n pub const fn name_scope(&self) -> &Scope {\n &self.name_scope\n }\n}\n\nimpl ToIndentedString for ClassDeclaration {\n fn to_indented_string(&self, interner: &Interner, indent_n: usize) -> String {\n let mut buf = format!(\"class {}\", interner.resolve_expect(self.name.sym()));\n if let Some(super_ref) = self.super_ref.as_ref() {\n let _ = write!(buf, \" extends {}\", super_ref.to_interned_string(interner));\n }\n if self.elements.is_empty() && self.constructor().is_none() {\n buf.push_str(\" {}\");\n return buf;\n }\n let indentation = \" \".repeat(indent_n + 1);\n buf.push_str(\" {\\n\");\n if let Some(expr) = &self.constructor {\n let _ = writeln!(\n buf,\n \"{indentation}constructor({}) {}\",\n join_nodes(interner, expr.parameters().as_ref()),\n block_to_string(&expr.body.statements, interner, indent_n + 1)\n );\n }\n for element in &self.elements {\n buf.push_str(&element.to_indented_string(interner, indent_n));\n }\n buf.push('}');\n buf\n }\n}\n\nimpl VisitWith for ClassDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_identifier(&self.name)?;\n if let Some(expr) = &self.super_ref {\n visitor.visit_expression(expr)?;\n }\n if let Some(func) = &self.constructor {\n visitor.visit_function_expression(func)?;\n }\n for elem in &*self.elements {\n visitor.visit_class_element(elem)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_identifier_mut(&mut self.name)?;\n if let Some(expr) = &mut self.super_ref {\n visitor.visit_expression_mut(expr)?;\n }\n if let Some(func) = &mut self.constructor {\n visitor.visit_function_expression_mut(func)?;\n }\n for elem in &mut *self.elements {\n visitor.visit_class_element_mut(elem)?;\n }\n ControlFlow::Continue(())\n }\n}\n\nimpl From for Declaration {\n fn from(f: ClassDeclaration) -> Self {\n Self::ClassDeclaration(Box::new(f))\n }\n}\n\n/// A class expression.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ClassExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/class\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ClassExpression {\n pub(crate) name: Option,\n pub(crate) super_ref: Option,\n pub(crate) constructor: Option,\n pub(crate) elements: Box<[ClassElement]>,\n\n span: Span,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) name_scope: Option,\n}\n\nimpl ClassExpression {\n /// Creates a new class expression.\n #[inline]\n #[must_use]\n pub fn new(\n name: Option,\n super_ref: Option,\n constructor: Option,\n elements: Box<[ClassElement]>,\n has_binding_identifier: bool,\n span: Span,\n ) -> Self {\n let name_scope = if has_binding_identifier {\n Some(Scope::default())\n } else {\n None\n };\n Self {\n name,\n super_ref,\n constructor,\n elements,\n span,\n name_scope,\n }\n }\n\n /// Returns the name of the class expression.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Option {\n self.name\n }\n\n /// Returns the super class ref of the class expression.\n #[inline]\n #[must_use]\n pub const fn super_ref(&self) -> Option<&Expression> {\n self.super_ref.as_ref()\n }\n\n /// Returns the constructor of the class expression.\n #[inline]\n #[must_use]\n pub const fn constructor(&self) -> Option<&FunctionExpression> {\n self.constructor.as_ref()\n }\n\n /// Gets the list of all fields defined on the class expression.\n #[inline]\n #[must_use]\n pub const fn elements(&self) -> &[ClassElement] {\n &self.elements\n }\n\n /// Gets the scope containing the class name binding if it exists.\n #[inline]\n #[must_use]\n pub const fn name_scope(&self) -> Option<&Scope> {\n self.name_scope.as_ref()\n }\n}\n\nimpl Spanned for ClassExpression {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToIndentedString for ClassExpression {\n fn to_indented_string(&self, interner: &Interner, indent_n: usize) -> String {\n let mut buf = \"class\".to_string();\n if self.name_scope.is_some()\n && let Some(name) = self.name\n {\n let _ = write!(buf, \" {}\", interner.resolve_expect(name.sym()));\n }\n if let Some(super_ref) = self.super_ref.as_ref() {\n let _ = write!(buf, \" extends {}\", super_ref.to_interned_string(interner));\n }\n if self.elements.is_empty() && self.constructor().is_none() {\n buf.push_str(\" {}\");\n return buf;\n }\n let indentation = \" \".repeat(indent_n + 1);\n buf.push_str(\" {\\n\");\n if let Some(expr) = &self.constructor {\n let _ = writeln!(\n buf,\n \"{indentation}constructor({}) {}\",\n join_nodes(interner, expr.parameters().as_ref()),\n block_to_string(&expr.body.statements, interner, indent_n + 1)\n );\n }\n for element in &self.elements {\n buf.push_str(&element.to_indented_string(interner, indent_n));\n }\n buf.push('}');\n buf\n }\n}\n\nimpl From for Expression {\n fn from(expr: ClassExpression) -> Self {\n Self::ClassExpression(Box::new(expr))\n }\n}\n\nimpl VisitWith for ClassExpression {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(ident) = &self.name {\n visitor.visit_identifier(ident)?;\n }\n if let Some(expr) = &self.super_ref {\n visitor.visit_expression(expr)?;\n }\n if let Some(func) = &self.constructor {\n visitor.visit_function_expression(func)?;\n }\n for elem in &*self.elements {\n visitor.visit_class_element(elem)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(ident) = &mut self.name {\n visitor.visit_identifier_mut(ident)?;\n }\n if let Some(expr) = &mut self.super_ref {\n visitor.visit_expression_mut(expr)?;\n }\n if let Some(func) = &mut self.constructor {\n visitor.visit_function_expression_mut(func)?;\n }\n for elem in &mut *self.elements {\n visitor.visit_class_element_mut(elem)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// The body of a class' static block, as defined by the [spec].\n///\n/// Just an alias for [`Script`](crate::Script), since it has the same exact semantics.\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ClassStaticBlockBody\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct StaticBlockBody {\n pub(crate) body: FunctionBody,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n}\n\nimpl StaticBlockBody {\n /// Creates a new static block body.\n #[inline]\n #[must_use]\n pub fn new(body: FunctionBody) -> Self {\n Self {\n body,\n scopes: FunctionScopes::default(),\n }\n }\n\n /// Gets the body static block.\n #[inline]\n #[must_use]\n pub const fn statements(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Gets the scopes of the static block body.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n}\n\n/// An element that can be within a class.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ClassElement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum ClassElement {\n /// A method definition.\n MethodDefinition(ClassMethodDefinition),\n\n /// A field definition.\n FieldDefinition(ClassFieldDefinition),\n\n /// A static field definition, accessible from the class constructor object\n StaticFieldDefinition(ClassFieldDefinition),\n\n /// A private field definition, only accessible inside the class declaration.\n PrivateFieldDefinition(PrivateFieldDefinition),\n\n /// A private static field definition, only accessible from static methods and fields inside the\n /// class declaration.\n PrivateStaticFieldDefinition(PrivateFieldDefinition),\n\n /// A static block, where a class can have initialization logic for its static fields.\n StaticBlock(StaticBlockBody),\n}\n\n/// A non-private class element field definition.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-FieldDefinition\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ClassFieldDefinition {\n pub(crate) name: PropertyName,\n pub(crate) initializer: Option,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Scope,\n}\n\nimpl ClassFieldDefinition {\n /// Creates a new class field definition.\n #[inline]\n #[must_use]\n pub fn new(name: PropertyName, initializer: Option) -> Self {\n Self {\n name,\n initializer,\n scope: Scope::default(),\n }\n }\n\n /// Returns the name of the class field definition.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> &PropertyName {\n &self.name\n }\n\n /// Returns the initializer of the class field definition.\n #[inline]\n #[must_use]\n pub const fn initializer(&self) -> Option<&Expression> {\n self.initializer.as_ref()\n }\n\n /// Returns the scope of the class field definition.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> &Scope {\n &self.scope\n }\n}\n\n/// A private class element field definition.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-FieldDefinition\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct PrivateFieldDefinition {\n pub(crate) name: PrivateName,\n pub(crate) initializer: Option,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Scope,\n}\n\nimpl PrivateFieldDefinition {\n /// Creates a new private field definition.\n #[inline]\n #[must_use]\n pub fn new(name: PrivateName, initializer: Option) -> Self {\n Self {\n name,\n initializer,\n scope: Scope::default(),\n }\n }\n\n /// Returns the name of the private field definition.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> &PrivateName {\n &self.name\n }\n\n /// Returns the initializer of the private field definition.\n #[inline]\n #[must_use]\n pub const fn initializer(&self) -> Option<&Expression> {\n self.initializer.as_ref()\n }\n\n /// Returns the scope of the private field definition.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> &Scope {\n &self.scope\n }\n}\n\nimpl ToIndentedString for ClassElement {\n fn to_indented_string(&self, interner: &Interner, indent_n: usize) -> String {\n let indentation = \" \".repeat(indent_n + 1);\n match self {\n Self::MethodDefinition(m) => m.to_indented_string(interner, indent_n),\n Self::FieldDefinition(field) => match &field.initializer {\n Some(expr) => {\n format!(\n \"{indentation}{} = {};\\n\",\n field.name.to_interned_string(interner),\n expr.to_no_indent_string(interner, indent_n + 1)\n )\n }\n None => {\n format!(\n \"{indentation}{};\\n\",\n field.name.to_interned_string(interner),\n )\n }\n },\n Self::StaticFieldDefinition(field) => match &field.initializer {\n Some(expr) => {\n format!(\n \"{indentation}static {} = {};\\n\",\n field.name.to_interned_string(interner),\n expr.to_no_indent_string(interner, indent_n + 1)\n )\n }\n None => {\n format!(\n \"{indentation}static {};\\n\",\n field.name.to_interned_string(interner),\n )\n }\n },\n Self::PrivateFieldDefinition(PrivateFieldDefinition {\n name, initializer, ..\n }) => match initializer {\n Some(expr) => {\n format!(\n \"{indentation}#{} = {};\\n\",\n interner.resolve_expect(name.description()),\n expr.to_no_indent_string(interner, indent_n + 1)\n )\n }\n None => {\n format!(\n \"{indentation}#{};\\n\",\n interner.resolve_expect(name.description()),\n )\n }\n },\n Self::PrivateStaticFieldDefinition(PrivateFieldDefinition {\n name,\n initializer,\n ..\n }) => match initializer {\n Some(expr) => {\n format!(\n \"{indentation}static #{} = {};\\n\",\n interner.resolve_expect(name.description()),\n expr.to_no_indent_string(interner, indent_n + 1)\n )\n }\n None => {\n format!(\n \"{indentation}static #{};\\n\",\n interner.resolve_expect(name.description()),\n )\n }\n },\n Self::StaticBlock(block) => {\n format!(\n \"{indentation}static {}\\n\",\n block_to_string(&block.body.statements, interner, indent_n + 1)\n )\n }\n }\n }\n}\n\nimpl VisitWith for ClassElement {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::MethodDefinition(m) => {\n match &m.name {\n ClassElementName::PropertyName(pn) => {\n visitor.visit_property_name(pn)?;\n }\n ClassElementName::PrivateName(pn) => {\n visitor.visit_private_name(pn)?;\n }\n }\n visitor.visit_formal_parameter_list(&m.parameters)?;\n visitor.visit_function_body(&m.body)\n }\n Self::FieldDefinition(field) | Self::StaticFieldDefinition(field) => {\n visitor.visit_property_name(&field.name)?;\n if let Some(expr) = &field.initializer {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::PrivateFieldDefinition(PrivateFieldDefinition {\n name, initializer, ..\n })\n | Self::PrivateStaticFieldDefinition(PrivateFieldDefinition {\n name,\n initializer,\n ..\n }) => {\n visitor.visit_private_name(name)?;\n if let Some(expr) = initializer {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::StaticBlock(block) => visitor.visit_function_body(&block.body),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::MethodDefinition(m) => {\n match m.name {\n ClassElementName::PropertyName(ref mut pn) => {\n visitor.visit_property_name_mut(pn)?;\n }\n ClassElementName::PrivateName(ref mut pn) => {\n visitor.visit_private_name_mut(pn)?;\n }\n }\n visitor.visit_formal_parameter_list_mut(&mut m.parameters)?;\n visitor.visit_function_body_mut(&mut m.body)\n }\n Self::FieldDefinition(field) | Self::StaticFieldDefinition(field) => {\n visitor.visit_property_name_mut(&mut field.name)?;\n if let Some(expr) = &mut field.initializer {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::PrivateFieldDefinition(PrivateFieldDefinition {\n name, initializer, ..\n })\n | Self::PrivateStaticFieldDefinition(PrivateFieldDefinition {\n name,\n initializer,\n ..\n }) => {\n visitor.visit_private_name_mut(name)?;\n if let Some(expr) = initializer {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::StaticBlock(block) => visitor.visit_function_body_mut(&mut block.body),\n }\n }\n}\n\n/// A method definition.\n///\n/// This type is specific to class method definitions.\n/// It includes private names and the information about whether the method is static or not.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-MethodDefinition\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ClassMethodDefinition {\n name: ClassElementName,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) contains_direct_eval: bool,\n kind: MethodDefinitionKind,\n is_static: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n}\n\nimpl ClassMethodDefinition {\n /// Creates a new class method definition.\n #[inline]\n #[must_use]\n pub fn new(\n name: ClassElementName,\n parameters: FormalParameterList,\n body: FunctionBody,\n kind: MethodDefinitionKind,\n is_static: bool,\n start_linear_pos: LinearPosition,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n\n let linear_span = LinearSpan::new(start_linear_pos, body.linear_pos_end());\n\n Self {\n name,\n parameters,\n body,\n contains_direct_eval,\n kind,\n is_static,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n }\n }\n\n /// Returns the name of the class method definition.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> &ClassElementName {\n &self.name\n }\n\n /// Returns the parameters of the class method definition.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Returns the body of the class method definition.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns the kind of the class method definition.\n #[inline]\n #[must_use]\n pub const fn kind(&self) -> MethodDefinitionKind {\n self.kind\n }\n\n /// Returns whether the class method definition is static.\n #[inline]\n #[must_use]\n pub const fn is_static(&self) -> bool {\n self.is_static\n }\n\n /// Returns whether the class method definition is private.\n #[inline]\n #[must_use]\n pub const fn is_private(&self) -> bool {\n self.name.is_private()\n }\n\n /// Gets the scopes of the class method definition.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the class method definition contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl ToIndentedString for ClassMethodDefinition {\n fn to_indented_string(&self, interner: &Interner, indent_n: usize) -> String {\n let indentation = \" \".repeat(indent_n + 1);\n let prefix = match (self.is_static, &self.kind) {\n (true, MethodDefinitionKind::Get) => \"static get \",\n (true, MethodDefinitionKind::Set) => \"static set \",\n (true, MethodDefinitionKind::Ordinary) => \"static \",\n (true, MethodDefinitionKind::Generator) => \"static *\",\n (true, MethodDefinitionKind::AsyncGenerator) => \"static async *\",\n (true, MethodDefinitionKind::Async) => \"static async \",\n (false, MethodDefinitionKind::Get) => \"get \",\n (false, MethodDefinitionKind::Set) => \"set \",\n (false, MethodDefinitionKind::Ordinary) => \"\",\n (false, MethodDefinitionKind::Generator) => \"*\",\n (false, MethodDefinitionKind::AsyncGenerator) => \"async *\",\n (false, MethodDefinitionKind::Async) => \"async \",\n };\n let name = self.name.to_interned_string(interner);\n let parameters = join_nodes(interner, self.parameters.as_ref());\n let body = block_to_string(&self.body.statements, interner, indent_n + 1);\n format!(\"{indentation}{prefix}{name}({parameters}) {body}\\n\")\n }\n}\n\n/// A class element name.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ClassElementName\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum ClassElementName {\n /// A property name.\n PropertyName(PropertyName),\n\n /// A private name.\n PrivateName(PrivateName),\n}\n\nimpl ClassElementName {\n /// Returns whether the class element name is private.\n #[inline]\n #[must_use]\n pub const fn is_private(&self) -> bool {\n matches!(self, Self::PrivateName(_))\n }\n}\n\nimpl ToInternedString for ClassElementName {\n fn to_interned_string(&self, interner: &Interner) -> String {\n match &self {\n Self::PropertyName(name) => name.to_interned_string(interner),\n Self::PrivateName(name) => format!(\"#{}\", interner.resolve_expect(name.description())),\n }\n }\n}\n\n/// A private name as defined by the [spec].\n///\n/// [spec]: https://tc39.es/ecma262/#sec-private-names\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\npub struct PrivateName {\n /// The `[[Description]]` internal slot of the private name.\n description: Sym,\n span: Span,\n}\n\nimpl PrivateName {\n /// Create a new private name.\n #[inline]\n #[must_use]\n pub const fn new(description: Sym, span: Span) -> Self {\n Self { description, span }\n }\n\n /// Get the description of the private name.\n #[inline]\n #[must_use]\n pub const fn description(&self) -> Sym {\n self.description\n }\n}\n\nimpl Spanned for PrivateName {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl VisitWith for PrivateName {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_sym(&self.description)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_sym_mut(&mut self.description)\n }\n}\n" }, { "path": "core/ast/src/function/generator.rs", "content": "use super::{FormalParameterList, FunctionBody};\nuse crate::{\n Declaration, LinearSpan, LinearSpanIgnoreEq, Span, Spanned, block_to_string,\n expression::{Expression, Identifier},\n join_nodes,\n operations::{ContainsSymbol, contains},\n scope::{FunctionScopes, Scope},\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// A generator declaration.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-GeneratorDeclaration\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/function*\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct GeneratorDeclaration {\n name: Identifier,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n}\n\nimpl GeneratorDeclaration {\n /// Creates a new generator declaration.\n #[inline]\n #[must_use]\n pub fn new(\n name: Identifier,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n }\n }\n\n /// Gets the name of the generator declaration.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Identifier {\n self.name\n }\n\n /// Gets the list of parameters of the generator declaration.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the generator declaration.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns the scopes of the generator declaration.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the generator declaration contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl ToIndentedString for GeneratorDeclaration {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"function* {}({}) {}\",\n interner.resolve_expect(self.name.sym()),\n join_nodes(interner, self.parameters.as_ref()),\n block_to_string(&self.body.statements, interner, indentation)\n )\n }\n}\n\nimpl VisitWith for GeneratorDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_identifier(&self.name)?;\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_identifier_mut(&mut self.name)?;\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n\nimpl From for Declaration {\n #[inline]\n fn from(f: GeneratorDeclaration) -> Self {\n Self::GeneratorDeclaration(f)\n }\n}\n\n/// A generator expression.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-GeneratorExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/function*\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct GeneratorExpression {\n pub(crate) name: Option,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) has_binding_identifier: bool,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) name_scope: Option,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n\n span: Span,\n}\n\nimpl GeneratorExpression {\n /// Creates a new generator expression.\n #[inline]\n #[must_use]\n pub fn new(\n name: Option,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n has_binding_identifier: bool,\n span: Span,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n has_binding_identifier,\n name_scope: None,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n span,\n }\n }\n\n /// Gets the name of the generator expression.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Option {\n self.name\n }\n\n /// Gets the list of parameters of the generator expression.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the generator expression.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns whether the generator expression has a binding identifier.\n #[inline]\n #[must_use]\n pub const fn has_binding_identifier(&self) -> bool {\n self.has_binding_identifier\n }\n\n /// Gets the name scope of the generator expression.\n #[inline]\n #[must_use]\n pub const fn name_scope(&self) -> Option<&Scope> {\n self.name_scope.as_ref()\n }\n\n /// Gets the scopes of the generator expression.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the generator expression contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl Spanned for GeneratorExpression {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToIndentedString for GeneratorExpression {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = \"function*\".to_owned();\n if self.has_binding_identifier\n && let Some(name) = self.name\n {\n let _ = write!(buf, \" {}\", interner.resolve_expect(name.sym()));\n }\n let _ = write!(\n buf,\n \"({}) {}\",\n join_nodes(interner, self.parameters.as_ref()),\n block_to_string(&self.body.statements, interner, indentation)\n );\n\n buf\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(expr: GeneratorExpression) -> Self {\n Self::GeneratorExpression(expr)\n }\n}\n\nimpl VisitWith for GeneratorExpression {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(ident) = &self.name {\n visitor.visit_identifier(ident)?;\n }\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(ident) = &mut self.name {\n visitor.visit_identifier_mut(ident)?;\n }\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/function/mod.rs", "content": "//! This module contains Function and Class AST nodes.\n//!\n//! ECMAScript defines multiple types of functions and classes.\n//! They are split into different AST nodes to reduce ambiguity and to make the AST more readable.\n//!\n//! - Functions:\n//! - [`FunctionDeclaration`]\n//! - [`FunctionExpression`]\n//! - Async functions:\n//! - [`AsyncFunctionDeclaration`]\n//! - [`AsyncFunctionExpression`]\n//! - Generators\n//! - [`GeneratorDeclaration`]\n//! - [`GeneratorExpression`]\n//! - Async Generators\n//! - [`AsyncGeneratorDeclaration`]\n//! - [`AsyncGeneratorExpression`]\n//! - Arrow Functions\n//! - [`ArrowFunction`]\n//! - Async Arrow Functions\n//! - [`AsyncArrowFunction`]\n//! - Classes\n//! - [`ClassDeclaration`]\n//! - [`ClassExpression`]\n\nmod arrow_function;\nmod async_arrow_function;\nmod async_function;\nmod async_generator;\nmod class;\nmod generator;\nmod ordinary_function;\nmod parameters;\n\nuse std::ops::ControlFlow;\n\npub use arrow_function::ArrowFunction;\npub use async_arrow_function::AsyncArrowFunction;\npub use async_function::{AsyncFunctionDeclaration, AsyncFunctionExpression};\npub use async_generator::{AsyncGeneratorDeclaration, AsyncGeneratorExpression};\nuse boa_interner::{Interner, ToIndentedString};\npub use class::{\n ClassDeclaration, ClassElement, ClassElementName, ClassExpression, ClassFieldDefinition,\n ClassMethodDefinition, PrivateFieldDefinition, PrivateName, StaticBlockBody,\n};\npub use generator::{GeneratorDeclaration, GeneratorExpression};\npub use ordinary_function::{FunctionDeclaration, FunctionExpression};\npub use parameters::{FormalParameter, FormalParameterList, FormalParameterListFlags};\n\nuse crate::{\n LinearPosition, Span, Spanned, StatementList, StatementListItem,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\n\n/// A Function body.\n///\n/// Since `Script` and `FunctionBody` have the same semantics, this is currently\n/// only an alias of the former.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-FunctionBody\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct FunctionBody {\n pub(crate) statements: StatementList,\n span: Span,\n}\n\nimpl FunctionBody {\n /// Creates a new `FunctionBody` AST node.\n #[inline]\n #[must_use]\n pub fn new(statements: StatementList, span: Span) -> Self {\n Self { statements, span }\n }\n\n /// Gets the list of statements.\n #[inline]\n #[must_use]\n pub const fn statements(&self) -> &[StatementListItem] {\n self.statements.statements()\n }\n\n /// Gets the statement list.\n #[inline]\n #[must_use]\n pub const fn statement_list(&self) -> &StatementList {\n &self.statements\n }\n\n /// Get the strict mode.\n #[inline]\n #[must_use]\n pub const fn strict(&self) -> bool {\n self.statements.strict()\n }\n\n /// Get end of linear position in source code.\n #[inline]\n #[must_use]\n pub const fn linear_pos_end(&self) -> LinearPosition {\n self.statements.linear_pos_end()\n }\n}\n\nimpl Spanned for FunctionBody {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl ToIndentedString for FunctionBody {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n self.statements.to_indented_string(interner, indentation)\n }\n}\n\nimpl VisitWith for FunctionBody {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for statement in &*self.statements {\n visitor.visit_statement_list_item(statement)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for statement in &mut *self.statements.statements {\n visitor.visit_statement_list_item_mut(statement)?;\n }\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/function/ordinary_function.rs", "content": "use super::{FormalParameterList, FunctionBody};\nuse crate::{\n Declaration, LinearSpan, LinearSpanIgnoreEq, Span, Spanned, block_to_string,\n expression::{Expression, Identifier},\n join_nodes,\n operations::{ContainsSymbol, contains},\n scope::{FunctionScopes, Scope},\n scope_analyzer::{\n analyze_binding_escapes, collect_bindings, optimize_scope_indices_function_constructor,\n },\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// A function declaration.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-FunctionDeclaration\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct FunctionDeclaration {\n name: Identifier,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n linear_span: LinearSpanIgnoreEq,\n}\n\nimpl FunctionDeclaration {\n /// Creates a new function declaration.\n #[inline]\n #[must_use]\n pub fn new(\n name: Identifier,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: LinearSpan,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n linear_span: linear_span.into(),\n }\n }\n\n /// Gets the name of the function declaration.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Identifier {\n self.name\n }\n\n /// Gets the list of parameters of the function declaration.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the function declaration.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Gets the scopes of the function declaration.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> LinearSpan {\n self.linear_span.0\n }\n\n /// Returns `true` if the function declaration contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n}\n\nimpl ToIndentedString for FunctionDeclaration {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"function {}({}) {}\",\n interner.resolve_expect(self.name.sym()),\n join_nodes(interner, self.parameters.as_ref()),\n block_to_string(&self.body.statements, interner, indentation)\n )\n }\n}\n\nimpl VisitWith for FunctionDeclaration {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_identifier(&self.name)?;\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_identifier_mut(&mut self.name)?;\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n\nimpl From for Declaration {\n #[inline]\n fn from(f: FunctionDeclaration) -> Self {\n Self::FunctionDeclaration(f)\n }\n}\n\n/// A function expression.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-FunctionExpression\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug)]\npub struct FunctionExpression {\n pub(crate) name: Option,\n pub(crate) parameters: FormalParameterList,\n pub(crate) body: FunctionBody,\n pub(crate) has_binding_identifier: bool,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) name_scope: Option,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scopes: FunctionScopes,\n\n span: Span,\n\n linear_span: Option,\n}\n\nimpl PartialEq for FunctionExpression {\n fn eq(&self, other: &Self) -> bool {\n // all fields except for `linear_span`\n self.name == other.name\n && self.parameters == other.parameters\n && self.body == other.body\n && self.has_binding_identifier == other.has_binding_identifier\n && self.contains_direct_eval == other.contains_direct_eval\n && self.name_scope == other.name_scope\n && self.scopes == other.scopes\n && self.span == other.span\n }\n}\n\nimpl Spanned for FunctionExpression {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl FunctionExpression {\n /// Creates a new function expression.\n #[inline]\n #[must_use]\n pub fn new(\n name: Option,\n parameters: FormalParameterList,\n body: FunctionBody,\n linear_span: Option,\n has_binding_identifier: bool,\n span: Span,\n ) -> Self {\n let contains_direct_eval = contains(¶meters, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n name,\n parameters,\n body,\n has_binding_identifier,\n name_scope: None,\n contains_direct_eval,\n scopes: FunctionScopes::default(),\n #[allow(clippy::redundant_closure_for_method_calls)]\n linear_span,\n span,\n }\n }\n\n /// Gets the name of the function expression.\n #[inline]\n #[must_use]\n pub const fn name(&self) -> Option {\n self.name\n }\n\n /// Gets the list of parameters of the function expression.\n #[inline]\n #[must_use]\n pub const fn parameters(&self) -> &FormalParameterList {\n &self.parameters\n }\n\n /// Gets the body of the function expression.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &FunctionBody {\n &self.body\n }\n\n /// Returns whether the function expression has a binding identifier.\n #[inline]\n #[must_use]\n pub const fn has_binding_identifier(&self) -> bool {\n self.has_binding_identifier\n }\n\n /// Gets the name scope of the function expression.\n #[inline]\n #[must_use]\n pub const fn name_scope(&self) -> Option<&Scope> {\n self.name_scope.as_ref()\n }\n\n /// Gets the scopes of the function expression.\n #[inline]\n #[must_use]\n pub const fn scopes(&self) -> &FunctionScopes {\n &self.scopes\n }\n\n /// Gets linear span of the function declaration.\n #[inline]\n #[must_use]\n pub const fn linear_span(&self) -> Option {\n self.linear_span\n }\n\n /// Returns `true` if the function expression contains a direct call to `eval`.\n #[inline]\n #[must_use]\n pub const fn contains_direct_eval(&self) -> bool {\n self.contains_direct_eval\n }\n\n /// Analyze the scope of the function expression.\n ///\n /// # Errors\n /// Any scope or binding errors that happened during the analysis.\n pub fn analyze_scope(\n &mut self,\n strict: bool,\n scope: &Scope,\n interner: &Interner,\n ) -> Result<(), &'static str> {\n collect_bindings(self, strict, false, scope, interner)?;\n analyze_binding_escapes(self, false, scope.clone(), interner)?;\n optimize_scope_indices_function_constructor(self, scope);\n Ok(())\n }\n}\n\nimpl ToIndentedString for FunctionExpression {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = \"function\".to_owned();\n if self.has_binding_identifier\n && let Some(name) = self.name\n {\n let _ = write!(buf, \" {}\", interner.resolve_expect(name.sym()));\n }\n let _ = write!(\n buf,\n \"({}) {}\",\n join_nodes(interner, self.parameters.as_ref()),\n block_to_string(&self.body.statements, interner, indentation)\n );\n\n buf\n }\n}\n\nimpl From for Expression {\n #[inline]\n fn from(expr: FunctionExpression) -> Self {\n Self::FunctionExpression(expr)\n }\n}\n\nimpl VisitWith for FunctionExpression {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(ident) = &self.name {\n visitor.visit_identifier(ident)?;\n }\n visitor.visit_formal_parameter_list(&self.parameters)?;\n visitor.visit_function_body(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(ident) = &mut self.name {\n visitor.visit_identifier_mut(ident)?;\n }\n visitor.visit_formal_parameter_list_mut(&mut self.parameters)?;\n visitor.visit_function_body_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/function/parameters.rs", "content": "use crate::{\n declaration::{Binding, Variable},\n expression::Expression,\n operations::bound_names,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse bitflags::bitflags;\nuse boa_interner::{Interner, Sym, ToInternedString};\nuse core::ops::ControlFlow;\nuse rustc_hash::FxHashSet;\n\n/// A list of `FormalParameter`s that describes the parameters of a function, as defined by the [spec].\n///\n/// [spec]: https://tc39.es/ecma262/#prod-FormalParameterList\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, Default, PartialEq)]\npub struct FormalParameterList {\n parameters: Box<[FormalParameter]>,\n flags: FormalParameterListFlags,\n length: u32,\n}\n\nimpl FormalParameterList {\n /// Creates a new empty formal parameter list.\n #[must_use]\n pub fn new() -> Self {\n Self {\n parameters: Box::new([]),\n flags: FormalParameterListFlags::default(),\n length: 0,\n }\n }\n\n /// Creates a `FormalParameterList` from a list of [`FormalParameter`]s.\n #[must_use]\n pub fn from_parameters(parameters: Vec) -> Self {\n let mut flags = FormalParameterListFlags::default();\n let mut length = 0;\n let mut names = FxHashSet::default();\n\n for parameter in ¶meters {\n let parameter_names = bound_names(parameter);\n\n for name in parameter_names {\n if name == Sym::ARGUMENTS {\n flags |= FormalParameterListFlags::HAS_ARGUMENTS;\n }\n if names.contains(&name) {\n flags |= FormalParameterListFlags::HAS_DUPLICATES;\n } else {\n names.insert(name);\n }\n }\n\n if parameter.is_rest_param() {\n flags |= FormalParameterListFlags::HAS_REST_PARAMETER;\n }\n if parameter.init().is_some() {\n flags |= FormalParameterListFlags::HAS_EXPRESSIONS;\n }\n if parameter.is_rest_param() || parameter.init().is_some() || !parameter.is_identifier()\n {\n flags.remove(FormalParameterListFlags::IS_SIMPLE);\n }\n if !(flags.contains(FormalParameterListFlags::HAS_EXPRESSIONS)\n || parameter.is_rest_param()\n || parameter.init().is_some())\n {\n length += 1;\n }\n }\n\n Self {\n parameters: parameters.into(),\n flags,\n length,\n }\n }\n\n /// Returns the length of the parameter list.\n /// Note that this is not equal to the length of the parameters slice.\n #[must_use]\n pub const fn length(&self) -> u32 {\n self.length\n }\n\n /// Returns the parameter list flags.\n #[must_use]\n pub const fn flags(&self) -> FormalParameterListFlags {\n self.flags\n }\n\n /// Indicates if the parameter list is simple.\n #[must_use]\n pub const fn is_simple(&self) -> bool {\n self.flags.contains(FormalParameterListFlags::IS_SIMPLE)\n }\n\n /// Indicates if the parameter list has duplicate parameters.\n #[must_use]\n pub const fn has_duplicates(&self) -> bool {\n self.flags\n .contains(FormalParameterListFlags::HAS_DUPLICATES)\n }\n\n /// Indicates if the parameter list has a rest parameter.\n #[must_use]\n pub const fn has_rest_parameter(&self) -> bool {\n self.flags\n .contains(FormalParameterListFlags::HAS_REST_PARAMETER)\n }\n\n /// Indicates if the parameter list has expressions in it's parameters.\n #[must_use]\n pub const fn has_expressions(&self) -> bool {\n self.flags\n .contains(FormalParameterListFlags::HAS_EXPRESSIONS)\n }\n\n /// Indicates if the parameter list has parameters named 'arguments'.\n #[must_use]\n pub const fn has_arguments(&self) -> bool {\n self.flags.contains(FormalParameterListFlags::HAS_ARGUMENTS)\n }\n}\n\nimpl From> for FormalParameterList {\n fn from(parameters: Vec) -> Self {\n Self::from_parameters(parameters)\n }\n}\n\nimpl From for FormalParameterList {\n fn from(parameter: FormalParameter) -> Self {\n Self::from_parameters(vec![parameter])\n }\n}\n\nimpl AsRef<[FormalParameter]> for FormalParameterList {\n fn as_ref(&self) -> &[FormalParameter] {\n &self.parameters\n }\n}\n\nimpl VisitWith for FormalParameterList {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for parameter in &*self.parameters {\n visitor.visit_formal_parameter(parameter)?;\n }\n\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for parameter in &mut *self.parameters {\n visitor.visit_formal_parameter_mut(parameter)?;\n }\n\n // TODO recompute flags\n ControlFlow::Continue(())\n }\n}\n\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for FormalParameterList {\n fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n let params: Vec = u.arbitrary()?;\n Ok(Self::from(params))\n }\n}\n\nbitflags! {\n /// Flags for a [`FormalParameterList`].\n #[derive(Debug, Copy, Clone, Eq, PartialEq)]\n #[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n pub struct FormalParameterListFlags: u8 {\n /// Has only identifier parameters with no initialization expressions.\n const IS_SIMPLE = 0b0000_0001;\n /// Has any duplicate parameters.\n const HAS_DUPLICATES = 0b0000_0010;\n /// Has a rest parameter.\n const HAS_REST_PARAMETER = 0b0000_0100;\n /// Has any initialization expression.\n const HAS_EXPRESSIONS = 0b0000_1000;\n /// Has an argument with the name `arguments`.\n const HAS_ARGUMENTS = 0b0001_0000;\n }\n}\n\nimpl Default for FormalParameterListFlags {\n fn default() -> Self {\n Self::empty().union(Self::IS_SIMPLE)\n }\n}\n\n/// \"Formal parameter\" is a fancy way of saying \"function parameter\".\n///\n/// In the declaration of a function, the parameters must be identifiers,\n/// not any value like numbers, strings, or objects.\n/// ```text\n/// function foo(formalParameter1, formalParameter2) {\n/// }\n/// ```\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-FormalParameter\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Errors/Missing_formal_parameter\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct FormalParameter {\n variable: Variable,\n is_rest_param: bool,\n}\n\nimpl FormalParameter {\n /// Creates a new formal parameter.\n pub fn new(variable: D, is_rest_param: bool) -> Self\n where\n D: Into,\n {\n Self {\n variable: variable.into(),\n is_rest_param,\n }\n }\n\n /// Gets the variable of the formal parameter\n #[must_use]\n pub const fn variable(&self) -> &Variable {\n &self.variable\n }\n\n /// Gets the initialization node of the formal parameter, if any.\n #[must_use]\n pub const fn init(&self) -> Option<&Expression> {\n self.variable.init()\n }\n\n /// Returns `true` if the parameter is a rest parameter.\n #[must_use]\n pub const fn is_rest_param(&self) -> bool {\n self.is_rest_param\n }\n\n /// Returns `true` if the parameter is an identifier.\n #[must_use]\n pub const fn is_identifier(&self) -> bool {\n matches!(&self.variable.binding(), Binding::Identifier(_))\n }\n}\n\nimpl ToInternedString for FormalParameter {\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = if self.is_rest_param {\n \"...\".to_owned()\n } else {\n String::new()\n };\n buf.push_str(&self.variable.to_interned_string(interner));\n buf\n }\n}\n\nimpl VisitWith for FormalParameter {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_variable(&self.variable)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_variable_mut(&mut self.variable)\n }\n}\n" }, { "path": "core/ast/src/keyword/mod.rs", "content": "//! The `Keyword` AST node, which represents reserved words of the ECMAScript language.\n//!\n//! The [specification][spec] defines keywords as tokens that match an `IdentifierName`, but also\n//! have special meaning in ECMAScript. In ECMAScript, you cannot use these reserved words as variables,\n//! labels, or function names.\n//!\n//! The [MDN documentation][mdn] contains a more extensive explanation about keywords.\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-keywords-and-reserved-words\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Lexical_grammar#Keywords\n\nuse crate::expression::operator::binary::{BinaryOp, RelationalOp};\nuse boa_interner::Sym;\nuse boa_macros::utf16;\nuse std::{convert::TryFrom, error, fmt, str::FromStr};\n\n#[cfg(test)]\nmod tests;\n\n/// List of keywords recognized by the JavaScript grammar.\n///\n/// See the [module-level documentation][self] for more details.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Copy, PartialEq, Eq, Debug)]\npub enum Keyword {\n /// The `await` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AwaitExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/await\n Await,\n\n /// The `async` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AsyncMethod\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function\n Async,\n\n /// The `break` keyword.\n ///\n /// More information:\n /// - [break `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-BreakStatement\n /// [node]: ../node/enum.Node.html#variant.Break\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/break\n Break,\n\n /// The `case` keyword.\n ///\n /// More information:\n /// - [switch `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-CaseClause\n /// [node]: ../node/enum.Node.html#variant.Switch\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/switch\n Case,\n\n /// The `catch` keyword.\n ///\n /// More information:\n /// - [try `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-Catch\n /// [node]: ../node/enum.Node.html#variant.Try\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/try...catch\n Catch,\n\n /// The `class` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-ClassDeclaration\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/class\n Class,\n\n /// The `continue` keyword.\n ///\n /// More information:\n /// - [continue `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-ContinueStatement\n /// [node]: ../node/enum.Node.html#variant.Continue\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/continue\n Continue,\n\n /// The `const` keyword.\n ///\n /// More information:\n /// - [const `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-let-and-const-declarations\n /// [node]: ../node/enum.Node.html#variant.ConstDecl\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/const\n Const,\n\n /// The `debugger` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-debugger-statement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/debugger\n Debugger,\n\n /// The `default` keyword.\n ///\n /// More information:\n /// - [switch `Node` documentation][node]\n /// - [ECMAScript reference default clause][spec-clause]\n /// - [ECMAScript reference default export][spec-export]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.Switch\n /// [spec-clause]: https://tc39.es/ecma262/#prod-DefaultClause\n /// [spec-export]: https://tc39.es/ecma262/#prod-ImportedDefaultBinding\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/default\n Default,\n\n /// The `delete` keyword.\n ///\n /// More information:\n /// - [delete `UnaryOp` documentation][unary]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-delete-operator\n /// [unary]: ../op/enum.UnaryOp.html#variant.Delete\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/delete\n Delete,\n\n /// The `do` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-do-while-statement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/do...while\n Do,\n\n /// The `else` keyword.\n ///\n /// More information:\n /// - [if `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.If\n /// [spec]: https://tc39.es/ecma262/#prod-IfStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/if...else\n Else,\n\n /// The `enum` keyword.\n ///\n /// Future reserved keyword.\n Enum,\n\n /// The `export` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-exports\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/export\n Export,\n\n /// The `extends` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-ClassHeritage\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes/extends\n Extends,\n\n /// The `finally` keyword.\n ///\n /// More information:\n /// - [try `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.Try\n /// [spec]: https://tc39.es/ecma262/#prod-Finally\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/try...catch\n Finally,\n\n /// The `for` keyword.\n ///\n /// More information:\n /// - [for loop `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.ForLoop\n /// [spec]: https://tc39.es/ecma262/#prod-ForDeclaration\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/for\n For,\n\n /// The `function` keyword.\n ///\n /// More information:\n /// - [function `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.FunctionDecl\n /// [spec]: https://tc39.es/ecma262/#sec-terms-and-definitions-function\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/function\n Function,\n\n /// The `if` keyword.\n ///\n /// More information:\n /// - [if `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.If\n /// [spec]: https://tc39.es/ecma262/#prod-IfStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/if...else\n If,\n\n /// The `in` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-RelationalExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/in\n In,\n\n /// The `instanceof` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-instanceofoperator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/instanceof\n InstanceOf,\n\n /// The `import` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-imports\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/import\n Import,\n\n /// The `let` keyword.\n ///\n /// More information:\n /// - [let `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.LetDecl\n /// [spec]: https://tc39.es/ecma262/#sec-let-and-const-declarations\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/let\n Let,\n\n /// The `new` keyword.\n ///\n /// More information:\n /// - [new `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.New\n /// [spec]: https://tc39.es/ecma262/#prod-NewExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/new\n New,\n\n /// The `of` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-for-in-and-for-of-statements\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/for...of\n Of,\n\n /// The `return` keyword\n ///\n /// More information:\n /// - [return `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.Return\n /// [spec]: https://tc39.es/ecma262/#prod-ReturnStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/return\n Return,\n\n /// The `super` keyword\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-super-keyword\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/super\n Super,\n\n /// The `switch` keyword.\n ///\n /// More information:\n /// - [switch `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.Switch\n /// [spec]: https://tc39.es/ecma262/#prod-SwitchStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/switch\n Switch,\n\n /// The `this` keyword.\n ///\n /// More information:\n /// - [this `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.This\n /// [spec]: https://tc39.es/ecma262/#sec-this-keyword\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/this\n This,\n\n /// The `throw` keyword.\n ///\n /// More information:\n /// - [throw `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.Throw\n /// [spec]: https://tc39.es/ecma262/#sec-throw-statement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/throw\n Throw,\n\n /// The `try` keyword.\n ///\n /// More information:\n /// - [try `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.Try\n /// [spec]: https://tc39.es/ecma262/#prod-TryStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/try...catch\n Try,\n\n /// The `typeof` keyword.\n ///\n /// More information:\n /// - [typeof `UnaryOp` documentation][unary]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [unary]: ../op/enum.UnaryOp.html#variant.TypeOf\n /// [spec]: https://tc39.es/ecma262/#sec-typeof-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof\n TypeOf,\n\n /// The `var` keyword.\n ///\n /// More information:\n /// - [var `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.VarDecl\n /// [spec]: https://tc39.es/ecma262/#prod-VariableStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/var\n Var,\n\n /// The `void` keyword.\n ///\n /// More information:\n /// - [void `UnaryOp` documentation][unary]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [unary]: ../op/enum.UnaryOp.html#variant.Void\n /// [spec]: https://tc39.es/ecma262/#sec-void-operator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/void\n Void,\n\n /// The `while` keyword.\n ///\n /// More information:\n /// - [while `Node` documentation][node]\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [node]: ../node/enum.Node.html#variant.While\n /// [spec]: https://tc39.es/ecma262/#prod-grammar-notation-WhileStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/while\n While,\n\n /// The `with` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-WithStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/with\n With,\n\n /// The 'yield' keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-YieldExpression\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/yield\n Yield,\n\n /// The `using` keyword.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/proposal-explicit-resource-management/\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/using\n Using,\n}\n\nimpl Keyword {\n /// Gets the keyword as a binary operation, if this keyword is the `in` or the `instanceof`\n /// keywords.\n #[must_use]\n pub const fn as_binary_op(self) -> Option {\n match self {\n Self::In => Some(BinaryOp::Relational(RelationalOp::In)),\n Self::InstanceOf => Some(BinaryOp::Relational(RelationalOp::InstanceOf)),\n _ => None,\n }\n }\n\n /// Gets the keyword as a tuple of strings.\n #[must_use]\n pub const fn as_str(self) -> (&'static str, &'static [u16]) {\n match self {\n Self::Await => (\"await\", utf16!(\"await\")),\n Self::Async => (\"async\", utf16!(\"async\")),\n Self::Break => (\"break\", utf16!(\"break\")),\n Self::Case => (\"case\", utf16!(\"case\")),\n Self::Catch => (\"catch\", utf16!(\"catch\")),\n Self::Class => (\"class\", utf16!(\"class\")),\n Self::Continue => (\"continue\", utf16!(\"continue\")),\n Self::Const => (\"const\", utf16!(\"const\")),\n Self::Debugger => (\"debugger\", utf16!(\"debugger\")),\n Self::Default => (\"default\", utf16!(\"default\")),\n Self::Delete => (\"delete\", utf16!(\"delete\")),\n Self::Do => (\"do\", utf16!(\"do\")),\n Self::Else => (\"else\", utf16!(\"else\")),\n Self::Enum => (\"enum\", utf16!(\"enum\")),\n Self::Extends => (\"extends\", utf16!(\"extends\")),\n Self::Export => (\"export\", utf16!(\"export\")),\n Self::Finally => (\"finally\", utf16!(\"finally\")),\n Self::For => (\"for\", utf16!(\"for\")),\n Self::Function => (\"function\", utf16!(\"function\")),\n Self::If => (\"if\", utf16!(\"if\")),\n Self::In => (\"in\", utf16!(\"in\")),\n Self::InstanceOf => (\"instanceof\", utf16!(\"instanceof\")),\n Self::Import => (\"import\", utf16!(\"import\")),\n Self::Let => (\"let\", utf16!(\"let\")),\n Self::New => (\"new\", utf16!(\"new\")),\n Self::Of => (\"of\", utf16!(\"of\")),\n Self::Return => (\"return\", utf16!(\"return\")),\n Self::Super => (\"super\", utf16!(\"super\")),\n Self::Switch => (\"switch\", utf16!(\"switch\")),\n Self::This => (\"this\", utf16!(\"this\")),\n Self::Throw => (\"throw\", utf16!(\"throw\")),\n Self::Try => (\"try\", utf16!(\"try\")),\n Self::TypeOf => (\"typeof\", utf16!(\"typeof\")),\n Self::Var => (\"var\", utf16!(\"var\")),\n Self::Void => (\"void\", utf16!(\"void\")),\n Self::While => (\"while\", utf16!(\"while\")),\n Self::With => (\"with\", utf16!(\"with\")),\n Self::Yield => (\"yield\", utf16!(\"yield\")),\n Self::Using => (\"using\", utf16!(\"using\")),\n }\n }\n\n /// Converts the keyword to a symbol in the given interner.\n #[must_use]\n pub const fn to_sym(self) -> Sym {\n match self {\n Self::Await => Sym::AWAIT,\n Self::Async => Sym::ASYNC,\n Self::Break => Sym::BREAK,\n Self::Case => Sym::CASE,\n Self::Catch => Sym::CATCH,\n Self::Class => Sym::CLASS,\n Self::Continue => Sym::CONTINUE,\n Self::Const => Sym::CONST,\n Self::Debugger => Sym::DEBUGGER,\n Self::Default => Sym::DEFAULT,\n Self::Delete => Sym::DELETE,\n Self::Do => Sym::DO,\n Self::Else => Sym::ELSE,\n Self::Enum => Sym::ENUM,\n Self::Export => Sym::EXPORT,\n Self::Extends => Sym::EXTENDS,\n Self::Finally => Sym::FINALLY,\n Self::For => Sym::FOR,\n Self::Function => Sym::FUNCTION,\n Self::If => Sym::IF,\n Self::In => Sym::IN,\n Self::InstanceOf => Sym::INSTANCEOF,\n Self::Import => Sym::IMPORT,\n Self::Let => Sym::LET,\n Self::New => Sym::NEW,\n Self::Of => Sym::OF,\n Self::Return => Sym::RETURN,\n Self::Super => Sym::SUPER,\n Self::Switch => Sym::SWITCH,\n Self::This => Sym::THIS,\n Self::Throw => Sym::THROW,\n Self::Try => Sym::TRY,\n Self::TypeOf => Sym::TYPEOF,\n Self::Var => Sym::VAR,\n Self::Void => Sym::VOID,\n Self::While => Sym::WHILE,\n Self::With => Sym::WITH,\n Self::Yield => Sym::YIELD,\n Self::Using => Sym::USING,\n }\n }\n}\n\nimpl TryFrom for BinaryOp {\n type Error = KeywordToBinaryOpError;\n\n fn try_from(value: Keyword) -> Result {\n value.as_binary_op().ok_or(KeywordToBinaryOpError)\n }\n}\n\n/// Error returned when a [`Keyword`] cannot be converted into a [`BinaryOp`].\n#[derive(Debug, Clone, Copy)]\npub struct KeywordToBinaryOpError;\n\nimpl fmt::Display for KeywordToBinaryOpError {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"keyword is not a binary operator\")\n }\n}\n\nimpl error::Error for KeywordToBinaryOpError {}\n\n/// The error type which is returned from parsing a [`str`] into a [`Keyword`].\n#[derive(Debug, Clone, Copy)]\npub struct KeywordError;\nimpl fmt::Display for KeywordError {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"invalid token\")\n }\n}\n\n// This is important for other errors to wrap this one.\nimpl error::Error for KeywordError {}\n\nimpl FromStr for Keyword {\n type Err = KeywordError;\n fn from_str(s: &str) -> Result {\n match s {\n \"await\" => Ok(Self::Await),\n \"async\" => Ok(Self::Async),\n \"break\" => Ok(Self::Break),\n \"case\" => Ok(Self::Case),\n \"catch\" => Ok(Self::Catch),\n \"class\" => Ok(Self::Class),\n \"continue\" => Ok(Self::Continue),\n \"const\" => Ok(Self::Const),\n \"debugger\" => Ok(Self::Debugger),\n \"default\" => Ok(Self::Default),\n \"delete\" => Ok(Self::Delete),\n \"do\" => Ok(Self::Do),\n \"else\" => Ok(Self::Else),\n \"enum\" => Ok(Self::Enum),\n \"extends\" => Ok(Self::Extends),\n \"export\" => Ok(Self::Export),\n \"finally\" => Ok(Self::Finally),\n \"for\" => Ok(Self::For),\n \"function\" => Ok(Self::Function),\n \"if\" => Ok(Self::If),\n \"in\" => Ok(Self::In),\n \"instanceof\" => Ok(Self::InstanceOf),\n \"import\" => Ok(Self::Import),\n \"let\" => Ok(Self::Let),\n \"new\" => Ok(Self::New),\n \"of\" => Ok(Self::Of),\n \"return\" => Ok(Self::Return),\n \"super\" => Ok(Self::Super),\n \"switch\" => Ok(Self::Switch),\n \"this\" => Ok(Self::This),\n \"throw\" => Ok(Self::Throw),\n \"try\" => Ok(Self::Try),\n \"typeof\" => Ok(Self::TypeOf),\n \"var\" => Ok(Self::Var),\n \"void\" => Ok(Self::Void),\n \"while\" => Ok(Self::While),\n \"with\" => Ok(Self::With),\n \"yield\" => Ok(Self::Yield),\n \"using\" => Ok(Self::Using),\n _ => Err(KeywordError),\n }\n }\n}\n\nimpl fmt::Display for Keyword {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n fmt::Display::fmt(self.as_str().0, f)\n }\n}\n" }, { "path": "core/ast/src/keyword/tests.rs", "content": "#![allow(clippy::cognitive_complexity)]\n\nuse super::*;\n\n/// Gets a list of all the keywords.\nfn all_keywords() -> impl Iterator {\n [\n Keyword::Await,\n Keyword::Async,\n Keyword::Break,\n Keyword::Case,\n Keyword::Catch,\n Keyword::Class,\n Keyword::Continue,\n Keyword::Const,\n Keyword::Debugger,\n Keyword::Default,\n Keyword::Delete,\n Keyword::Do,\n Keyword::Else,\n Keyword::Enum,\n Keyword::Export,\n Keyword::Extends,\n Keyword::Finally,\n Keyword::For,\n Keyword::Function,\n Keyword::If,\n Keyword::In,\n Keyword::InstanceOf,\n Keyword::Import,\n Keyword::Let,\n Keyword::New,\n Keyword::Of,\n Keyword::Return,\n Keyword::Super,\n Keyword::Switch,\n Keyword::This,\n Keyword::Throw,\n Keyword::Try,\n Keyword::TypeOf,\n Keyword::Var,\n Keyword::Void,\n Keyword::While,\n Keyword::With,\n Keyword::Yield,\n ]\n .into_iter()\n}\n\n#[test]\nfn as_binary_op() {\n for k in all_keywords() {\n match k.as_binary_op() {\n Some(BinaryOp::Relational(RelationalOp::InstanceOf)) => {\n assert_eq!(k, Keyword::InstanceOf);\n }\n Some(BinaryOp::Relational(RelationalOp::In)) => assert_eq!(k, Keyword::In),\n None => {\n assert_ne!(k, Keyword::InstanceOf);\n assert_ne!(k, Keyword::In);\n }\n _ => unreachable!(\"unknown binary operator for keyword {k:?} found\"),\n }\n }\n}\n\n#[test]\nfn as_str() {\n for k in all_keywords() {\n match k.as_str() {\n (\"await\", utf16) => {\n assert_eq!(k, Keyword::Await);\n assert_eq!(utf16, utf16!(\"await\"));\n }\n (\"async\", utf16) => {\n assert_eq!(k, Keyword::Async);\n assert_eq!(utf16, utf16!(\"async\"));\n }\n (\"break\", utf16) => {\n assert_eq!(k, Keyword::Break);\n assert_eq!(utf16, utf16!(\"break\"));\n }\n (\"case\", utf16) => {\n assert_eq!(k, Keyword::Case);\n assert_eq!(utf16, utf16!(\"case\"));\n }\n (\"catch\", utf16) => {\n assert_eq!(k, Keyword::Catch);\n assert_eq!(utf16, utf16!(\"catch\"));\n }\n (\"class\", utf16) => {\n assert_eq!(k, Keyword::Class);\n assert_eq!(utf16, utf16!(\"class\"));\n }\n (\"continue\", utf16) => {\n assert_eq!(k, Keyword::Continue);\n assert_eq!(utf16, utf16!(\"continue\"));\n }\n (\"const\", utf16) => {\n assert_eq!(k, Keyword::Const);\n assert_eq!(utf16, utf16!(\"const\"));\n }\n (\"debugger\", utf16) => {\n assert_eq!(k, Keyword::Debugger);\n assert_eq!(utf16, utf16!(\"debugger\"));\n }\n (\"default\", utf16) => {\n assert_eq!(k, Keyword::Default);\n assert_eq!(utf16, utf16!(\"default\"));\n }\n (\"delete\", utf16) => {\n assert_eq!(k, Keyword::Delete);\n assert_eq!(utf16, utf16!(\"delete\"));\n }\n (\"do\", utf16) => {\n assert_eq!(k, Keyword::Do);\n assert_eq!(utf16, utf16!(\"do\"));\n }\n (\"else\", utf16) => {\n assert_eq!(k, Keyword::Else);\n assert_eq!(utf16, utf16!(\"else\"));\n }\n (\"enum\", utf16) => {\n assert_eq!(k, Keyword::Enum);\n assert_eq!(utf16, utf16!(\"enum\"));\n }\n (\"extends\", utf16) => {\n assert_eq!(k, Keyword::Extends);\n assert_eq!(utf16, utf16!(\"extends\"));\n }\n (\"export\", utf16) => {\n assert_eq!(k, Keyword::Export);\n assert_eq!(utf16, utf16!(\"export\"));\n }\n (\"finally\", utf16) => {\n assert_eq!(k, Keyword::Finally);\n assert_eq!(utf16, utf16!(\"finally\"));\n }\n (\"for\", utf16) => {\n assert_eq!(k, Keyword::For);\n assert_eq!(utf16, utf16!(\"for\"));\n }\n (\"function\", utf16) => {\n assert_eq!(k, Keyword::Function);\n assert_eq!(utf16, utf16!(\"function\"));\n }\n (\"if\", utf16) => {\n assert_eq!(k, Keyword::If);\n assert_eq!(utf16, utf16!(\"if\"));\n }\n (\"in\", utf16) => {\n assert_eq!(k, Keyword::In);\n assert_eq!(utf16, utf16!(\"in\"));\n }\n (\"instanceof\", utf16) => {\n assert_eq!(k, Keyword::InstanceOf);\n assert_eq!(utf16, utf16!(\"instanceof\"));\n }\n (\"import\", utf16) => {\n assert_eq!(k, Keyword::Import);\n assert_eq!(utf16, utf16!(\"import\"));\n }\n (\"let\", utf16) => {\n assert_eq!(k, Keyword::Let);\n assert_eq!(utf16, utf16!(\"let\"));\n }\n (\"new\", utf16) => {\n assert_eq!(k, Keyword::New);\n assert_eq!(utf16, utf16!(\"new\"));\n }\n (\"of\", utf16) => {\n assert_eq!(k, Keyword::Of);\n assert_eq!(utf16, utf16!(\"of\"));\n }\n (\"return\", utf16) => {\n assert_eq!(k, Keyword::Return);\n assert_eq!(utf16, utf16!(\"return\"));\n }\n (\"super\", utf16) => {\n assert_eq!(k, Keyword::Super);\n assert_eq!(utf16, utf16!(\"super\"));\n }\n (\"switch\", utf16) => {\n assert_eq!(k, Keyword::Switch);\n assert_eq!(utf16, utf16!(\"switch\"));\n }\n (\"this\", utf16) => {\n assert_eq!(k, Keyword::This);\n assert_eq!(utf16, utf16!(\"this\"));\n }\n (\"throw\", utf16) => {\n assert_eq!(k, Keyword::Throw);\n assert_eq!(utf16, utf16!(\"throw\"));\n }\n (\"try\", utf16) => {\n assert_eq!(k, Keyword::Try);\n assert_eq!(utf16, utf16!(\"try\"));\n }\n (\"typeof\", utf16) => {\n assert_eq!(k, Keyword::TypeOf);\n assert_eq!(utf16, utf16!(\"typeof\"));\n }\n (\"var\", utf16) => {\n assert_eq!(k, Keyword::Var);\n assert_eq!(utf16, utf16!(\"var\"));\n }\n (\"void\", utf16) => {\n assert_eq!(k, Keyword::Void);\n assert_eq!(utf16, utf16!(\"void\"));\n }\n (\"while\", utf16) => {\n assert_eq!(k, Keyword::While);\n assert_eq!(utf16, utf16!(\"while\"));\n }\n (\"with\", utf16) => {\n assert_eq!(k, Keyword::With);\n assert_eq!(utf16, utf16!(\"with\"));\n }\n (\"yield\", utf16) => {\n assert_eq!(k, Keyword::Yield);\n assert_eq!(utf16, utf16!(\"yield\"));\n }\n (_, _) => unreachable!(\"unknown keyword {k:?} found\"),\n }\n }\n}\n\n#[test]\nfn to_sym() {\n for k in all_keywords() {\n match k.to_sym() {\n Sym::AWAIT => assert_eq!(k, Keyword::Await),\n Sym::ASYNC => assert_eq!(k, Keyword::Async),\n Sym::BREAK => assert_eq!(k, Keyword::Break),\n Sym::CASE => assert_eq!(k, Keyword::Case),\n Sym::CATCH => assert_eq!(k, Keyword::Catch),\n Sym::CLASS => assert_eq!(k, Keyword::Class),\n Sym::CONTINUE => assert_eq!(k, Keyword::Continue),\n Sym::CONST => assert_eq!(k, Keyword::Const),\n Sym::DEBUGGER => assert_eq!(k, Keyword::Debugger),\n Sym::DEFAULT => assert_eq!(k, Keyword::Default),\n Sym::DELETE => assert_eq!(k, Keyword::Delete),\n Sym::DO => assert_eq!(k, Keyword::Do),\n Sym::ELSE => assert_eq!(k, Keyword::Else),\n Sym::ENUM => assert_eq!(k, Keyword::Enum),\n Sym::EXPORT => assert_eq!(k, Keyword::Export),\n Sym::EXTENDS => assert_eq!(k, Keyword::Extends),\n Sym::FINALLY => assert_eq!(k, Keyword::Finally),\n Sym::FOR => assert_eq!(k, Keyword::For),\n Sym::FUNCTION => assert_eq!(k, Keyword::Function),\n Sym::IF => assert_eq!(k, Keyword::If),\n Sym::IN => assert_eq!(k, Keyword::In),\n Sym::INSTANCEOF => assert_eq!(k, Keyword::InstanceOf),\n Sym::IMPORT => assert_eq!(k, Keyword::Import),\n Sym::LET => assert_eq!(k, Keyword::Let),\n Sym::NEW => assert_eq!(k, Keyword::New),\n Sym::OF => assert_eq!(k, Keyword::Of),\n Sym::RETURN => assert_eq!(k, Keyword::Return),\n Sym::SUPER => assert_eq!(k, Keyword::Super),\n Sym::SWITCH => assert_eq!(k, Keyword::Switch),\n Sym::THIS => assert_eq!(k, Keyword::This),\n Sym::THROW => assert_eq!(k, Keyword::Throw),\n Sym::TRY => assert_eq!(k, Keyword::Try),\n Sym::TYPEOF => assert_eq!(k, Keyword::TypeOf),\n Sym::VAR => assert_eq!(k, Keyword::Var),\n Sym::VOID => assert_eq!(k, Keyword::Void),\n Sym::WHILE => assert_eq!(k, Keyword::While),\n Sym::WITH => assert_eq!(k, Keyword::With),\n Sym::YIELD => assert_eq!(k, Keyword::Yield),\n _ => unreachable!(\"unknown keyword {k:?} found\"),\n }\n }\n}\n\n#[test]\nfn try_into_binary_op() {\n for k in all_keywords() {\n match k {\n Keyword::InstanceOf | Keyword::In => assert!(BinaryOp::try_from(k).is_ok()),\n Keyword::Await\n | Keyword::Async\n | Keyword::Break\n | Keyword::Case\n | Keyword::Catch\n | Keyword::Class\n | Keyword::Continue\n | Keyword::Const\n | Keyword::Debugger\n | Keyword::Default\n | Keyword::Delete\n | Keyword::Do\n | Keyword::Else\n | Keyword::Enum\n | Keyword::Export\n | Keyword::Extends\n | Keyword::Finally\n | Keyword::For\n | Keyword::Function\n | Keyword::If\n | Keyword::Import\n | Keyword::Let\n | Keyword::New\n | Keyword::Of\n | Keyword::Return\n | Keyword::Super\n | Keyword::Switch\n | Keyword::This\n | Keyword::Throw\n | Keyword::Try\n | Keyword::TypeOf\n | Keyword::Using\n | Keyword::Var\n | Keyword::Void\n | Keyword::While\n | Keyword::With\n | Keyword::Yield => assert!(BinaryOp::try_from(k).is_err()),\n }\n }\n}\n\n#[test]\nfn from_str() {\n for k in all_keywords() {\n let str = k.as_str().0;\n assert_eq!(str.parse::().unwrap(), k);\n }\n\n for invalid in [\"\", \"testing\", \"invalid keyword\"] {\n let result = invalid.parse::();\n let error = result.unwrap_err();\n\n assert_eq!(error.to_string(), \"invalid token\");\n }\n}\n" }, { "path": "core/ast/src/lib.rs", "content": "//! Boa's **`boa_ast`** crate implements an ECMAScript abstract syntax tree.\n//!\n//! # Crate Overview\n//! **`boa_ast`** contains representations of [**Parse Nodes**][grammar] as defined by the ECMAScript\n//! spec. Some `Parse Node`s are not represented by Boa's AST, because a lot of grammar productions\n//! are only used to throw [**Early Errors**][early], and don't influence the evaluation of the AST\n//! itself.\n//!\n//! Boa's AST is mainly split in three main components: [`Declaration`]s, [`Expression`]s and\n//! [`Statement`]s, with [`StatementList`] being the primordial Parse Node that combines\n//! all of them to create a proper AST.\n//!\n//! [grammar]: https://tc39.es/ecma262/#sec-syntactic-grammar\n//! [early]: https://tc39.es/ecma262/#sec-static-semantic-rules\n#![doc = include_str!(\"../ABOUT.md\")]\n#![doc(\n html_logo_url = \"https://raw.githubusercontent.com/boa-dev/boa/main/assets/logo_black.svg\",\n html_favicon_url = \"https://raw.githubusercontent.com/boa-dev/boa/main/assets/logo_black.svg\"\n)]\n#![cfg_attr(not(test), forbid(clippy::unwrap_used))]\n#![allow(\n clippy::module_name_repetitions,\n clippy::too_many_lines,\n clippy::option_if_let_else\n)]\n\nmod module_item_list;\nmod position;\nmod punctuator;\nmod source;\nmod source_text;\nmod statement_list;\n\npub mod declaration;\npub mod expression;\npub mod function;\npub mod keyword;\npub mod operations;\npub mod pattern;\npub mod property;\npub mod scope;\npub mod scope_analyzer;\npub mod statement;\npub mod visitor;\n\nuse boa_interner::{Interner, Sym, ToIndentedString, ToInternedString};\nuse boa_string::{JsStr, JsString};\nuse expression::Identifier;\n\npub use self::{\n declaration::Declaration,\n expression::Expression,\n keyword::Keyword,\n module_item_list::{ModuleItem, ModuleItemList},\n position::{\n LinearPosition, LinearSpan, LinearSpanIgnoreEq, Position, PositionGroup, Span, Spanned,\n },\n punctuator::Punctuator,\n source::{Module, Script},\n source_text::SourceText,\n statement::Statement,\n statement_list::{StatementList, StatementListItem},\n};\n\n/// Utility to join multiple Nodes into a single string.\nfn join_nodes(interner: &Interner, nodes: &[N]) -> String\nwhere\n N: ToInternedString,\n{\n let mut first = true;\n let mut buf = String::new();\n for e in nodes {\n if first {\n first = false;\n } else {\n buf.push_str(\", \");\n }\n buf.push_str(&e.to_interned_string(interner));\n }\n buf\n}\n\n/// Displays the body of a block or statement list.\n///\n/// This includes the curly braces at the start and end. This will not indent the first brace,\n/// but will indent the last brace.\nfn block_to_string(body: &StatementList, interner: &Interner, indentation: usize) -> String {\n if body.statements().is_empty() {\n \"{}\".to_owned()\n } else {\n format!(\n \"{{\\n{}{}}}\",\n body.to_indented_string(interner, indentation + 1),\n \" \".repeat(indentation)\n )\n }\n}\n\n/// Utility trait that adds a `UTF-16` escaped representation to every [`[u16]`][slice].\ntrait ToStringEscaped {\n /// Decodes `self` as an `UTF-16` encoded string, escaping any unpaired surrogates by its\n /// codepoint value.\n fn to_string_escaped(&self) -> String;\n}\n\nimpl ToStringEscaped for [u16] {\n fn to_string_escaped(&self) -> String {\n char::decode_utf16(self.iter().copied())\n .map(|r| match r {\n Ok(c) => String::from(c),\n Err(e) => format!(\"\\\\u{:04X}\", e.unpaired_surrogate()),\n })\n .collect()\n }\n}\n\npub(crate) trait ToJsString {\n fn to_js_string(&self, interner: &Interner) -> JsString;\n}\n\nimpl ToJsString for Sym {\n #[allow(clippy::cast_possible_truncation)]\n fn to_js_string(&self, interner: &Interner) -> JsString {\n let utf16 = interner.resolve_expect(*self).utf16();\n if interner.is_latin1(*self) {\n let bytes: Vec = utf16.iter().map(|&c| c as u8).collect();\n JsString::from(JsStr::latin1(&bytes))\n } else {\n JsString::from(utf16)\n }\n }\n}\n\nimpl ToJsString for Identifier {\n fn to_js_string(&self, interner: &Interner) -> JsString {\n self.sym().to_js_string(interner)\n }\n}\n" }, { "path": "core/ast/src/module_item_list/mod.rs", "content": "//! Module item list AST nodes.\n//!\n//! More information:\n//! - [ECMAScript specification][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-modules\n\nuse crate::{\n StatementListItem,\n declaration::{\n ExportDeclaration, ExportEntry, ExportSpecifier, ImportAttribute, ImportDeclaration,\n ImportEntry, ImportKind, ImportName, IndirectExportEntry, LocalExportEntry,\n ModuleSpecifier, ReExportImportName, ReExportKind,\n },\n operations::{BoundNamesVisitor, bound_names},\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::Sym;\nuse indexmap::IndexSet;\nuse rustc_hash::{FxHashSet, FxHasher};\nuse std::{convert::Infallible, hash::BuildHasherDefault, ops::ControlFlow};\n\n/// Module item list AST node.\n///\n/// It contains a list of module items.\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ModuleItemList\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, Default, PartialEq)]\npub struct ModuleItemList {\n items: Box<[ModuleItem]>,\n}\n\nimpl ModuleItemList {\n /// Gets the list of module items.\n #[inline]\n #[must_use]\n pub const fn items(&self) -> &[ModuleItem] {\n &self.items\n }\n\n /// Abstract operation [`ExportedNames`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-static-semantics-exportednames\n #[inline]\n #[must_use]\n pub fn exported_names(&self) -> Vec {\n #[derive(Debug)]\n struct ExportedItemsVisitor<'vec>(&'vec mut Vec);\n\n impl<'ast> Visitor<'ast> for ExportedItemsVisitor<'_> {\n type BreakTy = Infallible;\n\n fn visit_import_declaration(\n &mut self,\n _: &'ast ImportDeclaration,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n fn visit_statement_list_item(\n &mut self,\n _: &'ast StatementListItem,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n fn visit_export_specifier(\n &mut self,\n node: &'ast ExportSpecifier,\n ) -> ControlFlow {\n self.0.push(node.alias());\n ControlFlow::Continue(())\n }\n fn visit_export_declaration(\n &mut self,\n node: &'ast ExportDeclaration,\n ) -> ControlFlow {\n match node {\n ExportDeclaration::ReExport { kind, .. } => {\n match kind {\n ReExportKind::Namespaced { name: Some(name) } => self.0.push(*name),\n ReExportKind::Namespaced { name: None } => {}\n ReExportKind::Named { names } => {\n for specifier in &**names {\n self.visit_export_specifier(specifier)?;\n }\n }\n }\n ControlFlow::Continue(())\n }\n ExportDeclaration::List(list) => {\n for specifier in &**list {\n self.visit_export_specifier(specifier)?;\n }\n ControlFlow::Continue(())\n }\n ExportDeclaration::VarStatement(var) => {\n BoundNamesVisitor(self.0).visit_var_declaration(var)\n }\n ExportDeclaration::Declaration(decl) => {\n BoundNamesVisitor(self.0).visit_declaration(decl)\n }\n ExportDeclaration::DefaultFunctionDeclaration(_)\n | ExportDeclaration::DefaultGeneratorDeclaration(_)\n | ExportDeclaration::DefaultAsyncFunctionDeclaration(_)\n | ExportDeclaration::DefaultAsyncGeneratorDeclaration(_)\n | ExportDeclaration::DefaultClassDeclaration(_)\n | ExportDeclaration::DefaultAssignmentExpression(_) => {\n self.0.push(Sym::DEFAULT);\n ControlFlow::Continue(())\n }\n }\n }\n }\n\n let mut names = Vec::new();\n\n let _ = ExportedItemsVisitor(&mut names).visit_module_item_list(self);\n\n names\n }\n\n /// Abstract operation [`ExportedBindings`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-static-semantics-exportedbindings\n #[inline]\n #[must_use]\n pub fn exported_bindings(&self) -> FxHashSet {\n #[derive(Debug)]\n struct ExportedBindingsVisitor<'vec>(&'vec mut FxHashSet);\n\n impl<'ast> Visitor<'ast> for ExportedBindingsVisitor<'_> {\n type BreakTy = Infallible;\n\n fn visit_import_declaration(\n &mut self,\n _: &'ast ImportDeclaration,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n fn visit_statement_list_item(\n &mut self,\n _: &'ast StatementListItem,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n fn visit_export_specifier(\n &mut self,\n node: &'ast ExportSpecifier,\n ) -> ControlFlow {\n self.0.insert(node.private_name());\n ControlFlow::Continue(())\n }\n fn visit_export_declaration(\n &mut self,\n node: &'ast ExportDeclaration,\n ) -> ControlFlow {\n let name = match node {\n ExportDeclaration::ReExport { .. } => return ControlFlow::Continue(()),\n ExportDeclaration::List(list) => {\n for specifier in &**list {\n self.visit_export_specifier(specifier)?;\n }\n return ControlFlow::Continue(());\n }\n ExportDeclaration::DefaultAssignmentExpression(expr) => {\n return BoundNamesVisitor(self.0).visit_expression(expr);\n }\n ExportDeclaration::VarStatement(var) => {\n return BoundNamesVisitor(self.0).visit_var_declaration(var);\n }\n ExportDeclaration::Declaration(decl) => {\n return BoundNamesVisitor(self.0).visit_declaration(decl);\n }\n ExportDeclaration::DefaultFunctionDeclaration(f) => f.name(),\n ExportDeclaration::DefaultGeneratorDeclaration(g) => g.name(),\n ExportDeclaration::DefaultAsyncFunctionDeclaration(af) => af.name(),\n ExportDeclaration::DefaultAsyncGeneratorDeclaration(ag) => ag.name(),\n ExportDeclaration::DefaultClassDeclaration(cl) => cl.name(),\n };\n\n self.0.insert(name.sym());\n\n ControlFlow::Continue(())\n }\n }\n\n let mut names = FxHashSet::default();\n\n let _ = ExportedBindingsVisitor(&mut names).visit_module_item_list(self);\n\n names\n }\n\n /// Operation [`ModuleRequests`][spec].\n ///\n /// Gets the list of modules that need to be fetched by the module resolver to link this module.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-static-semantics-modulerequests\n #[inline]\n #[must_use]\n pub fn requests(&self) -> IndexSet> {\n #[derive(Debug)]\n struct RequestsVisitor<'vec>(&'vec mut IndexSet>);\n\n impl<'ast> Visitor<'ast> for RequestsVisitor<'_> {\n type BreakTy = Infallible;\n\n fn visit_statement_list_item(\n &mut self,\n _: &'ast StatementListItem,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n fn visit_module_specifier(\n &mut self,\n node: &'ast ModuleSpecifier,\n ) -> ControlFlow {\n self.0.insert(node.sym());\n ControlFlow::Continue(())\n }\n }\n\n let mut requests = IndexSet::default();\n\n let _ = RequestsVisitor(&mut requests).visit_module_item_list(self);\n\n requests\n }\n\n /// Operation [`ImportEntries`][spec].\n ///\n /// Gets the list of import entries of this module.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-static-semantics-importentries\n #[inline]\n #[must_use]\n pub fn import_entries(&self) -> Vec {\n #[derive(Debug)]\n struct ImportEntriesVisitor<'vec>(&'vec mut Vec);\n\n impl<'ast> Visitor<'ast> for ImportEntriesVisitor<'_> {\n type BreakTy = Infallible;\n\n fn visit_module_item(&mut self, node: &'ast ModuleItem) -> ControlFlow {\n match node {\n ModuleItem::ImportDeclaration(import) => self.visit_import_declaration(import),\n ModuleItem::ExportDeclaration(_) | ModuleItem::StatementListItem(_) => {\n ControlFlow::Continue(())\n }\n }\n }\n\n fn visit_import_declaration(\n &mut self,\n node: &'ast ImportDeclaration,\n ) -> ControlFlow {\n let module = node.specifier().sym();\n let attributes: Box<[ImportAttribute]> = Box::from(node.attributes());\n\n if let Some(default) = node.default() {\n self.0.push(ImportEntry::new(\n module,\n ImportName::Name(Sym::DEFAULT),\n default,\n attributes.clone(),\n ));\n }\n\n match node.kind() {\n ImportKind::DefaultOrUnnamed => {}\n ImportKind::Namespaced { binding } => {\n self.0.push(ImportEntry::new(\n module,\n ImportName::Namespace,\n *binding,\n attributes.clone(),\n ));\n }\n ImportKind::Named { names } => {\n for name in &**names {\n self.0.push(ImportEntry::new(\n module,\n ImportName::Name(name.export_name()),\n name.binding(),\n attributes.clone(),\n ));\n }\n }\n }\n\n ControlFlow::Continue(())\n }\n }\n\n let mut entries = Vec::default();\n\n let _ = ImportEntriesVisitor(&mut entries).visit_module_item_list(self);\n\n entries\n }\n\n /// Operation [`ExportEntries`][spec].\n ///\n /// Gets the list of export entries of this module.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-static-semantics-exportentries\n #[inline]\n #[must_use]\n pub fn export_entries(&self) -> Vec {\n #[derive(Debug)]\n struct ExportEntriesVisitor<'vec>(&'vec mut Vec);\n\n impl<'ast> Visitor<'ast> for ExportEntriesVisitor<'_> {\n type BreakTy = Infallible;\n\n fn visit_module_item(&mut self, node: &'ast ModuleItem) -> ControlFlow {\n match node {\n ModuleItem::ExportDeclaration(import) => self.visit_export_declaration(import),\n ModuleItem::ImportDeclaration(_) | ModuleItem::StatementListItem(_) => {\n ControlFlow::Continue(())\n }\n }\n }\n\n fn visit_export_declaration(\n &mut self,\n node: &'ast ExportDeclaration,\n ) -> ControlFlow {\n let name = match node {\n ExportDeclaration::ReExport {\n kind,\n specifier,\n attributes,\n } => {\n let module = specifier.sym();\n let attrs = attributes.clone();\n\n match kind {\n ReExportKind::Namespaced { name: Some(name) } => {\n self.0.push(\n IndirectExportEntry::new(\n module,\n ReExportImportName::Star,\n *name,\n attrs.clone(),\n )\n .into(),\n );\n }\n ReExportKind::Namespaced { name: None } => {\n self.0.push(ExportEntry::StarReExport {\n module_request: module,\n attributes: attrs.clone(),\n });\n }\n\n ReExportKind::Named { names } => {\n for name in &**names {\n self.0.push(\n IndirectExportEntry::new(\n module,\n ReExportImportName::Name(name.private_name()),\n name.alias(),\n attrs.clone(),\n )\n .into(),\n );\n }\n }\n }\n\n return ControlFlow::Continue(());\n }\n ExportDeclaration::List(names) => {\n for name in &**names {\n self.0.push(\n LocalExportEntry::new(name.private_name(), name.alias()).into(),\n );\n }\n return ControlFlow::Continue(());\n }\n ExportDeclaration::VarStatement(var) => {\n for name in bound_names(var) {\n self.0.push(LocalExportEntry::new(name, name).into());\n }\n return ControlFlow::Continue(());\n }\n ExportDeclaration::Declaration(decl) => {\n for name in bound_names(decl) {\n self.0.push(LocalExportEntry::new(name, name).into());\n }\n return ControlFlow::Continue(());\n }\n ExportDeclaration::DefaultFunctionDeclaration(f) => f.name().sym(),\n ExportDeclaration::DefaultGeneratorDeclaration(g) => g.name().sym(),\n ExportDeclaration::DefaultAsyncFunctionDeclaration(af) => af.name().sym(),\n ExportDeclaration::DefaultAsyncGeneratorDeclaration(ag) => ag.name().sym(),\n ExportDeclaration::DefaultClassDeclaration(c) => c.name().sym(),\n ExportDeclaration::DefaultAssignmentExpression(_) => Sym::DEFAULT_EXPORT,\n };\n\n self.0\n .push(LocalExportEntry::new(name, Sym::DEFAULT).into());\n\n ControlFlow::Continue(())\n }\n }\n\n let mut entries = Vec::default();\n\n let _ = ExportEntriesVisitor(&mut entries).visit_module_item_list(self);\n\n entries\n }\n}\n\nimpl From for ModuleItemList\nwhere\n T: Into>,\n{\n #[inline]\n fn from(items: T) -> Self {\n Self {\n items: items.into(),\n }\n }\n}\n\nimpl VisitWith for ModuleItemList {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for item in &*self.items {\n visitor.visit_module_item(item)?;\n }\n\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for item in &mut *self.items {\n visitor.visit_module_item_mut(item)?;\n }\n\n ControlFlow::Continue(())\n }\n}\n\n/// Module item AST node.\n///\n/// This is an extension over a [`StatementList`](crate::StatementList), which can also include\n/// multiple [`ImportDeclaration`] and [`ExportDeclaration`] nodes, along with\n/// [`StatementListItem`] nodes.\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ModuleItem\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, PartialEq)]\npub enum ModuleItem {\n /// See [`ImportDeclaration`].\n ImportDeclaration(ImportDeclaration),\n /// See [`ExportDeclaration`].\n ExportDeclaration(Box),\n /// See [`StatementListItem`].\n StatementListItem(StatementListItem),\n}\n\nimpl VisitWith for ModuleItem {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::ImportDeclaration(i) => visitor.visit_import_declaration(i),\n Self::ExportDeclaration(e) => visitor.visit_export_declaration(e),\n Self::StatementListItem(s) => visitor.visit_statement_list_item(s),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::ImportDeclaration(i) => visitor.visit_import_declaration_mut(i),\n Self::ExportDeclaration(e) => visitor.visit_export_declaration_mut(e),\n Self::StatementListItem(s) => visitor.visit_statement_list_item_mut(s),\n }\n }\n}\n" }, { "path": "core/ast/src/operations/mod.rs", "content": "//! Definitions of various **Syntax-Directed Operations** used in the [spec].\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-syntax-directed-operations\n\nuse core::ops::ControlFlow;\nuse std::convert::Infallible;\n\nuse boa_interner::{Interner, Sym};\nuse rustc_hash::FxHashSet;\n\nuse crate::{\n Declaration, Expression, LinearSpan, ModuleItem, Script, Statement, StatementList,\n StatementListItem,\n declaration::{\n Binding, ExportDeclaration, ImportDeclaration, LexicalDeclaration, VarDeclaration, Variable,\n },\n expression::{\n Await, Call, Identifier, NewTarget, OptionalOperationKind, SuperCall, This, Yield,\n access::{PrivatePropertyAccess, SuperPropertyAccess},\n literal::PropertyDefinition,\n operator::BinaryInPrivate,\n },\n function::{\n ArrowFunction, AsyncArrowFunction, AsyncFunctionDeclaration, AsyncFunctionExpression,\n AsyncGeneratorDeclaration, AsyncGeneratorExpression, ClassDeclaration, ClassElement,\n ClassElementName, ClassExpression, FormalParameterList, FunctionBody, FunctionDeclaration,\n FunctionExpression, GeneratorDeclaration, GeneratorExpression, PrivateFieldDefinition,\n },\n statement::{\n LabelledItem, With,\n iteration::{ForLoopInitializer, IterableLoopInitializer},\n },\n visitor::{NodeRef, VisitWith, Visitor},\n};\n\n#[cfg(test)]\nmod tests;\n\n/// Represents all the possible symbols searched for by the [`Contains`][contains] operation.\n///\n/// [contains]: https://tc39.es/ecma262/#sec-syntax-directed-operations-contains\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\n#[non_exhaustive]\npub enum ContainsSymbol {\n /// A node with the `super` keyword (`super(args)` or `super.prop`).\n Super,\n /// A super property access (`super.prop`).\n SuperProperty,\n /// A super constructor call (`super(args)`).\n SuperCall,\n /// A yield expression (`yield 5`).\n YieldExpression,\n /// An await expression (`await 4`).\n AwaitExpression,\n /// The new target expression (`new.target`).\n NewTarget,\n /// The body of a class definition.\n ClassBody,\n /// The super class of a class definition.\n ClassHeritage,\n /// A this expression (`this`).\n This,\n /// A method definition.\n MethodDefinition,\n /// The `BindingIdentifier` \"eval\" or \"arguments\".\n EvalOrArguments,\n /// A direct call to `eval`.\n DirectEval,\n}\n\n/// Returns `true` if the node contains the given symbol.\n///\n/// This is equivalent to the [`Contains`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-contains\n#[must_use]\npub fn contains(node: &N, symbol: ContainsSymbol) -> bool\nwhere\n N: VisitWith,\n{\n /// Visitor used by the function to search for a specific symbol in a node.\n #[derive(Debug, Clone, Copy)]\n struct ContainsVisitor(ContainsSymbol);\n\n impl ContainsVisitor {\n fn visit_contains_eval(&mut self, contains_direct_eval: bool) -> ControlFlow<()> {\n if self.0 == ContainsSymbol::DirectEval && contains_direct_eval {\n ControlFlow::Break(())\n } else {\n ControlFlow::Continue(())\n }\n }\n }\n\n impl<'ast> Visitor<'ast> for ContainsVisitor {\n type BreakTy = ();\n\n fn visit_with(&mut self, node: &'ast With) -> ControlFlow {\n self.visit_expression(node.expression())?;\n node.statement().visit_with(self)\n }\n\n fn visit_call(&mut self, node: &'ast Call) -> ControlFlow {\n if self.0 == ContainsSymbol::DirectEval\n && let Expression::Identifier(ident) = node.function().flatten()\n && ident.sym() == Sym::EVAL\n {\n return ControlFlow::Break(());\n }\n\n self.visit_expression(node.function())?;\n for arg in node.args() {\n self.visit_expression(arg)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_identifier(&mut self, node: &'ast Identifier) -> ControlFlow {\n if self.0 == ContainsSymbol::EvalOrArguments\n && (node.sym() == Sym::EVAL || node.sym() == Sym::ARGUMENTS)\n {\n return ControlFlow::Break(());\n }\n ControlFlow::Continue(())\n }\n\n fn visit_function_expression(\n &mut self,\n node: &'ast FunctionExpression,\n ) -> ControlFlow {\n self.visit_contains_eval(node.contains_direct_eval)?;\n ControlFlow::Continue(())\n }\n\n fn visit_function_declaration(\n &mut self,\n node: &'ast FunctionDeclaration,\n ) -> ControlFlow {\n self.visit_contains_eval(node.contains_direct_eval)?;\n ControlFlow::Continue(())\n }\n\n fn visit_async_function_expression(\n &mut self,\n node: &'ast AsyncFunctionExpression,\n ) -> ControlFlow {\n self.visit_contains_eval(node.contains_direct_eval)?;\n ControlFlow::Continue(())\n }\n\n fn visit_async_function_declaration(\n &mut self,\n node: &'ast AsyncFunctionDeclaration,\n ) -> ControlFlow {\n self.visit_contains_eval(node.contains_direct_eval)?;\n ControlFlow::Continue(())\n }\n\n fn visit_generator_expression(\n &mut self,\n node: &'ast GeneratorExpression,\n ) -> ControlFlow {\n self.visit_contains_eval(node.contains_direct_eval)?;\n ControlFlow::Continue(())\n }\n\n fn visit_generator_declaration(\n &mut self,\n node: &'ast GeneratorDeclaration,\n ) -> ControlFlow {\n self.visit_contains_eval(node.contains_direct_eval)?;\n ControlFlow::Continue(())\n }\n\n fn visit_async_generator_expression(\n &mut self,\n node: &'ast AsyncGeneratorExpression,\n ) -> ControlFlow {\n self.visit_contains_eval(node.contains_direct_eval)?;\n ControlFlow::Continue(())\n }\n\n fn visit_async_generator_declaration(\n &mut self,\n node: &'ast AsyncGeneratorDeclaration,\n ) -> ControlFlow {\n self.visit_contains_eval(node.contains_direct_eval)?;\n ControlFlow::Continue(())\n }\n\n fn visit_class_expression(\n &mut self,\n node: &'ast ClassExpression,\n ) -> ControlFlow {\n if !node.elements().is_empty() && self.0 == ContainsSymbol::ClassBody {\n return ControlFlow::Break(());\n }\n\n if node.super_ref().is_some() && self.0 == ContainsSymbol::ClassHeritage {\n return ControlFlow::Break(());\n }\n\n node.visit_with(self)\n }\n\n fn visit_class_declaration(\n &mut self,\n node: &'ast ClassDeclaration,\n ) -> ControlFlow {\n if !node.elements().is_empty() && self.0 == ContainsSymbol::ClassBody {\n return ControlFlow::Break(());\n }\n\n if node.super_ref().is_some() && self.0 == ContainsSymbol::ClassHeritage {\n return ControlFlow::Break(());\n }\n\n node.visit_with(self)\n }\n\n // `ComputedPropertyContains`: https://tc39.es/ecma262/#sec-static-semantics-computedpropertycontains\n fn visit_class_element(&mut self, node: &'ast ClassElement) -> ControlFlow {\n match node {\n ClassElement::MethodDefinition(m) => {\n if self.0 == ContainsSymbol::DirectEval {\n return ControlFlow::Continue(());\n }\n\n if let ClassElementName::PropertyName(name) = m.name() {\n name.visit_with(self)\n } else {\n ControlFlow::Continue(())\n }\n }\n ClassElement::FieldDefinition(field)\n | ClassElement::StaticFieldDefinition(field) => field.name.visit_with(self),\n _ => ControlFlow::Continue(()),\n }\n }\n\n fn visit_property_definition(\n &mut self,\n node: &'ast PropertyDefinition,\n ) -> ControlFlow {\n if let PropertyDefinition::MethodDefinition(m) = node {\n if self.0 == ContainsSymbol::DirectEval {\n return ControlFlow::Continue(());\n }\n\n if self.0 == ContainsSymbol::MethodDefinition {\n return ControlFlow::Break(());\n }\n return m.name().visit_with(self);\n }\n\n node.visit_with(self)\n }\n\n fn visit_arrow_function(\n &mut self,\n node: &'ast ArrowFunction,\n ) -> ControlFlow {\n if ![\n ContainsSymbol::NewTarget,\n ContainsSymbol::SuperProperty,\n ContainsSymbol::SuperCall,\n ContainsSymbol::Super,\n ContainsSymbol::This,\n ContainsSymbol::DirectEval,\n ]\n .contains(&self.0)\n {\n return ControlFlow::Continue(());\n }\n\n node.visit_with(self)\n }\n\n fn visit_async_arrow_function(\n &mut self,\n node: &'ast AsyncArrowFunction,\n ) -> ControlFlow {\n if ![\n ContainsSymbol::NewTarget,\n ContainsSymbol::SuperProperty,\n ContainsSymbol::SuperCall,\n ContainsSymbol::Super,\n ContainsSymbol::This,\n ContainsSymbol::DirectEval,\n ]\n .contains(&self.0)\n {\n return ControlFlow::Continue(());\n }\n\n node.visit_with(self)\n }\n\n fn visit_super_property_access(\n &mut self,\n node: &'ast SuperPropertyAccess,\n ) -> ControlFlow {\n if [ContainsSymbol::SuperProperty, ContainsSymbol::Super].contains(&self.0) {\n return ControlFlow::Break(());\n }\n node.visit_with(self)\n }\n\n fn visit_super_call(&mut self, node: &'ast SuperCall) -> ControlFlow {\n if [ContainsSymbol::SuperCall, ContainsSymbol::Super].contains(&self.0) {\n return ControlFlow::Break(());\n }\n node.visit_with(self)\n }\n\n fn visit_yield(&mut self, node: &'ast Yield) -> ControlFlow {\n if self.0 == ContainsSymbol::YieldExpression {\n return ControlFlow::Break(());\n }\n\n node.visit_with(self)\n }\n\n fn visit_await(&mut self, node: &'ast Await) -> ControlFlow {\n if self.0 == ContainsSymbol::AwaitExpression {\n return ControlFlow::Break(());\n }\n\n node.visit_with(self)\n }\n\n fn visit_this(&mut self, _node: &'ast This) -> ControlFlow {\n if self.0 == ContainsSymbol::This {\n return ControlFlow::Break(());\n }\n ControlFlow::Continue(())\n }\n\n fn visit_new_target(&mut self, _node: &'ast NewTarget) -> ControlFlow {\n if self.0 == ContainsSymbol::NewTarget {\n return ControlFlow::Break(());\n }\n ControlFlow::Continue(())\n }\n }\n\n node.visit_with(&mut ContainsVisitor(symbol)).is_break()\n}\n\n/// Returns true if the node contains an identifier reference with name `arguments`.\n///\n/// This is equivalent to the [`ContainsArguments`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-containsarguments\n#[must_use]\npub fn contains_arguments(node: &N) -> bool\nwhere\n N: VisitWith,\n{\n /// Visitor used by the function to search for an identifier with the name `arguments`.\n #[derive(Debug, Clone, Copy)]\n struct ContainsArgsVisitor;\n\n impl<'ast> Visitor<'ast> for ContainsArgsVisitor {\n type BreakTy = ();\n\n fn visit_identifier(&mut self, node: &'ast Identifier) -> ControlFlow {\n if node.sym() == Sym::ARGUMENTS {\n ControlFlow::Break(())\n } else {\n ControlFlow::Continue(())\n }\n }\n\n fn visit_function_expression(\n &mut self,\n _: &'ast FunctionExpression,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_function_declaration(\n &mut self,\n _: &'ast FunctionDeclaration,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_async_function_expression(\n &mut self,\n _: &'ast AsyncFunctionExpression,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_async_function_declaration(\n &mut self,\n _: &'ast AsyncFunctionDeclaration,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_generator_expression(\n &mut self,\n _: &'ast GeneratorExpression,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_generator_declaration(\n &mut self,\n _: &'ast GeneratorDeclaration,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_async_generator_expression(\n &mut self,\n _: &'ast AsyncGeneratorExpression,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_async_generator_declaration(\n &mut self,\n _: &'ast AsyncGeneratorDeclaration,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_class_element(&mut self, node: &'ast ClassElement) -> ControlFlow {\n if let ClassElement::MethodDefinition(m) = node\n && let ClassElementName::PropertyName(name) = m.name()\n {\n return name.visit_with(self);\n }\n\n node.visit_with(self)\n }\n\n fn visit_property_definition(\n &mut self,\n node: &'ast PropertyDefinition,\n ) -> ControlFlow {\n if let PropertyDefinition::MethodDefinition(m) = node {\n m.name().visit_with(self)\n } else {\n node.visit_with(self)\n }\n }\n }\n node.visit_with(&mut ContainsArgsVisitor).is_break()\n}\n\n/// Returns `true` if `method` has a super call in its parameters or body.\n///\n/// This is equivalent to the [`HasDirectSuper`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-hasdirectsuper\n#[must_use]\n#[inline]\npub fn has_direct_super_new(params: &FormalParameterList, body: &FunctionBody) -> bool {\n contains(params, ContainsSymbol::SuperCall) || contains(body, ContainsSymbol::SuperCall)\n}\n\n/// A container that [`BoundNamesVisitor`] can use to push the found identifiers.\npub(crate) trait IdentList {\n fn add(&mut self, value: Sym, function: bool);\n}\n\nimpl IdentList for Vec {\n fn add(&mut self, value: Sym, _function: bool) {\n self.push(value);\n }\n}\n\nimpl IdentList for Vec<(Sym, bool)> {\n fn add(&mut self, value: Sym, function: bool) {\n self.push((value, function));\n }\n}\n\nimpl IdentList for FxHashSet {\n fn add(&mut self, value: Sym, _function: bool) {\n self.insert(value);\n }\n}\n\n/// The [`Visitor`] used to obtain the bound names of a node.\n#[derive(Debug)]\npub(crate) struct BoundNamesVisitor<'a, T: IdentList>(pub(crate) &'a mut T);\n\nimpl<'ast, T: IdentList> Visitor<'ast> for BoundNamesVisitor<'_, T> {\n type BreakTy = Infallible;\n\n fn visit_identifier(&mut self, node: &'ast Identifier) -> ControlFlow {\n self.0.add(node.sym(), false);\n ControlFlow::Continue(())\n }\n\n fn visit_expression(&mut self, _: &'ast Expression) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_function_expression(\n &mut self,\n node: &'ast FunctionExpression,\n ) -> ControlFlow {\n if let Some(ident) = node.name() {\n self.0.add(ident.sym(), true);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_function_declaration(\n &mut self,\n node: &'ast FunctionDeclaration,\n ) -> ControlFlow {\n self.0.add(node.name().sym(), true);\n ControlFlow::Continue(())\n }\n\n fn visit_generator_expression(\n &mut self,\n node: &'ast GeneratorExpression,\n ) -> ControlFlow {\n if let Some(ident) = node.name() {\n self.0.add(ident.sym(), false);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_generator_declaration(\n &mut self,\n node: &'ast GeneratorDeclaration,\n ) -> ControlFlow {\n self.0.add(node.name().sym(), false);\n ControlFlow::Continue(())\n }\n\n fn visit_async_function_expression(\n &mut self,\n node: &'ast AsyncFunctionExpression,\n ) -> ControlFlow {\n if let Some(ident) = node.name() {\n self.0.add(ident.sym(), false);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_async_function_declaration(\n &mut self,\n node: &'ast AsyncFunctionDeclaration,\n ) -> ControlFlow {\n self.0.add(node.name().sym(), false);\n ControlFlow::Continue(())\n }\n\n fn visit_async_generator_expression(\n &mut self,\n node: &'ast AsyncGeneratorExpression,\n ) -> ControlFlow {\n if let Some(ident) = node.name() {\n self.0.add(ident.sym(), false);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_async_generator_declaration(\n &mut self,\n node: &'ast AsyncGeneratorDeclaration,\n ) -> ControlFlow {\n self.0.add(node.name().sym(), false);\n ControlFlow::Continue(())\n }\n\n fn visit_class_expression(\n &mut self,\n node: &'ast ClassExpression,\n ) -> ControlFlow {\n if let Some(ident) = node.name() {\n self.0.add(ident.sym(), false);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_class_declaration(\n &mut self,\n node: &'ast ClassDeclaration,\n ) -> ControlFlow {\n self.0.add(node.name().sym(), false);\n ControlFlow::Continue(())\n }\n\n fn visit_export_declaration(\n &mut self,\n node: &'ast ExportDeclaration,\n ) -> ControlFlow {\n match node {\n ExportDeclaration::VarStatement(var) => self.visit_var_declaration(var)?,\n ExportDeclaration::Declaration(decl) => self.visit_declaration(decl)?,\n ExportDeclaration::DefaultFunctionDeclaration(f) => {\n self.0.add(f.name().sym(), true);\n }\n ExportDeclaration::DefaultGeneratorDeclaration(g) => {\n self.0.add(g.name().sym(), false);\n }\n ExportDeclaration::DefaultAsyncFunctionDeclaration(af) => {\n self.0.add(af.name().sym(), false);\n }\n ExportDeclaration::DefaultAsyncGeneratorDeclaration(ag) => {\n self.0.add(ag.name().sym(), false);\n }\n ExportDeclaration::DefaultClassDeclaration(cl) => {\n self.0.add(cl.name().sym(), false);\n }\n ExportDeclaration::DefaultAssignmentExpression(_) => {\n self.0.add(Sym::DEFAULT_EXPORT, false);\n }\n ExportDeclaration::ReExport { .. } | ExportDeclaration::List(_) => {}\n }\n\n ControlFlow::Continue(())\n }\n}\n\n/// Returns a list with the bound names of an AST node, which may contain duplicates.\n///\n/// This is equivalent to the [`BoundNames`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-boundnames\n#[must_use]\npub fn bound_names<'a, N>(node: &'a N) -> Vec\nwhere\n &'a N: Into>,\n{\n let mut names = Vec::new();\n let _ = BoundNamesVisitor(&mut names).visit(node.into());\n\n names\n}\n\n/// The [`Visitor`] used to obtain the lexically declared names of a node.\n#[derive(Debug)]\nstruct LexicallyDeclaredNamesVisitor<'a, T: IdentList>(&'a mut T);\n\nimpl<'ast, T: IdentList> Visitor<'ast> for LexicallyDeclaredNamesVisitor<'_, T> {\n type BreakTy = Infallible;\n\n fn visit_script(&mut self, node: &'ast Script) -> ControlFlow {\n top_level_lexicals(node.statements(), self.0);\n ControlFlow::Continue(())\n }\n\n fn visit_function_body(&mut self, node: &'ast FunctionBody) -> ControlFlow {\n top_level_lexicals(node.statement_list(), self.0);\n ControlFlow::Continue(())\n }\n\n fn visit_module_item(&mut self, node: &'ast ModuleItem) -> ControlFlow {\n match node {\n // ModuleItem : ImportDeclaration\n ModuleItem::ImportDeclaration(import) => {\n // 1. Return the BoundNames of ImportDeclaration.\n BoundNamesVisitor(self.0).visit_import_declaration(import)\n }\n\n // ModuleItem : ExportDeclaration\n ModuleItem::ExportDeclaration(export) => {\n // 1. If ExportDeclaration is export VariableStatement, return a new empty List.\n if matches!(export.as_ref(), ExportDeclaration::VarStatement(_)) {\n ControlFlow::Continue(())\n } else {\n // 2. Return the BoundNames of ExportDeclaration.\n BoundNamesVisitor(self.0).visit_export_declaration(export)\n }\n }\n\n // ModuleItem : StatementListItem\n ModuleItem::StatementListItem(item) => {\n // 1. Return LexicallyDeclaredNames of StatementListItem.\n self.visit_statement_list_item(item)\n }\n }\n }\n\n fn visit_expression(&mut self, _: &'ast Expression) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_statement(&mut self, node: &'ast Statement) -> ControlFlow {\n if let Statement::Labelled(labelled) = node {\n return self.visit_labelled(labelled);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_declaration(&mut self, node: &'ast Declaration) -> ControlFlow {\n BoundNamesVisitor(self.0).visit_declaration(node)\n }\n\n fn visit_labelled_item(&mut self, node: &'ast LabelledItem) -> ControlFlow {\n match node {\n LabelledItem::FunctionDeclaration(f) => {\n BoundNamesVisitor(self.0).visit_function_declaration(f)\n }\n LabelledItem::Statement(_) => ControlFlow::Continue(()),\n }\n }\n\n fn visit_function_expression(\n &mut self,\n node: &'ast FunctionExpression,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_function_declaration(\n &mut self,\n node: &'ast FunctionDeclaration,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_function_expression(\n &mut self,\n node: &'ast AsyncFunctionExpression,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_function_declaration(\n &mut self,\n node: &'ast AsyncFunctionDeclaration,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_generator_expression(\n &mut self,\n node: &'ast GeneratorExpression,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_generator_declaration(\n &mut self,\n node: &'ast GeneratorDeclaration,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_generator_expression(\n &mut self,\n node: &'ast AsyncGeneratorExpression,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_generator_declaration(\n &mut self,\n node: &'ast AsyncGeneratorDeclaration,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_arrow_function(&mut self, node: &'ast ArrowFunction) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_arrow_function(\n &mut self,\n node: &'ast AsyncArrowFunction,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_class_element(&mut self, node: &'ast ClassElement) -> ControlFlow {\n if let ClassElement::StaticBlock(block) = node {\n self.visit_function_body(&block.body)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_import_declaration(\n &mut self,\n node: &'ast ImportDeclaration,\n ) -> ControlFlow {\n BoundNamesVisitor(self.0).visit_import_declaration(node)\n }\n\n fn visit_export_declaration(\n &mut self,\n node: &'ast ExportDeclaration,\n ) -> ControlFlow {\n if matches!(node, ExportDeclaration::VarStatement(_)) {\n return ControlFlow::Continue(());\n }\n BoundNamesVisitor(self.0).visit_export_declaration(node)\n }\n}\n\n/// Returns a list with the lexical bindings of a node, which may contain duplicates.\n///\n/// This is equivalent to the [`LexicallyDeclaredNames`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-lexicallydeclarednames\n#[must_use]\npub fn lexically_declared_names<'a, N>(node: &'a N) -> Vec\nwhere\n &'a N: Into>,\n{\n let mut names = Vec::new();\n let _ = LexicallyDeclaredNamesVisitor(&mut names).visit(node.into());\n names\n}\n\n/// Returns a list with the lexical bindings of a node, which may contain duplicates.\n///\n/// If a declared name originates from a function declaration it is flagged as `true` in the returned\n/// list. (See [B.3.2.4 Changes to Block Static Semantics: Early Errors])\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-lexicallydeclarednames\n/// [changes]: https://tc39.es/ecma262/#sec-block-duplicates-allowed-static-semantics\n#[must_use]\npub fn lexically_declared_names_legacy<'a, N>(node: &'a N) -> Vec<(Sym, bool)>\nwhere\n &'a N: Into>,\n{\n let mut names = Vec::new();\n let _ = LexicallyDeclaredNamesVisitor(&mut names).visit(node.into());\n names\n}\n\n/// The [`Visitor`] used to obtain the var declared names of a node.\n#[derive(Debug)]\nstruct VarDeclaredNamesVisitor<'a>(&'a mut FxHashSet);\n\nimpl<'ast> Visitor<'ast> for VarDeclaredNamesVisitor<'_> {\n type BreakTy = Infallible;\n\n fn visit_script(&mut self, node: &'ast Script) -> ControlFlow {\n top_level_vars(node.statements(), self.0);\n ControlFlow::Continue(())\n }\n\n fn visit_function_body(&mut self, node: &'ast FunctionBody) -> ControlFlow {\n top_level_vars(node.statement_list(), self.0);\n ControlFlow::Continue(())\n }\n\n fn visit_module_item(&mut self, node: &'ast ModuleItem) -> ControlFlow {\n match node {\n // ModuleItem : ImportDeclaration\n ModuleItem::ImportDeclaration(_) => {\n // 1. Return a new empty List.\n ControlFlow::Continue(())\n }\n\n // ModuleItem : ExportDeclaration\n ModuleItem::ExportDeclaration(export) => {\n // 1. If ExportDeclaration is export VariableStatement, return BoundNames of ExportDeclaration.\n if let ExportDeclaration::VarStatement(var) = export.as_ref() {\n BoundNamesVisitor(self.0).visit_var_declaration(var)\n } else {\n // 2. Return a new empty List.\n ControlFlow::Continue(())\n }\n }\n\n ModuleItem::StatementListItem(item) => self.visit_statement_list_item(item),\n }\n }\n\n fn visit_statement(&mut self, node: &'ast Statement) -> ControlFlow {\n match node {\n Statement::Empty\n | Statement::Debugger\n | Statement::Expression(_)\n | Statement::Continue(_)\n | Statement::Break(_)\n | Statement::Return(_)\n | Statement::Throw(_) => ControlFlow::Continue(()),\n Statement::Block(node) => self.visit(node),\n Statement::Var(node) => self.visit(node),\n Statement::If(node) => self.visit(node),\n Statement::DoWhileLoop(node) => self.visit(node),\n Statement::WhileLoop(node) => self.visit(node),\n Statement::ForLoop(node) => self.visit(node),\n Statement::ForInLoop(node) => self.visit(node),\n Statement::ForOfLoop(node) => self.visit(node),\n Statement::Switch(node) => self.visit(node),\n Statement::Labelled(node) => self.visit(node),\n Statement::Try(node) => self.visit(node),\n Statement::With(node) => self.visit(node),\n }\n }\n\n fn visit_statement_list_item(\n &mut self,\n node: &'ast StatementListItem,\n ) -> ControlFlow {\n match node {\n StatementListItem::Statement(stmt) => self.visit_statement(stmt),\n StatementListItem::Declaration(_) => ControlFlow::Continue(()),\n }\n }\n\n fn visit_variable(&mut self, node: &'ast Variable) -> ControlFlow {\n BoundNamesVisitor(self.0).visit_variable(node)\n }\n\n fn visit_if(&mut self, node: &'ast crate::statement::If) -> ControlFlow {\n if let Some(node) = node.else_node() {\n self.visit(node)?;\n }\n self.visit(node.body())\n }\n\n fn visit_do_while_loop(\n &mut self,\n node: &'ast crate::statement::DoWhileLoop,\n ) -> ControlFlow {\n self.visit(node.body())\n }\n\n fn visit_while_loop(\n &mut self,\n node: &'ast crate::statement::WhileLoop,\n ) -> ControlFlow {\n self.visit(node.body())\n }\n\n fn visit_for_loop(\n &mut self,\n node: &'ast crate::statement::ForLoop,\n ) -> ControlFlow {\n if let Some(ForLoopInitializer::Var(node)) = node.init() {\n BoundNamesVisitor(self.0).visit_var_declaration(node)?;\n }\n self.visit(node.body())\n }\n\n fn visit_for_in_loop(\n &mut self,\n node: &'ast crate::statement::ForInLoop,\n ) -> ControlFlow {\n if let IterableLoopInitializer::Var(node) = node.initializer() {\n BoundNamesVisitor(self.0).visit_variable(node)?;\n }\n self.visit(node.body())\n }\n\n fn visit_for_of_loop(\n &mut self,\n node: &'ast crate::statement::ForOfLoop,\n ) -> ControlFlow {\n if let IterableLoopInitializer::Var(node) = node.initializer() {\n BoundNamesVisitor(self.0).visit_variable(node)?;\n }\n self.visit(node.body())\n }\n\n fn visit_with(&mut self, node: &'ast With) -> ControlFlow {\n self.visit(node.statement())\n }\n\n fn visit_switch(&mut self, node: &'ast crate::statement::Switch) -> ControlFlow {\n for case in node.cases() {\n self.visit(case)?;\n }\n if let Some(node) = node.default() {\n self.visit(node)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_labelled_item(&mut self, node: &'ast LabelledItem) -> ControlFlow {\n match node {\n LabelledItem::FunctionDeclaration(_) => ControlFlow::Continue(()),\n LabelledItem::Statement(stmt) => self.visit(stmt),\n }\n }\n\n fn visit_try(&mut self, node: &'ast crate::statement::Try) -> ControlFlow {\n if let Some(node) = node.finally() {\n self.visit(node)?;\n }\n if let Some(node) = node.catch() {\n self.visit(node.block())?;\n }\n self.visit(node.block())\n }\n\n fn visit_function_expression(\n &mut self,\n node: &'ast FunctionExpression,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_function_declaration(\n &mut self,\n node: &'ast FunctionDeclaration,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_function_expression(\n &mut self,\n node: &'ast AsyncFunctionExpression,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_function_declaration(\n &mut self,\n node: &'ast AsyncFunctionDeclaration,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_generator_expression(\n &mut self,\n node: &'ast GeneratorExpression,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_generator_declaration(\n &mut self,\n node: &'ast GeneratorDeclaration,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_generator_expression(\n &mut self,\n node: &'ast AsyncGeneratorExpression,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_async_generator_declaration(\n &mut self,\n node: &'ast AsyncGeneratorDeclaration,\n ) -> ControlFlow {\n self.visit_function_body(node.body())\n }\n\n fn visit_class_element(&mut self, node: &'ast ClassElement) -> ControlFlow {\n if let ClassElement::StaticBlock(block) = node {\n self.visit_function_body(&block.body)?;\n }\n node.visit_with(self)\n }\n\n fn visit_import_declaration(\n &mut self,\n _: &'ast ImportDeclaration,\n ) -> ControlFlow {\n ControlFlow::Continue(())\n }\n\n fn visit_export_declaration(\n &mut self,\n node: &'ast ExportDeclaration,\n ) -> ControlFlow {\n match node {\n ExportDeclaration::VarStatement(var) => {\n BoundNamesVisitor(self.0).visit_var_declaration(var)\n }\n _ => ControlFlow::Continue(()),\n }\n }\n}\n\n/// Returns a set with the var bindings of a node, with no duplicates.\n///\n/// This is equivalent to the [`VarDeclaredNames`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-vardeclarednames\n#[must_use]\npub fn var_declared_names<'a, N>(node: &'a N) -> FxHashSet\nwhere\n &'a N: Into>,\n{\n let mut names = FxHashSet::default();\n let _ = VarDeclaredNamesVisitor(&mut names).visit(node.into());\n names\n}\n\n/// Utility function that collects the top level lexicals of a statement list into `names`.\n///\n/// This is equivalent to the [`TopLevelLexicallyDeclaredNames`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-toplevellexicallydeclarednames\nfn top_level_lexicals(stmts: &StatementList, names: &mut T) {\n for stmt in stmts.statements() {\n if let StatementListItem::Declaration(decl) = stmt {\n match decl.as_ref() {\n // Note\n // At the top level of a function, or script, function declarations are treated like\n // var declarations rather than like lexical declarations.\n Declaration::FunctionDeclaration(_)\n | Declaration::GeneratorDeclaration(_)\n | Declaration::AsyncFunctionDeclaration(_)\n | Declaration::AsyncGeneratorDeclaration(_) => {}\n Declaration::ClassDeclaration(class) => {\n let _ = BoundNamesVisitor(names).visit_class_declaration(class);\n }\n Declaration::Lexical(decl) => {\n let _ = BoundNamesVisitor(names).visit_lexical_declaration(decl);\n }\n }\n }\n }\n}\n\n/// Utility function that collects the top level vars of a statement list into `names`.\n///\n/// This is equivalent to the [`TopLevelVarDeclaredNames`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-toplevelvardeclarednames\nfn top_level_vars(stmts: &StatementList, names: &mut FxHashSet) {\n for stmt in stmts.statements() {\n match stmt {\n StatementListItem::Declaration(decl) => {\n match decl.as_ref() {\n // Note\n // At the top level of a function, or script, function declarations are treated like\n // var declarations rather than like lexical declarations.\n Declaration::FunctionDeclaration(f) => {\n let _ = BoundNamesVisitor(names).visit_function_declaration(f);\n }\n Declaration::GeneratorDeclaration(f) => {\n let _ = BoundNamesVisitor(names).visit_generator_declaration(f);\n }\n Declaration::AsyncFunctionDeclaration(f) => {\n let _ = BoundNamesVisitor(names).visit_async_function_declaration(f);\n }\n Declaration::AsyncGeneratorDeclaration(f) => {\n let _ = BoundNamesVisitor(names).visit_async_generator_declaration(f);\n }\n Declaration::ClassDeclaration(_) | Declaration::Lexical(_) => {}\n }\n }\n StatementListItem::Statement(stmt) => {\n let mut stmt = Some(stmt.as_ref());\n while let Some(Statement::Labelled(labelled)) = stmt.as_ref() {\n match labelled.item() {\n LabelledItem::FunctionDeclaration(f) => {\n let _ = BoundNamesVisitor(names).visit_function_declaration(f);\n stmt = None;\n }\n LabelledItem::Statement(s) => stmt = Some(s),\n }\n }\n if let Some(stmt) = stmt {\n let _ = VarDeclaredNamesVisitor(names).visit(stmt);\n }\n }\n }\n }\n}\n\n/// Returns `true` if all private identifiers in a node are valid.\n///\n/// This is equivalent to the [`AllPrivateIdentifiersValid`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-allprivateidentifiersvalid\n#[must_use]\n#[inline]\npub fn all_private_identifiers_valid<'a, N>(node: &'a N, private_names: Vec) -> bool\nwhere\n &'a N: Into>,\n{\n AllPrivateIdentifiersValidVisitor(private_names)\n .visit(node.into())\n .is_continue()\n}\n\nstruct AllPrivateIdentifiersValidVisitor(Vec);\n\nimpl<'ast> Visitor<'ast> for AllPrivateIdentifiersValidVisitor {\n type BreakTy = ();\n\n fn visit_class_expression(\n &mut self,\n node: &'ast ClassExpression,\n ) -> ControlFlow {\n if let Some(node) = node.super_ref() {\n self.visit(node)?;\n }\n\n let mut names = self.0.clone();\n for element in node.elements() {\n match element {\n ClassElement::MethodDefinition(m) => {\n if let ClassElementName::PrivateName(name) = m.name() {\n names.push(name.description());\n }\n }\n ClassElement::PrivateFieldDefinition(PrivateFieldDefinition { name, .. })\n | ClassElement::PrivateStaticFieldDefinition(PrivateFieldDefinition {\n name, ..\n }) => {\n names.push(name.description());\n }\n _ => {}\n }\n }\n\n let mut visitor = Self(names);\n\n if let Some(node) = node.constructor() {\n visitor.visit(node)?;\n }\n\n for element in node.elements() {\n match element {\n ClassElement::MethodDefinition(m) => {\n if let ClassElementName::PropertyName(name) = m.name() {\n visitor.visit(name)?;\n }\n visitor.visit(m.parameters())?;\n visitor.visit(m.body())?;\n }\n ClassElement::FieldDefinition(field)\n | ClassElement::StaticFieldDefinition(field) => {\n visitor.visit(&field.name)?;\n if let Some(expression) = &field.initializer {\n visitor.visit(expression)?;\n }\n }\n ClassElement::PrivateFieldDefinition(PrivateFieldDefinition {\n initializer,\n ..\n })\n | ClassElement::PrivateStaticFieldDefinition(PrivateFieldDefinition {\n initializer,\n ..\n }) => {\n if let Some(expression) = initializer {\n visitor.visit(expression)?;\n }\n }\n ClassElement::StaticBlock(block) => {\n visitor.visit(&block.body)?;\n }\n }\n }\n\n ControlFlow::Continue(())\n }\n\n fn visit_class_declaration(\n &mut self,\n node: &'ast ClassDeclaration,\n ) -> ControlFlow {\n if let Some(node) = node.super_ref() {\n self.visit(node)?;\n }\n\n let mut names = self.0.clone();\n for element in node.elements() {\n match element {\n ClassElement::MethodDefinition(m) => {\n if let ClassElementName::PrivateName(name) = m.name() {\n names.push(name.description());\n }\n }\n ClassElement::PrivateFieldDefinition(PrivateFieldDefinition { name, .. })\n | ClassElement::PrivateStaticFieldDefinition(PrivateFieldDefinition {\n name, ..\n }) => {\n names.push(name.description());\n }\n _ => {}\n }\n }\n\n let mut visitor = Self(names);\n\n if let Some(node) = node.constructor() {\n visitor.visit(node)?;\n }\n\n for element in node.elements() {\n match element {\n ClassElement::MethodDefinition(m) => {\n if let ClassElementName::PropertyName(name) = m.name() {\n visitor.visit(name)?;\n }\n visitor.visit(m.parameters())?;\n visitor.visit(m.body())?;\n }\n ClassElement::FieldDefinition(field)\n | ClassElement::StaticFieldDefinition(field) => {\n visitor.visit(&field.name)?;\n if let Some(expression) = &field.initializer {\n visitor.visit(expression)?;\n }\n }\n ClassElement::PrivateFieldDefinition(PrivateFieldDefinition {\n initializer,\n ..\n })\n | ClassElement::PrivateStaticFieldDefinition(PrivateFieldDefinition {\n initializer,\n ..\n }) => {\n if let Some(expression) = initializer {\n visitor.visit(expression)?;\n }\n }\n ClassElement::StaticBlock(block) => {\n visitor.visit(&block.body)?;\n }\n }\n }\n\n ControlFlow::Continue(())\n }\n\n fn visit_private_property_access(\n &mut self,\n node: &'ast PrivatePropertyAccess,\n ) -> ControlFlow {\n if self.0.contains(&node.field().description()) {\n self.visit(node.target())\n } else {\n ControlFlow::Break(())\n }\n }\n\n fn visit_binary_in_private(\n &mut self,\n node: &'ast BinaryInPrivate,\n ) -> ControlFlow {\n if self.0.contains(&node.lhs().description()) {\n self.visit(node.rhs())\n } else {\n ControlFlow::Break(())\n }\n }\n\n fn visit_optional_operation_kind(\n &mut self,\n node: &'ast OptionalOperationKind,\n ) -> ControlFlow {\n match node {\n OptionalOperationKind::SimplePropertyAccess { field } => {\n self.visit_property_access_field(field)\n }\n OptionalOperationKind::PrivatePropertyAccess { field } => {\n if self.0.contains(&field.description()) {\n ControlFlow::Continue(())\n } else {\n ControlFlow::Break(())\n }\n }\n OptionalOperationKind::Call { args } => {\n for arg in args {\n self.visit_expression(arg)?;\n }\n ControlFlow::Continue(())\n }\n }\n }\n}\n\n/// Errors that can occur when checking labels.\n#[derive(Debug, Clone, Copy)]\npub enum CheckLabelsError {\n /// A label was used multiple times.\n DuplicateLabel(Sym),\n\n /// A `break` statement was used with a label that was not defined.\n UndefinedBreakTarget(Sym),\n\n /// A `continue` statement was used with a label that was not defined.\n UndefinedContinueTarget(Sym),\n\n /// A `break` statement was used in a non-looping context.\n IllegalBreakStatement,\n\n /// A `continue` statement was used in a non-looping context.\n IllegalContinueStatement,\n}\n\nimpl CheckLabelsError {\n /// Returns an error message based on the error.\n #[must_use]\n pub fn message(&self, interner: &Interner) -> String {\n match self {\n Self::DuplicateLabel(label) => {\n format!(\"duplicate label: {}\", interner.resolve_expect(*label))\n }\n Self::UndefinedBreakTarget(label) => {\n format!(\n \"undefined break target: {}\",\n interner.resolve_expect(*label)\n )\n }\n Self::UndefinedContinueTarget(label) => format!(\n \"undefined continue target: {}\",\n interner.resolve_expect(*label)\n ),\n Self::IllegalBreakStatement => \"illegal break statement\".into(),\n Self::IllegalContinueStatement => \"illegal continue statement\".into(),\n }\n }\n}\n\n/// This function checks multiple syntax errors conditions for labels, `break` and `continue`.\n///\n/// The following syntax errors are checked:\n/// - [`ContainsDuplicateLabels`][ContainsDuplicateLabels]\n/// - [`ContainsUndefinedBreakTarget`][ContainsUndefinedBreakTarget]\n/// - [`ContainsUndefinedContinueTarget`][ContainsUndefinedContinueTarget]\n/// - Early errors for [`BreakStatement`][BreakStatement]\n/// - Early errors for [`ContinueStatement`][ContinueStatement]\n///\n/// [ContainsDuplicateLabels]: https://tc39.es/ecma262/#sec-static-semantics-containsduplicatelabels\n/// [ContainsUndefinedBreakTarget]: https://tc39.es/ecma262/#sec-static-semantics-containsundefinedbreaktarget\n/// [ContainsUndefinedContinueTarget]: https://tc39.es/ecma262/#sec-static-semantics-containsundefinedcontinuetarget\n/// [BreakStatement]: https://tc39.es/ecma262/#sec-break-statement-static-semantics-early-errors\n/// [ContinueStatement]: https://tc39.es/ecma262/#sec-continue-statement-static-semantics-early-errors\n///\n/// # Errors\n///\n/// This function returns an error for the first syntax error that is found.\npub fn check_labels(node: &N) -> Result<(), CheckLabelsError>\nwhere\n N: VisitWith,\n{\n #[derive(Debug, Clone)]\n struct CheckLabelsResolver {\n labels: FxHashSet,\n continue_iteration_labels: FxHashSet,\n continue_labels: Option>,\n iteration: bool,\n switch: bool,\n }\n\n impl<'ast> Visitor<'ast> for CheckLabelsResolver {\n type BreakTy = CheckLabelsError;\n\n fn visit_statement(&mut self, node: &'ast Statement) -> ControlFlow {\n match node {\n Statement::Block(node) => self.visit_block(node),\n Statement::Var(_)\n | Statement::Empty\n | Statement::Debugger\n | Statement::Expression(_)\n | Statement::Return(_)\n | Statement::Throw(_) => ControlFlow::Continue(()),\n Statement::If(node) => self.visit_if(node),\n Statement::DoWhileLoop(node) => self.visit_do_while_loop(node),\n Statement::WhileLoop(node) => self.visit_while_loop(node),\n Statement::ForLoop(node) => self.visit_for_loop(node),\n Statement::ForInLoop(node) => self.visit_for_in_loop(node),\n Statement::ForOfLoop(node) => self.visit_for_of_loop(node),\n Statement::Switch(node) => self.visit_switch(node),\n Statement::Labelled(node) => self.visit_labelled(node),\n Statement::Try(node) => self.visit_try(node),\n Statement::Continue(node) => self.visit_continue(node),\n Statement::Break(node) => self.visit_break(node),\n Statement::With(with) => self.visit_with(with),\n }\n }\n\n fn visit_block(\n &mut self,\n node: &'ast crate::statement::Block,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n self.visit_statement_list(node.statement_list())?;\n self.continue_labels = continue_labels;\n ControlFlow::Continue(())\n }\n\n fn visit_break(\n &mut self,\n node: &'ast crate::statement::Break,\n ) -> ControlFlow {\n if let Some(label) = node.label() {\n if !self.labels.contains(&label) {\n return ControlFlow::Break(CheckLabelsError::UndefinedBreakTarget(label));\n }\n } else if !self.iteration && !self.switch {\n return ControlFlow::Break(CheckLabelsError::IllegalBreakStatement);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_continue(\n &mut self,\n node: &'ast crate::statement::Continue,\n ) -> ControlFlow {\n if !self.iteration {\n return ControlFlow::Break(CheckLabelsError::IllegalContinueStatement);\n }\n\n if let Some(label) = node.label()\n && !self.continue_iteration_labels.contains(&label)\n {\n return ControlFlow::Break(CheckLabelsError::UndefinedContinueTarget(label));\n }\n ControlFlow::Continue(())\n }\n\n fn visit_do_while_loop(\n &mut self,\n node: &'ast crate::statement::DoWhileLoop,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n let continue_iteration_labels = self.continue_iteration_labels.clone();\n if let Some(continue_labels) = &continue_labels {\n self.continue_iteration_labels.extend(continue_labels);\n }\n let iteration = self.iteration;\n self.iteration = true;\n self.visit_statement(node.body())?;\n self.continue_iteration_labels = continue_iteration_labels;\n self.continue_labels = continue_labels;\n self.iteration = iteration;\n ControlFlow::Continue(())\n }\n\n fn visit_while_loop(\n &mut self,\n node: &'ast crate::statement::WhileLoop,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n let continue_iteration_labels = self.continue_iteration_labels.clone();\n if let Some(continue_labels) = &continue_labels {\n self.continue_iteration_labels.extend(continue_labels);\n }\n let iteration = self.iteration;\n self.iteration = true;\n self.visit_statement(node.body())?;\n self.continue_iteration_labels = continue_iteration_labels;\n self.continue_labels = continue_labels;\n self.iteration = iteration;\n ControlFlow::Continue(())\n }\n\n fn visit_for_loop(\n &mut self,\n node: &'ast crate::statement::ForLoop,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n let continue_iteration_labels = self.continue_iteration_labels.clone();\n if let Some(continue_labels) = &continue_labels {\n self.continue_iteration_labels.extend(continue_labels);\n }\n let iteration = self.iteration;\n self.iteration = true;\n self.visit_statement(node.body())?;\n self.continue_iteration_labels = continue_iteration_labels;\n self.continue_labels = continue_labels;\n self.iteration = iteration;\n ControlFlow::Continue(())\n }\n\n fn visit_for_in_loop(\n &mut self,\n node: &'ast crate::statement::ForInLoop,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n let continue_iteration_labels = self.continue_iteration_labels.clone();\n if let Some(continue_labels) = &continue_labels {\n self.continue_iteration_labels.extend(continue_labels);\n }\n let iteration = self.iteration;\n self.iteration = true;\n self.visit_statement(node.body())?;\n self.continue_iteration_labels = continue_iteration_labels;\n self.continue_labels = continue_labels;\n self.iteration = iteration;\n ControlFlow::Continue(())\n }\n\n fn visit_for_of_loop(\n &mut self,\n node: &'ast crate::statement::ForOfLoop,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n let continue_iteration_labels = self.continue_iteration_labels.clone();\n if let Some(continue_labels) = &continue_labels {\n self.continue_iteration_labels.extend(continue_labels);\n }\n let iteration = self.iteration;\n self.iteration = true;\n self.visit_statement(node.body())?;\n self.continue_iteration_labels = continue_iteration_labels;\n self.continue_labels = continue_labels;\n self.iteration = iteration;\n ControlFlow::Continue(())\n }\n\n fn visit_statement_list_item(\n &mut self,\n node: &'ast StatementListItem,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n if let StatementListItem::Statement(stmt) = node {\n self.visit_statement(stmt)?;\n }\n self.continue_labels = continue_labels;\n ControlFlow::Continue(())\n }\n\n fn visit_if(&mut self, node: &'ast crate::statement::If) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n self.visit_statement(node.body())?;\n if let Some(stmt) = node.else_node() {\n self.visit_statement(stmt)?;\n }\n self.continue_labels = continue_labels;\n ControlFlow::Continue(())\n }\n\n fn visit_switch(\n &mut self,\n node: &'ast crate::statement::Switch,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n let switch = self.switch;\n self.switch = true;\n for case in node.cases() {\n self.visit_statement_list(case.body())?;\n }\n if let Some(default) = node.default() {\n self.visit_statement_list(default)?;\n }\n self.continue_labels = continue_labels;\n self.switch = switch;\n ControlFlow::Continue(())\n }\n\n fn visit_labelled(\n &mut self,\n node: &'ast crate::statement::Labelled,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.clone();\n if let Some(continue_labels) = &mut self.continue_labels {\n continue_labels.insert(node.label());\n } else {\n let mut continue_labels = FxHashSet::default();\n continue_labels.insert(node.label());\n self.continue_labels = Some(continue_labels);\n }\n\n if !self.labels.insert(node.label()) {\n return ControlFlow::Break(CheckLabelsError::DuplicateLabel(node.label()));\n }\n self.visit_labelled_item(node.item())?;\n self.labels.remove(&node.label());\n self.continue_labels = continue_labels;\n ControlFlow::Continue(())\n }\n\n fn visit_labelled_item(&mut self, node: &'ast LabelledItem) -> ControlFlow {\n match node {\n LabelledItem::Statement(stmt) => self.visit_statement(stmt),\n LabelledItem::FunctionDeclaration(_) => ControlFlow::Continue(()),\n }\n }\n\n fn visit_try(&mut self, node: &'ast crate::statement::Try) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n self.visit_block(node.block())?;\n if let Some(catch) = node.catch() {\n self.visit_block(catch.block())?;\n }\n if let Some(finally) = node.finally() {\n self.visit_block(finally.block())?;\n }\n self.continue_labels = continue_labels;\n ControlFlow::Continue(())\n }\n\n fn visit_module_item_list(\n &mut self,\n node: &'ast crate::ModuleItemList,\n ) -> ControlFlow {\n let continue_labels = self.continue_labels.take();\n for item in node.items() {\n self.visit_module_item(item)?;\n }\n self.continue_labels = continue_labels;\n ControlFlow::Continue(())\n }\n\n fn visit_module_item(&mut self, node: &'ast ModuleItem) -> ControlFlow {\n match node {\n ModuleItem::ImportDeclaration(_) | ModuleItem::ExportDeclaration(_) => {\n ControlFlow::Continue(())\n }\n ModuleItem::StatementListItem(node) => self.visit_statement_list_item(node),\n }\n }\n }\n\n let mut visitor = CheckLabelsResolver {\n labels: FxHashSet::default(),\n continue_iteration_labels: FxHashSet::default(),\n continue_labels: None,\n iteration: false,\n switch: false,\n };\n\n if let ControlFlow::Break(error) = node.visit_with(&mut visitor) {\n Err(error)\n } else {\n Ok(())\n }\n}\n\n/// Returns `true` if the given node contains a `CoverInitializedName`.\n#[must_use]\npub fn contains_invalid_object_literal(node: &N) -> bool\nwhere\n N: VisitWith,\n{\n #[derive(Debug, Clone)]\n struct ContainsInvalidObjectLiteral {}\n\n impl<'ast> Visitor<'ast> for ContainsInvalidObjectLiteral {\n type BreakTy = ();\n\n fn visit_object_literal(\n &mut self,\n node: &'ast crate::expression::literal::ObjectLiteral,\n ) -> ControlFlow {\n for pd in node.properties() {\n if let PropertyDefinition::CoverInitializedName(..) = pd {\n return ControlFlow::Break(());\n }\n self.visit_property_definition(pd)?;\n }\n ControlFlow::Continue(())\n }\n }\n\n let mut visitor = ContainsInvalidObjectLiteral {};\n\n node.visit_with(&mut visitor).is_break()\n}\n\n/// The type of a lexically scoped declaration.\n#[derive(Copy, Clone, Debug)]\npub enum LexicallyScopedDeclaration<'a> {\n /// See [`LexicalDeclaration`]\n LexicalDeclaration(&'a LexicalDeclaration),\n\n /// See [`FunctionDeclaration`]\n FunctionDeclaration(&'a FunctionDeclaration),\n\n /// See [`GeneratorDeclaration`]\n GeneratorDeclaration(&'a GeneratorDeclaration),\n\n /// See [`AsyncFunctionDeclaration`]\n AsyncFunctionDeclaration(&'a AsyncFunctionDeclaration),\n\n /// See [`AsyncGeneratorDeclaration`]\n AsyncGeneratorDeclaration(&'a AsyncGeneratorDeclaration),\n\n /// See [`ClassDeclaration`]\n ClassDeclaration(&'a ClassDeclaration),\n\n /// A default assignment expression as an export declaration.\n ///\n /// Only valid inside module exports.\n AssignmentExpression(&'a Expression),\n}\n\nimpl LexicallyScopedDeclaration<'_> {\n /// Return the bound names of the declaration.\n #[must_use]\n pub fn bound_names(&self) -> Vec {\n match *self {\n Self::LexicalDeclaration(v) => bound_names(v),\n Self::FunctionDeclaration(f) => bound_names(f),\n Self::GeneratorDeclaration(g) => bound_names(g),\n Self::AsyncFunctionDeclaration(f) => bound_names(f),\n Self::AsyncGeneratorDeclaration(g) => bound_names(g),\n Self::ClassDeclaration(cl) => bound_names(cl),\n Self::AssignmentExpression(expr) => bound_names(expr),\n }\n }\n}\n\nimpl<'ast> From<&'ast Declaration> for LexicallyScopedDeclaration<'ast> {\n fn from(value: &'ast Declaration) -> LexicallyScopedDeclaration<'ast> {\n match value {\n Declaration::FunctionDeclaration(f) => Self::FunctionDeclaration(f),\n Declaration::GeneratorDeclaration(g) => Self::GeneratorDeclaration(g),\n Declaration::AsyncFunctionDeclaration(af) => Self::AsyncFunctionDeclaration(af),\n Declaration::AsyncGeneratorDeclaration(ag) => Self::AsyncGeneratorDeclaration(ag),\n Declaration::ClassDeclaration(c) => Self::ClassDeclaration(c),\n Declaration::Lexical(lex) => Self::LexicalDeclaration(lex),\n }\n }\n}\n\n/// Returns a list of lexically scoped declarations of the given node.\n///\n/// This is equivalent to the [`LexicallyScopedDeclarations`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-lexicallyscopeddeclarations\n#[must_use]\npub fn lexically_scoped_declarations<'a, N>(node: &'a N) -> Vec>\nwhere\n &'a N: Into>,\n{\n let mut declarations = Vec::new();\n let _ = LexicallyScopedDeclarationsVisitor(&mut declarations).visit(node.into());\n declarations\n}\n\n/// The [`Visitor`] used to obtain the lexically scoped declarations of a node.\n#[derive(Debug)]\nstruct LexicallyScopedDeclarationsVisitor<'a, 'ast>(&'a mut Vec>);\n\nimpl<'ast> Visitor<'ast> for LexicallyScopedDeclarationsVisitor<'_, 'ast> {\n type BreakTy = Infallible;\n\n // ScriptBody : StatementList\n fn visit_script(&mut self, node: &'ast Script) -> ControlFlow {\n // 1. Return TopLevelLexicallyScopedDeclarations of StatementList.\n TopLevelLexicallyScopedDeclarationsVisitor(self.0).visit_statement_list(node.statements())\n }\n\n fn visit_function_body(&mut self, node: &'ast FunctionBody) -> ControlFlow {\n // 1. Return TopLevelVarScopedDeclarations of StatementList.\n TopLevelLexicallyScopedDeclarationsVisitor(self.0)\n .visit_statement_list(node.statement_list())\n }\n\n fn visit_export_declaration(\n &mut self,\n node: &'ast ExportDeclaration,\n ) -> ControlFlow {\n let decl = match node {\n // ExportDeclaration :\n // export ExportFromClause FromClause ;\n // export NamedExports ;\n // export VariableStatement\n ExportDeclaration::ReExport { .. }\n | ExportDeclaration::List(_)\n | ExportDeclaration::VarStatement(_) => {\n // 1. Return a new empty List.\n return ControlFlow::Continue(());\n }\n\n // ExportDeclaration : export Declaration\n ExportDeclaration::Declaration(decl) => {\n // 1. Return a List whose sole element is DeclarationPart of Declaration.\n decl.into()\n }\n\n // ExportDeclaration : export default HoistableDeclaration\n // 1. Return a List whose sole element is DeclarationPart of HoistableDeclaration.\n ExportDeclaration::DefaultFunctionDeclaration(f) => {\n LexicallyScopedDeclaration::FunctionDeclaration(f)\n }\n ExportDeclaration::DefaultGeneratorDeclaration(g) => {\n LexicallyScopedDeclaration::GeneratorDeclaration(g)\n }\n ExportDeclaration::DefaultAsyncFunctionDeclaration(af) => {\n LexicallyScopedDeclaration::AsyncFunctionDeclaration(af)\n }\n ExportDeclaration::DefaultAsyncGeneratorDeclaration(ag) => {\n LexicallyScopedDeclaration::AsyncGeneratorDeclaration(ag)\n }\n\n // ExportDeclaration : export default ClassDeclaration\n ExportDeclaration::DefaultClassDeclaration(c) => {\n // 1. Return a List whose sole element is ClassDeclaration.\n LexicallyScopedDeclaration::ClassDeclaration(c)\n }\n\n // ExportDeclaration : export default AssignmentExpression ;\n ExportDeclaration::DefaultAssignmentExpression(expr) => {\n // 1. Return a List whose sole element is this ExportDeclaration.\n LexicallyScopedDeclaration::AssignmentExpression(expr)\n }\n };\n\n self.0.push(decl);\n\n ControlFlow::Continue(())\n }\n\n fn visit_statement_list_item(\n &mut self,\n node: &'ast StatementListItem,\n ) -> ControlFlow {\n match node {\n // StatementListItem : Statement\n StatementListItem::Statement(statement) => {\n // 1. If Statement is Statement : LabelledStatement , return LexicallyScopedDeclarations of LabelledStatement.\n if let Statement::Labelled(labelled) = statement.as_ref() {\n self.visit_labelled(labelled)\n } else {\n // 2. Return a new empty List.\n ControlFlow::Continue(())\n }\n }\n\n // StatementListItem : Declaration\n StatementListItem::Declaration(declaration) => {\n // 1. Return a List whose sole element is DeclarationPart of Declaration.\n self.0.push(declaration.as_ref().into());\n ControlFlow::Continue(())\n }\n }\n }\n\n fn visit_labelled_item(&mut self, node: &'ast LabelledItem) -> ControlFlow {\n match node {\n // LabelledItem : FunctionDeclaration\n LabelledItem::FunctionDeclaration(f) => {\n // 1. Return « FunctionDeclaration ».\n self.0\n .push(LexicallyScopedDeclaration::FunctionDeclaration(f));\n }\n\n // LabelledItem : Statement\n LabelledItem::Statement(_) => {\n // 1. Return a new empty List.\n }\n }\n ControlFlow::Continue(())\n }\n\n fn visit_module_item(&mut self, node: &'ast ModuleItem) -> ControlFlow {\n match node {\n ModuleItem::StatementListItem(item) => self.visit_statement_list_item(item),\n ModuleItem::ExportDeclaration(export) => self.visit_export_declaration(export),\n\n // ModuleItem : ImportDeclaration\n ModuleItem::ImportDeclaration(_) => {\n // 1. Return a new empty List.\n ControlFlow::Continue(())\n }\n }\n }\n}\n/// The [`Visitor`] used to obtain the top level lexically scoped declarations of a node.\n///\n/// This is equivalent to the [`TopLevelLexicallyScopedDeclarations`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-toplevellexicallyscopeddeclarations\n#[derive(Debug)]\nstruct TopLevelLexicallyScopedDeclarationsVisitor<'a, 'ast>(\n &'a mut Vec>,\n);\n\nimpl<'ast> Visitor<'ast> for TopLevelLexicallyScopedDeclarationsVisitor<'_, 'ast> {\n type BreakTy = Infallible;\n\n fn visit_statement_list_item(\n &mut self,\n node: &'ast StatementListItem,\n ) -> ControlFlow {\n match node {\n // StatementListItem : Declaration\n StatementListItem::Declaration(d) => match d.as_ref() {\n // 1. If Declaration is Declaration : HoistableDeclaration , then\n Declaration::FunctionDeclaration(_)\n | Declaration::GeneratorDeclaration(_)\n | Declaration::AsyncFunctionDeclaration(_)\n | Declaration::AsyncGeneratorDeclaration(_) => {\n // a. Return a new empty List.\n }\n\n // 2. Return « Declaration ».\n Declaration::ClassDeclaration(cl) => {\n self.0\n .push(LexicallyScopedDeclaration::ClassDeclaration(cl));\n }\n Declaration::Lexical(lex) => {\n self.0\n .push(LexicallyScopedDeclaration::LexicalDeclaration(lex));\n }\n },\n\n // StatementListItem : Statement\n StatementListItem::Statement(_) => {\n // 1. Return a new empty List.\n }\n }\n\n ControlFlow::Continue(())\n }\n}\n\n/// The type of a var scoped declaration.\n#[derive(Clone, Debug)]\npub enum VarScopedDeclaration {\n /// See [`VarDeclaration`]\n VariableDeclaration(Variable),\n\n /// See [`FunctionDeclaration`]\n FunctionDeclaration(FunctionDeclaration),\n\n /// See [`GeneratorDeclaration`]\n GeneratorDeclaration(GeneratorDeclaration),\n\n /// See [`AsyncFunctionDeclaration`]\n AsyncFunctionDeclaration(AsyncFunctionDeclaration),\n\n /// See [`AsyncGeneratorDeclaration`]\n AsyncGeneratorDeclaration(AsyncGeneratorDeclaration),\n}\n\nimpl VarScopedDeclaration {\n /// Return the bound names of the declaration.\n #[must_use]\n pub fn bound_names(&self) -> Vec {\n match self {\n Self::VariableDeclaration(v) => bound_names(v),\n Self::FunctionDeclaration(f) => bound_names(f),\n Self::GeneratorDeclaration(g) => bound_names(g),\n Self::AsyncFunctionDeclaration(f) => bound_names(f),\n Self::AsyncGeneratorDeclaration(g) => bound_names(g),\n }\n }\n\n /// Return [`LinearSpan`] of this declaration (if there is).\n #[must_use]\n pub fn linear_span(&self) -> Option {\n match self {\n VarScopedDeclaration::FunctionDeclaration(f) => Some(f.linear_span()),\n VarScopedDeclaration::GeneratorDeclaration(f) => Some(f.linear_span()),\n VarScopedDeclaration::AsyncFunctionDeclaration(f) => Some(f.linear_span()),\n VarScopedDeclaration::AsyncGeneratorDeclaration(f) => Some(f.linear_span()),\n VarScopedDeclaration::VariableDeclaration(_) => None,\n }\n }\n}\n\n/// Returns a list of var scoped declarations of the given node.\n///\n/// This is equivalent to the [`VarScopedDeclarations`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-varscopeddeclarations\n#[must_use]\npub fn var_scoped_declarations<'a, N>(node: &'a N) -> Vec\nwhere\n &'a N: Into>,\n{\n let mut declarations = Vec::new();\n let _ = VarScopedDeclarationsVisitor(&mut declarations).visit(node.into());\n declarations\n}\n\n/// The [`Visitor`] used to obtain the var scoped declarations of a node.\n#[derive(Debug)]\nstruct VarScopedDeclarationsVisitor<'a>(&'a mut Vec);\n\nimpl<'ast> Visitor<'ast> for VarScopedDeclarationsVisitor<'_> {\n type BreakTy = Infallible;\n\n // ScriptBody : StatementList\n fn visit_script(&mut self, node: &'ast Script) -> ControlFlow {\n // 1. Return TopLevelVarScopedDeclarations of StatementList.\n TopLevelVarScopedDeclarationsVisitor(self.0).visit_statement_list(node.statements())\n }\n\n fn visit_function_body(&mut self, node: &'ast FunctionBody) -> ControlFlow {\n // 1. Return TopLevelVarScopedDeclarations of StatementList.\n TopLevelVarScopedDeclarationsVisitor(self.0).visit_statement_list(node.statement_list())\n }\n\n fn visit_statement(&mut self, node: &'ast Statement) -> ControlFlow {\n match node {\n Statement::Block(s) => self.visit(s),\n Statement::Var(s) => self.visit(s),\n Statement::If(s) => self.visit(s),\n Statement::DoWhileLoop(s) => self.visit(s),\n Statement::WhileLoop(s) => self.visit(s),\n Statement::ForLoop(s) => self.visit(s),\n Statement::ForInLoop(s) => self.visit(s),\n Statement::ForOfLoop(s) => self.visit(s),\n Statement::Switch(s) => self.visit(s),\n Statement::Labelled(s) => self.visit(s),\n Statement::Try(s) => self.visit(s),\n Statement::With(s) => self.visit(s),\n Statement::Empty\n | Statement::Debugger\n | Statement::Expression(_)\n | Statement::Continue(_)\n | Statement::Break(_)\n | Statement::Return(_)\n | Statement::Throw(_) => ControlFlow::Continue(()),\n }\n }\n\n fn visit_statement_list_item(\n &mut self,\n node: &'ast StatementListItem,\n ) -> ControlFlow {\n match node {\n StatementListItem::Declaration(_) => ControlFlow::Continue(()),\n StatementListItem::Statement(s) => self.visit(s.as_ref()),\n }\n }\n\n fn visit_var_declaration(&mut self, node: &'ast VarDeclaration) -> ControlFlow {\n for var in node.0.as_ref() {\n self.0\n .push(VarScopedDeclaration::VariableDeclaration(var.clone()));\n }\n ControlFlow::Continue(())\n }\n\n fn visit_if(&mut self, node: &'ast crate::statement::If) -> ControlFlow {\n self.visit(node.body())?;\n if let Some(else_node) = node.else_node() {\n self.visit(else_node)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_do_while_loop(\n &mut self,\n node: &'ast crate::statement::DoWhileLoop,\n ) -> ControlFlow {\n self.visit(node.body())?;\n ControlFlow::Continue(())\n }\n\n fn visit_while_loop(\n &mut self,\n node: &'ast crate::statement::WhileLoop,\n ) -> ControlFlow {\n self.visit(node.body())?;\n ControlFlow::Continue(())\n }\n\n fn visit_for_loop(\n &mut self,\n node: &'ast crate::statement::ForLoop,\n ) -> ControlFlow {\n if let Some(ForLoopInitializer::Var(v)) = node.init() {\n self.visit(v)?;\n }\n self.visit(node.body())?;\n ControlFlow::Continue(())\n }\n\n fn visit_for_in_loop(\n &mut self,\n node: &'ast crate::statement::ForInLoop,\n ) -> ControlFlow {\n if let IterableLoopInitializer::Var(var) = node.initializer() {\n self.0\n .push(VarScopedDeclaration::VariableDeclaration(var.clone()));\n }\n self.visit(node.body())?;\n ControlFlow::Continue(())\n }\n\n fn visit_for_of_loop(\n &mut self,\n node: &'ast crate::statement::ForOfLoop,\n ) -> ControlFlow {\n if let IterableLoopInitializer::Var(var) = node.initializer() {\n self.0\n .push(VarScopedDeclaration::VariableDeclaration(var.clone()));\n }\n self.visit(node.body())?;\n ControlFlow::Continue(())\n }\n\n fn visit_with(&mut self, node: &'ast With) -> ControlFlow {\n self.visit(node.statement())?;\n ControlFlow::Continue(())\n }\n\n fn visit_switch(&mut self, node: &'ast crate::statement::Switch) -> ControlFlow {\n for case in node.cases() {\n self.visit(case)?;\n }\n if let Some(default) = node.default() {\n self.visit(default)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_case(&mut self, node: &'ast crate::statement::Case) -> ControlFlow {\n self.visit(node.body())?;\n ControlFlow::Continue(())\n }\n\n fn visit_labelled_item(&mut self, node: &'ast LabelledItem) -> ControlFlow {\n match node {\n LabelledItem::Statement(s) => self.visit(s),\n LabelledItem::FunctionDeclaration(_) => ControlFlow::Continue(()),\n }\n }\n\n fn visit_catch(&mut self, node: &'ast crate::statement::Catch) -> ControlFlow {\n self.visit(node.block())?;\n ControlFlow::Continue(())\n }\n\n fn visit_module_item(&mut self, node: &'ast ModuleItem) -> ControlFlow {\n match node {\n // ModuleItem : ExportDeclaration\n ModuleItem::ExportDeclaration(decl) => {\n if let ExportDeclaration::VarStatement(var) = decl.as_ref() {\n // 1. If ExportDeclaration is export VariableStatement, return VarScopedDeclarations of VariableStatement.\n self.visit_var_declaration(var)?;\n }\n // 2. Return a new empty List.\n }\n ModuleItem::StatementListItem(item) => {\n self.visit_statement_list_item(item)?;\n }\n // ModuleItem : ImportDeclaration\n ModuleItem::ImportDeclaration(_) => {\n // 1. Return a new empty List.\n }\n }\n ControlFlow::Continue(())\n }\n}\n\n/// The [`Visitor`] used to obtain the top level var scoped declarations of a node.\n///\n/// This is equivalent to the [`TopLevelVarScopedDeclarations`][spec] syntax operation in the spec.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-static-semantics-toplevelvarscopeddeclarations\n#[derive(Debug)]\nstruct TopLevelVarScopedDeclarationsVisitor<'a>(&'a mut Vec);\n\nimpl<'ast> Visitor<'ast> for TopLevelVarScopedDeclarationsVisitor<'_> {\n type BreakTy = Infallible;\n\n fn visit_statement_list_item(\n &mut self,\n node: &'ast StatementListItem,\n ) -> ControlFlow {\n match node {\n StatementListItem::Declaration(d) => {\n match d.as_ref() {\n Declaration::FunctionDeclaration(f) => {\n self.0\n .push(VarScopedDeclaration::FunctionDeclaration(f.clone()));\n }\n Declaration::GeneratorDeclaration(f) => {\n self.0\n .push(VarScopedDeclaration::GeneratorDeclaration(f.clone()));\n }\n Declaration::AsyncFunctionDeclaration(f) => {\n self.0\n .push(VarScopedDeclaration::AsyncFunctionDeclaration(f.clone()));\n }\n Declaration::AsyncGeneratorDeclaration(f) => {\n self.0\n .push(VarScopedDeclaration::AsyncGeneratorDeclaration(f.clone()));\n }\n _ => {}\n }\n ControlFlow::Continue(())\n }\n StatementListItem::Statement(statement) => {\n if let Statement::Labelled(labelled) = statement.as_ref() {\n self.visit(labelled)\n } else {\n VarScopedDeclarationsVisitor(self.0).visit(statement.as_ref())\n }\n }\n }\n }\n\n fn visit_labelled_item(&mut self, node: &'ast LabelledItem) -> ControlFlow {\n match node {\n LabelledItem::Statement(Statement::Labelled(s)) => self.visit(s),\n LabelledItem::Statement(s) => {\n VarScopedDeclarationsVisitor(self.0).visit(s)?;\n ControlFlow::Continue(())\n }\n LabelledItem::FunctionDeclaration(f) => {\n self.0\n .push(VarScopedDeclaration::FunctionDeclaration(f.clone()));\n ControlFlow::Continue(())\n }\n }\n }\n}\n\n/// Returns a list function declaration names that are directly contained in a statement lists\n/// `Block`, `CaseClause` or `DefaultClause`.\n/// If the function declaration would cause an early error it is not included in the list.\n///\n/// This behavior is used in the following annexB sections:\n/// * [B.3.2.1 Changes to FunctionDeclarationInstantiation][spec0]\n/// * [B.3.2.2 Changes to GlobalDeclarationInstantiation][spec1]\n/// * [B.3.2.3 Changes to EvalDeclarationInstantiation][spec2]\n///\n/// [spec0]: https://tc39.es/ecma262/#sec-web-compat-functiondeclarationinstantiation\n/// [spec1]: https://tc39.es/ecma262/#sec-web-compat-globaldeclarationinstantiation\n/// [spec2]: https://tc39.es/ecma262/#sec-web-compat-evaldeclarationinstantiation\n#[must_use]\npub fn annex_b_function_declarations_names<'a, N>(node: &'a N) -> Vec\nwhere\n &'a N: Into>,\n{\n let mut declarations = Vec::new();\n let _ = AnnexBFunctionDeclarationNamesVisitor(&mut declarations).visit(node.into());\n declarations\n}\n\n/// The [`Visitor`] used for [`annex_b_function_declarations_names`].\n#[derive(Debug)]\nstruct AnnexBFunctionDeclarationNamesVisitor<'a>(&'a mut Vec);\n\nimpl<'ast> Visitor<'ast> for AnnexBFunctionDeclarationNamesVisitor<'_> {\n type BreakTy = Infallible;\n\n fn visit_statement_list_item(\n &mut self,\n node: &'ast StatementListItem,\n ) -> ControlFlow {\n match node {\n StatementListItem::Statement(node) => self.visit(node.as_ref()),\n StatementListItem::Declaration(_) => ControlFlow::Continue(()),\n }\n }\n\n fn visit_statement(&mut self, node: &'ast Statement) -> ControlFlow {\n match node {\n Statement::Block(node) => self.visit(node),\n Statement::If(node) => self.visit(node),\n Statement::DoWhileLoop(node) => self.visit(node),\n Statement::WhileLoop(node) => self.visit(node),\n Statement::ForLoop(node) => self.visit(node),\n Statement::ForInLoop(node) => self.visit(node),\n Statement::ForOfLoop(node) => self.visit(node),\n Statement::Switch(node) => self.visit(node),\n Statement::Labelled(node) => self.visit(node),\n Statement::Try(node) => self.visit(node),\n Statement::With(node) => self.visit(node),\n _ => ControlFlow::Continue(()),\n }\n }\n\n fn visit_block(&mut self, node: &'ast crate::statement::Block) -> ControlFlow {\n self.visit(node.statement_list())?;\n for statement in node.statement_list().statements() {\n if let StatementListItem::Declaration(declaration) = statement\n && let Declaration::FunctionDeclaration(function) = &**declaration\n {\n let name = function.name();\n self.0.push(name.sym());\n }\n }\n\n let lexically_declared_names = lexically_declared_names_legacy(node.statement_list());\n\n self.0\n .retain(|name| !lexically_declared_names.contains(&(*name, false)));\n\n ControlFlow::Continue(())\n }\n\n fn visit_switch(&mut self, node: &'ast crate::statement::Switch) -> ControlFlow {\n for case in node.cases() {\n self.visit(case)?;\n for statement in case.body().statements() {\n if let StatementListItem::Declaration(declaration) = statement\n && let Declaration::FunctionDeclaration(function) = &**declaration\n {\n let name = function.name();\n self.0.push(name.sym());\n }\n }\n }\n if let Some(default) = node.default() {\n self.visit(default)?;\n for statement in default.statements() {\n if let StatementListItem::Declaration(declaration) = statement\n && let Declaration::FunctionDeclaration(function) = declaration.as_ref()\n {\n let name = function.name();\n self.0.push(name.sym());\n }\n }\n }\n\n let lexically_declared_names = lexically_declared_names_legacy(node);\n\n self.0\n .retain(|name| !lexically_declared_names.contains(&(*name, false)));\n\n ControlFlow::Continue(())\n }\n\n fn visit_try(&mut self, node: &'ast crate::statement::Try) -> ControlFlow {\n self.visit(node.block())?;\n if let Some(catch) = node.catch() {\n self.visit(catch.block())?;\n\n if let Some(Binding::Pattern(pattern)) = catch.parameter() {\n let bound_names = bound_names(pattern);\n\n self.0.retain(|name| !bound_names.contains(name));\n }\n }\n if let Some(finally) = node.finally() {\n self.visit(finally.block())?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_if(&mut self, node: &'ast crate::statement::If) -> ControlFlow {\n if let Some(node) = node.else_node() {\n self.visit(node)?;\n }\n self.visit(node.body())\n }\n\n fn visit_do_while_loop(\n &mut self,\n node: &'ast crate::statement::DoWhileLoop,\n ) -> ControlFlow {\n self.visit(node.body())\n }\n\n fn visit_while_loop(\n &mut self,\n node: &'ast crate::statement::WhileLoop,\n ) -> ControlFlow {\n self.visit(node.body())\n }\n\n fn visit_for_loop(\n &mut self,\n node: &'ast crate::statement::ForLoop,\n ) -> ControlFlow {\n self.visit(node.body())?;\n\n if let Some(ForLoopInitializer::Lexical(node)) = node.init() {\n let bound_names = bound_names(&node.declaration);\n self.0.retain(|name| !bound_names.contains(name));\n }\n\n ControlFlow::Continue(())\n }\n\n fn visit_for_in_loop(\n &mut self,\n node: &'ast crate::statement::ForInLoop,\n ) -> ControlFlow {\n self.visit(node.body())?;\n\n if let IterableLoopInitializer::Let(node) = node.initializer() {\n let bound_names = bound_names(node);\n self.0.retain(|name| !bound_names.contains(name));\n }\n if let IterableLoopInitializer::Const(node) = node.initializer() {\n let bound_names = bound_names(node);\n self.0.retain(|name| !bound_names.contains(name));\n }\n\n ControlFlow::Continue(())\n }\n\n fn visit_for_of_loop(\n &mut self,\n node: &'ast crate::statement::ForOfLoop,\n ) -> ControlFlow {\n self.visit(node.body())?;\n\n if let IterableLoopInitializer::Let(node) = node.initializer() {\n let bound_names = bound_names(node);\n self.0.retain(|name| !bound_names.contains(name));\n }\n if let IterableLoopInitializer::Const(node) = node.initializer() {\n let bound_names = bound_names(node);\n self.0.retain(|name| !bound_names.contains(name));\n }\n\n ControlFlow::Continue(())\n }\n\n fn visit_labelled(\n &mut self,\n node: &'ast crate::statement::Labelled,\n ) -> ControlFlow {\n if let LabelledItem::Statement(node) = node.item() {\n self.visit(node)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with(&mut self, node: &'ast With) -> ControlFlow {\n self.visit(node.statement())\n }\n}\n\n/// Returns `true` if the given statement returns a value.\n#[must_use]\npub fn returns_value<'a, N>(node: &'a N) -> bool\nwhere\n &'a N: Into>,\n{\n ReturnsValueVisitor.visit(node.into()).is_break()\n}\n\n/// The [`Visitor`] used for [`returns_value`].\n#[derive(Debug)]\nstruct ReturnsValueVisitor;\n\nimpl<'ast> Visitor<'ast> for ReturnsValueVisitor {\n type BreakTy = ();\n\n fn visit_block(&mut self, node: &'ast crate::statement::Block) -> ControlFlow {\n for statement in node.statement_list().statements() {\n match statement {\n StatementListItem::Declaration(_) => {}\n StatementListItem::Statement(node) => self.visit(node.as_ref())?,\n }\n }\n ControlFlow::Continue(())\n }\n\n fn visit_statement(&mut self, node: &'ast Statement) -> ControlFlow {\n match node {\n Statement::Empty | Statement::Var(_) => {}\n Statement::Block(node) => self.visit(node)?,\n Statement::Labelled(node) => self.visit(node)?,\n _ => return ControlFlow::Break(()),\n }\n ControlFlow::Continue(())\n }\n\n fn visit_case(&mut self, node: &'ast crate::statement::Case) -> ControlFlow {\n for statement in node.body().statements() {\n match statement {\n StatementListItem::Declaration(_) => {}\n StatementListItem::Statement(node) => self.visit(node.as_ref())?,\n }\n }\n ControlFlow::Continue(())\n }\n\n fn visit_labelled(\n &mut self,\n node: &'ast crate::statement::Labelled,\n ) -> ControlFlow {\n match node.item() {\n LabelledItem::Statement(node) => self.visit(node)?,\n LabelledItem::FunctionDeclaration(_) => {}\n }\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/operations/tests.rs", "content": "use boa_interner::Interner;\n\nuse crate::{\n Position, Span, Statement,\n expression::{Call, Identifier, NewTarget, This},\n operations::{ContainsSymbol, contains},\n statement::With,\n};\n\nfn empty_span() -> Span {\n Span::new(Position::new(1, 1), Position::new(1, 1))\n}\n\n#[test]\nfn check_contains_this_in_with_statement_expression() {\n let node = With::new(This::new(empty_span()).into(), Statement::Empty);\n assert!(contains(&node, ContainsSymbol::This));\n}\n\n#[test]\nfn check_contains_new_target_in_with_statement_expression() {\n let node = With::new(NewTarget::new(empty_span()).into(), Statement::Empty);\n assert!(contains(&node, ContainsSymbol::NewTarget));\n}\n\n#[test]\nfn check_contains_new_target_in_call_function_position() {\n let node = Call::new(\n NewTarget::new(empty_span()).into(),\n Box::default(),\n empty_span(),\n );\n assert!(contains(&node, ContainsSymbol::NewTarget));\n}\n\n#[test]\nfn check_contains_this_in_call_argument_position() {\n let mut interner = Interner::new();\n let function_name = Identifier::new(interner.get_or_intern(\"func\"), Span::new((1, 1), (1, 5)));\n let node = Call::new(\n function_name.into(),\n vec![This::new(empty_span()).into()].into_boxed_slice(),\n empty_span(),\n );\n\n assert!(contains(&node, ContainsSymbol::This));\n}\n\n#[test]\nfn check_contains_new_target_in_call_argument_position() {\n let mut interner = Interner::new();\n let function_name = Identifier::new(interner.get_or_intern(\"func\"), Span::new((1, 1), (1, 5)));\n let node = Call::new(\n function_name.into(),\n vec![NewTarget::new(empty_span()).into()].into_boxed_slice(),\n empty_span(),\n );\n\n assert!(contains(&node, ContainsSymbol::NewTarget));\n}\n" }, { "path": "core/ast/src/pattern.rs", "content": "//! A pattern binding or assignment node.\n//!\n//! A [`Pattern`] Corresponds to the [`BindingPattern`][spec1] and the [`AssignmentPattern`][spec2]\n//! nodes, each of which is used in different situations and have slightly different grammars.\n//! For example, a variable declaration combined with a destructuring expression is a `BindingPattern`:\n//!\n//! ```Javascript\n//! const obj = { a: 1, b: 2 };\n//! const { a, b } = obj; // BindingPattern\n//! ```\n//!\n//! On the other hand, a simple destructuring expression with already declared variables is called\n//! an `AssignmentPattern`:\n//!\n//! ```Javascript\n//! let a = 1;\n//! let b = 3;\n//! [a, b] = [b, a]; // AssignmentPattern\n//! ```\n//!\n//! [spec1]: https://tc39.es/ecma262/#prod-BindingPattern\n//! [spec2]: https://tc39.es/ecma262/#prod-AssignmentPattern\n//! [destr]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Destructuring_assignment\n\nuse crate::{\n Expression, Span, Spanned,\n expression::{Identifier, access::PropertyAccess},\n property::PropertyName,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// An object or array pattern binding or assignment.\n///\n/// See the [module level documentation][self] for more information.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum Pattern {\n /// An object pattern (`let {a, b, c} = object`).\n Object(ObjectPattern),\n /// An array pattern (`[a, b, c] = array`).\n Array(ArrayPattern),\n}\n\nimpl Spanned for Pattern {\n #[inline]\n fn span(&self) -> Span {\n match self {\n Pattern::Object(object_pattern) => object_pattern.span(),\n Pattern::Array(array_pattern) => array_pattern.span(),\n }\n }\n}\n\nimpl From for Pattern {\n fn from(obj: ObjectPattern) -> Self {\n Self::Object(obj)\n }\n}\n\nimpl From for Pattern {\n fn from(obj: ArrayPattern) -> Self {\n Self::Array(obj)\n }\n}\n\nimpl ToInternedString for Pattern {\n fn to_interned_string(&self, interner: &Interner) -> String {\n match &self {\n Self::Object(o) => o.to_interned_string(interner),\n Self::Array(a) => a.to_interned_string(interner),\n }\n }\n}\n\nimpl VisitWith for Pattern {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Object(op) => visitor.visit_object_pattern(op),\n Self::Array(ap) => visitor.visit_array_pattern(ap),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Object(op) => visitor.visit_object_pattern_mut(op),\n Self::Array(ap) => visitor.visit_array_pattern_mut(ap),\n }\n }\n}\n\n/// An object binding or assignment pattern.\n///\n/// Corresponds to the [`ObjectBindingPattern`][spec1] and the [`ObjectAssignmentPattern`][spec2]\n/// Parse Nodes.\n///\n/// For more information on what is a valid binding in an object pattern, see [`ObjectPatternElement`].\n///\n/// [spec1]: https://tc39.es/ecma262/#prod-ObjectBindingPattern\n/// [spec2]: https://tc39.es/ecma262/#prod-ObjectAssignmentPattern\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ObjectPattern {\n elements: Box<[ObjectPatternElement]>,\n span: Span,\n}\n\nimpl ToInternedString for ObjectPattern {\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = \"{\".to_owned();\n for (i, binding) in self.elements.iter().enumerate() {\n let binding = binding.to_interned_string(interner);\n let str = if i == self.elements.len() - 1 {\n format!(\"{binding} \")\n } else {\n format!(\"{binding},\")\n };\n\n buf.push_str(&str);\n }\n if self.elements.is_empty() {\n buf.push(' ');\n }\n buf.push('}');\n buf\n }\n}\n\nimpl ObjectPattern {\n /// Creates a new object binding pattern.\n #[inline]\n #[must_use]\n pub const fn new(elements: Box<[ObjectPatternElement]>, span: Span) -> Self {\n Self { elements, span }\n }\n\n /// Gets the bindings for the object binding pattern.\n #[inline]\n #[must_use]\n pub const fn bindings(&self) -> &[ObjectPatternElement] {\n &self.elements\n }\n\n /// Returns true if the object binding pattern has a rest element.\n #[inline]\n #[must_use]\n pub const fn has_rest(&self) -> bool {\n matches!(\n self.elements.last(),\n Some(ObjectPatternElement::RestProperty { .. })\n )\n }\n}\n\nimpl Spanned for ObjectPattern {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl VisitWith for ObjectPattern {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for elem in &*self.elements {\n visitor.visit_object_pattern_element(elem)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for elem in &mut *self.elements {\n visitor.visit_object_pattern_element_mut(elem)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// An array binding or assignment pattern.\n///\n/// Corresponds to the [`ArrayBindingPattern`][spec1] and the [`ArrayAssignmentPattern`][spec2]\n/// Parse Nodes.\n///\n/// For more information on what is a valid binding in an array pattern, see [`ArrayPatternElement`].\n///\n/// [spec1]: https://tc39.es/ecma262/#prod-ArrayBindingPattern\n/// [spec2]: https://tc39.es/ecma262/#prod-ArrayAssignmentPattern\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ArrayPattern {\n bindings: Box<[ArrayPatternElement]>,\n span: Span,\n}\n\nimpl ToInternedString for ArrayPattern {\n fn to_interned_string(&self, interner: &Interner) -> String {\n let mut buf = \"[\".to_owned();\n for (i, binding) in self.bindings.iter().enumerate() {\n if i == self.bindings.len() - 1 {\n match binding {\n ArrayPatternElement::Elision => {\n let _ = write!(buf, \"{}, \", binding.to_interned_string(interner));\n }\n _ => {\n let _ = write!(buf, \"{} \", binding.to_interned_string(interner));\n }\n }\n } else {\n let _ = write!(buf, \"{},\", binding.to_interned_string(interner));\n }\n }\n buf.push(']');\n buf\n }\n}\n\nimpl ArrayPattern {\n /// Creates a new array binding pattern.\n #[inline]\n #[must_use]\n pub fn new(bindings: Box<[ArrayPatternElement]>, span: Span) -> Self {\n Self { bindings, span }\n }\n\n /// Gets the bindings for the array binding pattern.\n #[inline]\n #[must_use]\n pub const fn bindings(&self) -> &[ArrayPatternElement] {\n &self.bindings\n }\n}\n\nimpl Spanned for ArrayPattern {\n #[inline]\n fn span(&self) -> Span {\n self.span\n }\n}\n\nimpl VisitWith for ArrayPattern {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for elem in &*self.bindings {\n visitor.visit_array_pattern_element(elem)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for elem in &mut *self.bindings {\n visitor.visit_array_pattern_element_mut(elem)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n/// The different types of bindings that an [`ObjectPattern`] may contain.\n///\n/// Corresponds to the [`BindingProperty`][spec1] and the [`AssignmentProperty`][spec2] nodes.\n///\n/// [spec1]: https://tc39.es/ecma262/#prod-BindingProperty\n/// [spec2]: https://tc39.es/ecma262/#prod-AssignmentProperty\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum ObjectPatternElement {\n /// `SingleName` represents one of the following properties:\n ///\n /// - `SingleName` with an identifier and an optional default initializer.\n /// - `BindingProperty` with an property name and a `SingleNameBinding` as the `BindingElement`.\n ///\n /// More information:\n /// - [ECMAScript reference: 14.3.3 Destructuring Binding Patterns - SingleNameBinding][spec1]\n /// - [ECMAScript reference: 14.3.3 Destructuring Binding Patterns - BindingProperty][spec2]\n ///\n /// [spec1]: https://tc39.es/ecma262/#prod-SingleNameBinding\n /// [spec2]: https://tc39.es/ecma262/#prod-BindingProperty\n SingleName {\n /// The identifier name of the property to be destructured.\n name: PropertyName,\n /// The variable name where the property value will be stored.\n ident: Identifier,\n /// An optional default value for the variable, in case the property doesn't exist.\n default_init: Option,\n },\n\n /// `RestProperty` represents a `BindingRestProperty` with an identifier.\n ///\n /// It also includes a list of the property keys that should be excluded from the rest,\n /// because they where already assigned.\n ///\n /// More information:\n /// - [ECMAScript reference: 14.3.3 Destructuring Binding Patterns - BindingRestProperty][spec1]\n ///\n /// [spec1]: https://tc39.es/ecma262/#prod-BindingRestProperty\n RestProperty {\n /// The variable name where the unassigned properties will be stored.\n ident: Identifier,\n },\n\n /// `AssignmentGetField` represents an `AssignmentProperty` with an expression field member expression `AssignmentElement`.\n ///\n /// Note: According to the spec this is not part of an `ObjectBindingPattern`.\n /// This is only used when a object literal is used to cover an `AssignmentPattern`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentProperty\n AssignmentPropertyAccess {\n /// The identifier name of the property to be destructured.\n name: PropertyName,\n /// The property access where the property value will be destructured.\n access: PropertyAccess,\n /// An optional default value for the variable, in case the property doesn't exist.\n default_init: Option,\n },\n\n /// `AssignmentRestProperty` represents a rest property with a `DestructuringAssignmentTarget`.\n ///\n /// Note: According to the spec this is not part of an `ObjectBindingPattern`.\n /// This is only used when a object literal is used to cover an `AssignmentPattern`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentRestProperty\n AssignmentRestPropertyAccess {\n /// The property access where the unassigned properties will be stored.\n access: PropertyAccess,\n },\n\n /// Pattern represents a property with a `Pattern` as the element.\n ///\n /// Additionally to the identifier of the new property and the nested pattern,\n /// this may also include an optional default initializer.\n ///\n /// More information:\n /// - [ECMAScript reference: 14.3.3 Destructuring Binding Patterns - BindingProperty][spec1]\n ///\n /// [spec1]: https://tc39.es/ecma262/#prod-BindingProperty\n Pattern {\n /// The identifier name of the property to be destructured.\n name: PropertyName,\n /// The pattern where the property value will be destructured.\n pattern: Pattern,\n /// An optional default value for the variable, in case the property doesn't exist.\n default_init: Option,\n },\n}\n\nimpl ToInternedString for ObjectPatternElement {\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self {\n Self::SingleName {\n ident,\n name,\n default_init,\n } => {\n let mut buf = match name {\n PropertyName::Literal(name) if name == ident => {\n format!(\" {}\", interner.resolve_expect(ident.sym()))\n }\n PropertyName::Literal(name) => {\n format!(\n \" {} : {}\",\n interner.resolve_expect(name.sym()),\n interner.resolve_expect(ident.sym())\n )\n }\n PropertyName::Computed(node) => {\n format!(\n \" [{}] : {}\",\n node.to_interned_string(interner),\n interner.resolve_expect(ident.sym())\n )\n }\n };\n if let Some(init) = default_init {\n let _ = write!(buf, \" = {}\", init.to_interned_string(interner));\n }\n buf\n }\n Self::RestProperty { ident } => {\n format!(\" ... {}\", interner.resolve_expect(ident.sym()))\n }\n Self::AssignmentRestPropertyAccess { access } => {\n format!(\" ... {}\", access.to_interned_string(interner))\n }\n Self::AssignmentPropertyAccess {\n name,\n access,\n default_init,\n } => {\n let mut buf = match name {\n PropertyName::Literal(name) => {\n format!(\n \" {} : {}\",\n interner.resolve_expect(name.sym()),\n access.to_interned_string(interner)\n )\n }\n PropertyName::Computed(node) => {\n format!(\n \" [{}] : {}\",\n node.to_interned_string(interner),\n access.to_interned_string(interner)\n )\n }\n };\n if let Some(init) = &default_init {\n let _ = write!(buf, \" = {}\", init.to_interned_string(interner));\n }\n buf\n }\n Self::Pattern {\n name,\n pattern,\n default_init,\n } => {\n let mut buf = match name {\n PropertyName::Literal(name) => {\n format!(\n \" {} : {}\",\n interner.resolve_expect(name.sym()),\n pattern.to_interned_string(interner),\n )\n }\n PropertyName::Computed(node) => {\n format!(\n \" [{}] : {}\",\n node.to_interned_string(interner),\n pattern.to_interned_string(interner),\n )\n }\n };\n if let Some(init) = default_init {\n let _ = write!(buf, \" = {}\", init.to_interned_string(interner));\n }\n buf\n }\n }\n }\n}\n\nimpl VisitWith for ObjectPatternElement {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::SingleName {\n name,\n ident,\n default_init,\n } => {\n visitor.visit_property_name(name)?;\n visitor.visit_identifier(ident)?;\n if let Some(expr) = default_init {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::RestProperty { ident, .. } => visitor.visit_identifier(ident),\n Self::AssignmentPropertyAccess {\n name,\n access,\n default_init,\n } => {\n visitor.visit_property_name(name)?;\n visitor.visit_property_access(access)?;\n if let Some(expr) = default_init {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::AssignmentRestPropertyAccess { access, .. } => {\n visitor.visit_property_access(access)\n }\n Self::Pattern {\n name,\n pattern,\n default_init,\n } => {\n visitor.visit_property_name(name)?;\n visitor.visit_pattern(pattern)?;\n if let Some(expr) = default_init {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::SingleName {\n name,\n ident,\n default_init,\n } => {\n visitor.visit_property_name_mut(name)?;\n visitor.visit_identifier_mut(ident)?;\n if let Some(expr) = default_init {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::RestProperty { ident, .. } => visitor.visit_identifier_mut(ident),\n Self::AssignmentPropertyAccess {\n name,\n access,\n default_init,\n } => {\n visitor.visit_property_name_mut(name)?;\n visitor.visit_property_access_mut(access)?;\n if let Some(expr) = default_init {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::AssignmentRestPropertyAccess { access, .. } => {\n visitor.visit_property_access_mut(access)\n }\n Self::Pattern {\n name,\n pattern,\n default_init,\n } => {\n visitor.visit_property_name_mut(name)?;\n visitor.visit_pattern_mut(pattern)?;\n if let Some(expr) = default_init {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n }\n }\n}\n\n/// The different types of bindings that an array binding pattern may contain.\n///\n/// Corresponds to the [`BindingElement`][spec1] and the [`AssignmentElement`][spec2] nodes.\n///\n/// [spec1]: https://tc39.es/ecma262/#prod-BindingElement\n/// [spec2]: https://tc39.es/ecma262/#prod-AssignmentElement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum ArrayPatternElement {\n /// Elision represents the elision of an item in the array binding pattern.\n ///\n /// An `Elision` may occur at multiple points in the pattern and may be multiple elisions.\n /// This variant strictly represents one elision. If there are multiple, this should be used multiple times.\n ///\n /// More information:\n /// - [ECMAScript reference: 13.2.4 Array Initializer - Elision][spec1]\n ///\n /// [spec1]: https://tc39.es/ecma262/#prod-Elision\n Elision,\n\n /// `SingleName` represents a `SingleName` with an identifier and an optional default initializer.\n ///\n /// More information:\n /// - [ECMAScript reference: 14.3.3 Destructuring Binding Patterns - SingleNameBinding][spec1]\n ///\n /// [spec1]: https://tc39.es/ecma262/#prod-SingleNameBinding\n SingleName {\n /// The variable name where the index element will be stored.\n ident: Identifier,\n /// An optional default value for the variable, in case the index element doesn't exist.\n default_init: Option,\n },\n\n /// `PropertyAccess` represents a binding with a property accessor.\n ///\n /// Note: According to the spec this is not part of an `ArrayBindingPattern`.\n /// This is only used when a array literal is used as the left-hand-side of an assignment expression.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentExpression\n PropertyAccess {\n /// The property access where the index element will be stored.\n access: PropertyAccess,\n /// An optional default value for the variable, in case the index element doesn't exist.\n default_init: Option,\n },\n\n /// Pattern represents a `Pattern` in an `Element` of an array pattern.\n ///\n /// The pattern and the optional default initializer are both stored in the `DeclarationPattern`.\n ///\n /// More information:\n /// - [ECMAScript reference: 14.3.3 Destructuring Binding Patterns - BindingElement][spec1]\n ///\n /// [spec1]: https://tc39.es/ecma262/#prod-BindingElement\n Pattern {\n /// The pattern where the index element will be stored.\n pattern: Pattern,\n /// An optional default value for the pattern, in case the index element doesn't exist.\n default_init: Option,\n },\n\n /// `SingleNameRest` represents a `BindingIdentifier` in a `BindingRestElement` of an array pattern.\n ///\n /// More information:\n /// - [ECMAScript reference: 14.3.3 Destructuring Binding Patterns - BindingRestElement][spec1]\n ///\n /// [spec1]: https://tc39.es/ecma262/#prod-BindingRestElement\n SingleNameRest {\n /// The variable where the unassigned index elements will be stored.\n ident: Identifier,\n },\n\n /// `PropertyAccess` represents a rest (spread operator) with a property accessor.\n ///\n /// Note: According to the spec this is not part of an `ArrayBindingPattern`.\n /// This is only used when a array literal is used as the left-hand-side of an assignment expression.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-AssignmentExpression\n PropertyAccessRest {\n /// The property access where the unassigned index elements will be stored.\n access: PropertyAccess,\n },\n\n /// `PatternRest` represents a `Pattern` in a `RestElement` of an array pattern.\n ///\n /// More information:\n /// - [ECMAScript reference: 14.3.3 Destructuring Binding Patterns - BindingRestElement][spec1]\n ///\n /// [spec1]: https://tc39.es/ecma262/#prod-BindingRestElement\n PatternRest {\n /// The pattern where the unassigned index elements will be stored.\n pattern: Pattern,\n },\n}\n\nimpl ToInternedString for ArrayPatternElement {\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self {\n Self::Elision => \" \".to_owned(),\n Self::SingleName {\n ident,\n default_init,\n } => {\n let mut buf = format!(\" {}\", interner.resolve_expect(ident.sym()));\n if let Some(init) = default_init {\n let _ = write!(buf, \" = {}\", init.to_interned_string(interner));\n }\n buf\n }\n Self::PropertyAccess {\n access,\n default_init,\n } => {\n let mut buf = format!(\" {}\", access.to_interned_string(interner));\n if let Some(init) = default_init {\n let _ = write!(buf, \" = {}\", init.to_interned_string(interner));\n }\n buf\n }\n Self::Pattern {\n pattern,\n default_init,\n } => {\n let mut buf = format!(\" {}\", pattern.to_interned_string(interner));\n if let Some(init) = default_init {\n let _ = write!(buf, \" = {}\", init.to_interned_string(interner));\n }\n buf\n }\n Self::SingleNameRest { ident } => {\n format!(\" ... {}\", interner.resolve_expect(ident.sym()))\n }\n Self::PropertyAccessRest { access } => {\n format!(\" ... {}\", access.to_interned_string(interner))\n }\n Self::PatternRest { pattern } => {\n format!(\" ... {}\", pattern.to_interned_string(interner))\n }\n }\n }\n}\n\nimpl VisitWith for ArrayPatternElement {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::SingleName {\n ident,\n default_init,\n } => {\n visitor.visit_identifier(ident)?;\n if let Some(expr) = default_init {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::PropertyAccess {\n access,\n default_init,\n } => {\n visitor.visit_property_access(access)?;\n if let Some(expr) = default_init {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::PropertyAccessRest { access } => visitor.visit_property_access(access),\n Self::Pattern {\n pattern,\n default_init,\n } => {\n visitor.visit_pattern(pattern)?;\n if let Some(expr) = default_init {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::SingleNameRest { ident } => visitor.visit_identifier(ident),\n Self::PatternRest { pattern } => visitor.visit_pattern(pattern),\n Self::Elision => {\n // special case to be handled by user\n ControlFlow::Continue(())\n }\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::SingleName {\n ident,\n default_init,\n } => {\n visitor.visit_identifier_mut(ident)?;\n if let Some(expr) = default_init {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::PropertyAccess {\n access,\n default_init,\n } => {\n visitor.visit_property_access_mut(access)?;\n if let Some(expr) = default_init {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::PropertyAccessRest { access } => visitor.visit_property_access_mut(access),\n Self::Pattern {\n pattern,\n default_init,\n } => {\n visitor.visit_pattern_mut(pattern)?;\n if let Some(expr) = default_init {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n Self::SingleNameRest { ident } => visitor.visit_identifier_mut(ident),\n Self::PatternRest { pattern } => visitor.visit_pattern_mut(pattern),\n Self::Elision => {\n // special case to be handled by user\n ControlFlow::Continue(())\n }\n }\n }\n}\n" }, { "path": "core/ast/src/position.rs", "content": "use std::{\n cmp::Ordering,\n fmt::{self, Debug},\n num::NonZeroU32,\n};\n\n/// A position in the ECMAScript source code.\n///\n/// Stores both the column number and the line number.\n///\n/// ## Similar Implementations\n/// [V8: Location](https://cs.chromium.org/chromium/src/v8/src/parsing/scanner.h?type=cs&q=isValid+Location&g=0&l=216)\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\npub struct Position {\n /// Line number.\n line_number: NonZeroU32,\n /// Column number.\n column_number: NonZeroU32,\n}\n\nimpl Default for Position {\n /// Creates a new [`Position`] with line and column set to `1`.\n #[inline]\n fn default() -> Self {\n Self::new(1, 1)\n }\n}\n\nimpl Position {\n /// Creates a new `Position` from Non-Zero values.\n ///\n /// # Panics\n ///\n /// Will panic if the line number or column number is zero.\n #[inline]\n #[track_caller]\n #[must_use]\n pub const fn new(line_number: u32, column_number: u32) -> Self {\n Self {\n line_number: NonZeroU32::new(line_number).expect(\"line number cannot be 0\"),\n column_number: NonZeroU32::new(column_number).expect(\"column number cannot be 0\"),\n }\n }\n\n /// Gets the line number of the position.\n #[inline]\n #[must_use]\n pub const fn line_number(self) -> u32 {\n self.line_number.get()\n }\n\n /// Gets the column number of the position.\n #[inline]\n #[must_use]\n pub const fn column_number(self) -> u32 {\n self.column_number.get()\n }\n}\n\nimpl fmt::Display for Position {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"{}:{}\", self.line_number, self.column_number)\n }\n}\n\nimpl From for Position {\n #[inline]\n fn from(value: PositionGroup) -> Self {\n value.pos\n }\n}\n\nimpl From<(NonZeroU32, NonZeroU32)> for Position {\n #[inline]\n fn from(value: (NonZeroU32, NonZeroU32)) -> Self {\n Position {\n line_number: value.0,\n column_number: value.1,\n }\n }\n}\n\nimpl From<(u32, u32)> for Position {\n #[inline]\n #[track_caller]\n fn from(value: (u32, u32)) -> Self {\n Position::new(value.0, value.1)\n }\n}\n\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for Span {\n fn arbitrary(_u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n Ok(Span::new(Position::new(1, 1), Position::new(1, 1)))\n }\n}\n\n/// Linear position in the ECMAScript source code.\n///\n/// Stores linear position in the source code.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\npub struct LinearPosition {\n pos: usize,\n}\n\nimpl LinearPosition {\n /// Creates a new `LinearPosition`.\n #[inline]\n #[must_use]\n pub const fn new(pos: usize) -> Self {\n Self { pos }\n }\n /// Gets the linear position.\n #[inline]\n #[must_use]\n pub const fn pos(self) -> usize {\n self.pos\n }\n}\nimpl fmt::Display for LinearPosition {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"{}\", self.pos())\n }\n}\n\n/// A span in the ECMAScript source code.\n///\n/// Stores a start position and an end position.\n///\n/// Note that spans are of the form [start, end) i.e. that the start position is inclusive\n/// and the end position is exclusive.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Copy, PartialEq, Eq, Hash)]\npub struct Span {\n start: Position,\n end: Position,\n}\n\nimpl Debug for Span {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(\n f,\n \"Span(({}, {}), ({}, {}))\",\n self.start.line_number,\n self.start.column_number,\n self.end.line_number,\n self.end.column_number,\n )\n }\n}\n\nimpl Span {\n /// Creates a new `Span`.\n ///\n /// # Panics\n ///\n /// Panics if the start position is bigger than the end position.\n #[inline]\n #[track_caller]\n #[must_use]\n pub fn new(start: T, end: U) -> Self\n where\n T: Into,\n U: Into,\n {\n let start = start.into();\n let end = end.into();\n\n assert!(start <= end, \"a span cannot start after its end\");\n\n Self { start, end }\n }\n\n /// Gets the starting position of the span.\n #[inline]\n #[must_use]\n pub const fn start(self) -> Position {\n self.start\n }\n\n /// Gets the final position of the span.\n #[inline]\n #[must_use]\n pub const fn end(self) -> Position {\n self.end\n }\n\n /// Checks if this span inclusively contains another span or position.\n pub fn contains(self, other: S) -> bool\n where\n S: Into,\n {\n let other = other.into();\n self.start <= other.start && self.end >= other.end\n }\n}\n\nimpl From for Span {\n fn from(pos: Position) -> Self {\n Self {\n start: pos,\n end: pos,\n }\n }\n}\n\nimpl Spanned for Span {\n #[inline]\n fn span(&self) -> Span {\n *self\n }\n}\n\nimpl Spanned for &T {\n #[inline]\n fn span(&self) -> Span {\n T::span(*self)\n }\n}\n\nimpl PartialOrd for Span {\n fn partial_cmp(&self, other: &Self) -> Option {\n if self == other {\n Some(Ordering::Equal)\n } else if self.end < other.start {\n Some(Ordering::Less)\n } else if self.start > other.end {\n Some(Ordering::Greater)\n } else {\n None\n }\n }\n}\n\nimpl fmt::Display for Span {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"[{}..{}]\", self.start, self.end)\n }\n}\n\n/// An element of the AST or any type that can be located in the source with a Span.\npub trait Spanned {\n /// Returns a span from the current type.\n #[must_use]\n fn span(&self) -> Span;\n}\n\n/// A linear span in the ECMAScript source code.\n///\n/// Stores a linear start position and a linear end position.\n///\n/// Note that linear spans are of the form [start, end) i.e. that the\n/// start position is inclusive and the end position is exclusive.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, Hash)]\npub struct LinearSpan {\n start: LinearPosition,\n end: LinearPosition,\n}\nimpl LinearSpan {\n /// Creates a new `LinearSpan`.\n ///\n /// # Panics\n ///\n /// Panics if the start position is bigger than the end position.\n #[inline]\n #[track_caller]\n #[must_use]\n pub const fn new(start: LinearPosition, end: LinearPosition) -> Self {\n assert!(\n start.pos <= end.pos,\n \"a linear span cannot start after its end\"\n );\n\n Self { start, end }\n }\n\n /// Test if the span is empty.\n #[inline]\n #[must_use]\n pub fn is_empty(self) -> bool {\n self.start == self.end\n }\n\n /// Gets the starting position of the span.\n #[inline]\n #[must_use]\n pub const fn start(self) -> LinearPosition {\n self.start\n }\n\n /// Gets the final position of the span.\n #[inline]\n #[must_use]\n pub const fn end(self) -> LinearPosition {\n self.end\n }\n\n /// Checks if this span inclusively contains another span or position.\n pub fn contains(self, other: S) -> bool\n where\n S: Into,\n {\n let other = other.into();\n self.start <= other.start && self.end >= other.end\n }\n\n /// Gets the starting position of the span.\n #[inline]\n #[must_use]\n pub fn union(self, other: impl Into) -> Self {\n let other: Self = other.into();\n Self {\n start: LinearPosition::new(self.start.pos.min(other.start.pos)),\n end: LinearPosition::new(self.end.pos.max(other.end.pos)),\n }\n }\n}\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for LinearSpan {\n fn arbitrary(_: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n let zero_pos = LinearPosition::new(0);\n Ok(Self::new(zero_pos, zero_pos))\n }\n}\n\nimpl From for LinearSpan {\n fn from(pos: LinearPosition) -> Self {\n Self {\n start: pos,\n end: pos,\n }\n }\n}\n\nimpl PartialOrd for LinearSpan {\n fn partial_cmp(&self, other: &Self) -> Option {\n if self == other {\n Some(Ordering::Equal)\n } else if self.end < other.start {\n Some(Ordering::Less)\n } else if self.start > other.end {\n Some(Ordering::Greater)\n } else {\n None\n }\n }\n}\n\n/// Stores a `LinearSpan` but `PartialEq`, `Eq` always return true.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Debug, Clone, Copy)]\npub struct LinearSpanIgnoreEq(pub LinearSpan);\nimpl PartialEq for LinearSpanIgnoreEq {\n fn eq(&self, _: &Self) -> bool {\n true\n }\n}\nimpl From for LinearSpanIgnoreEq {\n fn from(value: LinearSpan) -> Self {\n Self(value)\n }\n}\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for LinearSpanIgnoreEq {\n fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n Ok(Self(LinearSpan::arbitrary(u)?))\n }\n}\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\n/// A position group of `LinearPosition` and `Position` related to the same position in the ECMAScript source code.\npub struct PositionGroup {\n pos: Position,\n linear_pos: LinearPosition,\n}\nimpl PositionGroup {\n /// Creates a new `PositionGroup`.\n #[inline]\n #[must_use]\n pub const fn new(pos: Position, linear_pos: LinearPosition) -> Self {\n Self { pos, linear_pos }\n }\n /// Get the `Position`.\n #[inline]\n #[must_use]\n pub fn position(&self) -> Position {\n self.pos\n }\n /// Get the `LinearPosition`.\n #[inline]\n #[must_use]\n pub fn linear_position(&self) -> LinearPosition {\n self.linear_pos\n }\n\n /// Gets the line number of the position.\n #[inline]\n #[must_use]\n pub const fn line_number(&self) -> u32 {\n self.pos.line_number()\n }\n\n /// Gets the column number of the position.\n #[inline]\n #[must_use]\n pub const fn column_number(&self) -> u32 {\n self.pos.column_number()\n }\n}\n\n#[cfg(test)]\nmod tests {\n #![allow(clippy::similar_names)]\n #![allow(unused_must_use)]\n use super::{LinearPosition, LinearSpan, Position, Span};\n\n /// Checks that we cannot create a position with 0 as the column.\n #[test]\n #[should_panic(expected = \"column number cannot be 0\")]\n fn invalid_position_column() {\n Position::new(10, 0);\n }\n\n /// Checks that we cannot create a position with 0 as the line.\n #[test]\n #[should_panic(expected = \"line number cannot be 0\")]\n fn invalid_position_line() {\n Position::new(0, 10);\n }\n\n /// Checks that the `PartialEq` implementation of `Position` is consistent.\n #[test]\n fn position_equality() {\n assert_eq!(Position::new(10, 50), Position::new(10, 50));\n assert_ne!(Position::new(10, 50), Position::new(10, 51));\n assert_ne!(Position::new(10, 50), Position::new(11, 50));\n assert_ne!(Position::new(10, 50), Position::new(11, 51));\n }\n\n /// Checks that the `PartialEq` implementation of `LinearPosition` is consistent.\n #[test]\n fn linear_position_equality() {\n assert_eq!(LinearPosition::new(1050), LinearPosition::new(1050));\n assert_ne!(LinearPosition::new(1050), LinearPosition::new(1051));\n }\n\n /// Checks that the `PartialOrd` implementation of `Position` is consistent.\n #[test]\n fn position_order() {\n assert!(Position::new(10, 50) < Position::new(10, 51));\n assert!(Position::new(9, 50) < Position::new(10, 50));\n assert!(Position::new(10, 50) < Position::new(11, 51));\n assert!(Position::new(10, 50) < Position::new(11, 49));\n\n assert!(Position::new(10, 51) > Position::new(10, 50));\n assert!(Position::new(10, 50) > Position::new(9, 50));\n assert!(Position::new(11, 51) > Position::new(10, 50));\n assert!(Position::new(11, 49) > Position::new(10, 50));\n }\n\n /// Checks that the `PartialOrd` implementation of `LinearPosition` is consistent.\n #[test]\n fn linear_position_order() {\n assert!(LinearPosition::new(1050) < LinearPosition::new(1051));\n assert!(LinearPosition::new(1149) > LinearPosition::new(1050));\n }\n\n /// Checks that the position getters actually retrieve correct values.\n #[test]\n fn position_getters() {\n let pos = Position::new(10, 50);\n assert_eq!(pos.line_number(), 10);\n assert_eq!(pos.column_number(), 50);\n }\n\n /// Checks that the string representation of a position is correct.\n #[test]\n fn position_to_string() {\n let pos = Position::new(10, 50);\n\n assert_eq!(\"10:50\", pos.to_string());\n assert_eq!(\"10:50\", pos.to_string());\n }\n\n /// Checks that we cannot create an invalid span.\n #[test]\n #[should_panic(expected = \"a span cannot start after its end\")]\n fn invalid_span() {\n let a = Position::new(10, 30);\n let b = Position::new(10, 50);\n Span::new(b, a);\n }\n\n /// Checks that we cannot create an invalid linear span.\n #[test]\n #[should_panic(expected = \"a linear span cannot start after its end\")]\n fn invalid_linear_span() {\n let a = LinearPosition::new(1030);\n let b = LinearPosition::new(1050);\n LinearSpan::new(b, a);\n }\n\n /// Checks that we can create valid spans.\n #[test]\n fn span_creation() {\n let a = Position::new(10, 30);\n let b = Position::new(10, 50);\n\n Span::new(a, b);\n Span::new(a, a);\n Span::from(a);\n }\n\n /// Checks that we can create valid linear spans.\n #[test]\n fn linear_span_creation() {\n let a = LinearPosition::new(1030);\n let b = LinearPosition::new(1050);\n\n LinearSpan::new(a, b);\n let span_aa = LinearSpan::new(a, a);\n assert_eq!(LinearSpan::from(a), span_aa);\n }\n\n /// Checks that the `PartialEq` implementation of `Span` is consistent.\n #[test]\n fn span_equality() {\n let a = Position::new(10, 50);\n let b = Position::new(10, 52);\n let c = Position::new(11, 20);\n\n let span_ab = Span::new(a, b);\n let span_ab_2 = Span::new(a, b);\n let span_ac = Span::new(a, c);\n let span_bc = Span::new(b, c);\n\n assert_eq!(span_ab, span_ab_2);\n assert_ne!(span_ab, span_ac);\n assert_ne!(span_ab, span_bc);\n assert_ne!(span_bc, span_ac);\n\n let span_a = Span::from(a);\n let span_aa = Span::new(a, a);\n\n assert_eq!(span_a, span_aa);\n }\n\n /// Checks that the `PartialEq` implementation of `LinearSpan` is consistent.\n #[test]\n fn linear_span_equality() {\n let a = LinearPosition::new(1030);\n let b = LinearPosition::new(1050);\n let c = LinearPosition::new(1150);\n\n let span_ab = LinearSpan::new(a, b);\n let span_ab_2 = LinearSpan::new(a, b);\n let span_ac = LinearSpan::new(a, c);\n let span_bc = LinearSpan::new(b, c);\n\n assert_eq!(span_ab, span_ab_2);\n assert_ne!(span_ab, span_ac);\n assert_ne!(span_ab, span_bc);\n assert_ne!(span_bc, span_ac);\n }\n\n /// Checks that the getters retrieve the correct value.\n #[test]\n fn span_getters() {\n let a = Position::new(10, 50);\n let b = Position::new(10, 52);\n\n let span = Span::new(a, b);\n\n assert_eq!(span.start(), a);\n assert_eq!(span.end(), b);\n }\n\n /// Checks that the `Span::contains()` method works properly.\n #[test]\n fn span_contains() {\n let a = Position::new(10, 50);\n let b = Position::new(10, 52);\n let c = Position::new(11, 20);\n let d = Position::new(12, 5);\n\n let span_ac = Span::new(a, c);\n assert!(span_ac.contains(b));\n\n let span_ab = Span::new(a, b);\n let span_cd = Span::new(c, d);\n\n assert!(!span_ab.contains(span_cd));\n assert!(span_ab.contains(b));\n\n let span_ad = Span::new(a, d);\n let span_bc = Span::new(b, c);\n\n assert!(span_ad.contains(span_bc));\n assert!(!span_bc.contains(span_ad));\n\n let span_ac = Span::new(a, c);\n let span_bd = Span::new(b, d);\n\n assert!(!span_ac.contains(span_bd));\n assert!(!span_bd.contains(span_ac));\n }\n\n /// Checks that the `LinearSpan::contains()` method works properly.\n #[test]\n fn linear_span_contains() {\n let a = LinearPosition::new(1050);\n let b = LinearPosition::new(1080);\n let c = LinearPosition::new(1120);\n let d = LinearPosition::new(1125);\n\n let span_ac = LinearSpan::new(a, c);\n assert!(span_ac.contains(b));\n\n let span_ab = LinearSpan::new(a, b);\n let span_cd = LinearSpan::new(c, d);\n\n assert!(!span_ab.contains(span_cd));\n assert!(span_ab.contains(b));\n\n let span_ad = LinearSpan::new(a, d);\n let span_bc = LinearSpan::new(b, c);\n\n assert!(span_ad.contains(span_bc));\n assert!(!span_bc.contains(span_ad));\n\n let span_ac = LinearSpan::new(a, c);\n let span_bd = LinearSpan::new(b, d);\n\n assert!(!span_ac.contains(span_bd));\n assert!(!span_bd.contains(span_ac));\n }\n\n /// Checks that the string representation of a span is correct.\n #[test]\n fn span_to_string() {\n let a = Position::new(10, 50);\n let b = Position::new(11, 20);\n let span = Span::new(a, b);\n\n assert_eq!(\"[10:50..11:20]\", span.to_string());\n assert_eq!(\"[10:50..11:20]\", span.to_string());\n }\n\n /// Checks that the ordering of spans is correct.\n #[test]\n fn span_ordering() {\n let a = Position::new(10, 50);\n let b = Position::new(10, 52);\n let c = Position::new(11, 20);\n let d = Position::new(12, 5);\n\n let span_ab = Span::new(a, b);\n let span_cd = Span::new(c, d);\n\n assert!(span_ab < span_cd);\n assert!(span_cd > span_ab);\n }\n\n /// Checks that the ordering of linear spans is correct.\n #[test]\n fn linear_span_ordering() {\n let a = LinearPosition::new(1050);\n let b = LinearPosition::new(1052);\n let c = LinearPosition::new(1120);\n let d = LinearPosition::new(1125);\n\n let span_ab = LinearSpan::new(a, b);\n let span_cd = LinearSpan::new(c, d);\n\n let span_ac = LinearSpan::new(a, c);\n let span_bd = LinearSpan::new(b, d);\n\n assert!(span_ab < span_cd);\n assert!(span_cd > span_ab);\n assert_eq!(span_bd.partial_cmp(&span_ac), None);\n assert_eq!(span_ac.partial_cmp(&span_bd), None);\n }\n\n /// Checks that the ordering of linear spans is correct.\n #[test]\n fn linear_union() {\n let a = LinearPosition::new(1050);\n let b = LinearPosition::new(1052);\n let c = LinearPosition::new(1120);\n let d = LinearPosition::new(1125);\n\n let span_ab = LinearSpan::new(a, b);\n let span_ad = LinearSpan::new(a, d);\n let span_bc = LinearSpan::new(b, c);\n let span_cd = LinearSpan::new(c, d);\n let span_ac = LinearSpan::new(a, c);\n let span_bd = LinearSpan::new(b, d);\n\n assert_eq!(span_bd.union(a), span_ad);\n assert_eq!(span_ab.union(a), span_ab);\n assert_eq!(span_bd.union(span_ac), span_ad);\n assert_eq!(span_ac.union(span_bd), span_ad);\n assert_eq!(span_ac.union(span_bd), span_ad);\n assert_eq!(span_ac.union(b), span_ac);\n assert_eq!(span_bc.union(span_ab), span_ac);\n assert_eq!(span_ab.union(span_bc), span_ac);\n assert_eq!(span_ac.union(span_ab), span_ac);\n assert_eq!(span_cd.union(a), span_ad);\n assert_eq!(span_cd.union(span_bc), span_bd);\n }\n}\n\n// TODO: union Span & LinearSpan into `SpanBase` and then:\n// * Span = SpanBase;\n// * LinearSpan = SpanBase;\n// ?\n" }, { "path": "core/ast/src/property.rs", "content": "//! Property definition related types, used in object literals and class definitions.\n\nuse super::{Expression, Spanned};\nuse crate::{\n expression::Identifier,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// `PropertyName` can be either a literal or computed.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-PropertyName\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum PropertyName {\n /// A `Literal` property name can be either an identifier, a string or a numeric literal.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-LiteralPropertyName\n Literal(Identifier),\n\n /// A `Computed` property name is an expression that gets evaluated and converted into a property name.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-ComputedPropertyName\n Computed(Expression),\n}\n\nimpl PropertyName {\n /// Returns the literal property name if it exists.\n #[must_use]\n pub const fn literal(&self) -> Option {\n if let Self::Literal(ident) = self {\n Some(*ident)\n } else {\n None\n }\n }\n\n /// Returns the expression if the property name is computed.\n #[must_use]\n pub const fn computed(&self) -> Option<&Expression> {\n if let Self::Computed(expr) = self {\n Some(expr)\n } else {\n None\n }\n }\n\n /// Returns either the literal property name or the computed const string property name.\n #[must_use]\n pub fn prop_name(&self) -> Option {\n match self {\n Self::Literal(ident) => Some(*ident),\n Self::Computed(Expression::Literal(lit)) => lit\n .as_string()\n .map(|value| Identifier::new(value, lit.span())),\n Self::Computed(_) => None,\n }\n }\n}\n\nimpl ToInternedString for PropertyName {\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self {\n Self::Literal(key) => interner.resolve_expect(key.sym()).to_string(),\n Self::Computed(key) => format!(\"[{}]\", key.to_interned_string(interner)),\n }\n }\n}\n\nimpl From for PropertyName {\n fn from(name: Identifier) -> Self {\n Self::Literal(name)\n }\n}\n\nimpl From for PropertyName {\n fn from(name: Expression) -> Self {\n Self::Computed(name)\n }\n}\n\nimpl VisitWith for PropertyName {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Literal(ident) => visitor.visit_sym(ident.sym_ref()),\n Self::Computed(expr) => visitor.visit_expression(expr),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Literal(ident) => visitor.visit_sym_mut(ident.sym_mut()),\n Self::Computed(expr) => visitor.visit_expression_mut(expr),\n }\n }\n}\n\n/// The kind of a method definition.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Copy, Clone, Debug, PartialEq)]\npub enum MethodDefinitionKind {\n /// A getter method.\n Get,\n\n /// A setter method.\n Set,\n\n /// An ordinary method.\n Ordinary,\n\n /// A generator method.\n Generator,\n\n /// An async generator method.\n AsyncGenerator,\n\n /// An async method.\n Async,\n}\n" }, { "path": "core/ast/src/punctuator/mod.rs", "content": "//! The `Punctuator` enum, which contains all punctuators used in ECMAScript.\n//!\n//! More information:\n//! - [ECMAScript Reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#prod-Punctuator\n\nuse crate::expression::operator::{\n assign::AssignOp,\n binary::{ArithmeticOp, BinaryOp, BitwiseOp, LogicalOp, RelationalOp},\n};\nuse std::fmt::{Display, Error, Formatter};\n\n#[cfg(test)]\nmod tests;\n\n/// All of the punctuators used in ECMAScript.\n///\n/// More information:\n/// - [ECMAScript Reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-Punctuator\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(PartialEq, Eq, Clone, Copy, Debug, strum::EnumIter)]\npub enum Punctuator {\n /// `+`\n Add,\n /// `&`\n And,\n /// `=>`\n Arrow,\n /// `=`\n Assign,\n /// `+=`\n AssignAdd,\n /// `&=`\n AssignAnd,\n /// `&&=`\n AssignBoolAnd,\n /// `||=`\n AssignBoolOr,\n /// `??=`,\n AssignCoalesce,\n /// `/=`\n AssignDiv,\n /// `<<=`\n AssignLeftSh,\n /// `%=`\n AssignMod,\n /// `*=`\n AssignMul,\n /// `|=`\n AssignOr,\n /// `**=`\n AssignPow,\n /// `>>=`\n AssignRightSh,\n /// `-=`\n AssignSub,\n /// `>>>=`\n AssignURightSh,\n /// `^=`\n AssignXor,\n /// `&&`\n BoolAnd,\n /// `||`\n BoolOr,\n /// `}`\n CloseBlock,\n /// `]`\n CloseBracket,\n /// `)`\n CloseParen,\n /// `??`\n Coalesce,\n /// `:`\n Colon,\n /// `,`\n Comma,\n /// `--`\n Dec,\n /// `/`\n Div,\n /// `.`\n Dot,\n /// `==`\n Eq,\n /// `>`\n GreaterThan,\n /// `>=`\n GreaterThanOrEq,\n /// `++`\n Inc,\n /// `<<`\n LeftSh,\n /// `<`\n LessThan,\n /// `<=`\n LessThanOrEq,\n /// `%`\n Mod,\n /// `*`\n Mul,\n /// `~`\n Neg,\n /// `!`\n Not,\n /// `!=`\n NotEq,\n /// `{`\n OpenBlock,\n /// `[`\n OpenBracket,\n /// `(`\n OpenParen,\n /// `?.`\n Optional,\n /// `|`\n Or,\n /// `**`\n Exp,\n /// `?`\n Question,\n /// `>>`\n RightSh,\n /// `;`\n Semicolon,\n /// `...`\n Spread,\n /// `===`\n StrictEq,\n /// `!==`\n StrictNotEq,\n /// `-`\n Sub,\n /// `>>>`\n URightSh,\n /// `^`\n Xor,\n}\n\nimpl Punctuator {\n /// Attempts to convert a punctuator (`+`, `=`...) to an Assign Operator\n ///\n /// If there is no match, `None` will be returned.\n #[must_use]\n pub const fn as_assign_op(self) -> Option {\n match self {\n Self::Assign => Some(AssignOp::Assign),\n Self::AssignAdd => Some(AssignOp::Add),\n Self::AssignAnd => Some(AssignOp::And),\n Self::AssignBoolAnd => Some(AssignOp::BoolAnd),\n Self::AssignBoolOr => Some(AssignOp::BoolOr),\n Self::AssignCoalesce => Some(AssignOp::Coalesce),\n Self::AssignDiv => Some(AssignOp::Div),\n Self::AssignLeftSh => Some(AssignOp::Shl),\n Self::AssignMod => Some(AssignOp::Mod),\n Self::AssignMul => Some(AssignOp::Mul),\n Self::AssignOr => Some(AssignOp::Or),\n Self::AssignPow => Some(AssignOp::Exp),\n Self::AssignRightSh => Some(AssignOp::Shr),\n Self::AssignSub => Some(AssignOp::Sub),\n Self::AssignURightSh => Some(AssignOp::Ushr),\n Self::AssignXor => Some(AssignOp::Xor),\n _ => None,\n }\n }\n\n /// Attempts to convert a punctuator (`+`, `=`...) to a Binary Operator\n ///\n /// If there is no match, `None` will be returned.\n #[must_use]\n pub const fn as_binary_op(self) -> Option {\n match self {\n Self::Add => Some(BinaryOp::Arithmetic(ArithmeticOp::Add)),\n Self::Sub => Some(BinaryOp::Arithmetic(ArithmeticOp::Sub)),\n Self::Mul => Some(BinaryOp::Arithmetic(ArithmeticOp::Mul)),\n Self::Div => Some(BinaryOp::Arithmetic(ArithmeticOp::Div)),\n Self::Mod => Some(BinaryOp::Arithmetic(ArithmeticOp::Mod)),\n Self::Exp => Some(BinaryOp::Arithmetic(ArithmeticOp::Exp)),\n Self::And => Some(BinaryOp::Bitwise(BitwiseOp::And)),\n Self::Or => Some(BinaryOp::Bitwise(BitwiseOp::Or)),\n Self::Xor => Some(BinaryOp::Bitwise(BitwiseOp::Xor)),\n Self::BoolAnd => Some(BinaryOp::Logical(LogicalOp::And)),\n Self::BoolOr => Some(BinaryOp::Logical(LogicalOp::Or)),\n Self::Coalesce => Some(BinaryOp::Logical(LogicalOp::Coalesce)),\n Self::Eq => Some(BinaryOp::Relational(RelationalOp::Equal)),\n Self::NotEq => Some(BinaryOp::Relational(RelationalOp::NotEqual)),\n Self::StrictEq => Some(BinaryOp::Relational(RelationalOp::StrictEqual)),\n Self::StrictNotEq => Some(BinaryOp::Relational(RelationalOp::StrictNotEqual)),\n Self::LessThan => Some(BinaryOp::Relational(RelationalOp::LessThan)),\n Self::GreaterThan => Some(BinaryOp::Relational(RelationalOp::GreaterThan)),\n Self::GreaterThanOrEq => Some(BinaryOp::Relational(RelationalOp::GreaterThanOrEqual)),\n Self::LessThanOrEq => Some(BinaryOp::Relational(RelationalOp::LessThanOrEqual)),\n Self::LeftSh => Some(BinaryOp::Bitwise(BitwiseOp::Shl)),\n Self::RightSh => Some(BinaryOp::Bitwise(BitwiseOp::Shr)),\n Self::URightSh => Some(BinaryOp::Bitwise(BitwiseOp::UShr)),\n Self::Comma => Some(BinaryOp::Comma),\n _ => None,\n }\n }\n\n /// Retrieves the punctuator as a static string.\n #[must_use]\n pub const fn as_str(self) -> &'static str {\n match self {\n Self::Add => \"+\",\n Self::And => \"&\",\n Self::Arrow => \"=>\",\n Self::Assign => \"=\",\n Self::AssignAdd => \"+=\",\n Self::AssignAnd => \"&=\",\n Self::AssignBoolAnd => \"&&=\",\n Self::AssignBoolOr => \"||=\",\n Self::AssignCoalesce => \"??=\",\n Self::AssignDiv => \"/=\",\n Self::AssignLeftSh => \"<<=\",\n Self::AssignMod => \"%=\",\n Self::AssignMul => \"*=\",\n Self::AssignOr => \"|=\",\n Self::AssignPow => \"**=\",\n Self::AssignRightSh => \">>=\",\n Self::AssignSub => \"-=\",\n Self::AssignURightSh => \">>>=\",\n Self::AssignXor => \"^=\",\n Self::BoolAnd => \"&&\",\n Self::BoolOr => \"||\",\n Self::Coalesce => \"??\",\n Self::CloseBlock => \"}\",\n Self::CloseBracket => \"]\",\n Self::CloseParen => \")\",\n Self::Colon => \":\",\n Self::Comma => \",\",\n Self::Dec => \"--\",\n Self::Div => \"/\",\n Self::Dot => \".\",\n Self::Eq => \"==\",\n Self::GreaterThan => \">\",\n Self::GreaterThanOrEq => \">=\",\n Self::Inc => \"++\",\n Self::LeftSh => \"<<\",\n Self::LessThan => \"<\",\n Self::LessThanOrEq => \"<=\",\n Self::Mod => \"%\",\n Self::Mul => \"*\",\n Self::Neg => \"~\",\n Self::Not => \"!\",\n Self::NotEq => \"!=\",\n Self::OpenBlock => \"{\",\n Self::OpenBracket => \"[\",\n Self::OpenParen => \"(\",\n Self::Optional => \"?.\",\n Self::Or => \"|\",\n Self::Exp => \"**\",\n Self::Question => \"?\",\n Self::RightSh => \">>\",\n Self::Semicolon => \";\",\n Self::Spread => \"...\",\n Self::StrictEq => \"===\",\n Self::StrictNotEq => \"!==\",\n Self::Sub => \"-\",\n Self::URightSh => \">>>\",\n Self::Xor => \"^\",\n }\n }\n}\n\nimpl TryFrom for AssignOp {\n // TO-DO: proper error type\n type Error = String;\n\n fn try_from(punct: Punctuator) -> Result {\n punct\n .as_assign_op()\n .ok_or_else(|| format!(\"No assignment operator for {punct}\"))\n }\n}\n\nimpl TryFrom for BinaryOp {\n // TO-DO: proper error type\n type Error = String;\n\n fn try_from(punct: Punctuator) -> Result {\n punct\n .as_binary_op()\n .ok_or_else(|| format!(\"No binary operator for {punct}\"))\n }\n}\n\nimpl Display for Punctuator {\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {\n f.write_str(self.as_str())\n }\n}\n\nimpl From for Box {\n fn from(p: Punctuator) -> Self {\n p.as_str().into()\n }\n}\n" }, { "path": "core/ast/src/punctuator/tests.rs", "content": "#![allow(clippy::cognitive_complexity)]\n\nuse super::*;\n\n/// Gets an iterator over all the existing punctuators.\nfn all_punctuators() -> impl Iterator {\n [\n Punctuator::Add,\n Punctuator::And,\n Punctuator::Arrow,\n Punctuator::Assign,\n Punctuator::AssignAdd,\n Punctuator::AssignAnd,\n Punctuator::AssignBoolAnd,\n Punctuator::AssignBoolOr,\n Punctuator::AssignCoalesce,\n Punctuator::AssignDiv,\n Punctuator::AssignLeftSh,\n Punctuator::AssignMod,\n Punctuator::AssignMul,\n Punctuator::AssignOr,\n Punctuator::AssignPow,\n Punctuator::AssignRightSh,\n Punctuator::AssignSub,\n Punctuator::AssignURightSh,\n Punctuator::AssignXor,\n Punctuator::BoolAnd,\n Punctuator::BoolOr,\n Punctuator::CloseBlock,\n Punctuator::CloseBracket,\n Punctuator::CloseParen,\n Punctuator::Coalesce,\n Punctuator::Colon,\n Punctuator::Comma,\n Punctuator::Dec,\n Punctuator::Div,\n Punctuator::Dot,\n Punctuator::Eq,\n Punctuator::GreaterThan,\n Punctuator::GreaterThanOrEq,\n Punctuator::Inc,\n Punctuator::LeftSh,\n Punctuator::LessThan,\n Punctuator::LessThanOrEq,\n Punctuator::Mod,\n Punctuator::Mul,\n Punctuator::Neg,\n Punctuator::Not,\n Punctuator::NotEq,\n Punctuator::OpenBlock,\n Punctuator::OpenBracket,\n Punctuator::OpenParen,\n Punctuator::Optional,\n Punctuator::Or,\n Punctuator::Exp,\n Punctuator::Question,\n Punctuator::RightSh,\n Punctuator::Semicolon,\n Punctuator::Spread,\n Punctuator::StrictEq,\n Punctuator::StrictNotEq,\n Punctuator::Sub,\n Punctuator::URightSh,\n Punctuator::Xor,\n ]\n .into_iter()\n}\n\n#[test]\nfn as_assign_op() {\n for p in all_punctuators() {\n match p.as_assign_op() {\n Some(AssignOp::Assign) => assert_eq!(p, Punctuator::Assign),\n Some(AssignOp::Add) => assert_eq!(p, Punctuator::AssignAdd),\n Some(AssignOp::And) => assert_eq!(p, Punctuator::AssignAnd),\n Some(AssignOp::BoolAnd) => assert_eq!(p, Punctuator::AssignBoolAnd),\n Some(AssignOp::BoolOr) => assert_eq!(p, Punctuator::AssignBoolOr),\n Some(AssignOp::Coalesce) => assert_eq!(p, Punctuator::AssignCoalesce),\n Some(AssignOp::Div) => assert_eq!(p, Punctuator::AssignDiv),\n Some(AssignOp::Shl) => assert_eq!(p, Punctuator::AssignLeftSh),\n Some(AssignOp::Mod) => assert_eq!(p, Punctuator::AssignMod),\n Some(AssignOp::Mul) => assert_eq!(p, Punctuator::AssignMul),\n Some(AssignOp::Or) => assert_eq!(p, Punctuator::AssignOr),\n Some(AssignOp::Exp) => assert_eq!(p, Punctuator::AssignPow),\n Some(AssignOp::Shr) => assert_eq!(p, Punctuator::AssignRightSh),\n Some(AssignOp::Sub) => assert_eq!(p, Punctuator::AssignSub),\n Some(AssignOp::Ushr) => assert_eq!(p, Punctuator::AssignURightSh),\n Some(AssignOp::Xor) => assert_eq!(p, Punctuator::AssignXor),\n None => assert!(\n ![\n Punctuator::Assign,\n Punctuator::AssignAdd,\n Punctuator::AssignAnd,\n Punctuator::AssignBoolAnd,\n Punctuator::AssignBoolOr,\n Punctuator::AssignCoalesce,\n Punctuator::AssignDiv,\n Punctuator::AssignLeftSh,\n Punctuator::AssignMod,\n Punctuator::AssignMul,\n Punctuator::AssignOr,\n Punctuator::AssignPow,\n Punctuator::AssignRightSh,\n Punctuator::AssignSub,\n Punctuator::AssignURightSh,\n Punctuator::AssignXor,\n ]\n .contains(&p)\n ),\n }\n }\n}\n\n#[test]\nfn as_binary_op() {\n for p in all_punctuators() {\n match p.as_binary_op() {\n Some(BinaryOp::Arithmetic(ArithmeticOp::Add)) => assert_eq!(p, Punctuator::Add),\n Some(BinaryOp::Arithmetic(ArithmeticOp::Sub)) => assert_eq!(p, Punctuator::Sub),\n Some(BinaryOp::Arithmetic(ArithmeticOp::Mul)) => assert_eq!(p, Punctuator::Mul),\n Some(BinaryOp::Arithmetic(ArithmeticOp::Div)) => assert_eq!(p, Punctuator::Div),\n Some(BinaryOp::Arithmetic(ArithmeticOp::Mod)) => assert_eq!(p, Punctuator::Mod),\n Some(BinaryOp::Bitwise(BitwiseOp::And)) => assert_eq!(p, Punctuator::And),\n Some(BinaryOp::Bitwise(BitwiseOp::Or)) => assert_eq!(p, Punctuator::Or),\n Some(BinaryOp::Bitwise(BitwiseOp::Xor)) => assert_eq!(p, Punctuator::Xor),\n Some(BinaryOp::Logical(LogicalOp::And)) => assert_eq!(p, Punctuator::BoolAnd),\n Some(BinaryOp::Logical(LogicalOp::Or)) => assert_eq!(p, Punctuator::BoolOr),\n Some(BinaryOp::Logical(LogicalOp::Coalesce)) => assert_eq!(p, Punctuator::Coalesce),\n Some(BinaryOp::Relational(RelationalOp::Equal)) => assert_eq!(p, Punctuator::Eq),\n Some(BinaryOp::Relational(RelationalOp::NotEqual)) => assert_eq!(p, Punctuator::NotEq),\n Some(BinaryOp::Relational(RelationalOp::StrictEqual)) => {\n assert_eq!(p, Punctuator::StrictEq);\n }\n Some(BinaryOp::Relational(RelationalOp::StrictNotEqual)) => {\n assert_eq!(p, Punctuator::StrictNotEq);\n }\n Some(BinaryOp::Relational(RelationalOp::LessThan)) => {\n assert_eq!(p, Punctuator::LessThan);\n }\n Some(BinaryOp::Relational(RelationalOp::GreaterThan)) => {\n assert_eq!(p, Punctuator::GreaterThan);\n }\n Some(BinaryOp::Relational(RelationalOp::GreaterThanOrEqual)) => {\n assert_eq!(p, Punctuator::GreaterThanOrEq);\n }\n Some(BinaryOp::Relational(RelationalOp::LessThanOrEqual)) => {\n assert_eq!(p, Punctuator::LessThanOrEq);\n }\n Some(BinaryOp::Bitwise(BitwiseOp::Shl)) => assert_eq!(p, Punctuator::LeftSh),\n Some(BinaryOp::Bitwise(BitwiseOp::Shr)) => assert_eq!(p, Punctuator::RightSh),\n Some(BinaryOp::Bitwise(BitwiseOp::UShr)) => assert_eq!(p, Punctuator::URightSh),\n Some(BinaryOp::Comma) => assert_eq!(p, Punctuator::Comma),\n Some(BinaryOp::Arithmetic(ArithmeticOp::Exp)) => {\n assert_eq!(p, Punctuator::Exp);\n }\n None => assert!(\n ![\n Punctuator::Add,\n Punctuator::Sub,\n Punctuator::Mul,\n Punctuator::Div,\n Punctuator::Mod,\n Punctuator::And,\n Punctuator::Or,\n Punctuator::Xor,\n Punctuator::BoolAnd,\n Punctuator::BoolOr,\n Punctuator::Coalesce,\n Punctuator::Eq,\n Punctuator::NotEq,\n Punctuator::StrictEq,\n Punctuator::StrictNotEq,\n Punctuator::LessThan,\n Punctuator::GreaterThan,\n Punctuator::GreaterThanOrEq,\n Punctuator::LessThanOrEq,\n Punctuator::LeftSh,\n Punctuator::RightSh,\n Punctuator::URightSh,\n Punctuator::Comma\n ]\n .contains(&p)\n ),\n Some(BinaryOp::Relational(RelationalOp::In | RelationalOp::InstanceOf)) => {\n unreachable!()\n }\n }\n }\n}\n\n#[test]\nfn as_str() {\n for p in all_punctuators() {\n match p.as_str() {\n \"+\" => assert_eq!(p, Punctuator::Add),\n \"&\" => assert_eq!(p, Punctuator::And),\n \"=>\" => assert_eq!(p, Punctuator::Arrow),\n \"=\" => assert_eq!(p, Punctuator::Assign),\n \"+=\" => assert_eq!(p, Punctuator::AssignAdd),\n \"&=\" => assert_eq!(p, Punctuator::AssignAnd),\n \"&&=\" => assert_eq!(p, Punctuator::AssignBoolAnd),\n \"||=\" => assert_eq!(p, Punctuator::AssignBoolOr),\n \"??=\" => assert_eq!(p, Punctuator::AssignCoalesce),\n \"/=\" => assert_eq!(p, Punctuator::AssignDiv),\n \"<<=\" => assert_eq!(p, Punctuator::AssignLeftSh),\n \"%=\" => assert_eq!(p, Punctuator::AssignMod),\n \"*=\" => assert_eq!(p, Punctuator::AssignMul),\n \"|=\" => assert_eq!(p, Punctuator::AssignOr),\n \"**=\" => assert_eq!(p, Punctuator::AssignPow),\n \">>=\" => assert_eq!(p, Punctuator::AssignRightSh),\n \"-=\" => assert_eq!(p, Punctuator::AssignSub),\n \">>>=\" => assert_eq!(p, Punctuator::AssignURightSh),\n \"^=\" => assert_eq!(p, Punctuator::AssignXor),\n \"&&\" => assert_eq!(p, Punctuator::BoolAnd),\n \"||\" => assert_eq!(p, Punctuator::BoolOr),\n \"??\" => assert_eq!(p, Punctuator::Coalesce),\n \"}\" => assert_eq!(p, Punctuator::CloseBlock),\n \"]\" => assert_eq!(p, Punctuator::CloseBracket),\n \")\" => assert_eq!(p, Punctuator::CloseParen),\n \":\" => assert_eq!(p, Punctuator::Colon),\n \",\" => assert_eq!(p, Punctuator::Comma),\n \"--\" => assert_eq!(p, Punctuator::Dec),\n \"/\" => assert_eq!(p, Punctuator::Div),\n \".\" => assert_eq!(p, Punctuator::Dot),\n \"==\" => assert_eq!(p, Punctuator::Eq),\n \">\" => assert_eq!(p, Punctuator::GreaterThan),\n \">=\" => assert_eq!(p, Punctuator::GreaterThanOrEq),\n \"++\" => assert_eq!(p, Punctuator::Inc),\n \"<<\" => assert_eq!(p, Punctuator::LeftSh),\n \"<\" => assert_eq!(p, Punctuator::LessThan),\n \"<=\" => assert_eq!(p, Punctuator::LessThanOrEq),\n \"%\" => assert_eq!(p, Punctuator::Mod),\n \"*\" => assert_eq!(p, Punctuator::Mul),\n \"~\" => assert_eq!(p, Punctuator::Neg),\n \"!\" => assert_eq!(p, Punctuator::Not),\n \"!=\" => assert_eq!(p, Punctuator::NotEq),\n \"{\" => assert_eq!(p, Punctuator::OpenBlock),\n \"[\" => assert_eq!(p, Punctuator::OpenBracket),\n \"(\" => assert_eq!(p, Punctuator::OpenParen),\n \"?.\" => assert_eq!(p, Punctuator::Optional),\n \"|\" => assert_eq!(p, Punctuator::Or),\n \"**\" => assert_eq!(p, Punctuator::Exp),\n \"?\" => assert_eq!(p, Punctuator::Question),\n \">>\" => assert_eq!(p, Punctuator::RightSh),\n \";\" => assert_eq!(p, Punctuator::Semicolon),\n \"...\" => assert_eq!(p, Punctuator::Spread),\n \"===\" => assert_eq!(p, Punctuator::StrictEq),\n \"!==\" => assert_eq!(p, Punctuator::StrictNotEq),\n \"-\" => assert_eq!(p, Punctuator::Sub),\n \">>>\" => assert_eq!(p, Punctuator::URightSh),\n \"^\" => assert_eq!(p, Punctuator::Xor),\n _ => unreachable!(\"unknown punctuator {p:?} found\"),\n }\n }\n}\n\n#[test]\nfn try_into_assign_op() {\n for p in all_punctuators() {\n if p.as_assign_op().is_some() {\n assert!(TryInto::::try_into(p).is_ok());\n } else {\n assert!(TryInto::::try_into(p).is_err());\n }\n }\n}\n\n#[test]\nfn try_into_binary_op() {\n for p in all_punctuators() {\n if p.as_binary_op().is_some() {\n assert!(TryInto::::try_into(p).is_ok());\n } else {\n assert!(TryInto::::try_into(p).is_err());\n }\n }\n}\n\n#[test]\nfn display() {\n for p in all_punctuators() {\n assert_eq!(p.as_str(), p.to_string());\n }\n}\n\n#[test]\nfn into_box() {\n for p in all_punctuators() {\n assert_eq!(p.as_str(), Box::::from(p).as_ref());\n }\n}\n" }, { "path": "core/ast/src/scope.rs", "content": "//! This module implements the binding scope for various AST nodes.\n//!\n//! Scopes are used to track the bindings of identifiers in the AST.\n\nuse bitflags::bitflags;\nuse boa_string::JsString;\nuse std::{\n cell::{Cell, RefCell},\n fmt::Debug,\n rc::Rc,\n};\n\nbitflags! {\n #[derive(Debug, Clone, Copy, PartialEq, Eq)]\n struct BindingFlags: u8 {\n const MUTABLE = 1 << 0;\n const LEX = 1 << 1;\n const STRICT = 1 << 2;\n const ESCAPES = 1 << 3;\n const ACCESSED = 1 << 4;\n }\n}\n\nimpl BindingFlags {\n fn is_mutable(self) -> bool {\n self.contains(BindingFlags::MUTABLE)\n }\n fn is_lex(self) -> bool {\n self.contains(BindingFlags::LEX)\n }\n fn is_strict(self) -> bool {\n self.contains(BindingFlags::STRICT)\n }\n fn escapes(self) -> bool {\n self.contains(BindingFlags::ESCAPES)\n }\n fn is_accessed(self) -> bool {\n self.contains(BindingFlags::ACCESSED)\n }\n}\n\n#[derive(Clone, Debug, PartialEq)]\nstruct Binding {\n name: JsString,\n index: u32,\n flags: BindingFlags,\n}\n\nimpl Binding {\n fn is_mutable(&self) -> bool {\n self.flags.is_mutable()\n }\n fn is_lex(&self) -> bool {\n self.flags.is_lex()\n }\n fn is_strict(&self) -> bool {\n self.flags.is_strict()\n }\n fn escapes(&self) -> bool {\n self.flags.escapes()\n }\n fn is_accessed(&self) -> bool {\n self.flags.is_accessed()\n }\n}\n\n/// A scope maps bound identifiers to their binding positions.\n///\n/// It can be either a global scope or a function scope or a declarative scope.\n#[derive(Clone, PartialEq)]\npub struct Scope {\n inner: Rc,\n}\n\nimpl Debug for Scope {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n f.debug_struct(\"Scope\")\n .field(\"outer\", &self.inner.outer)\n .field(\"index\", &self.inner.index)\n .field(\"bindings\", &self.inner.bindings)\n .field(\"function\", &self.inner.function)\n .finish()\n }\n}\n\nimpl Default for Scope {\n fn default() -> Self {\n Self::new_global()\n }\n}\n\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for Scope {\n fn arbitrary(_u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n Ok(Self::new_global())\n }\n}\n\n#[derive(Debug, PartialEq)]\npub(crate) struct Inner {\n unique_id: u32,\n outer: Option,\n index: Cell,\n bindings: RefCell>,\n function: bool,\n // Has the `this` been accessed/escaped outside the function environment boundary.\n this_escaped: Cell,\n\n context: Rc,\n}\n\nimpl Scope {\n /// Creates a new global scope.\n #[must_use]\n pub fn new_global() -> Self {\n Self {\n inner: Rc::new(Inner {\n unique_id: 0,\n outer: None,\n index: Cell::default(),\n bindings: RefCell::default(),\n function: true,\n this_escaped: Cell::new(false),\n context: Rc::default(),\n }),\n }\n }\n\n /// Creates a new scope.\n #[must_use]\n pub fn new(parent: Self, function: bool) -> Self {\n Self {\n inner: Rc::new(Inner {\n unique_id: parent.inner.context.next_unique_id(),\n index: Cell::new(parent.inner.index.get() + 1),\n bindings: RefCell::default(),\n function,\n this_escaped: Cell::new(false),\n context: parent.inner.context.clone(),\n outer: Some(parent),\n }),\n }\n }\n\n /// Checks if the scope has only local bindings.\n #[must_use]\n pub fn all_bindings_local(&self) -> bool {\n // if self.inner.function && self.inn\n self.inner\n .bindings\n .borrow()\n .iter()\n .all(|binding| !binding.escapes())\n }\n\n /// Marks all bindings in this scope as escaping.\n pub fn escape_all_bindings(&self) {\n for binding in self.inner.bindings.borrow_mut().iter_mut() {\n binding.flags.insert(BindingFlags::ESCAPES);\n }\n }\n\n /// Has this binding escaped.\n #[must_use]\n pub fn escaped_this(&self) -> bool {\n self.inner.this_escaped.get()\n }\n\n /// Check if the scope has a lexical binding with the given name.\n #[must_use]\n pub fn has_lex_binding(&self, name: &JsString) -> bool {\n self.inner\n .bindings\n .borrow()\n .iter()\n .find(|b| &b.name == name)\n .is_some_and(Binding::is_lex)\n }\n\n /// Check if the scope has a binding with the given name.\n #[must_use]\n pub fn has_binding(&self, name: &JsString) -> bool {\n self.inner.bindings.borrow().iter().any(|b| &b.name == name)\n }\n\n /// Get the binding locator for a binding with the given name.\n /// Fall back to the global scope if the binding is not found.\n #[must_use]\n pub fn get_identifier_reference(&self, name: JsString) -> IdentifierReference {\n if let Some(binding) = self.inner.bindings.borrow().iter().find(|b| b.name == name) {\n IdentifierReference::new(\n BindingLocator::declarative(\n name,\n self.inner.index.get(),\n binding.index,\n self.inner.unique_id,\n ),\n binding.is_lex(),\n binding.escapes(),\n )\n } else if let Some(outer) = &self.inner.outer {\n outer.get_identifier_reference(name)\n } else {\n IdentifierReference::new(BindingLocator::global(name), false, true)\n }\n }\n\n /// Returns the number of bindings in this scope.\n #[must_use]\n #[allow(clippy::cast_possible_truncation)]\n pub fn num_bindings(&self) -> u32 {\n self.inner.bindings.borrow().len() as u32\n }\n\n /// Returns the number of bindings in this scope that are not local.\n #[must_use]\n #[allow(clippy::cast_possible_truncation)]\n pub fn num_bindings_non_local(&self) -> u32 {\n self.inner\n .bindings\n .borrow()\n .iter()\n .filter(|binding| binding.escapes())\n .count() as u32\n }\n\n /// Adjust the binding indices to exclude local bindings.\n pub(crate) fn reorder_binding_indices(&self) {\n let mut bindings = self.inner.bindings.borrow_mut();\n let mut index = 0;\n for binding in bindings.iter_mut() {\n if !binding.escapes() {\n binding.index = 0;\n continue;\n }\n binding.index = index;\n index += 1;\n }\n }\n\n /// Returns the index of this scope.\n #[must_use]\n pub fn scope_index(&self) -> u32 {\n self.inner.index.get()\n }\n\n /// Set the index of this scope.\n pub(crate) fn set_index(&self, index: u32) {\n self.inner.index.set(index);\n }\n\n /// Check if the scope is a function scope.\n #[must_use]\n pub fn is_function(&self) -> bool {\n self.inner.function\n }\n\n /// Check if the scope is a global scope.\n #[must_use]\n pub fn is_global(&self) -> bool {\n self.inner.outer.is_none()\n }\n\n /// Check if a binding with the given name is mutable.\n ///\n /// Returns `Some(true)` for mutable bindings (`let`, `var`),\n /// `Some(false)` for immutable bindings (`const`),\n /// or `None` if the binding is not found in this or any outer scope.\n #[must_use]\n pub fn is_binding_mutable(&self, name: &JsString) -> Option {\n if let Some(binding) = self\n .inner\n .bindings\n .borrow()\n .iter()\n .find(|b| &b.name == name)\n {\n Some(binding.is_mutable())\n } else if let Some(outer) = &self.inner.outer {\n outer.is_binding_mutable(name)\n } else {\n None\n }\n }\n\n /// Get the locator for a binding name.\n #[must_use]\n pub fn get_binding(&self, name: &JsString) -> Option {\n self.inner\n .bindings\n .borrow()\n .iter()\n .find(|b| &b.name == name)\n .map(|binding| {\n BindingLocator::declarative(\n name.clone(),\n self.inner.index.get(),\n binding.index,\n self.inner.unique_id,\n )\n })\n }\n\n /// Get the locator for a binding name.\n #[must_use]\n pub fn get_binding_reference(&self, name: &JsString) -> Option {\n self.inner\n .bindings\n .borrow()\n .iter()\n .find(|b| &b.name == name)\n .map(|binding| {\n IdentifierReference::new(\n BindingLocator::declarative(\n name.clone(),\n self.inner.index.get(),\n binding.index,\n self.inner.unique_id,\n ),\n binding.is_lex(),\n binding.escapes(),\n )\n })\n }\n\n /// Simulate a binding access.\n ///\n /// - If the binding access crosses a function border, the binding is marked as escaping.\n /// - If the binding access is in an eval or with scope, the binding is marked as escaping.\n pub fn access_binding(&self, name: &JsString, eval_or_with: bool) {\n let mut crossed_function_border = false;\n let mut current = self;\n loop {\n if let Some(binding) = current\n .inner\n .bindings\n .borrow_mut()\n .iter_mut()\n .find(|b| &b.name == name)\n {\n binding.flags.insert(BindingFlags::ACCESSED);\n if crossed_function_border || eval_or_with {\n binding.flags.insert(BindingFlags::ESCAPES);\n }\n return;\n }\n if let Some(outer) = ¤t.inner.outer {\n if current.inner.function {\n crossed_function_border = true;\n }\n current = outer;\n } else {\n return;\n }\n }\n }\n\n /// Escape enclosing function environment's `this`.\n pub fn escape_this_in_enclosing_function_scope(&self) {\n let mut current = self;\n let mut crossed_function_border = false;\n\n loop {\n if crossed_function_border && current.is_function() {\n current.inner.this_escaped.set(true);\n return;\n }\n if let Some(outer) = ¤t.inner.outer {\n if current.is_function() {\n crossed_function_border = true;\n }\n current = outer;\n } else {\n return;\n }\n }\n }\n\n /// Creates a mutable binding.\n #[must_use]\n #[allow(clippy::cast_possible_truncation)]\n pub fn create_mutable_binding(&self, name: JsString, function_scope: bool) -> BindingLocator {\n let mut bindings = self.inner.bindings.borrow_mut();\n let binding_index = bindings.len() as u32;\n if let Some(binding) = bindings.iter().find(|b| b.name == name) {\n return BindingLocator::declarative(\n name,\n self.inner.index.get(),\n binding.index,\n self.inner.unique_id,\n );\n }\n let mut flags = BindingFlags::MUTABLE;\n flags.set(BindingFlags::LEX, !function_scope);\n flags.set(BindingFlags::ESCAPES, self.is_global());\n bindings.push(Binding {\n name: name.clone(),\n index: binding_index,\n flags,\n });\n BindingLocator::declarative(\n name,\n self.inner.index.get(),\n binding_index,\n self.inner.unique_id,\n )\n }\n\n /// Crate an immutable binding.\n #[allow(clippy::cast_possible_truncation)]\n pub(crate) fn create_immutable_binding(&self, name: JsString, strict: bool) {\n let mut bindings = self.inner.bindings.borrow_mut();\n if bindings.iter().any(|b| b.name == name) {\n return;\n }\n let binding_index = bindings.len() as u32;\n let mut flags = BindingFlags::LEX;\n flags.set(BindingFlags::STRICT, strict);\n flags.set(BindingFlags::ESCAPES, self.is_global());\n bindings.push(Binding {\n name,\n index: binding_index,\n flags,\n });\n }\n\n /// Return the binding locator for a mutable binding.\n ///\n /// # Errors\n /// Returns an error if the binding is not mutable or does not exist.\n pub fn set_mutable_binding(\n &self,\n name: JsString,\n ) -> Result {\n Ok(\n match self.inner.bindings.borrow().iter().find(|b| b.name == name) {\n Some(binding) if binding.is_mutable() => IdentifierReference::new(\n BindingLocator::declarative(\n name,\n self.inner.index.get(),\n binding.index,\n self.inner.unique_id,\n ),\n binding.is_lex(),\n binding.escapes(),\n ),\n Some(binding) if binding.is_strict() => {\n return Err(BindingLocatorError::MutateImmutable);\n }\n Some(_) => return Err(BindingLocatorError::Silent),\n None => self.inner.outer.as_ref().map_or_else(\n || {\n Ok(IdentifierReference::new(\n BindingLocator::global(name.clone()),\n false,\n true,\n ))\n },\n |outer| outer.set_mutable_binding(name.clone()),\n )?,\n },\n )\n }\n\n #[cfg(feature = \"annex-b\")]\n /// Return the binding locator for a set operation on an existing var binding.\n ///\n /// # Errors\n /// Returns an error if the binding is not mutable or does not exist.\n pub fn set_mutable_binding_var(\n &self,\n name: JsString,\n ) -> Result {\n if !self.is_function() {\n return self.inner.outer.as_ref().map_or_else(\n || {\n Ok(IdentifierReference::new(\n BindingLocator::global(name.clone()),\n false,\n true,\n ))\n },\n |outer| outer.set_mutable_binding_var(name.clone()),\n );\n }\n\n Ok(\n match self.inner.bindings.borrow().iter().find(|b| b.name == name) {\n Some(binding) if binding.is_mutable() => IdentifierReference::new(\n BindingLocator::declarative(\n name,\n self.inner.index.get(),\n binding.index,\n self.inner.unique_id,\n ),\n binding.is_lex(),\n binding.escapes(),\n ),\n Some(binding) if binding.is_strict() => {\n return Err(BindingLocatorError::MutateImmutable);\n }\n Some(_) => return Err(BindingLocatorError::Silent),\n None => self.inner.outer.as_ref().map_or_else(\n || {\n Ok(IdentifierReference::new(\n BindingLocator::global(name.clone()),\n false,\n true,\n ))\n },\n |outer| outer.set_mutable_binding_var(name.clone()),\n )?,\n },\n )\n }\n\n /// Gets the outer scope of this scope.\n #[must_use]\n pub fn outer(&self) -> Option<&Self> {\n self.inner.outer.as_ref()\n }\n\n /// Returns the unique ID of this scope.\n #[must_use]\n pub fn unique_id(&self) -> u32 {\n self.inner.unique_id\n }\n}\n\n/// Additional state that all Scopes of a single AST share for bookkeeping.\n#[derive(Debug, PartialEq, Default)]\nstruct ScopeContext {\n /// A counter for unique IDs for Scopes generated as part of this scope tree.\n ///\n /// The value is the highest unique ID assigned so far (initialized with 0\n /// which is also the unique ID of the global scope).\n ///\n /// Only used in the root scope.\n unique_id_ctr: Cell,\n}\n\nimpl ScopeContext {\n /// Returns the next unique ID for a scope in this scope tree.\n fn next_unique_id(&self) -> u32 {\n let id = self.unique_id_ctr.get() + 1;\n self.unique_id_ctr.set(id);\n id\n }\n}\n\n/// A reference to an identifier in a scope.\n#[derive(Clone, Debug, PartialEq, Eq, Hash)]\npub struct IdentifierReference {\n locator: BindingLocator,\n lexical: bool,\n escapes: bool,\n}\n\nimpl IdentifierReference {\n /// Create a new identifier reference.\n pub(crate) fn new(locator: BindingLocator, lexical: bool, escapes: bool) -> Self {\n Self {\n locator,\n lexical,\n escapes,\n }\n }\n\n /// Get the binding locator for this identifier reference.\n #[must_use]\n pub fn locator(&self) -> BindingLocator {\n self.locator.clone()\n }\n\n /// Returns if the binding can be function local.\n #[must_use]\n pub fn local(&self) -> bool {\n self.locator.scope > 0 && !self.escapes\n }\n\n /// Returns if the binding is on the global object.\n #[must_use]\n pub fn is_global_object(&self) -> bool {\n self.locator.scope == 0\n }\n\n /// Check if this identifier reference is lexical.\n #[must_use]\n pub fn is_lexical(&self) -> bool {\n self.lexical\n }\n}\n\n/// A binding locator contains all information about a binding that is needed to resolve it at runtime.\n#[derive(Clone, Debug, Eq, Hash, PartialEq)]\npub struct BindingLocator {\n /// Name of the binding.\n name: JsString,\n\n /// Scope of the binding.\n /// - 0: Global object\n /// - 1: Global declarative scope\n /// - n: Stack scope at index n - 2\n scope: u32,\n\n /// Index of the binding in the scope.\n binding_index: u32,\n\n unique_scope_id: u32,\n}\n\nimpl BindingLocator {\n /// Creates a new declarative binding locator that has knows indices.\n pub(crate) const fn declarative(\n name: JsString,\n scope_index: u32,\n binding_index: u32,\n unique_scope_id: u32,\n ) -> Self {\n Self {\n name,\n scope: scope_index + 1,\n binding_index,\n unique_scope_id,\n }\n }\n\n /// Creates a binding locator that indicates that the binding is on the global object.\n pub(super) const fn global(name: JsString) -> Self {\n Self {\n name,\n scope: 0,\n binding_index: 0,\n unique_scope_id: 0,\n }\n }\n\n /// Returns the name of the binding.\n #[must_use]\n pub const fn name(&self) -> &JsString {\n &self.name\n }\n\n /// Returns if the binding is located on the global object.\n #[must_use]\n pub const fn is_global(&self) -> bool {\n self.scope == 0\n }\n\n /// Returns the scope of the binding.\n #[must_use]\n pub fn scope(&self) -> BindingLocatorScope {\n match self.scope {\n 0 => BindingLocatorScope::GlobalObject,\n 1 => BindingLocatorScope::GlobalDeclarative,\n n => BindingLocatorScope::Stack(n - 2),\n }\n }\n\n /// Sets the scope of the binding.\n pub fn set_scope(&mut self, scope: BindingLocatorScope) {\n self.scope = match scope {\n BindingLocatorScope::GlobalObject => 0,\n BindingLocatorScope::GlobalDeclarative => 1,\n BindingLocatorScope::Stack(index) => index + 2,\n };\n }\n\n /// Returns the binding index of the binding.\n #[must_use]\n pub const fn binding_index(&self) -> u32 {\n self.binding_index\n }\n\n /// Sets the binding index of the binding.\n pub fn set_binding_index(&mut self, index: u32) {\n self.binding_index = index;\n }\n\n /// Returns the unique scope ID of the binding.\n #[must_use]\n pub fn unique_scope_id(&self) -> u32 {\n self.unique_scope_id\n }\n}\n\n/// Action that is returned when a fallible binding operation.\n#[derive(Copy, Clone, Debug)]\npub enum BindingLocatorError {\n /// Trying to mutate immutable binding,\n MutateImmutable,\n\n /// Indicates that any action is silently ignored.\n Silent,\n}\n\n/// The scope in which a binding is located.\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum BindingLocatorScope {\n /// The binding is located on the global object.\n GlobalObject,\n\n /// The binding is located in the global declarative scope.\n GlobalDeclarative,\n\n /// The binding is located in the scope stack at the given index.\n Stack(u32),\n}\n\n/// A collection of function scopes.\n#[derive(Clone, Debug, Default, PartialEq)]\npub struct FunctionScopes {\n pub(crate) function_scope: Scope,\n pub(crate) parameters_eval_scope: Option,\n pub(crate) parameters_scope: Option,\n pub(crate) lexical_scope: Option,\n pub(crate) mapped_arguments_object: bool,\n pub(crate) requires_function_scope: bool,\n}\n\nimpl FunctionScopes {\n /// Returns the function scope for this function.\n #[must_use]\n pub fn function_scope(&self) -> &Scope {\n &self.function_scope\n }\n\n /// Returns if the arguments object is accessed in this function.\n #[must_use]\n pub fn arguments_object_accessed(&self) -> bool {\n if self\n .function_scope\n .inner\n .bindings\n .borrow()\n .first()\n .filter(|b| b.name == \"arguments\" && b.is_accessed())\n .is_some()\n {\n return true;\n }\n\n if let Some(scope) = &self.parameters_eval_scope\n && scope\n .inner\n .bindings\n .borrow()\n .first()\n .filter(|b| b.name == \"arguments\" && b.is_accessed())\n .is_some()\n {\n return true;\n }\n\n false\n }\n\n /// Check if the creation of the function scope is required.\n #[must_use]\n pub fn requires_function_scope(&self) -> bool {\n self.requires_function_scope\n }\n\n /// Returns the parameters eval scope for this function.\n #[must_use]\n pub fn parameters_eval_scope(&self) -> Option<&Scope> {\n self.parameters_eval_scope.as_ref()\n }\n\n /// Returns the parameters scope for this function.\n #[must_use]\n pub fn parameters_scope(&self) -> Option<&Scope> {\n self.parameters_scope.as_ref()\n }\n\n /// Returns the lexical scope for this function.\n #[must_use]\n pub fn lexical_scope(&self) -> Option<&Scope> {\n self.lexical_scope.as_ref()\n }\n\n /// Returns the effective parameter scope for this function.\n #[must_use]\n pub fn parameter_scope(&self) -> Scope {\n if let Some(parameters_eval_scope) = &self.parameters_eval_scope {\n return parameters_eval_scope.clone();\n }\n self.function_scope.clone()\n }\n\n /// Returns the effective body scope for this function.\n pub(crate) fn body_scope(&self) -> Scope {\n if let Some(lexical_scope) = &self.lexical_scope {\n return lexical_scope.clone();\n }\n if let Some(parameters_scope) = &self.parameters_scope {\n return parameters_scope.clone();\n }\n if let Some(parameters_eval_scope) = &self.parameters_eval_scope {\n return parameters_eval_scope.clone();\n }\n self.function_scope.clone()\n }\n\n /// Marks all bindings in all scopes as escaping.\n pub(crate) fn escape_all_bindings(&self) {\n self.function_scope.escape_all_bindings();\n if let Some(parameters_eval_scope) = &self.parameters_eval_scope {\n parameters_eval_scope.escape_all_bindings();\n }\n if let Some(parameters_scope) = &self.parameters_scope {\n parameters_scope.escape_all_bindings();\n }\n if let Some(lexical_scope) = &self.lexical_scope {\n lexical_scope.escape_all_bindings();\n }\n }\n\n pub(crate) fn reorder_binding_indices(&self) {\n self.function_scope.reorder_binding_indices();\n if let Some(parameters_eval_scope) = &self.parameters_eval_scope {\n parameters_eval_scope.reorder_binding_indices();\n }\n if let Some(parameters_scope) = &self.parameters_scope {\n parameters_scope.reorder_binding_indices();\n }\n if let Some(lexical_scope) = &self.lexical_scope {\n lexical_scope.reorder_binding_indices();\n }\n }\n}\n\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for FunctionScopes {\n fn arbitrary(_u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n Ok(Self {\n function_scope: Scope::new_global(),\n parameters_eval_scope: None,\n parameters_scope: None,\n lexical_scope: None,\n mapped_arguments_object: false,\n requires_function_scope: false,\n })\n }\n}\n" }, { "path": "core/ast/src/scope_analyzer.rs", "content": "//! This module implements the scope analysis for the AST.\n//!\n//! The scope analysis is done in two steps:\n//! 1. Collecting bindings: This step collects all the bindings in the AST and fills the scopes with them.\n//! 2. Analyzing binding escapes: This step analyzes if the bindings escape their function scopes.\n\n#[cfg(feature = \"annex-b\")]\nuse crate::operations::annex_b_function_declarations_names;\nuse crate::{\n Declaration, Module, Script, StatementListItem, ToJsString,\n declaration::{Binding, ExportDeclaration, LexicalDeclaration, VariableList},\n expression::{Identifier, literal::ObjectMethodDefinition},\n function::{\n ArrowFunction, AsyncArrowFunction, AsyncFunctionDeclaration, AsyncFunctionExpression,\n AsyncGeneratorDeclaration, AsyncGeneratorExpression, ClassDeclaration, ClassElement,\n ClassExpression, FormalParameterList, FunctionBody, FunctionDeclaration,\n FunctionExpression, GeneratorDeclaration, GeneratorExpression,\n },\n operations::{\n ContainsSymbol, LexicallyScopedDeclaration, VarScopedDeclaration, bound_names, contains,\n lexically_declared_names, lexically_scoped_declarations, var_declared_names,\n var_scoped_declarations,\n },\n property::PropertyName,\n scope::{FunctionScopes, IdentifierReference, Scope},\n statement::{\n Block, Catch, ForInLoop, ForLoop, ForOfLoop, Switch, With,\n iteration::{ForLoopInitializer, IterableLoopInitializer},\n },\n visitor::{NodeRef, NodeRefMut, VisitorMut},\n};\nuse boa_interner::{Interner, Sym};\nuse rustc_hash::FxHashMap;\nuse std::ops::ControlFlow;\n\n/// Collect bindings and fill the scopes with them.\n///\n/// # Errors\n/// Any break in the control flow that happened during the collection.\npub(crate) fn collect_bindings<'a, N>(\n node: &'a mut N,\n strict: bool,\n eval: bool,\n scope: &Scope,\n interner: &Interner,\n) -> Result<(), &'static str>\nwhere\n &'a mut N: Into>,\n{\n let mut visitor = BindingCollectorVisitor {\n strict,\n eval,\n in_arrow: false,\n scope: scope.clone(),\n interner,\n };\n match visitor.visit(node) {\n ControlFlow::Continue(()) => Ok(()),\n ControlFlow::Break(reason) => Err(reason),\n }\n}\n\n/// Analyze if bindings escape their function scopes.\n///\n/// # Errors\n/// Any break in the control flow that happened during the analysis.\npub(crate) fn analyze_binding_escapes<'a, N>(\n node: &'a mut N,\n in_eval: bool,\n scope: Scope,\n interner: &Interner,\n) -> Result<(), &'static str>\nwhere\n &'a mut N: Into>,\n{\n let mut visitor = BindingEscapeAnalyzer {\n scope,\n direct_eval: in_eval,\n with: false,\n interner,\n };\n\n match visitor.visit(node.into()) {\n ControlFlow::Continue(()) => Ok(()),\n ControlFlow::Break(reason) => Err(reason),\n }\n}\n\nstruct BindingEscapeAnalyzer<'interner> {\n scope: Scope,\n direct_eval: bool,\n with: bool,\n interner: &'interner Interner,\n}\n\nimpl<'ast> VisitorMut<'ast> for BindingEscapeAnalyzer<'_> {\n type BreakTy = &'static str;\n\n fn visit_identifier_mut(&mut self, node: &'ast mut Identifier) -> ControlFlow {\n let name = node.to_js_string(self.interner);\n self.scope\n .access_binding(&name, self.direct_eval || self.with);\n ControlFlow::Continue(())\n }\n\n fn visit_block_mut(&mut self, node: &'ast mut Block) -> ControlFlow {\n let direct_eval_old = self.direct_eval;\n self.direct_eval = node.contains_direct_eval || self.direct_eval;\n if let Some(scope) = &mut node.scope {\n if self.direct_eval {\n scope.escape_all_bindings();\n }\n std::mem::swap(&mut self.scope, scope);\n }\n\n self.visit_statement_list_mut(&mut node.statements)?;\n if let Some(scope) = &mut node.scope {\n std::mem::swap(&mut self.scope, scope);\n scope.reorder_binding_indices();\n }\n self.direct_eval = direct_eval_old;\n ControlFlow::Continue(())\n }\n\n fn visit_switch_mut(&mut self, node: &'ast mut Switch) -> ControlFlow {\n self.visit_expression_mut(&mut node.val)?;\n let direct_eval_old = self.direct_eval;\n self.direct_eval = node.contains_direct_eval || self.direct_eval;\n if let Some(scope) = &mut node.scope {\n if self.direct_eval {\n scope.escape_all_bindings();\n }\n std::mem::swap(&mut self.scope, scope);\n }\n for case in &mut node.cases {\n self.visit_case_mut(case)?;\n }\n if let Some(scope) = &mut node.scope {\n std::mem::swap(&mut self.scope, scope);\n scope.reorder_binding_indices();\n }\n self.direct_eval = direct_eval_old;\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut(&mut self, node: &'ast mut With) -> ControlFlow {\n let with = self.with;\n self.with = true;\n if self.direct_eval {\n node.scope.escape_all_bindings();\n }\n self.visit_expression_mut(&mut node.expression)?;\n std::mem::swap(&mut self.scope, &mut node.scope);\n self.visit_statement_mut(&mut node.statement)?;\n std::mem::swap(&mut self.scope, &mut node.scope);\n node.scope.reorder_binding_indices();\n self.with = with;\n ControlFlow::Continue(())\n }\n\n fn visit_catch_mut(&mut self, node: &'ast mut Catch) -> ControlFlow {\n let direct_eval_old = self.direct_eval;\n self.direct_eval = node.contains_direct_eval || self.direct_eval;\n if self.direct_eval {\n node.scope.escape_all_bindings();\n }\n std::mem::swap(&mut self.scope, &mut node.scope);\n if let Some(binding) = &mut node.parameter {\n self.visit_binding_mut(binding)?;\n }\n self.visit_block_mut(&mut node.block)?;\n std::mem::swap(&mut self.scope, &mut node.scope);\n node.scope.reorder_binding_indices();\n self.direct_eval = direct_eval_old;\n ControlFlow::Continue(())\n }\n\n fn visit_for_loop_mut(&mut self, node: &'ast mut ForLoop) -> ControlFlow {\n let direct_eval_old = self.direct_eval;\n self.direct_eval = node.inner.contains_direct_eval || self.direct_eval;\n if let Some(ForLoopInitializer::Lexical(decl)) = &mut node.inner.init {\n if self.direct_eval {\n decl.scope.escape_all_bindings();\n }\n std::mem::swap(&mut self.scope, &mut decl.scope);\n }\n if let Some(init) = &mut node.inner.init {\n self.visit_for_loop_initializer_mut(init)?;\n }\n if let Some(condition) = &mut node.inner.condition {\n self.visit_expression_mut(condition)?;\n }\n if let Some(final_expr) = &mut node.inner.final_expr {\n self.visit_expression_mut(final_expr)?;\n }\n self.visit_statement_mut(&mut node.inner.body)?;\n if let Some(ForLoopInitializer::Lexical(decl)) = &mut node.inner.init {\n std::mem::swap(&mut self.scope, &mut decl.scope);\n decl.scope.reorder_binding_indices();\n }\n self.direct_eval = direct_eval_old;\n ControlFlow::Continue(())\n }\n\n fn visit_for_in_loop_mut(&mut self, node: &'ast mut ForInLoop) -> ControlFlow {\n let direct_eval_old = self.direct_eval;\n if let Some(scope) = &mut node.target_scope {\n self.direct_eval = node.target_contains_direct_eval || self.direct_eval;\n if self.direct_eval {\n scope.escape_all_bindings();\n }\n std::mem::swap(&mut self.scope, scope);\n }\n self.visit_expression_mut(&mut node.target)?;\n if let Some(scope) = &mut node.target_scope {\n self.direct_eval = direct_eval_old;\n std::mem::swap(&mut self.scope, scope);\n scope.reorder_binding_indices();\n }\n if let Some(scope) = &mut node.scope {\n self.direct_eval = node.contains_direct_eval || self.direct_eval;\n if self.direct_eval {\n scope.escape_all_bindings();\n }\n std::mem::swap(&mut self.scope, scope);\n }\n self.visit_iterable_loop_initializer_mut(&mut node.initializer)?;\n self.visit_statement_mut(&mut node.body)?;\n if let Some(scope) = &mut node.scope {\n std::mem::swap(&mut self.scope, scope);\n scope.reorder_binding_indices();\n }\n self.direct_eval = direct_eval_old;\n ControlFlow::Continue(())\n }\n\n fn visit_for_of_loop_mut(&mut self, node: &'ast mut ForOfLoop) -> ControlFlow {\n let direct_eval_old = self.direct_eval;\n if let Some(scope) = &mut node.iterable_scope {\n self.direct_eval = node.iterable_contains_direct_eval || self.direct_eval;\n if self.direct_eval {\n scope.escape_all_bindings();\n }\n std::mem::swap(&mut self.scope, scope);\n }\n self.visit_expression_mut(&mut node.iterable)?;\n if let Some(scope) = &mut node.iterable_scope {\n self.direct_eval = direct_eval_old;\n std::mem::swap(&mut self.scope, scope);\n scope.reorder_binding_indices();\n }\n if let Some(scope) = &mut node.scope {\n self.direct_eval = node.contains_direct_eval || self.direct_eval;\n if self.direct_eval {\n scope.escape_all_bindings();\n }\n std::mem::swap(&mut self.scope, scope);\n }\n self.visit_iterable_loop_initializer_mut(&mut node.init)?;\n self.visit_statement_mut(&mut node.body)?;\n if let Some(scope) = &mut node.scope {\n std::mem::swap(&mut self.scope, scope);\n scope.reorder_binding_indices();\n }\n self.direct_eval = direct_eval_old;\n ControlFlow::Continue(())\n }\n\n fn visit_function_declaration_mut(\n &mut self,\n node: &'ast mut FunctionDeclaration,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_generator_declaration_mut(\n &mut self,\n node: &'ast mut GeneratorDeclaration,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_async_function_declaration_mut(\n &mut self,\n node: &'ast mut AsyncFunctionDeclaration,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_async_generator_declaration_mut(\n &mut self,\n node: &'ast mut AsyncGeneratorDeclaration,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_function_expression_mut(\n &mut self,\n node: &'ast mut FunctionExpression,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_generator_expression_mut(\n &mut self,\n node: &'ast mut GeneratorExpression,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_async_function_expression_mut(\n &mut self,\n node: &'ast mut AsyncFunctionExpression,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_async_generator_expression_mut(\n &mut self,\n node: &'ast mut AsyncGeneratorExpression,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_arrow_function_mut(\n &mut self,\n node: &'ast mut ArrowFunction,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_async_arrow_function_mut(\n &mut self,\n node: &'ast mut AsyncArrowFunction,\n ) -> ControlFlow {\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_class_declaration_mut(\n &mut self,\n node: &'ast mut ClassDeclaration,\n ) -> ControlFlow {\n node.name_scope.escape_all_bindings();\n std::mem::swap(&mut self.scope, &mut node.name_scope);\n if let Some(super_ref) = &mut node.super_ref {\n self.visit_expression_mut(super_ref)?;\n }\n if let Some(constructor) = &mut node.constructor {\n self.visit_function_expression_mut(constructor)?;\n }\n for element in &mut *node.elements {\n self.visit_class_element_mut(element)?;\n }\n std::mem::swap(&mut self.scope, &mut node.name_scope);\n node.name_scope.reorder_binding_indices();\n ControlFlow::Continue(())\n }\n\n fn visit_class_expression_mut(\n &mut self,\n node: &'ast mut ClassExpression,\n ) -> ControlFlow {\n if let Some(name_scope) = &mut node.name_scope {\n if self.direct_eval {\n name_scope.escape_all_bindings();\n }\n name_scope.escape_all_bindings();\n std::mem::swap(&mut self.scope, name_scope);\n }\n if let Some(super_ref) = &mut node.super_ref {\n self.visit_expression_mut(super_ref)?;\n }\n if let Some(constructor) = &mut node.constructor {\n self.visit_function_expression_mut(constructor)?;\n }\n for element in &mut *node.elements {\n self.visit_class_element_mut(element)?;\n }\n if let Some(name_scope) = &mut node.name_scope {\n std::mem::swap(&mut self.scope, name_scope);\n name_scope.reorder_binding_indices();\n }\n ControlFlow::Continue(())\n }\n\n fn visit_class_element_mut(\n &mut self,\n node: &'ast mut ClassElement,\n ) -> ControlFlow {\n match node {\n ClassElement::MethodDefinition(node) => self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n ),\n ClassElement::FieldDefinition(field) | ClassElement::StaticFieldDefinition(field) => {\n self.visit_property_name_mut(&mut field.name)?;\n if let Some(e) = &mut field.initializer {\n std::mem::swap(&mut self.scope, &mut field.scope);\n self.visit_expression_mut(e)?;\n std::mem::swap(&mut self.scope, &mut field.scope);\n }\n ControlFlow::Continue(())\n }\n ClassElement::PrivateFieldDefinition(field)\n | ClassElement::PrivateStaticFieldDefinition(field) => {\n if let Some(e) = &mut field.initializer {\n std::mem::swap(&mut self.scope, &mut field.scope);\n self.visit_expression_mut(e)?;\n std::mem::swap(&mut self.scope, &mut field.scope);\n }\n ControlFlow::Continue(())\n }\n ClassElement::StaticBlock(node) => {\n let contains_direct_eval = contains(node.statements(), ContainsSymbol::DirectEval);\n self.visit_function_like(\n &mut FormalParameterList::default(),\n &mut node.body,\n &mut node.scopes,\n contains_direct_eval,\n )\n }\n }\n }\n\n fn visit_object_method_definition_mut(\n &mut self,\n node: &'ast mut ObjectMethodDefinition,\n ) -> ControlFlow {\n self.visit_property_name_mut(&mut node.name)?;\n self.visit_function_like(\n &mut node.parameters,\n &mut node.body,\n &mut node.scopes,\n node.contains_direct_eval,\n )\n }\n\n fn visit_export_declaration_mut(\n &mut self,\n node: &'ast mut ExportDeclaration,\n ) -> ControlFlow {\n match node {\n ExportDeclaration::ReExport {\n specifier, kind, ..\n } => {\n self.visit_module_specifier_mut(specifier)?;\n self.visit_re_export_kind_mut(kind)\n }\n ExportDeclaration::List(list) => {\n for item in &mut **list {\n self.visit_export_specifier_mut(item)?;\n }\n ControlFlow::Continue(())\n }\n ExportDeclaration::VarStatement(var) => self.visit_var_declaration_mut(var),\n ExportDeclaration::Declaration(decl) => self.visit_declaration_mut(decl),\n ExportDeclaration::DefaultFunctionDeclaration(f) => {\n self.visit_function_declaration_mut(f)\n }\n ExportDeclaration::DefaultGeneratorDeclaration(g) => {\n self.visit_generator_declaration_mut(g)\n }\n ExportDeclaration::DefaultAsyncFunctionDeclaration(af) => {\n self.visit_async_function_declaration_mut(af)\n }\n ExportDeclaration::DefaultAsyncGeneratorDeclaration(ag) => {\n self.visit_async_generator_declaration_mut(ag)\n }\n ExportDeclaration::DefaultClassDeclaration(c) => self.visit_class_declaration_mut(c),\n ExportDeclaration::DefaultAssignmentExpression(expr) => {\n let name = Sym::DEFAULT_EXPORT.to_js_string(self.interner);\n drop(self.scope.create_mutable_binding(name.clone(), false));\n self.scope.access_binding(&name, true);\n self.visit_expression_mut(expr)\n }\n }\n }\n\n fn visit_module_mut(&mut self, node: &'ast mut Module) -> ControlFlow {\n let mut scope = node.scope.clone();\n scope.escape_all_bindings();\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_module_item_list_mut(&mut node.items)?;\n std::mem::swap(&mut self.scope, &mut scope);\n scope.reorder_binding_indices();\n ControlFlow::Continue(())\n }\n}\n\nimpl BindingEscapeAnalyzer<'_> {\n fn visit_function_like(\n &mut self,\n parameters: &mut FormalParameterList,\n body: &mut FunctionBody,\n scopes: &mut FunctionScopes,\n contains_direct_eval: bool,\n ) -> ControlFlow<&'static str> {\n let direct_eval_old = self.direct_eval;\n self.direct_eval = contains_direct_eval || self.direct_eval;\n if self.direct_eval {\n scopes.escape_all_bindings();\n }\n let mut scope = scopes.parameter_scope();\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_formal_parameter_list_mut(parameters)?;\n std::mem::swap(&mut self.scope, &mut scope);\n scope = scopes.body_scope();\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_function_body_mut(body)?;\n std::mem::swap(&mut self.scope, &mut scope);\n if scopes.arguments_object_accessed() && scopes.mapped_arguments_object {\n let parameter_names = bound_names(parameters);\n for name in parameter_names {\n scopes\n .parameter_scope()\n .access_binding(&name.to_js_string(self.interner), true);\n }\n }\n scopes.reorder_binding_indices();\n self.direct_eval = direct_eval_old;\n ControlFlow::Continue(())\n }\n}\n\nstruct BindingCollectorVisitor<'interner> {\n strict: bool,\n eval: bool,\n scope: Scope,\n in_arrow: bool,\n interner: &'interner Interner,\n}\n\nimpl<'ast> VisitorMut<'ast> for BindingCollectorVisitor<'_> {\n type BreakTy = &'static str;\n\n fn visit_this_mut(\n &mut self,\n _node: &'ast mut crate::expression::This,\n ) -> ControlFlow {\n // NOTE: Arrow functions inherit 'this' from their enclosing scope, so we must escape it.\n if self.in_arrow {\n self.scope.escape_this_in_enclosing_function_scope();\n }\n ControlFlow::Continue(())\n }\n\n fn visit_function_declaration_mut(\n &mut self,\n node: &'ast mut FunctionDeclaration,\n ) -> ControlFlow {\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n None,\n &mut None,\n strict,\n false,\n )\n }\n\n fn visit_generator_declaration_mut(\n &mut self,\n node: &'ast mut GeneratorDeclaration,\n ) -> ControlFlow {\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n None,\n &mut None,\n strict,\n false,\n )\n }\n\n fn visit_async_function_declaration_mut(\n &mut self,\n node: &'ast mut AsyncFunctionDeclaration,\n ) -> ControlFlow {\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n None,\n &mut None,\n strict,\n false,\n )\n }\n\n fn visit_async_generator_declaration_mut(\n &mut self,\n node: &'ast mut AsyncGeneratorDeclaration,\n ) -> ControlFlow {\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n None,\n &mut None,\n strict,\n false,\n )\n }\n\n fn visit_function_expression_mut(\n &mut self,\n node: &'ast mut FunctionExpression,\n ) -> ControlFlow {\n let name = if node.has_binding_identifier {\n node.name()\n } else {\n None\n };\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n name,\n &mut node.name_scope,\n strict,\n false,\n )\n }\n\n fn visit_generator_expression_mut(\n &mut self,\n node: &'ast mut GeneratorExpression,\n ) -> ControlFlow {\n let name = if node.has_binding_identifier {\n node.name()\n } else {\n None\n };\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n name,\n &mut node.name_scope,\n strict,\n false,\n )\n }\n\n fn visit_async_function_expression_mut(\n &mut self,\n node: &'ast mut AsyncFunctionExpression,\n ) -> ControlFlow {\n let name = if node.has_binding_identifier {\n node.name()\n } else {\n None\n };\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n name,\n &mut node.name_scope,\n strict,\n false,\n )\n }\n\n fn visit_async_generator_expression_mut(\n &mut self,\n node: &'ast mut AsyncGeneratorExpression,\n ) -> ControlFlow {\n let name = if node.has_binding_identifier {\n node.name()\n } else {\n None\n };\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n name,\n &mut node.name_scope,\n strict,\n false,\n )\n }\n\n fn visit_arrow_function_mut(\n &mut self,\n node: &'ast mut ArrowFunction,\n ) -> ControlFlow {\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n None,\n &mut None,\n strict,\n true,\n )\n }\n\n fn visit_async_arrow_function_mut(\n &mut self,\n node: &'ast mut AsyncArrowFunction,\n ) -> ControlFlow {\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n None,\n &mut None,\n strict,\n true,\n )\n }\n\n fn visit_class_declaration_mut(\n &mut self,\n node: &'ast mut ClassDeclaration,\n ) -> ControlFlow {\n let mut name_scope = Scope::new(self.scope.clone(), false);\n let name = node.name().to_js_string(self.interner);\n name_scope.create_immutable_binding(name, true);\n std::mem::swap(&mut self.scope, &mut name_scope);\n if let Some(super_ref) = &mut node.super_ref {\n self.visit_expression_mut(super_ref)?;\n }\n if let Some(constructor) = &mut node.constructor {\n self.visit_function_expression_mut(constructor)?;\n }\n for element in &mut *node.elements {\n self.visit_class_element_mut(element)?;\n }\n std::mem::swap(&mut self.scope, &mut name_scope);\n node.name_scope = name_scope;\n ControlFlow::Continue(())\n }\n\n fn visit_class_expression_mut(\n &mut self,\n node: &'ast mut ClassExpression,\n ) -> ControlFlow {\n let mut name_scope = None;\n if let Some(name) = node.name\n && node.name_scope.is_some()\n {\n let mut scope = Scope::new(self.scope.clone(), false);\n let name = name.to_js_string(self.interner);\n scope.create_immutable_binding(name, true);\n node.name_scope = Some(scope.clone());\n std::mem::swap(&mut self.scope, &mut scope);\n name_scope = Some(scope);\n }\n\n if let Some(super_ref) = &mut node.super_ref {\n self.visit_expression_mut(super_ref)?;\n }\n if let Some(constructor) = &mut node.constructor {\n self.visit_function_expression_mut(constructor)?;\n }\n for element in &mut *node.elements {\n self.visit_class_element_mut(element)?;\n }\n if let Some(mut scope) = name_scope {\n std::mem::swap(&mut self.scope, &mut scope);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_class_element_mut(\n &mut self,\n node: &'ast mut ClassElement,\n ) -> ControlFlow {\n match node {\n ClassElement::MethodDefinition(node) => {\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n None,\n &mut None,\n strict,\n false,\n )\n }\n ClassElement::FieldDefinition(field) | ClassElement::StaticFieldDefinition(field) => {\n self.visit_property_name_mut(&mut field.name)?;\n let mut scope = Scope::new(self.scope.clone(), true);\n std::mem::swap(&mut self.scope, &mut scope);\n if let Some(e) = &mut field.initializer {\n self.visit_expression_mut(e)?;\n }\n std::mem::swap(&mut self.scope, &mut scope);\n field.scope = scope;\n ControlFlow::Continue(())\n }\n ClassElement::PrivateFieldDefinition(field)\n | ClassElement::PrivateStaticFieldDefinition(field) => {\n let mut scope = Scope::new(self.scope.clone(), true);\n std::mem::swap(&mut self.scope, &mut scope);\n if let Some(e) = &mut field.initializer {\n self.visit_expression_mut(e)?;\n }\n std::mem::swap(&mut self.scope, &mut scope);\n field.scope = scope;\n ControlFlow::Continue(())\n }\n ClassElement::StaticBlock(node) => {\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut FormalParameterList::default(),\n &mut node.scopes,\n None,\n &mut None,\n strict,\n false,\n )\n }\n }\n }\n\n fn visit_object_method_definition_mut(\n &mut self,\n node: &'ast mut ObjectMethodDefinition,\n ) -> ControlFlow {\n match &mut node.name {\n PropertyName::Literal(_) => {}\n PropertyName::Computed(name) => {\n self.visit_expression_mut(name)?;\n }\n }\n let strict = node.body.strict();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n None,\n &mut None,\n strict,\n false,\n )\n }\n\n fn visit_block_mut(&mut self, node: &'ast mut Block) -> ControlFlow {\n let mut scope = block_declaration_instantiation(node, self.scope.clone(), self.interner);\n if let Some(scope) = &mut scope {\n std::mem::swap(&mut self.scope, scope);\n }\n self.visit_statement_list_mut(&mut node.statements)?;\n if let Some(scope) = &mut scope {\n std::mem::swap(&mut self.scope, scope);\n }\n node.scope = scope;\n ControlFlow::Continue(())\n }\n\n fn visit_switch_mut(&mut self, node: &'ast mut Switch) -> ControlFlow {\n self.visit_expression_mut(&mut node.val)?;\n let mut scope = block_declaration_instantiation(node, self.scope.clone(), self.interner);\n if let Some(scope) = &mut scope {\n std::mem::swap(&mut self.scope, scope);\n }\n for case in &mut *node.cases {\n self.visit_case_mut(case)?;\n }\n if let Some(scope) = &mut scope {\n std::mem::swap(&mut self.scope, scope);\n }\n node.scope = scope;\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut(&mut self, node: &'ast mut With) -> ControlFlow {\n self.visit_expression_mut(&mut node.expression)?;\n let mut scope = Scope::new(self.scope.clone(), false);\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_statement_mut(&mut node.statement)?;\n std::mem::swap(&mut self.scope, &mut scope);\n node.scope = scope;\n ControlFlow::Continue(())\n }\n\n fn visit_catch_mut(&mut self, node: &'ast mut Catch) -> ControlFlow {\n let mut scope = Scope::new(self.scope.clone(), false);\n if let Some(binding) = node.parameter() {\n match binding {\n Binding::Identifier(ident) => {\n let ident = ident.to_js_string(self.interner);\n drop(scope.create_mutable_binding(ident.clone(), false));\n }\n Binding::Pattern(pattern) => {\n for ident in bound_names(pattern) {\n let ident = ident.to_js_string(self.interner);\n drop(scope.create_mutable_binding(ident, false));\n }\n }\n }\n }\n std::mem::swap(&mut self.scope, &mut scope);\n if let Some(binding) = &mut node.parameter {\n self.visit_binding_mut(binding)?;\n }\n self.visit_block_mut(&mut node.block)?;\n std::mem::swap(&mut self.scope, &mut scope);\n node.scope = scope;\n ControlFlow::Continue(())\n }\n\n fn visit_for_loop_mut(&mut self, node: &'ast mut ForLoop) -> ControlFlow {\n let scope = match &mut node.inner.init {\n Some(ForLoopInitializer::Lexical(decl)) => {\n let mut scope = Scope::new(self.scope.clone(), false);\n let names = bound_names(&decl.declaration);\n if decl.declaration.is_const() {\n for name in &names {\n let name = name.to_js_string(self.interner);\n scope.create_immutable_binding(name, true);\n }\n } else {\n for name in &names {\n let name = name.to_js_string(self.interner);\n drop(scope.create_mutable_binding(name, false));\n }\n }\n decl.scope = scope.clone();\n std::mem::swap(&mut self.scope, &mut scope);\n Some(scope)\n }\n _ => None,\n };\n if let Some(fli) = &mut node.inner.init {\n self.visit_for_loop_initializer_mut(fli)?;\n }\n if let Some(expr) = &mut node.inner.condition {\n self.visit_expression_mut(expr)?;\n }\n if let Some(expr) = &mut node.inner.final_expr {\n self.visit_expression_mut(expr)?;\n }\n self.visit_statement_mut(&mut node.inner.body)?;\n if let Some(mut scope) = scope {\n std::mem::swap(&mut self.scope, &mut scope);\n }\n ControlFlow::Continue(())\n }\n\n fn visit_for_in_loop_mut(&mut self, node: &'ast mut ForInLoop) -> ControlFlow {\n let initializer_bound_names = match node.initializer() {\n IterableLoopInitializer::Let(declaration)\n | IterableLoopInitializer::Const(declaration) => bound_names(declaration),\n _ => Vec::new(),\n };\n if initializer_bound_names.is_empty() {\n self.visit_expression_mut(&mut node.target)?;\n } else {\n let mut scope = Scope::new(self.scope.clone(), false);\n for name in &initializer_bound_names {\n let name = name.to_js_string(self.interner);\n drop(scope.create_mutable_binding(name, false));\n }\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_expression_mut(&mut node.target)?;\n std::mem::swap(&mut self.scope, &mut scope);\n node.target_scope = Some(scope);\n }\n let scope = match node.initializer() {\n IterableLoopInitializer::Let(declaration) => {\n let scope = Scope::new(self.scope.clone(), false);\n match declaration {\n Binding::Identifier(ident) => {\n let ident = ident.to_js_string(self.interner);\n drop(scope.create_mutable_binding(ident.clone(), false));\n }\n Binding::Pattern(pattern) => {\n for ident in bound_names(pattern) {\n let ident = ident.to_js_string(self.interner);\n drop(scope.create_mutable_binding(ident, false));\n }\n }\n }\n Some(scope)\n }\n IterableLoopInitializer::Const(declaration) => {\n let scope = Scope::new(self.scope.clone(), false);\n match declaration {\n Binding::Identifier(ident) => {\n let ident = ident.to_js_string(self.interner);\n scope.create_immutable_binding(ident.clone(), true);\n }\n Binding::Pattern(pattern) => {\n for ident in bound_names(pattern) {\n let ident = ident.to_js_string(self.interner);\n scope.create_immutable_binding(ident, true);\n }\n }\n }\n Some(scope)\n }\n _ => None,\n };\n if let Some(mut scope) = scope {\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_iterable_loop_initializer_mut(&mut node.initializer)?;\n self.visit_statement_mut(&mut node.body)?;\n std::mem::swap(&mut self.scope, &mut scope);\n node.scope = Some(scope);\n } else {\n self.visit_iterable_loop_initializer_mut(&mut node.initializer)?;\n self.visit_statement_mut(&mut node.body)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_for_of_loop_mut(&mut self, node: &'ast mut ForOfLoop) -> ControlFlow {\n let initializer_bound_names = match node.initializer() {\n IterableLoopInitializer::Let(declaration)\n | IterableLoopInitializer::Const(declaration) => bound_names(declaration),\n _ => Vec::new(),\n };\n if initializer_bound_names.is_empty() {\n self.visit_expression_mut(&mut node.iterable)?;\n } else {\n let mut scope = Scope::new(self.scope.clone(), false);\n for name in &initializer_bound_names {\n let name = name.to_js_string(self.interner);\n drop(scope.create_mutable_binding(name, false));\n }\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_expression_mut(&mut node.iterable)?;\n std::mem::swap(&mut self.scope, &mut scope);\n node.iterable_scope = Some(scope);\n }\n let scope = match node.initializer() {\n IterableLoopInitializer::Let(declaration) => {\n let scope = Scope::new(self.scope.clone(), false);\n match declaration {\n Binding::Identifier(ident) => {\n let ident = ident.to_js_string(self.interner);\n drop(scope.create_mutable_binding(ident.clone(), false));\n }\n Binding::Pattern(pattern) => {\n for ident in bound_names(pattern) {\n let ident = ident.to_js_string(self.interner);\n drop(scope.create_mutable_binding(ident, false));\n }\n }\n }\n Some(scope)\n }\n IterableLoopInitializer::Const(declaration) => {\n let scope = Scope::new(self.scope.clone(), false);\n match declaration {\n Binding::Identifier(ident) => {\n let ident = ident.to_js_string(self.interner);\n scope.create_immutable_binding(ident.clone(), true);\n }\n Binding::Pattern(pattern) => {\n for ident in bound_names(pattern) {\n let ident = ident.to_js_string(self.interner);\n scope.create_immutable_binding(ident, true);\n }\n }\n }\n Some(scope)\n }\n _ => None,\n };\n if let Some(mut scope) = scope {\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_iterable_loop_initializer_mut(&mut node.init)?;\n self.visit_statement_mut(&mut node.body)?;\n std::mem::swap(&mut self.scope, &mut scope);\n node.scope = Some(scope);\n } else {\n self.visit_iterable_loop_initializer_mut(&mut node.init)?;\n self.visit_statement_mut(&mut node.body)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_module_mut(&mut self, node: &'ast mut Module) -> ControlFlow {\n let mut scope = Scope::new(self.scope.clone(), true);\n module_instantiation(node, &scope, self.interner);\n std::mem::swap(&mut self.scope, &mut scope);\n self.visit_module_item_list_mut(&mut node.items)?;\n std::mem::swap(&mut self.scope, &mut scope);\n node.scope = scope;\n ControlFlow::Continue(())\n }\n\n fn visit_script_mut(&mut self, node: &'ast mut Script) -> ControlFlow {\n if self.eval {\n self.visit_statement_list_mut(node.statements_mut())?;\n } else {\n match global_declaration_instantiation(node, &self.scope, self.interner) {\n Ok(()) => {\n self.visit_statement_list_mut(node.statements_mut())?;\n }\n Err(e) => return ControlFlow::Break(e),\n }\n }\n ControlFlow::Continue(())\n }\n}\n\nimpl BindingCollectorVisitor<'_> {\n #[allow(clippy::too_many_arguments)]\n fn visit_function_like(\n &mut self,\n body: &mut FunctionBody,\n parameters: &mut FormalParameterList,\n scopes: &mut FunctionScopes,\n name: Option,\n name_scope: &mut Option,\n strict: bool,\n arrow: bool,\n ) -> ControlFlow<&'static str> {\n let strict = self.strict || strict;\n let old_in_arrow = self.in_arrow;\n self.in_arrow = arrow;\n\n let function_scope = if let Some(name) = name {\n let scope = Scope::new(self.scope.clone(), false);\n let name = name.to_js_string(self.interner);\n scope.create_immutable_binding(name, strict);\n *name_scope = Some(scope.clone());\n Scope::new(scope, true)\n } else {\n Scope::new(self.scope.clone(), true)\n };\n\n let function_scopes = function_declaration_instantiation(\n body,\n parameters,\n arrow,\n strict,\n function_scope.clone(),\n self.interner,\n );\n\n let mut params_scope = function_scopes.parameter_scope();\n let mut body_scope = function_scopes.body_scope();\n\n std::mem::swap(&mut self.scope, &mut params_scope);\n self.visit_formal_parameter_list_mut(parameters)?;\n std::mem::swap(&mut self.scope, &mut params_scope);\n\n std::mem::swap(&mut self.scope, &mut body_scope);\n self.visit_function_body_mut(body)?;\n std::mem::swap(&mut self.scope, &mut body_scope);\n\n *scopes = function_scopes;\n\n self.in_arrow = old_in_arrow;\n\n ControlFlow::Continue(())\n }\n}\n\n/// Optimize scope indices when scopes only contain local bindings.\npub(crate) fn optimize_scope_indices<'a, N>(node: &'a mut N, scope: &Scope)\nwhere\n &'a mut N: Into>,\n{\n let mut visitor = ScopeIndexVisitor {\n index: scope.scope_index(),\n };\n let _ = visitor.visit(node.into());\n}\n\n/// Like [`optimize_scope_indices`] but for a [`FunctionExpression`] compiled\n/// by the `Function` constructor with `force_function_scope = true`.\n///\n/// The `Function` constructor always pushes a function scope at runtime, so\n/// the optimizer must account for that even when the function scope would\n/// otherwise be elided.\npub(crate) fn optimize_scope_indices_function_constructor(\n node: &mut FunctionExpression,\n scope: &Scope,\n) {\n let mut visitor = ScopeIndexVisitor {\n index: scope.scope_index(),\n };\n let _ = visitor.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut node.name_scope,\n false,\n // Always force the function scope for the Function constructor.\n true,\n );\n}\n\nstruct ScopeIndexVisitor {\n index: u32,\n}\n\nimpl<'ast> VisitorMut<'ast> for ScopeIndexVisitor {\n type BreakTy = ();\n\n fn visit_function_declaration_mut(\n &mut self,\n node: &'ast mut FunctionDeclaration,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut None,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_generator_declaration_mut(\n &mut self,\n node: &'ast mut GeneratorDeclaration,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut None,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_async_function_declaration_mut(\n &mut self,\n node: &'ast mut AsyncFunctionDeclaration,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut None,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_async_generator_declaration_mut(\n &mut self,\n node: &'ast mut AsyncGeneratorDeclaration,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut None,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_function_expression_mut(\n &mut self,\n node: &'ast mut FunctionExpression,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut node.name_scope,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_generator_expression_mut(\n &mut self,\n node: &'ast mut GeneratorExpression,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut node.name_scope,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_async_function_expression_mut(\n &mut self,\n node: &'ast mut AsyncFunctionExpression,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut node.name_scope,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_async_generator_expression_mut(\n &mut self,\n node: &'ast mut AsyncGeneratorExpression,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut node.name_scope,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_arrow_function_mut(\n &mut self,\n node: &'ast mut ArrowFunction,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut None,\n true,\n contains_direct_eval,\n )\n }\n\n fn visit_async_arrow_function_mut(\n &mut self,\n node: &'ast mut AsyncArrowFunction,\n ) -> ControlFlow {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut None,\n true,\n contains_direct_eval,\n )\n }\n\n fn visit_class_declaration_mut(\n &mut self,\n node: &'ast mut ClassDeclaration,\n ) -> ControlFlow {\n let index = self.index;\n if !node.name_scope.all_bindings_local() {\n self.index += 1;\n }\n node.name_scope.set_index(self.index);\n if let Some(super_ref) = &mut node.super_ref {\n self.visit_expression_mut(super_ref)?;\n }\n if let Some(constructor) = &mut node.constructor {\n let node = constructor;\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut node.name_scope,\n false,\n true,\n )?;\n }\n for element in &mut *node.elements {\n self.visit_class_element_mut(element)?;\n }\n self.index = index;\n ControlFlow::Continue(())\n }\n\n fn visit_class_expression_mut(\n &mut self,\n node: &'ast mut ClassExpression,\n ) -> ControlFlow {\n let index = self.index;\n if let Some(scope) = &node.name_scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n if let Some(super_ref) = &mut node.super_ref {\n self.visit_expression_mut(super_ref)?;\n }\n if let Some(constructor) = &mut node.constructor {\n self.visit_function_like(\n &mut constructor.body,\n &mut constructor.parameters,\n &mut constructor.scopes,\n &mut constructor.name_scope,\n false,\n true,\n )?;\n }\n for element in &mut *node.elements {\n self.visit_class_element_mut(element)?;\n }\n self.index = index;\n ControlFlow::Continue(())\n }\n\n fn visit_class_element_mut(\n &mut self,\n node: &'ast mut ClassElement,\n ) -> ControlFlow {\n match node {\n ClassElement::MethodDefinition(node) => {\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut None,\n false,\n contains_direct_eval,\n )\n }\n ClassElement::FieldDefinition(field) | ClassElement::StaticFieldDefinition(field) => {\n self.visit_property_name_mut(&mut field.name)?;\n let index = self.index;\n self.index += 1;\n field.scope.set_index(self.index);\n if let Some(e) = &mut field.initializer {\n self.visit_expression_mut(e)?;\n }\n self.index = index;\n ControlFlow::Continue(())\n }\n ClassElement::PrivateFieldDefinition(field)\n | ClassElement::PrivateStaticFieldDefinition(field) => {\n let index = self.index;\n self.index += 1;\n field.scope.set_index(self.index);\n if let Some(e) = &mut field.initializer {\n self.visit_expression_mut(e)?;\n }\n self.index = index;\n ControlFlow::Continue(())\n }\n ClassElement::StaticBlock(node) => self.visit_function_like(\n &mut node.body,\n &mut FormalParameterList::default(),\n &mut node.scopes,\n &mut None,\n false,\n true,\n ),\n }\n }\n\n fn visit_object_method_definition_mut(\n &mut self,\n node: &'ast mut ObjectMethodDefinition,\n ) -> ControlFlow {\n match &mut node.name {\n PropertyName::Literal(_) => {}\n PropertyName::Computed(name) => {\n self.visit_expression_mut(name)?;\n }\n }\n let contains_direct_eval = node.contains_direct_eval();\n self.visit_function_like(\n &mut node.body,\n &mut node.parameters,\n &mut node.scopes,\n &mut None,\n false,\n contains_direct_eval,\n )\n }\n\n fn visit_block_mut(&mut self, node: &'ast mut Block) -> ControlFlow {\n let index = self.index;\n if let Some(scope) = &node.scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n self.visit_statement_list_mut(&mut node.statements)?;\n self.index = index;\n ControlFlow::Continue(())\n }\n\n fn visit_switch_mut(&mut self, node: &'ast mut Switch) -> ControlFlow {\n let index = self.index;\n self.visit_expression_mut(&mut node.val)?;\n if let Some(scope) = &node.scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n for case in &mut *node.cases {\n self.visit_case_mut(case)?;\n }\n self.index = index;\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut(&mut self, node: &'ast mut With) -> ControlFlow {\n let index = self.index;\n self.visit_expression_mut(&mut node.expression)?;\n self.index += 1;\n node.scope.set_index(self.index);\n self.visit_statement_mut(&mut node.statement)?;\n self.index = index;\n ControlFlow::Continue(())\n }\n\n fn visit_catch_mut(&mut self, node: &'ast mut Catch) -> ControlFlow {\n let index = self.index;\n if !node.scope.all_bindings_local() {\n self.index += 1;\n }\n node.scope.set_index(self.index);\n if let Some(binding) = &mut node.parameter {\n self.visit_binding_mut(binding)?;\n }\n self.visit_block_mut(&mut node.block)?;\n self.index = index;\n ControlFlow::Continue(())\n }\n\n fn visit_for_loop_mut(&mut self, node: &'ast mut ForLoop) -> ControlFlow {\n let index = self.index;\n if let Some(ForLoopInitializer::Lexical(decl)) = &mut node.inner.init {\n if !decl.scope.all_bindings_local() {\n self.index += 1;\n }\n decl.scope.set_index(self.index);\n }\n if let Some(fli) = &mut node.inner.init {\n self.visit_for_loop_initializer_mut(fli)?;\n }\n if let Some(expr) = &mut node.inner.condition {\n self.visit_expression_mut(expr)?;\n }\n if let Some(expr) = &mut node.inner.final_expr {\n self.visit_expression_mut(expr)?;\n }\n self.visit_statement_mut(&mut node.inner.body)?;\n self.index = index;\n ControlFlow::Continue(())\n }\n\n fn visit_for_in_loop_mut(&mut self, node: &'ast mut ForInLoop) -> ControlFlow {\n {\n let index = self.index;\n if let Some(scope) = &node.target_scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n self.visit_expression_mut(&mut node.target)?;\n self.index = index;\n }\n let index = self.index;\n if let Some(scope) = &node.scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n self.visit_iterable_loop_initializer_mut(&mut node.initializer)?;\n self.visit_statement_mut(&mut node.body)?;\n self.index = index;\n ControlFlow::Continue(())\n }\n\n fn visit_for_of_loop_mut(&mut self, node: &'ast mut ForOfLoop) -> ControlFlow {\n {\n let index = self.index;\n if let Some(scope) = &node.iterable_scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n self.visit_expression_mut(&mut node.iterable)?;\n self.index = index;\n }\n let index = self.index;\n if let Some(scope) = &node.scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n self.visit_iterable_loop_initializer_mut(&mut node.init)?;\n self.visit_statement_mut(&mut node.body)?;\n self.index = index;\n ControlFlow::Continue(())\n }\n}\n\nimpl ScopeIndexVisitor {\n fn visit_function_like(\n &mut self,\n body: &mut FunctionBody,\n parameters: &mut FormalParameterList,\n scopes: &mut FunctionScopes,\n name_scope: &mut Option,\n arrow: bool,\n force_function_scope: bool,\n ) -> ControlFlow<()> {\n let index = self.index;\n if let Some(scope) = name_scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n\n if force_function_scope || !scopes.function_scope().all_bindings_local() {\n scopes.requires_function_scope = true;\n self.index += 1;\n } else if !arrow {\n assert!(scopes.function_scope().is_function());\n scopes.requires_function_scope = scopes.function_scope().escaped_this()\n || contains(parameters, ContainsSymbol::Super)\n || contains(body, ContainsSymbol::Super)\n || contains(parameters, ContainsSymbol::NewTarget)\n || contains(body, ContainsSymbol::NewTarget);\n self.index += u32::from(scopes.requires_function_scope);\n }\n\n scopes.function_scope.set_index(self.index);\n if let Some(scope) = &scopes.parameters_eval_scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n self.visit_formal_parameter_list_mut(parameters)?;\n if let Some(scope) = &scopes.parameters_scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n if let Some(scope) = &scopes.lexical_scope {\n if !scope.all_bindings_local() {\n self.index += 1;\n }\n scope.set_index(self.index);\n }\n self.visit_function_body_mut(body)?;\n self.index = index;\n ControlFlow::Continue(())\n }\n}\n\n/// `GlobalDeclarationInstantiation ( script, env )`\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-globaldeclarationinstantiation\n///\n/// # Errors\n///\n/// - If a duplicate lexical declaration is found.\nfn global_declaration_instantiation(\n script: &Script,\n env: &Scope,\n interner: &Interner,\n) -> Result<(), &'static str> {\n // 1. Let lexNames be the LexicallyDeclaredNames of script.\n let lex_names = lexically_declared_names(script);\n\n // 2. Let varNames be the VarDeclaredNames of script.\n let var_names = var_declared_names(script);\n\n // 3. For each element name of lexNames, do\n for name in lex_names {\n let name = name.to_js_string(interner);\n\n // Note: Our implementation differs from the spec here.\n // a. If env.HasVarDeclaration(name) is true, throw a SyntaxError exception.\n // b. If env.HasLexicalDeclaration(name) is true, throw a SyntaxError exception.\n if env.has_binding(&name) {\n return Err(\"duplicate lexical declaration\");\n }\n }\n\n // 4. For each element name of varNames, do\n for name in var_names {\n let name = name.to_js_string(interner);\n\n // a. If env.HasLexicalDeclaration(name) is true, throw a SyntaxError exception.\n if env.has_lex_binding(&name) {\n return Err(\"duplicate lexical declaration\");\n }\n }\n\n // 13. Let lexDeclarations be the LexicallyScopedDeclarations of script.\n // 14. Let privateEnv be null.\n // 15. For each element d of lexDeclarations, do\n for statement in &**script.statements() {\n // a. NOTE: Lexically declared names are only instantiated here but not initialized.\n // b. For each element dn of the BoundNames of d, do\n // i. If IsConstantDeclaration of d is true, then\n // 1. Perform ? env.CreateImmutableBinding(dn, true).\n // ii. Else,\n // 1. Perform ? env.CreateMutableBinding(dn, false).\n if let StatementListItem::Declaration(declaration) = statement {\n match declaration.as_ref() {\n Declaration::ClassDeclaration(class) => {\n for name in bound_names(class.as_ref()) {\n let name = name.to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n }\n Declaration::Lexical(LexicalDeclaration::Let(declaration)) => {\n for name in bound_names(declaration) {\n let name = name.to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n }\n Declaration::Lexical(LexicalDeclaration::Const(declaration)) => {\n for name in bound_names(declaration) {\n let name = name.to_js_string(interner);\n env.create_immutable_binding(name, true);\n }\n }\n _ => {}\n }\n }\n }\n\n Ok(())\n}\n\n/// `BlockDeclarationInstantiation ( code, env )`\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-blockdeclarationinstantiation\nfn block_declaration_instantiation<'a, N>(\n block: &'a N,\n scope: Scope,\n interner: &Interner,\n) -> Option\nwhere\n &'a N: Into>,\n{\n let scope = Scope::new(scope, false);\n\n // 1. Let declarations be the LexicallyScopedDeclarations of code.\n let declarations = lexically_scoped_declarations(block);\n\n // 2. Let privateEnv be the running execution context's PrivateEnvironment.\n // Note: Private environments are currently handled differently.\n\n // 3. For each element d of declarations, do\n for d in &declarations {\n // i. If IsConstantDeclaration of d is true, then\n if let LexicallyScopedDeclaration::LexicalDeclaration(LexicalDeclaration::Const(d)) = d {\n // a. For each element dn of the BoundNames of d, do\n for dn in bound_names::<'_, VariableList>(d) {\n // 1. Perform ! env.CreateImmutableBinding(dn, true).\n let dn = dn.to_js_string(interner);\n scope.create_immutable_binding(dn, true);\n }\n }\n // ii. Else,\n else {\n // a. For each element dn of the BoundNames of d, do\n for dn in d.bound_names() {\n let dn = dn.to_js_string(interner);\n\n #[cfg(not(feature = \"annex-b\"))]\n // 1. Perform ! env.CreateMutableBinding(dn, false). NOTE: This step is replaced in section B.3.2.6.\n drop(scope.create_mutable_binding(dn, false));\n\n #[cfg(feature = \"annex-b\")]\n // 1. If ! env.HasBinding(dn) is false, then\n if !scope.has_binding(&dn) {\n // a. Perform ! env.CreateMutableBinding(dn, false).\n drop(scope.create_mutable_binding(dn, false));\n }\n }\n }\n }\n\n if scope.num_bindings() > 0 {\n Some(scope)\n } else {\n None\n }\n}\n\n/// `FunctionDeclarationInstantiation ( func, argumentsList )`\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-functiondeclarationinstantiation\nfn function_declaration_instantiation(\n body: &FunctionBody,\n formals: &FormalParameterList,\n arrow: bool,\n strict: bool,\n function_scope: Scope,\n interner: &Interner,\n) -> FunctionScopes {\n let mut scopes = FunctionScopes {\n function_scope,\n parameters_eval_scope: None,\n parameters_scope: None,\n lexical_scope: None,\n mapped_arguments_object: false,\n requires_function_scope: false,\n };\n\n // 1. Let calleeContext be the running execution context.\n // 2. Let code be func.[[ECMAScriptCode]].\n // 3. Let strict be func.[[Strict]].\n // 4. Let formals be func.[[FormalParameters]].\n\n // 5. Let parameterNames be the BoundNames of formals.\n let mut parameter_names = bound_names(formals);\n\n // 6. If parameterNames has any duplicate entries, let hasDuplicates be true. Otherwise, let hasDuplicates be false.\n // 7. Let simpleParameterList be IsSimpleParameterList of formals.\n\n // 8. Let hasParameterExpressions be ContainsExpression of formals.\n let has_parameter_expressions = formals.has_expressions();\n\n // 9. Let varNames be the VarDeclaredNames of code.\n let var_names = var_declared_names(body);\n\n // 10. Let varDeclarations be the VarScopedDeclarations of code.\n let var_declarations = var_scoped_declarations(body);\n\n // 11. Let lexicalNames be the LexicallyDeclaredNames of code.\n let lexical_names = lexically_declared_names(body);\n\n // 12. Let functionNames be a new empty List.\n let mut function_names = Vec::new();\n\n // 13. Let functionsToInitialize be a new empty List.\n // let mut functions_to_initialize = Vec::new();\n\n // 14. For each element d of varDeclarations, in reverse List order, do\n for declaration in var_declarations.iter().rev() {\n // a. If d is neither a VariableDeclaration nor a ForBinding nor a BindingIdentifier, then\n // a.i. Assert: d is either a FunctionDeclaration, a GeneratorDeclaration, an AsyncFunctionDeclaration, or an AsyncGeneratorDeclaration.\n // a.ii. Let fn be the sole element of the BoundNames of d.\n let name = match declaration {\n VarScopedDeclaration::FunctionDeclaration(f) => f.name(),\n VarScopedDeclaration::GeneratorDeclaration(f) => f.name(),\n VarScopedDeclaration::AsyncFunctionDeclaration(f) => f.name(),\n VarScopedDeclaration::AsyncGeneratorDeclaration(f) => f.name(),\n VarScopedDeclaration::VariableDeclaration(_) => continue,\n };\n\n // a.iii. If functionNames does not contain fn, then\n if !function_names.contains(&name.sym()) {\n // 1. Insert fn as the first element of functionNames.\n function_names.push(name.sym());\n }\n }\n\n function_names.reverse();\n\n // 15. Let argumentsObjectNeeded be true.\n let mut arguments_object_needed = true;\n\n let arguments = Sym::ARGUMENTS;\n\n // 16. If func.[[ThisMode]] is lexical, then\n // 17. Else if parameterNames contains \"arguments\", then\n if arrow || parameter_names.contains(&arguments) {\n // 16.a. NOTE: Arrow functions never have an arguments object.\n // 16.b. Set argumentsObjectNeeded to false.\n // 17.a. Set argumentsObjectNeeded to false.\n arguments_object_needed = false;\n }\n // 18. Else if hasParameterExpressions is false, then\n else if !has_parameter_expressions {\n //a. If functionNames contains \"arguments\" or lexicalNames contains \"arguments\", then\n if function_names.contains(&arguments) || lexical_names.contains(&arguments) {\n // i. Set argumentsObjectNeeded to false.\n arguments_object_needed = false;\n }\n }\n\n // 19. If strict is true or hasParameterExpressions is false, then\n let env = if strict || !has_parameter_expressions {\n // a. NOTE: Only a single Environment Record is needed for the parameters,\n // since calls to eval in strict mode code cannot create new bindings which are visible outside of the eval.\n // b. Let env be the LexicalEnvironment of calleeContext.\n scopes.function_scope.clone()\n }\n // 20. Else,\n else {\n // a. NOTE: A separate Environment Record is needed to ensure that bindings created by\n // direct eval calls in the formal parameter list are outside the environment where parameters are declared.\n // b. Let calleeEnv be the LexicalEnvironment of calleeContext.\n // c. Let env be NewDeclarativeEnvironment(calleeEnv).\n // d. Assert: The VariableEnvironment of calleeContext is calleeEnv.\n // e. Set the LexicalEnvironment of calleeContext to env.\n let scope = Scope::new(scopes.function_scope.clone(), false);\n scopes.parameters_eval_scope = Some(scope.clone());\n scope\n };\n\n // 22. If argumentsObjectNeeded is true, then\n //\n // NOTE(HalidOdat): Has been moved up, so \"arguments\" gets registered as\n // the first binding in the environment with index 0.\n if arguments_object_needed {\n let arguments = arguments.to_js_string(interner);\n\n // c. If strict is true, then\n if strict {\n // i. Perform ! env.CreateImmutableBinding(\"arguments\", false).\n // ii. NOTE: In strict mode code early errors prevent attempting to assign\n // to this binding, so its mutability is not observable.\n env.create_immutable_binding(arguments.clone(), false);\n }\n // d. Else,\n else {\n // i. Perform ! env.CreateMutableBinding(\"arguments\", false).\n drop(env.create_mutable_binding(arguments.clone(), false));\n }\n }\n\n // 21. For each String paramName of parameterNames, do\n for param_name in ¶meter_names {\n let param_name = param_name.to_js_string(interner);\n\n // a. Let alreadyDeclared be ! env.HasBinding(paramName).\n let already_declared = env.has_binding(¶m_name);\n\n // b. NOTE: Early errors ensure that duplicate parameter names can only occur in non-strict\n // functions that do not have parameter default values or rest parameters.\n\n // c. If alreadyDeclared is false, then\n if !already_declared {\n // i. Perform ! env.CreateMutableBinding(paramName, false).\n drop(env.create_mutable_binding(param_name.clone(), false));\n\n // Note: In this case the function contains a mapped arguments object.\n // Because we do not track (yet) if the mapped arguments object escapes the function,\n // we have to assume that the binding might escape trough the arguments object.\n if arguments_object_needed && !strict && formals.is_simple() {\n scopes.mapped_arguments_object = true;\n }\n\n // Note: These steps are not necessary in our implementation.\n // ii. If hasDuplicates is true, then\n // 1. Perform ! env.InitializeBinding(paramName, undefined).\n }\n }\n\n // 22. If argumentsObjectNeeded is true, then\n if arguments_object_needed {\n // MOVED: a-e.\n //\n // NOTE(HalidOdat): Has been moved up, see comment above.\n\n // f. Let parameterBindings be the list-concatenation of parameterNames and « \"arguments\" ».\n parameter_names.push(arguments);\n }\n\n // 23. Else,\n // a. Let parameterBindings be parameterNames.\n let parameter_bindings = parameter_names.clone();\n\n // 27. If hasParameterExpressions is false, then\n // 28. Else,\n #[allow(unused_variables, unused_mut)]\n let (mut instantiated_var_names, mut var_env) = if has_parameter_expressions {\n // a. NOTE: A separate Environment Record is needed to ensure that closures created by\n // expressions in the formal parameter list do not have\n // visibility of declarations in the function body.\n // b. Let varEnv be NewDeclarativeEnvironment(env).\n let var_env = Scope::new(env.clone(), false);\n scopes.parameters_scope = Some(var_env.clone());\n\n // c. Set the VariableEnvironment of calleeContext to varEnv.\n\n // d. Let instantiatedVarNames be a new empty List.\n let mut instantiated_var_names = Vec::new();\n\n // e. For each element n of varNames, do\n for n in var_names {\n // i. If instantiatedVarNames does not contain n, then\n if !instantiated_var_names.contains(&n) {\n // 1. Append n to instantiatedVarNames.\n instantiated_var_names.push(n);\n\n let n_string = n.to_js_string(interner);\n\n // 2. Perform ! varEnv.CreateMutableBinding(n, false).\n drop(var_env.create_mutable_binding(n_string, false));\n }\n }\n\n (instantiated_var_names, var_env)\n } else {\n // a. NOTE: Only a single Environment Record is needed for the parameters and top-level vars.\n // b. Let instantiatedVarNames be a copy of the List parameterBindings.\n let mut instantiated_var_names = parameter_bindings;\n\n // c. For each element n of varNames, do\n for n in var_names {\n // i. If instantiatedVarNames does not contain n, then\n if !instantiated_var_names.contains(&n) {\n // 1. Append n to instantiatedVarNames.\n instantiated_var_names.push(n);\n\n let n = n.to_js_string(interner);\n\n // 2. Perform ! env.CreateMutableBinding(n, false).\n // 3. Perform ! env.InitializeBinding(n, undefined).\n drop(env.create_mutable_binding(n, true));\n }\n }\n\n // d. Let varEnv be env.\n (instantiated_var_names, env)\n };\n\n // 29. NOTE: Annex B.3.2.1 adds additional steps at this point.\n // 29. If strict is false, then\n #[cfg(feature = \"annex-b\")]\n if !strict {\n // a. For each FunctionDeclaration f that is directly contained in the StatementList\n // of a Block, CaseClause, or DefaultClause, do\n for f in annex_b_function_declarations_names(body) {\n // i. Let F be StringValue of the BindingIdentifier of f.\n // ii. If replacing the FunctionDeclaration f with a VariableStatement that has F\n // as a BindingIdentifier would not produce any Early Errors\n // for func and parameterNames does not contain F, then\n if !lexical_names.contains(&f) && !parameter_names.contains(&f) {\n // 1. NOTE: A var binding for F is only instantiated here if it is neither a\n // VarDeclaredName, the name of a formal parameter, or another FunctionDeclaration.\n\n // 2. If initializedBindings does not contain F and F is not \"arguments\", then\n if !instantiated_var_names.contains(&f) && f != arguments {\n let f_string = f.to_js_string(interner);\n\n // a. Perform ! varEnv.CreateMutableBinding(F, false).\n // b. Perform ! varEnv.InitializeBinding(F, undefined).\n drop(var_env.create_mutable_binding(f_string, false));\n\n // c. Append F to instantiatedVarNames.\n instantiated_var_names.push(f);\n }\n }\n }\n }\n\n // 30. If strict is false, then\n // 31. Else,\n let lex_env = if strict {\n // a. Let lexEnv be varEnv.\n var_env\n } else {\n // a. Let lexEnv be NewDeclarativeEnvironment(varEnv).\n // b. NOTE: Non-strict functions use a separate Environment Record for top-level lexical\n // declarations so that a direct eval can determine whether any var scoped declarations\n // introduced by the eval code conflict with pre-existing top-level lexically scoped declarations.\n // This is not needed for strict functions because a strict direct eval always\n // places all declarations into a new Environment Record.\n let lex_env = Scope::new(var_env, false);\n scopes.lexical_scope = Some(lex_env.clone());\n lex_env\n };\n\n // 32. Set the LexicalEnvironment of calleeContext to lexEnv.\n // 33. Let lexDeclarations be the LexicallyScopedDeclarations of code.\n // 34. For each element d of lexDeclarations, do\n // a. NOTE: A lexically declared name cannot be the same as a function/generator declaration,\n // formal parameter, or a var name. Lexically declared names are only instantiated here but not initialized.\n // b. For each element dn of the BoundNames of d, do\n // i. If IsConstantDeclaration of d is true, then\n // 1. Perform ! lexEnv.CreateImmutableBinding(dn, true).\n // ii. Else,\n // 1. Perform ! lexEnv.CreateMutableBinding(dn, false).\n for statement in body.statements() {\n if let StatementListItem::Declaration(declaration) = statement {\n match declaration.as_ref() {\n Declaration::ClassDeclaration(class) => {\n for name in bound_names(class.as_ref()) {\n let name = name.to_js_string(interner);\n drop(lex_env.create_mutable_binding(name, false));\n }\n }\n Declaration::Lexical(LexicalDeclaration::Let(declaration)) => {\n for name in bound_names(declaration) {\n let name = name.to_js_string(interner);\n drop(lex_env.create_mutable_binding(name, false));\n }\n }\n Declaration::Lexical(LexicalDeclaration::Const(declaration)) => {\n for name in bound_names(declaration) {\n let name = name.to_js_string(interner);\n lex_env.create_immutable_binding(name, true);\n }\n }\n _ => {}\n }\n }\n }\n\n // 35. Let privateEnv be the PrivateEnvironment of calleeContext.\n // 36. For each Parse Node f of functionsToInitialize, do\n\n if let Some(lexical_scope) = &scopes.lexical_scope\n && lexical_scope.num_bindings() == 0\n {\n scopes.lexical_scope = None;\n }\n\n // 37. Return unused.\n scopes\n}\n\n/// Abstract operation [`InitializeEnvironment ( )`][spec].\n///\n/// [spec]: https://tc39.es/ecma262/#sec-source-text-module-record-initialize-environment\nfn module_instantiation(module: &Module, env: &Scope, interner: &Interner) {\n for entry in module.items().import_entries() {\n let local_name = entry.local_name().to_js_string(interner);\n env.create_immutable_binding(local_name, true);\n }\n let var_declarations = var_scoped_declarations(module);\n let mut declared_var_names = Vec::new();\n for var in var_declarations {\n for name in var.bound_names() {\n let name = name.to_js_string(interner);\n if !declared_var_names.contains(&name) {\n drop(env.create_mutable_binding(name.clone(), false));\n declared_var_names.push(name);\n }\n }\n }\n\n let lex_declarations = lexically_scoped_declarations(module);\n for declaration in lex_declarations {\n match declaration {\n LexicallyScopedDeclaration::FunctionDeclaration(f) => {\n let name = bound_names(f)[0].to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n LexicallyScopedDeclaration::GeneratorDeclaration(g) => {\n let name = bound_names(g)[0].to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n LexicallyScopedDeclaration::AsyncFunctionDeclaration(af) => {\n let name = bound_names(af)[0].to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n LexicallyScopedDeclaration::AsyncGeneratorDeclaration(ag) => {\n let name = bound_names(ag)[0].to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n LexicallyScopedDeclaration::ClassDeclaration(class) => {\n for name in bound_names(class) {\n let name = name.to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n }\n LexicallyScopedDeclaration::LexicalDeclaration(LexicalDeclaration::Const(c)) => {\n for name in bound_names(c) {\n let name = name.to_js_string(interner);\n env.create_immutable_binding(name, true);\n }\n }\n LexicallyScopedDeclaration::LexicalDeclaration(LexicalDeclaration::Let(l)) => {\n for name in bound_names(l) {\n let name = name.to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n }\n LexicallyScopedDeclaration::LexicalDeclaration(LexicalDeclaration::Using(u)) => {\n for name in bound_names(u) {\n let name = name.to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n }\n LexicallyScopedDeclaration::LexicalDeclaration(LexicalDeclaration::AwaitUsing(au)) => {\n for name in bound_names(au) {\n let name = name.to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n }\n LexicallyScopedDeclaration::AssignmentExpression(expr) => {\n for name in bound_names(expr) {\n let name = name.to_js_string(interner);\n drop(env.create_mutable_binding(name, false));\n }\n }\n }\n }\n}\n\n/// This struct isused to store bindings created during the declaration of an eval ast node.\n#[derive(Debug, Default)]\npub struct EvalDeclarationBindings {\n /// New annexb function names created during the declaration of an eval ast node.\n pub new_annex_b_function_names: Vec,\n\n /// New function names created during the declaration of an eval ast node.\n pub new_function_names: FxHashMap,\n\n /// New variable names created during the declaration of an eval ast node.\n pub new_var_names: Vec,\n}\n\n/// `EvalDeclarationInstantiation ( body, varEnv, lexEnv, privateEnv, strict )`\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-evaldeclarationinstantiation\n///\n/// # Errors\n///\n/// * Returns a syntax error if a duplicate lexical declaration is found.\n/// * Returns a syntax error if a variable declaration in an eval function already exists as a lexical variable.\n#[allow(clippy::missing_panics_doc)]\npub(crate) fn eval_declaration_instantiation_scope(\n body: &Script,\n strict: bool,\n var_env: &Scope,\n lex_env: &Scope,\n #[allow(unused_variables)] annex_b_function_names: &[Sym],\n interner: &Interner,\n) -> Result {\n let mut result = EvalDeclarationBindings::default();\n\n // 2. Let varDeclarations be the VarScopedDeclarations of body.\n let var_declarations = var_scoped_declarations(body);\n\n // 3. If strict is false, then\n if !strict {\n // 1. Let varNames be the VarDeclaredNames of body.\n let var_names = var_declared_names(body);\n\n // a. If varEnv is a Global Environment Record, then\n if var_env.is_global() {\n // i. For each element name of varNames, do\n for name in &var_names {\n let name = name.to_js_string(interner);\n\n // 1. If varEnv.HasLexicalDeclaration(name) is true, throw a SyntaxError exception.\n // 2. NOTE: eval will not create a global var declaration that would be shadowed by a global lexical declaration.\n if var_env.has_lex_binding(&name) {\n return Err(format!(\n \"duplicate lexical declaration {}\",\n name.to_std_string_escaped()\n ));\n }\n }\n }\n\n // b. Let thisEnv be lexEnv.\n let mut this_env = lex_env;\n\n // c. Assert: The following loop will terminate.\n // d. Repeat, while thisEnv is not varEnv,\n while this_env.scope_index() != var_env.scope_index() {\n // i. If thisEnv is not an Object Environment Record, then\n // 1. NOTE: The environment of with statements cannot contain any lexical\n // declaration so it doesn't need to be checked for var/let hoisting conflicts.\n // 2. For each element name of varNames, do\n for name in &var_names {\n let name = interner.resolve_expect(*name).utf16().into();\n\n // a. If ! thisEnv.HasBinding(name) is true, then\n if this_env.has_binding(&name) {\n // i. Throw a SyntaxError exception.\n // ii. NOTE: Annex B.3.4 defines alternate semantics for the above step.\n return Err(format!(\n \"variable declaration {} in eval function already exists as a lexical variable\",\n name.to_std_string_escaped()\n ));\n }\n // b. NOTE: A direct eval will not hoist var declaration over a like-named lexical declaration.\n }\n\n // ii. Set thisEnv to thisEnv.[[OuterEnv]].\n if let Some(outer) = this_env.outer() {\n this_env = outer;\n } else {\n break;\n }\n }\n }\n\n // NOTE: These steps depend on the current environment state are done before bytecode compilation,\n // in `eval_declaration_instantiation_context`.\n //\n // SKIP: 4. Let privateIdentifiers be a new empty List.\n // SKIP: 5. Let pointer be privateEnv.\n // SKIP: 6. Repeat, while pointer is not null,\n // a. For each Private Name binding of pointer.[[Names]], do\n // i. If privateIdentifiers does not contain binding.[[Description]],\n // append binding.[[Description]] to privateIdentifiers.\n // b. Set pointer to pointer.[[OuterPrivateEnvironment]].\n // SKIP: 7. If AllPrivateIdentifiersValid of body with argument privateIdentifiers is false, throw a SyntaxError exception.\n\n // 8. Let functionsToInitialize be a new empty List.\n let mut functions_to_initialize = Vec::new();\n\n // 9. Let declaredFunctionNames be a new empty List.\n let mut declared_function_names = Vec::new();\n\n // 10. For each element d of varDeclarations, in reverse List order, do\n for declaration in var_declarations.iter().rev() {\n // a. If d is not either a VariableDeclaration, a ForBinding, or a BindingIdentifier, then\n // a.i. Assert: d is either a FunctionDeclaration, a GeneratorDeclaration, an AsyncFunctionDeclaration, or an AsyncGeneratorDeclaration.\n // a.ii. NOTE: If there are multiple function declarations for the same name, the last declaration is used.\n // a.iii. Let fn be the sole element of the BoundNames of d.\n let name = match &declaration {\n VarScopedDeclaration::FunctionDeclaration(f) => f.name(),\n VarScopedDeclaration::GeneratorDeclaration(f) => f.name(),\n VarScopedDeclaration::AsyncFunctionDeclaration(f) => f.name(),\n VarScopedDeclaration::AsyncGeneratorDeclaration(f) => f.name(),\n VarScopedDeclaration::VariableDeclaration(_) => continue,\n };\n // a.iv. If declaredFunctionNames does not contain fn, then\n if !declared_function_names.contains(&name.sym()) {\n // 1. If varEnv is a Global Environment Record, then\n // 2. Append fn to declaredFunctionNames.\n declared_function_names.push(name.sym());\n\n // 3. Insert d as the first element of functionsToInitialize.\n functions_to_initialize.push(declaration.clone());\n }\n }\n\n functions_to_initialize.reverse();\n\n // 11. NOTE: Annex B.3.2.3 adds additional steps at this point.\n // 11. If strict is false, then\n #[cfg(feature = \"annex-b\")]\n if !strict {\n // NOTE: This diviates from the specification, we split the first part of defining the annex-b names\n // in `eval_declaration_instantiation_context`, because it depends on the context.\n if !var_env.is_global() {\n for name in annex_b_function_names {\n let f = name.to_js_string(interner);\n // i. Let bindingExists be ! varEnv.HasBinding(F).\n // ii. If bindingExists is false, then\n if !var_env.has_binding(&f) {\n // i. Perform ! varEnv.CreateMutableBinding(F, true).\n // ii. Perform ! varEnv.InitializeBinding(F, undefined).\n let binding = var_env.create_mutable_binding(f, true);\n result\n .new_annex_b_function_names\n .push(IdentifierReference::new(\n binding,\n !var_env.is_function(),\n true,\n ));\n }\n }\n }\n }\n\n // 12. Let declaredVarNames be a new empty List.\n let mut declared_var_names = Vec::new();\n\n // 13. For each element d of varDeclarations, do\n for declaration in var_declarations {\n // a. If d is either a VariableDeclaration, a ForBinding, or a BindingIdentifier, then\n let VarScopedDeclaration::VariableDeclaration(declaration) = declaration else {\n continue;\n };\n\n // a.i. For each String vn of the BoundNames of d, do\n for name in bound_names(&declaration) {\n // 1. If declaredFunctionNames does not contain vn, then\n if !declared_function_names.contains(&name) {\n // a. If varEnv is a Global Environment Record, then\n // b. If declaredVarNames does not contain vn, then\n if !declared_var_names.contains(&name) {\n // i. Append vn to declaredVarNames.\n declared_var_names.push(name);\n }\n }\n }\n }\n\n // 14. NOTE: No abnormal terminations occur after this algorithm step unless varEnv is a\n // Global Environment Record and the global object is a Proxy exotic object.\n\n // 15. Let lexDeclarations be the LexicallyScopedDeclarations of body.\n // 16. For each element d of lexDeclarations, do\n for statement in &**body.statements() {\n // a. NOTE: Lexically declared names are only instantiated here but not initialized.\n // b. For each element dn of the BoundNames of d, do\n // i. If IsConstantDeclaration of d is true, then\n // 1. Perform ? lexEnv.CreateImmutableBinding(dn, true).\n // ii. Else,\n // 1. Perform ? lexEnv.CreateMutableBinding(dn, false).\n if let StatementListItem::Declaration(declaration) = statement {\n match declaration.as_ref() {\n Declaration::ClassDeclaration(class) => {\n for name in bound_names(class.as_ref()) {\n let name = name.to_js_string(interner);\n drop(lex_env.create_mutable_binding(name, false));\n }\n }\n Declaration::Lexical(LexicalDeclaration::Let(declaration)) => {\n for name in bound_names(declaration) {\n let name = name.to_js_string(interner);\n drop(lex_env.create_mutable_binding(name, false));\n }\n }\n Declaration::Lexical(LexicalDeclaration::Const(declaration)) => {\n for name in bound_names(declaration) {\n let name = name.to_js_string(interner);\n lex_env.create_immutable_binding(name, true);\n }\n }\n _ => {}\n }\n }\n }\n\n // 17. For each Parse Node f of functionsToInitialize, do\n for function in functions_to_initialize {\n // a. Let fn be the sole element of the BoundNames of f.\n let name = match &function {\n VarScopedDeclaration::FunctionDeclaration(f) => f.name(),\n VarScopedDeclaration::GeneratorDeclaration(f) => f.name(),\n VarScopedDeclaration::AsyncFunctionDeclaration(f) => f.name(),\n VarScopedDeclaration::AsyncGeneratorDeclaration(f) => f.name(),\n VarScopedDeclaration::VariableDeclaration(_) => {\n continue;\n }\n };\n\n // c. If varEnv is a Global Environment Record, then\n // d. Else,\n if !var_env.is_global() {\n // b. Let fo be InstantiateFunctionObject of f with arguments lexEnv and privateEnv.\n let n = name.to_js_string(interner);\n\n // i. Let bindingExists be ! varEnv.HasBinding(fn).\n let binding_exists = var_env.has_binding(&n);\n\n // ii. If bindingExists is false, then\n // iii. Else,\n if binding_exists {\n // 1. Perform ! varEnv.SetMutableBinding(fn, fo, false).\n let binding = var_env.set_mutable_binding(n).expect(\"must not fail\");\n result.new_function_names.insert(\n name,\n (\n IdentifierReference::new(binding.locator(), !var_env.is_function(), true),\n true,\n ),\n );\n } else {\n // 1. NOTE: The following invocation cannot return an abrupt completion because of the validation preceding step 14.\n // 2. Perform ! varEnv.CreateMutableBinding(fn, true).\n // 3. Perform ! varEnv.InitializeBinding(fn, fo).\n let binding = var_env.create_mutable_binding(n, !strict);\n result.new_function_names.insert(\n name,\n (\n IdentifierReference::new(binding, !var_env.is_function(), true),\n false,\n ),\n );\n }\n }\n }\n\n // 18. For each String vn of declaredVarNames, do\n for name in declared_var_names {\n // a. If varEnv is a Global Environment Record, then\n // b. Else,\n if !var_env.is_global() {\n let name = name.to_js_string(interner);\n\n // i. Let bindingExists be ! varEnv.HasBinding(vn).\n let binding_exists = var_env.has_binding(&name);\n\n // ii. If bindingExists is false, then\n if !binding_exists {\n // 1. NOTE: The following invocation cannot return an abrupt completion because of the validation preceding step 14.\n // 2. Perform ! varEnv.CreateMutableBinding(vn, true).\n // 3. Perform ! varEnv.InitializeBinding(vn, undefined).\n let binding = var_env.create_mutable_binding(name, true);\n result.new_var_names.push(IdentifierReference::new(\n binding,\n !var_env.is_function(),\n true,\n ));\n }\n }\n }\n\n // 19. Return unused.\n Ok(result)\n}\n" }, { "path": "core/ast/src/source.rs", "content": "use std::ops::ControlFlow;\n\nuse boa_interner::{Interner, Sym, ToIndentedString};\n\nuse crate::{\n ModuleItemList, StatementList,\n scope::Scope,\n scope_analyzer::{\n EvalDeclarationBindings, analyze_binding_escapes, collect_bindings,\n eval_declaration_instantiation_scope, optimize_scope_indices,\n },\n visitor::{VisitWith, Visitor, VisitorMut},\n};\n\n/// A Script source.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-scripts\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, Default)]\npub struct Script {\n statements: StatementList,\n}\n\nimpl Script {\n /// Creates a new `ScriptNode`.\n #[must_use]\n pub const fn new(statements: StatementList) -> Self {\n Self { statements }\n }\n\n /// Gets the list of statements of this `ScriptNode`.\n #[must_use]\n pub const fn statements(&self) -> &StatementList {\n &self.statements\n }\n\n /// Gets a mutable reference to the list of statements of this `ScriptNode`.\n pub fn statements_mut(&mut self) -> &mut StatementList {\n &mut self.statements\n }\n\n /// Gets the strict mode.\n #[inline]\n #[must_use]\n pub const fn strict(&self) -> bool {\n self.statements.strict()\n }\n\n /// Analyze the scope of the script.\n ///\n /// # Errors\n /// Any scope or binding errors that happened during the analysis.\n pub fn analyze_scope(\n &mut self,\n scope: &Scope,\n interner: &Interner,\n ) -> Result<(), &'static str> {\n collect_bindings(self, self.strict(), false, scope, interner)?;\n analyze_binding_escapes(self, false, scope.clone(), interner)?;\n optimize_scope_indices(self, scope);\n Ok(())\n }\n\n /// Analyze the scope of the script in eval mode.\n ///\n /// # Errors\n ///\n /// Returns an error if the scope analysis fails with a syntax error.\n pub fn analyze_scope_eval(\n &mut self,\n strict: bool,\n variable_scope: &Scope,\n lexical_scope: &Scope,\n annex_b_function_names: &[Sym],\n interner: &Interner,\n ) -> Result {\n let bindings = eval_declaration_instantiation_scope(\n self,\n strict,\n variable_scope,\n lexical_scope,\n annex_b_function_names,\n interner,\n )?;\n\n if let Err(reason) = collect_bindings(self, strict, true, lexical_scope, interner) {\n return Err(format!(\"Failed to analyze scope: {reason}\"));\n }\n if let Err(reason) = analyze_binding_escapes(self, true, lexical_scope.clone(), interner) {\n return Err(format!(\"Failed to analyze scope: {reason}\"));\n }\n\n variable_scope.escape_all_bindings();\n lexical_scope.escape_all_bindings();\n variable_scope.reorder_binding_indices();\n lexical_scope.reorder_binding_indices();\n optimize_scope_indices(self, lexical_scope);\n\n Ok(bindings)\n }\n}\n\nimpl VisitWith for Script {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n self.statements.visit_with(visitor)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n self.statements.visit_with_mut(visitor)\n }\n}\n\nimpl ToIndentedString for Script {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n self.statements.to_indented_string(interner, indentation)\n }\n}\n\nimpl PartialEq for Script {\n fn eq(&self, other: &Self) -> bool {\n self.statements == other.statements\n }\n}\n\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for Script {\n fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n let statements = StatementList::arbitrary(u)?;\n Ok(Self { statements })\n }\n}\n\n/// A Module source.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-modules\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, Default, PartialEq)]\npub struct Module {\n pub(crate) items: ModuleItemList,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Scope,\n}\n\nimpl Module {\n /// Creates a new `ModuleNode`.\n #[must_use]\n pub fn new(items: ModuleItemList) -> Self {\n Self {\n items,\n scope: Scope::default(),\n }\n }\n\n /// Gets the list of items of this `ModuleNode`.\n #[must_use]\n pub const fn items(&self) -> &ModuleItemList {\n &self.items\n }\n\n /// Gets the scope of this `ModuleNode`.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> &Scope {\n &self.scope\n }\n\n /// Analyze the scope of the module.\n ///\n /// # Errors\n /// Any scope or binding errors that happened during the analysis.\n pub fn analyze_scope(\n &mut self,\n scope: &Scope,\n interner: &Interner,\n ) -> Result<(), &'static str> {\n collect_bindings(self, true, false, scope, interner)?;\n analyze_binding_escapes(self, false, scope.clone(), interner)?;\n optimize_scope_indices(self, &self.scope.clone());\n\n Ok(())\n }\n}\n\nimpl VisitWith for Module {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n self.items.visit_with(visitor)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n self.items.visit_with_mut(visitor)\n }\n}\n" }, { "path": "core/ast/src/source_text.rs", "content": "use crate::{LinearPosition, LinearSpan};\n\n/// Source text.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug)]\npub struct SourceText {\n source_text: Vec,\n}\n\nimpl SourceText {\n /// Constructs a new, empty `SourceText` with at least the specified capacity.\n #[must_use]\n pub fn with_capacity(capacity: usize) -> Self {\n Self {\n source_text: Vec::with_capacity(capacity),\n }\n }\n\n /// Get current `LinearPosition`.\n #[must_use]\n pub fn cur_linear_position(&self) -> LinearPosition {\n LinearPosition::new(self.source_text.len())\n }\n\n /// Get code points from `pos` to the current end.\n #[must_use]\n pub fn get_code_points_from_pos(&self, pos: LinearPosition) -> &[u16] {\n &self.source_text[pos.pos()..]\n }\n\n /// Get code points within `span`.\n #[must_use]\n pub fn get_code_points_from_span(&self, span: LinearSpan) -> &[u16] {\n &self.source_text[span.start().pos()..span.end().pos()]\n }\n\n /// Remove last code point.\n #[inline]\n pub fn remove_last_code_point(&mut self) {\n self.source_text.pop();\n }\n\n /// Collect code point.\n ///\n /// # Panics\n ///\n /// On invalid code point.\n #[inline]\n pub fn collect_code_point(&mut self, cp: u32) {\n if let Ok(cu) = cp.try_into() {\n self.push(cu);\n return;\n }\n let cp = cp - 0x10000;\n let cu1 = (cp / 0x400 + 0xD800)\n .try_into()\n .expect(\"Invalid code point\");\n let cu2 = (cp % 0x400 + 0xDC00)\n .try_into()\n .expect(\"Invalid code point\");\n self.push(cu1);\n self.push(cu2);\n }\n\n #[inline]\n fn push(&mut self, cp: u16) {\n self.source_text.push(cp);\n }\n}\n\nconst DEFAULT_CAPACITY: usize = 4 * 1024;\n\nimpl Default for SourceText {\n fn default() -> Self {\n Self::with_capacity(DEFAULT_CAPACITY)\n }\n}\n" }, { "path": "core/ast/src/statement/block.rs", "content": "//! Block AST node.\n\nuse crate::{\n Statement, StatementList,\n operations::{ContainsSymbol, contains},\n scope::Scope,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString};\nuse core::ops::ControlFlow;\n\n/// A `block` statement (or compound statement in other languages) is used to group zero or\n/// more statements.\n///\n/// The block statement is often called compound statement in other languages.\n/// It allows you to use multiple statements where ECMAScript expects only one statement.\n/// Combining statements into blocks is a common practice in ECMAScript. The opposite behavior\n/// is possible using an empty statement, where you provide no statement, although one is\n/// required.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-BlockStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/block\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq, Default)]\npub struct Block {\n #[cfg_attr(feature = \"serde\", serde(flatten))]\n pub(crate) statements: StatementList,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Option,\n}\n\nimpl Block {\n /// Gets the list of statements and declarations in this block.\n #[inline]\n #[must_use]\n pub const fn statement_list(&self) -> &StatementList {\n &self.statements\n }\n\n /// Gets the scope of the block.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> Option<&Scope> {\n self.scope.as_ref()\n }\n}\n\nimpl From for Block\nwhere\n T: Into,\n{\n fn from(list: T) -> Self {\n let statements = list.into();\n let contains_direct_eval = contains(&statements, ContainsSymbol::DirectEval);\n Self {\n statements,\n scope: None,\n contains_direct_eval,\n }\n }\n}\n\nimpl ToIndentedString for Block {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"{{\\n{}{}}}\",\n self.statements\n .to_indented_string(interner, indentation + 1),\n \" \".repeat(indentation)\n )\n }\n}\n\nimpl From for Statement {\n #[inline]\n fn from(block: Block) -> Self {\n Self::Block(block)\n }\n}\n\nimpl VisitWith for Block {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_statement_list(&self.statements)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_statement_list_mut(&mut self.statements)\n }\n}\n" }, { "path": "core/ast/src/statement/if.rs", "content": "//! If statement\n\nuse crate::{\n expression::Expression,\n statement::Statement,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// The `if` statement executes a statement if a specified condition is [`truthy`][truthy]. If\n/// the condition is [`falsy`][falsy], another statement can be executed.\n///\n/// Multiple `if...else` statements can be nested to create an else if clause.\n///\n/// Note that there is no elseif (in one word) keyword in JavaScript.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-IfStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/if...else\n/// [truthy]: https://developer.mozilla.org/en-US/docs/Glossary/truthy\n/// [falsy]: https://developer.mozilla.org/en-US/docs/Glossary/falsy\n/// [expression]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Expressions_and_Operators#Expressions\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct If {\n condition: Expression,\n body: Box,\n else_node: Option>,\n}\n\nimpl If {\n /// Gets the condition of the if statement.\n #[inline]\n #[must_use]\n pub const fn cond(&self) -> &Expression {\n &self.condition\n }\n\n /// Gets the body to execute if the condition is true.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &Statement {\n &self.body\n }\n\n /// Gets the `else` node, if it has one.\n #[inline]\n pub fn else_node(&self) -> Option<&Statement> {\n self.else_node.as_ref().map(Box::as_ref)\n }\n\n /// Creates an `If` AST node.\n #[inline]\n #[must_use]\n pub fn new(condition: Expression, body: Statement, else_node: Option) -> Self {\n Self {\n condition,\n body: body.into(),\n else_node: else_node.map(Box::new),\n }\n }\n}\n\nimpl ToIndentedString for If {\n fn to_indented_string(&self, interner: &Interner, indent: usize) -> String {\n let mut buf = format!(\"if ({}) \", self.cond().to_interned_string(interner));\n match self.else_node() {\n Some(else_e) => {\n let _ = write!(\n buf,\n \"{} else {}\",\n self.body().to_indented_string(interner, indent),\n else_e.to_indented_string(interner, indent)\n );\n }\n None => {\n buf.push_str(&self.body().to_indented_string(interner, indent));\n }\n }\n buf\n }\n}\n\nimpl From for Statement {\n fn from(if_stm: If) -> Self {\n Self::If(if_stm)\n }\n}\n\nimpl VisitWith for If {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.condition)?;\n visitor.visit_statement(&self.body)?;\n if let Some(stmt) = &self.else_node {\n visitor.visit_statement(stmt)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.condition)?;\n visitor.visit_statement_mut(&mut self.body)?;\n if let Some(stmt) = &mut self.else_node {\n visitor.visit_statement_mut(stmt)?;\n }\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/statement/iteration/break.rs", "content": "use boa_interner::{Interner, Sym, ToInternedString};\nuse core::ops::ControlFlow;\n\nuse crate::Statement;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\n\n/// The `break` statement terminates the current loop, switch, or label statement and transfers\n/// program control to the statement following the terminated statement.\n///\n/// The break statement includes an optional label that allows the program to break out of a\n/// labeled statement. The break statement needs to be nested within the referenced label. The\n/// labeled statement can be any block statement; it does not have to be preceded by a loop\n/// statement.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-BreakStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/break\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\npub struct Break {\n label: Option,\n}\n\nimpl Break {\n /// Creates a `Break` AST node.\n #[must_use]\n pub const fn new(label: Option) -> Self {\n Self { label }\n }\n\n /// Gets the label of the break statement, if any.\n #[must_use]\n pub const fn label(&self) -> Option {\n self.label\n }\n}\n\nimpl ToInternedString for Break {\n fn to_interned_string(&self, interner: &Interner) -> String {\n self.label.map_or_else(\n || \"break\".to_owned(),\n |label| format!(\"break {}\", interner.resolve_expect(label)),\n )\n }\n}\n\nimpl From for Statement {\n fn from(break_smt: Break) -> Self {\n Self::Break(break_smt)\n }\n}\n\nimpl VisitWith for Break {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(sym) = &self.label {\n visitor.visit_sym(sym)\n } else {\n ControlFlow::Continue(())\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(sym) = &mut self.label {\n visitor.visit_sym_mut(sym)\n } else {\n ControlFlow::Continue(())\n }\n }\n}\n" }, { "path": "core/ast/src/statement/iteration/continue.rs", "content": "use crate::statement::Statement;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse boa_interner::{Interner, Sym, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// The `continue` statement terminates execution of the statements in the current iteration of\n/// the current or labeled loop, and continues execution of the loop with the next iteration.\n///\n/// The continue statement can include an optional label that allows the program to jump to the\n/// next iteration of a labeled loop statement instead of the current loop. In this case, the\n/// continue statement needs to be nested within this labeled statement.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ContinueStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/continue\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub struct Continue {\n label: Option,\n}\n\nimpl Continue {\n /// Creates a `Continue` AST node.\n #[must_use]\n pub const fn new(label: Option) -> Self {\n Self { label }\n }\n\n /// Gets the label of this `Continue` statement.\n #[must_use]\n pub const fn label(&self) -> Option {\n self.label\n }\n}\n\nimpl ToInternedString for Continue {\n fn to_interned_string(&self, interner: &Interner) -> String {\n self.label.map_or_else(\n || \"continue\".to_owned(),\n |label| format!(\"continue {}\", interner.resolve_expect(label)),\n )\n }\n}\n\nimpl From for Statement {\n fn from(cont: Continue) -> Self {\n Self::Continue(cont)\n }\n}\n\nimpl VisitWith for Continue {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(sym) = &self.label {\n visitor.visit_sym(sym)\n } else {\n ControlFlow::Continue(())\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(sym) = &mut self.label {\n visitor.visit_sym_mut(sym)\n } else {\n ControlFlow::Continue(())\n }\n }\n}\n" }, { "path": "core/ast/src/statement/iteration/do_while_loop.rs", "content": "use crate::{\n expression::Expression,\n statement::Statement,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// The `do...while` statement creates a loop that executes a specified statement until the\n/// test condition evaluates to false.\n///\n/// The condition is evaluated after executing the statement, resulting in the specified\n/// statement executing at least once.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-do-while-statement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/do...while\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct DoWhileLoop {\n body: Box,\n condition: Expression,\n}\n\nimpl DoWhileLoop {\n /// Gets the body of the do-while loop.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &Statement {\n &self.body\n }\n\n /// Gets the condition of the do-while loop.\n #[inline]\n #[must_use]\n pub const fn cond(&self) -> &Expression {\n &self.condition\n }\n /// Creates a `DoWhileLoop` AST node.\n #[inline]\n #[must_use]\n pub fn new(body: Statement, condition: Expression) -> Self {\n Self {\n body: body.into(),\n condition,\n }\n }\n}\n\nimpl ToIndentedString for DoWhileLoop {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"do {} while ({})\",\n self.body().to_indented_string(interner, indentation),\n self.cond().to_interned_string(interner)\n )\n }\n}\n\nimpl From for Statement {\n fn from(do_while: DoWhileLoop) -> Self {\n Self::DoWhileLoop(do_while)\n }\n}\n\nimpl VisitWith for DoWhileLoop {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_statement(&self.body)?;\n visitor.visit_expression(&self.condition)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_statement_mut(&mut self.body)?;\n visitor.visit_expression_mut(&mut self.condition)\n }\n}\n" }, { "path": "core/ast/src/statement/iteration/for_in_loop.rs", "content": "use crate::operations::{ContainsSymbol, contains};\nuse crate::scope::Scope;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{\n expression::Expression,\n statement::{Statement, iteration::IterableLoopInitializer},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// A `for...in` loop statement, as defined by the [spec].\n///\n/// [`for...in`][forin] statements loop over all enumerable string properties of an object, including\n/// inherited properties.\n///\n/// [forin]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/for...in\n/// [spec]: https://tc39.es/ecma262/#prod-ForInOfStatement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ForInLoop {\n pub(crate) initializer: IterableLoopInitializer,\n pub(crate) target: Expression,\n pub(crate) body: Box,\n pub(crate) target_contains_direct_eval: bool,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) target_scope: Option,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Option,\n}\n\nimpl ForInLoop {\n /// Creates a new `ForInLoop`.\n #[inline]\n #[must_use]\n pub fn new(initializer: IterableLoopInitializer, target: Expression, body: Statement) -> Self {\n let target_contains_direct_eval = contains(&target, ContainsSymbol::DirectEval);\n let contains_direct_eval = contains(&initializer, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n initializer,\n target,\n body: body.into(),\n target_contains_direct_eval,\n contains_direct_eval,\n target_scope: None,\n scope: None,\n }\n }\n\n /// Gets the initializer of the for...in loop.\n #[inline]\n #[must_use]\n pub const fn initializer(&self) -> &IterableLoopInitializer {\n &self.initializer\n }\n\n /// Gets the target object of the for...in loop.\n #[inline]\n #[must_use]\n pub const fn target(&self) -> &Expression {\n &self.target\n }\n\n /// Gets the body of the for...in loop.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &Statement {\n &self.body\n }\n\n /// Returns the target scope of the for...in loop.\n #[inline]\n #[must_use]\n pub const fn target_scope(&self) -> Option<&Scope> {\n self.target_scope.as_ref()\n }\n\n /// Returns the scope of the for...in loop.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> Option<&Scope> {\n self.scope.as_ref()\n }\n}\n\nimpl ToIndentedString for ForInLoop {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = format!(\n \"for ({} in {}) \",\n self.initializer.to_interned_string(interner),\n self.target.to_interned_string(interner)\n );\n buf.push_str(&self.body().to_indented_string(interner, indentation));\n\n buf\n }\n}\n\nimpl From for Statement {\n #[inline]\n fn from(for_in: ForInLoop) -> Self {\n Self::ForInLoop(for_in)\n }\n}\n\nimpl VisitWith for ForInLoop {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_iterable_loop_initializer(&self.initializer)?;\n visitor.visit_expression(&self.target)?;\n visitor.visit_statement(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_iterable_loop_initializer_mut(&mut self.initializer)?;\n visitor.visit_expression_mut(&mut self.target)?;\n visitor.visit_statement_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/statement/iteration/for_loop.rs", "content": "use crate::operations::{ContainsSymbol, contains};\nuse crate::scope::Scope;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{\n Expression,\n declaration::{LexicalDeclaration, VarDeclaration},\n statement::Statement,\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// The `for` statement creates a loop that consists of three optional expressions.\n///\n/// A [`for`][mdn] loop repeats until a specified condition evaluates to `false`.\n/// The JavaScript for loop is similar to the Java and C for loop.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ForDeclaration\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/for\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ForLoop {\n #[cfg_attr(feature = \"serde\", serde(flatten))]\n pub(crate) inner: Box,\n}\n\nimpl ForLoop {\n /// Creates a new for loop AST node.\n #[inline]\n #[must_use]\n pub fn new(\n init: Option,\n condition: Option,\n final_expr: Option,\n body: Statement,\n ) -> Self {\n Self {\n inner: Box::new(InnerForLoop::new(init, condition, final_expr, body)),\n }\n }\n\n /// Gets the initialization node.\n #[inline]\n #[must_use]\n pub const fn init(&self) -> Option<&ForLoopInitializer> {\n self.inner.init()\n }\n\n /// Gets the loop condition node.\n #[inline]\n #[must_use]\n pub const fn condition(&self) -> Option<&Expression> {\n self.inner.condition()\n }\n\n /// Gets the final expression node.\n #[inline]\n #[must_use]\n pub const fn final_expr(&self) -> Option<&Expression> {\n self.inner.final_expr()\n }\n\n /// Gets the body of the for loop.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &Statement {\n self.inner.body()\n }\n}\n\nimpl ToIndentedString for ForLoop {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = String::from(\"for (\");\n if let Some(init) = self.init() {\n buf.push_str(&init.to_interned_string(interner));\n }\n buf.push_str(\"; \");\n if let Some(condition) = self.condition() {\n buf.push_str(&condition.to_interned_string(interner));\n }\n buf.push_str(\"; \");\n if let Some(final_expr) = self.final_expr() {\n buf.push_str(&final_expr.to_interned_string(interner));\n }\n let _ = write!(\n buf,\n \") {}\",\n self.inner.body().to_indented_string(interner, indentation)\n );\n\n buf\n }\n}\n\nimpl From for Statement {\n #[inline]\n fn from(for_loop: ForLoop) -> Self {\n Self::ForLoop(for_loop)\n }\n}\n\nimpl VisitWith for ForLoop {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(fli) = &self.inner.init {\n visitor.visit_for_loop_initializer(fli)?;\n }\n if let Some(expr) = &self.inner.condition {\n visitor.visit_expression(expr)?;\n }\n if let Some(expr) = &self.inner.final_expr {\n visitor.visit_expression(expr)?;\n }\n visitor.visit_statement(&self.inner.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(fli) = &mut self.inner.init {\n visitor.visit_for_loop_initializer_mut(fli)?;\n }\n if let Some(expr) = &mut self.inner.condition {\n visitor.visit_expression_mut(expr)?;\n }\n if let Some(expr) = &mut self.inner.final_expr {\n visitor.visit_expression_mut(expr)?;\n }\n visitor.visit_statement_mut(&mut self.inner.body)\n }\n}\n\n/// Inner structure to avoid multiple indirections in the heap.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub(crate) struct InnerForLoop {\n pub(crate) init: Option,\n pub(crate) condition: Option,\n pub(crate) final_expr: Option,\n pub(crate) body: Statement,\n pub(crate) contains_direct_eval: bool,\n}\n\nimpl InnerForLoop {\n /// Creates a new inner for loop.\n #[inline]\n fn new(\n init: Option,\n condition: Option,\n final_expr: Option,\n body: Statement,\n ) -> Self {\n let mut contains_direct_eval = contains(&body, ContainsSymbol::DirectEval);\n if let Some(init) = &init {\n contains_direct_eval |= contains(init, ContainsSymbol::DirectEval);\n }\n if let Some(condition) = &condition {\n contains_direct_eval |= contains(condition, ContainsSymbol::DirectEval);\n }\n if let Some(final_expr) = &final_expr {\n contains_direct_eval |= contains(final_expr, ContainsSymbol::DirectEval);\n }\n Self {\n init,\n condition,\n final_expr,\n body,\n contains_direct_eval,\n }\n }\n\n /// Gets the initialization node.\n #[inline]\n const fn init(&self) -> Option<&ForLoopInitializer> {\n self.init.as_ref()\n }\n\n /// Gets the loop condition node.\n #[inline]\n const fn condition(&self) -> Option<&Expression> {\n self.condition.as_ref()\n }\n\n /// Gets the final expression node.\n #[inline]\n const fn final_expr(&self) -> Option<&Expression> {\n self.final_expr.as_ref()\n }\n\n /// Gets the body of the for loop.\n #[inline]\n const fn body(&self) -> &Statement {\n &self.body\n }\n}\n\n/// A [`ForLoop`] initializer, as defined by the [spec].\n///\n/// A `ForLoop` initializer differs a lot from an\n/// [`IterableLoopInitializer`][super::IterableLoopInitializer], since it can contain any arbitrary\n/// expression instead of only accessors and patterns. Additionally, it can also contain many variable\n/// declarations instead of only one.\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ForStatement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum ForLoopInitializer {\n /// An expression initializer.\n Expression(Expression),\n /// A var declaration initializer.\n Var(VarDeclaration),\n /// A lexical declaration initializer.\n Lexical(ForLoopInitializerLexical),\n}\n\n/// A lexical declaration initializer for a `ForLoop`.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ForLoopInitializerLexical {\n pub(crate) declaration: LexicalDeclaration,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Scope,\n}\n\nimpl ForLoopInitializerLexical {\n /// Creates a new lexical declaration initializer.\n #[inline]\n #[must_use]\n pub fn new(declaration: LexicalDeclaration, scope: Scope) -> Self {\n Self { declaration, scope }\n }\n\n /// Returns the declaration of the lexical initializer.\n #[inline]\n #[must_use]\n pub const fn declaration(&self) -> &LexicalDeclaration {\n &self.declaration\n }\n\n /// Returns the scope of the lexical initializer.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> &Scope {\n &self.scope\n }\n}\n\nimpl ToInternedString for ForLoopInitializer {\n fn to_interned_string(&self, interner: &Interner) -> String {\n match self {\n Self::Var(var) => var.to_interned_string(interner),\n Self::Lexical(lex) => lex.declaration.to_interned_string(interner),\n Self::Expression(expr) => expr.to_interned_string(interner),\n }\n }\n}\n\nimpl From for ForLoopInitializer {\n #[inline]\n fn from(expr: Expression) -> Self {\n Self::Expression(expr)\n }\n}\n\nimpl From for ForLoopInitializer {\n #[inline]\n fn from(list: LexicalDeclaration) -> Self {\n Self::Lexical(ForLoopInitializerLexical {\n declaration: list,\n scope: Scope::default(),\n })\n }\n}\n\nimpl From for ForLoopInitializer {\n #[inline]\n fn from(list: VarDeclaration) -> Self {\n Self::Var(list)\n }\n}\n\nimpl VisitWith for ForLoopInitializer {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Expression(expr) => visitor.visit_expression(expr),\n Self::Var(vd) => visitor.visit_var_declaration(vd),\n Self::Lexical(ld) => visitor.visit_lexical_declaration(&ld.declaration),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Expression(expr) => visitor.visit_expression_mut(expr),\n Self::Var(vd) => visitor.visit_var_declaration_mut(vd),\n Self::Lexical(ld) => visitor.visit_lexical_declaration_mut(&mut ld.declaration),\n }\n }\n}\n" }, { "path": "core/ast/src/statement/iteration/for_of_loop.rs", "content": "use crate::operations::{ContainsSymbol, contains};\nuse crate::scope::Scope;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{\n expression::Expression,\n statement::{Statement, iteration::IterableLoopInitializer},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// A `for...of` loop statement, as defined by the [spec].\n///\n/// [`for..of`][forof] statements loop over a sequence of values obtained from an iterable object (Array,\n/// String, Map, generators).\n///\n/// This type combines `for..of` and [`for await...of`][forawait] statements in a single structure,\n/// since `for await...of` is essentially the same statement but with async iterable objects\n/// as the source of iteration.\n///\n/// [forof]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/for...of\n/// [spec]: https://tc39.es/ecma262/#prod-ForInOfStatement\n/// [forawait]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/for-await...of\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct ForOfLoop {\n pub(crate) init: IterableLoopInitializer,\n pub(crate) iterable: Expression,\n pub(crate) body: Box,\n r#await: bool,\n pub(crate) iterable_contains_direct_eval: bool,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) iterable_scope: Option,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Option,\n}\n\nimpl ForOfLoop {\n /// Creates a new \"for of\" loop AST node.\n #[inline]\n #[must_use]\n pub fn new(\n init: IterableLoopInitializer,\n iterable: Expression,\n body: Statement,\n r#await: bool,\n ) -> Self {\n let iterable_contains_direct_eval = contains(&iterable, ContainsSymbol::DirectEval);\n let contains_direct_eval = contains(&init, ContainsSymbol::DirectEval)\n || contains(&body, ContainsSymbol::DirectEval);\n Self {\n init,\n iterable,\n body: body.into(),\n iterable_contains_direct_eval,\n contains_direct_eval,\n r#await,\n iterable_scope: None,\n scope: None,\n }\n }\n\n /// Gets the initializer of the for...of loop.\n #[inline]\n #[must_use]\n pub const fn initializer(&self) -> &IterableLoopInitializer {\n &self.init\n }\n\n /// Gets the iterable expression of the for...of loop.\n #[inline]\n #[must_use]\n pub const fn iterable(&self) -> &Expression {\n &self.iterable\n }\n\n /// Gets the body to execute in the for...of loop.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &Statement {\n &self.body\n }\n\n /// Returns true if this \"for...of\" loop is an \"for await...of\" loop.\n #[inline]\n #[must_use]\n pub const fn r#await(&self) -> bool {\n self.r#await\n }\n\n /// Return the iterable scope of the for...of loop.\n #[inline]\n #[must_use]\n pub const fn iterable_scope(&self) -> Option<&Scope> {\n self.iterable_scope.as_ref()\n }\n\n /// Return the scope of the for...of loop.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> Option<&Scope> {\n self.scope.as_ref()\n }\n}\n\nimpl ToIndentedString for ForOfLoop {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"for ({} of {}) {}\",\n self.init.to_interned_string(interner),\n self.iterable.to_interned_string(interner),\n self.body().to_indented_string(interner, indentation)\n )\n }\n}\n\nimpl From for Statement {\n #[inline]\n fn from(for_of: ForOfLoop) -> Self {\n Self::ForOfLoop(for_of)\n }\n}\n\nimpl VisitWith for ForOfLoop {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_iterable_loop_initializer(&self.init)?;\n visitor.visit_expression(&self.iterable)?;\n visitor.visit_statement(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_iterable_loop_initializer_mut(&mut self.init)?;\n visitor.visit_expression_mut(&mut self.iterable)?;\n visitor.visit_statement_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/statement/iteration/mod.rs", "content": "//! Iteration nodes\n\nmod r#break;\nmod r#continue;\nmod do_while_loop;\nmod for_in_loop;\nmod for_loop;\nmod for_of_loop;\nmod while_loop;\n\nuse crate::{\n declaration::{Binding, Variable},\n expression::{Identifier, access::PropertyAccess},\n pattern::Pattern,\n};\nuse core::ops::ControlFlow;\n\npub use self::{\n r#break::Break,\n r#continue::Continue,\n do_while_loop::DoWhileLoop,\n for_in_loop::ForInLoop,\n for_loop::{ForLoop, ForLoopInitializer, ForLoopInitializerLexical},\n for_of_loop::ForOfLoop,\n while_loop::WhileLoop,\n};\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse boa_interner::{Interner, ToInternedString};\n\n/// A `for-in`, `for-of` and `for-await-of` loop initializer.\n///\n/// The [spec] specifies only single bindings for the listed types of loops, which makes us\n/// unable to use plain `LexicalDeclaration`s or `VarStatement`s as initializers, since those\n/// can have more than one binding.\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ForInOfStatement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum IterableLoopInitializer {\n /// An already declared variable.\n Identifier(Identifier),\n /// A property access.\n Access(PropertyAccess),\n /// A new var declaration.\n Var(Variable),\n /// A new let declaration.\n Let(Binding),\n /// A new const declaration.\n Const(Binding),\n /// A pattern with already declared variables.\n Pattern(Pattern),\n}\n\nimpl ToInternedString for IterableLoopInitializer {\n fn to_interned_string(&self, interner: &Interner) -> String {\n let (binding, pre) = match self {\n Self::Identifier(ident) => return ident.to_interned_string(interner),\n Self::Pattern(pattern) => return pattern.to_interned_string(interner),\n Self::Access(access) => return access.to_interned_string(interner),\n Self::Var(binding) => (binding.to_interned_string(interner), \"var\"),\n Self::Let(binding) => (binding.to_interned_string(interner), \"let\"),\n Self::Const(binding) => (binding.to_interned_string(interner), \"const\"),\n };\n\n format!(\"{pre} {binding}\")\n }\n}\n\nimpl VisitWith for IterableLoopInitializer {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Identifier(id) => visitor.visit_identifier(id),\n Self::Access(pa) => visitor.visit_property_access(pa),\n Self::Var(b) => visitor.visit_variable(b),\n Self::Let(b) | Self::Const(b) => visitor.visit_binding(b),\n Self::Pattern(p) => visitor.visit_pattern(p),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Identifier(id) => visitor.visit_identifier_mut(id),\n Self::Access(pa) => visitor.visit_property_access_mut(pa),\n Self::Var(b) => visitor.visit_variable_mut(b),\n Self::Let(b) | Self::Const(b) => visitor.visit_binding_mut(b),\n Self::Pattern(p) => visitor.visit_pattern_mut(p),\n }\n }\n}\n" }, { "path": "core/ast/src/statement/iteration/while_loop.rs", "content": "use crate::{\n expression::Expression,\n statement::Statement,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// The `while` statement creates a loop that executes a specified statement as long as the\n/// test condition evaluates to `true`.\n///\n/// The condition is evaluated before executing the statement.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-grammar-notation-WhileStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/while\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct WhileLoop {\n condition: Expression,\n body: Box,\n}\n\nimpl WhileLoop {\n /// Creates a `WhileLoop` AST node.\n #[inline]\n #[must_use]\n pub fn new(condition: Expression, body: Statement) -> Self {\n Self {\n condition,\n body: body.into(),\n }\n }\n\n /// Gets the condition of the while loop.\n #[inline]\n #[must_use]\n pub const fn condition(&self) -> &Expression {\n &self.condition\n }\n\n /// Gets the body of the while loop.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &Statement {\n &self.body\n }\n}\n\nimpl ToIndentedString for WhileLoop {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"while ({}) {}\",\n self.condition().to_interned_string(interner),\n self.body().to_indented_string(interner, indentation)\n )\n }\n}\n\nimpl From for Statement {\n #[inline]\n fn from(while_loop: WhileLoop) -> Self {\n Self::WhileLoop(while_loop)\n }\n}\n\nimpl VisitWith for WhileLoop {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.condition)?;\n visitor.visit_statement(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.condition)?;\n visitor.visit_statement_mut(&mut self.body)\n }\n}\n" }, { "path": "core/ast/src/statement/labelled.rs", "content": "use crate::{\n Statement,\n function::FunctionDeclaration,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, Sym, ToIndentedString, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// The set of Parse Nodes that can be preceded by a label, as defined by the [spec].\n///\n/// Semantically, a [`Labelled`] statement should only wrap [`Statement`] nodes. However,\n/// old ECMAScript implementations supported [labelled function declarations][label-fn] as an extension\n/// of the grammar. In the ECMAScript 2015 spec, the production of `LabelledStatement` was\n/// modified to include labelled [`FunctionDeclaration`]s as a valid node.\n///\n/// [spec]: https://tc39.es/ecma262/#prod-LabelledItem\n/// [label-fn]: https://tc39.es/ecma262/#sec-labelled-function-declarations\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\n#[allow(clippy::large_enum_variant)]\npub enum LabelledItem {\n /// A labelled [`FunctionDeclaration`].\n FunctionDeclaration(FunctionDeclaration),\n\n /// A labelled [`Statement`].\n Statement(Statement),\n}\n\nimpl LabelledItem {\n pub(crate) fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n match self {\n Self::FunctionDeclaration(f) => f.to_indented_string(interner, indentation),\n Self::Statement(stmt) => stmt.to_indented_string(interner, indentation),\n }\n }\n}\n\nimpl ToInternedString for LabelledItem {\n fn to_interned_string(&self, interner: &Interner) -> String {\n self.to_indented_string(interner, 0)\n }\n}\n\nimpl From for LabelledItem {\n fn from(f: FunctionDeclaration) -> Self {\n Self::FunctionDeclaration(f)\n }\n}\n\nimpl From for LabelledItem {\n fn from(stmt: Statement) -> Self {\n Self::Statement(stmt)\n }\n}\n\nimpl VisitWith for LabelledItem {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::FunctionDeclaration(f) => visitor.visit_function_declaration(f),\n Self::Statement(s) => visitor.visit_statement(s),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::FunctionDeclaration(f) => visitor.visit_function_declaration_mut(f),\n Self::Statement(s) => visitor.visit_statement_mut(s),\n }\n }\n}\n\n/// Labelled statement nodes, as defined by the [spec].\n///\n/// The method [`Labelled::item`] doesn't return a [`Statement`] for compatibility reasons.\n/// See [`LabelledItem`] for more information.\n///\n/// [spec]: https://tc39.es/ecma262/#sec-labelled-statements\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Labelled {\n item: Box,\n label: Sym,\n}\n\nimpl Labelled {\n /// Creates a new `Labelled` statement.\n #[inline]\n #[must_use]\n pub fn new(item: LabelledItem, label: Sym) -> Self {\n Self {\n item: Box::new(item),\n label,\n }\n }\n\n /// Gets the labelled item.\n #[inline]\n #[must_use]\n pub const fn item(&self) -> &LabelledItem {\n &self.item\n }\n\n /// Gets the label name.\n #[inline]\n #[must_use]\n pub const fn label(&self) -> Sym {\n self.label\n }\n\n pub(crate) fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"{}: {}\",\n interner.resolve_expect(self.label),\n self.item.to_indented_string(interner, indentation)\n )\n }\n}\n\nimpl ToInternedString for Labelled {\n fn to_interned_string(&self, interner: &Interner) -> String {\n self.to_indented_string(interner, 0)\n }\n}\n\nimpl From for Statement {\n fn from(labelled: Labelled) -> Self {\n Self::Labelled(labelled)\n }\n}\n\nimpl VisitWith for Labelled {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_labelled_item(&self.item)?;\n visitor.visit_sym(&self.label)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_labelled_item_mut(&mut self.item)?;\n visitor.visit_sym_mut(&mut self.label)\n }\n}\n" }, { "path": "core/ast/src/statement/mod.rs", "content": "//! The [`Statement`] Parse Node, as defined by the [spec].\n//!\n//! ECMAScript [statements] are mainly composed of control flow operations, such as [`If`],\n//! [`WhileLoop`], and [`Break`]. However, it also contains statements such as [`VarDeclaration`],\n//! [`Block`] or [`Expression`] which are not strictly used for control flow.\n//!\n//! [spec]: https://tc39.es/ecma262/#prod-Statement\n//! [statements]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements\n\nmod block;\nmod r#if;\nmod labelled;\nmod r#return;\nmod switch;\nmod throw;\nmod r#try;\nmod with;\n\npub mod iteration;\n\npub use self::{\n block::Block,\n r#if::If,\n iteration::{Break, Continue, DoWhileLoop, ForInLoop, ForLoop, ForOfLoop, WhileLoop},\n labelled::{Labelled, LabelledItem},\n r#return::Return,\n switch::{Case, Switch},\n throw::Throw,\n r#try::{Catch, ErrorHandler, Finally, Try},\n with::With,\n};\nuse core::ops::ControlFlow;\n\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\n\nuse super::{declaration::VarDeclaration, expression::Expression};\n\n/// The `Statement` Parse Node.\n///\n/// See the [module level documentation][self] for more information.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum Statement {\n /// See [`Block`].\n Block(Block),\n\n /// See [`VarDeclaration`]\n Var(VarDeclaration),\n\n /// An empty statement.\n ///\n /// Empty statements do nothing, just return undefined.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#prod-EmptyStatement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/Empty\n Empty,\n\n /// See [`Expression`].\n Expression(Expression),\n\n /// See [`If`].\n If(If),\n\n /// See [`DoWhileLoop`].\n DoWhileLoop(DoWhileLoop),\n\n /// See [`WhileLoop`].\n WhileLoop(WhileLoop),\n\n /// See [`ForLoop`].\n ForLoop(ForLoop),\n\n /// See [`ForInLoop`].\n ForInLoop(ForInLoop),\n\n /// See [`ForOfLoop`].\n ForOfLoop(ForOfLoop),\n\n /// See[`Switch`].\n Switch(Switch),\n\n /// See [`Continue`].\n Continue(Continue),\n\n /// See [`Break`].\n Break(Break),\n\n /// See [`Return`].\n Return(Return),\n\n /// See [`Labelled`].\n Labelled(Labelled),\n\n /// See [`Throw`].\n Throw(Throw),\n\n /// See [`Try`].\n Try(Try),\n\n /// See [`With`].\n With(With),\n\n /// A `debugger` statement.\n ///\n /// The debugger statement invokes any available debugging functionality.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-debugger-statement\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/debugger\n Debugger,\n}\n\nimpl Statement {\n /// Implements the display formatting with indentation.\n ///\n /// This will not prefix the value with any indentation. If you want to prefix this with proper\n /// indents, use [`to_indented_string()`](Self::to_indented_string).\n pub(super) fn to_no_indent_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut s = match self {\n Self::Block(block) => return block.to_indented_string(interner, indentation),\n Self::Var(var) => var.to_interned_string(interner),\n Self::Empty => return \";\".to_owned(),\n Self::Expression(expr) => expr.to_indented_string(interner, indentation),\n Self::If(if_smt) => return if_smt.to_indented_string(interner, indentation),\n Self::DoWhileLoop(do_while) => do_while.to_indented_string(interner, indentation),\n Self::WhileLoop(while_loop) => {\n return while_loop.to_indented_string(interner, indentation);\n }\n Self::ForLoop(for_loop) => return for_loop.to_indented_string(interner, indentation),\n Self::ForInLoop(for_in) => return for_in.to_indented_string(interner, indentation),\n Self::ForOfLoop(for_of) => return for_of.to_indented_string(interner, indentation),\n Self::Switch(switch) => return switch.to_indented_string(interner, indentation),\n Self::Continue(cont) => cont.to_interned_string(interner),\n Self::Break(break_smt) => break_smt.to_interned_string(interner),\n Self::Return(ret) => ret.to_interned_string(interner),\n Self::Labelled(labelled) => return labelled.to_interned_string(interner),\n Self::Throw(throw) => throw.to_interned_string(interner),\n Self::Try(try_catch) => return try_catch.to_indented_string(interner, indentation),\n Self::With(with) => return with.to_interned_string(interner),\n Self::Debugger => \"debugger\".to_owned(),\n };\n s.push(';');\n s\n }\n\n /// Abstract operation [`IsLabelledFunction`][spec].\n ///\n /// This recursively checks if this `Statement` is a labelled function, since adding\n /// several labels in a function should not change the return value of the abstract operation:\n ///\n /// ```Javascript\n /// l1: l2: l3: l4: function f(){ }\n /// ```\n ///\n /// This should return `true` for that snippet.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-islabelledfunction\n #[inline]\n #[must_use]\n pub fn is_labelled_function(&self) -> bool {\n match self {\n Self::Labelled(stmt) => match stmt.item() {\n LabelledItem::FunctionDeclaration(_) => true,\n LabelledItem::Statement(stmt) => stmt.is_labelled_function(),\n },\n _ => false,\n }\n }\n}\n\nimpl ToIndentedString for Statement {\n /// Creates a string of the value of the node with the given indentation. For example, an\n /// indent level of 2 would produce this:\n ///\n /// ```js\n /// function hello() {\n /// console.log(\"hello\");\n /// }\n /// hello();\n /// a = 2;\n /// ```\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = match *self {\n Self::Block(_) => String::new(),\n _ => \" \".repeat(indentation),\n };\n\n buf.push_str(&self.to_no_indent_string(interner, indentation));\n\n buf\n }\n}\n\nimpl VisitWith for Statement {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Block(b) => visitor.visit_block(b),\n Self::Var(v) => visitor.visit_var_declaration(v),\n Self::Empty | Self::Debugger => {\n // do nothing; there is nothing to visit here\n ControlFlow::Continue(())\n }\n Self::Expression(e) => visitor.visit_expression(e),\n Self::If(i) => visitor.visit_if(i),\n Self::DoWhileLoop(dw) => visitor.visit_do_while_loop(dw),\n Self::WhileLoop(w) => visitor.visit_while_loop(w),\n Self::ForLoop(f) => visitor.visit_for_loop(f),\n Self::ForInLoop(fi) => visitor.visit_for_in_loop(fi),\n Self::ForOfLoop(fo) => visitor.visit_for_of_loop(fo),\n Self::Switch(s) => visitor.visit_switch(s),\n Self::Continue(c) => visitor.visit_continue(c),\n Self::Break(b) => visitor.visit_break(b),\n Self::Return(r) => visitor.visit_return(r),\n Self::Labelled(l) => visitor.visit_labelled(l),\n Self::Throw(th) => visitor.visit_throw(th),\n Self::Try(tr) => visitor.visit_try(tr),\n Self::With(with) => visitor.visit_with(with),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Block(b) => visitor.visit_block_mut(b),\n Self::Var(v) => visitor.visit_var_declaration_mut(v),\n Self::Empty | Self::Debugger => {\n // do nothing; there is nothing to visit here\n ControlFlow::Continue(())\n }\n Self::Expression(e) => visitor.visit_expression_mut(e),\n Self::If(i) => visitor.visit_if_mut(i),\n Self::DoWhileLoop(dw) => visitor.visit_do_while_loop_mut(dw),\n Self::WhileLoop(w) => visitor.visit_while_loop_mut(w),\n Self::ForLoop(f) => visitor.visit_for_loop_mut(f),\n Self::ForInLoop(fi) => visitor.visit_for_in_loop_mut(fi),\n Self::ForOfLoop(fo) => visitor.visit_for_of_loop_mut(fo),\n Self::Switch(s) => visitor.visit_switch_mut(s),\n Self::Continue(c) => visitor.visit_continue_mut(c),\n Self::Break(b) => visitor.visit_break_mut(b),\n Self::Return(r) => visitor.visit_return_mut(r),\n Self::Labelled(l) => visitor.visit_labelled_mut(l),\n Self::Throw(th) => visitor.visit_throw_mut(th),\n Self::Try(tr) => visitor.visit_try_mut(tr),\n Self::With(with) => visitor.visit_with_mut(with),\n }\n }\n}\n" }, { "path": "core/ast/src/statement/return.rs", "content": "use crate::{\n expression::Expression,\n statement::Statement,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// The `return` statement ends function execution and specifies a value to be returned to the\n/// function caller.\n///\n/// Syntax: `return [expression];`\n///\n/// `expression`:\n/// > The expression whose value is to be returned. If omitted, `undefined` is returned instead.\n///\n/// When a `return` statement is used in a function body, the execution of the function is\n/// stopped. If specified, a given value is returned to the function caller.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ReturnStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/return\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Return {\n target: Option,\n}\n\nimpl Return {\n /// Gets the target expression value of this `Return` statement.\n #[must_use]\n pub const fn target(&self) -> Option<&Expression> {\n self.target.as_ref()\n }\n\n /// Creates a `Return` AST node.\n #[must_use]\n pub const fn new(expression: Option) -> Self {\n Self { target: expression }\n }\n}\n\nimpl From for Statement {\n fn from(return_smt: Return) -> Self {\n Self::Return(return_smt)\n }\n}\n\nimpl ToInternedString for Return {\n fn to_interned_string(&self, interner: &Interner) -> String {\n self.target().map_or_else(\n || \"return\".to_owned(),\n |ex| format!(\"return {}\", ex.to_interned_string(interner)),\n )\n }\n}\n\nimpl VisitWith for Return {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(expr) = &self.target {\n visitor.visit_expression(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(expr) = &mut self.target {\n visitor.visit_expression_mut(expr)\n } else {\n ControlFlow::Continue(())\n }\n }\n}\n" }, { "path": "core/ast/src/statement/switch.rs", "content": "//! Switch node.\n\nuse crate::{\n StatementList,\n expression::Expression,\n operations::{ContainsSymbol, contains},\n scope::Scope,\n statement::Statement,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// A case clause inside a [`Switch`] statement, as defined by the [spec].\n///\n/// Even though every [`Case`] body is a [`StatementList`], it doesn't create a new lexical\n/// environment. This means any variable declared in a `Case` will be considered as part of the\n/// lexical environment of the parent [`Switch`] block.\n///\n/// [spec]: https://tc39.es/ecma262/#prod-CaseClause\n/// [truthy]: https://developer.mozilla.org/en-US/docs/Glossary/Truthy\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Case {\n condition: Option,\n body: StatementList,\n}\n\nimpl Case {\n /// Creates a regular `Case` AST node.\n #[inline]\n #[must_use]\n pub const fn new(condition: Expression, body: StatementList) -> Self {\n Self {\n condition: Some(condition),\n body,\n }\n }\n\n /// Creates a default `Case` AST node.\n #[inline]\n #[must_use]\n pub const fn default(body: StatementList) -> Self {\n Self {\n condition: None,\n body,\n }\n }\n\n /// Gets the condition of the case.\n ///\n /// If it's a regular case returns [`Some`] with the [`Expression`],\n /// otherwise [`None`] is returned if it's the default case.\n #[inline]\n #[must_use]\n pub const fn condition(&self) -> Option<&Expression> {\n self.condition.as_ref()\n }\n\n /// Gets the statement listin the body of the case.\n #[inline]\n #[must_use]\n pub const fn body(&self) -> &StatementList {\n &self.body\n }\n\n /// Check if the case is the `default` case.\n #[inline]\n #[must_use]\n pub const fn is_default(&self) -> bool {\n self.condition.is_none()\n }\n}\n\nimpl VisitWith for Case {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(condition) = &self.condition {\n visitor.visit_expression(condition)?;\n }\n\n visitor.visit_statement_list(&self.body)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(condition) = &mut self.condition {\n visitor.visit_expression_mut(condition)?;\n }\n visitor.visit_statement_list_mut(&mut self.body)\n }\n}\n\n/// The `switch` statement evaluates an expression, matching the expression's value to a case\n/// clause, and executes statements associated with that case, as well as statements in cases\n/// that follow the matching case.\n///\n/// A `switch` statement first evaluates its expression. It then looks for the first case\n/// clause whose expression evaluates to the same value as the result of the input expression\n/// (using the strict comparison, `===`) and transfers control to that clause, executing the\n/// associated statements. (If multiple cases match the provided value, the first case that\n/// matches is selected, even if the cases are not equal to each other.)\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-SwitchStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/switch\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Switch {\n pub(crate) val: Expression,\n pub(crate) cases: Box<[Case]>,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Option,\n}\n\nimpl Switch {\n /// Creates a `Switch` AST node.\n #[inline]\n #[must_use]\n pub fn new(val: Expression, cases: Box<[Case]>) -> Self {\n let mut contains_direct_eval = false;\n for case in &cases {\n contains_direct_eval |= contains(case, ContainsSymbol::DirectEval);\n }\n Self {\n val,\n cases,\n contains_direct_eval,\n scope: None,\n }\n }\n\n /// Gets the value to switch.\n #[inline]\n #[must_use]\n pub const fn val(&self) -> &Expression {\n &self.val\n }\n\n /// Gets the list of cases for the switch statement.\n #[inline]\n #[must_use]\n pub const fn cases(&self) -> &[Case] {\n &self.cases\n }\n\n /// Gets the default statement list, if any.\n #[inline]\n #[must_use]\n pub fn default(&self) -> Option<&StatementList> {\n for case in self.cases.as_ref() {\n if case.is_default() {\n return Some(case.body());\n }\n }\n None\n }\n\n /// Gets the scope of the switch statement.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> Option<&Scope> {\n self.scope.as_ref()\n }\n}\n\nimpl ToIndentedString for Switch {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let indent = \" \".repeat(indentation);\n let mut buf = format!(\"switch ({}) {{\\n\", self.val().to_interned_string(interner));\n for e in &*self.cases {\n if let Some(condition) = e.condition() {\n let _ = write!(\n buf,\n \"{indent} case {}:\\n{}\",\n condition.to_interned_string(interner),\n e.body().to_indented_string(interner, indentation + 2)\n );\n } else {\n let _ = write!(\n buf,\n \"{indent} default:\\n{}\",\n e.body().to_indented_string(interner, indentation + 2)\n );\n }\n }\n\n let _ = write!(buf, \"{indent}}}\");\n\n buf\n }\n}\n\nimpl From for Statement {\n #[inline]\n fn from(switch: Switch) -> Self {\n Self::Switch(switch)\n }\n}\n\nimpl VisitWith for Switch {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.val)?;\n for case in &*self.cases {\n visitor.visit_case(case)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.val)?;\n for case in &mut *self.cases {\n visitor.visit_case_mut(case)?;\n }\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/src/statement/throw.rs", "content": "use crate::{\n Expression,\n statement::Statement,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// The `throw` statement throws a user-defined exception.\n///\n/// Syntax: `throw expression;`\n///\n/// Execution of the current function will stop (the statements after throw won't be executed),\n/// and control will be passed to the first catch block in the call stack. If no catch block\n/// exists among caller functions, the program will terminate.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-ThrowStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/throw\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Throw {\n target: Expression,\n}\n\nimpl Throw {\n /// Gets the target expression of this `Throw` statement.\n #[must_use]\n pub const fn target(&self) -> &Expression {\n &self.target\n }\n\n /// Creates a `Throw` AST node.\n #[must_use]\n pub const fn new(target: Expression) -> Self {\n Self { target }\n }\n}\n\nimpl ToInternedString for Throw {\n fn to_interned_string(&self, interner: &Interner) -> String {\n format!(\"throw {}\", self.target.to_interned_string(interner))\n }\n}\n\nimpl From for Statement {\n fn from(trw: Throw) -> Self {\n Self::Throw(trw)\n }\n}\n\nimpl VisitWith for Throw {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.target)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.target)\n }\n}\n" }, { "path": "core/ast/src/statement/try.rs", "content": "//! Error handling statements\n\nuse crate::operations::{ContainsSymbol, contains};\nuse crate::scope::Scope;\nuse crate::visitor::{VisitWith, Visitor, VisitorMut};\nuse crate::{\n declaration::Binding,\n statement::{Block, Statement},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::{fmt::Write as _, ops::ControlFlow};\n\n/// The `try...catch` statement marks a block of statements to try and specifies a response\n/// should an exception be thrown.\n///\n/// The `try` statement consists of a `try`-block, which contains one or more statements. `{}`\n/// must always be used, even for single statements. At least one `catch`-block, or a\n/// `finally`-block, must be present.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-TryStatement\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/try...catch\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Try {\n block: Block,\n handler: ErrorHandler,\n}\n\n/// The type of error handler in a [`Try`] statement.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum ErrorHandler {\n /// A [`Catch`] error handler.\n Catch(Catch),\n /// A [`Finally`] error handler.\n Finally(Finally),\n /// A [`Catch`] and [`Finally`] error handler.\n Full(Catch, Finally),\n}\n\nimpl Try {\n /// Creates a new `Try` AST node.\n #[inline]\n #[must_use]\n pub const fn new(block: Block, handler: ErrorHandler) -> Self {\n Self { block, handler }\n }\n\n /// Gets the `try` block.\n #[inline]\n #[must_use]\n pub const fn block(&self) -> &Block {\n &self.block\n }\n\n /// Gets the `catch` block, if any.\n #[inline]\n #[must_use]\n pub const fn catch(&self) -> Option<&Catch> {\n match &self.handler {\n ErrorHandler::Catch(c) | ErrorHandler::Full(c, _) => Some(c),\n ErrorHandler::Finally(_) => None,\n }\n }\n\n /// Gets the `finally` block, if any.\n #[inline]\n #[must_use]\n pub const fn finally(&self) -> Option<&Finally> {\n match &self.handler {\n ErrorHandler::Finally(f) | ErrorHandler::Full(_, f) => Some(f),\n ErrorHandler::Catch(_) => None,\n }\n }\n}\n\nimpl ToIndentedString for Try {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = format!(\n \"{}try {}\",\n \" \".repeat(indentation),\n self.block.to_indented_string(interner, indentation)\n );\n\n if let Some(catch) = self.catch() {\n buf.push_str(&catch.to_indented_string(interner, indentation));\n }\n\n if let Some(finally) = self.finally() {\n buf.push_str(&finally.to_indented_string(interner, indentation));\n }\n buf\n }\n}\n\nimpl From for Statement {\n #[inline]\n fn from(try_catch: Try) -> Self {\n Self::Try(try_catch)\n }\n}\n\nimpl VisitWith for Try {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_block(&self.block)?;\n if let Some(catch) = &self.catch() {\n visitor.visit_catch(catch)?;\n }\n if let Some(finally) = &self.finally() {\n visitor.visit_finally(finally)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_block_mut(&mut self.block)?;\n match &mut self.handler {\n ErrorHandler::Catch(c) => visitor.visit_catch_mut(c)?,\n ErrorHandler::Finally(f) => visitor.visit_finally_mut(f)?,\n ErrorHandler::Full(c, f) => {\n visitor.visit_catch_mut(c)?;\n visitor.visit_finally_mut(f)?;\n }\n }\n ControlFlow::Continue(())\n }\n}\n\n/// Catch block.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Catch {\n pub(crate) parameter: Option,\n pub(crate) block: Block,\n pub(crate) contains_direct_eval: bool,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Scope,\n}\n\nimpl Catch {\n /// Creates a new catch block.\n #[inline]\n #[must_use]\n pub fn new(parameter: Option, block: Block) -> Self {\n let mut contains_direct_eval = contains(&block, ContainsSymbol::DirectEval);\n if let Some(param) = ¶meter {\n contains_direct_eval |= contains(param, ContainsSymbol::DirectEval);\n }\n Self {\n parameter,\n block,\n contains_direct_eval,\n scope: Scope::default(),\n }\n }\n\n /// Gets the parameter of the catch block.\n #[inline]\n #[must_use]\n pub const fn parameter(&self) -> Option<&Binding> {\n self.parameter.as_ref()\n }\n\n /// Retrieves the catch execution block.\n #[inline]\n #[must_use]\n pub const fn block(&self) -> &Block {\n &self.block\n }\n\n /// Returns the scope of the catch block.\n #[inline]\n #[must_use]\n pub const fn scope(&self) -> &Scope {\n &self.scope\n }\n}\n\nimpl ToIndentedString for Catch {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = \" catch\".to_owned();\n if let Some(param) = &self.parameter {\n let _ = write!(buf, \"({})\", param.to_interned_string(interner));\n }\n let _ = write!(\n buf,\n \" {}\",\n self.block.to_indented_string(interner, indentation)\n );\n\n buf\n }\n}\n\nimpl VisitWith for Catch {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n if let Some(binding) = &self.parameter {\n visitor.visit_binding(binding)?;\n }\n visitor.visit_block(&self.block)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n if let Some(binding) = &mut self.parameter {\n visitor.visit_binding_mut(binding)?;\n }\n visitor.visit_block_mut(&mut self.block)\n }\n}\n\n/// Finally block.\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct Finally {\n block: Block,\n}\n\nimpl Finally {\n /// Gets the finally block.\n #[inline]\n #[must_use]\n pub const fn block(&self) -> &Block {\n &self.block\n }\n}\n\nimpl ToIndentedString for Finally {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \" finally {}\",\n self.block.to_indented_string(interner, indentation)\n )\n }\n}\n\nimpl From for Finally {\n #[inline]\n fn from(block: Block) -> Self {\n Self { block }\n }\n}\n\nimpl VisitWith for Finally {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_block(&self.block)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_block_mut(&mut self.block)\n }\n}\n" }, { "path": "core/ast/src/statement/with.rs", "content": "use crate::{\n expression::Expression,\n scope::Scope,\n statement::Statement,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString, ToInternedString};\nuse core::ops::ControlFlow;\n\n/// The `with` statement extends the scope chain for a statement.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n/// - [MDN documentation][mdn]\n///\n/// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/with\n/// [spec]: https://tc39.es/ecma262/#prod-WithStatement\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub struct With {\n pub(crate) expression: Expression,\n pub(crate) statement: Box,\n\n #[cfg_attr(feature = \"serde\", serde(skip))]\n pub(crate) scope: Scope,\n}\n\nimpl With {\n /// Creates a `With` AST node.\n #[must_use]\n pub fn new(expression: Expression, statement: Statement) -> Self {\n Self {\n expression,\n statement: Box::new(statement),\n scope: Scope::default(),\n }\n }\n\n /// Gets the expression value of this `With` statement.\n #[must_use]\n pub const fn expression(&self) -> &Expression {\n &self.expression\n }\n\n /// Gets the statement value of this `With` statement.\n #[must_use]\n pub const fn statement(&self) -> &Statement {\n &self.statement\n }\n\n /// Returns the scope of the `With` statement.\n #[must_use]\n pub const fn scope(&self) -> &Scope {\n &self.scope\n }\n}\n\nimpl From for Statement {\n fn from(with: With) -> Self {\n Self::With(with)\n }\n}\n\nimpl ToIndentedString for With {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n format!(\n \"with ({}) {}\",\n self.expression().to_interned_string(interner),\n self.statement().to_indented_string(interner, indentation)\n )\n }\n}\n\nimpl VisitWith for With {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n visitor.visit_expression(&self.expression)?;\n visitor.visit_statement(&self.statement)\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n visitor.visit_expression_mut(&mut self.expression)?;\n visitor.visit_statement_mut(&mut self.statement)\n }\n}\n" }, { "path": "core/ast/src/statement_list.rs", "content": "//! Statement list node.\n\nuse super::Declaration;\nuse crate::{\n LinearPosition,\n statement::Statement,\n visitor::{VisitWith, Visitor, VisitorMut},\n};\nuse boa_interner::{Interner, ToIndentedString};\nuse core::ops::ControlFlow;\nuse std::ops::Deref;\n\n/// An item inside a [`StatementList`] Parse Node, as defined by the [spec].\n///\n/// Items in a `StatementList` can be either [`Declaration`]s (functions, classes, let/const declarations)\n/// or [`Statement`]s (if, while, var statement).\n///\n/// [spec]: https://tc39.es/ecma262/#prod-StatementListItem\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[cfg_attr(feature = \"arbitrary\", derive(arbitrary::Arbitrary))]\n#[derive(Clone, Debug, PartialEq)]\npub enum StatementListItem {\n /// See [`Statement`].\n Statement(Box),\n /// See [`Declaration`].\n Declaration(Box),\n}\n\nimpl ToIndentedString for StatementListItem {\n /// Creates a string of the value of the node with the given indentation. For example, an\n /// indent level of 2 would produce this:\n ///\n /// ```js\n /// function hello() {\n /// console.log(\"hello\");\n /// }\n /// hello();\n /// a = 2;\n /// ```\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = \" \".repeat(indentation);\n\n match self {\n Self::Statement(stmt) => {\n buf.push_str(&stmt.to_no_indent_string(interner, indentation));\n }\n Self::Declaration(decl) => {\n buf.push_str(&decl.to_indented_string(interner, indentation));\n }\n }\n\n buf\n }\n}\n\nimpl From for StatementListItem {\n #[inline]\n fn from(stmt: Statement) -> Self {\n Self::Statement(Box::new(stmt))\n }\n}\n\nimpl From for StatementListItem {\n #[inline]\n fn from(decl: Declaration) -> Self {\n Self::Declaration(Box::new(decl))\n }\n}\n\nimpl VisitWith for StatementListItem {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n match self {\n Self::Statement(statement) => visitor.visit_statement(statement),\n Self::Declaration(declaration) => visitor.visit_declaration(declaration),\n }\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n match self {\n Self::Statement(statement) => visitor.visit_statement_mut(statement),\n Self::Declaration(declaration) => visitor.visit_declaration_mut(declaration),\n }\n }\n}\n\n/// List of statements.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#prod-StatementList\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n#[derive(Clone, Debug, Default)]\npub struct StatementList {\n pub(crate) statements: Box<[StatementListItem]>,\n linear_pos_end: LinearPosition,\n strict: bool,\n}\n\nimpl PartialEq for StatementList {\n fn eq(&self, other: &Self) -> bool {\n self.statements == other.statements && self.strict == other.strict\n }\n}\n\nimpl StatementList {\n /// Creates a new `StatementList` AST node.\n #[must_use]\n pub fn new(statements: S, linear_pos_end: LinearPosition, strict: bool) -> Self\n where\n S: Into>,\n {\n Self {\n statements: statements.into(),\n linear_pos_end,\n strict,\n }\n }\n\n /// Gets the list of statements.\n #[inline]\n #[must_use]\n pub const fn statements(&self) -> &[StatementListItem] {\n &self.statements\n }\n\n /// Get the strict mode.\n #[inline]\n #[must_use]\n pub const fn strict(&self) -> bool {\n self.strict\n }\n\n /// Get end of linear position in source code.\n #[inline]\n #[must_use]\n pub const fn linear_pos_end(&self) -> LinearPosition {\n self.linear_pos_end\n }\n}\n\nimpl From<(Box<[StatementListItem]>, LinearPosition)> for StatementList {\n #[inline]\n fn from(value: (Box<[StatementListItem]>, LinearPosition)) -> Self {\n Self {\n statements: value.0,\n linear_pos_end: value.1,\n strict: false,\n }\n }\n}\n\nimpl From<(Vec, LinearPosition)> for StatementList {\n #[inline]\n fn from(value: (Vec, LinearPosition)) -> Self {\n Self {\n statements: value.0.into(),\n linear_pos_end: value.1,\n strict: false,\n }\n }\n}\n\nimpl Deref for StatementList {\n type Target = [StatementListItem];\n\n fn deref(&self) -> &Self::Target {\n &self.statements\n }\n}\n\nimpl ToIndentedString for StatementList {\n fn to_indented_string(&self, interner: &Interner, indentation: usize) -> String {\n let mut buf = String::new();\n // Print statements\n for item in &*self.statements {\n // We rely on the node to add the correct indent.\n buf.push_str(&item.to_indented_string(interner, indentation));\n\n buf.push('\\n');\n }\n buf\n }\n}\n\nimpl VisitWith for StatementList {\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n for statement in &*self.statements {\n visitor.visit_statement_list_item(statement)?;\n }\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n for statement in &mut *self.statements {\n visitor.visit_statement_list_item_mut(statement)?;\n }\n ControlFlow::Continue(())\n }\n}\n\n#[cfg(feature = \"arbitrary\")]\nimpl<'a> arbitrary::Arbitrary<'a> for StatementList {\n fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result {\n Ok(Self {\n statements: u.arbitrary()?,\n linear_pos_end: LinearPosition::default(),\n strict: false, // disable strictness; this is *not* in source data\n })\n }\n}\n" }, { "path": "core/ast/src/visitor.rs", "content": "//! ECMAScript Abstract Syntax Tree visitors.\n//!\n//! This module contains visitors which can be used to inspect or modify AST nodes. This allows for\n//! fine-grained manipulation of ASTs for analysis, rewriting, or instrumentation.\n\nuse std::ops::ControlFlow;\n\nuse crate::{\n Module, ModuleItem, ModuleItemList, Script, StatementList, StatementListItem,\n declaration::{\n Binding, Declaration, ExportDeclaration, ExportSpecifier, ImportAttribute,\n ImportDeclaration, ImportKind, ImportSpecifier, LexicalDeclaration, ModuleSpecifier,\n ReExportKind, VarDeclaration, Variable, VariableList,\n },\n expression::{\n Await, Call, Expression, Identifier, ImportCall, ImportMeta, New, NewTarget, Optional,\n OptionalOperation, OptionalOperationKind, Parenthesized, RegExpLiteral, Spread, SuperCall,\n TaggedTemplate, This, Yield,\n access::{\n PrivatePropertyAccess, PropertyAccess, PropertyAccessField, SimplePropertyAccess,\n SuperPropertyAccess,\n },\n literal::{\n ArrayLiteral, Literal, ObjectLiteral, ObjectMethodDefinition, PropertyDefinition,\n TemplateElement, TemplateLiteral,\n },\n operator::{\n Binary, BinaryInPrivate, Conditional, Unary, Update,\n assign::{Assign, AssignTarget},\n },\n },\n function::{\n ArrowFunction, AsyncArrowFunction, AsyncFunctionDeclaration, AsyncFunctionExpression,\n AsyncGeneratorDeclaration, AsyncGeneratorExpression, ClassDeclaration, ClassElement,\n ClassExpression, FormalParameter, FormalParameterList, FunctionBody, FunctionDeclaration,\n FunctionExpression, GeneratorDeclaration, GeneratorExpression, PrivateName,\n },\n pattern::{ArrayPattern, ArrayPatternElement, ObjectPattern, ObjectPatternElement, Pattern},\n property::PropertyName,\n statement::{\n Block, Case, Catch, Finally, If, Labelled, LabelledItem, Return, Statement, Switch, Throw,\n Try, With,\n iteration::{\n Break, Continue, DoWhileLoop, ForInLoop, ForLoop, ForLoopInitializer, ForOfLoop,\n IterableLoopInitializer, WhileLoop,\n },\n },\n};\nuse boa_interner::Sym;\n\n/// Creates the default visit function implementation for a particular type\nmacro_rules! define_visit {\n ($fn_name:ident, $type_name:ident) => {\n #[doc = concat!(\"Visits a `\", stringify!($type_name), \"` with this visitor\")]\n fn $fn_name(&mut self, node: &'ast $type_name) -> ControlFlow {\n node.visit_with(self)\n }\n };\n}\n\n/// Creates the default mutable visit function implementation for a particular type\nmacro_rules! define_visit_mut {\n ($fn_name:ident, $type_name:ident) => {\n #[doc = concat!(\"Visits a `\", stringify!($type_name), \"` with this visitor, mutably\")]\n fn $fn_name(&mut self, node: &'ast mut $type_name) -> ControlFlow {\n node.visit_with_mut(self)\n }\n };\n}\n\n/// Generates the `NodeRef` and `NodeMutRef` enums from a list of variants.\nmacro_rules! node_ref {\n (\n $(\n $Variant:ident\n ),*\n $(,)?\n ) => {\n /// A reference to a node visitable by a [`Visitor`].\n #[derive(Debug, Clone, Copy)]\n #[allow(missing_docs)]\n pub enum NodeRef<'a> {\n $(\n $Variant(&'a $Variant)\n ),*\n }\n\n $(\n impl<'a> From<&'a $Variant> for NodeRef<'a> {\n fn from(node: &'a $Variant) -> NodeRef<'a> {\n Self::$Variant(node)\n }\n }\n )*\n\n /// A mutable reference to a node visitable by a [`VisitorMut`].\n #[derive(Debug)]\n #[allow(missing_docs)]\n pub enum NodeRefMut<'a> {\n $(\n $Variant(&'a mut $Variant)\n ),*\n }\n\n $(\n impl<'a> From<&'a mut $Variant> for NodeRefMut<'a> {\n fn from(node: &'a mut $Variant) -> NodeRefMut<'a> {\n Self::$Variant(node)\n }\n }\n )*\n }\n}\n\nnode_ref! {\n Script,\n Module,\n FunctionBody,\n StatementList,\n StatementListItem,\n Statement,\n Declaration,\n FunctionExpression,\n FunctionDeclaration,\n GeneratorExpression,\n GeneratorDeclaration,\n AsyncFunctionExpression,\n AsyncFunctionDeclaration,\n AsyncGeneratorExpression,\n AsyncGeneratorDeclaration,\n ClassExpression,\n ClassDeclaration,\n LexicalDeclaration,\n Block,\n VarDeclaration,\n Expression,\n If,\n DoWhileLoop,\n WhileLoop,\n ForLoop,\n ForInLoop,\n ForOfLoop,\n Switch,\n Continue,\n Break,\n Return,\n Labelled,\n With,\n Throw,\n Try,\n This,\n NewTarget,\n ImportMeta,\n Identifier,\n FormalParameterList,\n ClassElement,\n PrivateName,\n VariableList,\n Variable,\n Binding,\n Pattern,\n Literal,\n RegExpLiteral,\n ArrayLiteral,\n ObjectLiteral,\n Spread,\n ArrowFunction,\n AsyncArrowFunction,\n TemplateLiteral,\n PropertyAccess,\n New,\n Call,\n SuperCall,\n ImportCall,\n Optional,\n TaggedTemplate,\n Assign,\n Unary,\n Update,\n Binary,\n BinaryInPrivate,\n Conditional,\n Await,\n Yield,\n Parenthesized,\n ForLoopInitializer,\n IterableLoopInitializer,\n Case,\n Sym,\n LabelledItem,\n Catch,\n Finally,\n FormalParameter,\n PropertyName,\n ObjectMethodDefinition,\n ObjectPattern,\n ArrayPattern,\n PropertyDefinition,\n TemplateElement,\n SimplePropertyAccess,\n PrivatePropertyAccess,\n SuperPropertyAccess,\n OptionalOperation,\n AssignTarget,\n ObjectPatternElement,\n ArrayPatternElement,\n PropertyAccessField,\n OptionalOperationKind,\n ModuleItemList,\n ModuleItem,\n ModuleSpecifier,\n ImportAttribute,\n ImportKind,\n ImportDeclaration,\n ImportSpecifier,\n ReExportKind,\n ExportDeclaration,\n ExportSpecifier,\n}\n\n/// Represents an AST visitor.\n///\n/// This implementation is based largely on [chalk](https://github.com/rust-lang/chalk/blob/23d39c90ceb9242fbd4c43e9368e813e7c2179f7/chalk-ir/src/visit.rs)'s\n/// visitor pattern.\npub trait Visitor<'ast>: Sized {\n /// Type which will be propagated from the visitor if completing early.\n type BreakTy;\n\n define_visit!(visit_script, Script);\n define_visit!(visit_module, Module);\n define_visit!(visit_function_body, FunctionBody);\n define_visit!(visit_statement_list, StatementList);\n define_visit!(visit_statement_list_item, StatementListItem);\n define_visit!(visit_statement, Statement);\n define_visit!(visit_declaration, Declaration);\n define_visit!(visit_function_expression, FunctionExpression);\n define_visit!(visit_function_declaration, FunctionDeclaration);\n define_visit!(visit_generator_expression, GeneratorExpression);\n define_visit!(visit_generator_declaration, GeneratorDeclaration);\n define_visit!(visit_async_function_expression, AsyncFunctionExpression);\n define_visit!(visit_async_function_declaration, AsyncFunctionDeclaration);\n define_visit!(visit_async_generator_expression, AsyncGeneratorExpression);\n define_visit!(visit_async_generator_declaration, AsyncGeneratorDeclaration);\n define_visit!(visit_class_expression, ClassExpression);\n define_visit!(visit_class_declaration, ClassDeclaration);\n define_visit!(visit_lexical_declaration, LexicalDeclaration);\n define_visit!(visit_block, Block);\n define_visit!(visit_var_declaration, VarDeclaration);\n define_visit!(visit_expression, Expression);\n define_visit!(visit_if, If);\n define_visit!(visit_do_while_loop, DoWhileLoop);\n define_visit!(visit_while_loop, WhileLoop);\n define_visit!(visit_for_loop, ForLoop);\n define_visit!(visit_for_in_loop, ForInLoop);\n define_visit!(visit_for_of_loop, ForOfLoop);\n define_visit!(visit_switch, Switch);\n define_visit!(visit_continue, Continue);\n define_visit!(visit_break, Break);\n define_visit!(visit_return, Return);\n define_visit!(visit_labelled, Labelled);\n define_visit!(visit_throw, Throw);\n define_visit!(visit_try, Try);\n define_visit!(visit_with, With);\n define_visit!(visit_this, This);\n define_visit!(visit_identifier, Identifier);\n define_visit!(visit_formal_parameter_list, FormalParameterList);\n define_visit!(visit_class_element, ClassElement);\n define_visit!(visit_private_name, PrivateName);\n define_visit!(visit_variable_list, VariableList);\n define_visit!(visit_variable, Variable);\n define_visit!(visit_binding, Binding);\n define_visit!(visit_pattern, Pattern);\n define_visit!(visit_literal, Literal);\n define_visit!(visit_reg_exp_literal, RegExpLiteral);\n define_visit!(visit_array_literal, ArrayLiteral);\n define_visit!(visit_object_literal, ObjectLiteral);\n define_visit!(visit_spread, Spread);\n define_visit!(visit_arrow_function, ArrowFunction);\n define_visit!(visit_async_arrow_function, AsyncArrowFunction);\n define_visit!(visit_template_literal, TemplateLiteral);\n define_visit!(visit_property_access, PropertyAccess);\n define_visit!(visit_new, New);\n define_visit!(visit_call, Call);\n define_visit!(visit_super_call, SuperCall);\n define_visit!(visit_import_call, ImportCall);\n define_visit!(visit_optional, Optional);\n define_visit!(visit_tagged_template, TaggedTemplate);\n define_visit!(visit_assign, Assign);\n define_visit!(visit_unary, Unary);\n define_visit!(visit_update, Update);\n define_visit!(visit_binary, Binary);\n define_visit!(visit_binary_in_private, BinaryInPrivate);\n define_visit!(visit_conditional, Conditional);\n define_visit!(visit_await, Await);\n define_visit!(visit_yield, Yield);\n define_visit!(visit_parenthesized, Parenthesized);\n define_visit!(visit_new_target, NewTarget);\n define_visit!(visit_import_meta, ImportMeta);\n define_visit!(visit_for_loop_initializer, ForLoopInitializer);\n define_visit!(visit_iterable_loop_initializer, IterableLoopInitializer);\n define_visit!(visit_case, Case);\n define_visit!(visit_sym, Sym);\n define_visit!(visit_labelled_item, LabelledItem);\n define_visit!(visit_catch, Catch);\n define_visit!(visit_finally, Finally);\n define_visit!(visit_formal_parameter, FormalParameter);\n define_visit!(visit_property_name, PropertyName);\n define_visit!(visit_object_method_definition, ObjectMethodDefinition);\n define_visit!(visit_object_pattern, ObjectPattern);\n define_visit!(visit_array_pattern, ArrayPattern);\n define_visit!(visit_property_definition, PropertyDefinition);\n define_visit!(visit_template_element, TemplateElement);\n define_visit!(visit_simple_property_access, SimplePropertyAccess);\n define_visit!(visit_private_property_access, PrivatePropertyAccess);\n define_visit!(visit_super_property_access, SuperPropertyAccess);\n define_visit!(visit_optional_operation, OptionalOperation);\n define_visit!(visit_assign_target, AssignTarget);\n define_visit!(visit_object_pattern_element, ObjectPatternElement);\n define_visit!(visit_array_pattern_element, ArrayPatternElement);\n define_visit!(visit_property_access_field, PropertyAccessField);\n define_visit!(visit_optional_operation_kind, OptionalOperationKind);\n define_visit!(visit_module_item_list, ModuleItemList);\n define_visit!(visit_module_item, ModuleItem);\n define_visit!(visit_module_specifier, ModuleSpecifier);\n define_visit!(visit_import_attribute, ImportAttribute);\n define_visit!(visit_import_kind, ImportKind);\n define_visit!(visit_import_declaration, ImportDeclaration);\n define_visit!(visit_import_specifier, ImportSpecifier);\n define_visit!(visit_re_export_kind, ReExportKind);\n define_visit!(visit_export_declaration, ExportDeclaration);\n define_visit!(visit_export_specifier, ExportSpecifier);\n\n /// Generic entry point for a node that is visitable by a `Visitor`.\n ///\n /// This is usually used for generic functions that need to visit an unnamed AST node.\n fn visit>>(&mut self, node: N) -> ControlFlow {\n let node = node.into();\n match node {\n NodeRef::Script(n) => self.visit_script(n),\n NodeRef::Module(n) => self.visit_module(n),\n NodeRef::FunctionBody(n) => self.visit_function_body(n),\n NodeRef::StatementList(n) => self.visit_statement_list(n),\n NodeRef::StatementListItem(n) => self.visit_statement_list_item(n),\n NodeRef::Statement(n) => self.visit_statement(n),\n NodeRef::Declaration(n) => self.visit_declaration(n),\n NodeRef::FunctionExpression(n) => self.visit_function_expression(n),\n NodeRef::FunctionDeclaration(n) => self.visit_function_declaration(n),\n NodeRef::GeneratorExpression(n) => self.visit_generator_expression(n),\n NodeRef::GeneratorDeclaration(n) => self.visit_generator_declaration(n),\n NodeRef::AsyncFunctionExpression(n) => self.visit_async_function_expression(n),\n NodeRef::AsyncFunctionDeclaration(n) => self.visit_async_function_declaration(n),\n NodeRef::AsyncGeneratorExpression(n) => self.visit_async_generator_expression(n),\n NodeRef::AsyncGeneratorDeclaration(n) => self.visit_async_generator_declaration(n),\n NodeRef::ClassExpression(n) => self.visit_class_expression(n),\n NodeRef::ClassDeclaration(n) => self.visit_class_declaration(n),\n NodeRef::LexicalDeclaration(n) => self.visit_lexical_declaration(n),\n NodeRef::Block(n) => self.visit_block(n),\n NodeRef::VarDeclaration(n) => self.visit_var_declaration(n),\n NodeRef::Expression(n) => self.visit_expression(n),\n NodeRef::If(n) => self.visit_if(n),\n NodeRef::DoWhileLoop(n) => self.visit_do_while_loop(n),\n NodeRef::WhileLoop(n) => self.visit_while_loop(n),\n NodeRef::ForLoop(n) => self.visit_for_loop(n),\n NodeRef::ForInLoop(n) => self.visit_for_in_loop(n),\n NodeRef::ForOfLoop(n) => self.visit_for_of_loop(n),\n NodeRef::Switch(n) => self.visit_switch(n),\n NodeRef::Continue(n) => self.visit_continue(n),\n NodeRef::Break(n) => self.visit_break(n),\n NodeRef::Return(n) => self.visit_return(n),\n NodeRef::Labelled(n) => self.visit_labelled(n),\n NodeRef::With(n) => self.visit_with(n),\n NodeRef::Throw(n) => self.visit_throw(n),\n NodeRef::Try(n) => self.visit_try(n),\n NodeRef::This(n) => self.visit_this(n),\n NodeRef::NewTarget(n) => self.visit_new_target(n),\n NodeRef::ImportMeta(n) => self.visit_import_meta(n),\n NodeRef::Identifier(n) => self.visit_identifier(n),\n NodeRef::FormalParameterList(n) => self.visit_formal_parameter_list(n),\n NodeRef::ClassElement(n) => self.visit_class_element(n),\n NodeRef::PrivateName(n) => self.visit_private_name(n),\n NodeRef::VariableList(n) => self.visit_variable_list(n),\n NodeRef::Variable(n) => self.visit_variable(n),\n NodeRef::Binding(n) => self.visit_binding(n),\n NodeRef::Pattern(n) => self.visit_pattern(n),\n NodeRef::Literal(n) => self.visit_literal(n),\n NodeRef::RegExpLiteral(n) => self.visit_reg_exp_literal(n),\n NodeRef::ArrayLiteral(n) => self.visit_array_literal(n),\n NodeRef::ObjectLiteral(n) => self.visit_object_literal(n),\n NodeRef::Spread(n) => self.visit_spread(n),\n NodeRef::ArrowFunction(n) => self.visit_arrow_function(n),\n NodeRef::AsyncArrowFunction(n) => self.visit_async_arrow_function(n),\n NodeRef::TemplateLiteral(n) => self.visit_template_literal(n),\n NodeRef::PropertyAccess(n) => self.visit_property_access(n),\n NodeRef::New(n) => self.visit_new(n),\n NodeRef::Call(n) => self.visit_call(n),\n NodeRef::SuperCall(n) => self.visit_super_call(n),\n NodeRef::ImportCall(n) => self.visit_import_call(n),\n NodeRef::Optional(n) => self.visit_optional(n),\n NodeRef::TaggedTemplate(n) => self.visit_tagged_template(n),\n NodeRef::Assign(n) => self.visit_assign(n),\n NodeRef::Unary(n) => self.visit_unary(n),\n NodeRef::Update(n) => self.visit_update(n),\n NodeRef::Binary(n) => self.visit_binary(n),\n NodeRef::BinaryInPrivate(n) => self.visit_binary_in_private(n),\n NodeRef::Conditional(n) => self.visit_conditional(n),\n NodeRef::Await(n) => self.visit_await(n),\n NodeRef::Yield(n) => self.visit_yield(n),\n NodeRef::Parenthesized(n) => self.visit_parenthesized(n),\n NodeRef::ForLoopInitializer(n) => self.visit_for_loop_initializer(n),\n NodeRef::IterableLoopInitializer(n) => self.visit_iterable_loop_initializer(n),\n NodeRef::Case(n) => self.visit_case(n),\n NodeRef::Sym(n) => self.visit_sym(n),\n NodeRef::LabelledItem(n) => self.visit_labelled_item(n),\n NodeRef::Catch(n) => self.visit_catch(n),\n NodeRef::Finally(n) => self.visit_finally(n),\n NodeRef::FormalParameter(n) => self.visit_formal_parameter(n),\n NodeRef::PropertyName(n) => self.visit_property_name(n),\n NodeRef::ObjectMethodDefinition(n) => self.visit_object_method_definition(n),\n NodeRef::ObjectPattern(n) => self.visit_object_pattern(n),\n NodeRef::ArrayPattern(n) => self.visit_array_pattern(n),\n NodeRef::PropertyDefinition(n) => self.visit_property_definition(n),\n NodeRef::TemplateElement(n) => self.visit_template_element(n),\n NodeRef::SimplePropertyAccess(n) => self.visit_simple_property_access(n),\n NodeRef::PrivatePropertyAccess(n) => self.visit_private_property_access(n),\n NodeRef::SuperPropertyAccess(n) => self.visit_super_property_access(n),\n NodeRef::OptionalOperation(n) => self.visit_optional_operation(n),\n NodeRef::AssignTarget(n) => self.visit_assign_target(n),\n NodeRef::ObjectPatternElement(n) => self.visit_object_pattern_element(n),\n NodeRef::ArrayPatternElement(n) => self.visit_array_pattern_element(n),\n NodeRef::PropertyAccessField(n) => self.visit_property_access_field(n),\n NodeRef::OptionalOperationKind(n) => self.visit_optional_operation_kind(n),\n NodeRef::ModuleItemList(n) => self.visit_module_item_list(n),\n NodeRef::ModuleItem(n) => self.visit_module_item(n),\n NodeRef::ModuleSpecifier(n) => self.visit_module_specifier(n),\n NodeRef::ImportAttribute(n) => self.visit_import_attribute(n),\n NodeRef::ImportKind(n) => self.visit_import_kind(n),\n NodeRef::ImportDeclaration(n) => self.visit_import_declaration(n),\n NodeRef::ImportSpecifier(n) => self.visit_import_specifier(n),\n NodeRef::ReExportKind(n) => self.visit_re_export_kind(n),\n NodeRef::ExportDeclaration(n) => self.visit_export_declaration(n),\n NodeRef::ExportSpecifier(n) => self.visit_export_specifier(n),\n }\n }\n}\n\n/// Represents an AST visitor which can modify AST content.\n///\n/// This implementation is based largely on [chalk](https://github.com/rust-lang/chalk/blob/23d39c90ceb9242fbd4c43e9368e813e7c2179f7/chalk-ir/src/visit.rs)'s\n/// visitor pattern.\npub trait VisitorMut<'ast>: Sized {\n /// Type which will be propagated from the visitor if completing early.\n type BreakTy;\n\n define_visit_mut!(visit_script_mut, Script);\n define_visit_mut!(visit_module_mut, Module);\n define_visit_mut!(visit_function_body_mut, FunctionBody);\n define_visit_mut!(visit_statement_list_mut, StatementList);\n define_visit_mut!(visit_statement_list_item_mut, StatementListItem);\n define_visit_mut!(visit_statement_mut, Statement);\n define_visit_mut!(visit_declaration_mut, Declaration);\n define_visit_mut!(visit_function_expression_mut, FunctionExpression);\n define_visit_mut!(visit_function_declaration_mut, FunctionDeclaration);\n define_visit_mut!(visit_generator_expression_mut, GeneratorExpression);\n define_visit_mut!(visit_generator_declaration_mut, GeneratorDeclaration);\n define_visit_mut!(visit_async_function_expression_mut, AsyncFunctionExpression);\n define_visit_mut!(\n visit_async_function_declaration_mut,\n AsyncFunctionDeclaration\n );\n define_visit_mut!(\n visit_async_generator_expression_mut,\n AsyncGeneratorExpression\n );\n define_visit_mut!(\n visit_async_generator_declaration_mut,\n AsyncGeneratorDeclaration\n );\n define_visit_mut!(visit_class_expression_mut, ClassExpression);\n define_visit_mut!(visit_class_declaration_mut, ClassDeclaration);\n define_visit_mut!(visit_lexical_declaration_mut, LexicalDeclaration);\n define_visit_mut!(visit_block_mut, Block);\n define_visit_mut!(visit_var_declaration_mut, VarDeclaration);\n define_visit_mut!(visit_expression_mut, Expression);\n define_visit_mut!(visit_if_mut, If);\n define_visit_mut!(visit_do_while_loop_mut, DoWhileLoop);\n define_visit_mut!(visit_while_loop_mut, WhileLoop);\n define_visit_mut!(visit_for_loop_mut, ForLoop);\n define_visit_mut!(visit_for_in_loop_mut, ForInLoop);\n define_visit_mut!(visit_for_of_loop_mut, ForOfLoop);\n define_visit_mut!(visit_switch_mut, Switch);\n define_visit_mut!(visit_continue_mut, Continue);\n define_visit_mut!(visit_break_mut, Break);\n define_visit_mut!(visit_return_mut, Return);\n define_visit_mut!(visit_labelled_mut, Labelled);\n define_visit_mut!(visit_throw_mut, Throw);\n define_visit_mut!(visit_try_mut, Try);\n define_visit_mut!(visit_with_mut, With);\n define_visit_mut!(visit_this_mut, This);\n define_visit_mut!(visit_identifier_mut, Identifier);\n define_visit_mut!(visit_formal_parameter_list_mut, FormalParameterList);\n define_visit_mut!(visit_class_element_mut, ClassElement);\n define_visit_mut!(visit_private_name_mut, PrivateName);\n define_visit_mut!(visit_variable_list_mut, VariableList);\n define_visit_mut!(visit_variable_mut, Variable);\n define_visit_mut!(visit_binding_mut, Binding);\n define_visit_mut!(visit_pattern_mut, Pattern);\n define_visit_mut!(visit_literal_mut, Literal);\n define_visit_mut!(visit_reg_exp_literal_mut, RegExpLiteral);\n define_visit_mut!(visit_array_literal_mut, ArrayLiteral);\n define_visit_mut!(visit_object_literal_mut, ObjectLiteral);\n define_visit_mut!(visit_spread_mut, Spread);\n define_visit_mut!(visit_arrow_function_mut, ArrowFunction);\n define_visit_mut!(visit_async_arrow_function_mut, AsyncArrowFunction);\n define_visit_mut!(visit_template_literal_mut, TemplateLiteral);\n define_visit_mut!(visit_property_access_mut, PropertyAccess);\n define_visit_mut!(visit_new_mut, New);\n define_visit_mut!(visit_call_mut, Call);\n define_visit_mut!(visit_super_call_mut, SuperCall);\n define_visit_mut!(visit_import_call_mut, ImportCall);\n define_visit_mut!(visit_optional_mut, Optional);\n define_visit_mut!(visit_tagged_template_mut, TaggedTemplate);\n define_visit_mut!(visit_assign_mut, Assign);\n define_visit_mut!(visit_unary_mut, Unary);\n define_visit_mut!(visit_update_mut, Update);\n define_visit_mut!(visit_binary_mut, Binary);\n define_visit_mut!(visit_binary_in_private_mut, BinaryInPrivate);\n define_visit_mut!(visit_conditional_mut, Conditional);\n define_visit_mut!(visit_await_mut, Await);\n define_visit_mut!(visit_yield_mut, Yield);\n define_visit_mut!(visit_parenthesized_mut, Parenthesized);\n define_visit_mut!(visit_new_target_mut, NewTarget);\n define_visit_mut!(visit_import_meta_mut, ImportMeta);\n define_visit_mut!(visit_for_loop_initializer_mut, ForLoopInitializer);\n define_visit_mut!(visit_iterable_loop_initializer_mut, IterableLoopInitializer);\n define_visit_mut!(visit_case_mut, Case);\n define_visit_mut!(visit_sym_mut, Sym);\n define_visit_mut!(visit_labelled_item_mut, LabelledItem);\n define_visit_mut!(visit_catch_mut, Catch);\n define_visit_mut!(visit_finally_mut, Finally);\n define_visit_mut!(visit_formal_parameter_mut, FormalParameter);\n define_visit_mut!(visit_property_name_mut, PropertyName);\n define_visit_mut!(visit_object_method_definition_mut, ObjectMethodDefinition);\n define_visit_mut!(visit_object_pattern_mut, ObjectPattern);\n define_visit_mut!(visit_array_pattern_mut, ArrayPattern);\n define_visit_mut!(visit_property_definition_mut, PropertyDefinition);\n define_visit_mut!(visit_template_element_mut, TemplateElement);\n define_visit_mut!(visit_simple_property_access_mut, SimplePropertyAccess);\n define_visit_mut!(visit_private_property_access_mut, PrivatePropertyAccess);\n define_visit_mut!(visit_super_property_access_mut, SuperPropertyAccess);\n define_visit_mut!(visit_optional_operation_mut, OptionalOperation);\n define_visit_mut!(visit_assign_target_mut, AssignTarget);\n define_visit_mut!(visit_object_pattern_element_mut, ObjectPatternElement);\n define_visit_mut!(visit_array_pattern_element_mut, ArrayPatternElement);\n define_visit_mut!(visit_property_access_field_mut, PropertyAccessField);\n define_visit_mut!(visit_optional_operation_kind_mut, OptionalOperationKind);\n define_visit_mut!(visit_module_item_list_mut, ModuleItemList);\n define_visit_mut!(visit_module_item_mut, ModuleItem);\n define_visit_mut!(visit_module_specifier_mut, ModuleSpecifier);\n define_visit_mut!(visit_import_attribute_mut, ImportAttribute);\n define_visit_mut!(visit_import_kind_mut, ImportKind);\n define_visit_mut!(visit_import_declaration_mut, ImportDeclaration);\n define_visit_mut!(visit_import_specifier_mut, ImportSpecifier);\n define_visit_mut!(visit_re_export_kind_mut, ReExportKind);\n define_visit_mut!(visit_export_declaration_mut, ExportDeclaration);\n define_visit_mut!(visit_export_specifier_mut, ExportSpecifier);\n\n /// Generic entry point for a node that is visitable by a `VisitorMut`.\n ///\n /// This is usually used for generic functions that need to visit an unnamed AST node.\n fn visit>>(&mut self, node: N) -> ControlFlow {\n let node = node.into();\n match node {\n NodeRefMut::Script(n) => self.visit_script_mut(n),\n NodeRefMut::Module(n) => self.visit_module_mut(n),\n NodeRefMut::FunctionBody(n) => self.visit_function_body_mut(n),\n NodeRefMut::StatementList(n) => self.visit_statement_list_mut(n),\n NodeRefMut::StatementListItem(n) => self.visit_statement_list_item_mut(n),\n NodeRefMut::Statement(n) => self.visit_statement_mut(n),\n NodeRefMut::Declaration(n) => self.visit_declaration_mut(n),\n NodeRefMut::FunctionExpression(n) => self.visit_function_expression_mut(n),\n NodeRefMut::FunctionDeclaration(n) => self.visit_function_declaration_mut(n),\n NodeRefMut::GeneratorExpression(n) => self.visit_generator_expression_mut(n),\n NodeRefMut::GeneratorDeclaration(n) => self.visit_generator_declaration_mut(n),\n NodeRefMut::AsyncFunctionExpression(n) => self.visit_async_function_expression_mut(n),\n NodeRefMut::AsyncFunctionDeclaration(n) => self.visit_async_function_declaration_mut(n),\n NodeRefMut::AsyncGeneratorExpression(n) => self.visit_async_generator_expression_mut(n),\n NodeRefMut::AsyncGeneratorDeclaration(n) => {\n self.visit_async_generator_declaration_mut(n)\n }\n NodeRefMut::ClassExpression(n) => self.visit_class_expression_mut(n),\n NodeRefMut::ClassDeclaration(n) => self.visit_class_declaration_mut(n),\n NodeRefMut::LexicalDeclaration(n) => self.visit_lexical_declaration_mut(n),\n NodeRefMut::Block(n) => self.visit_block_mut(n),\n NodeRefMut::VarDeclaration(n) => self.visit_var_declaration_mut(n),\n NodeRefMut::Expression(n) => self.visit_expression_mut(n),\n NodeRefMut::If(n) => self.visit_if_mut(n),\n NodeRefMut::DoWhileLoop(n) => self.visit_do_while_loop_mut(n),\n NodeRefMut::WhileLoop(n) => self.visit_while_loop_mut(n),\n NodeRefMut::ForLoop(n) => self.visit_for_loop_mut(n),\n NodeRefMut::ForInLoop(n) => self.visit_for_in_loop_mut(n),\n NodeRefMut::ForOfLoop(n) => self.visit_for_of_loop_mut(n),\n NodeRefMut::Switch(n) => self.visit_switch_mut(n),\n NodeRefMut::Continue(n) => self.visit_continue_mut(n),\n NodeRefMut::Break(n) => self.visit_break_mut(n),\n NodeRefMut::Return(n) => self.visit_return_mut(n),\n NodeRefMut::Labelled(n) => self.visit_labelled_mut(n),\n NodeRefMut::With(n) => self.visit_with_mut(n),\n NodeRefMut::Throw(n) => self.visit_throw_mut(n),\n NodeRefMut::Try(n) => self.visit_try_mut(n),\n NodeRefMut::This(n) => self.visit_this_mut(n),\n NodeRefMut::NewTarget(n) => self.visit_new_target_mut(n),\n NodeRefMut::ImportMeta(n) => self.visit_import_meta_mut(n),\n NodeRefMut::Identifier(n) => self.visit_identifier_mut(n),\n NodeRefMut::FormalParameterList(n) => self.visit_formal_parameter_list_mut(n),\n NodeRefMut::ClassElement(n) => self.visit_class_element_mut(n),\n NodeRefMut::PrivateName(n) => self.visit_private_name_mut(n),\n NodeRefMut::VariableList(n) => self.visit_variable_list_mut(n),\n NodeRefMut::Variable(n) => self.visit_variable_mut(n),\n NodeRefMut::Binding(n) => self.visit_binding_mut(n),\n NodeRefMut::Pattern(n) => self.visit_pattern_mut(n),\n NodeRefMut::Literal(n) => self.visit_literal_mut(n),\n NodeRefMut::RegExpLiteral(n) => self.visit_reg_exp_literal_mut(n),\n NodeRefMut::ArrayLiteral(n) => self.visit_array_literal_mut(n),\n NodeRefMut::ObjectLiteral(n) => self.visit_object_literal_mut(n),\n NodeRefMut::Spread(n) => self.visit_spread_mut(n),\n NodeRefMut::ArrowFunction(n) => self.visit_arrow_function_mut(n),\n NodeRefMut::AsyncArrowFunction(n) => self.visit_async_arrow_function_mut(n),\n NodeRefMut::TemplateLiteral(n) => self.visit_template_literal_mut(n),\n NodeRefMut::PropertyAccess(n) => self.visit_property_access_mut(n),\n NodeRefMut::New(n) => self.visit_new_mut(n),\n NodeRefMut::Call(n) => self.visit_call_mut(n),\n NodeRefMut::SuperCall(n) => self.visit_super_call_mut(n),\n NodeRefMut::ImportCall(n) => self.visit_import_call_mut(n),\n NodeRefMut::Optional(n) => self.visit_optional_mut(n),\n NodeRefMut::TaggedTemplate(n) => self.visit_tagged_template_mut(n),\n NodeRefMut::Assign(n) => self.visit_assign_mut(n),\n NodeRefMut::Unary(n) => self.visit_unary_mut(n),\n NodeRefMut::Update(n) => self.visit_update_mut(n),\n NodeRefMut::Binary(n) => self.visit_binary_mut(n),\n NodeRefMut::BinaryInPrivate(n) => self.visit_binary_in_private_mut(n),\n NodeRefMut::Conditional(n) => self.visit_conditional_mut(n),\n NodeRefMut::Await(n) => self.visit_await_mut(n),\n NodeRefMut::Yield(n) => self.visit_yield_mut(n),\n NodeRefMut::Parenthesized(n) => self.visit_parenthesized_mut(n),\n NodeRefMut::ForLoopInitializer(n) => self.visit_for_loop_initializer_mut(n),\n NodeRefMut::IterableLoopInitializer(n) => self.visit_iterable_loop_initializer_mut(n),\n NodeRefMut::Case(n) => self.visit_case_mut(n),\n NodeRefMut::Sym(n) => self.visit_sym_mut(n),\n NodeRefMut::LabelledItem(n) => self.visit_labelled_item_mut(n),\n NodeRefMut::Catch(n) => self.visit_catch_mut(n),\n NodeRefMut::Finally(n) => self.visit_finally_mut(n),\n NodeRefMut::FormalParameter(n) => self.visit_formal_parameter_mut(n),\n NodeRefMut::PropertyName(n) => self.visit_property_name_mut(n),\n NodeRefMut::ObjectMethodDefinition(n) => self.visit_object_method_definition_mut(n),\n NodeRefMut::ObjectPattern(n) => self.visit_object_pattern_mut(n),\n NodeRefMut::ArrayPattern(n) => self.visit_array_pattern_mut(n),\n NodeRefMut::PropertyDefinition(n) => self.visit_property_definition_mut(n),\n NodeRefMut::TemplateElement(n) => self.visit_template_element_mut(n),\n NodeRefMut::SimplePropertyAccess(n) => self.visit_simple_property_access_mut(n),\n NodeRefMut::PrivatePropertyAccess(n) => self.visit_private_property_access_mut(n),\n NodeRefMut::SuperPropertyAccess(n) => self.visit_super_property_access_mut(n),\n NodeRefMut::OptionalOperation(n) => self.visit_optional_operation_mut(n),\n NodeRefMut::AssignTarget(n) => self.visit_assign_target_mut(n),\n NodeRefMut::ObjectPatternElement(n) => self.visit_object_pattern_element_mut(n),\n NodeRefMut::ArrayPatternElement(n) => self.visit_array_pattern_element_mut(n),\n NodeRefMut::PropertyAccessField(n) => self.visit_property_access_field_mut(n),\n NodeRefMut::OptionalOperationKind(n) => self.visit_optional_operation_kind_mut(n),\n NodeRefMut::ModuleItemList(n) => self.visit_module_item_list_mut(n),\n NodeRefMut::ModuleItem(n) => self.visit_module_item_mut(n),\n NodeRefMut::ModuleSpecifier(n) => self.visit_module_specifier_mut(n),\n NodeRefMut::ImportAttribute(n) => self.visit_import_attribute_mut(n),\n NodeRefMut::ImportKind(n) => self.visit_import_kind_mut(n),\n NodeRefMut::ImportDeclaration(n) => self.visit_import_declaration_mut(n),\n NodeRefMut::ImportSpecifier(n) => self.visit_import_specifier_mut(n),\n NodeRefMut::ReExportKind(n) => self.visit_re_export_kind_mut(n),\n NodeRefMut::ExportDeclaration(n) => self.visit_export_declaration_mut(n),\n NodeRefMut::ExportSpecifier(n) => self.visit_export_specifier_mut(n),\n }\n }\n}\n\n/// Denotes that a type may be visited, providing a method which allows a visitor to traverse its\n/// private fields.\npub trait VisitWith {\n /// Visit this node with the provided visitor.\n fn visit_with<'a, V>(&'a self, visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>;\n\n /// Visit this node with the provided visitor mutably, allowing the visitor to modify private\n /// fields.\n fn visit_with_mut<'a, V>(&'a mut self, visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>;\n}\n\n// implementation for Sym as it is out-of-crate\nimpl VisitWith for Sym {\n fn visit_with<'a, V>(&'a self, _visitor: &mut V) -> ControlFlow\n where\n V: Visitor<'a>,\n {\n ControlFlow::Continue(())\n }\n\n fn visit_with_mut<'a, V>(&'a mut self, _visitor: &mut V) -> ControlFlow\n where\n V: VisitorMut<'a>,\n {\n ControlFlow::Continue(())\n }\n}\n" }, { "path": "core/ast/tests/scope.rs", "content": "//! Tests for the scope analysis of the AST.\n\n#![allow(unused_crate_dependencies)]\n\nuse boa_ast::{\n Declaration, Expression, LinearPosition, LinearSpan, Script, Span, Statement, StatementList,\n StatementListItem,\n declaration::{LexicalDeclaration, Variable},\n expression::Identifier,\n function::{FormalParameter, FormalParameterList, FunctionBody, FunctionDeclaration},\n scope::Scope,\n statement::Block,\n};\nuse boa_interner::Interner;\nuse boa_string::JsString;\n\n#[test]\nfn empty_script_is_ok() {\n let scope = &Scope::new_global();\n let mut script = Script::default();\n let ok = script.analyze_scope(scope, &Interner::new()).is_ok();\n assert!(ok);\n assert_eq!(scope.num_bindings(), 0);\n}\n\n#[test]\nfn script_global_let() {\n let scope = Scope::new_global();\n let mut interner = Interner::new();\n let a = interner.get_or_intern(\"a\");\n let mut script = Script::new(StatementList::new(\n [Declaration::Lexical(LexicalDeclaration::Let(\n vec![Variable::from_identifier(\n Identifier::new(a, Span::new((1, 1), (1, 1))),\n None,\n )]\n .try_into()\n .unwrap(),\n ))\n .into()],\n LinearPosition::default(),\n false,\n ));\n let ok = script.analyze_scope(&scope, &interner).is_ok();\n assert!(ok);\n assert_eq!(scope.num_bindings(), 1);\n let a = scope.get_binding_reference(&JsString::from(\"a\")).unwrap();\n assert!(!a.is_global_object());\n assert!(a.is_lexical());\n assert!(!a.local());\n}\n\n#[test]\nfn script_global_const() {\n let scope = Scope::new_global();\n let mut interner = Interner::new();\n let a = interner.get_or_intern(\"a\");\n let mut script = Script::new(StatementList::new(\n [Declaration::Lexical(LexicalDeclaration::Const(\n vec![Variable::from_identifier(\n Identifier::new(a, Span::new((1, 1), (1, 1))),\n None,\n )]\n .try_into()\n .unwrap(),\n ))\n .into()],\n LinearPosition::default(),\n false,\n ));\n let ok = script.analyze_scope(&scope, &interner).is_ok();\n assert!(ok);\n assert_eq!(scope.num_bindings(), 1);\n let a = scope.get_binding_reference(&JsString::from(\"a\")).unwrap();\n assert!(!a.is_global_object());\n assert!(a.is_lexical());\n assert!(!a.local());\n}\n\n#[test]\nfn script_block_let() {\n let scope = Scope::new_global();\n let mut interner = Interner::new();\n let a = interner.get_or_intern(\"a\");\n let mut script = Script::new(StatementList::new(\n [Statement::Block(Block::from((\n vec![\n Declaration::Lexical(LexicalDeclaration::Let(\n vec![Variable::from_identifier(\n Identifier::new(a, Span::new((1, 1), (1, 1))),\n None,\n )]\n .try_into()\n .unwrap(),\n ))\n .into(),\n ],\n LinearPosition::default(),\n )))\n .into()],\n LinearPosition::default(),\n false,\n ));\n let ok = script.analyze_scope(&scope, &interner).is_ok();\n assert!(ok);\n assert_eq!(scope.num_bindings(), 0);\n let StatementListItem::Statement(statement) = script.statements().first().unwrap() else {\n panic!(\"Expected a block statement\");\n };\n let Statement::Block(block) = statement.as_ref() else {\n panic!(\"Expected a block statement\");\n };\n let scope = block.scope().unwrap();\n assert_eq!(scope.num_bindings(), 1);\n let a = scope.get_binding_reference(&JsString::from(\"a\")).unwrap();\n assert!(!a.is_global_object());\n assert!(a.is_lexical());\n assert!(a.local());\n}\n\n#[test]\nfn script_function_mapped_arguments_not_accessed() {\n let scope = Scope::new_global();\n let mut interner = Interner::new();\n let f = interner.get_or_intern(\"f\");\n let a = interner.get_or_intern(\"a\");\n let mut script = Script::new(StatementList::new(\n [Declaration::FunctionDeclaration(FunctionDeclaration::new(\n Identifier::new(f, Span::new((1, 1), (1, 1))),\n FormalParameterList::from_parameters(vec![FormalParameter::new(\n Variable::from_identifier(Identifier::new(a, Span::new((1, 1), (1, 1))), None),\n false,\n )]),\n FunctionBody::new(\n StatementList::new(\n [Declaration::Lexical(LexicalDeclaration::Let(\n vec![Variable::from_identifier(\n Identifier::new(a, Span::new((1, 1), (1, 1))),\n None,\n )]\n .try_into()\n .unwrap(),\n ))\n .into()],\n LinearPosition::default(),\n false,\n ),\n Span::new((1, 1), (1, 1)),\n ),\n LinearSpan::default(),\n ))\n .into()],\n LinearPosition::default(),\n false,\n ));\n let ok = script.analyze_scope(&scope, &interner).is_ok();\n assert!(ok);\n assert_eq!(scope.num_bindings(), 0);\n\n let StatementListItem::Declaration(declaration) = script.statements().first().unwrap() else {\n panic!(\"Expected a block statement\");\n };\n let Declaration::FunctionDeclaration(f) = declaration.as_ref() else {\n panic!(\"Expected a block statement\");\n };\n\n assert_eq!(f.scopes().function_scope().num_bindings(), 2);\n assert_eq!(f.scopes().parameters_eval_scope(), None);\n assert_eq!(f.scopes().parameters_scope(), None);\n assert_eq!(f.scopes().lexical_scope().unwrap().num_bindings(), 1);\n let arguments = f\n .scopes()\n .function_scope()\n .get_binding_reference(&JsString::from(\"arguments\"))\n .unwrap();\n assert!(!f.scopes().arguments_object_accessed());\n assert!(!arguments.is_global_object());\n assert!(arguments.is_lexical());\n assert!(arguments.local());\n let a = f\n .scopes()\n .function_scope()\n .get_binding_reference(&JsString::from(\"a\"))\n .unwrap();\n assert!(!a.is_global_object());\n assert!(a.is_lexical());\n assert!(a.local());\n let a = f\n .scopes()\n .lexical_scope()\n .unwrap()\n .get_binding_reference(&JsString::from(\"a\"))\n .unwrap();\n assert!(!a.is_global_object());\n assert!(a.is_lexical());\n assert!(a.local());\n}\n\n#[test]\nfn script_function_mapped_arguments_accessed() {\n let scope = Scope::new_global();\n let mut interner = Interner::new();\n let f = interner.get_or_intern(\"f\");\n let a = interner.get_or_intern(\"a\");\n let arguments = interner.get_or_intern(\"arguments\");\n let mut script = Script::new(StatementList::new(\n [Declaration::FunctionDeclaration(FunctionDeclaration::new(\n Identifier::new(f, Span::new((1, 1), (1, 1))),\n FormalParameterList::from_parameters(vec![FormalParameter::new(\n Variable::from_identifier(Identifier::new(a, Span::new((1, 1), (1, 1))), None),\n false,\n )]),\n FunctionBody::new(\n StatementList::new(\n [\n Declaration::Lexical(LexicalDeclaration::Let(\n vec![Variable::from_identifier(\n Identifier::new(a, Span::new((1, 1), (1, 1))),\n None,\n )]\n .try_into()\n .unwrap(),\n ))\n .into(),\n Statement::Expression(Expression::Identifier(Identifier::new(\n arguments,\n Span::new((1, 1), (1, 1)),\n )))\n .into(),\n ],\n LinearPosition::default(),\n false,\n ),\n Span::new((1, 1), (1, 1)),\n ),\n LinearSpan::default(),\n ))\n .into()],\n LinearPosition::default(),\n false,\n ));\n let ok = script.analyze_scope(&scope, &interner).is_ok();\n assert!(ok);\n assert_eq!(scope.num_bindings(), 0);\n let StatementListItem::Declaration(declaration) = script.statements().first().unwrap() else {\n panic!(\"Expected a block statement\");\n };\n let Declaration::FunctionDeclaration(f) = declaration.as_ref() else {\n panic!(\"Expected a block statement\");\n };\n assert!(f.scopes().arguments_object_accessed());\n assert_eq!(f.scopes().function_scope().num_bindings(), 2);\n assert_eq!(f.scopes().parameters_eval_scope(), None);\n assert_eq!(f.scopes().parameters_scope(), None);\n assert_eq!(f.scopes().lexical_scope().unwrap().num_bindings(), 1);\n let arguments = f\n .scopes()\n .function_scope()\n .get_binding_reference(&JsString::from(\"arguments\"))\n .unwrap();\n assert!(!arguments.is_global_object());\n assert!(arguments.is_lexical());\n assert!(arguments.local());\n let a = f\n .scopes()\n .function_scope()\n .get_binding_reference(&JsString::from(\"a\"))\n .unwrap();\n assert!(!a.is_global_object());\n assert!(a.is_lexical());\n assert!(!a.local());\n let a = f\n .scopes()\n .lexical_scope()\n .unwrap()\n .get_binding_reference(&JsString::from(\"a\"))\n .unwrap();\n assert!(!a.is_global_object());\n assert!(a.is_lexical());\n assert!(a.local());\n}\n\n#[test]\nfn multiple_scopes_with_same_parent_have_distinct_ids() {\n let global = Scope::new_global();\n let child1 = Scope::new(global.clone(), false);\n let child2 = Scope::new(global.clone(), false);\n let child3 = Scope::new(child1.clone(), false);\n let child4 = Scope::new(child1.clone(), false);\n\n // Check uniqueness by inserting in a set and asserting that there are\n // 5 elements numbered from 0 to 4.\n let mut ids = [global, child1, child2, child3, child4]\n .into_iter()\n .map(|scope| scope.unique_id())\n .collect::>();\n ids.sort_unstable();\n\n assert_eq!(ids, vec![0, 1, 2, 3, 4]);\n}\n\n#[test]\nfn can_correlate_binding_to_scope() {\n // GIVEN\n let global = Scope::new_global();\n let child1 = Scope::new(global.clone(), false);\n let child2 = Scope::new(child1.clone(), false);\n let _unused = child1.create_mutable_binding(\"x\".into(), false);\n\n // WHEN\n let binding = child2.get_identifier_reference(\"x\".into());\n\n // THEN\n assert_eq!(binding.locator().unique_scope_id(), child1.unique_id());\n}\n" }, { "path": "core/engine/ABOUT.md", "content": "# About Boa\n\nBoa is an open-source, experimental ECMAScript Engine written in Rust for\nlexing, parsing and executing ECMAScript/JavaScript. Currently, Boa supports some\nof the [language][boa-conformance]. More information can be viewed at [Boa's\nwebsite][boa-web].\n\nTry out the most recent release with Boa's live demo\n[playground][boa-playground].\n\n## Boa Crates\n\n- [**`boa_cli`**][cli] - Boa's CLI && REPL implementation\n- [**`boa_ast`**][ast] - Boa's ECMAScript Abstract Syntax Tree.\n- [**`boa_engine`**][engine] - Boa's implementation of ECMAScript builtin objects and execution.\n- [**`boa_gc`**][gc] - Boa's garbage collector.\n- [**`boa_icu_provider`**][icu] - Boa's ICU4X data provider.\n- [**`boa_interner`**][interner] - Boa's string interner.\n- [**`boa_macros`**][macros] - Boa's macros.\n- [**`boa_parser`**][parser] - Boa's lexer and parser.\n- [**`boa_runtime`**][runtime] - Boa's `WebAPI` features.\n- [**`boa_string`**][string] - Boa's ECMAScript string implementation.\n- [**`boa_wintertc`**][wintertc] - Boa's `WinterTC` (TC55) Minimum Common Web API implementation.\n- [**`tag_ptr`**][tag_ptr] - Utility library that enables a pointer to be associated with a tag of type `usize`.\n- [**`small_btree`**][small_btree] - Utility library that adds the `SmallBTreeMap` data structure.\n\n[boa-conformance]: https://boajs.dev/conformance\n[boa-web]: https://boajs.dev/\n[boa-playground]: https://boajs.dev/playground\n[ast]: https://docs.rs/boa_ast/latest/boa_ast/index.html\n[engine]: https://docs.rs/boa_engine/latest/boa_engine/index.html\n[gc]: https://docs.rs/boa_gc/latest/boa_gc/index.html\n[interner]: https://docs.rs/boa_interner/latest/boa_interner/index.html\n[parser]: https://docs.rs/boa_parser/latest/boa_parser/index.html\n[icu]: https://docs.rs/boa_icu_provider/latest/boa_icu_provider/index.html\n[runtime]: https://docs.rs/boa_runtime/latest/boa_runtime/index.html\n[string]: https://docs.rs/boa_string/latest/boa_string/index.html\n[wintertc]: https://docs.rs/boa_wintertc/latest/boa_wintertc/index.html\n[tag_ptr]: https://docs.rs/tag_ptr/latest/tag_ptr/index.html\n[small_btree]: https://docs.rs/small_btree/latest/small_btree/index.html\n[macros]: https://docs.rs/boa_macros/latest/boa_macros/index.html\n[cli]: https://crates.io/crates/boa_cli\n" }, { "path": "core/engine/Cargo.toml", "content": "[package]\nname = \"boa_engine\"\nkeywords = [\"javascript\", \"js\", \"compiler\", \"lexer\", \"parser\"]\ncategories = [\"parser-implementations\", \"compilers\"]\nreadme = \"../../README.md\"\ndescription.workspace = true\nversion.workspace = true\nedition.workspace = true\nauthors.workspace = true\nlicense.workspace = true\nrepository.workspace = true\nrust-version.workspace = true\n\n[features]\ndefault = [\"float16\", \"xsum\", \"temporal\"]\n\nembedded_lz4 = [\"boa_macros/embedded_lz4\", \"lz4_flex\"]\n\n# Replace the NaN-boxing implementation of `JsValueInner` with an\n# enum-based implementation. This implementation is less performant\n# but compatible with more platforms.\n# If you encounter the \"assertion left == right failed: Pointer is\n# not 4-bits aligned or over 51-bits.\" error, try this feature.\n# For more details, see https://github.com/boa-dev/boa/issues/4275\n# Disabled by default.\njsvalue-enum = []\ndeser = [\"boa_interner/serde\", \"boa_ast/serde\"]\neither = [\"dep:either\", \"boa_gc/either\"]\n\n# Enables the `Intl` builtin object and bundles a default ICU4X data provider.\n# Prefer this over `intl` if you just want to enable `Intl` without dealing with the\n# generation of ICU4X data.\nintl_bundled = [\"intl\", \"dep:boa_icu_provider\"]\n\n# Enables Boa's `Intl` builtin implementation.\n# Prefer this over `intl_bundled` if you want to reduce the size of the final binary\n# by providing a smaller ICU4X data provider.\nintl = [\n \"boa_gc/icu\",\n \"icu_normalizer/serde\",\n \"dep:icu_locale\",\n \"dep:icu_datetime\",\n \"dep:icu_time\",\n \"dep:icu_plurals\",\n \"dep:icu_provider\",\n \"dep:icu_calendar\",\n \"dep:icu_collator\",\n \"dep:icu_casemap\",\n \"dep:icu_list\",\n \"dep:icu_segmenter\",\n \"dep:icu_decimal\",\n \"dep:writeable\",\n \"dep:sys-locale\",\n \"dep:yoke\",\n \"dep:zerofrom\",\n \"dep:fixed_decimal\",\n \"dep:tinystr\",\n \"dep:timezone_provider\",\n \"timezone_provider/experimental_tzif\",\n]\n\nfuzz = [\"boa_ast/arbitrary\", \"boa_interner/arbitrary\"]\n\n# Enable Boa's VM instruction flowgraph generator.\nflowgraph = []\n\n# Enable Boa's VM instruction tracing.\ntrace = [\"js\"]\n\n# Enable Boa's additional ECMAScript features for web browsers.\nannex-b = [\"boa_ast/annex-b\", \"boa_parser/annex-b\"]\n\n# Enable Boa's Temporal proposal implementation\ntemporal = [\"dep:icu_calendar\", \"dep:temporal_rs\", \"dep:timezone_provider\", \"timezone_provider/experimental_tzif\"]\n\n#Enable access to host system timezone\nsystem-time-zone = [\"dep:iana-time-zone\"]\n\n# Enable experimental features, like Stage 3 proposals.\nexperimental = []\n\n# Enable binding to JS APIs for system related utilities.\njs = [\"dep:web-time\", \"dep:getrandom\", \"getrandom/wasm_js\", \"time/wasm-bindgen\"]\n\n# Enable support for Float16 typed arrays\nfloat16 = [\"dep:float16\"]\n\n# Enable support for `Math.sumPrecise`\nxsum = [\"dep:xsum\"]\n\n# Native Backtraces\nnative-backtrace = []\n\n[dependencies]\ntag_ptr.workspace = true\nboa_interner.workspace = true\nboa_gc = { workspace = true, features = [\"thin-vec\", \"boa_string\", \"arrayvec\"] }\nboa_macros.workspace = true\nboa_ast.workspace = true\nboa_parser.workspace = true\nboa_string.workspace = true\ncow-utils.workspace = true\nfutures-lite.workspace = true\nfloat16 = { version = \"0.1\", optional = true }\nlz4_flex = { workspace = true, optional = true }\nxsum = { version = \"0.1.6\", optional = true }\nserde = { workspace = true, features = [\"derive\", \"rc\"] }\nserde_json.workspace = true\nrand.workspace = true\nnum-traits.workspace = true\nregress.workspace = true\nrustc-hash = { workspace = true, features = [\"std\"] }\nnum-bigint = { workspace = true, features = [\"serde\"] }\nnum-integer.workspace = true\nbitflags.workspace = true\nindexmap = { workspace = true, features = [\"std\"] }\nryu-js.workspace = true\nfast-float2.workspace = true\ntap.workspace = true\nsmall_btree.workspace = true\npaste.workspace = true\nthiserror.workspace = true\ndashmap.workspace = true\nnum_enum.workspace = true\nthin-vec.workspace = true\nitertools = { workspace = true, default-features = false, features = [\"use_alloc\"] }\nicu_normalizer = { workspace = true, features = [\n \"compiled_data\",\n \"utf16_iter\",\n] }\nportable-atomic.workspace = true\nbytemuck = { workspace = true, features = [\"derive\"] }\narrayvec.workspace = true\nintrusive-collections.workspace = true\ncfg-if.workspace = true\ntime.workspace = true\nhashbrown.workspace = true\neither = { workspace = true, optional = true }\nstatic_assertions.workspace = true\naligned-vec.workspace = true\ndynify = { workspace = true, features = [\"macros\"] }\nfutures-concurrency.workspace = true\noneshot = { workspace = true, features = [\"async\"] }\nasync-channel.workspace = true\n\n# intl deps\nboa_icu_provider = { workspace = true, features = [\"std\"], optional = true }\nsys-locale = { workspace = true, optional = true }\nicu_provider = { workspace = true, optional = true }\nicu_locale = { workspace = true, default-features = false, features = [\n \"serde\",\n], optional = true }\nicu_datetime = { workspace = true, default-features = false, features = [\n \"serde\",\n], optional = true }\nicu_time = { workspace = true, default-features = false, features = [\n \"serde\",\n], optional = true }\nicu_calendar = { workspace = true, default-features = false, optional = true }\nicu_collator = { workspace = true, default-features = false, features = [\n \"serde\",\n], optional = true }\nicu_plurals = { workspace = true, default-features = false, features = [\n \"serde\",\n \"experimental\",\n], optional = true }\nicu_list = { workspace = true, default-features = false, features = [\n \"serde\",\n \"alloc\",\n], optional = true }\nicu_casemap = { workspace = true, default-features = false, features = [\n \"serde\",\n], optional = true }\nicu_segmenter = { workspace = true, default-features = false, features = [\n \"auto\",\n \"serde\",\n], optional = true }\nicu_decimal = { workspace = true, default-features = false, features = [\n \"serde\",\n], optional = true }\nwriteable = { workspace = true, optional = true }\nyoke = { workspace = true, optional = true }\nzerofrom = { workspace = true, optional = true }\nfixed_decimal = { workspace = true, features = [\n \"ryu\",\n], optional = true }\ntinystr = { workspace = true, optional = true }\n\n# temporal deps\ntemporal_rs = { workspace = true, optional = true }\ntimezone_provider = { workspace = true, optional = true }\niana-time-zone = { workspace = true, optional = true }\n\n[target.'cfg(all(target_family = \"wasm\", not(any(target_os = \"emscripten\", target_os = \"wasi\"))))'.dependencies]\nweb-time = { workspace = true, optional = true }\n# NOTE: This enables the wasm_js required for rand to work on wasm\ngetrandom = { workspace = true, features = [\"wasm_js\"], optional = true }\n\n[dev-dependencies]\ncriterion.workspace = true\nfloat-cmp.workspace = true\nindoc.workspace = true\ntextwrap.workspace = true\ntest-case.workspace = true\nhusky-rs.workspace = true\n\n[target.x86_64-unknown-linux-gnu.dev-dependencies]\njemallocator.workspace = true\n\n[lib]\ncrate-type = [\"cdylib\", \"lib\"]\nname = \"boa_engine\"\nbench = false\n\n[[bench]]\nname = \"full\"\nharness = false\n\n[lints]\nworkspace = true\n\n[package.metadata.docs.rs]\nall-features = true\n" }, { "path": "core/engine/benches/README.md", "content": "# Boa Benchmarks\n\nFor each js script in the `bench_scripts` folder, we create three benchmarks:\n\n- Parser => lexing and parsing of the source code\n- Compiler => compilation of the parsed statement list into bytecode\n- Execution => execution of the bytecode in the vm\n\nThe idea is to check the performance of Boa in different scenarios.\nDifferent parts of Boa are benchmarked separately to make the impact of local changes visible.\n" }, { "path": "core/engine/benches/bench_scripts/arithmetic_operations.js", "content": "((2 + 2) ** 3 / 100 - 5 ** 3 * -1000) ** 2 + 100 - 8;\n" }, { "path": "core/engine/benches/bench_scripts/array_access.js", "content": "(function () {\n let testArr = [1, 2, 3, 4, 5];\n\n let res = testArr[2];\n\n return res;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/array_create.js", "content": "(function () {\n let testArr = [];\n for (let a = 0; a <= 500; a++) {\n testArr[a] = \"p\" + a;\n }\n\n return testArr;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/array_pop.js", "content": "(function () {\n let testArray = [\n 83, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83,\n 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93,\n 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77,\n 32, 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32,\n 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234,\n 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29,\n 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99, 36, 28,\n 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62,\n 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93, 17,\n 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32,\n 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56,\n 67, 77, 32, 45, 93, 17, 28, 83, 62, 99, 36, 28,\n ];\n\n while (testArray.length > 0) {\n testArray.pop();\n }\n\n return testArray;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/boolean_object_access.js", "content": "new Boolean(\n !new Boolean(\n new Boolean(\n !new Boolean(false).valueOf() && new Boolean(true).valueOf(),\n ).valueOf(),\n ).valueOf(),\n).valueOf();\n" }, { "path": "core/engine/benches/bench_scripts/clean_js.js", "content": "!function () {\n\tvar M = new Array();\n\tfor (i = 0; i < 100; i++) {\n\t\tM.push(Math.floor(Math.random() * 100));\n\t}\n\tvar test = [];\n\tfor (i = 0; i < 100; i++) {\n\t\tif (M[i] > 50) {\n\t\t\ttest.push(M[i]);\n\t\t}\n\t}\n\ttest.forEach(elem => {\n 0\n });\n}();\n" }, { "path": "core/engine/benches/bench_scripts/fibonacci.js", "content": "(function () {\n let num = 12;\n\n function fib(n) {\n if (n <= 1) return 1;\n return fib(n - 1) + fib(n - 2);\n }\n\n return fib(num);\n})();\n" }, { "path": "core/engine/benches/bench_scripts/for_loop.js", "content": "(function () {\n let b = \"hello\";\n for (let a = 10; a < 100; a += 5) {\n if (a < 50) {\n b += \"world\";\n }\n }\n\n return b;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/mini_js.js", "content": "!function(){var r=new Array();for(i=0;i<100;i++)r.push(Math.floor(100*Math.random()));var a=[];for(i=0;i<100;i++)r[i]>50&&a.push(r[i]);a.forEach(i=>{0})}();\n" }, { "path": "core/engine/benches/bench_scripts/number_object_access.js", "content": "new Number(\n new Number(\n new Number(new Number(100).valueOf() - 10.5).valueOf() + 100,\n ).valueOf() * 1.6,\n);\n" }, { "path": "core/engine/benches/bench_scripts/object_creation.js", "content": "(function () {\n let test = {\n my_prop: \"hello\",\n another: 65,\n };\n\n return test;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/object_prop_access_const.js", "content": "(function () {\n let test = {\n my_prop: \"hello\",\n another: 65,\n };\n\n return test.my_prop;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/object_prop_access_dyn.js", "content": "(function () {\n let test = {\n my_prop: \"hello\",\n another: 65,\n };\n\n return test[\"my\" + \"_prop\"];\n})();\n" }, { "path": "core/engine/benches/bench_scripts/regexp.js", "content": "(function () {\n let regExp = new RegExp(\"hello\", \"i\");\n\n return regExp.test(\"Hello World\");\n})();\n" }, { "path": "core/engine/benches/bench_scripts/regexp_creation.js", "content": "(function () {\n let regExp = new RegExp(\"hello\", \"i\");\n\n return regExp;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/regexp_literal.js", "content": "(function () {\n let regExp = /hello/i;\n\n return regExp.test(\"Hello World\");\n})();\n" }, { "path": "core/engine/benches/bench_scripts/regexp_literal_creation.js", "content": "(function () {\n let regExp = /hello/i;\n\n return regExp;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/string_code_point_sum.js", "content": "(() => {\n let sum = \"\";\n let string = \"Hello, world!!!\";\n for (let i = 0; i < string.length; ++i) {\n sum += string.charCodeAt(i).toString(16);\n }\n return sum;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/string_compare.js", "content": "(function () {\n var a = \"hello\";\n var b = \"world\";\n\n var c = a == b;\n\n var d = b;\n var e = d == b;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/string_concat.js", "content": "(function () {\n var a = \"hello\";\n var b = \"world\";\n\n var c = a + b;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/string_copy.js", "content": "(function () {\n var a = \"hello\";\n var b = a;\n})();\n" }, { "path": "core/engine/benches/bench_scripts/string_object_access.js", "content": "new String(\n new String(\n new String(\n new String(\"Hello\").valueOf() + new String(\", world\").valueOf(),\n ).valueOf() + \"!\",\n ).valueOf(),\n).valueOf();\n" }, { "path": "core/engine/benches/bench_scripts/symbol_creation.js", "content": "(function () {\n return Symbol();\n})();\n" }, { "path": "core/engine/benches/full.rs", "content": "#![allow(unused_crate_dependencies, missing_docs)]\n\n//! Benchmarks of the whole execution engine in Boa.\n\nuse boa_engine::{\n Context, Source, context::DefaultHooks, object::shape::RootShape, optimizer::OptimizerOptions,\n realm::Realm, script::Script,\n};\nuse criterion::{Criterion, criterion_group, criterion_main};\nuse std::hint::black_box;\n\n#[cfg(all(target_arch = \"x86_64\", target_os = \"linux\", target_env = \"gnu\"))]\n#[cfg_attr(\n all(target_arch = \"x86_64\", target_os = \"linux\", target_env = \"gnu\"),\n global_allocator\n)]\nstatic ALLOC: jemallocator::Jemalloc = jemallocator::Jemalloc;\n\nfn create_realm(c: &mut Criterion) {\n c.bench_function(\"Create Realm\", move |b| {\n let root_shape = RootShape::default();\n b.iter(|| Realm::create(&DefaultHooks, &root_shape));\n });\n}\n\nmacro_rules! full_benchmarks {\n ($({$id:literal, $name:ident}),*) => {\n fn bench_parser(c: &mut Criterion) {\n $(\n {\n static CODE: &str = include_str!(concat!(\"bench_scripts/\", stringify!($name), \".js\"));\n let mut context = Context::default();\n\n // Disable optimizations\n context.set_optimizer_options(OptimizerOptions::empty());\n\n c.bench_function(concat!($id, \" (Parser)\"), move |b| {\n b.iter(|| {\n Script::parse(\n black_box(Source::from_bytes(CODE)),\n None,\n &mut context,\n ).unwrap()\n })\n });\n }\n )*\n }\n fn bench_compile(c: &mut Criterion) {\n $(\n {\n static CODE: &str = include_str!(concat!(\"bench_scripts/\", stringify!($name), \".js\"));\n let context = &mut Context::default();\n\n // Disable optimizations\n context.set_optimizer_options(OptimizerOptions::empty());\n\n let script = Script::parse(\n black_box(Source::from_bytes(CODE)),\n None,\n context,\n ).unwrap();\n c.bench_function(concat!($id, \" (Compiler)\"), move |b| {\n b.iter(|| {\n script.codeblock(context).unwrap()\n })\n });\n }\n )*\n }\n fn bench_execution(c: &mut Criterion) {\n $(\n {\n static CODE: &str = include_str!(concat!(\"bench_scripts/\", stringify!($name), \".js\"));\n let context = &mut Context::default();\n\n // Disable optimizations\n context.set_optimizer_options(OptimizerOptions::empty());\n\n let script = Script::parse(\n black_box(Source::from_bytes(CODE)),\n None,\n context,\n ).unwrap();\n script.codeblock(context).unwrap();\n c.bench_function(concat!($id, \" (Execution)\"), move |b| {\n b.iter(|| {\n script.evaluate(context).unwrap();\n })\n });\n }\n )*\n }\n };\n}\n\nfull_benchmarks!(\n {\"String Code Point Sum\", string_code_point_sum},\n {\"Symbols\", symbol_creation},\n {\"For loop\", for_loop},\n {\"Fibonacci\", fibonacci},\n {\"Object Creation\", object_creation},\n {\"Static Object Property Access\", object_prop_access_const},\n {\"Dynamic Object Property Access\", object_prop_access_dyn},\n {\"RegExp Literal Creation\", regexp_literal_creation},\n {\"RegExp Creation\", regexp_creation},\n {\"RegExp Literal\", regexp_literal},\n {\"RegExp\", regexp},\n {\"Array access\", array_access},\n {\"Array creation\", array_create},\n {\"Array pop\", array_pop},\n {\"String concatenation\", string_concat},\n {\"String comparison\", string_compare},\n {\"String copy\", string_copy},\n {\"Number Object Access\", number_object_access},\n {\"Boolean Object Access\", boolean_object_access},\n {\"String Object Access\", string_object_access},\n {\"Arithmetic operations\", arithmetic_operations},\n {\"Clean js\", clean_js},\n {\"Mini js\", mini_js}\n);\n\ncriterion_group!(\n benches,\n create_realm,\n bench_parser,\n bench_compile,\n bench_execution,\n);\ncriterion_main!(benches);\n" }, { "path": "core/engine/src/bigint.rs", "content": "//! Boa's implementation of ECMAScript's bigint primitive type.\n\nuse crate::{JsData, JsResult, JsString, builtins::Number, error::JsNativeError};\nuse boa_gc::{Finalize, Trace};\nuse num_bigint::Sign;\nuse num_integer::Integer;\nuse num_traits::{FromPrimitive, One, ToPrimitive, Zero, pow::Pow};\nuse std::{\n fmt::{self, Display},\n ops::{Add, BitAnd, BitOr, BitXor, Div, Mul, Neg, Rem, Shl, Shr, Sub},\n ptr::NonNull,\n rc::Rc,\n};\n\n/// The raw bigint type.\npub type RawBigInt = num_bigint::BigInt;\n\n#[cfg(feature = \"deser\")]\nuse serde::{Deserialize, Serialize};\n\n/// JavaScript bigint primitive rust type.\n#[allow(\n clippy::unsafe_derive_deserialize,\n reason = \"unsafe methods do not add invariants that need to be held\"\n)]\n#[cfg_attr(feature = \"deser\", derive(Serialize, Deserialize))]\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Trace, Finalize, JsData)]\n// Safety: `JsBigInt` doesn't contain any traceable types.\n#[boa_gc(unsafe_empty_trace)]\npub struct JsBigInt {\n inner: Rc,\n}\n\nimpl JsBigInt {\n /// Create a new [`JsBigInt`].\n #[must_use]\n pub fn new>(value: T) -> Self {\n value.into()\n }\n\n /// Create a [`JsBigInt`] with value `0`.\n #[inline]\n #[must_use]\n pub fn zero() -> Self {\n Self {\n inner: Rc::new(RawBigInt::zero()),\n }\n }\n\n /// Check if is zero.\n #[inline]\n #[must_use]\n pub fn is_zero(&self) -> bool {\n self.inner.is_zero()\n }\n\n /// Create a [`JsBigInt`] with value `1`.\n #[inline]\n #[must_use]\n pub fn one() -> Self {\n Self {\n inner: Rc::new(RawBigInt::one()),\n }\n }\n\n /// Check if is one.\n #[inline]\n #[must_use]\n pub fn is_one(&self) -> bool {\n self.inner.is_one()\n }\n\n /// Convert bigint to string with radix.\n #[inline]\n #[must_use]\n pub fn to_string_radix(&self, radix: u32) -> String {\n self.inner.to_str_radix(radix)\n }\n\n /// Converts the `BigInt` to a f64 type.\n ///\n /// Returns `f64::INFINITY` if the `BigInt` is too big.\n #[inline]\n #[must_use]\n pub fn to_f64(&self) -> f64 {\n self.inner.to_f64().unwrap_or(f64::INFINITY)\n }\n\n /// Converts the `BigInt` to a i128 type.\n ///\n /// Returns `i128::MAX` if the `BigInt` is too big.\n #[inline]\n #[must_use]\n pub fn to_i128(&self) -> i128 {\n self.inner.to_i128().unwrap_or(i128::MAX)\n }\n\n /// Converts a string to a `BigInt` with the specified radix.\n #[inline]\n #[must_use]\n pub fn from_string_radix(buf: &str, radix: u32) -> Option {\n Some(Self {\n inner: Rc::new(RawBigInt::parse_bytes(buf.as_bytes(), radix)?),\n })\n }\n\n /// Abstract operation `StringToBigInt ( str )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-stringtobigint\n pub(crate) fn from_js_string(string: &JsString) -> Option {\n // 1. Let text be ! StringToCodePoints(str).\n // 2. Let literal be ParseText(text, StringIntegerLiteral).\n // 3. If literal is a List of errors, return undefined.\n // 4. Let mv be the MV of literal.\n // 5. Assert: mv is an integer.\n // 6. Return ℤ(mv).\n JsBigInt::from_string(string.to_std_string().ok().as_ref()?)\n }\n\n /// This function takes a string and converts it to `BigInt` type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-stringtobigint\n #[inline]\n #[must_use]\n pub fn from_string(mut string: &str) -> Option {\n string = string.trim();\n\n if string.is_empty() {\n return Some(Self::zero());\n }\n\n let mut radix = 10;\n if string.starts_with(\"0b\") || string.starts_with(\"0B\") {\n radix = 2;\n string = &string[2..];\n } else if string.starts_with(\"0x\") || string.starts_with(\"0X\") {\n radix = 16;\n string = &string[2..];\n } else if string.starts_with(\"0o\") || string.starts_with(\"0O\") {\n radix = 8;\n string = &string[2..];\n }\n\n Self::from_string_radix(string, radix)\n }\n\n /// Checks for `SameValueZero` equality.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-numeric-types-bigint-equal\n #[inline]\n #[must_use]\n pub fn same_value_zero(x: &Self, y: &Self) -> bool {\n // Return BigInt::equal(x, y)\n Self::equal(x, y)\n }\n\n /// Checks for `SameValue` equality.\n ///\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-numeric-types-bigint-sameValue\n #[inline]\n #[must_use]\n pub fn same_value(x: &Self, y: &Self) -> bool {\n // Return BigInt::equal(x, y)\n Self::equal(x, y)\n }\n\n /// Checks for mathematical equality.\n ///\n /// The abstract operation `BigInt::equal` takes arguments x (a `BigInt`) and y (a `BigInt`).\n /// It returns `true` if x and y have the same mathematical integer value and false otherwise.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-numeric-types-bigint-sameValueZero\n #[inline]\n #[must_use]\n pub fn equal(x: &Self, y: &Self) -> bool {\n x == y\n }\n\n /// Returns `x` to the power `y`.\n #[inline]\n pub fn pow(x: &Self, y: &Self) -> JsResult {\n let y = y\n .inner\n .to_biguint()\n .ok_or_else(|| JsNativeError::range().with_message(\"BigInt negative exponent\"))?;\n\n let num_bits = (x.inner.bits() as f64\n * y.to_f64().expect(\"Unable to convert from BigUInt to f64\"))\n .floor()\n + 1f64;\n\n if num_bits > 1_000_000_000f64 {\n return Err(JsNativeError::range()\n .with_message(\"Maximum BigInt size exceeded\")\n .into());\n }\n\n Ok(Self::new(x.inner.as_ref().clone().pow(y)))\n }\n\n /// Performs the `>>` operation.\n #[inline]\n pub fn shift_right(x: &Self, y: &Self) -> JsResult {\n match y.inner.to_i32() {\n Some(n) if n > 0 => Ok(Self::new(x.inner.as_ref().clone().shr(n as usize))),\n Some(n) => Ok(Self::new(x.inner.as_ref().clone().shl(n.unsigned_abs()))),\n // y doesn't fit in i32.\n //\n // Best-effort safeguard: while the spec doesn't explicitly mandate a\n // result for implementation-limited shift amounts, the mathematical\n // definition of BigInt right shift (`floor(x / 2^y)`) from\n // \n // implies that for very large positive y the result converges to\n // 0n (x >= 0) or -1n (x < 0). V8 and SpiderMonkey agree.\n None => match (x.inner.sign(), y.inner.sign()) {\n // x >> (large positive): all bits are shifted out.\n (Sign::Minus, Sign::Plus) => Ok(Self::new(RawBigInt::from(-1))),\n (_, Sign::Plus) => Ok(Self::zero()),\n // x >> (large negative) is equivalent to x << (large positive), which overflows.\n (_, _) => Err(JsNativeError::range()\n .with_message(\"Maximum BigInt size exceeded\")\n .into()),\n },\n }\n }\n\n /// Performs the `<<` operation.\n #[inline]\n pub fn shift_left(x: &Self, y: &Self) -> JsResult {\n match y.inner.to_i32() {\n Some(n) if n > 0 => Ok(Self::new(x.inner.as_ref().clone().shl(n as usize))),\n Some(n) => Ok(Self::new(x.inner.as_ref().clone().shr(n.unsigned_abs()))),\n // y doesn't fit in i32.\n //\n // Best-effort safeguard: symmetric to shift_right above.\n // See .\n None => match (x.inner.sign(), y.inner.sign()) {\n // x << (large negative) is equivalent to x >> (large positive): all bits shifted out.\n (Sign::Minus, Sign::Minus) => Ok(Self::new(RawBigInt::from(-1))),\n (_, Sign::Minus) => Ok(Self::zero()),\n // x << (large positive) overflows.\n (_, _) => Err(JsNativeError::range()\n .with_message(\"Maximum BigInt size exceeded\")\n .into()),\n },\n }\n }\n\n /// Floored integer modulo.\n ///\n /// # Examples\n /// ```\n /// # use num_integer::Integer;\n /// assert_eq!((8).mod_floor(&3), 2);\n /// assert_eq!((8).mod_floor(&-3), -1);\n /// ```\n #[inline]\n #[must_use]\n pub fn mod_floor(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.mod_floor(&y.inner))\n }\n\n /// Performs the `+` operation.\n #[inline]\n #[must_use]\n pub fn add(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.as_ref().clone().add(y.inner.as_ref()))\n }\n\n /// Performs the `-` operation.\n #[inline]\n #[must_use]\n pub fn sub(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.as_ref().clone().sub(y.inner.as_ref()))\n }\n\n /// Performs the `*` operation.\n #[inline]\n #[must_use]\n pub fn mul(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.as_ref().clone().mul(y.inner.as_ref()))\n }\n\n /// Performs the `/` operation.\n #[inline]\n #[must_use]\n pub fn div(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.as_ref().clone().div(y.inner.as_ref()))\n }\n\n /// Performs the `%` operation.\n #[inline]\n #[must_use]\n pub fn rem(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.as_ref().clone().rem(y.inner.as_ref()))\n }\n\n /// Performs the `&` operation.\n #[inline]\n #[must_use]\n pub fn bitand(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.as_ref().clone().bitand(y.inner.as_ref()))\n }\n\n /// Performs the `|` operation.\n #[inline]\n #[must_use]\n pub fn bitor(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.as_ref().clone().bitor(y.inner.as_ref()))\n }\n\n /// Performs the `^` operation.\n #[inline]\n #[must_use]\n pub fn bitxor(x: &Self, y: &Self) -> Self {\n Self::new(x.inner.as_ref().clone().bitxor(y.inner.as_ref()))\n }\n\n /// Performs the unary `-` operation.\n #[inline]\n #[must_use]\n pub fn neg(x: &Self) -> Self {\n Self::new(x.as_inner().neg())\n }\n\n /// Performs the unary `!` operation.\n #[inline]\n #[must_use]\n pub fn not(x: &Self) -> Self {\n Self::new(!x.as_inner())\n }\n\n /// Returns a reference to the raw inner value.\n #[inline]\n #[must_use]\n pub fn as_inner(&self) -> &RawBigInt {\n &self.inner\n }\n\n /// Consumes the [`JsBigInt`], returning a pointer to [`RawBigInt`].\n ///\n /// To avoid a memory leak the pointer must be converted back to a `JsBigInt` using\n /// [`JsBigInt::from_raw`].\n #[inline]\n #[must_use]\n #[allow(unused, reason = \"only used in nan-boxed implementation of JsValue\")]\n pub(crate) fn into_raw(self) -> NonNull {\n // SAFETY: `Rc::into_raw` must always return a non-null pointer.\n unsafe { NonNull::new_unchecked(Rc::into_raw(self.inner).cast_mut()) }\n }\n\n /// Constructs a `JsBigInt` from a pointer to [`RawBigInt`].\n ///\n /// The raw pointer must have been previously returned by a call to\n /// [`JsBigInt::into_raw`].\n ///\n /// # Safety\n ///\n /// This function is unsafe because improper use may lead to memory unsafety,\n /// even if the returned `JsBigInt` is never accessed.\n #[inline]\n #[must_use]\n #[allow(unused, reason = \"only used in nan-boxed implementation of JsValue\")]\n pub(crate) unsafe fn from_raw(ptr: *const RawBigInt) -> Self {\n Self {\n // SAFETY: the validity of `ptr` is guaranteed by the caller.\n inner: unsafe { Rc::from_raw(ptr) },\n }\n }\n}\n\nimpl Display for JsBigInt {\n #[inline]\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n Display::fmt(&self.inner, f)\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: RawBigInt) -> Self {\n Self {\n inner: Rc::new(value),\n }\n }\n}\n\nimpl From> for JsBigInt {\n #[inline]\n fn from(value: Box) -> Self {\n Self {\n inner: value.into(),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: i8) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: u8) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: i16) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: u16) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: i32) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: u32) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: i64) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: u64) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: i128) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: u128) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: isize) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\nimpl From for JsBigInt {\n #[inline]\n fn from(value: usize) -> Self {\n Self {\n inner: Rc::new(RawBigInt::from(value)),\n }\n }\n}\n\n/// The error indicates that the conversion from [`f64`] to [`JsBigInt`] failed.\n#[derive(Debug, Clone, Copy, Hash, PartialEq, Eq, PartialOrd, Ord)]\npub struct TryFromF64Error;\n\nimpl Display for TryFromF64Error {\n #[inline]\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"Could not convert f64 value to a BigInt type\")\n }\n}\n\nimpl TryFrom for JsBigInt {\n type Error = TryFromF64Error;\n\n #[inline]\n fn try_from(n: f64) -> Result {\n // If the truncated version of the number is not the\n // same as the non-truncated version then the floating-point\n // number contains a fractional part.\n if !Number::equal(n.trunc(), n) {\n return Err(TryFromF64Error);\n }\n RawBigInt::from_f64(n).map_or(Err(TryFromF64Error), |bigint| Ok(Self::new(bigint)))\n }\n}\n\nimpl PartialEq for JsBigInt {\n #[inline]\n fn eq(&self, other: &i32) -> bool {\n self.inner.as_ref() == &RawBigInt::from(*other)\n }\n}\n\nimpl PartialEq for i32 {\n #[inline]\n fn eq(&self, other: &JsBigInt) -> bool {\n &RawBigInt::from(*self) == other.inner.as_ref()\n }\n}\n\nimpl PartialEq for JsBigInt {\n #[inline]\n fn eq(&self, other: &f64) -> bool {\n other.fract().is_zero()\n && RawBigInt::from_f64(*other).is_some_and(|bigint| self.inner.as_ref() == &bigint)\n }\n}\n\nimpl PartialEq for f64 {\n #[inline]\n fn eq(&self, other: &JsBigInt) -> bool {\n self.fract().is_zero()\n && RawBigInt::from_f64(*self).is_some_and(|bigint| other.inner.as_ref() == &bigint)\n }\n}\n" }, { "path": "core/engine/src/builtins/array/array_iterator.rs", "content": "//! This module implements the `ArrayIterator` object.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-array-iterator-objects\n\nuse crate::{\n Context, JsData, JsResult,\n builtins::{\n Array, BuiltInBuilder, IntrinsicObject, JsValue, iterable::create_iter_result_object,\n typed_array::TypedArray,\n },\n context::intrinsics::Intrinsics,\n error::JsNativeError,\n js_string,\n object::JsObject,\n property::{Attribute, PropertyNameKind},\n realm::Realm,\n symbol::JsSymbol,\n};\nuse boa_gc::{Finalize, Trace};\n\n/// The Array Iterator object represents an iteration over an array. It implements the iterator protocol.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-array-iterator-objects\n#[derive(Debug, Clone, Finalize, Trace, JsData)]\npub(crate) struct ArrayIterator {\n array: JsObject,\n next_index: u64,\n #[unsafe_ignore_trace]\n kind: PropertyNameKind,\n done: bool,\n}\n\nimpl IntrinsicObject for ArrayIterator {\n fn init(realm: &Realm) {\n BuiltInBuilder::with_intrinsic::(realm)\n .prototype(\n realm\n .intrinsics()\n .objects()\n .iterator_prototypes()\n .iterator(),\n )\n .static_method(Self::next, js_string!(\"next\"), 0)\n .static_property(\n JsSymbol::to_string_tag(),\n js_string!(\"Array Iterator\"),\n Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n intrinsics.objects().iterator_prototypes().array()\n }\n}\n\nimpl ArrayIterator {\n fn new(array: JsObject, kind: PropertyNameKind) -> Self {\n Self {\n array,\n kind,\n next_index: 0,\n done: false,\n }\n }\n\n /// `CreateArrayIterator( array, kind )`\n ///\n /// Creates a new iterator over the given array.\n ///\n /// More information:\n /// - [ECMA reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-createarrayiterator\n pub(crate) fn create_array_iterator(\n array: JsObject,\n kind: PropertyNameKind,\n context: &Context,\n ) -> JsValue {\n let array_iterator = JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n context.intrinsics().objects().iterator_prototypes().array(),\n Self::new(array, kind),\n );\n array_iterator.into()\n }\n\n /// %ArrayIteratorPrototype%.next( )\n ///\n /// Gets the next result in the array.\n ///\n /// More information:\n /// - [ECMA reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-%arrayiteratorprototype%.next\n pub(crate) fn next(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n let object = this.as_object();\n let mut array_iterator = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"`this` is not an ArrayIterator\"))?;\n let index = array_iterator.next_index;\n if array_iterator.done {\n return Ok(create_iter_result_object(\n JsValue::undefined(),\n true,\n context,\n ));\n }\n\n let len = if let Some(f) = array_iterator.array.downcast_ref::() {\n let buf = f.viewed_array_buffer().as_buffer();\n let Some(buf) = buf\n .bytes(std::sync::atomic::Ordering::SeqCst)\n .filter(|buf| !f.is_out_of_bounds(buf.len()))\n else {\n return Err(JsNativeError::typ()\n .with_message(\"Cannot get value from out of bounds typed array\")\n .into());\n };\n\n f.array_length(buf.len())\n } else {\n array_iterator.array.length_of_array_like(context)?\n };\n\n if index >= len {\n array_iterator.done = true;\n return Ok(create_iter_result_object(\n JsValue::undefined(),\n true,\n context,\n ));\n }\n array_iterator.next_index = index + 1;\n match array_iterator.kind {\n PropertyNameKind::Key => Ok(create_iter_result_object(index.into(), false, context)),\n PropertyNameKind::Value => {\n let element_value = array_iterator.array.get(index, context)?;\n Ok(create_iter_result_object(element_value, false, context))\n }\n PropertyNameKind::KeyAndValue => {\n let element_value = array_iterator.array.get(index, context)?;\n let result = Array::create_array_from_list([index.into(), element_value], context);\n Ok(create_iter_result_object(result.into(), false, context))\n }\n }\n }\n}\n" }, { "path": "core/engine/src/builtins/array/from_async.rs", "content": "use boa_gc::{Finalize, Trace};\n\nuse super::Array;\nuse crate::builtins::AsyncFromSyncIterator;\nuse crate::builtins::iterable::IteratorRecord;\nuse crate::builtins::promise::ResolvingFunctions;\nuse crate::native_function::{CoroutineState, NativeCoroutine};\nuse crate::object::{JsFunction, JsPromise};\nuse crate::{\n Context, JsArgs, JsError, JsExpect, JsNativeError, JsObject, JsResult, JsSymbol, JsValue,\n js_string,\n};\nuse std::cell::Cell;\n\nimpl Array {\n /// [`Array.fromAsync ( asyncItems [ , mapfn [ , thisArg ] ] )`][spec]\n ///\n /// The `Array.fromAsync()` static method creates a new,\n /// shallow-copied Array instance from a list or iterator of Promise-like values.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/proposal-array-from-async/#sec-array.fromAsync\n #[allow(clippy::unnecessary_wraps)]\n pub(crate) fn from_async(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let C be the this value.\n // 2. Let promiseCapability be ! NewPromiseCapability(%Promise%).\n let (promise, resolvers) = JsPromise::new_pending(context);\n\n let async_items = args.get_or_undefined(0);\n let mapfn = args.get_or_undefined(1);\n let this_arg = args.get_or_undefined(2).clone();\n\n // 3. Let fromAsyncClosure be a new Abstract Closure with no parameters that captures C, mapfn, and thisArg and\n // performs the following steps when called:\n // 4. Perform AsyncFunctionStart(promiseCapability, fromAsyncClosure).\n // NOTE: We avoid putting more state onto the coroutines by preprocessing all we can before allocating\n // the coroutines.\n let result: JsResult<()> = (|| {\n // a. If mapfn is undefined, let mapping be false.\n let mapfn = if mapfn.is_undefined() {\n None\n } else {\n // b. Else,\n // i. If IsCallable(mapfn) is false, throw a TypeError exception.\n let Some(callable) = mapfn.as_callable() else {\n return Err(JsNativeError::typ()\n .with_message(\"Array.fromAsync: mapping function must be callable\")\n .into());\n };\n // ii. Let mapping be true.\n Some(JsFunction::from_object_unchecked(callable))\n };\n\n // c. Let usingAsyncIterator be ? GetMethod(asyncItems, @@asyncIterator).\n // d. If usingAsyncIterator is undefined, then\n // i. Let usingSyncIterator be ? GetMethod(asyncItems, @@iterator).\n // e. Let iteratorRecord be undefined.\n // f. If usingAsyncIterator is not undefined, then\n let iterator_record = if let Some(method) =\n async_items.get_method(JsSymbol::async_iterator(), context)?\n {\n // i. Set iteratorRecord to ? GetIterator(asyncItems, async, usingAsyncIterator).\n async_items.get_iterator_from_method(&method, context)?\n }\n // g. Else if usingSyncIterator is not undefined, then\n else if let Some(method) = async_items.get_method(JsSymbol::iterator(), context)? {\n // i. Set iteratorRecord to ? CreateAsyncFromSyncIterator(GetIterator(asyncItems, sync, usingSyncIterator)).\n AsyncFromSyncIterator::create(\n async_items.get_iterator_from_method(&method, context)?,\n context,\n )\n }\n // i. Else,\n else {\n // i. NOTE: asyncItems is neither an AsyncIterable nor an Iterable so assume it is an array-like object.\n // ii. Let arrayLike be ! ToObject(asyncItems).\n let array_like = async_items.to_object(context)?;\n\n // iii. Let len be ? LengthOfArrayLike(arrayLike).\n let len = array_like.length_of_array_like(context)?;\n // iv. If IsConstructor(C) is true, then\n let a = if let Some(c) = this.as_constructor() {\n // 1. Let A be ? Construct(C, « 𝔽(len) »).\n c.construct(&[len.into()], None, context)?\n }\n // v. Else,\n else {\n // 1. Let A be ? ArrayCreate(len).\n Array::array_create(len, None, context)?\n };\n\n let coroutine_state = (\n GlobalState {\n mapfn,\n this_arg,\n resolvers: resolvers.clone(),\n },\n Cell::new(Some(ArrayLikeStateMachine::LoopStart {\n array_like,\n a,\n len,\n // iii. Let k be 0.\n k: 0,\n })),\n );\n\n // Try to run the coroutine once to see if it finishes early.\n // This avoids allocating a new coroutine that will immediately finish.\n // Spec continues on `from_array_like`...\n if let CoroutineState::Yielded(value) =\n from_array_like(Ok(JsValue::undefined()), &coroutine_state, context)?\n {\n // Coroutine yielded. We need to allocate it for a future execution.\n JsPromise::resolve(value, context)?.await_native(\n NativeCoroutine::from_copy_closure_with_captures(\n from_array_like,\n coroutine_state,\n ),\n context,\n );\n }\n\n return Ok(());\n };\n\n // h. If iteratorRecord is not undefined, then\n\n // i. If IsConstructor(C) is true, then\n let a = if let Some(c) = this.as_constructor() {\n // 1. Let A be ? Construct(C).\n c.construct(&[], None, context)?\n }\n // ii. Else,\n else {\n // 1. Let A be ! ArrayCreate(0).\n Array::array_create(0, None, context)?\n };\n\n let coroutine_state = (\n GlobalState {\n mapfn,\n this_arg,\n resolvers: resolvers.clone(),\n },\n Cell::new(Some(AsyncIteratorStateMachine::LoopStart {\n // vi. Let k be 0.\n k: 0,\n a,\n iterator_record,\n })),\n );\n\n // Try to run the coroutine once to see if it finishes early.\n // This avoids allocating a new coroutine that will immediately finish.\n // Spec continues on `from_async_iterator`...\n if let CoroutineState::Yielded(value) =\n from_async_iterator(Ok(JsValue::undefined()), &coroutine_state, context)?\n {\n JsPromise::resolve(value, context)?.await_native(\n NativeCoroutine::from_copy_closure_with_captures(\n from_async_iterator,\n coroutine_state,\n ),\n context,\n );\n }\n\n Ok(())\n })();\n\n // AsyncFunctionStart ( promiseCapability, asyncFunctionBody )\n // https://tc39.es/ecma262/#sec-async-functions-abstract-operations-async-function-start\n // ->\n // AsyncBlockStart ( promiseCapability, asyncBody, asyncContext )\n // https://tc39.es/ecma262/#sec-asyncblockstart\n\n // i. Assert: result is a throw completion.\n if let Err(err) = result {\n // ii. Perform ! Call(promiseCapability.[[Reject]], undefined, « result.[[Value]] »).\n resolvers\n .reject\n .call(&JsValue::undefined(), &[err.into_opaque(context)?], context)\n .js_expect(\"resolving functions cannot fail\")?;\n }\n\n // 5. Return promiseCapability.[[Promise]].\n Ok(promise.into())\n }\n}\n\n#[derive(Trace, Finalize)]\nstruct GlobalState {\n mapfn: Option,\n this_arg: JsValue,\n resolvers: ResolvingFunctions,\n}\n\n#[derive(Trace, Finalize)]\n#[boa_gc(unsafe_no_drop)]\nenum AsyncIteratorStateMachine {\n LoopStart {\n a: JsObject,\n k: u64,\n iterator_record: IteratorRecord,\n },\n LoopContinue {\n a: JsObject,\n k: u64,\n iterator_record: IteratorRecord,\n },\n LoopEnd {\n a: JsObject,\n k: u64,\n iterator_record: IteratorRecord,\n mapped_value: Option>,\n },\n AsyncIteratorCloseStart {\n err: JsError,\n iterator: JsObject,\n },\n AsyncIteratorCloseEnd {\n err: JsError,\n },\n}\n\n/// Part of [`Array.fromAsync ( asyncItems [ , mapfn [ , thisArg ] ] )`](https://tc39.es/proposal-array-from-async/#sec-array.fromAsync).\nfn from_async_iterator(\n mut result: JsResult,\n (global_state, state_machine): &(GlobalState, Cell>),\n context: &mut Context,\n) -> JsResult {\n let result = (|| {\n let Some(mut sm) = state_machine.take() else {\n return Ok(CoroutineState::Done);\n };\n\n // iv. Repeat,\n loop {\n match sm {\n AsyncIteratorStateMachine::LoopStart {\n a,\n k,\n iterator_record,\n } => {\n // Inverted conditional makes for a simpler code.\n if k < 2u64.pow(53) - 1 {\n // 2. Let Pk be ! ToString(𝔽(k)).\n // 3. Let nextResult be ? Call(iteratorRecord.[[NextMethod]], iteratorRecord.[[Iterator]]).\n let next_result = iterator_record.next_method().call(\n &iterator_record.iterator().clone().into(),\n &[],\n context,\n )?;\n\n state_machine.set(Some(AsyncIteratorStateMachine::LoopContinue {\n a,\n k,\n iterator_record,\n }));\n\n // 4. Set nextResult to ? Await(nextResult).\n return Ok(CoroutineState::Yielded(next_result));\n }\n\n // 1. If k ≥ 2**53 - 1, then\n\n // a. Let error be ThrowCompletion(a newly created TypeError object).\n // b. Return ? AsyncIteratorClose(iteratorRecord, error).\n sm = AsyncIteratorStateMachine::AsyncIteratorCloseStart {\n err: JsNativeError::typ()\n .with_message(\n \"Array.fromAsync: \\\n reached the maximum number of elements in an array \\\n (2^53 - 1)\",\n )\n .into(),\n iterator: iterator_record.iterator().clone(),\n };\n }\n AsyncIteratorStateMachine::LoopContinue {\n a,\n k,\n mut iterator_record,\n } => {\n // `result` is `Await(nextResult)`.\n let result = std::mem::replace(&mut result, Ok(JsValue::undefined()));\n\n // 5. If nextResult is not an Object, throw a TypeError exception.\n // Implicit on the call to `update_result`.\n iterator_record.update_result(result?, context)?;\n\n // 6. Let done be ? IteratorComplete(nextResult).\n // 7. If done is true,\n if iterator_record.done() {\n // a. Perform ? Set(A, \"length\", 𝔽(k), true).\n a.set(js_string!(\"length\"), k, true, context)?;\n\n // b. Return Completion Record { [[Type]]: return, [[Value]]: A, [[Target]]: empty }.\n // AsyncFunctionStart ( promiseCapability, asyncFunctionBody )\n // https://tc39.es/ecma262/#sec-async-functions-abstract-operations-async-function-start\n // ->\n // AsyncBlockStart ( promiseCapability, asyncBody, asyncContext )\n // https://tc39.es/ecma262/#sec-asyncblockstart\n\n // g. Else if result is a return completion, then\n // i. Perform ! Call(promiseCapability.[[Resolve]], undefined, « result.[[Value]] »).\n global_state\n .resolvers\n .resolve\n .call(&JsValue::undefined(), &[a.into()], context)\n .js_expect(\"resolving functions cannot fail\")?;\n\n return Ok(CoroutineState::Done);\n }\n\n // 8. Let nextValue be ? IteratorValue(nextResult).\n let next_value = iterator_record.value(context)?;\n // 9. If mapping is true, then\n if let Some(mapfn) = &global_state.mapfn {\n // a. Let mappedValue be Call(mapfn, thisArg, « nextValue, 𝔽(k) »).\n // b. IfAbruptCloseAsyncIterator(mappedValue, iteratorRecord).\n // https://tc39.es/proposal-array-from-async/#sec-ifabruptcloseasynciterator\n let mapped_value = match mapfn.call(\n &global_state.this_arg,\n &[next_value, k.into()],\n context,\n ) {\n // 1. If value is an abrupt completion, then\n Err(err) => {\n // a. Perform ? AsyncIteratorClose(iteratorRecord, value).\n // b. Return value.\n sm = AsyncIteratorStateMachine::AsyncIteratorCloseStart {\n err,\n iterator: iterator_record.iterator().clone(),\n };\n continue;\n }\n // 2. Else if value is a Completion Record, set value to value.[[Value]].\n Ok(value) => value,\n };\n state_machine.set(Some(AsyncIteratorStateMachine::LoopEnd {\n a,\n k,\n iterator_record,\n mapped_value: None,\n }));\n // c. Set mappedValue to Await(mappedValue).\n return Ok(CoroutineState::Yielded(mapped_value));\n }\n\n sm = AsyncIteratorStateMachine::LoopEnd {\n a,\n k,\n iterator_record,\n // 10. Else, let mappedValue be nextValue.\n mapped_value: Some(Ok(next_value)),\n }\n }\n AsyncIteratorStateMachine::LoopEnd {\n a,\n k,\n iterator_record,\n mapped_value,\n } => {\n // Either awaited `mappedValue` or directly set `mappedValue` to `nextValue`.\n let result = std::mem::replace(&mut result, Ok(JsValue::undefined()));\n\n // d. IfAbruptCloseAsyncIterator(mappedValue, iteratorRecord).\n // https://tc39.es/proposal-array-from-async/#sec-ifabruptcloseasynciterator\n let mapped_value = match mapped_value.unwrap_or(result) {\n // 1. If value is an abrupt completion, then\n Err(err) => {\n // a. Perform ? AsyncIteratorClose(iteratorRecord, value).\n // b. Return value.\n sm = AsyncIteratorStateMachine::AsyncIteratorCloseStart {\n err,\n iterator: iterator_record.iterator().clone(),\n };\n continue;\n }\n // 2. Else if value is a Completion Record, set value to value.[[Value]].\n Ok(value) => value,\n };\n\n // 11. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue).\n sm = if let Err(err) = a.create_data_property_or_throw(k, mapped_value, context)\n {\n // 12. If defineStatus is an abrupt completion, return ? AsyncIteratorClose(iteratorRecord, defineStatus).\n AsyncIteratorStateMachine::AsyncIteratorCloseStart {\n err,\n iterator: iterator_record.iterator().clone(),\n }\n } else {\n AsyncIteratorStateMachine::LoopStart {\n a,\n // 13. Set k to k + 1.\n k: k + 1,\n iterator_record,\n }\n };\n }\n // AsyncIteratorClose ( iteratorRecord, completion )\n // https://tc39.es/ecma262/#sec-asynciteratorclose\n // Simplified for only error completions.\n AsyncIteratorStateMachine::AsyncIteratorCloseStart { err, iterator } => {\n // 1. Assert: iteratorRecord.[[Iterator]] is an Object.\n // 2. Let iterator be iteratorRecord.[[Iterator]].\n // 3. Let innerResult be Completion(GetMethod(iterator, \"return\")).\n // 4. If innerResult is a normal completion, then\n // a. Let return be innerResult.[[Value]].\n // b. If return is undefined, return ? completion.\n // c. Set innerResult to Completion(Call(return, iterator)).\n // d. If innerResult is a normal completion, set innerResult to Completion(Await(innerResult.[[Value]])).\n // 5. If completion is a throw completion, return ? completion.\n let Ok(Some(ret)) = iterator.get_method(js_string!(\"return\"), context) else {\n return Err(err);\n };\n\n let Ok(value) = ret.call(&iterator.into(), &[], context) else {\n return Err(err);\n };\n\n state_machine.set(Some(AsyncIteratorStateMachine::AsyncIteratorCloseEnd {\n err,\n }));\n return Ok(CoroutineState::Yielded(value));\n }\n AsyncIteratorStateMachine::AsyncIteratorCloseEnd { err } => {\n // Awaited `innerResult.[[Value]]`.\n // Only need to return the original error.\n return Err(err);\n }\n }\n }\n })();\n\n // AsyncFunctionStart ( promiseCapability, asyncFunctionBody )\n // https://tc39.es/ecma262/#sec-async-functions-abstract-operations-async-function-start\n // ->\n // AsyncBlockStart ( promiseCapability, asyncBody, asyncContext )\n // https://tc39.es/ecma262/#sec-asyncblockstart\n match result {\n Ok(cont) => Ok(cont),\n\n // i. Assert: result is a throw completion.\n Err(err) => {\n // ii. Perform ! Call(promiseCapability.[[Reject]], undefined, « result.[[Value]] »).\n global_state\n .resolvers\n .reject\n .call(&JsValue::undefined(), &[err.into_opaque(context)?], context)\n .js_expect(\"resolving functions cannot fail\")?;\n Ok(CoroutineState::Done)\n }\n }\n}\n\n#[derive(Trace, Finalize)]\n#[boa_gc(unsafe_no_drop)]\n#[allow(clippy::enum_variant_names)]\nenum ArrayLikeStateMachine {\n LoopStart {\n array_like: JsObject,\n a: JsObject,\n len: u64,\n k: u64,\n },\n LoopContinue {\n array_like: JsObject,\n a: JsObject,\n len: u64,\n k: u64,\n },\n LoopEnd {\n array_like: JsObject,\n a: JsObject,\n len: u64,\n k: u64,\n mapped_value: Option,\n },\n}\n\n/// Part of [`Array.fromAsync ( asyncItems [ , mapfn [ , thisArg ] ] )`](https://tc39.es/proposal-array-from-async/#sec-array.fromAsync).\nfn from_array_like(\n mut result: JsResult,\n (global_state, state_machine): &(GlobalState, Cell>),\n context: &mut Context,\n) -> JsResult {\n let result: JsResult<_> = (|| {\n let Some(mut sm) = state_machine.take() else {\n return Ok(CoroutineState::Done);\n };\n\n loop {\n match sm {\n ArrayLikeStateMachine::LoopStart {\n array_like,\n a,\n len,\n k,\n } => {\n // vii. Repeat, while k < len,\n if k >= len {\n // viii. Perform ? Set(A, \"length\", 𝔽(len), true).\n a.set(js_string!(\"length\"), len, true, context)?;\n\n // ix. Return Completion Record { [[Type]]: return, [[Value]]: A, [[Target]]: empty }.\n\n // AsyncFunctionStart ( promiseCapability, asyncFunctionBody )\n // https://tc39.es/ecma262/#sec-async-functions-abstract-operations-async-function-start\n // ->\n // AsyncBlockStart ( promiseCapability, asyncBody, asyncContext )\n // https://tc39.es/ecma262/#sec-asyncblockstart\n\n // g. Else if result is a return completion, then\n // i. Perform ! Call(promiseCapability.[[Resolve]], undefined, « result.[[Value]] »).\n global_state\n .resolvers\n .resolve\n .call(&JsValue::undefined(), &[a.into()], context)\n .js_expect(\"resolving functions cannot fail\")?;\n\n return Ok(CoroutineState::Done);\n }\n\n // 1. Let Pk be ! ToString(𝔽(k)).\n // 2. Let kValue be ? Get(arrayLike, Pk).\n let k_value = array_like.get(k, context)?;\n state_machine.set(Some(ArrayLikeStateMachine::LoopContinue {\n array_like,\n a,\n len,\n k,\n }));\n\n // 3. Set kValue to ? Await(kValue).\n return Ok(CoroutineState::Yielded(k_value));\n }\n ArrayLikeStateMachine::LoopContinue {\n array_like,\n a,\n len,\n k,\n } => {\n // Awaited kValue\n let k_value = std::mem::replace(&mut result, Ok(JsValue::undefined()))?;\n\n // 4. If mapping is true, then\n if let Some(mapfn) = &global_state.mapfn {\n // a. Let mappedValue be ? Call(mapfn, thisArg, « kValue, 𝔽(k) »).\n let mapped_value =\n mapfn.call(&global_state.this_arg, &[k_value, k.into()], context)?;\n state_machine.set(Some(ArrayLikeStateMachine::LoopEnd {\n array_like,\n a,\n len,\n k,\n mapped_value: None,\n }));\n\n // b. Set mappedValue to ? Await(mappedValue).\n return Ok(CoroutineState::Yielded(mapped_value));\n }\n // 5. Else, let mappedValue be kValue.\n sm = ArrayLikeStateMachine::LoopEnd {\n array_like,\n a,\n len,\n k,\n mapped_value: Some(k_value),\n }\n }\n ArrayLikeStateMachine::LoopEnd {\n array_like,\n a,\n len,\n k,\n mapped_value,\n } => {\n // Either awaited `mappedValue` or directly set this from `kValue`.\n let result = std::mem::replace(&mut result, Ok(JsValue::undefined()))?;\n let mapped_value = mapped_value.unwrap_or(result);\n\n // 6. Perform ? CreateDataPropertyOrThrow(A, Pk, mappedValue).\n a.create_data_property_or_throw(k, mapped_value, context)?;\n\n // 7. Set k to k + 1.\n sm = ArrayLikeStateMachine::LoopStart {\n array_like,\n a,\n len,\n k: k + 1,\n }\n }\n }\n }\n })();\n\n // AsyncFunctionStart ( promiseCapability, asyncFunctionBody )\n // https://tc39.es/ecma262/#sec-async-functions-abstract-operations-async-function-start\n // ->\n // AsyncBlockStart ( promiseCapability, asyncBody, asyncContext )\n // https://tc39.es/ecma262/#sec-asyncblockstart\n match result {\n Ok(cont) => Ok(cont),\n // i. Assert: result is a throw completion.\n Err(err) => {\n // ii. Perform ! Call(promiseCapability.[[Reject]], undefined, « result.[[Value]] »).\n global_state\n .resolvers\n .reject\n .call(&JsValue::undefined(), &[err.into_opaque(context)?], context)\n .js_expect(\"resolving functions cannot fail\")?;\n Ok(CoroutineState::Done)\n }\n }\n}\n" }, { "path": "core/engine/src/builtins/array/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `Array` object.\n//!\n//! The ECMAScript `Array` class is a global object that is used in the construction of arrays; which are high-level, list-like objects.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-array-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array\n\nuse boa_gc::{Finalize, Trace};\nuse thin_vec::ThinVec;\n\nuse crate::{\n Context, JsArgs, JsExpect, JsResult, JsString,\n builtins::{BuiltInObject, Number, iterable::if_abrupt_close_iterator},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::JsNativeError,\n js_string,\n object::{\n CONSTRUCTOR, IndexedProperties, JsData, JsObject,\n internal_methods::{\n InternalMethodPropertyContext, InternalObjectMethods, ORDINARY_INTERNAL_METHODS,\n get_prototype_from_constructor, ordinary_define_own_property,\n ordinary_get_own_property,\n },\n },\n property::{Attribute, PropertyDescriptor, PropertyKey, PropertyNameKind},\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::{IntegerOrInfinity, JsValue},\n};\nuse std::cmp::{Ordering, min};\n\nuse super::{BuiltInBuilder, BuiltInConstructor, IntrinsicObject};\n\nmod array_iterator;\nuse crate::value::JsVariant;\npub(crate) use array_iterator::ArrayIterator;\n\n#[cfg(feature = \"experimental\")]\nmod from_async;\n\n#[cfg(test)]\nmod tests;\n\n/// Direction for `find_via_predicate`\n#[derive(Clone, Copy, Eq, PartialEq)]\npub(crate) enum Direction {\n Ascending,\n Descending,\n}\n\n/// JavaScript `Array` built-in implementation.\n#[derive(Debug, Clone, Copy, Trace, Finalize)]\n#[boa_gc(empty_trace)]\npub(crate) struct Array;\n\n/// Definitions of the internal object methods for array exotic objects.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-array-exotic-objects\npub(crate) static ARRAY_EXOTIC_INTERNAL_METHODS: InternalObjectMethods = InternalObjectMethods {\n __define_own_property__: array_exotic_define_own_property,\n ..ORDINARY_INTERNAL_METHODS\n};\n\nimpl JsData for Array {\n fn internal_methods(&self) -> &'static InternalObjectMethods {\n &ARRAY_EXOTIC_INTERNAL_METHODS\n }\n}\n\nimpl IntrinsicObject for Array {\n fn init(realm: &Realm) {\n let symbol_iterator = JsSymbol::iterator();\n let symbol_unscopables = JsSymbol::unscopables();\n\n let get_species = BuiltInBuilder::callable(realm, Self::get_species)\n .name(js_string!(\"get [Symbol.species]\"))\n .build();\n\n let values_function = BuiltInBuilder::callable_with_object(\n realm,\n realm.intrinsics().objects().array_prototype_values().into(),\n Self::values,\n )\n .name(js_string!(\"values\"))\n .build();\n\n let to_string_function = BuiltInBuilder::callable_with_object(\n realm,\n realm\n .intrinsics()\n .objects()\n .array_prototype_to_string()\n .into(),\n Self::to_string,\n )\n .name(js_string!(\"toString\"))\n .build();\n\n let unscopables_object = Self::unscopables_object();\n\n let builder = BuiltInBuilder::from_standard_constructor::(realm)\n // Static Methods\n .static_method(Self::from, js_string!(\"from\"), 1)\n .static_method(Self::is_array, js_string!(\"isArray\"), 1)\n .static_method(Self::of, js_string!(\"of\"), 0)\n .static_accessor(\n JsSymbol::species(),\n Some(get_species),\n None,\n Attribute::CONFIGURABLE,\n )\n .property(\n StaticJsStrings::LENGTH,\n 0,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::PERMANENT,\n )\n .method(Self::at, js_string!(\"at\"), 1)\n .method(Self::concat, js_string!(\"concat\"), 1)\n .method(Self::copy_within, js_string!(\"copyWithin\"), 2)\n .method(Self::entries, js_string!(\"entries\"), 0)\n .method(Self::every, js_string!(\"every\"), 1)\n .method(Self::fill, js_string!(\"fill\"), 1)\n .method(Self::filter, js_string!(\"filter\"), 1)\n .method(Self::find, js_string!(\"find\"), 1)\n .method(Self::find_index, js_string!(\"findIndex\"), 1)\n .method(Self::find_last, js_string!(\"findLast\"), 1)\n .method(Self::find_last_index, js_string!(\"findLastIndex\"), 1)\n .method(Self::flat, js_string!(\"flat\"), 0)\n .method(Self::flat_map, js_string!(\"flatMap\"), 1)\n .method(Self::for_each, js_string!(\"forEach\"), 1)\n .method(Self::includes_value, js_string!(\"includes\"), 1)\n .method(Self::index_of, js_string!(\"indexOf\"), 1)\n .method(Self::join, js_string!(\"join\"), 1)\n .method(Self::keys, js_string!(\"keys\"), 0)\n .method(Self::last_index_of, js_string!(\"lastIndexOf\"), 1)\n .method(Self::map, js_string!(\"map\"), 1)\n .method(Self::pop, js_string!(\"pop\"), 0)\n .method(Self::push, js_string!(\"push\"), 1)\n .method(Self::reduce, js_string!(\"reduce\"), 1)\n .method(Self::reduce_right, js_string!(\"reduceRight\"), 1)\n .method(Self::reverse, js_string!(\"reverse\"), 0)\n .method(Self::shift, js_string!(\"shift\"), 0)\n .method(Self::slice, js_string!(\"slice\"), 2)\n .method(Self::some, js_string!(\"some\"), 1)\n .method(Self::sort, js_string!(\"sort\"), 1)\n .method(Self::splice, js_string!(\"splice\"), 2)\n .method(Self::to_locale_string, js_string!(\"toLocaleString\"), 0)\n .method(Self::to_reversed, js_string!(\"toReversed\"), 0)\n .method(Self::to_sorted, js_string!(\"toSorted\"), 1)\n .method(Self::to_spliced, js_string!(\"toSpliced\"), 2)\n .method(Self::unshift, js_string!(\"unshift\"), 1)\n .method(Self::with, js_string!(\"with\"), 2)\n .property(\n js_string!(\"toString\"),\n to_string_function,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"values\"),\n values_function.clone(),\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n symbol_iterator,\n values_function,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n symbol_unscopables,\n unscopables_object,\n Attribute::READONLY | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n );\n\n #[cfg(feature = \"experimental\")]\n let builder = builder.static_method(Self::from_async, js_string!(\"fromAsync\"), 1);\n\n builder.build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for Array {\n const NAME: JsString = StaticJsStrings::ARRAY;\n}\n\nimpl BuiltInConstructor for Array {\n const PROTOTYPE_STORAGE_SLOTS: usize = 41;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 6;\n\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::array;\n\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // If NewTarget is undefined, let newTarget be the active function object; else let newTarget be NewTarget.\n let new_target = &if new_target.is_undefined() {\n context\n .active_function_object()\n .unwrap_or_else(|| context.intrinsics().constructors().array().constructor())\n .into()\n } else {\n new_target.clone()\n };\n\n // 2. Let proto be ? GetPrototypeFromConstructor(newTarget, \"%Array.prototype%\").\n let prototype =\n get_prototype_from_constructor(new_target, StandardConstructors::array, context)?;\n\n // 3. Let numberOfArgs be the number of elements in values.\n let number_of_args = args.len();\n\n // 4. If numberOfArgs = 0, then\n if number_of_args == 0 {\n // 4.a. Return ! ArrayCreate(0, proto).\n Ok(Self::array_create(0, Some(prototype), context)?.into())\n // 5. Else if numberOfArgs = 1, then\n } else if number_of_args == 1 {\n // a. Let len be values[0].\n let len = &args[0];\n // b. Let array be ! ArrayCreate(0, proto).\n let array = Self::array_create(0, Some(prototype), context)?;\n // c. If Type(len) is not Number, then\n #[allow(clippy::if_not_else)]\n let int_len = if !len.is_number() {\n // i. Perform ! CreateDataPropertyOrThrow(array, \"0\", len).\n array\n .create_data_property_or_throw(0, len.clone(), context)\n .js_expect(\"this CreateDataPropertyOrThrow call must not fail\")?;\n // ii. Let intLen be 1𝔽.\n 1\n // d. Else,\n } else {\n // i. Let intLen be ! ToUint32(len).\n let int_len = len\n .to_u32(context)\n .js_expect(\"this ToUint32 call must not fail\")?;\n // ii. If SameValueZero(intLen, len) is false, throw a RangeError exception.\n if !JsValue::same_value_zero(&int_len.into(), len) {\n return Err(JsNativeError::range()\n .with_message(\"invalid array length\")\n .into());\n }\n int_len\n };\n // e. Perform ! Set(array, \"length\", intLen, true).\n array\n .set(StaticJsStrings::LENGTH, int_len, true, context)\n .js_expect(\"this Set call must not fail\")?;\n // f. Return array.\n Ok(array.into())\n // 6. Else,\n } else {\n // 6.a. Assert: numberOfArgs ≥ 2.\n debug_assert!(number_of_args >= 2);\n\n // b. Let array be ? ArrayCreate(numberOfArgs, proto).\n let array = Self::array_create(number_of_args as u64, Some(prototype), context)?;\n\n // c. Let k be 0.\n // d. Repeat, while k < numberOfArgs,\n // i. Let Pk be ! ToString(𝔽(k)).\n // ii. Let itemK be values[k].\n // iii. Perform ! CreateDataPropertyOrThrow(array, Pk, itemK).\n // iv. Set k to k + 1.\n array\n .borrow_mut()\n .properties_mut()\n .override_indexed_properties(args.iter().cloned().collect());\n\n // e. Assert: The mathematical value of array's \"length\" property is numberOfArgs.\n // f. Return array.\n Ok(array.into())\n }\n }\n}\n\nimpl Array {\n /// Optimized helper function, that sets the length of the array.\n fn set_length(o: &JsObject, len: u64, context: &mut Context) -> JsResult<()> {\n if o.is_array() && len < (2u64.pow(32) - 1) {\n let mut borrowed_object = o.borrow_mut();\n if borrowed_object.properties().shape.to_addr_usize()\n == context\n .intrinsics()\n .templates()\n .array()\n .shape()\n .to_addr_usize()\n {\n // NOTE: The \"length\" property is the first element.\n borrowed_object.properties_mut().storage[0] = JsValue::new(len);\n return Ok(());\n }\n }\n\n o.set(StaticJsStrings::LENGTH, len, true, context)?;\n Ok(())\n }\n\n /// Utility for constructing `Array` objects.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-arraycreate\n pub(crate) fn array_create(\n length: u64,\n prototype: Option,\n context: &mut Context,\n ) -> JsResult {\n // 1. If length > 2^32 - 1, throw a RangeError exception.\n if length > 2u64.pow(32) - 1 {\n return Err(JsNativeError::range()\n .with_message(\"array exceeded max size\")\n .into());\n }\n\n // Fast path:\n if prototype.is_none() {\n return Ok(context\n .intrinsics()\n .templates()\n .array()\n .create(Array, vec![JsValue::new(length)]));\n }\n\n // 7. Return A.\n // 2. If proto is not present, set proto to %Array.prototype%.\n // 3. Let A be ! MakeBasicObject(« [[Prototype]], [[Extensible]] »).\n // 4. Set A.[[Prototype]] to proto.\n // 5. Set A.[[DefineOwnProperty]] as specified in 10.4.2.1.\n let prototype =\n prototype.unwrap_or_else(|| context.intrinsics().constructors().array().prototype());\n\n // Fast path:\n if context\n .intrinsics()\n .templates()\n .array()\n .has_prototype(&prototype)\n {\n return Ok(context\n .intrinsics()\n .templates()\n .array()\n .create(Array, vec![JsValue::new(length)]));\n }\n\n let array =\n JsObject::from_proto_and_data_with_shared_shape(context.root_shape(), prototype, Array)\n .upcast();\n\n // 6. Perform ! OrdinaryDefineOwnProperty(A, \"length\", PropertyDescriptor { [[Value]]: 𝔽(length), [[Writable]]: true, [[Enumerable]]: false, [[Configurable]]: false }).\n ordinary_define_own_property(\n &array,\n &StaticJsStrings::LENGTH.into(),\n PropertyDescriptor::builder()\n .value(length)\n .writable(true)\n .enumerable(false)\n .configurable(false)\n .build(),\n &mut InternalMethodPropertyContext::new(context),\n )?;\n\n Ok(array)\n }\n\n /// Utility for constructing `Array` objects from an iterator of `JsValue`s.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-createarrayfromlist\n pub(crate) fn create_array_from_list(elements: I, context: &Context) -> JsObject\n where\n I: IntoIterator,\n {\n // 1. Assert: elements is a List whose elements are all ECMAScript language values.\n // 2. Let array be ! ArrayCreate(0).\n // 3. Let n be 0.\n // 4. For each element e of elements, do\n // a. Perform ! CreateDataPropertyOrThrow(array, ! ToString(𝔽(n)), e).\n // b. Set n to n + 1.\n // 5. Return array.\n // NOTE: This deviates from the spec, but it should have the same behaviour.\n let elements: ThinVec<_> = elements.into_iter().collect();\n let length = elements.len();\n\n context\n .intrinsics()\n .templates()\n .array()\n .create_with_indexed_properties(\n Array,\n vec![JsValue::new(length)],\n IndexedProperties::from_dense_js_value(elements),\n )\n }\n\n /// Utility function for concatenating array objects.\n ///\n /// Returns a Boolean valued property that if `true` indicates that\n /// an object should be flattened to its array elements\n /// by `Array.prototype.concat`.\n fn is_concat_spreadable(o: &JsValue, context: &mut Context) -> JsResult {\n // 1. If Type(O) is not Object, return false.\n let Some(o) = o.as_object() else {\n return Ok(false);\n };\n\n // 2. Let spreadable be ? Get(O, @@isConcatSpreadable).\n let spreadable = o.get(JsSymbol::is_concat_spreadable(), context)?;\n\n // 3. If spreadable is not undefined, return ! ToBoolean(spreadable).\n if !spreadable.is_undefined() {\n return Ok(spreadable.to_boolean());\n }\n\n // 4. Return ? IsArray(O).\n o.is_array_abstract()\n }\n\n /// `get Array [ @@species ]`\n ///\n /// The `Array [ @@species ]` accessor property returns the Array constructor.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-array-@@species\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/@@species\n #[allow(clippy::unnecessary_wraps)]\n fn get_species(this: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n // 1. Return the this value.\n Ok(this.clone())\n }\n\n /// Utility function used to specify the creation of a new Array object using a constructor\n /// function that is derived from `original_array`.\n ///\n /// see: \n pub(crate) fn array_species_create(\n original_array: &JsObject,\n length: u64,\n context: &mut Context,\n ) -> JsResult {\n // 1. Let isArray be ? IsArray(originalArray).\n // 2. If isArray is false, return ? ArrayCreate(length).\n if !original_array.is_array_abstract()? {\n return Self::array_create(length, None, context);\n }\n // 3. Let C be ? Get(originalArray, \"constructor\").\n let c = original_array.get(CONSTRUCTOR, context)?;\n\n // 4. If IsConstructor(C) is true, then\n if let Some(c) = c.as_constructor() {\n // a. Let thisRealm be the current Realm Record.\n let this_realm = context.realm().clone();\n // b. Let realmC be ? GetFunctionRealm(C).\n let realm_c = c.get_function_realm(context)?;\n\n // c. If thisRealm and realmC are not the same Realm Record, then\n if this_realm != realm_c\n && c == realm_c.intrinsics().constructors().array().constructor()\n {\n // i. If SameValue(C, realmC.[[Intrinsics]].[[%Array%]]) is true, set C to undefined.\n // Note: fast path to step 6.\n return Self::array_create(length, None, context);\n }\n }\n\n // 5. If Type(C) is Object, then\n let c = if let Some(c) = c.as_object() {\n // 5.a. Set C to ? Get(C, @@species).\n let c = c.get(JsSymbol::species(), context)?;\n // 5.b. If C is null, set C to undefined.\n if c.is_null_or_undefined() {\n JsValue::undefined()\n } else {\n c\n }\n } else {\n c\n };\n\n // 6. If C is undefined, return ? ArrayCreate(length).\n if c.is_undefined() {\n return Self::array_create(length, None, context);\n }\n\n if let Some(c) = c.as_constructor() {\n // 8. Return ? Construct(C, « 𝔽(length) »).\n return c.construct(&[JsValue::new(length)], Some(&c), context);\n }\n\n // 7. If IsConstructor(C) is false, throw a TypeError exception.\n Err(JsNativeError::typ()\n .with_message(\"Symbol.species must be a constructor\")\n .into())\n }\n\n /// `Array.from(arrayLike)`\n ///\n /// The `Array.from()` static method creates a new,\n /// shallow-copied Array instance from an array-like or iterable object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.from\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/from\n pub(crate) fn from(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let items = args.get_or_undefined(0);\n let mapfn = args.get_or_undefined(1);\n let this_arg = args.get_or_undefined(2);\n\n // 2. If mapfn is undefined, let mapping be false\n // 3. Else,\n // a. If IsCallable(mapfn) is false, throw a TypeError exception.\n // b. Let mapping be true.\n let mapping = match mapfn.variant() {\n JsVariant::Undefined => None,\n JsVariant::Object(o) if o.is_callable() => Some(o),\n _ => {\n return Err(JsNativeError::typ()\n .with_message(format!(\"`{}` is not callable\", mapfn.type_of()))\n .into());\n }\n };\n\n // 4. Let usingIterator be ? GetMethod(items, @@iterator).\n let using_iterator = items.get_method(JsSymbol::iterator(), context)?;\n\n let Some(using_iterator) = using_iterator else {\n // 6. NOTE: items is not an Iterable so assume it is an array-like object.\n // 7. Let arrayLike be ! ToObject(items).\n let array_like = items\n .to_object(context)\n .js_expect(\"should not fail according to spec\")?;\n\n // 8. Let len be ? LengthOfArrayLike(arrayLike).\n let len = array_like.length_of_array_like(context)?;\n\n // 9. If IsConstructor(C) is true, then\n // a. Let A be ? Construct(C, « 𝔽(len) »).\n // 10. Else,\n // a. Let A be ? ArrayCreate(len).\n let a = match this.as_constructor() {\n Some(constructor) => constructor.construct(&[len.into()], None, context)?,\n _ => Self::array_create(len, None, context)?,\n };\n\n // 11. Let k be 0.\n // 12. Repeat, while k < len,\n // ...\n // f. Set k to k + 1.\n for k in 0..len {\n // a. Let Pk be ! ToString(𝔽(k)).\n // b. Let kValue be ? Get(arrayLike, Pk).\n let k_value = array_like.get(k, context)?;\n\n let mapped_value = if let Some(ref mapfn) = mapping {\n // c. If mapping is true, then\n // i. Let mappedValue be ? Call(mapfn, thisArg, « kValue, 𝔽(k) »).\n mapfn.call(this_arg, &[k_value, k.into()], context)?\n } else {\n // d. Else, let mappedValue be kValue.\n k_value\n };\n\n // e. Perform ? CreateDataPropertyOrThrow(A, Pk, mappedValue).\n a.create_data_property_or_throw(k, mapped_value, context)?;\n }\n\n // 13. Perform ? Set(A, \"length\", 𝔽(len), true).\n a.set(StaticJsStrings::LENGTH, len, true, context)?;\n\n // 14. Return A.\n return Ok(a.into());\n };\n\n // 5. If usingIterator is not undefined, then\n\n // a. If IsConstructor(C) is true, then\n // i. Let A be ? Construct(C).\n // b. Else,\n // i. Let A be ? ArrayCreate(0en).\n let a = match this.as_constructor() {\n Some(constructor) => constructor.construct(&[], None, context)?,\n _ => Self::array_create(0, None, context)?,\n };\n\n // c. Let iteratorRecord be ? GetIteratorFromMethod(items, usingIterator).\n let mut iterator_record = items.get_iterator_from_method(&using_iterator, context)?;\n\n // d. Let k be 0.\n // e. Repeat,\n // i. If k ≥ 2^53 - 1 (MAX_SAFE_INTEGER), then\n // ...\n // ix. Set k to k + 1.\n for k in 0..9_007_199_254_740_991_u64 {\n // iii. Let next be ? IteratorStepValue(iteratorRecord).\n let Some(next) = iterator_record.step_value(context)? else {\n // iv. If next is done, then\n // 1. Perform ? Set(A, \"length\", 𝔽(k), true).\n a.set(StaticJsStrings::LENGTH, k, true, context)?;\n // 2. Return A.\n return Ok(a.into());\n };\n\n // v. If mapping is true, then\n let mapped_value = if let Some(ref mapfn) = mapping {\n // 1. Let mappedValue be Completion(Call(mapper, thisArg, « next, 𝔽(k) »)).\n let mapped_value = mapfn.call(this_arg, &[next, k.into()], context);\n\n // 2. IfAbruptCloseIterator(mappedValue, iteratorRecord).\n if_abrupt_close_iterator!(mapped_value, iterator_record, context)\n } else {\n // vi. Else,\n // 1. Let mappedValue be next.\n next\n };\n\n // vii. Let defineStatus be Completion(CreateDataPropertyOrThrow(A, Pk, mappedValue)).\n let define_status = a.create_data_property_or_throw(k, mapped_value, context);\n\n // viii. IfAbruptCloseIterator(defineStatus, iteratorRecord).\n if_abrupt_close_iterator!(define_status, iterator_record, context);\n }\n\n // NOTE: The loop above has to return before it reaches iteration limit,\n // which is why it's safe to have this as the fallback return\n //\n // 1. Let error be ThrowCompletion(a newly created TypeError object).\n let error = Err(JsNativeError::typ()\n .with_message(\"Invalid array length\")\n .into());\n\n // 2. Return ? IteratorClose(iteratorRecord, error).\n iterator_record.close(error, context)\n }\n\n /// `Array.isArray( arg )`\n ///\n /// The isArray function takes one argument arg, and returns the Boolean value true\n /// if the argument is an object whose class internal property is \"Array\"; otherwise it returns false.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.isarray\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/isArray\n pub(crate) fn is_array(\n _: &JsValue,\n args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Return ? IsArray(arg).\n args.get_or_undefined(0).is_array().map(Into::into)\n }\n\n /// `Array.of(...items)`\n ///\n /// The Array.of method creates a new Array instance from a variable number of arguments,\n /// regardless of the number or type of arguments.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.of\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/of\n pub(crate) fn of(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let len be the number of elements in items.\n // 2. Let lenNumber be 𝔽(len).\n let len = args.len();\n\n // 3. Let C be the this value.\n // 4. If IsConstructor(C) is true, then\n // a. Let A be ? Construct(C, « lenNumber »).\n // 5. Else,\n // a. Let A be ? ArrayCreate(len).\n let a = match this.as_constructor() {\n Some(constructor) => constructor.construct(&[len.into()], None, context)?,\n _ => Self::array_create(len as u64, None, context)?,\n };\n\n // 6. Let k be 0.\n // 7. Repeat, while k < len,\n for (k, value) in args.iter().enumerate() {\n // a. Let kValue be items[k].\n // b. Let Pk be ! ToString(𝔽(k)).\n // c. Perform ? CreateDataPropertyOrThrow(A, Pk, kValue).\n a.create_data_property_or_throw(k, value.clone(), context)?;\n // d. Set k to k + 1.\n }\n\n // 8. Perform ? Set(A, \"length\", lenNumber, true).\n Self::set_length(&a, len as u64, context)?;\n\n // 9. Return A.\n Ok(a.into())\n }\n\n ///'Array.prototype.at(index)'\n ///\n /// The `at()` method takes an integer value and returns the item at that\n /// index, allowing for positive and negative integers. Negative integers\n /// count back from the last item in the array.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.at\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at\n pub(crate) fn at(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n //1. let O be ? ToObject(this value)\n let obj = this.to_object(context)?;\n //2. let len be ? LengthOfArrayLike(O)\n let len = obj.length_of_array_like(context)? as i64;\n //3. let relativeIndex be ? ToIntegerOrInfinity(index)\n let relative_index = args.get_or_undefined(0).to_integer_or_infinity(context)?;\n let k = match relative_index {\n //4. if relativeIndex >= 0, then let k be relativeIndex\n //check if positive and if below length of array\n IntegerOrInfinity::Integer(i) if i >= 0 && i < len => i,\n //5. Else, let k be len + relativeIndex\n //integer should be negative, so abs() and check if less than or equal to length of array\n IntegerOrInfinity::Integer(i) if i < 0 && i.abs() <= len => len + i,\n //handle most likely impossible case of\n //IntegerOrInfinity::NegativeInfinity || IntegerOrInfinity::PositiveInfinity\n //by returning undefined\n _ => return Ok(JsValue::undefined()),\n };\n //6. if k < 0 or k >= len,\n //handled by the above match guards\n //7. Return ? Get(O, !ToString(𝔽(k)))\n obj.get(k, context)\n }\n\n /// `Array.prototype.concat(...arguments)`\n ///\n /// When the concat method is called with zero or more arguments, it returns an\n /// array containing the array elements of the object followed by the array\n /// elements of each argument in order.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.concat\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/concat\n pub(crate) fn concat(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let obj = this.to_object(context)?;\n // 2. Let A be ? ArraySpeciesCreate(O, 0).\n let arr = Self::array_species_create(&obj, 0, context)?;\n // 3. Let n be 0.\n let mut n = 0;\n // 4. Prepend O to items.\n // 5. For each element E of items, do\n for item in std::iter::once(&JsValue::new(obj)).chain(args.iter()) {\n // a. Let spreadable be ? IsConcatSpreadable(E).\n let spreadable = Self::is_concat_spreadable(item, context)?;\n // b. If spreadable is true, then\n if spreadable {\n // item is guaranteed to be an object since is_concat_spreadable checks it,\n // so we can call `.unwrap()`\n let item = item.as_object().js_expect(\"guaranteed to be an object\")?;\n // i. Let k be 0.\n // ii. Let len be ? LengthOfArrayLike(E).\n let len = item.length_of_array_like(context)?;\n // iii. If n + len > 2^53 - 1, throw a TypeError exception.\n if n + len > Number::MAX_SAFE_INTEGER as u64 {\n return Err(JsNativeError::typ()\n .with_message(\n \"length + number of arguments exceeds the max safe integer limit\",\n )\n .into());\n }\n // iv. Repeat, while k < len,\n for k in 0..len {\n // 1. Let P be ! ToString(𝔽(k)).\n // 2. Let exists be ? HasProperty(E, P).\n // 3. If exists is true, then\n // 3.a. Let subElement be ? Get(E, P).\n if let Some(sub_element) = item.try_get(k, context)? {\n // b. Perform ? CreateDataPropertyOrThrow(A, ! ToString(𝔽(n)), subElement).\n arr.create_data_property_or_throw(n, sub_element, context)?;\n }\n // 4. Set n to n + 1.\n n += 1;\n // 5. Set k to k + 1.\n }\n }\n // c. Else,\n else {\n // i. NOTE: E is added as a single item rather than spread.\n // ii. If n ≥ 2^53 - 1, throw a TypeError exception.\n if n >= Number::MAX_SAFE_INTEGER as u64 {\n return Err(JsNativeError::typ()\n .with_message(\"length exceeds the max safe integer limit\")\n .into());\n }\n // iii. Perform ? CreateDataPropertyOrThrow(A, ! ToString(𝔽(n)), E).\n arr.create_data_property_or_throw(n, item.clone(), context)?;\n // iv. Set n to n + 1.\n n += 1;\n }\n }\n // 6. Perform ? Set(A, \"length\", 𝔽(n), true).\n Self::set_length(&arr, n, context)?;\n\n // 7. Return A.\n Ok(JsValue::new(arr))\n }\n\n /// `Array.prototype.push( ...items )`\n ///\n /// The arguments are appended to the end of the array, in the order in which\n /// they appear. The new length of the array is returned as the result of the\n /// call.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.push\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/push\n pub(crate) fn push(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let mut len = o.length_of_array_like(context)?;\n // 3. Let argCount be the number of elements in items.\n let arg_count = args.len() as u64;\n // 4. If len + argCount > 2^53 - 1, throw a TypeError exception.\n if len + arg_count > 2u64.pow(53) - 1 {\n return Err(JsNativeError::typ()\n .with_message(\n \"the length + the number of arguments exceed the maximum safe integer limit\",\n )\n .into());\n }\n // 5. For each element E of items, do\n for element in args.iter().cloned() {\n // a. Perform ? Set(O, ! ToString(𝔽(len)), E, true).\n o.set(len, element, true, context)?;\n // b. Set len to len + 1.\n len += 1;\n }\n // 6. Perform ? Set(O, \"length\", 𝔽(len), true).\n Self::set_length(&o, len, context)?;\n\n // 7. Return 𝔽(len).\n Ok(len.into())\n }\n\n /// `Array.prototype.pop()`\n ///\n /// The last element of the array is removed from the array and returned.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.pop\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/pop\n pub(crate) fn pop(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. If len = 0, then\n if len == 0 {\n // a. Perform ? Set(O, \"length\", +0𝔽, true).\n Self::set_length(&o, 0, context)?;\n\n // b. Return undefined.\n Ok(JsValue::undefined())\n // 4. Else,\n } else {\n // a. Assert: len > 0.\n // b. Let newLen be 𝔽(len - 1).\n let new_len = len - 1;\n // c. Let index be ! ToString(newLen).\n let index = new_len;\n // d. Let element be ? Get(O, index).\n let element = o.get(index, context)?;\n // e. Perform ? DeletePropertyOrThrow(O, index).\n o.delete_property_or_throw(index, context)?;\n // f. Perform ? Set(O, \"length\", newLen, true).\n Self::set_length(&o, new_len, context)?;\n // g. Return element.\n Ok(element)\n }\n }\n\n /// `Array.prototype.forEach( callbackFn [ , thisArg ] )`\n ///\n /// This method executes the provided callback function for each element in the array.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.foreach\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach\n pub(crate) fn for_each(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.\n let callback = args.get_or_undefined(0).as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(\"Array.prototype.forEach: invalid callback function\")\n })?;\n // 4. Let k be 0.\n // 5. Repeat, while k < len,\n for k in 0..len {\n // a. Let Pk be ! ToString(𝔽(k)).\n let pk = k;\n // b. Let kPresent be ? HasProperty(O, Pk).\n // c. If kPresent is true, then\n // c.i. Let kValue be ? Get(O, Pk).\n if let Some(k_value) = o.try_get(pk, context)? {\n // ii. Perform ? Call(callbackfn, thisArg, « kValue, 𝔽(k), O »).\n let this_arg = args.get_or_undefined(1);\n callback.call(this_arg, &[k_value, k.into(), o.clone().into()], context)?;\n }\n // d. Set k to k + 1.\n }\n // 6. Return undefined.\n Ok(JsValue::undefined())\n }\n\n /// `Array.prototype.join( separator )`\n ///\n /// The elements of the array are converted to Strings, and these Strings are\n /// then concatenated, separated by occurrences of the separator. If no\n /// separator is provided, a single comma is used as the separator.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.join\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/join\n pub(crate) fn join(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. If separator is undefined, let sep be the single-element String \",\".\n // 4. Else, let sep be ? ToString(separator).\n let separator = args.get_or_undefined(0);\n let separator = if separator.is_undefined() {\n js_string!(\",\")\n } else {\n separator.to_string(context)?\n };\n\n // 5. Let R be the empty String.\n let mut r = Vec::with_capacity(len as usize + len.saturating_sub(1) as usize);\n // 6. Let k be 0.\n // 7. Repeat, while k < len,\n for k in 0..len {\n // a. If k > 0, set R to the string-concatenation of R and sep.\n if k > 0 {\n r.push(separator.clone());\n }\n // b. Let element be ? Get(O, ! ToString(𝔽(k))).\n let element = o.get(k, context)?;\n // c. If element is undefined, null or the array itself, let next be the empty String; otherwise, let next be ? ToString(element).\n let next = if element.is_null_or_undefined() || &element == this {\n js_string!()\n } else {\n element.to_string(context)?\n };\n // d. Set R to the string-concatenation of R and next.\n r.push(next.clone());\n // e. Set k to k + 1.\n }\n // 8. Return R.\n Ok(js_string!(&r[..]).into())\n }\n\n /// `Array.prototype.toString( separator )`\n ///\n /// The toString function is intentionally generic; it does not require that\n /// its this value be an Array object. Therefore it can be transferred to\n /// other kinds of objects for use as a method.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.tostring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/toString\n #[allow(clippy::wrong_self_convention)]\n pub(crate) fn to_string(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let array be ? ToObject(this value).\n let array = this.to_object(context)?;\n // 2. Let func be ? Get(array, \"join\").\n let func = array.get(js_string!(\"join\"), context)?;\n // 3. If IsCallable(func) is false, set func to the intrinsic function %Object.prototype.toString%.\n // 4. Return ? Call(func, array).\n if let Some(func) = func.as_callable() {\n func.call(&array.into(), &[], context)\n } else {\n crate::builtins::object::OrdinaryObject::to_string(&array.into(), &[], context)\n }\n }\n\n /// `Array.prototype.reverse()`\n ///\n /// The elements of the array are rearranged so as to reverse their order.\n /// The object is returned as the result of the call.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.reverse\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reverse\n #[allow(clippy::else_if_without_else)]\n pub(crate) fn reverse(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. Let middle be floor(len / 2).\n let middle = len / 2;\n // 4. Let lower be 0.\n let mut lower = 0;\n // 5. Repeat, while lower ≠ middle,\n while lower != middle {\n // a. Let upper be len - lower - 1.\n let upper = len - lower - 1;\n // Skipped: b. Let upperP be ! ToString(𝔽(upper)).\n // Skipped: c. Let lowerP be ! ToString(𝔽(lower)).\n // d. Let lowerExists be ? HasProperty(O, lowerP).\n // e. If lowerExists is true, then\n // e.i. Let lowerValue be ? Get(O, lowerP).\n let lower_value = o.try_get(lower, context)?;\n // f. Let upperExists be ? HasProperty(O, upperP).\n // g. If upperExists is true, then\n // g.i. Let upperValue be ? Get(O, upperP).\n let upper_value = o.try_get(upper, context)?;\n match (lower_value, upper_value) {\n // h. If lowerExists is true and upperExists is true, then\n (Some(lower_value), Some(upper_value)) => {\n // i. Perform ? Set(O, lowerP, upperValue, true).\n o.set(lower, upper_value, true, context)?;\n // ii. Perform ? Set(O, upperP, lowerValue, true).\n o.set(upper, lower_value, true, context)?;\n }\n // i. Else if lowerExists is false and upperExists is true, then\n (None, Some(upper_value)) => {\n // i. Perform ? Set(O, lowerP, upperValue, true).\n o.set(lower, upper_value, true, context)?;\n // ii. Perform ? DeletePropertyOrThrow(O, upperP).\n o.delete_property_or_throw(upper, context)?;\n }\n // j. Else if lowerExists is true and upperExists is false, then\n (Some(lower_value), None) => {\n // i. Perform ? DeletePropertyOrThrow(O, lowerP).\n o.delete_property_or_throw(lower, context)?;\n // ii. Perform ? Set(O, upperP, lowerValue, true).\n o.set(upper, lower_value, true, context)?;\n }\n // k. Else,\n (None, None) => {\n // i. Assert: lowerExists and upperExists are both false.\n // ii. No action is required.\n }\n }\n\n // l. Set lower to lower + 1.\n lower += 1;\n }\n // 6. Return O.\n Ok(o.into())\n }\n\n /// [`Array.prototype.toReversed()`][spec]\n ///\n /// Reverses this array, returning the result into a copy of the array.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.toreversed\n pub(crate) fn to_reversed(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 3. Let A be ? ArrayCreate(len).\n let a = Array::array_create(len, None, context)?;\n\n // 4. Let k be 0.\n // 5. Repeat, while k < len,\n for i in 0..len {\n // a. Let from be ! ToString(𝔽(len - k - 1)).\n let from = len - i - 1;\n\n // b. Let Pk be ! ToString(𝔽(k)).\n // c. Let fromValue be ? Get(O, from).\n let from_value = o.get(from, context)?;\n\n // d. Perform ! CreateDataPropertyOrThrow(A, Pk, fromValue).\n a.create_data_property_or_throw(i, from_value, context)\n .js_expect(\"cannot fail per the spec\")?;\n\n // e. Set k to k + 1.\n }\n\n // 6. Return A.\n Ok(a.into())\n }\n\n /// `Array.prototype.shift()`\n ///\n /// The first element of the array is removed from the array and returned.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.shift\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/shift\n pub(crate) fn shift(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. If len = 0, then\n if len == 0 {\n // a. Perform ? Set(O, \"length\", +0𝔽, true).\n Self::set_length(&o, 0, context)?;\n\n // b. Return undefined.\n return Ok(JsValue::undefined());\n }\n\n // Small optimization for arrays using dense properties\n // TODO: this optimization could be generalized to many other objects with\n // slot-based dense property maps.\n if o.is_array() {\n let mut o_borrow = o.borrow_mut();\n if let IndexedProperties::DenseI32(dense) =\n &mut o_borrow.properties_mut().indexed_properties\n && len <= dense.len() as u64\n {\n let v = dense.remove(0);\n drop(o_borrow);\n Self::set_length(&o, len - 1, context)?;\n return Ok(v.into());\n }\n if let IndexedProperties::DenseF64(dense) =\n &mut o_borrow.properties_mut().indexed_properties\n && len <= dense.len() as u64\n {\n let v = dense.remove(0);\n drop(o_borrow);\n Self::set_length(&o, len - 1, context)?;\n return Ok(v.into());\n }\n if let Some(dense) = o_borrow.properties_mut().dense_indexed_properties_mut()\n && len <= dense.len() as u64\n {\n let v = dense.remove(0);\n drop(o_borrow);\n Self::set_length(&o, len - 1, context)?;\n return Ok(v);\n }\n }\n\n // 4. Let first be ? Get(O, \"0\").\n let first = o.get(0, context)?;\n // 5. Let k be 1.\n // 6. Repeat, while k < len,\n for k in 1..len {\n // a. Let from be ! ToString(𝔽(k)).\n let from = k;\n // b. Let to be ! ToString(𝔽(k - 1)).\n let to = k - 1;\n // c. Let fromPresent be ? HasProperty(O, from).\n // d. If fromPresent is true, then\n // d.i. Let fromVal be ? Get(O, from).\n if let Some(from_val) = o.try_get(from, context)? {\n // ii. Perform ? Set(O, to, fromVal, true).\n o.set(to, from_val, true, context)?;\n // e. Else,\n } else {\n // i. Assert: fromPresent is false.\n // ii. Perform ? DeletePropertyOrThrow(O, to).\n o.delete_property_or_throw(to, context)?;\n }\n // f. Set k to k + 1.\n }\n // 7. Perform ? DeletePropertyOrThrow(O, ! ToString(𝔽(len - 1))).\n o.delete_property_or_throw(len - 1, context)?;\n // 8. Perform ? Set(O, \"length\", 𝔽(len - 1), true).\n Self::set_length(&o, len - 1, context)?;\n // 9. Return first.\n Ok(first)\n }\n\n /// `Array.prototype.unshift( ...items )`\n ///\n /// The arguments are prepended to the start of the array, such that their order\n /// within the array is the same as the order in which they appear in the\n /// argument list.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.unshift\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/unshift\n pub(crate) fn unshift(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. Let argCount be the number of elements in items.\n let arg_count = args.len() as u64;\n // 4. If argCount > 0, then\n if arg_count > 0 {\n // a. If len + argCount > 2^53 - 1, throw a TypeError exception.\n if len + arg_count > 2u64.pow(53) - 1 {\n return Err(JsNativeError::typ()\n .with_message(\"length + number of arguments exceeds the max safe integer limit\")\n .into());\n }\n // b. Let k be len.\n let mut k = len;\n // c. Repeat, while k > 0,\n while k > 0 {\n // i. Let from be ! ToString(𝔽(k - 1)).\n let from = k - 1;\n // ii. Let to be ! ToString(𝔽(k + argCount - 1)).\n let to = k + arg_count - 1;\n // iii. Let fromPresent be ? HasProperty(O, from).\n // iv. If fromPresent is true, then\n // iv.1. Let fromValue be ? Get(O, from).\n if let Some(from_value) = o.try_get(from, context)? {\n // 2. Perform ? Set(O, to, fromValue, true).\n o.set(to, from_value, true, context)?;\n // v. Else,\n } else {\n // 1. Assert: fromPresent is false.\n // 2. Perform ? DeletePropertyOrThrow(O, to).\n o.delete_property_or_throw(to, context)?;\n }\n // vi. Set k to k - 1.\n k -= 1;\n }\n // d. Let j be +0𝔽.\n // e. For each element E of items, do\n for (j, e) in args.iter().enumerate() {\n // i. Perform ? Set(O, ! ToString(j), E, true).\n o.set(j, e.clone(), true, context)?;\n // ii. Set j to j + 1𝔽.\n }\n }\n // 5. Perform ? Set(O, \"length\", 𝔽(len + argCount), true).\n Self::set_length(&o, len + arg_count, context)?;\n\n // 6. Return 𝔽(len + argCount).\n Ok((len + arg_count).into())\n }\n\n /// `Array.prototype.every( callback, [ thisArg ] )`\n ///\n /// The every method executes the provided callback function once for each\n /// element present in the array until it finds the one where callback returns\n /// a falsy value. It returns `false` if it finds such element, otherwise it\n /// returns `true`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.every\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every\n pub(crate) fn every(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.\n let callback = args.get_or_undefined(0).as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(\"Array.prototype.every: callback is not callable\")\n })?;\n\n let this_arg = args.get_or_undefined(1);\n\n // 4. Let k be 0.\n // 5. Repeat, while k < len,\n for k in 0..len {\n // a. Let Pk be ! ToString(𝔽(k)).\n // b. Let kPresent be ? HasProperty(O, Pk).\n // c. If kPresent is true, then\n // c.i. Let kValue be ? Get(O, Pk).\n if let Some(k_value) = o.try_get(k, context)? {\n // ii. Let testResult be ! ToBoolean(? Call(callbackfn, thisArg, « kValue, 𝔽(k), O »)).\n let test_result = callback\n .call(this_arg, &[k_value, k.into(), o.clone().into()], context)?\n .to_boolean();\n // iii. If testResult is false, return false.\n if !test_result {\n return Ok(JsValue::new(false));\n }\n }\n // d. Set k to k + 1.\n }\n // 6. Return true.\n Ok(JsValue::new(true))\n }\n\n /// `Array.prototype.map( callback, [ thisArg ] )`\n ///\n /// For each element in the array the callback function is called, and a new\n /// array is constructed from the return values of these calls.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.map\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map\n pub(crate) fn map(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.\n let callback = args.get_or_undefined(0).as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(\"Array.prototype.map: Callbackfn is not callable\")\n })?;\n\n // 4. Let A be ? ArraySpeciesCreate(O, len).\n let a = Self::array_species_create(&o, len, context)?;\n\n let this_arg = args.get_or_undefined(1);\n\n // 5. Let k be 0.\n // 6. Repeat, while k < len,\n for k in 0..len {\n // a. Let Pk be ! ToString(𝔽(k)).\n // b. Let k_present be ? HasProperty(O, Pk).\n // c. If k_present is true, then\n // c.i. Let kValue be ? Get(O, Pk).\n if let Some(k_value) = o.try_get(k, context)? {\n // ii. Let mappedValue be ? Call(callbackfn, thisArg, « kValue, 𝔽(k), O »).\n let mapped_value =\n callback.call(this_arg, &[k_value, k.into(), o.clone().into()], context)?;\n // iii. Perform ? CreateDataPropertyOrThrow(A, Pk, mappedValue).\n a.create_data_property_or_throw(k, mapped_value, context)?;\n }\n // d. Set k to k + 1.\n }\n // 7. Return A.\n Ok(a.into())\n }\n\n /// `Array.prototype.indexOf( searchElement[, fromIndex ] )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.indexof\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf\n pub(crate) fn index_of(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)? as i64;\n\n // 3. If len is 0, return -1𝔽.\n if len == 0 {\n return Ok(JsValue::new(-1));\n }\n\n // 4. Let n be ? ToIntegerOrInfinity(fromIndex).\n let n = args\n .get(1)\n .cloned()\n .unwrap_or_default()\n .to_integer_or_infinity(context)?;\n // 5. Assert: If fromIndex is undefined, then n is 0.\n let n = match n {\n // 6. If n is +∞, return -1𝔽.\n IntegerOrInfinity::PositiveInfinity => return Ok(JsValue::new(-1)),\n // 7. Else if n is -∞, set n to 0.\n IntegerOrInfinity::NegativeInfinity => 0,\n IntegerOrInfinity::Integer(value) => value,\n };\n\n // 8. If n ≥ 0, then\n let mut k;\n if n >= 0 {\n // a. Let k be n.\n k = n;\n // 9. Else,\n } else {\n // a. Let k be len + n.\n k = len + n;\n // b. If k < 0, set k to 0.\n if k < 0 {\n k = 0;\n }\n }\n\n let search_element = args.get_or_undefined(0);\n\n // 10. Repeat, while k < len,\n while k < len {\n // a. Let kPresent be ? HasProperty(O, ! ToString(𝔽(k))).\n // b. If kPresent is true, then\n // b.i. Let elementK be ? Get(O, ! ToString(𝔽(k))).\n if let Some(element_k) = o.try_get(k, context)? {\n // ii. Let same be IsStrictlyEqual(searchElement, elementK).\n // iii. If same is true, return 𝔽(k).\n if search_element.strict_equals(&element_k) {\n return Ok(JsValue::new(k));\n }\n }\n // c. Set k to k + 1.\n k += 1;\n }\n // 11. Return -1𝔽.\n Ok(JsValue::new(-1))\n }\n\n /// `Array.prototype.lastIndexOf( searchElement[, fromIndex ] )`\n ///\n ///\n /// `lastIndexOf` compares searchElement to the elements of the array in descending order\n /// using the Strict Equality Comparison algorithm, and if found at one or more indices,\n /// returns the largest such index; otherwise, -1 is returned.\n ///\n /// The optional second argument fromIndex defaults to the array's length minus one\n /// (i.e. the whole array is searched). If it is greater than or equal to the length of the array,\n /// the whole array will be searched. If it is negative, it is used as the offset from the end\n /// of the array to compute fromIndex. If the computed index is less than 0, -1 is returned.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.lastindexof\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf\n pub(crate) fn last_index_of(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)? as i64;\n\n // 3. If len is 0, return -1𝔽.\n if len == 0 {\n return Ok(JsValue::new(-1));\n }\n\n // 4. If fromIndex is present, let n be ? ToIntegerOrInfinity(fromIndex); else let n be len - 1.\n let n = if let Some(from_index) = args.get(1) {\n from_index.to_integer_or_infinity(context)?\n } else {\n IntegerOrInfinity::Integer(len - 1)\n };\n\n let mut k = match n {\n // 5. If n is -∞, return -1𝔽.\n IntegerOrInfinity::NegativeInfinity => return Ok(JsValue::new(-1)),\n // 6. If n ≥ 0, then\n // a. Let k be min(n, len - 1).\n IntegerOrInfinity::Integer(n) if n >= 0 => min(n, len - 1),\n IntegerOrInfinity::PositiveInfinity => len - 1,\n // 7. Else,\n // a. Let k be len + n.\n IntegerOrInfinity::Integer(n) => len + n,\n };\n\n let search_element = args.get_or_undefined(0);\n\n // 8. Repeat, while k ≥ 0,\n while k >= 0 {\n // a. Let kPresent be ? HasProperty(O, ! ToString(𝔽(k))).\n // b. If kPresent is true, then\n // b.i. Let elementK be ? Get(O, ! ToString(𝔽(k))).\n if let Some(element_k) = o.try_get(k, context)? {\n // ii. Let same be IsStrictlyEqual(searchElement, elementK).\n // iii. If same is true, return 𝔽(k).\n if JsValue::strict_equals(search_element, &element_k) {\n return Ok(JsValue::new(k));\n }\n }\n // c. Set k to k - 1.\n k -= 1;\n }\n // 9. Return -1𝔽.\n Ok(JsValue::new(-1))\n }\n\n /// `Array.prototype.find( callback, [thisArg] )`\n ///\n /// The find method executes the callback function once for each index of the array\n /// until the callback returns a truthy value. If so, find immediately returns the value\n /// of that element. Otherwise, find returns undefined.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.find\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find\n pub(crate) fn find(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n let predicate = args.get_or_undefined(0);\n let this_arg = args.get_or_undefined(1);\n\n // 3. Let findRec be ? FindViaPredicate(O, len, ascending, predicate, thisArg).\n let (_, value) = find_via_predicate(\n &o,\n len,\n Direction::Ascending,\n predicate,\n this_arg,\n context,\n \"Array.prototype.find\",\n )?;\n\n // 4. Return findRec.[[Value]].\n Ok(value)\n }\n\n /// `Array.prototype.findIndex( predicate [ , thisArg ] )`\n ///\n /// This method executes the provided predicate function for each element of the array.\n /// If the predicate function returns `true` for an element, this method returns the index of the element.\n /// If all elements return `false`, the value `-1` is returned.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.findindex\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex\n pub(crate) fn find_index(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n let predicate = args.get_or_undefined(0);\n let this_arg = args.get_or_undefined(1);\n\n // 3. Let findRec be ? FindViaPredicate(O, len, ascending, predicate, thisArg).\n let (index, _) = find_via_predicate(\n &o,\n len,\n Direction::Ascending,\n predicate,\n this_arg,\n context,\n \"Array.prototype.findIndex\",\n )?;\n\n // 4. Return findRec.[[Index]].\n Ok(index)\n }\n\n /// `Array.prototype.findLast( predicate, [thisArg] )`\n ///\n /// findLast calls predicate once for each element of the array, in descending order,\n /// until it finds one where predicate returns true. If such an element is found, findLast\n /// immediately returns that element value. Otherwise, findLast returns undefined.\n ///\n /// More information:\n /// - [ECMAScript proposal][spec]\n ///\n /// [spec]: https://tc39.es/proposal-array-find-from-last/#sec-array.prototype.findlast\n pub(crate) fn find_last(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n let predicate = args.get_or_undefined(0);\n let this_arg = args.get_or_undefined(1);\n\n // 3. Let findRec be ? FindViaPredicate(O, len, descending, predicate, thisArg).\n let (_, value) = find_via_predicate(\n &o,\n len,\n Direction::Descending,\n predicate,\n this_arg,\n context,\n \"Array.prototype.findLast\",\n )?;\n\n // 4. Return findRec.[[Value]].\n Ok(value)\n }\n\n /// `Array.prototype.findLastIndex( predicate [ , thisArg ] )`\n ///\n /// `findLastIndex` calls predicate once for each element of the array, in descending order,\n /// until it finds one where predicate returns true. If such an element is found, `findLastIndex`\n /// immediately returns the index of that element value. Otherwise, `findLastIndex` returns -1.\n ///\n /// More information:\n /// - [ECMAScript proposal][spec]\n ///\n /// [spec]: https://tc39.es/proposal-array-find-from-last/#sec-array.prototype.findlastindex\n pub(crate) fn find_last_index(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n let predicate = args.get_or_undefined(0);\n let this_arg = args.get_or_undefined(1);\n\n // 3. Let findRec be ? FindViaPredicate(O, len, descending, predicate, thisArg).\n let (index, _) = find_via_predicate(\n &o,\n len,\n Direction::Descending,\n predicate,\n this_arg,\n context,\n \"Array.prototype.findLastIndex\",\n )?;\n\n // 4. Return findRec.[[Index]].\n Ok(index)\n }\n\n /// `Array.prototype.flat( [depth] )`\n ///\n /// This method creates a new array with all sub-array elements concatenated into it\n /// recursively up to the specified depth.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.flat\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/flat\n pub(crate) fn flat(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ToObject(this value)\n let o = this.to_object(context)?;\n\n // 2. Let sourceLen be LengthOfArrayLike(O)\n let source_len = o.length_of_array_like(context)?;\n\n // 3. Let depthNum be 1\n // 4. If depth is not undefined, then set depthNum to IntegerOrInfinity(depth)\n let depth = args.get_or_undefined(0);\n let depth_num = if depth.is_undefined() {\n 1\n } else {\n // a. Set depthNum to ? ToIntegerOrInfinity(depth).\n // b. If depthNum < 0, set depthNum to 0.\n match depth.to_integer_or_infinity(context)? {\n IntegerOrInfinity::Integer(value) if value >= 0 => value as u64,\n IntegerOrInfinity::PositiveInfinity => u64::MAX,\n _ => 0,\n }\n };\n\n // 5. Let A be ArraySpeciesCreate(O, 0)\n let a = Self::array_species_create(&o, 0, context)?;\n\n // 6. Perform ? FlattenIntoArray(A, O, sourceLen, 0, depthNum)\n Self::flatten_into_array(\n &a,\n &o,\n source_len,\n 0,\n depth_num,\n None,\n &JsValue::undefined(),\n context,\n )?;\n\n Ok(a.into())\n }\n\n /// `Array.prototype.flatMap( callback, [ thisArg ] )`\n ///\n /// This method returns a new array formed by applying a given callback function to\n /// each element of the array, and then flattening the result by one level. It is\n /// identical to a `map()` followed by a `flat()` of depth 1, but slightly more\n /// efficient than calling those two methods separately.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.flatMap\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/flatMap\n pub(crate) fn flat_map(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ToObject(this value)\n let o = this.to_object(context)?;\n\n // 2. Let sourceLen be LengthOfArrayLike(O)\n let source_len = o.length_of_array_like(context)?;\n\n // 3. If ! IsCallable(mapperFunction) is false, throw a TypeError exception.\n let mapper_function = args.get_or_undefined(0).as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(\"flatMap mapper function is not callable\")\n })?;\n\n // 4. Let A be ? ArraySpeciesCreate(O, 0).\n let a = Self::array_species_create(&o, 0, context)?;\n\n // 5. Perform ? FlattenIntoArray(A, O, sourceLen, 0, 1, mapperFunction, thisArg).\n Self::flatten_into_array(\n &a,\n &o,\n source_len,\n 0,\n 1,\n Some(&mapper_function),\n args.get_or_undefined(1),\n context,\n )?;\n\n // 6. Return A\n Ok(a.into())\n }\n\n /// Abstract method `FlattenIntoArray`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-flattenintoarray\n #[allow(clippy::too_many_arguments)]\n fn flatten_into_array(\n target: &JsObject,\n source: &JsObject,\n source_len: u64,\n start: u64,\n depth: u64,\n mapper_function: Option<&JsObject>,\n this_arg: &JsValue,\n context: &mut Context,\n ) -> JsResult {\n // 1. Assert target is Object\n // 2. Assert source is Object\n\n // 3. Assert if mapper_function is present, then:\n // - IsCallable(mapper_function) is true\n // - thisArg is present\n // - depth is 1\n\n // 4. Let targetIndex be start\n let mut target_index = start;\n\n // 5. Let sourceIndex be 0\n let mut source_index = 0;\n\n // 6. Repeat, while R(sourceIndex) < sourceLen\n while source_index < source_len {\n // a. Let P be ToString(sourceIndex)\n let p = source_index;\n\n // b. Let exists be ? HasProperty(source, P).\n // c. If exists is true, then\n // c.i. Let element be Get(source, P)\n if let Some(mut element) = source.try_get(p, context)? {\n // ii. If mapperFunction is present, then\n if let Some(mapper_function) = mapper_function {\n // 1. Set element to ? Call(mapperFunction, thisArg, <>)\n element = mapper_function.call(\n this_arg,\n &[element, source_index.into(), source.clone().into()],\n context,\n )?;\n }\n\n // iii. Let shouldFlatten be false\n // iv. If depth > 0, then\n let should_flatten = if depth > 0 {\n // 1. Set shouldFlatten to ? IsArray(element).\n element.is_array()?\n } else {\n false\n };\n\n // v. If shouldFlatten is true\n if should_flatten {\n // For `should_flatten` to be true, element must be an object.\n let element = element.as_object().js_expect(\"must be an object\")?;\n\n // 1. If depth is +Infinity let newDepth be +Infinity\n let new_depth = if depth == u64::MAX {\n u64::MAX\n // 2. Else, let newDepth be depth - 1\n } else {\n depth - 1\n };\n\n // 3. Let elementLen be ? LengthOfArrayLike(element)\n let element_len = element.length_of_array_like(context)?;\n\n // 4. Set targetIndex to ? FlattenIntoArray(target, element, elementLen, targetIndex, newDepth)\n target_index = Self::flatten_into_array(\n target,\n &element,\n element_len,\n target_index,\n new_depth,\n None,\n &JsValue::undefined(),\n context,\n )?;\n\n // vi. Else\n } else {\n // 1. If targetIndex >= 2^53 - 1, throw a TypeError exception\n if target_index >= Number::MAX_SAFE_INTEGER as u64 {\n return Err(JsNativeError::typ()\n .with_message(\"Target index exceeded max safe integer value\")\n .into());\n }\n\n // 2. Perform ? CreateDataPropertyOrThrow(target, targetIndex, element)\n target.create_data_property_or_throw(target_index, element, context)?;\n\n // 3. Set targetIndex to targetIndex + 1\n target_index += 1;\n }\n }\n // d. Set sourceIndex to sourceIndex + 1\n source_index += 1;\n }\n\n // 7. Return targetIndex\n Ok(target_index)\n }\n\n /// `Array.prototype.fill( value[, start[, end]] )`\n ///\n /// The method fills (modifies) all the elements of an array from start index (default 0)\n /// to an end index (default array length) with a static value. It returns the modified array.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.fill\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/fill\n pub(crate) fn fill(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 3. Let relativeStart be ? ToIntegerOrInfinity(start).\n // 4. If relativeStart is -∞, let k be 0.\n // 5. Else if relativeStart < 0, let k be max(len + relativeStart, 0).\n // 6. Else, let k be min(relativeStart, len).\n let mut k = Self::get_relative_start(context, args.get_or_undefined(1), len)?;\n\n // 7. If end is undefined, let relativeEnd be len; else let relativeEnd be ? ToIntegerOrInfinity(end).\n // 8. If relativeEnd is -∞, let final be 0.\n // 9. Else if relativeEnd < 0, let final be max(len + relativeEnd, 0).\n // 10. Else, let final be min(relativeEnd, len).\n let final_ = Self::get_relative_end(context, args.get_or_undefined(2), len)?;\n\n let value = args.get_or_undefined(0);\n\n // 11. Repeat, while k < final,\n while k < final_ {\n // a. Let Pk be ! ToString(𝔽(k)).\n let pk = k;\n // b. Perform ? Set(O, Pk, value, true).\n o.set(pk, value.clone(), true, context)?;\n // c. Set k to k + 1.\n k += 1;\n }\n // 12. Return O.\n Ok(o.into())\n }\n\n /// `Array.prototype.includes( valueToFind [, fromIndex] )`\n ///\n /// Determines whether an array includes a certain value among its entries, returning `true` or `false` as appropriate.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.includes\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/includes\n pub(crate) fn includes_value(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)? as i64;\n\n // 3. If len is 0, return false.\n if len == 0 {\n return Ok(JsValue::new(false));\n }\n\n // 4. Let n be ? ToIntegerOrInfinity(fromIndex).\n let n = args\n .get(1)\n .cloned()\n .unwrap_or_default()\n .to_integer_or_infinity(context)?;\n // 5. Assert: If fromIndex is undefined, then n is 0.\n // 6. If n is +∞, return false.\n // 7. Else if n is -∞, set n to 0.\n let n = match n {\n IntegerOrInfinity::PositiveInfinity => return Ok(JsValue::new(false)),\n IntegerOrInfinity::NegativeInfinity => 0,\n IntegerOrInfinity::Integer(value) => value,\n };\n\n // 8. If n ≥ 0, then\n let mut k;\n if n >= 0 {\n // a. Let k be n.\n k = n;\n // 9. Else,\n } else {\n // a. Let k be len + n.\n k = len + n;\n // b. If k < 0, set k to 0.\n if k < 0 {\n k = 0;\n }\n }\n\n let search_element = args.get_or_undefined(0);\n\n // 10. Repeat, while k < len,\n while k < len {\n // a. Let elementK be ? Get(O, ! ToString(𝔽(k))).\n let element_k = o.get(k, context)?;\n // b. If SameValueZero(searchElement, elementK) is true, return true.\n if JsValue::same_value_zero(search_element, &element_k) {\n return Ok(JsValue::new(true));\n }\n // c. Set k to k + 1.\n k += 1;\n }\n // 11. Return false.\n Ok(JsValue::new(false))\n }\n\n /// `Array.prototype.slice( [begin[, end]] )`\n ///\n /// The slice method takes two arguments, start and end, and returns an array containing the\n /// elements of the array from element start up to, but not including, element end (or through the\n /// end of the array if end is undefined). If start is negative, it is treated as length + start\n /// where length is the length of the array. If end is negative, it is treated as length + end where\n /// length is the length of the array.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.slice\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice\n pub(crate) fn slice(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 3. Let relativeStart be ? ToIntegerOrInfinity(start).\n // 4. If relativeStart is -∞, let k be 0.\n // 5. Else if relativeStart < 0, let k be max(len + relativeStart, 0).\n // 6. Else, let k be min(relativeStart, len).\n let mut k = Self::get_relative_start(context, args.get_or_undefined(0), len)?;\n\n // 7. If end is undefined, let relativeEnd be len; else let relativeEnd be ? ToIntegerOrInfinity(end).\n // 8. If relativeEnd is -∞, let final be 0.\n // 9. Else if relativeEnd < 0, let final be max(len + relativeEnd, 0).\n // 10. Else, let final be min(relativeEnd, len).\n let final_ = Self::get_relative_end(context, args.get_or_undefined(1), len)?;\n\n // 11. Let count be max(final - k, 0).\n let count = final_.saturating_sub(k);\n\n // 12. Let A be ? ArraySpeciesCreate(O, count).\n let a = Self::array_species_create(&o, count, context)?;\n\n // 13. Let n be 0.\n let mut n: u64 = 0;\n // 14. Repeat, while k < final,\n while k < final_ {\n // a. Let Pk be ! ToString(𝔽(k)).\n let pk = k;\n // b. Let kPresent be ? HasProperty(O, Pk).\n // c. If kPresent is true, then\n // c.i. Let kValue be ? Get(O, Pk).\n if let Some(k_value) = o.try_get(pk, context)? {\n // ii. Perform ? CreateDataPropertyOrThrow(A, ! ToString(𝔽(n)), kValue).\n a.create_data_property_or_throw(n, k_value, context)?;\n }\n // d. Set k to k + 1.\n k += 1;\n // e. Set n to n + 1.\n n += 1;\n }\n\n // 15. Perform ? Set(A, \"length\", 𝔽(n), true).\n Self::set_length(&a, n, context)?;\n\n // 16. Return A.\n Ok(a.into())\n }\n\n /// [`Array.prototype.toLocaleString ( [ locales [ , options ] ] )`][spec].\n ///\n /// Returns a string representing the elements of the array. The elements are converted to\n /// strings using their `toLocaleString` methods and these strings are separated by a\n /// locale-specific string (such as a comma \",\").\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sup-array.prototype.tolocalestring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/toLocaleString\n pub(crate) fn to_locale_string(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let array be ? ToObject(this value).\n let array = this.to_object(context)?;\n // 2. Let len be ? ToLength(? Get(array, \"length\")).\n let len = array.length_of_array_like(context)?;\n\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n\n // 3. Let separator be the implementation-defined list-separator String value appropriate for the host environment's current locale (such as \", \").\n let separator = {\n #[cfg(feature = \"intl\")]\n {\n use crate::builtins::intl::locale::default_locale;\n use icu_list::{\n ListFormatter, ListFormatterPreferences, options::ListFormatterOptions,\n };\n\n let locale = default_locale(context.intl_provider().locale_canonicalizer()?);\n let preferences = ListFormatterPreferences::from(&locale);\n let formatter = ListFormatter::try_new_unit_with_buffer_provider(\n context.intl_provider().erased_provider(),\n preferences,\n ListFormatterOptions::default(),\n )\n .map_err(|e| JsNativeError::typ().with_message(e.to_string()))?;\n\n // Ask ICU for the list pattern literal by formatting two empty elements.\n // For many locales this yields \", \", but it may differ.\n js_string!(\n formatter.format_to_string(std::iter::once(\"\").chain(std::iter::once(\"\")))\n )\n }\n\n #[cfg(not(feature = \"intl\"))]\n {\n js_string!(\", \")\n }\n };\n\n // 4. Let R be the empty String.\n let mut r = Vec::with_capacity(len as usize + len.saturating_sub(1) as usize);\n\n // 5. Let k be 0.\n // 6. Repeat, while k < len,\n for k in 0..len {\n // a. If k > 0, then\n if k > 0 {\n // i. Set R to the string-concatenation of R and separator.\n r.extend(separator.iter());\n }\n\n // b. Let nextElement be ? Get(array, ! ToString(k)).\n let next = array.get(k, context)?;\n\n // c. If nextElement is not undefined or null, then\n if !next.is_null_or_undefined() {\n // i. Let S be ? ToString(? Invoke(nextElement, \"toLocaleString\", « locales, options »)).\n let s = next\n .invoke(\n js_string!(\"toLocaleString\"),\n &[locales.clone(), options.clone()],\n context,\n )?\n .to_string(context)?;\n\n // ii. Set R to the string-concatenation of R and S.\n r.extend(s.iter());\n }\n // d. Increase k by 1.\n }\n // 7. Return R.\n Ok(js_string!(&r[..]).into())\n }\n\n /// Gets the delete count of a splice operation.\n fn get_delete_count(\n len: u64,\n actual_start: u64,\n start: Option<&JsValue>,\n delete_count: Option<&JsValue>,\n context: &mut Context,\n ) -> JsResult {\n // 8. If start is not present, then\n let actual_delete_count = if start.is_none() {\n // a. Let actualDeleteCount be 0.\n 0\n }\n // 10. Else,\n else if let Some(delete_count) = delete_count {\n // a. Let dc be ? ToIntegerOrInfinity(deleteCount).\n let dc = delete_count.to_integer_or_infinity(context)?;\n\n // b. Let actualDeleteCount be the result of clamping dc between 0 and len - actualStart.\n let max = len - actual_start;\n match dc {\n IntegerOrInfinity::Integer(i) => u64::try_from(i)\n .unwrap_or_default()\n .clamp(0, len - actual_start),\n IntegerOrInfinity::PositiveInfinity => max,\n IntegerOrInfinity::NegativeInfinity => 0,\n }\n }\n // 9. Else if deleteCount is not present, then\n else {\n // a. Let actualDeleteCount be len - actualStart.\n len - actual_start\n };\n\n Ok(actual_delete_count)\n }\n\n /// `Array.prototype.splice ( start, [deleteCount[, ...items]] )`\n ///\n /// Splices an array by following\n /// The deleteCount elements of the array starting at integer index start are replaced by the elements of items.\n /// An Array object containing the deleted elements (if any) is returned.\n pub(crate) fn splice(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let start = args.first();\n let delete_count = args.get(1);\n let items = args.get(2..).unwrap_or_default();\n\n Self::splice_internal(this, start, delete_count, items, context)\n }\n\n pub(crate) fn splice_internal(\n this: &JsValue,\n start: Option<&JsValue>,\n delete_count: Option<&JsValue>,\n items: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 3. Let relativeStart be ? ToIntegerOrInfinity(start).\n // 4. If relativeStart = -∞, let actualStart be 0.\n // 5. Else if relativeStart < 0, let actualStart be max(len + relativeStart, 0).\n // 6. Else, let actualStart be min(relativeStart, len).\n let actual_start =\n Self::get_relative_start(context, start.unwrap_or(&JsValue::undefined()), len)?;\n\n // 7. Let itemCount be the number of elements in items.\n let item_count = items.len() as u64;\n\n let actual_delete_count =\n Self::get_delete_count(len, actual_start, start, delete_count, context)?;\n\n // If len + itemCount - actualDeleteCount > 2**53 - 1, throw a TypeError exception.\n if len + item_count - actual_delete_count > Number::MAX_SAFE_INTEGER as u64 {\n return Err(JsNativeError::typ()\n .with_message(\"Target splice exceeded max safe integer value\")\n .into());\n }\n\n // 12. Let A be ? ArraySpeciesCreate(O, actualDeleteCount).\n let arr = Self::array_species_create(&o, actual_delete_count, context)?;\n\n // 13. Let k be 0.\n // 14. Repeat, while k < actualDeleteCount,\n for k in 0..actual_delete_count {\n // a. Let from be ! ToString(𝔽(actualStart + k)).\n // b. If ? HasProperty(O, from) is true, then\n // b.i. Let fromValue be ? Get(O, from).\n if let Some(from_value) = o.try_get(actual_start + k, context)? {\n // ii. Perform ? CreateDataPropertyOrThrow(A, ! ToString(𝔽(k)), fromValue).\n arr.create_data_property_or_throw(k, from_value, context)?;\n }\n // c. Set k to k + 1.\n }\n\n // 15. Perform ? Set(A, \"length\", 𝔽(actualDeleteCount), true).\n Self::set_length(&arr, actual_delete_count, context)?;\n\n let item_count = items.len() as u64;\n\n match item_count.cmp(&actual_delete_count) {\n Ordering::Equal => {}\n // 16. If itemCount < actualDeleteCount, then\n Ordering::Less => {\n // a. Set k to actualStart.\n // b. Repeat, while k < (len - actualDeleteCount),\n for k in actual_start..(len - actual_delete_count) {\n // i. Let from be ! ToString(𝔽(k + actualDeleteCount)).\n let from = k + actual_delete_count;\n\n // ii. Let to be ! ToString(𝔽(k + itemCount)).\n let to = k + item_count;\n\n // iii. If ? HasProperty(O, from) is true, then\n // iii.1. Let fromValue be ? Get(O, from).\n if let Some(from_value) = o.try_get(from, context)? {\n // 2. Perform ? Set(O, to, fromValue, true).\n o.set(to, from_value, true, context)?;\n } else {\n // iv. Else,\n // 1. Perform ? DeletePropertyOrThrow(O, to).\n o.delete_property_or_throw(to, context)?;\n }\n // v. Set k to k + 1.\n }\n\n // c. Set k to len.\n // d. Repeat, while k > (len - actualDeleteCount + itemCount),\n for k in ((len - actual_delete_count + item_count)..len).rev() {\n // i. Perform ? DeletePropertyOrThrow(O, ! ToString(𝔽(k - 1))).\n o.delete_property_or_throw(k, context)?;\n\n // ii. Set k to k - 1.\n }\n }\n // 17. Else if itemCount > actualDeleteCount, then\n Ordering::Greater => {\n // a. Set k to (len - actualDeleteCount).\n // b. Repeat, while k > actualStart,\n for k in (actual_start..len - actual_delete_count).rev() {\n // i. Let from be ! ToString(𝔽(k + actualDeleteCount - 1)).\n let from = k + actual_delete_count;\n\n // ii. Let to be ! ToString(𝔽(k + itemCount - 1)).\n let to = k + item_count;\n\n // iii. If ? HasProperty(O, from) is true, then\n // iii.1. Let fromValue be ? Get(O, from).\n if let Some(from_value) = o.try_get(from, context)? {\n // 2. Perform ? Set(O, to, fromValue, true).\n o.set(to, from_value, true, context)?;\n }\n // iv. Else,\n else {\n // 1. Perform ? DeletePropertyOrThrow(O, to).\n o.delete_property_or_throw(to, context)?;\n }\n // v. Set k to k - 1.\n }\n }\n }\n\n // 18. Set k to actualStart.\n // 19. For each element E of items, do\n for (i, item) in items.iter().enumerate() {\n // a. Perform ? Set(O, ! ToString(𝔽(k)), E, true).\n // b. Set k to k + 1.\n o.set(actual_start + i as u64, item.clone(), true, context)?;\n }\n\n // 20. Perform ? Set(O, \"length\", 𝔽(len - actualDeleteCount + itemCount), true).\n Self::set_length(&o, len - actual_delete_count + item_count, context)?;\n\n // 21. Return A.\n Ok(JsValue::from(arr))\n }\n\n /// [`Array.prototype.toSpliced ( start, skipCount, ...items )`][spec]\n ///\n /// Splices the target array, returning the result as a new array.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.tospliced\n fn to_spliced(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n let start = args.first();\n let skip_count = args.get(1);\n let items = args.get(2..).unwrap_or_default();\n\n // 3. Let relativeStart be ? ToIntegerOrInfinity(start).\n // 4. If relativeStart is -∞, let actualStart be 0.\n // 5. Else if relativeStart < 0, let actualStart be max(len + relativeStart, 0).\n // 6. Else, let actualStart be min(relativeStart, len).\n let actual_start =\n Self::get_relative_start(context, start.unwrap_or(&JsValue::undefined()), len)?;\n\n // 7. Let insertCount be the number of elements in items.\n let insert_count = items.len() as u64;\n\n let actual_skip_count =\n Self::get_delete_count(len, actual_start, start, skip_count, context)?;\n\n // 11. Let newLen be len + insertCount - actualSkipCount.\n let new_len = len + insert_count - actual_skip_count;\n\n // 12. If newLen > 2**53 - 1, throw a TypeError exception.\n if new_len > Number::MAX_SAFE_INTEGER as u64 {\n return Err(JsNativeError::typ()\n .with_message(\"Target splice exceeded max safe integer value\")\n .into());\n }\n\n // 13. Let A be ? ArrayCreate(newLen).\n let arr = Array::array_create(new_len, None, context)?;\n\n // 14. Let i be 0.\n let mut i = 0;\n // 16. Repeat, while i < actualStart,\n while i < actual_start {\n // a. Let Pi be ! ToString(𝔽(i)).\n // b. Let iValue be ? Get(O, Pi).\n let value = o.get(i, context)?;\n\n // c. Perform ! CreateDataPropertyOrThrow(A, Pi, iValue).\n arr.create_data_property_or_throw(i, value, context)\n .js_expect(\"cannot fail for a newly created array\")?;\n\n // d. Set i to i + 1.\n i += 1;\n }\n\n // 17. For each element E of items, do\n for item in items.iter().cloned() {\n // a. Let Pi be ! ToString(𝔽(i)).\n // b. Perform ! CreateDataPropertyOrThrow(A, Pi, E).\n arr.create_data_property_or_throw(i, item, context)\n .js_expect(\"cannot fail for a newly created array\")?;\n\n // c. Set i to i + 1.\n i += 1;\n }\n\n // 15. Let r be actualStart + actualSkipCount.\n let mut r = actual_start + actual_skip_count;\n\n // 18. Repeat, while i < newLen,\n while i < new_len {\n // a. Let Pi be ! ToString(𝔽(i)).\n // b. Let from be ! ToString(𝔽(r)).\n // c. Let fromValue be ? Get(O, from).\n let from_value = o.get(r, context)?;\n\n // d. Perform ! CreateDataPropertyOrThrow(A, Pi, fromValue).\n arr.create_data_property_or_throw(i, from_value, context)\n .js_expect(\"cannot fail for a newly created array\")?;\n\n // e. Set i to i + 1.\n i += 1;\n // f. Set r to r + 1.\n r += 1;\n }\n\n // 19. Return A.\n Ok(arr.into())\n }\n\n /// `Array.prototype.filter( callback, [ thisArg ] )`\n ///\n /// For each element in the array the callback function is called, and a new\n /// array is constructed for every value whose callback returned a truthy value.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.filter\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter\n pub(crate) fn filter(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let length = o.length_of_array_like(context)?;\n\n // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.\n let callback = args.get_or_undefined(0).as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(\"Array.prototype.filter: `callback` must be callable\")\n })?;\n let this_arg = args.get_or_undefined(1);\n\n // 4. Let A be ? ArraySpeciesCreate(O, 0).\n let a = Self::array_species_create(&o, 0, context)?;\n\n // 5. Let k be 0.\n // 6. Let to be 0.\n let mut to = 0u32;\n // 7. Repeat, while k < len,\n for idx in 0..length {\n // a. Let Pk be ! ToString(𝔽(k)).\n // b. Let kPresent be ? HasProperty(O, Pk).\n // c. If kPresent is true, then\n // c.i. Let kValue be ? Get(O, Pk).\n if let Some(element) = o.try_get(idx, context)? {\n let args = [element.clone(), JsValue::new(idx), JsValue::new(o.clone())];\n\n // ii. Let selected be ! ToBoolean(? Call(callbackfn, thisArg, « kValue, 𝔽(k), O »)).\n let selected = callback.call(this_arg, &args, context)?.to_boolean();\n\n // iii. If selected is true, then\n if selected {\n // 1. Perform ? CreateDataPropertyOrThrow(A, ! ToString(𝔽(to)), kValue).\n a.create_data_property_or_throw(to, element, context)?;\n // 2. Set to to to + 1.\n to += 1;\n }\n }\n }\n\n // 8. Return A.\n Ok(a.into())\n }\n\n /// Array.prototype.some ( callbackfn [ , thisArg ] )\n ///\n /// The some method tests whether at least one element in the array passes\n /// the test implemented by the provided callback function. It returns a Boolean value,\n /// true if the callback function returns a truthy value for at least one element\n /// in the array. Otherwise, false.\n ///\n /// Caution: Calling this method on an empty array returns false for any condition!\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.some\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/some\n pub(crate) fn some(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.\n let callback = args.get_or_undefined(0).as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(\"Array.prototype.some: callback is not callable\")\n })?;\n\n // 4. Let k be 0.\n // 5. Repeat, while k < len,\n for k in 0..len {\n // a. Let Pk be ! ToString(𝔽(k)).\n // b. Let kPresent be ? HasProperty(O, Pk).\n // c. If kPresent is true, then\n // c.i. Let kValue be ? Get(O, Pk).\n if let Some(k_value) = o.try_get(k, context)? {\n // ii. Let testResult be ! ToBoolean(? Call(callbackfn, thisArg, « kValue, 𝔽(k), O »)).\n let this_arg = args.get_or_undefined(1);\n let test_result = callback\n .call(this_arg, &[k_value, k.into(), o.clone().into()], context)?\n .to_boolean();\n // iii. If testResult is true, return true.\n if test_result {\n return Ok(JsValue::new(true));\n }\n }\n // d. Set k to k + 1.\n }\n // 6. Return false.\n Ok(JsValue::new(false))\n }\n\n /// [`SortIndexedProperties ( obj, len, SortCompare, holes )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-sortindexedproperties\n pub(crate) fn sort_indexed_properties(\n obj: &JsObject,\n len: u64,\n sort_compare: F,\n skip_holes: bool,\n context: &mut Context,\n ) -> JsResult>\n where\n F: Fn(&JsValue, &JsValue, &mut Context) -> JsResult,\n {\n // 1. Let items be a new empty List.\n // doesn't matter if it clamps since it's just a best-effort optimization\n let mut items = Vec::with_capacity(len as usize);\n\n // 2. Let k be 0.\n // 3. Repeat, while k < len,\n for i in 0..len {\n // a. Let Pk be ! ToString(𝔽(k)).\n // b. If holes is skip-holes, then\n let read = if skip_holes {\n // i. Let kRead be ? HasProperty(obj, Pk).\n obj.has_property(i, context)?\n }\n // c. Else,\n else {\n // i. Assert: holes is read-through-holes.\n // ii. Let kRead be true.\n true\n };\n\n // d. If kRead is true, then\n if read {\n // i. Let kValue be ? Get(obj, Pk).\n // ii. Append kValue to items.\n items.push(obj.get(i, context)?);\n }\n // e. Set k to k + 1.\n }\n // 4. Sort items using an implementation-defined sequence of calls to SortCompare. If any such call returns an abrupt completion, stop before performing any further calls to SortCompare and return that Completion Record.\n let mut sort_err = Ok(());\n items.sort_by(|x, y| {\n if sort_err.is_ok() {\n sort_compare(x, y, context).unwrap_or_else(|err| {\n sort_err = Err(err);\n Ordering::Equal\n })\n } else {\n Ordering::Equal\n }\n });\n sort_err?;\n\n // 5. Return items.\n Ok(items)\n }\n\n /// Array.prototype.sort ( comparefn )\n ///\n /// The sort method sorts the elements of an array in place and returns the sorted array.\n /// The default sort order is ascending, built upon converting the elements into strings,\n /// then comparing their sequences of UTF-16 code units values.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.sort\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort\n pub(crate) fn sort(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If comparefn is not undefined and IsCallable(comparefn) is false, throw a TypeError exception.\n let comparefn = match args.get_or_undefined(0).variant() {\n JsVariant::Object(obj) if obj.is_callable() => Some(obj),\n JsVariant::Undefined => None,\n _ => {\n return Err(JsNativeError::typ()\n .with_message(\"The comparison function must be either a function or undefined\")\n .into());\n }\n };\n\n // 2. Let obj be ? ToObject(this value).\n let obj = this.to_object(context)?;\n\n // 3. Let len be ? LengthOfArrayLike(obj).\n let len = obj.length_of_array_like(context)?;\n\n // 4. Let SortCompare be a new Abstract Closure with parameters (x, y) that captures comparefn and performs the following steps when called:\n let sort_compare =\n |x: &JsValue, y: &JsValue, context: &mut Context| -> JsResult {\n // a. Return ? CompareArrayElements(x, y, comparefn).\n compare_array_elements(x, y, comparefn.as_ref(), context)\n };\n\n // 5. Let sortedList be ? SortIndexedProperties(obj, len, SortCompare, skip-holes).\n let sorted = Self::sort_indexed_properties(&obj, len, sort_compare, true, context)?;\n\n let sorted_len = sorted.len() as u64;\n\n // 6. Let itemCount be the number of elements in sortedList.\n // 7. Let j be 0.\n // 8. Repeat, while j < itemCount,\n for (j, item) in sorted.into_iter().enumerate() {\n // a. Perform ? Set(obj, ! ToString(𝔽(j)), sortedList[j], true).\n obj.set(j, item, true, context)?;\n\n // b. Set j to j + 1.\n }\n\n // 9. NOTE: The call to SortIndexedProperties in step 5 uses skip-holes. The remaining indices\n // are deleted to preserve the number of holes that were detected and excluded from the sort.\n // 10. Repeat, while j < len,\n for j in sorted_len..len {\n // a. Perform ? DeletePropertyOrThrow(obj, ! ToString(𝔽(j))).\n obj.delete_property_or_throw(j, context)?;\n\n // b. Set j to j + 1.\n }\n\n // 11. Return obj.\n Ok(obj.into())\n }\n\n /// [`Array.prototype.toSorted ( comparefn )`][spec]\n ///\n /// Orders the target array, returning the result in a new array.\n ///\n /// [spec]: https://tc39.es/ecma262/multipage/indexed-collections.html#sec-array.prototype.tosorted\n pub(crate) fn to_sorted(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If comparefn is not undefined and IsCallable(comparefn) is false, throw a TypeError exception.\n let comparefn = match args.get_or_undefined(0).variant() {\n JsVariant::Object(obj) if obj.is_callable() => Some(obj),\n JsVariant::Undefined => None,\n _ => {\n return Err(JsNativeError::typ()\n .with_message(\"The comparison function must be either a function or undefined\")\n .into());\n }\n };\n\n // 2. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 3. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 4. Let A be ? ArrayCreate(len).\n let arr = Array::array_create(len, None, context)?;\n\n // 5. Let SortCompare be a new Abstract Closure with parameters (x, y) that captures comparefn and performs the following steps when called:\n let sort_compare =\n |x: &JsValue, y: &JsValue, context: &mut Context| -> JsResult {\n // a. Return ? CompareArrayElements(x, y, comparefn).\n compare_array_elements(x, y, comparefn.as_ref(), context)\n };\n\n // 6. Let sortedList be ? SortIndexedProperties(O, len, SortCompare, read-through-holes).\n let sorted = Self::sort_indexed_properties(&o, len, sort_compare, false, context)?;\n\n // 7. Let j be 0.\n // 8. Repeat, while j < len,\n for (i, item) in sorted.into_iter().enumerate() {\n // a. Perform ! CreateDataPropertyOrThrow(A, ! ToString(𝔽(j)), sortedList[j]).\n arr.create_data_property_or_throw(i, item, context)\n .js_expect(\"cannot fail for a newly created array\")?;\n\n // b. Set j to j + 1.\n }\n\n // 9. Return A.\n Ok(arr.into())\n }\n\n /// `Array.prototype.reduce( callbackFn [ , initialValue ] )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.reduce\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce\n pub(crate) fn reduce(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.\n let callback = args.get_or_undefined(0).as_callable().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"Array.prototype.reduce: callback function is not callable\")\n })?;\n\n // 4. If len = 0 and initialValue is not present, throw a TypeError exception.\n if len == 0 && args.get(1).is_none() {\n return Err(JsNativeError::typ()\n .with_message(\n \"Array.prototype.reduce: called on an empty array and with no initial value\",\n )\n .into());\n }\n\n // 5. Let k be 0.\n let mut k = 0;\n // 6. Let accumulator be undefined.\n let mut accumulator = JsValue::undefined();\n\n // 7. If initialValue is present, then\n if let Some(initial_value) = args.get(1) {\n // a. Set accumulator to initialValue.\n accumulator = initial_value.clone();\n // 8. Else,\n } else {\n // a. Let kPresent be false.\n let mut k_present = false;\n // b. Repeat, while kPresent is false and k < len,\n while !k_present && k < len {\n // i. Let Pk be ! ToString(𝔽(k)).\n let pk = k;\n // ii. Set kPresent to ? HasProperty(O, Pk).\n // iii. If kPresent is true, then\n // iii.1. Set accumulator to ? Get(O, Pk).\n if let Some(v) = o.try_get(pk, context)? {\n accumulator = v;\n k_present = true;\n } else {\n k_present = false;\n }\n // iv. Set k to k + 1.\n k += 1;\n }\n // c. If kPresent is false, throw a TypeError exception.\n if !k_present {\n return Err(JsNativeError::typ().with_message(\n \"Array.prototype.reduce: called on an empty array and with no initial value\",\n ).into());\n }\n }\n\n // 9. Repeat, while k < len,\n while k < len {\n // a. Let Pk be ! ToString(𝔽(k)).\n let pk = k;\n // b. Let kPresent be ? HasProperty(O, Pk).\n // c. If kPresent is true, then\n // c.i. Let kValue be ? Get(O, Pk).\n if let Some(k_value) = o.try_get(pk, context)? {\n // ii. Set accumulator to ? Call(callbackfn, undefined, « accumulator, kValue, 𝔽(k), O »).\n accumulator = callback.call(\n &JsValue::undefined(),\n &[accumulator, k_value, k.into(), o.clone().into()],\n context,\n )?;\n }\n // d. Set k to k + 1.\n k += 1;\n }\n\n // 10. Return accumulator.\n Ok(accumulator)\n }\n\n /// `Array.prototype.reduceRight( callbackFn [ , initialValue ] )`\n ///\n /// The reduceRight method traverses right to left starting from the last defined value in the array,\n /// accumulating a value using a given callback function. It returns the accumulated value.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.reduceright\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduceRight\n pub(crate) fn reduce_right(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.\n let callback = args.get_or_undefined(0).as_callable().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"Array.prototype.reduceRight: callback function is not callable\")\n })?;\n\n // 4. If len is 0 and initialValue is not present, throw a TypeError exception.\n if len == 0 && args.get(1).is_none() {\n return Err(JsNativeError::typ().with_message(\n \"Array.prototype.reduceRight: called on an empty array and with no initial value\",\n ).into());\n }\n\n // 5. Let k be len - 1.\n let mut k = len as i64 - 1;\n // 6. Let accumulator be undefined.\n let mut accumulator = JsValue::undefined();\n // 7. If initialValue is present, then\n if let Some(initial_value) = args.get(1) {\n // a. Set accumulator to initialValue.\n accumulator = initial_value.clone();\n // 8. Else,\n } else {\n // a. Let kPresent be false.\n let mut k_present = false;\n // b. Repeat, while kPresent is false and k ≥ 0,\n while !k_present && k >= 0 {\n // i. Let Pk be ! ToString(𝔽(k)).\n let pk = k;\n // ii. Set kPresent to ? HasProperty(O, Pk).\n // iii. If kPresent is true, then\n // iii.1. Set accumulator to ? Get(O, Pk).\n if let Some(v) = o.try_get(pk, context)? {\n k_present = true;\n accumulator = v;\n } else {\n k_present = false;\n }\n // iv. Set k to k - 1.\n k -= 1;\n }\n // c. If kPresent is false, throw a TypeError exception.\n if !k_present {\n return Err(JsNativeError::typ().with_message(\n \"Array.prototype.reduceRight: called on an empty array and with no initial value\",\n ).into());\n }\n }\n\n // 9. Repeat, while k ≥ 0,\n while k >= 0 {\n // a. Let Pk be ! ToString(𝔽(k)).\n let pk = k;\n // b. Let kPresent be ? HasProperty(O, Pk).\n // c. If kPresent is true, then\n // c.i. Let kValue be ? Get(O, Pk).\n if let Some(k_value) = o.try_get(pk, context)? {\n // ii. Set accumulator to ? Call(callbackfn, undefined, « accumulator, kValue, 𝔽(k), O »).\n accumulator = callback.call(\n &JsValue::undefined(),\n &[accumulator.clone(), k_value, k.into(), o.clone().into()],\n context,\n )?;\n }\n // d. Set k to k - 1.\n k -= 1;\n }\n\n // 10. Return accumulator.\n Ok(accumulator)\n }\n\n /// `Array.prototype.copyWithin ( target, start [ , end ] )`\n ///\n /// The `copyWithin()` method shallow copies part of an array to another location\n /// in the same array and returns it without modifying its length.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.copywithin\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/copyWithin\n pub(crate) fn copy_within(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 3. Let relativeTarget be ? ToIntegerOrInfinity(target).\n // 4. If relativeTarget is -∞, let to be 0.\n // 5. Else if relativeTarget < 0, let to be max(len + relativeTarget, 0).\n // 6. Else, let to be min(relativeTarget, len).\n let mut to = Self::get_relative_start(context, args.get_or_undefined(0), len)? as i64;\n\n // 7. Let relativeStart be ? ToIntegerOrInfinity(start).\n // 8. If relativeStart is -∞, let from be 0.\n // 9. Else if relativeStart < 0, let from be max(len + relativeStart, 0).\n // 10. Else, let from be min(relativeStart, len).\n let mut from = Self::get_relative_start(context, args.get_or_undefined(1), len)? as i64;\n\n // 11. If end is undefined, let relativeEnd be len; else let relativeEnd be ? ToIntegerOrInfinity(end).\n // 12. If relativeEnd is -∞, let final be 0.\n // 13. Else if relativeEnd < 0, let final be max(len + relativeEnd, 0).\n // 14. Else, let final be min(relativeEnd, len).\n let final_ = Self::get_relative_end(context, args.get_or_undefined(2), len)? as i64;\n\n // 15. Let count be min(final - from, len - to).\n let mut count = min(final_ - from, len as i64 - to);\n\n // 16. If from < to and to < from + count, then\n let direction = if from < to && to < from + count {\n // b. Set from to from + count - 1.\n from = from + count - 1;\n // c. Set to to to + count - 1.\n to = to + count - 1;\n\n // a. Let direction be -1.\n -1\n // 17. Else,\n } else {\n // a. Let direction be 1.\n 1\n };\n\n // 18. Repeat, while count > 0,\n while count > 0 {\n // a. Let fromKey be ! ToString(𝔽(from)).\n let from_key = from;\n\n // b. Let toKey be ! ToString(𝔽(to)).\n let to_key = to;\n\n // c. Let fromPresent be ? HasProperty(O, fromKey).\n // d. If fromPresent is true, then\n // d.i. Let fromVal be ? Get(O, fromKey).\n if let Some(from_val) = o.try_get(from_key, context)? {\n // ii. Perform ? Set(O, toKey, fromVal, true).\n o.set(to_key, from_val, true, context)?;\n // e. Else,\n } else {\n // i. Assert: fromPresent is false.\n // ii. Perform ? DeletePropertyOrThrow(O, toKey).\n o.delete_property_or_throw(to_key, context)?;\n }\n // f. Set from to from + direction.\n from += direction;\n // g. Set to to to + direction.\n to += direction;\n // h. Set count to count - 1.\n count -= 1;\n }\n // 19. Return O.\n Ok(o.into())\n }\n\n /// `Array.prototype.values( )`\n ///\n /// The values method returns an iterable that iterates over the values in the array.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.values\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/values\n pub(crate) fn values(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Return CreateArrayIterator(O, value).\n Ok(ArrayIterator::create_array_iterator(\n o,\n PropertyNameKind::Value,\n context,\n ))\n }\n\n /// `Array.prototype.keys( )`\n ///\n /// The keys method returns an iterable that iterates over the indexes in the array.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.keys\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/values\n pub(crate) fn keys(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Return CreateArrayIterator(O, key).\n Ok(ArrayIterator::create_array_iterator(\n o,\n PropertyNameKind::Key,\n context,\n ))\n }\n\n /// `Array.prototype.entries( )`\n ///\n /// The entries method returns an iterable that iterates over the key-value pairs in the array.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.entries\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/values\n pub(crate) fn entries(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Return CreateArrayIterator(O, key+value).\n Ok(ArrayIterator::create_array_iterator(\n o,\n PropertyNameKind::KeyAndValue,\n context,\n ))\n }\n\n /// [`Array.prototype.with ( index, value )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype.with\n pub(crate) fn with(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let len be ? LengthOfArrayLike(O).\n let len = o.length_of_array_like(context)?;\n\n // 3. Let relativeIndex be ? ToIntegerOrInfinity(index).\n let IntegerOrInfinity::Integer(relative_index) =\n args.get_or_undefined(0).to_integer_or_infinity(context)?\n else {\n return Err(JsNativeError::range()\n .with_message(\"invalid integer index for TypedArray operation\")\n .into());\n };\n\n let value = args.get_or_undefined(1);\n\n // 4. If relativeIndex ≥ 0, let actualIndex be relativeIndex.\n let actual_index = u64::try_from(relative_index) // should succeed if `relative_index >= 0`\n .ok()\n // 5. Else, let actualIndex be len + relativeIndex.\n .or_else(|| len.checked_add_signed(relative_index))\n .filter(|&rel| rel < len)\n .ok_or_else(|| {\n // 6. If actualIndex ≥ len or actualIndex < 0, throw a RangeError exception.\n JsNativeError::range()\n .with_message(\"invalid integer index for TypedArray operation\")\n })?;\n\n // 7. Let A be ? ArrayCreate(len).\n let new_array = Array::array_create(len, None, context)?;\n\n // 8. Let k be 0.\n // 9. Repeat, while k < len,\n for k in 0..len {\n // a. Let Pk be ! ToString(𝔽(k)).\n let from_value = if k == actual_index {\n // b. If k is actualIndex, let fromValue be value.\n value.clone()\n } else {\n // c. Else, let fromValue be ? Get(O, Pk).\n o.get(k, context)?\n };\n\n // d. Perform ! CreateDataPropertyOrThrow(A, Pk, fromValue).\n new_array\n .create_data_property_or_throw(k, from_value, context)\n .js_expect(\"cannot fail for a newly created array\")?;\n\n // e. Set k to k + 1.\n }\n\n // 10. Return A.\n Ok(new_array.into())\n }\n\n /// Represents the algorithm to calculate `relativeStart` (or `k`) in array functions.\n pub(super) fn get_relative_start(\n context: &mut Context,\n arg: &JsValue,\n len: u64,\n ) -> JsResult {\n // 1. Let relativeStart be ? ToIntegerOrInfinity(start).\n let relative_start = arg.to_integer_or_infinity(context)?;\n let start = match relative_start {\n // 2. If relativeStart is -∞, let k be 0.\n IntegerOrInfinity::NegativeInfinity => 0,\n // 3. Else if relativeStart < 0, let k be max(len + relativeStart, 0).\n IntegerOrInfinity::Integer(i) if i < 0 => len.checked_add_signed(i).unwrap_or(0),\n // 4. Else, let k be min(relativeStart, len).\n IntegerOrInfinity::Integer(i) => min(i as u64, len),\n\n // Special case - positive infinity. `len` is always smaller than +inf, thus from (4)\n IntegerOrInfinity::PositiveInfinity => len,\n };\n\n Ok(start)\n }\n\n /// Represents the algorithm to calculate `relativeEnd` (or `final`) in array functions.\n pub(super) fn get_relative_end(\n context: &mut Context,\n value: &JsValue,\n len: u64,\n ) -> JsResult {\n // 1. If end is undefined, let relativeEnd be len [and return it]\n if value.is_undefined() {\n Ok(len)\n } else {\n // 1. cont, else let relativeEnd be ? ToIntegerOrInfinity(end).\n let relative_end = value.to_integer_or_infinity(context)?;\n let end = match relative_end {\n // 2. If relativeEnd is -∞, let final be 0.\n IntegerOrInfinity::NegativeInfinity => 0,\n // 3. Else if relativeEnd < 0, let final be max(len + relativeEnd, 0).\n IntegerOrInfinity::Integer(i) if i < 0 => len.checked_add_signed(i).unwrap_or(0),\n // 4. Else, let final be min(relativeEnd, len).\n // Both `as` casts are safe as both variables are non-negative\n IntegerOrInfinity::Integer(i) => min(i as u64, len),\n\n // Special case - positive infinity. `len` is always smaller than +inf, thus from (4)\n IntegerOrInfinity::PositiveInfinity => len,\n };\n\n Ok(end)\n }\n }\n\n /// `Array.prototype [ @@unscopables ]`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-array.prototype-@@unscopables\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/@@unscopables\n pub(crate) fn unscopables_object() -> JsObject {\n // 1. Let unscopableList be OrdinaryObjectCreate(null).\n let unscopable_list = JsObject::with_null_proto();\n let true_prop = PropertyDescriptor::builder()\n .value(true)\n .writable(true)\n .enumerable(true)\n .configurable(true);\n {\n let mut obj = unscopable_list.borrow_mut();\n // 2. Perform ! CreateDataPropertyOrThrow(unscopableList, \"at\", true).\n obj.insert(js_string!(\"at\"), true_prop.clone());\n // 3. Perform ! CreateDataPropertyOrThrow(unscopableList, \"copyWithin\", true).\n obj.insert(js_string!(\"copyWithin\"), true_prop.clone());\n // 4. Perform ! CreateDataPropertyOrThrow(unscopableList, \"entries\", true).\n obj.insert(js_string!(\"entries\"), true_prop.clone());\n // 5. Perform ! CreateDataPropertyOrThrow(unscopableList, \"fill\", true).\n obj.insert(js_string!(\"fill\"), true_prop.clone());\n // 6. Perform ! CreateDataPropertyOrThrow(unscopableList, \"find\", true).\n obj.insert(js_string!(\"find\"), true_prop.clone());\n // 7. Perform ! CreateDataPropertyOrThrow(unscopableList, \"findIndex\", true).\n obj.insert(js_string!(\"findIndex\"), true_prop.clone());\n // 8. Perform ! CreateDataPropertyOrThrow(unscopableList, \"findLast\", true).\n obj.insert(js_string!(\"findLast\"), true_prop.clone());\n // 9. Perform ! CreateDataPropertyOrThrow(unscopableList, \"findLastIndex\", true).\n obj.insert(js_string!(\"findLastIndex\"), true_prop.clone());\n // 10. Perform ! CreateDataPropertyOrThrow(unscopableList, \"flat\", true).\n obj.insert(js_string!(\"flat\"), true_prop.clone());\n // 11. Perform ! CreateDataPropertyOrThrow(unscopableList, \"flatMap\", true).\n obj.insert(js_string!(\"flatMap\"), true_prop.clone());\n // 12. Perform ! CreateDataPropertyOrThrow(unscopableList, \"includes\", true).\n obj.insert(js_string!(\"includes\"), true_prop.clone());\n // 13. Perform ! CreateDataPropertyOrThrow(unscopableList, \"keys\", true).\n obj.insert(js_string!(\"keys\"), true_prop.clone());\n // 14. Perform ! CreateDataPropertyOrThrow(unscopableList, \"toReversed\", true).\n obj.insert(js_string!(\"toReversed\"), true_prop.clone());\n // 15. Perform ! CreateDataPropertyOrThrow(unscopableList, \"toSorted\", true).\n obj.insert(js_string!(\"toSorted\"), true_prop.clone());\n // 16. Perform ! CreateDataPropertyOrThrow(unscopableList, \"toSpliced\", true).\n obj.insert(js_string!(\"toSpliced\"), true_prop.clone());\n // 17. Perform ! CreateDataPropertyOrThrow(unscopableList, \"values\", true).\n obj.insert(js_string!(\"values\"), true_prop);\n }\n\n // 13. Return unscopableList.\n unscopable_list\n }\n}\n\n/// [`CompareArrayElements ( x, y, comparefn )`][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-comparearrayelements\nfn compare_array_elements(\n x: &JsValue,\n y: &JsValue,\n comparefn: Option<&JsObject>,\n context: &mut Context,\n) -> JsResult {\n match (x.is_undefined(), y.is_undefined()) {\n // 1. If x and y are both undefined, return +0𝔽.\n (true, true) => return Ok(Ordering::Equal),\n // 2. If x is undefined, return 1𝔽.\n (true, false) => return Ok(Ordering::Greater),\n // 3. If y is undefined, return -1𝔽.\n (false, true) => return Ok(Ordering::Less),\n _ => {}\n }\n\n // 4. If comparefn is not undefined, then\n if let Some(cmp) = comparefn {\n let args = [x.clone(), y.clone()];\n // a. Let v be ? ToNumber(? Call(comparefn, undefined, « x, y »)).\n let v = cmp\n .call(&JsValue::undefined(), &args, context)?\n .to_number(context)?;\n // b. If v is NaN, return +0𝔽.\n // c. Return v.\n return Ok(v.partial_cmp(&0.0).unwrap_or(Ordering::Equal));\n }\n\n // 5. Let xString be ? ToString(x).\n let x_str = x.to_string(context)?;\n\n // 6. Let yString be ? ToString(y).\n let y_str = y.to_string(context)?;\n\n // 7. Let xSmaller be ! IsLessThan(xString, yString, true).\n // 8. If xSmaller is true, return -1𝔽.\n // 9. Let ySmaller be ! IsLessThan(yString, xString, true).\n // 10. If ySmaller is true, return 1𝔽.\n // 11. Return +0𝔽.\n // NOTE: skipped IsLessThan because it just makes a lexicographic comparison\n // when x and y are strings\n Ok(x_str.cmp(&y_str))\n}\n\n/// `FindViaPredicate ( O, len, direction, predicate, thisArg )`\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-findviapredicate\npub(crate) fn find_via_predicate(\n o: &JsObject,\n len: u64,\n direction: Direction,\n predicate: &JsValue,\n this_arg: &JsValue,\n context: &mut Context,\n caller_name: &str,\n) -> JsResult<(JsValue, JsValue)> {\n // 1. If IsCallable(predicate) is false, throw a TypeError exception.\n let predicate = predicate.as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(format!(\"{caller_name}: predicate is not callable\"))\n })?;\n\n let indices = match direction {\n // 2. If direction is ascending, then\n // a. Let indices be a List of the integers in the interval from 0 (inclusive) to len (exclusive), in ascending order.\n Direction::Ascending => itertools::Either::Left(0..len),\n // 3. Else,\n // a. Let indices be a List of the integers in the interval from 0 (inclusive) to len (exclusive), in descending order.\n Direction::Descending => itertools::Either::Right((0..len).rev()),\n };\n\n // 4. For each integer k of indices, do\n for k in indices {\n // a. Let Pk be ! ToString(𝔽(k)).\n let pk = k;\n\n // b. NOTE: If O is a TypedArray, the following invocation of Get will return a normal completion.\n // c. Let kValue be ? Get(O, Pk).\n let k_value = o.get(pk, context)?;\n\n // d. Let testResult be ? Call(predicate, thisArg, « kValue, 𝔽(k), O »).\n let test_result = predicate\n .call(\n this_arg,\n &[k_value.clone(), k.into(), o.clone().into()],\n context,\n )?\n .to_boolean();\n\n if test_result {\n // e. If ToBoolean(testResult) is true, return the Record { [[Index]]: 𝔽(k), [[Value]]: kValue }.\n return Ok((JsValue::new(k), k_value));\n }\n }\n\n // 5. Return the Record { [[Index]]: -1𝔽, [[Value]]: undefined }\n Ok((JsValue::new(-1), JsValue::undefined()))\n}\n\n/// Define an own property for an array exotic object.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-array-exotic-objects-defineownproperty-p-desc\nfn array_exotic_define_own_property(\n obj: &JsObject,\n key: &PropertyKey,\n desc: PropertyDescriptor,\n context: &mut InternalMethodPropertyContext<'_>,\n) -> JsResult {\n // 1. Assert: IsPropertyKey(P) is true.\n match key {\n // 2. If P is \"length\", then\n PropertyKey::String(s) if s == &StaticJsStrings::LENGTH => {\n // a. Return ? ArraySetLength(A, Desc).\n\n array_set_length(obj, desc, context)\n }\n // 3. Else if P is an array index, then\n PropertyKey::Index(index) => {\n let index = index.get();\n let new_len = index + 1;\n\n // Optimization: If the shape of the object is the array template shape,\n // we know the position of the \"length\" property.\n if u64::from(new_len) < (2u64.pow(32) - 1) {\n let borrowed_object = obj.borrow();\n if borrowed_object.properties().shape.to_addr_usize()\n == context\n .intrinsics()\n .templates()\n .array()\n .shape()\n .to_addr_usize()\n {\n let old_len = borrowed_object.properties().storage[0].clone();\n drop(borrowed_object);\n let old_len = old_len.to_u32(context)?;\n if new_len >= old_len {\n if ordinary_define_own_property(obj, key, desc, context)? {\n let mut borrowed_object = obj.borrow_mut();\n borrowed_object.properties_mut().storage[0] = JsValue::new(new_len);\n return Ok(true);\n }\n return Ok(false);\n }\n }\n }\n\n // a. Let oldLenDesc be OrdinaryGetOwnProperty(A, \"length\").\n let old_len_desc =\n ordinary_get_own_property(obj, &StaticJsStrings::LENGTH.into(), context)?\n .expect(\"the property descriptor must exist\");\n\n // b. Assert: ! IsDataDescriptor(oldLenDesc) is true.\n debug_assert!(old_len_desc.is_data_descriptor());\n\n // c. Assert: oldLenDesc.[[Configurable]] is false.\n debug_assert!(!old_len_desc.expect_configurable());\n\n // d. Let oldLen be oldLenDesc.[[Value]].\n // e. Assert: oldLen is a non-negative integral Number.\n // f. Let index be ! ToUint32(P).\n let old_len = old_len_desc\n .expect_value()\n .to_u32(context)\n .js_expect(\"this ToUint32 call must not fail\")?;\n\n // g. If index ≥ oldLen and oldLenDesc.[[Writable]] is false, return false.\n if index >= old_len && !old_len_desc.expect_writable() {\n return Ok(false);\n }\n\n // h. Let succeeded be ! OrdinaryDefineOwnProperty(A, P, Desc).\n if ordinary_define_own_property(obj, key, desc, context)? {\n // j. If index ≥ oldLen, then\n if index >= old_len {\n // i. Set oldLenDesc.[[Value]] to index + 1𝔽.\n let old_len_desc = PropertyDescriptor::builder()\n .value(new_len)\n .maybe_writable(old_len_desc.writable())\n .maybe_enumerable(old_len_desc.enumerable())\n .maybe_configurable(old_len_desc.configurable());\n\n // ii. Set succeeded to OrdinaryDefineOwnProperty(A, \"length\", oldLenDesc).\n let succeeded = ordinary_define_own_property(\n obj,\n &StaticJsStrings::LENGTH.into(),\n old_len_desc.into(),\n context,\n )?;\n\n // iii. Assert: succeeded is true.\n debug_assert!(succeeded);\n }\n\n // k. Return true.\n Ok(true)\n } else {\n // i. If succeeded is false, return false.\n Ok(false)\n }\n }\n // 4. Return OrdinaryDefineOwnProperty(A, P, Desc).\n _ => ordinary_define_own_property(obj, key, desc, context),\n }\n}\n\n/// Abstract operation `ArraySetLength ( A, Desc )`\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-arraysetlength\nfn array_set_length(\n obj: &JsObject,\n desc: PropertyDescriptor,\n context: &mut InternalMethodPropertyContext<'_>,\n) -> JsResult {\n // 1. If Desc.[[Value]] is absent, then\n let Some(new_len_val) = desc.value() else {\n // a. Return OrdinaryDefineOwnProperty(A, \"length\", Desc).\n return ordinary_define_own_property(obj, &StaticJsStrings::LENGTH.into(), desc, context);\n };\n\n // 3. Let newLen be ? ToUint32(Desc.[[Value]]).\n let new_len = new_len_val.to_u32(context)?;\n\n // 4. Let numberLen be ? ToNumber(Desc.[[Value]]).\n let number_len = new_len_val.to_number(context)?;\n\n // 5. If SameValueZero(newLen, numberLen) is false, throw a RangeError exception.\n #[allow(clippy::float_cmp)]\n if f64::from(new_len) != number_len {\n return Err(JsNativeError::range()\n .with_message(\"bad length for array\")\n .into());\n }\n\n // 2. Let newLenDesc be a copy of Desc.\n // 6. Set newLenDesc.[[Value]] to newLen.\n let mut new_len_desc = PropertyDescriptor::builder()\n .value(new_len)\n .maybe_writable(desc.writable())\n .maybe_enumerable(desc.enumerable())\n .maybe_configurable(desc.configurable());\n\n // 7. Let oldLenDesc be OrdinaryGetOwnProperty(A, \"length\").\n let old_len_desc = ordinary_get_own_property(obj, &StaticJsStrings::LENGTH.into(), context)?\n .expect(\"the property descriptor must exist\");\n\n // 8. Assert: ! IsDataDescriptor(oldLenDesc) is true.\n debug_assert!(old_len_desc.is_data_descriptor());\n\n // 9. Assert: oldLenDesc.[[Configurable]] is false.\n debug_assert!(!old_len_desc.expect_configurable());\n\n // 10. Let oldLen be oldLenDesc.[[Value]].\n let old_len = old_len_desc.expect_value();\n\n // 11. If newLen ≥ oldLen, then\n if new_len >= old_len.to_u32(context)? {\n // a. Return OrdinaryDefineOwnProperty(A, \"length\", newLenDesc).\n return ordinary_define_own_property(\n obj,\n &StaticJsStrings::LENGTH.into(),\n new_len_desc.build(),\n context,\n );\n }\n\n // 12. If oldLenDesc.[[Writable]] is false, return false.\n if !old_len_desc.expect_writable() {\n return Ok(false);\n }\n\n // 13. If newLenDesc.[[Writable]] is absent or has the value true, let newWritable be true.\n let new_writable = if new_len_desc.inner().writable().unwrap_or(true) {\n true\n }\n // 14. Else,\n else {\n // a. NOTE: Setting the [[Writable]] attribute to false is deferred in case any\n // elements cannot be deleted.\n // c. Set newLenDesc.[[Writable]] to true.\n new_len_desc = new_len_desc.writable(true);\n\n // b. Let newWritable be false.\n false\n };\n\n // 15. Let succeeded be ! OrdinaryDefineOwnProperty(A, \"length\", newLenDesc).\n // 16. If succeeded is false, return false.\n if !ordinary_define_own_property(\n obj,\n &StaticJsStrings::LENGTH.into(),\n new_len_desc.clone().build(),\n context,\n )\n .js_expect(\"this OrdinaryDefineOwnProperty call must not fail\")?\n {\n return Ok(false);\n }\n\n // 17. For each own property key P of A that is an array index, whose numeric value is\n // greater than or equal to newLen, in descending numeric index order, do\n let ordered_keys = {\n let mut keys: Vec<_> = obj\n .borrow()\n .properties\n .index_property_keys()\n .filter(|idx| new_len <= *idx && *idx < u32::MAX)\n .collect();\n keys.sort_unstable_by(|x, y| y.cmp(x));\n keys\n };\n\n for index in ordered_keys {\n // a. Let deleteSucceeded be ! A.[[Delete]](P).\n // b. If deleteSucceeded is false, then\n if !obj.__delete__(&index.into(), context)? {\n // i. Set newLenDesc.[[Value]] to ! ToUint32(P) + 1𝔽.\n new_len_desc = new_len_desc.value(index + 1);\n\n // ii. If newWritable is false, set newLenDesc.[[Writable]] to false.\n if !new_writable {\n new_len_desc = new_len_desc.writable(false);\n }\n\n // iii. Perform ! OrdinaryDefineOwnProperty(A, \"length\", newLenDesc).\n ordinary_define_own_property(\n obj,\n &StaticJsStrings::LENGTH.into(),\n new_len_desc.build(),\n context,\n )\n .js_expect(\"this OrdinaryDefineOwnProperty call must not fail\")?;\n\n // iv. Return false.\n return Ok(false);\n }\n }\n\n // 18. If newWritable is false, then\n if !new_writable {\n // a. Set succeeded to ! OrdinaryDefineOwnProperty(A, \"length\",\n // PropertyDescriptor { [[Writable]]: false }).\n let succeeded = ordinary_define_own_property(\n obj,\n &StaticJsStrings::LENGTH.into(),\n PropertyDescriptor::builder().writable(false).build(),\n context,\n )\n .js_expect(\"this OrdinaryDefineOwnProperty call must not fail\")?;\n\n // b. Assert: succeeded is true.\n debug_assert!(succeeded);\n }\n\n // 19. Return true.\n Ok(true)\n}\n" }, { "path": "core/engine/src/builtins/array/tests.rs", "content": "use super::Array;\nuse crate::{\n Context, JsNativeErrorKind, JsValue, TestAction, builtins::Number, js_string, run_test_actions,\n};\nuse boa_macros::js_str;\nuse indoc::indoc;\n\n#[test]\nfn is_array() {\n run_test_actions([\n TestAction::assert(\"Array.isArray([])\"),\n TestAction::assert(\"Array.isArray(new Array())\"),\n TestAction::assert(\"Array.isArray(['a', 'b', 'c'])\"),\n TestAction::assert(\"Array.isArray([1, 2, 3])\"),\n TestAction::assert(\"!Array.isArray({})\"),\n TestAction::assert(\"Array.isArray(new Array)\"),\n TestAction::assert(\"!Array.isArray()\"),\n TestAction::assert(\"!Array.isArray({ constructor: Array })\"),\n TestAction::assert(\n \"!Array.isArray({ push: Array.prototype.push, concat: Array.prototype.concat })\",\n ),\n TestAction::assert(\"!Array.isArray(17)\"),\n TestAction::assert(\"!Array.isArray({ __proto__: Array.prototype })\"),\n TestAction::assert(\"!Array.isArray({ length: 0 })\"),\n ]);\n}\n\n#[test]\nfn of() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(\"arrayEquals(Array.of(1, 2, 3), [1, 2, 3])\"),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n Array.of(1, 'a', [], undefined, null),\n [1, 'a', [], undefined, null]\n )\n \"#}),\n TestAction::assert(\"arrayEquals(Array.of(), [])\"),\n TestAction::run(\"let a = Array.of.call(Date, 'a', undefined, 3);\"),\n TestAction::assert(\"a instanceof Date\"),\n TestAction::assert_eq(\"a[0]\", js_str!(\"a\")),\n TestAction::assert_eq(\"a[1]\", JsValue::undefined()),\n TestAction::assert_eq(\"a[2]\", 3),\n TestAction::assert_eq(\"a.length\", 3),\n ]);\n}\n\n#[test]\nfn concat() {\n run_test_actions([\n TestAction::run_harness(),\n // Empty ++ Empty\n TestAction::assert(\"arrayEquals([].concat([]), [])\"),\n // Empty ++ NonEmpty\n TestAction::assert(\"arrayEquals([].concat([1]), [1])\"),\n // NonEmpty ++ Empty\n TestAction::assert(\"arrayEquals([1].concat([]), [1])\"),\n // NonEmpty ++ NonEmpty\n TestAction::assert(\"arrayEquals([1].concat([1]), [1, 1])\"),\n ]);\n}\n\n#[test]\nfn copy_within() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(\"arrayEquals([1,2,3,4,5].copyWithin(-2), [1,2,3,1,2])\"),\n TestAction::assert(\"arrayEquals([1,2,3,4,5].copyWithin(0, 3), [4,5,3,4,5])\"),\n TestAction::assert(\"arrayEquals([1,2,3,4,5].copyWithin(0, 3, 4), [4,2,3,4,5])\"),\n TestAction::assert(\"arrayEquals([1,2,3,4,5].copyWithin(-2, -3, -1), [1,2,3,3,4])\"),\n ]);\n}\n\n#[test]\nfn join() {\n run_test_actions([\n TestAction::assert_eq(\"[].join('.')\", js_string!()),\n TestAction::assert_eq(\"['a'].join('.')\", js_str!(\"a\")),\n TestAction::assert_eq(\"['a', 'b', 'c'].join('.')\", js_str!(\"a.b.c\")),\n TestAction::assert_eq(\"let a=[];a[0]=a;a[1]=a;a[2]=a;a.join()\", js_str!(\",,\")),\n ]);\n}\n\n#[test]\nfn to_string() {\n run_test_actions([\n TestAction::assert_eq(\"[].toString()\", js_string!()),\n TestAction::assert_eq(\"['a'].toString()\", js_str!(\"a\")),\n TestAction::assert_eq(\"['a', 'b', 'c'].toString()\", js_str!(\"a,b,c\")),\n ]);\n}\n\n#[test]\nfn every() {\n // taken from https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every\n run_test_actions([\n TestAction::run(indoc! {r#\"\n function appendingCallback(elem,index,arr) {\n arr.push('new');\n return elem !== \"new\";\n }\n function deletingCallback(elem,index,arr) {\n arr.pop()\n return elem < 3;\n }\n \"#}),\n TestAction::assert(\"[11, 23, 45].every(e => e > 10)\"),\n TestAction::assert(\"[].every(e => e < 10)\"),\n TestAction::assert(\"![11, 23, 45].every(e => e < 10)\"),\n TestAction::assert(\"[1,2,3,4].every(appendingCallback)\"),\n TestAction::assert(\"[1,2,3,4].every(deletingCallback)\"),\n ]);\n}\n\n#[test]\nfn find() {\n run_test_actions([TestAction::assert_eq(\n \"['a', 'b', 'c'].find(e => e == 'a')\",\n js_str!(\"a\"),\n )]);\n}\n\n#[test]\nfn find_index() {\n run_test_actions([\n TestAction::assert_eq(\"[1, 2, 3].findIndex(e => e == 2)\", 1),\n TestAction::assert_eq(\"[].findIndex(e => e == 2)\", -1),\n TestAction::assert_eq(\"[4, 5, 6].findIndex(e => e == 2)\", -1),\n ]);\n}\n\n#[test]\nfn flat() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(\"arrayEquals( [[]].flat(), [] )\"),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n ['a', ['b', 'c']].flat(),\n ['a', 'b', 'c']\n )\n \"#}),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n ['a', ['b', ['c'], 'd']].flat(2),\n ['a', 'b', 'c', 'd']\n )\n \"#}),\n TestAction::assert(\"arrayEquals( [[[[[['a']]]]]].flat(Infinity), ['a'] )\"),\n ]);\n}\n\n#[test]\nfn flat_map() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n [1, 2, 3].flatMap(i => [i * 2]),\n [2, 4, 6]\n )\n \"#}),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n [\"it's Sunny\", \"in Cali\"].flatMap(x => x.split(\" \")),\n [\"it's\", \"Sunny\", \"in\", \"Cali\"]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn flat_map_with_hole() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n var arr = [0, 1, 2];\n delete arr[1];\n arrayEquals(\n arr.flatMap(i => [i * 2]),\n [0, 4]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn flat_map_not_callable() {\n run_test_actions([TestAction::assert_native_error(\n indoc! {r#\"\n var array = [1,2,3];\n array.flatMap(\"not a function\");\n \"#},\n JsNativeErrorKind::Type,\n \"flatMap mapper function is not callable\",\n )]);\n}\n\n#[test]\nfn push() {\n run_test_actions([\n TestAction::run(\"var arr = [1, 2];\"),\n TestAction::assert_eq(\"arr.push()\", 2),\n TestAction::assert_eq(\"arr.push(3, 4)\", 4),\n TestAction::assert_eq(\"arr[2]\", 3),\n TestAction::assert_eq(\"arr[3]\", 4),\n ]);\n}\n\n#[test]\nfn pop() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(indoc! {r#\"\n var one = [1];\n var many = [1, 2, 3, 4];\n \"#}),\n TestAction::assert_eq(\"[].pop()\", JsValue::undefined()),\n TestAction::assert_eq(\"one.pop()\", 1),\n TestAction::assert(\"arrayEquals(one, [])\"),\n TestAction::assert_eq(\"many.pop()\", 4),\n TestAction::assert(\"arrayEquals(many, [1, 2, 3])\"),\n ]);\n}\n\n#[test]\nfn shift() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(indoc! {r#\"\n var one = [1];\n var many = [1, 2, 3, 4];\n \"#}),\n TestAction::assert_eq(\"[].shift()\", JsValue::undefined()),\n TestAction::assert_eq(\"one.shift()\", 1),\n TestAction::assert(\"arrayEquals(one, [])\"),\n TestAction::assert_eq(\"many.shift()\", 1),\n TestAction::assert(\"arrayEquals(many, [2, 3, 4])\"),\n ]);\n}\n\n#[test]\nfn unshift() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(\"var arr = [3, 4];\"),\n TestAction::assert_eq(\"arr.unshift()\", 2),\n TestAction::assert_eq(\"arr.unshift(1, 2)\", 4),\n TestAction::assert(\"arrayEquals(arr, [1, 2, 3, 4])\"),\n ]);\n}\n\n#[test]\nfn reverse() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(\"var arr = [1, 2];\"),\n TestAction::assert(\"arrayEquals(arr.reverse(), [2, 1])\"),\n TestAction::assert(\"arrayEquals(arr, [2, 1])\"),\n ]);\n}\n\n#[test]\nfn index_of() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n var one = [\"a\"];\n var many = [\"a\", \"b\", \"c\"];\n var duplicates = [\"a\", \"b\", \"c\", \"a\", \"b\"];\n \"#}),\n // Empty\n TestAction::assert_eq(\"[].indexOf('a')\", -1),\n // One\n TestAction::assert_eq(\"one.indexOf('a')\", 0),\n // Missing from one\n TestAction::assert_eq(\"one.indexOf('b')\", -1),\n // First in many\n TestAction::assert_eq(\"many.indexOf('a')\", 0),\n // Second in many\n TestAction::assert_eq(\"many.indexOf('b')\", 1),\n // First in duplicates\n TestAction::assert_eq(\"duplicates.indexOf('a')\", 0),\n // Second in duplicates\n TestAction::assert_eq(\"duplicates.indexOf('b')\", 1),\n // Positive fromIndex greater than array length\n TestAction::assert_eq(\"one.indexOf('a', 2)\", -1),\n // Positive fromIndex missed match\n TestAction::assert_eq(\"many.indexOf('a', 1)\", -1),\n // Positive fromIndex matched\n TestAction::assert_eq(\"many.indexOf('b', 1)\", 1),\n // Positive fromIndex with duplicates\n TestAction::assert_eq(\"duplicates.indexOf('a', 1)\", 3),\n // Negative fromIndex greater than array length\n TestAction::assert_eq(\"one.indexOf('a', -2)\", 0),\n // Negative fromIndex missed match\n TestAction::assert_eq(\"many.indexOf('b', -1)\", -1),\n // Negative fromIndex matched\n TestAction::assert_eq(\"many.indexOf('c', -1)\", 2),\n // Negative fromIndex with duplicates\n TestAction::assert_eq(\"duplicates.indexOf('b', -2)\", 4),\n ]);\n}\n\n#[test]\nfn last_index_of() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n var one = [\"a\"];\n var many = [\"a\", \"b\", \"c\"];\n var duplicates = [\"a\", \"b\", \"c\", \"a\", \"b\"];\n \"#}),\n // Empty\n TestAction::assert_eq(\"[].lastIndexOf('a')\", -1),\n // One\n TestAction::assert_eq(\"one.lastIndexOf('a')\", 0),\n // Missing from one\n TestAction::assert_eq(\"one.lastIndexOf('b')\", -1),\n // First in many\n TestAction::assert_eq(\"many.lastIndexOf('a')\", 0),\n // Second in many\n TestAction::assert_eq(\"many.lastIndexOf('b')\", 1),\n // 4th in duplicates\n TestAction::assert_eq(\"duplicates.lastIndexOf('a')\", 3),\n // 5th in duplicates\n TestAction::assert_eq(\"duplicates.lastIndexOf('b')\", 4),\n // Positive fromIndex greater than array length\n TestAction::assert_eq(\"one.lastIndexOf('a', 2)\", 0),\n // Positive fromIndex missed match\n TestAction::assert_eq(\"many.lastIndexOf('c', 1)\", -1),\n // Positive fromIndex matched\n TestAction::assert_eq(\"many.lastIndexOf('b', 1)\", 1),\n // Positive fromIndex with duplicates\n TestAction::assert_eq(\"duplicates.lastIndexOf('a', 1)\", 0),\n // Negative fromIndex greater than array length\n TestAction::assert_eq(\"one.lastIndexOf('a', -2)\", -1),\n // Negative fromIndex missed match\n TestAction::assert_eq(\"many.lastIndexOf('c', -2)\", -1),\n // Negative fromIndex matched\n TestAction::assert_eq(\"many.lastIndexOf('c', -1)\", 2),\n // Negative fromIndex with duplicates\n TestAction::assert_eq(\"duplicates.lastIndexOf('b', -2)\", 1),\n ]);\n}\n\n#[test]\nfn fill_obj_ref() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n let obj = {};\n let a = new Array(3).fill(obj);\n obj.hi = 'hi'\n \"#}),\n TestAction::assert_eq(\"a[2].hi\", js_str!(\"hi\")),\n ]);\n}\n\n#[test]\nfn fill() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(\"var a = [1, 2, 3];\"),\n TestAction::assert(\"arrayEquals(a.fill(4), [4, 4, 4])\"),\n // make sure the array is modified\n TestAction::assert(\"arrayEquals(a, [4, 4, 4])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, '1'), [1, 4, 4])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, 1, 2), [1, 4, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, 1, 1), [1, 2, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, 3, 3), [1, 2, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, -3, -2), [4, 2, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, NaN, NaN), [1, 2, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, 3, 5), [1, 2, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, '1.2', '2.5'), [1, 4, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, 'str'), [4, 4, 4])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, 'str', 'str'), [1, 2, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, undefined, null), [1, 2, 3])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(4, undefined, undefined), [4, 4, 4])\"),\n TestAction::assert(\"arrayEquals([1, 2, 3].fill(), [undefined, undefined, undefined])\"),\n ]);\n}\n\n#[test]\nfn includes_value() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n var one = [\"a\"];\n var many = [\"a\", \"b\", \"c\"];\n var duplicates = [\"a\", \"b\", \"c\", \"a\", \"b\"];\n \"#}),\n // Empty\n TestAction::assert(\"![].includes('a')\"),\n // One\n TestAction::assert(\"one.includes('a')\"),\n // Missing from one\n TestAction::assert(\"!one.includes('b')\"),\n // In many\n TestAction::assert(\"many.includes('b')\"),\n // Missing from many\n TestAction::assert(\"!many.includes('d')\"),\n // In duplicates\n TestAction::assert(\"duplicates.includes('a')\"),\n // Missing from duplicates\n TestAction::assert(\"!duplicates.includes('d')\"),\n ]);\n}\n\n#[test]\nfn map() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(indoc! {r#\"\n var one = [\"x\"];\n var many = [\"x\", \"y\", \"z\"];\n \"#}),\n // Empty\n TestAction::assert(\"arrayEquals([].map(v => v + '_'), [])\"),\n // One\n TestAction::assert(\"arrayEquals(one.map(v => '_' + v), ['_x'])\"),\n // Many\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n many.map(v => '_' + v + '_'),\n ['_x_', '_y_', '_z_']\n )\n \"#}),\n // assert the old arrays have not been modified\n TestAction::assert(\"arrayEquals(one, ['x'])\"),\n TestAction::assert(\"arrayEquals(many, ['x', 'y', 'z'])\"),\n // One but it uses `this` inside the callback\n TestAction::assert(indoc! {r#\"\n var _this = { answer: 42 };\n\n function callback() {\n return 'The answer to life is: ' + this.answer;\n }\n\n arrayEquals(\n one.map(callback, _this),\n ['The answer to life is: 42']\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn slice() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(\"arrayEquals([].slice(), [])\"),\n TestAction::assert(\"arrayEquals(['a'].slice(), ['a'])\"),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n [\"a\", \"b\", \"c\", \"d\"].slice(1),\n [\"b\", \"c\", \"d\"]\n )\n \"#}),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n [\"a\", \"b\", \"c\", \"d\"].slice(2, 3),\n [\"c\"]\n )\n \"#}),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n [\"a\", \"b\", \"c\", \"d\"].slice(7),\n []\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn for_each() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n var sum = 0;\n var indexSum = 0;\n var listLengthSum = 0;\n function callingCallback(item, index, list) {\n sum += item;\n indexSum += index;\n listLengthSum += list.length;\n }\n [2, 3, 4, 5].forEach(callingCallback);\n \"#}),\n TestAction::assert_eq(\"sum\", 14),\n TestAction::assert_eq(\"indexSum\", 6),\n TestAction::assert_eq(\"listLengthSum\", 16),\n ]);\n}\n\n#[test]\nfn for_each_push_value() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(indoc! {r#\"\n var a = [1, 2, 3, 4];\n a.forEach((item, index, list) => list.push(item * 2));\n \"#}),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n a,\n [1, 2, 3, 4, 2, 4, 6, 8]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn filter() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(\"var empty = [], one = ['1'], many = ['1', '0', '1'];\"),\n // Empty\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n empty.filter(v => v === \"1\"),\n []\n )\n \"#}),\n // One filtered on \"1\"\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n one.filter(v => v === \"1\"),\n [\"1\"]\n )\n \"#}),\n // One filtered on \"0\"\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n one.filter(v => v === \"0\"),\n []\n )\n \"#}),\n // Many filtered on \"1\"\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n many.filter(v => v === \"1\"),\n [\"1\", \"1\"]\n )\n \"#}),\n // Many filtered on \"0\"\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n many.filter(v => v === \"0\"),\n [\"0\"]\n )\n \"#}),\n // assert the old arrays have not been modified\n TestAction::assert(\"arrayEquals(one, ['1'])\"),\n TestAction::assert(\"arrayEquals(many, ['1', '0', '1'])\"),\n ]);\n}\n\n#[test]\nfn some() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(\"var array = [11, 23, 45];\"),\n TestAction::assert(\"!array.some(e => e < 10)\"),\n TestAction::assert(\"![].some(e => e < 10)\"),\n TestAction::assert(\"array.some(e => e > 10)\"),\n TestAction::assert(indoc! {r#\"\n // Cases where callback mutates the array.\n var appendArray = [1,2,3,4];\n function appendingCallback(elem, index, arr) {\n arr.push('new');\n return elem !== \"new\";\n }\n\n appendArray.some(appendingCallback)\n \"#}),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n appendArray,\n [1, 2, 3, 4, \"new\"]\n )\n \"#}),\n TestAction::assert(indoc! {r#\"\n var delArray = [1,2,3,4];\n function deletingCallback(elem,index,arr) {\n arr.pop()\n return elem < 3;\n }\n\n delArray.some(deletingCallback)\n \"#}),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n delArray,\n [1, 2, 3]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn reduce() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n var arr = [1, 2, 3, 4];\n function add(acc, x) {\n return acc + x;\n }\n\n function addIdx(acc, _, idx) {\n return acc + idx;\n }\n\n function addLen(acc, _x, _idx, arr) {\n return acc + arr.length;\n }\n\n function addResize(acc, x, idx, arr) {\n if(idx == 0) {\n arr.length = 3;\n }\n return acc + x;\n }\n var delArray = [1, 2, 3, 4, 5];\n delete delArray[0];\n delete delArray[1];\n delete delArray[3];\n\n \"#}),\n // empty array\n TestAction::assert_eq(\"[].reduce(add, 0)\", 0),\n // simple with initial value\n TestAction::assert_eq(\"arr.reduce(add, 0)\", 10),\n // without initial value\n TestAction::assert_eq(\"arr.reduce(add)\", 10),\n // with some items missing\n TestAction::assert_eq(\"delArray.reduce(add, 0)\", 8),\n // with index\n TestAction::assert_eq(\"arr.reduce(addIdx, 0)\", 6),\n // with array\n TestAction::assert_eq(\"arr.reduce(addLen, 0)\", 16),\n // resizing the array as reduce progresses\n TestAction::assert_eq(\"arr.reduce(addResize, 0)\", 6),\n // Empty array\n TestAction::assert_native_error(\n \"[].reduce((acc, x) => acc + x);\",\n JsNativeErrorKind::Type,\n \"Array.prototype.reduce: called on an empty array and with no initial value\",\n ),\n // Array with no defined elements\n TestAction::assert_native_error(\n indoc! {r#\"\n var deleteArr = [0, 1];\n delete deleteArr[0];\n delete deleteArr[1];\n deleteArr.reduce((acc, x) => acc + x);\n \"#},\n JsNativeErrorKind::Type,\n \"Array.prototype.reduce: called on an empty array and with no initial value\",\n ),\n // No callback\n TestAction::assert_native_error(\n indoc! {r#\"\n var someArr = [0, 1];\n someArr.reduce('');\n \"#},\n JsNativeErrorKind::Type,\n \"Array.prototype.reduce: callback function is not callable\",\n ),\n ]);\n}\n\n#[test]\nfn reduce_right() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n var arr = [1, 2, 3, 4];\n function sub(acc, x) {\n return acc - x;\n }\n\n function subIdx(acc, _, idx) {\n return acc - idx;\n }\n\n function subLen(acc, _x, _idx, arr) {\n return acc - arr.length;\n }\n\n function subResize(acc, x, idx, arr) {\n if(idx == arr.length - 1) {\n arr.length = 1;\n }\n return acc - x;\n }\n function subResize0(acc, x, idx, arr) {\n if(idx == arr.length - 2) {\n arr.length = 0;\n }\n return acc - x;\n }\n var delArray = [1, 2, 3, 4, 5];\n delete delArray[0];\n delete delArray[1];\n delete delArray[3];\n \"#}),\n // empty array\n TestAction::assert_eq(\"[].reduceRight(sub, 0)\", 0),\n // simple with initial value\n TestAction::assert_eq(\"arr.reduceRight(sub, 0)\", -10),\n // without initial value\n TestAction::assert_eq(\"arr.reduceRight(sub)\", -2),\n // with some items missing\n TestAction::assert_eq(\"delArray.reduceRight(sub, 0)\", -8),\n // with index\n TestAction::assert_eq(\"arr.reduceRight(subIdx)\", 1),\n // with array\n TestAction::assert_eq(\"arr.reduceRight(subLen)\", -8),\n // resizing the array as reduce progresses\n TestAction::assert_eq(\"arr.reduceRight(subResize, 0)\", -5),\n // reset array\n TestAction::run(\"arr = [1, 2, 3, 4];\"),\n // resizing the array to 0 as reduce progresses\n TestAction::assert_eq(\"arr.reduceRight(subResize0, 0)\", -7),\n // Empty array\n TestAction::assert_native_error(\n \"[].reduceRight((acc, x) => acc + x);\",\n JsNativeErrorKind::Type,\n \"Array.prototype.reduceRight: called on an empty array and with no initial value\",\n ),\n // Array with no defined elements\n TestAction::assert_native_error(\n indoc! {r#\"\n var deleteArr = [0, 1];\n delete deleteArr[0];\n delete deleteArr[1];\n deleteArr.reduceRight((acc, x) => acc + x);\n \"#},\n JsNativeErrorKind::Type,\n \"Array.prototype.reduceRight: called on an empty array and with no initial value\",\n ),\n // No callback\n TestAction::assert_native_error(\n indoc! {r#\"\n var otherArr = [0, 1];\n otherArr.reduceRight(\"\");\n \"#},\n JsNativeErrorKind::Type,\n \"Array.prototype.reduceRight: callback function is not callable\",\n ),\n ]);\n}\n\n#[test]\nfn call_array_constructor_with_one_argument() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(\"arrayEquals(new Array(0), [])\"),\n TestAction::assert(\"arrayEquals(new Array(5), [,,,,,])\"),\n TestAction::assert(\"arrayEquals(new Array('Hello, world!'), ['Hello, world!'])\"),\n ]);\n}\n\n#[test]\nfn array_values_simple() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n Array.from([1, 2, 3].values()),\n [1, 2, 3]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn array_keys_simple() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n Array.from([1, 2, 3].keys()),\n [0, 1, 2]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn array_entries_simple() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n Array.from([1, 2, 3].entries()),\n [\n [0, 1],\n [1, 2],\n [2, 3]\n ]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn array_values_empty() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n Array.from([].values()),\n []\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn array_values_sparse() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n var array = Array();\n array[3] = 5;\n arrayEquals(\n Array.from(array.values()),\n [undefined, undefined, undefined, 5]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn array_symbol_iterator() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n Array.from([1, 2, 3][Symbol.iterator]()),\n [1, 2, 3]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn array_values_symbol_iterator() {\n run_test_actions([TestAction::assert(indoc! {r#\"\n var iterator = [1, 2, 3].values();\n iterator === iterator[Symbol.iterator]();\n \"#})]);\n}\n\n#[test]\nfn array_spread_arrays() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n [1, ...[2, 3]],\n [1, 2, 3]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn array_spread_non_iterable() {\n run_test_actions([TestAction::assert_native_error(\n \"const array2 = [...5];\",\n JsNativeErrorKind::Type,\n \"value with type `number` is not iterable\",\n )]);\n}\n\n#[test]\nfn get_relative_start() {\n #[track_caller]\n fn assert(context: &mut Context, arg: Option<&JsValue>, len: u64, expected: u64) {\n const UNDEFINED: &JsValue = &JsValue::undefined();\n let arg = arg.unwrap_or(UNDEFINED);\n assert_eq!(\n Array::get_relative_start(context, arg, len).unwrap(),\n expected\n );\n }\n run_test_actions([TestAction::inspect_context(|ctx| {\n assert(ctx, None, 10, 0);\n assert(ctx, Some(&JsValue::undefined()), 10, 0);\n assert(ctx, Some(&JsValue::new(f64::NEG_INFINITY)), 10, 0);\n assert(ctx, Some(&JsValue::new(f64::INFINITY)), 10, 10);\n assert(ctx, Some(&JsValue::new(-1)), 10, 9);\n assert(ctx, Some(&JsValue::new(1)), 10, 1);\n assert(ctx, Some(&JsValue::new(-11)), 10, 0);\n assert(ctx, Some(&JsValue::new(11)), 10, 10);\n assert(ctx, Some(&JsValue::new(f64::MIN)), 10, 0);\n assert(ctx, Some(&JsValue::new(Number::MIN_SAFE_INTEGER)), 10, 0);\n assert(ctx, Some(&JsValue::new(f64::MAX)), 10, 10);\n // This test is relevant only on 32-bit archs (where usize == u32 thus `len` is u32)\n assert(ctx, Some(&JsValue::new(Number::MAX_SAFE_INTEGER)), 10, 10);\n })]);\n}\n\n#[test]\nfn get_relative_end() {\n #[track_caller]\n fn assert(context: &mut Context, arg: Option<&JsValue>, len: u64, expected: u64) {\n const UNDEFINED: &JsValue = &JsValue::undefined();\n let arg = arg.unwrap_or(UNDEFINED);\n assert_eq!(\n Array::get_relative_end(context, arg, len).unwrap(),\n expected\n );\n }\n run_test_actions([TestAction::inspect_context(|ctx| {\n assert(ctx, None, 10, 10);\n assert(ctx, Some(&JsValue::undefined()), 10, 10);\n assert(ctx, Some(&JsValue::new(f64::NEG_INFINITY)), 10, 0);\n assert(ctx, Some(&JsValue::new(f64::INFINITY)), 10, 10);\n assert(ctx, Some(&JsValue::new(-1)), 10, 9);\n assert(ctx, Some(&JsValue::new(1)), 10, 1);\n assert(ctx, Some(&JsValue::new(-11)), 10, 0);\n assert(ctx, Some(&JsValue::new(11)), 10, 10);\n assert(ctx, Some(&JsValue::new(f64::MIN)), 10, 0);\n assert(ctx, Some(&JsValue::new(Number::MIN_SAFE_INTEGER)), 10, 0);\n assert(ctx, Some(&JsValue::new(f64::MAX)), 10, 10);\n // This test is relevant only on 32-bit archs (where usize == u32 thus `len` is u32)\n assert(ctx, Some(&JsValue::new(Number::MAX_SAFE_INTEGER)), 10, 10);\n })]);\n}\n\n#[test]\nfn array_length_is_not_enumerable() {\n run_test_actions([TestAction::assert(\n \"!Object.getOwnPropertyDescriptor([], 'length').enumerable\",\n )]);\n}\n\n#[test]\nfn array_sort() {\n run_test_actions([\n TestAction::run_harness(),\n TestAction::run(\"let arr = ['80', '9', '700', 40, 1, 5, 200];\"),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n arr.sort(),\n [1, 200, 40, 5, \"700\", \"80\", \"9\"]\n )\n \"#}),\n TestAction::assert(indoc! {r#\"\n arrayEquals(\n arr.sort((a, b) => a - b),\n [1, 5, \"9\", 40, \"80\", 200, \"700\"]\n )\n \"#}),\n ]);\n}\n\n#[test]\nfn array_of_neg_zero() {\n run_test_actions([\n TestAction::run(\"let arr = [-0, -0, -0, -0];\"),\n // Assert the parity of all items of the list.\n TestAction::assert(\"arr.every(x => (1/x) === -Infinity)\"),\n ]);\n}\n" }, { "path": "core/engine/src/builtins/array_buffer/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `ArrayBuffer` and `SharedArrayBuffer` objects\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-arraybuffer-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer\n\n#![deny(unsafe_op_in_unsafe_fn)]\n#![deny(clippy::undocumented_unsafe_blocks)]\n\npub(crate) mod shared;\npub(crate) mod utils;\n\n#[cfg(test)]\nmod tests;\n\nuse std::ops::{Deref, DerefMut};\n\nuse aligned_vec::{ABox, AVec, ConstAlign};\npub use shared::SharedArrayBuffer;\nuse std::sync::atomic::Ordering;\n\nuse crate::{\n Context, JsArgs, JsData, JsResult, JsString, JsValue,\n builtins::BuiltInObject,\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::JsNativeError,\n js_string,\n object::{JsObject, internal_methods::get_prototype_from_constructor},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n};\nuse boa_gc::{Finalize, GcRef, GcRefMut, Trace};\n\nuse self::utils::{SliceRef, SliceRefMut};\n\nuse super::{\n Array, BuiltInBuilder, BuiltInConstructor, DataView, IntrinsicObject, typed_array::TypedArray,\n};\n\n/// `Vec`, but aligned to a 64-bit memory address.\npub type AlignedVec = AVec>;\npub(crate) type AlignedBox = ABox>;\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum BufferRef {\n Buffer(B),\n SharedBuffer(S),\n}\n\nimpl BufferRef\nwhere\n B: Deref,\n S: Deref,\n{\n /// Gets the inner data of the buffer.\n pub(crate) fn bytes(&self, ordering: Ordering) -> Option> {\n match self {\n Self::Buffer(buf) => buf.deref().bytes().map(SliceRef::Slice),\n Self::SharedBuffer(buf) => Some(SliceRef::AtomicSlice(buf.deref().bytes(ordering))),\n }\n }\n\n /// Gets the inner data of the buffer without accessing the current atomic length.\n ///\n /// Returns `None` if the buffer is detached or if the provided `len` is bigger than\n /// the allocated buffer.\n #[track_caller]\n pub(crate) fn bytes_with_len(&self, len: usize) -> Option> {\n match self {\n Self::Buffer(buf) => buf.deref().bytes_with_len(len).map(SliceRef::Slice),\n Self::SharedBuffer(buf) => Some(SliceRef::AtomicSlice(buf.deref().bytes_with_len(len))),\n }\n }\n\n pub(crate) fn is_fixed_len(&self) -> bool {\n match self {\n Self::Buffer(buf) => buf.is_fixed_len(),\n Self::SharedBuffer(buf) => buf.is_fixed_len(),\n }\n }\n}\n\n#[derive(Debug)]\npub(crate) enum BufferRefMut {\n Buffer(B),\n SharedBuffer(S),\n}\n\nimpl BufferRefMut\nwhere\n B: DerefMut,\n S: DerefMut,\n{\n pub(crate) fn bytes(&mut self, ordering: Ordering) -> Option> {\n match self {\n Self::Buffer(buf) => buf.deref_mut().bytes_mut().map(SliceRefMut::Slice),\n Self::SharedBuffer(buf) => {\n Some(SliceRefMut::AtomicSlice(buf.deref_mut().bytes(ordering)))\n }\n }\n }\n\n /// Gets the mutable inner data of the buffer without accessing the current atomic length.\n ///\n /// Returns `None` if the buffer is detached or if the provided `len` is bigger than\n /// the allocated buffer.\n pub(crate) fn bytes_with_len(&mut self, len: usize) -> Option> {\n match self {\n Self::Buffer(buf) => buf\n .deref_mut()\n .bytes_with_len_mut(len)\n .map(SliceRefMut::Slice),\n Self::SharedBuffer(buf) => Some(SliceRefMut::AtomicSlice(\n buf.deref_mut().bytes_with_len(len),\n )),\n }\n }\n}\n\n/// A `JsObject` containing a bytes buffer as its inner data.\n#[derive(Debug, Clone, Trace, Finalize)]\n#[boa_gc(unsafe_no_drop)]\npub(crate) enum BufferObject {\n Buffer(JsObject),\n SharedBuffer(JsObject),\n}\n\nimpl From for JsObject {\n fn from(value: BufferObject) -> Self {\n match value {\n BufferObject::Buffer(buf) => buf.upcast(),\n BufferObject::SharedBuffer(buf) => buf.upcast(),\n }\n }\n}\n\nimpl From for JsValue {\n fn from(value: BufferObject) -> Self {\n JsValue::from(JsObject::from(value))\n }\n}\n\nimpl BufferObject {\n /// Gets the buffer data of the object.\n #[inline]\n #[must_use]\n pub(crate) fn as_buffer(\n &self,\n ) -> BufferRef, GcRef<'_, SharedArrayBuffer>> {\n match self {\n Self::Buffer(buf) => BufferRef::Buffer(GcRef::map(buf.borrow(), |o| o.data())),\n Self::SharedBuffer(buf) => {\n BufferRef::SharedBuffer(GcRef::map(buf.borrow(), |o| o.data()))\n }\n }\n }\n\n /// Gets the mutable buffer data of the object\n #[inline]\n #[track_caller]\n pub(crate) fn as_buffer_mut(\n &self,\n ) -> BufferRefMut, GcRefMut<'_, SharedArrayBuffer>> {\n match self {\n Self::Buffer(buf) => {\n BufferRefMut::Buffer(GcRefMut::map(buf.borrow_mut(), |o| o.data_mut()))\n }\n Self::SharedBuffer(buf) => {\n BufferRefMut::SharedBuffer(GcRefMut::map(buf.borrow_mut(), |o| o.data_mut()))\n }\n }\n }\n\n /// Returns `true` if the buffer objects point to the same buffer.\n #[inline]\n #[track_caller]\n pub(crate) fn equals(lhs: &Self, rhs: &Self) -> bool {\n match (lhs, rhs) {\n (BufferObject::Buffer(lhs), BufferObject::Buffer(rhs)) => JsObject::equals(lhs, rhs),\n (BufferObject::SharedBuffer(lhs), BufferObject::SharedBuffer(rhs)) => {\n if JsObject::equals(lhs, rhs) {\n return true;\n }\n\n let lhs = lhs.borrow();\n let rhs = rhs.borrow();\n\n std::ptr::eq(lhs.data().as_ptr(), rhs.data().as_ptr())\n }\n _ => false,\n }\n }\n}\n\n/// The internal representation of an `ArrayBuffer` object.\n#[derive(Debug, Clone, Trace, Finalize, JsData)]\npub struct ArrayBuffer {\n /// The `[[ArrayBufferData]]` internal slot.\n #[unsafe_ignore_trace]\n data: Option>,\n\n /// The `[[ArrayBufferMaxByteLength]]` internal slot.\n max_byte_len: Option,\n\n /// The `[[ArrayBufferDetachKey]]` internal slot.\n detach_key: JsValue,\n}\n\nimpl ArrayBuffer {\n pub(crate) fn from_data(data: AlignedVec, detach_key: JsValue) -> Self {\n Self {\n data: Some(data),\n max_byte_len: None,\n detach_key,\n }\n }\n\n pub(crate) fn len(&self) -> usize {\n self.data.as_ref().map_or(0, AlignedVec::len)\n }\n\n pub(crate) fn bytes(&self) -> Option<&[u8]> {\n self.data.as_deref()\n }\n\n pub(crate) fn bytes_mut(&mut self) -> Option<&mut [u8]> {\n self.data.as_deref_mut()\n }\n\n pub(crate) fn vec_mut(&mut self) -> Option<&mut AlignedVec> {\n self.data.as_mut()\n }\n\n /// Sets the maximum byte length of the buffer, returning the previous value if present.\n pub(crate) fn set_max_byte_length(&mut self, max_byte_len: u64) -> Option {\n self.max_byte_len.replace(max_byte_len)\n }\n\n /// Gets the inner bytes of the buffer without accessing the current atomic length.\n #[track_caller]\n pub(crate) fn bytes_with_len(&self, len: usize) -> Option<&[u8]> {\n if let Some(s) = self.data.as_deref() {\n Some(&s[..len])\n } else {\n None\n }\n }\n\n /// Gets the mutable inner bytes of the buffer without accessing the current atomic length.\n #[track_caller]\n pub(crate) fn bytes_with_len_mut(&mut self, len: usize) -> Option<&mut [u8]> {\n if let Some(s) = self.data.as_deref_mut() {\n Some(&mut s[..len])\n } else {\n None\n }\n }\n\n /// Gets the underlying vector for this buffer.\n #[must_use]\n pub fn data(&self) -> Option<&[u8]> {\n self.data.as_deref()\n }\n\n /// Resizes the buffer to the new size, clamped to the maximum byte length if present.\n pub fn resize(&mut self, new_byte_length: u64) -> JsResult<()> {\n let Some(max_byte_len) = self.max_byte_len else {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer.resize: cannot resize a fixed-length buffer\")\n .into());\n };\n\n let Some(buf) = self.vec_mut() else {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer.resize: cannot resize a detached buffer\")\n .into());\n };\n\n if new_byte_length > max_byte_len {\n return Err(JsNativeError::range()\n .with_message(\n \"ArrayBuffer.resize: new byte length exceeds buffer's maximum byte length\",\n )\n .into());\n }\n\n buf.resize(new_byte_length as usize, 0);\n Ok(())\n }\n\n /// Detaches the inner data of this `ArrayBuffer`, returning the original buffer if still\n /// present.\n ///\n /// # Errors\n ///\n /// Throws an error if the provided detach key is invalid.\n pub fn detach(&mut self, key: &JsValue) -> JsResult>> {\n if !JsValue::same_value(&self.detach_key, key) {\n return Err(JsNativeError::typ()\n .with_message(\"Cannot detach array buffer with different key\")\n .into());\n }\n\n Ok(self.data.take())\n }\n\n /// `IsDetachedBuffer ( arrayBuffer )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-isdetachedbuffer\n pub(crate) const fn is_detached(&self) -> bool {\n // 1. If arrayBuffer.[[ArrayBufferData]] is null, return true.\n // 2. Return false.\n self.data.is_none()\n }\n\n pub(crate) fn is_fixed_len(&self) -> bool {\n self.max_byte_len.is_none()\n }\n}\n\nimpl IntrinsicObject for ArrayBuffer {\n fn init(realm: &Realm) {\n let flag_attributes = Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE;\n\n let get_species = BuiltInBuilder::callable(realm, Self::get_species)\n .name(js_string!(\"get [Symbol.species]\"))\n .build();\n\n let get_byte_length = BuiltInBuilder::callable(realm, Self::get_byte_length)\n .name(js_string!(\"get byteLength\"))\n .build();\n\n let get_resizable = BuiltInBuilder::callable(realm, Self::get_resizable)\n .name(js_string!(\"get resizable\"))\n .build();\n\n let get_max_byte_length = BuiltInBuilder::callable(realm, Self::get_max_byte_length)\n .name(js_string!(\"get maxByteLength\"))\n .build();\n\n #[cfg(feature = \"experimental\")]\n let get_detached = BuiltInBuilder::callable(realm, Self::get_detached)\n .name(js_string!(\"get detached\"))\n .build();\n\n let builder = BuiltInBuilder::from_standard_constructor::(realm)\n .static_accessor(\n JsSymbol::species(),\n Some(get_species),\n None,\n Attribute::CONFIGURABLE,\n )\n .static_method(Self::is_view, js_string!(\"isView\"), 1)\n .accessor(\n js_string!(\"byteLength\"),\n Some(get_byte_length),\n None,\n flag_attributes,\n )\n .accessor(\n js_string!(\"resizable\"),\n Some(get_resizable),\n None,\n flag_attributes,\n )\n .accessor(\n js_string!(\"maxByteLength\"),\n Some(get_max_byte_length),\n None,\n flag_attributes,\n )\n .method(Self::js_resize, js_string!(\"resize\"), 1)\n .method(Self::slice, js_string!(\"slice\"), 2)\n .property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::READONLY | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n );\n\n #[cfg(feature = \"experimental\")]\n let builder = builder\n .accessor(\n js_string!(\"detached\"),\n Some(get_detached),\n None,\n flag_attributes,\n )\n .method(Self::transfer::, js_string!(\"transfer\"), 0)\n .method(\n Self::transfer::,\n js_string!(\"transferToFixedLength\"),\n 0,\n );\n\n builder.build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for ArrayBuffer {\n const NAME: JsString = StaticJsStrings::ARRAY_BUFFER;\n}\n\nimpl BuiltInConstructor for ArrayBuffer {\n const PROTOTYPE_STORAGE_SLOTS: usize = 13;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 3;\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::array_buffer;\n\n /// `ArrayBuffer ( length )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-arraybuffer-length\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, throw a TypeError exception.\n if new_target.is_undefined() {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer.constructor called with undefined new target\")\n .into());\n }\n\n // 2. Let byteLength be ? ToIndex(length).\n let byte_len = args.get_or_undefined(0).to_index(context)?;\n\n // 3. Let requestedMaxByteLength be ? GetArrayBufferMaxByteLengthOption(options).\n let max_byte_len = get_max_byte_len(args.get_or_undefined(1), context)?;\n\n // 4. Return ? AllocateArrayBuffer(NewTarget, byteLength, requestedMaxByteLength).\n Ok(Self::allocate(new_target, byte_len, max_byte_len, context)?\n .upcast()\n .into())\n }\n}\n\nimpl ArrayBuffer {\n /// `ArrayBuffer.isView ( arg )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-arraybuffer.isview\n #[allow(clippy::unnecessary_wraps)]\n fn is_view(_: &JsValue, args: &[JsValue], _context: &mut Context) -> JsResult {\n // 1. If Type(arg) is not Object, return false.\n // 2. If arg has a [[ViewedArrayBuffer]] internal slot, return true.\n // 3. Return false.\n Ok(args\n .get_or_undefined(0)\n .as_object()\n .is_some_and(|obj| obj.is::() || obj.is::())\n .into())\n }\n\n /// `get ArrayBuffer [ @@species ]`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-arraybuffer-@@species\n #[allow(clippy::unnecessary_wraps)]\n fn get_species(this: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n // 1. Return the this value.\n Ok(this.clone())\n }\n\n /// `get ArrayBuffer.prototype.byteLength`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-arraybuffer.prototype.bytelength\n pub(crate) fn get_byte_length(\n this: &JsValue,\n _args: &[JsValue],\n _: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is true, throw a TypeError exception.\n let object = this.as_object();\n let buf = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"get ArrayBuffer.prototype.byteLength called with invalid `this`\")\n })?;\n\n // 4. If IsDetachedBuffer(O) is true, return +0𝔽.\n // 5. Let length be O.[[ArrayBufferByteLength]].\n // 6. Return 𝔽(length).\n Ok(buf.len().into())\n }\n\n /// [`get ArrayBuffer.prototype.maxByteLength`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-arraybuffer.prototype.maxbytelength\n pub(crate) fn get_max_byte_length(\n this: &JsValue,\n _args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is true, throw a TypeError exception.\n let object = this.as_object();\n let buf = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| {\n JsNativeError::typ().with_message(\n \"get ArrayBuffer.prototype.maxByteLength called with invalid `this`\",\n )\n })?;\n\n // 4. If IsDetachedBuffer(O) is true, return +0𝔽.\n let Some(data) = buf.bytes() else {\n return Ok(JsValue::from(0));\n };\n\n // 5. If IsFixedLengthArrayBuffer(O) is true, then\n // a. Let length be O.[[ArrayBufferByteLength]].\n // 6. Else,\n // a. Let length be O.[[ArrayBufferMaxByteLength]].\n // 7. Return 𝔽(length).\n Ok(buf.max_byte_len.unwrap_or(data.len() as u64).into())\n }\n\n /// [`get ArrayBuffer.prototype.resizable`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-arraybuffer.prototype.resizable\n pub(crate) fn get_resizable(\n this: &JsValue,\n _args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is true, throw a TypeError exception.\n let object = this.as_object();\n let buf = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"get ArrayBuffer.prototype.resizable called with invalid `this`\")\n })?;\n\n // 4. If IsFixedLengthArrayBuffer(O) is false, return true; otherwise return false.\n Ok(JsValue::from(!buf.is_fixed_len()))\n }\n\n /// [`get ArrayBuffer.prototype.detached`][spec].\n ///\n /// [spec]: https://tc39.es/proposal-arraybuffer-transfer/#sec-get-arraybuffer.prototype.detached\n #[cfg(feature = \"experimental\")]\n fn get_detached(\n this: &JsValue,\n _args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is true, throw a TypeError exception.\n let object = this.as_object();\n let buf = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"get ArrayBuffer.prototype.detached called with invalid `this`\")\n })?;\n\n // 4. Return IsDetachedBuffer(O).\n Ok(buf.is_detached().into())\n }\n\n /// [`ArrayBuffer.prototype.resize ( newLength )`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-arraybuffer.prototype.resize\n pub(crate) fn js_resize(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferMaxByteLength]]).\n // 3. If IsSharedArrayBuffer(O) is true, throw a TypeError exception.\n let buf = this\n .as_object()\n .and_then(|o| o.clone().downcast::().ok())\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"ArrayBuffer.prototype.resize called with invalid `this`\")\n })?;\n\n // 4. Let newByteLength be ? ToIndex(newLength).\n let new_byte_length = args.get_or_undefined(0).to_index(context)?;\n\n // These steps are performed in the `Self::resize` method.\n // 5. If IsDetachedBuffer(O) is true, throw a TypeError exception.\n // 6. If newByteLength > O.[[ArrayBufferMaxByteLength]], throw a RangeError exception.\n\n // TODO: 7. Let hostHandled be ? HostResizeArrayBuffer(O, newByteLength).\n // 8. If hostHandled is handled, return undefined.\n // Used in engines to handle Wasm buffers in a special way, but we don't\n // have a Wasm interpreter in place yet.\n\n // 9. Let oldBlock be O.[[ArrayBufferData]].\n // 10. Let newBlock be ? CreateByteDataBlock(newByteLength).\n // 11. Let copyLength be min(newByteLength, O.[[ArrayBufferByteLength]]).\n // 12. Perform CopyDataBlockBytes(newBlock, 0, oldBlock, 0, copyLength).\n // 13. NOTE: Neither creation of the new Data Block nor copying from the old Data Block are observable.\n // Implementations may implement this method as in-place growth or shrinkage.\n // 14. Set O.[[ArrayBufferData]] to newBlock.\n // 15. Set O.[[ArrayBufferByteLength]] to newByteLength.\n buf.borrow_mut().data_mut().resize(new_byte_length)?;\n\n // 16. Return undefined.\n Ok(JsValue::undefined())\n }\n\n /// `ArrayBuffer.prototype.slice ( start, end )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-arraybuffer.prototype.slice\n fn slice(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is true, throw a TypeError exception.\n let buf = this\n .as_object()\n .and_then(|o| o.clone().downcast::().ok())\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"ArrayBuffer.slice called with invalid `this` value\")\n })?;\n\n let len = {\n let buf = buf.borrow();\n // 4. If IsDetachedBuffer(O) is true, throw a TypeError exception.\n if buf.data().is_detached() {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer.slice called with detached buffer\")\n .into());\n }\n // 5. Let len be O.[[ArrayBufferByteLength]].\n buf.data().len() as u64\n };\n\n // 6. Let relativeStart be ? ToIntegerOrInfinity(start).\n // 7. If relativeStart = -∞, let first be 0.\n // 8. Else if relativeStart < 0, let first be max(len + relativeStart, 0).\n // 9. Else, let first be min(relativeStart, len).\n let first = Array::get_relative_start(context, args.get_or_undefined(0), len)?;\n\n // 10. If end is undefined, let relativeEnd be len; else let relativeEnd be ? ToIntegerOrInfinity(end).\n // 11. If relativeEnd = -∞, let final be 0.\n // 12. Else if relativeEnd < 0, let final be max(len + relativeEnd, 0).\n // 13. Else, let final be min(relativeEnd, len).\n let final_ = Array::get_relative_end(context, args.get_or_undefined(1), len)?;\n\n // 14. Let newLen be max(final - first, 0).\n let new_len = final_.saturating_sub(first);\n\n // 15. Let ctor be ? SpeciesConstructor(O, %ArrayBuffer%).\n let ctor = buf\n .clone()\n .upcast()\n .species_constructor(StandardConstructors::array_buffer, context)?;\n\n // 16. Let new be ? Construct(ctor, « 𝔽(newLen) »).\n let new = ctor.construct(&[new_len.into()], Some(&ctor), context)?;\n\n // 17. Perform ? RequireInternalSlot(new, [[ArrayBufferData]]).\n // 18. If IsSharedArrayBuffer(new) is true, throw a TypeError exception.\n let Ok(new) = new.downcast::() else {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer constructor returned invalid object\")\n .into());\n };\n\n // 20. If SameValue(new, O) is true, throw a TypeError exception.\n if JsObject::equals(&buf, &new) {\n return Err(JsNativeError::typ()\n .with_message(\"new ArrayBuffer is the same as this ArrayBuffer\")\n .into());\n }\n\n {\n // 19. If IsDetachedBuffer(new) is true, throw a TypeError exception.\n // 25. Let toBuf be new.[[ArrayBufferData]].\n let mut new = new.borrow_mut();\n let Some(to_buf) = new.data_mut().bytes_mut() else {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer constructor returned detached ArrayBuffer\")\n .into());\n };\n\n // 21. If new.[[ArrayBufferByteLength]] < newLen, throw a TypeError exception.\n if (to_buf.len() as u64) < new_len {\n return Err(JsNativeError::typ()\n .with_message(\"new ArrayBuffer length too small\")\n .into());\n }\n\n // 22. NOTE: Side-effects of the above steps may have detached O.\n // 23. If IsDetachedBuffer(O) is true, throw a TypeError exception.\n // 24. Let fromBuf be O.[[ArrayBufferData]].\n let buf = buf.borrow();\n let Some(from_buf) = buf.data().bytes() else {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer detached while ArrayBuffer.slice was running\")\n .into());\n };\n\n // 26. Perform CopyDataBlockBytes(toBuf, 0, fromBuf, first, newLen).\n let first = first as usize;\n let new_len = new_len as usize;\n to_buf[..new_len].copy_from_slice(&from_buf[first..first + new_len]);\n }\n\n // 27. Return new.\n Ok(new.upcast().into())\n }\n\n /// [`ArrayBuffer.prototype.transfer ( [ newLength ] )`][transfer] and\n /// [`ArrayBuffer.prototype.transferToFixedLength ( [ newLength ] )`][transferFL]\n ///\n /// [transfer]: https://tc39.es/proposal-arraybuffer-transfer/#sec-arraybuffer.prototype.transfer\n /// [transferFL]: https://tc39.es/proposal-arraybuffer-transfer/#sec-arraybuffer.prototype.transfertofixedlength\n #[cfg(feature = \"experimental\")]\n fn transfer(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Return ? ArrayBufferCopyAndDetach(O, newLength, preserve-resizability).\n\n // Abstract operation `ArrayBufferCopyAndDetach ( arrayBuffer, newLength, preserveResizability )`\n // https://tc39.es/proposal-arraybuffer-transfer/#sec-arraybuffercopyanddetach\n\n let new_length = args.get_or_undefined(0);\n\n // 1. Perform ? RequireInternalSlot(arrayBuffer, [[ArrayBufferData]]).\n // 2. If IsSharedArrayBuffer(arrayBuffer) is true, throw a TypeError exception.\n let buf = this\n .as_object()\n .and_then(|o| o.clone().downcast::().ok())\n .ok_or_else(|| {\n JsNativeError::typ().with_message(if TO_FIXED_LENGTH {\n \"ArrayBuffer.prototype.transferToFixedLength called with invalid `this`\"\n } else {\n \"ArrayBuffer.prototype.transfer called with invalid `this`\"\n })\n })?;\n\n // 3. If newLength is undefined, then\n let new_len = if new_length.is_undefined() {\n // a. Let newByteLength be arrayBuffer.[[ArrayBufferByteLength]].\n buf.borrow().data().len() as u64\n } else {\n // 4. Else,\n // a. Let newByteLength be ? ToIndex(newLength).\n new_length.to_index(context)?\n };\n\n // 5. If IsDetachedBuffer(arrayBuffer) is true, throw a TypeError exception.\n let Some(mut bytes) = buf.borrow_mut().data_mut().data.take() else {\n return Err(JsNativeError::typ()\n .with_message(\"cannot transfer a detached buffer\")\n .into());\n };\n\n // 6. If preserveResizability is preserve-resizability and IsResizableArrayBuffer(arrayBuffer)\n // is true, then\n // a. Let newMaxByteLength be arrayBuffer.[[ArrayBufferMaxByteLength]].\n // 7. Else,\n // a. Let newMaxByteLength be empty.\n let new_max_len = buf\n .borrow()\n .data()\n .max_byte_len\n .filter(|_| !TO_FIXED_LENGTH);\n\n // 8. If arrayBuffer.[[ArrayBufferDetachKey]] is not undefined, throw a TypeError exception.\n if !buf.borrow().data().detach_key.is_undefined() {\n buf.borrow_mut().data_mut().data = Some(bytes);\n return Err(JsNativeError::typ()\n .with_message(\"cannot transfer a buffer with a detach key\")\n .into());\n }\n\n // Effectively, the next steps only create a new object for the same vec, so we can skip all\n // those steps and just make a single check + trigger the realloc.\n\n // 9. Let newBuffer be ? AllocateArrayBuffer(%ArrayBuffer%, newByteLength, newMaxByteLength).\n // 10. Let copyLength be min(newByteLength, arrayBuffer.[[ArrayBufferByteLength]]).\n // 11. Let fromBlock be arrayBuffer.[[ArrayBufferData]].\n // 12. Let toBlock be newBuffer.[[ArrayBufferData]].\n // 13. Perform CopyDataBlockBytes(toBlock, 0, fromBlock, 0, copyLength).\n // 14. NOTE: Neither creation of the new Data Block nor copying from the old Data Block are\n // observable. Implementations may implement this method as a zero-copy move or a realloc.\n // 15. Perform ! DetachArrayBuffer(arrayBuffer).\n // 16. Return newBuffer.\n if let Some(new_max_len) = new_max_len {\n if new_len > new_max_len {\n buf.borrow_mut().data_mut().data = Some(bytes);\n return Err(JsNativeError::range()\n .with_message(\"`length` cannot be bigger than `maxByteLength`\")\n .into());\n }\n // Should only truncate without reallocating.\n bytes.resize(new_len as usize, 0);\n } else {\n bytes.resize(new_len as usize, 0);\n\n // Realloc the vec to fit onto the new exact length.\n bytes.shrink_to_fit();\n }\n\n let prototype = context\n .intrinsics()\n .constructors()\n .array_buffer()\n .prototype();\n\n Ok(JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n prototype,\n ArrayBuffer {\n data: Some(bytes),\n max_byte_len: new_max_len,\n detach_key: JsValue::undefined(),\n },\n )\n .into())\n }\n\n /// `AllocateArrayBuffer ( constructor, byteLength )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-allocatearraybuffer\n pub(crate) fn allocate(\n constructor: &JsValue,\n byte_len: u64,\n max_byte_len: Option,\n context: &mut Context,\n ) -> JsResult> {\n // 1. Let slots be « [[ArrayBufferData]], [[ArrayBufferByteLength]], [[ArrayBufferDetachKey]] ».\n // 2. If maxByteLength is present and maxByteLength is not empty, let allocatingResizableBuffer be true; otherwise let allocatingResizableBuffer be false.\n // 3. If allocatingResizableBuffer is true, then\n // a. If byteLength > maxByteLength, throw a RangeError exception.\n // b. Append [[ArrayBufferMaxByteLength]] to slots.\n if let Some(max_byte_len) = max_byte_len\n && byte_len > max_byte_len\n {\n return Err(JsNativeError::range()\n .with_message(\"`length` cannot be bigger than `maxByteLength`\")\n .into());\n }\n\n // 4. Let obj be ? OrdinaryCreateFromConstructor(constructor, \"%ArrayBuffer.prototype%\", slots).\n let prototype = get_prototype_from_constructor(\n constructor,\n StandardConstructors::array_buffer,\n context,\n )?;\n\n // 5. Let block be ? CreateByteDataBlock(byteLength).\n // Preemptively allocate for `max_byte_len` if possible.\n // a. If it is not possible to create a Data Block block consisting of maxByteLength bytes, throw a RangeError exception.\n // b. NOTE: Resizable ArrayBuffers are designed to be implementable with in-place growth. Implementations may\n // throw if, for example, virtual memory cannot be reserved up front.\n let block = create_byte_data_block(byte_len, max_byte_len, context)?;\n\n let obj = JsObject::new(\n context.root_shape(),\n prototype,\n Self {\n // 6. Set obj.[[ArrayBufferData]] to block.\n // 7. Set obj.[[ArrayBufferByteLength]] to byteLength.\n data: Some(block),\n // 8. If allocatingResizableBuffer is true, then\n // c. Set obj.[[ArrayBufferMaxByteLength]] to maxByteLength.\n max_byte_len,\n detach_key: JsValue::undefined(),\n },\n );\n\n // 9. Return obj.\n Ok(obj)\n }\n}\n\n/// Abstract operation [`GetArrayBufferMaxByteLengthOption ( options )`][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-getarraybuffermaxbytelengthoption\nfn get_max_byte_len(options: &JsValue, context: &mut Context) -> JsResult> {\n // 1. If options is not an Object, return empty.\n let Some(options) = options.as_object() else {\n return Ok(None);\n };\n\n // 2. Let maxByteLength be ? Get(options, \"maxByteLength\").\n let max_byte_len = options.get(js_string!(\"maxByteLength\"), context)?;\n\n // 3. If maxByteLength is undefined, return empty.\n if max_byte_len.is_undefined() {\n return Ok(None);\n }\n\n // 4. Return ? ToIndex(maxByteLength).\n max_byte_len.to_index(context).map(Some)\n}\n\n/// `CreateByteDataBlock ( size )` abstract operation.\n///\n/// The abstract operation `CreateByteDataBlock` takes argument `size` (a non-negative\n/// integer). For more information, check the [spec][spec].\n///\n/// [spec]: https://tc39.es/ecma262/#sec-createbytedatablock\npub(crate) fn create_byte_data_block(\n size: u64,\n max_buffer_size: Option,\n context: &mut Context,\n) -> JsResult> {\n let alloc_size = max_buffer_size.unwrap_or(size);\n\n assert!(size <= alloc_size);\n\n if alloc_size > context.host_hooks().max_buffer_size(context) {\n return Err(JsNativeError::range()\n .with_message(\"cannot allocate a buffer that exceeds the maximum buffer size\")\n .into());\n }\n\n // 1. Let db be a new Data Block value consisting of size bytes. If it is impossible to\n // create such a Data Block, throw a RangeError exception.\n let alloc_size = alloc_size.try_into().map_err(|e| {\n JsNativeError::range().with_message(format!(\"couldn't allocate the data block: {e}\"))\n })?;\n\n let mut data_block = AlignedVec::::new(64);\n data_block.try_reserve_exact(alloc_size).map_err(|e| {\n let message = match e {\n aligned_vec::TryReserveError::CapacityOverflow => {\n format!(\"capacity overflow for size {size} while allocating data block\")\n }\n aligned_vec::TryReserveError::AllocError { layout } => {\n format!(\"invalid layout {layout:?} while allocating data block\")\n }\n };\n JsNativeError::range().with_message(message)\n })?;\n\n // since size <= alloc_size, then `size` must also fit inside a `usize`.\n let size = size as usize;\n\n // 2. Set all of the bytes of db to 0.\n data_block.resize(size, 0);\n\n // 3. Return db.\n Ok(data_block)\n}\n" }, { "path": "core/engine/src/builtins/array_buffer/shared.rs", "content": "use std::{\n ptr,\n sync::{Arc, atomic::Ordering},\n};\n\nuse portable_atomic::{AtomicU8, AtomicUsize};\n\nuse boa_gc::{Finalize, Trace};\n\nuse crate::{\n Context, JsArgs, JsData, JsNativeError, JsObject, JsResult, JsString, JsSymbol, JsValue,\n builtins::{\n Array, BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject,\n array_buffer::{AlignedBox, AlignedVec},\n },\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n object::internal_methods::get_prototype_from_constructor,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{get_max_byte_len, utils::copy_shared_to_shared};\n\n/// The internal representation of a `SharedArrayBuffer` object.\n///\n/// This struct implements `Send` and `Sync`, meaning it can be shared between threads\n/// running different JS code at the same time.\n#[derive(Debug, Clone, Trace, Finalize, JsData)]\npub struct SharedArrayBuffer {\n // Shared buffers cannot be detached.\n #[unsafe_ignore_trace]\n data: Arc,\n}\n\n#[derive(Debug)]\nstruct Inner {\n // Technically we should have an `[[ArrayBufferData]]` internal slot,\n // `[[ArrayBufferByteLengthData]]` and `[[ArrayBufferMaxByteLength]]` slots for growable arrays\n // or `[[ArrayBufferByteLength]]` for fixed arrays, but we can save some work\n // by just using this representation instead.\n //\n // The maximum buffer length is represented by `buffer.len()`, and `current_len` has the current\n // buffer length, or `None` if this is a fixed buffer; in this case, `buffer.len()` will be\n // the true length of the buffer.\n buffer: AlignedBox<[AtomicU8]>,\n current_len: Option,\n}\n\nimpl Default for Inner {\n fn default() -> Self {\n Self {\n buffer: AlignedVec::new(0).into_boxed_slice(),\n current_len: None,\n }\n }\n}\n\nimpl SharedArrayBuffer {\n /// Creates a `SharedArrayBuffer` with an empty buffer.\n #[must_use]\n pub fn empty() -> Self {\n Self {\n data: Arc::default(),\n }\n }\n\n /// Gets the length of this `SharedArrayBuffer`.\n pub(crate) fn len(&self, ordering: Ordering) -> usize {\n self.data\n .current_len\n .as_ref()\n .map_or_else(|| self.data.buffer.len(), |len| len.load(ordering))\n }\n\n /// Gets the inner bytes of this `SharedArrayBuffer`.\n pub(crate) fn bytes(&self, ordering: Ordering) -> &[AtomicU8] {\n &self.data.buffer[..self.len(ordering)]\n }\n\n /// Gets the inner data of the buffer without accessing the current atomic length.\n #[track_caller]\n pub(crate) fn bytes_with_len(&self, len: usize) -> &[AtomicU8] {\n &self.data.buffer[..len]\n }\n\n /// Gets a pointer to the internal shared buffer.\n pub(crate) fn as_ptr(&self) -> *const AtomicU8 {\n (*self.data.buffer).as_ptr()\n }\n\n pub(crate) fn is_fixed_len(&self) -> bool {\n self.data.current_len.is_none()\n }\n}\n\nimpl IntrinsicObject for SharedArrayBuffer {\n fn init(realm: &Realm) {\n let flag_attributes = Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE;\n\n let get_species = BuiltInBuilder::callable(realm, Self::get_species)\n .name(js_string!(\"get [Symbol.species]\"))\n .build();\n\n let get_byte_length = BuiltInBuilder::callable(realm, Self::get_byte_length)\n .name(js_string!(\"get byteLength\"))\n .build();\n\n let get_growable = BuiltInBuilder::callable(realm, Self::get_growable)\n .name(js_string!(\"get growable\"))\n .build();\n\n let get_max_byte_length = BuiltInBuilder::callable(realm, Self::get_max_byte_length)\n .name(js_string!(\"get maxByteLength\"))\n .build();\n\n BuiltInBuilder::from_standard_constructor::(realm)\n .static_accessor(\n JsSymbol::species(),\n Some(get_species),\n None,\n Attribute::CONFIGURABLE,\n )\n .accessor(\n js_string!(\"byteLength\"),\n Some(get_byte_length),\n None,\n flag_attributes,\n )\n .accessor(\n js_string!(\"growable\"),\n Some(get_growable),\n None,\n flag_attributes,\n )\n .accessor(\n js_string!(\"maxByteLength\"),\n Some(get_max_byte_length),\n None,\n flag_attributes,\n )\n .method(Self::slice, js_string!(\"slice\"), 2)\n .method(Self::grow, js_string!(\"grow\"), 1)\n .property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::READONLY | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for SharedArrayBuffer {\n const NAME: JsString = StaticJsStrings::SHARED_ARRAY_BUFFER;\n}\n\nimpl BuiltInConstructor for SharedArrayBuffer {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 9;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 2;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::shared_array_buffer;\n\n /// `25.1.3.1 SharedArrayBuffer ( length [ , options ] )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-sharedarraybuffer-constructor\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, throw a TypeError exception.\n if new_target.is_undefined() {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer.constructor called with undefined new target\")\n .into());\n }\n\n // 2. Let byteLength be ? ToIndex(length).\n let byte_len = args.get_or_undefined(0).to_index(context)?;\n\n // 3. Let requestedMaxByteLength be ? GetArrayBufferMaxByteLengthOption(options).\n let max_byte_len = get_max_byte_len(args.get_or_undefined(1), context)?;\n\n // 4. Return ? AllocateSharedArrayBuffer(NewTarget, byteLength, requestedMaxByteLength).\n Ok(Self::allocate(new_target, byte_len, max_byte_len, context)?\n .upcast()\n .into())\n }\n}\n\nimpl SharedArrayBuffer {\n /// `get SharedArrayBuffer [ @@species ]`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-sharedarraybuffer-@@species\n #[allow(clippy::unnecessary_wraps)]\n fn get_species(this: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n // 1. Return the this value.\n Ok(this.clone())\n }\n\n /// `get SharedArrayBuffer.prototype.byteLength`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-sharedarraybuffer.prototype.bytelength\n pub(crate) fn get_byte_length(\n this: &JsValue,\n _args: &[JsValue],\n _: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is true, throw a TypeError exception.\n let object = this.as_object();\n let buf = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"SharedArrayBuffer.byteLength called with invalid value\")\n })?;\n\n // 4. Let length be ArrayBufferByteLength(O, seq-cst).\n let len = buf.bytes(Ordering::SeqCst).len() as u64;\n\n // 5. Return 𝔽(length).\n Ok(len.into())\n }\n\n /// [`get SharedArrayBuffer.prototype.growable`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-sharedarraybuffer.prototype.growable\n pub(crate) fn get_growable(\n this: &JsValue,\n _args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is false, throw a TypeError exception.\n let object = this.as_object();\n let buf = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"get SharedArrayBuffer.growable called with invalid `this`\")\n })?;\n\n // 4. If IsFixedLengthArrayBuffer(O) is false, return true; otherwise return false.\n Ok(JsValue::from(!buf.is_fixed_len()))\n }\n\n /// [`get SharedArrayBuffer.prototype.maxByteLength`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-sharedarraybuffer.prototype.maxbytelength\n pub(crate) fn get_max_byte_length(\n this: &JsValue,\n _args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is false, throw a TypeError exception.\n let object = this.as_object();\n let buf = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"get SharedArrayBuffer.maxByteLength called with invalid value\")\n })?;\n\n // 4. If IsFixedLengthArrayBuffer(O) is true, then\n // a. Let length be O.[[ArrayBufferByteLength]].\n // 5. Else,\n // a. Let length be O.[[ArrayBufferMaxByteLength]].\n // 6. Return 𝔽(length).\n Ok(buf.data.buffer.len().into())\n }\n\n /// [`SharedArrayBuffer.prototype.grow ( newLength )`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/sec-sharedarraybuffer.prototype.grow\n pub(crate) fn grow(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 3. If IsSharedArrayBuffer(O) is false, throw a TypeError exception.\n let Some(buf) = this\n .as_object()\n .and_then(|o| o.clone().downcast::().ok())\n else {\n return Err(JsNativeError::typ()\n .with_message(\"SharedArrayBuffer.grow called with non-object value\")\n .into());\n };\n\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferMaxByteLength]]).\n if buf.borrow().data().is_fixed_len() {\n return Err(JsNativeError::typ()\n .with_message(\"SharedArrayBuffer.grow: cannot grow a fixed-length buffer\")\n .into());\n }\n\n // 4. Let newByteLength be ? ToIndex(newLength).\n let new_byte_len = args.get_or_undefined(0).to_index(context)?;\n\n // TODO: 5. Let hostHandled be ? HostGrowSharedArrayBuffer(O, newByteLength).\n // 6. If hostHandled is handled, return undefined.\n // Used in engines to handle Wasm buffers in a special way, but we don't\n // have a Wasm interpreter in place yet.\n\n // 7. Let isLittleEndian be the value of the [[LittleEndian]] field of the surrounding agent's Agent Record.\n // 8. Let byteLengthBlock be O.[[ArrayBufferByteLengthData]].\n // 9. Let currentByteLengthRawBytes be GetRawBytesFromSharedBlock(byteLengthBlock, 0, biguint64, true, seq-cst).\n // 10. Let newByteLengthRawBytes be NumericToRawBytes(biguint64, ℤ(newByteLength), isLittleEndian).\n\n let buf = buf.borrow();\n let buf = &buf.data();\n\n // d. If newByteLength < currentByteLength or newByteLength > O.[[ArrayBufferMaxByteLength]], throw a RangeError exception.\n // Extracting this condition outside the CAS since throwing early doesn't affect the correct\n // behaviour of the loop.\n if new_byte_len > buf.data.buffer.len() as u64 {\n return Err(JsNativeError::range()\n .with_message(\n \"SharedArrayBuffer.grow: new length cannot be bigger than `maxByteLength`\",\n )\n .into());\n }\n let new_byte_len = new_byte_len as usize;\n\n // If we used let-else above to avoid the expect, we would carry a borrow through the `to_index`\n // call, which could mutably borrow. Another alternative would be to clone the whole\n // `SharedArrayBuffer`, but it's better to avoid contention with the counter in the `Arc` pointer.\n let atomic_len = buf\n .data\n .current_len\n .as_ref()\n .expect(\"already checked that the buffer is not fixed-length\");\n\n // 11. Repeat,\n // a. NOTE: This is a compare-and-exchange loop to ensure that parallel, racing grows of the same buffer are\n // totally ordered, are not lost, and do not silently do nothing. The loop exits if it was able to attempt\n // to grow uncontended.\n // b. Let currentByteLength be ℝ(RawBytesToNumeric(biguint64, currentByteLengthRawBytes, isLittleEndian)).\n // c. If newByteLength = currentByteLength, return undefined.\n // d. If newByteLength < currentByteLength or newByteLength > O.[[ArrayBufferMaxByteLength]], throw a\n // RangeError exception.\n // e. Let byteLengthDelta be newByteLength - currentByteLength.\n // f. If it is impossible to create a new Shared Data Block value consisting of byteLengthDelta bytes, throw\n // a RangeError exception.\n // g. NOTE: No new Shared Data Block is constructed and used here. The observable behaviour of growable\n // SharedArrayBuffers is specified by allocating a max-sized Shared Data Block at construction time, and\n // this step captures the requirement that implementations that run out of memory must throw a RangeError.\n // h. Let readByteLengthRawBytes be AtomicCompareExchangeInSharedBlock(byteLengthBlock, 0, 8,\n // currentByteLengthRawBytes, newByteLengthRawBytes).\n // i. If ByteListEqual(readByteLengthRawBytes, currentByteLengthRawBytes) is true, return undefined.\n // j. Set currentByteLengthRawBytes to readByteLengthRawBytes.\n\n // We require SEQ-CST operations because readers of the buffer also use SEQ-CST operations.\n atomic_len\n .fetch_update(Ordering::SeqCst, Ordering::SeqCst, |prev_byte_len| {\n (prev_byte_len <= new_byte_len).then_some(new_byte_len)\n })\n .map_err(|_| {\n JsNativeError::range()\n .with_message(\"SharedArrayBuffer.grow: failed to grow buffer to new length\")\n })?;\n\n Ok(JsValue::undefined())\n }\n\n /// `SharedArrayBuffer.prototype.slice ( start, end )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-sharedarraybuffer.prototype.slice\n fn slice(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).\n // 3. If IsSharedArrayBuffer(O) is false, throw a TypeError exception.\n let buf = this\n .as_object()\n .and_then(|o| o.clone().downcast::().ok())\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"SharedArrayBuffer.slice called with invalid `this` value\")\n })?;\n\n // 4. Let len be ArrayBufferByteLength(O, seq-cst).\n let len = buf.borrow().data().len(Ordering::SeqCst);\n\n // 5. Let relativeStart be ? ToIntegerOrInfinity(start).\n // 6. If relativeStart = -∞, let first be 0.\n // 7. Else if relativeStart < 0, let first be max(len + relativeStart, 0).\n // 8. Else, let first be min(relativeStart, len).\n let first = Array::get_relative_start(context, args.get_or_undefined(0), len as u64)?;\n\n // 9. If end is undefined, let relativeEnd be len; else let relativeEnd be ? ToIntegerOrInfinity(end).\n // 10. If relativeEnd = -∞, let final be 0.\n // 11. Else if relativeEnd < 0, let final be max(len + relativeEnd, 0).\n // 12. Else, let final be min(relativeEnd, len).\n let final_ = Array::get_relative_end(context, args.get_or_undefined(1), len as u64)?;\n\n // 13. Let newLen be max(final - first, 0).\n let new_len = final_.saturating_sub(first);\n\n // 14. Let ctor be ? SpeciesConstructor(O, %SharedArrayBuffer%).\n let ctor = buf\n .clone()\n .upcast()\n .species_constructor(StandardConstructors::shared_array_buffer, context)?;\n\n // 15. Let new be ? Construct(ctor, « 𝔽(newLen) »).\n let new = ctor.construct(&[new_len.into()], Some(&ctor), context)?;\n\n {\n let buf = buf.borrow();\n let buf = &buf.data();\n // 16. Perform ? RequireInternalSlot(new, [[ArrayBufferData]]).\n // 17. If IsSharedArrayBuffer(new) is false, throw a TypeError exception.\n let new = new.downcast_ref::().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"SharedArrayBuffer constructor returned invalid object\")\n })?;\n\n // 18. If new.[[ArrayBufferData]] is O.[[ArrayBufferData]], throw a TypeError exception.\n if ptr::eq(buf.as_ptr(), new.as_ptr()) {\n return Err(JsNativeError::typ()\n .with_message(\"cannot reuse the same SharedArrayBuffer for a slice operation\")\n .into());\n }\n\n // 19. If ArrayBufferByteLength(new, seq-cst) < newLen, throw a TypeError exception.\n if (new.len(Ordering::SeqCst) as u64) < new_len {\n return Err(JsNativeError::typ()\n .with_message(\"invalid size of constructed SharedArrayBuffer\")\n .into());\n }\n\n let first = first as usize;\n let new_len = new_len as usize;\n\n // 20. Let fromBuf be O.[[ArrayBufferData]].\n let from_buf = &buf.bytes_with_len(len)[first..];\n\n // 21. Let toBuf be new.[[ArrayBufferData]].\n let to_buf = new;\n\n // Sanity check to ensure there is enough space inside `from_buf` for\n // `new_len` elements.\n debug_assert!(from_buf.len() >= new_len);\n\n // 22. Perform CopyDataBlockBytes(toBuf, 0, fromBuf, first, newLen).\n // SAFETY: `get_slice_range` will always return indices that are in-bounds.\n // This also means that the newly created buffer will have at least `new_len` elements\n // to write to.\n unsafe { copy_shared_to_shared(from_buf.as_ptr(), to_buf.as_ptr(), new_len) }\n }\n\n // 23. Return new.\n Ok(new.into())\n }\n\n /// `AllocateSharedArrayBuffer ( constructor, byteLength [ , maxByteLength ] )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-allocatesharedarraybuffer\n pub(crate) fn allocate(\n constructor: &JsValue,\n byte_len: u64,\n max_byte_len: Option,\n context: &mut Context,\n ) -> JsResult> {\n // 1. Let slots be « [[ArrayBufferData]] ».\n // 2. If maxByteLength is present and maxByteLength is not empty, let allocatingGrowableBuffer\n // be true; otherwise let allocatingGrowableBuffer be false.\n // 3. If allocatingGrowableBuffer is true, then\n // a. If byteLength > maxByteLength, throw a RangeError exception.\n // b. Append [[ArrayBufferByteLengthData]] and [[ArrayBufferMaxByteLength]] to slots.\n // 4. Else,\n // a. Append [[ArrayBufferByteLength]] to slots.\n if let Some(max_byte_len) = max_byte_len\n && byte_len > max_byte_len\n {\n return Err(JsNativeError::range()\n .with_message(\"`length` cannot be bigger than `maxByteLength`\")\n .into());\n }\n\n // 5. Let obj be ? OrdinaryCreateFromConstructor(constructor, \"%SharedArrayBuffer.prototype%\", slots).\n let prototype = get_prototype_from_constructor(\n constructor,\n StandardConstructors::shared_array_buffer,\n context,\n )?;\n\n // 6. If allocatingGrowableBuffer is true, let allocLength be maxByteLength;\n // otherwise let allocLength be byteLength.\n let alloc_len = max_byte_len.unwrap_or(byte_len);\n\n // 7. Let block be ? CreateSharedByteDataBlock(allocLength).\n // 8. Set obj.[[ArrayBufferData]] to block.\n let block = create_shared_byte_data_block(alloc_len, context)?;\n\n // 9. If allocatingGrowableBuffer is true, then\n // `byte_len` must fit inside an `usize` thanks to the checks inside\n // `create_shared_byte_data_block`.\n // a. Assert: byteLength ≤ maxByteLength.\n // b. Let byteLengthBlock be ? CreateSharedByteDataBlock(8).\n // c. Perform SetValueInBuffer(byteLengthBlock, 0, biguint64, ℤ(byteLength), true, seq-cst).\n // d. Set obj.[[ArrayBufferByteLengthData]] to byteLengthBlock.\n // e. Set obj.[[ArrayBufferMaxByteLength]] to maxByteLength.\n let current_len = max_byte_len.map(|_| AtomicUsize::new(byte_len as usize));\n\n // 10. Else,\n // a. Set obj.[[ArrayBufferByteLength]] to byteLength.\n let obj = JsObject::new(\n context.root_shape(),\n prototype,\n Self {\n data: Arc::new(Inner {\n buffer: block,\n current_len,\n }),\n },\n );\n\n // 11. Return obj.\n Ok(obj)\n }\n}\n\n/// [`CreateSharedByteDataBlock ( size )`][spec] abstract operation.\n///\n/// Creates a new `Arc>` that can be used as a backing buffer for a [`SharedArrayBuffer`].\n///\n/// For more information, check the [spec][spec].\n///\n/// [spec]: https://tc39.es/ecma262/#sec-createsharedbytedatablock\npub(crate) fn create_shared_byte_data_block(\n size: u64,\n context: &mut Context,\n) -> JsResult> {\n if size > context.host_hooks().max_buffer_size(context) {\n return Err(JsNativeError::range()\n .with_message(\n \"cannot allocate a buffer that exceeds the maximum buffer size\".to_string(),\n )\n .into());\n }\n\n // 1. Let db be a new Shared Data Block value consisting of size bytes. If it is impossible to\n // create such a Shared Data Block, throw a RangeError exception.\n let size = size.try_into().map_err(|e| {\n JsNativeError::range().with_message(format!(\"couldn't allocate the data block: {e}\"))\n })?;\n\n if size == 0 {\n // Must ensure we don't allocate a zero-sized buffer.\n return Ok(AlignedVec::new(0).into_boxed_slice());\n }\n\n // 2. Let execution be the [[CandidateExecution]] field of the surrounding agent's Agent Record.\n // 3. Let eventsRecord be the Agent Events Record of execution.[[EventsRecords]] whose\n // [[AgentSignifier]] is AgentSignifier().\n // 4. Let zero be « 0 ».\n // 5. For each index i of db, do\n // a. Append WriteSharedMemory { [[Order]]: init, [[NoTear]]: true, [[Block]]: db,\n // [[ByteIndex]]: i, [[ElementSize]]: 1, [[Payload]]: zero } to eventsRecord.[[EventList]].\n // 6. Return db.\n let mut buf = AlignedVec::::new(0);\n buf.try_reserve_exact(size).map_err(|e| {\n let message = match e {\n aligned_vec::TryReserveError::CapacityOverflow => {\n format!(\"capacity overflow for size {size} while allocating data block\")\n }\n aligned_vec::TryReserveError::AllocError { layout } => {\n format!(\"invalid layout {layout:?} while allocating data block\")\n }\n };\n JsNativeError::range().with_message(message)\n })?;\n buf.resize(size, 0);\n buf.shrink_to_fit();\n let (data, align, len, _) = buf.into_raw_parts();\n\n // 3. Return db.\n // SAFETY: `[u8]` must be transparently castable to `[AtomicU8]`.\n Ok(unsafe {\n AlignedBox::from_raw_parts(align, ptr::slice_from_raw_parts_mut(data.cast(), len))\n })\n}\n" }, { "path": "core/engine/src/builtins/array_buffer/tests.rs", "content": "use crate::object::JsArrayBuffer;\nuse crate::{TestAction, run_test_actions};\n\n#[test]\nfn create_byte_data_block() {\n run_test_actions([TestAction::inspect_context(|context| {\n // Sunny day\n assert!(super::create_byte_data_block(100, None, context).is_ok());\n\n // Rainy day\n assert!(super::create_byte_data_block(u64::MAX, None, context).is_err());\n })]);\n}\n\n#[test]\nfn create_shared_byte_data_block() {\n run_test_actions([TestAction::inspect_context(|context| {\n // Sunny day\n assert!(super::shared::create_shared_byte_data_block(100, context).is_ok());\n\n // Rainy day\n assert!(super::shared::create_shared_byte_data_block(u64::MAX, context).is_err());\n })]);\n}\n\n#[test]\nfn resize() {\n run_test_actions([TestAction::inspect_context(|context| {\n let data_block = super::create_byte_data_block(100, None, context).unwrap();\n let js_arr = JsArrayBuffer::from_byte_block(data_block, context)\n .unwrap()\n .with_max_byte_length(100);\n let mut arr = js_arr.borrow_mut();\n\n // Sunny day\n assert_eq!(arr.data_mut().resize(50), Ok(()));\n\n // Rainy day\n assert!(arr.data_mut().resize(u64::MAX).is_err());\n })]);\n}\n\n#[test]\nfn get_values() {\n run_test_actions([\n TestAction::run(\n r#\"\n var buffer = new ArrayBuffer(12);\n var sample = new DataView(buffer, 0);\n\n sample.setUint8(0, 127);\n sample.setUint8(1, 255);\n sample.setUint8(2, 255);\n sample.setUint8(3, 255);\n sample.setUint8(4, 128);\n sample.setUint8(5, 0);\n sample.setUint8(6, 0);\n sample.setUint8(7, 0);\n sample.setUint8(8, 1);\n sample.setUint8(9, 0);\n sample.setUint8(10, 0);\n sample.setUint8(11, 0);\n \"#,\n ),\n TestAction::assert(\"sample.getUint32(0, false) == 2147483647\"),\n TestAction::assert(\"sample.getUint32(1, false) == 4294967168\"),\n TestAction::assert(\"sample.getUint32(2, false) == 4294934528\"),\n TestAction::assert(\"sample.getUint32(3, false) == 4286578688\"),\n TestAction::assert(\"sample.getUint32(4, false) == 2147483648\"),\n TestAction::assert(\"sample.getUint32(5, false) == 1\"),\n TestAction::assert(\"sample.getUint32(6, false) == 256\"),\n TestAction::assert(\"sample.getUint32(7, false) == 65536\"),\n TestAction::assert(\"sample.getUint32(8, false) == 16777216\"),\n TestAction::assert(\"sample.getUint32(0, true) == 4294967167\"),\n TestAction::assert(\"sample.getUint32(1, true) == 2164260863\"),\n TestAction::assert(\"sample.getUint32(2, true) == 8454143\"),\n TestAction::assert(\"sample.getUint32(3, true) == 33023\"),\n TestAction::assert(\"sample.getUint32(4, true) == 128\"),\n TestAction::assert(\"sample.getUint32(5, true) == 16777216\"),\n TestAction::assert(\"sample.getUint32(6, true) == 65536\"),\n TestAction::assert(\"sample.getUint32(7, true) == 256\"),\n TestAction::assert(\"sample.getUint32(8, true) == 1\"),\n ]);\n}\n\n#[test]\nfn sort() {\n run_test_actions([\n TestAction::run(\n r#\"\n // This cmp function is needed as the harness does not support TypedArray comparison.\n function cmp(a, b) {\n return a.length === b.length && a.every((v, i) => v === b[i]);\n }\n\n var TypedArrayCtor = [\n Int8Array,\n Uint8Array,\n Int16Array,\n Uint16Array,\n Int32Array,\n Uint32Array,\n Float32Array,\n Float64Array,\n ];\n\n var descending = TypedArrayCtor.map((ctor) => new ctor([4, 3, 2, 1]).sort());\n var mixed = TypedArrayCtor.map((ctor) => new ctor([3, 4, 1, 2]).sort());\n var repeating = TypedArrayCtor.map((ctor) => new ctor([0, 1, 1, 2, 3, 3, 4]).sort());\n \"#,\n ),\n // Descending\n TestAction::assert(\"cmp(descending[0], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(descending[1], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(descending[2], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(descending[3], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(descending[4], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(descending[5], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(descending[6], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(descending[7], [1, 2, 3, 4])\"),\n // Mixed\n TestAction::assert(\"cmp(mixed[0], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(mixed[1], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(mixed[2], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(mixed[3], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(mixed[4], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(mixed[5], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(mixed[6], [1, 2, 3, 4])\"),\n TestAction::assert(\"cmp(mixed[7], [1, 2, 3, 4])\"),\n // Repeating\n TestAction::assert(\"cmp(repeating[0], [0, 1, 1, 2, 3, 3, 4])\"),\n TestAction::assert(\"cmp(repeating[1], [0, 1, 1, 2, 3, 3, 4])\"),\n TestAction::assert(\"cmp(repeating[2], [0, 1, 1, 2, 3, 3, 4])\"),\n TestAction::assert(\"cmp(repeating[3], [0, 1, 1, 2, 3, 3, 4])\"),\n TestAction::assert(\"cmp(repeating[4], [0, 1, 1, 2, 3, 3, 4])\"),\n TestAction::assert(\"cmp(repeating[5], [0, 1, 1, 2, 3, 3, 4])\"),\n TestAction::assert(\"cmp(repeating[6], [0, 1, 1, 2, 3, 3, 4])\"),\n TestAction::assert(\"cmp(repeating[7], [0, 1, 1, 2, 3, 3, 4])\"),\n ]);\n}\n\n#[test]\nfn sort_negative_zero() {\n run_test_actions([\n TestAction::run(\n r#\"\n // This cmp function is needed as the harness does not support TypedArray comparison.\n function cmp(a, b) {\n return a.length === b.length && a.every((v, i) => v === b[i]);\n }\n\n var TypedArrayCtor = [Float32Array, Float64Array];\n var negativeZero = TypedArrayCtor.map((ctor) => new ctor([1, 0, -0, 2]).sort());\n var infinities = TypedArrayCtor.map((ctor) => new ctor([3, 4, Infinity, -Infinity, 1, 2]).sort());\n \"#,\n ),\n TestAction::assert(\"cmp(negativeZero[0], [-0, 0, 1, 2])\"),\n TestAction::assert(\"cmp(negativeZero[1], [-0, 0, 1, 2])\"),\n TestAction::assert(\"cmp(infinities[0], [-Infinity, 1, 2, 3, 4, Infinity])\"),\n TestAction::assert(\"cmp(infinities[1], [-Infinity, 1, 2, 3, 4, Infinity])\"),\n ]);\n}\n\n/// Tests `SharedArrayBuffer.prototype.slice` which triggers `copy_shared_to_shared`\n/// (the `batched_atomic_copy_forward` path).\n#[test]\nfn shared_array_buffer_slice() {\n run_test_actions([\n TestAction::run(\n r#\"\n var sab = new SharedArrayBuffer(16);\n var view = new Uint8Array(sab);\n for (var i = 0; i < 16; i++) view[i] = i + 1;\n var sliced = sab.slice(0);\n var result = new Uint8Array(sliced);\n \"#,\n ),\n // Verify all 16 bytes copied correctly (exercises u64 batch + head/tail)\n TestAction::assert(\"result[0] === 1\"),\n TestAction::assert(\"result[7] === 8\"),\n TestAction::assert(\"result[15] === 16\"),\n TestAction::assert(\"result.length === 16\"),\n ]);\n}\n\n/// Tests `SharedArrayBuffer.prototype.slice` with a partial range and odd sizes\n/// to exercise alignment edge cases in the batched copy.\n#[test]\nfn shared_array_buffer_slice_partial() {\n run_test_actions([\n TestAction::run(\n r#\"\n var sab = new SharedArrayBuffer(20);\n var view = new Uint8Array(sab);\n for (var i = 0; i < 20; i++) view[i] = i * 3;\n\n // Slice with odd offset and size to hit unaligned head/tail\n var sliced = sab.slice(3, 14);\n var result = new Uint8Array(sliced);\n \"#,\n ),\n TestAction::assert(\"result.length === 11\"),\n TestAction::assert(\"result[0] === 9\"),\n TestAction::assert(\"result[10] === 39\"),\n ]);\n}\n\n/// Tests TypedArray.set from a SharedArrayBuffer-backed array to a regular\n/// ArrayBuffer-backed array, triggering `batched_copy_atomic_to_bytes`.\n#[test]\nfn shared_to_regular_typed_array_set() {\n run_test_actions([\n TestAction::run(\n r#\"\n var sab = new SharedArrayBuffer(16);\n var src = new Uint8Array(sab);\n for (var i = 0; i < 16; i++) src[i] = 100 + i;\n\n var ab = new ArrayBuffer(16);\n var dest = new Uint8Array(ab);\n dest.set(src);\n \"#,\n ),\n TestAction::assert(\"dest[0] === 100\"),\n TestAction::assert(\"dest[7] === 107\"),\n TestAction::assert(\"dest[15] === 115\"),\n ]);\n}\n\n/// Tests TypedArray.set from a regular ArrayBuffer-backed array to a\n/// SharedArrayBuffer-backed array, triggering `batched_copy_bytes_to_atomic`.\n#[test]\nfn regular_to_shared_typed_array_set() {\n run_test_actions([\n TestAction::run(\n r#\"\n var ab = new ArrayBuffer(16);\n var src = new Uint8Array(ab);\n for (var i = 0; i < 16; i++) src[i] = 200 + i;\n\n var sab = new SharedArrayBuffer(16);\n var dest = new Uint8Array(sab);\n dest.set(src);\n \"#,\n ),\n TestAction::assert(\"dest[0] === 200\"),\n TestAction::assert(\"dest[7] === 207\"),\n TestAction::assert(\"dest[15] === 215\"),\n ]);\n}\n\n/// Tests forward `copyWithin` on a SharedArrayBuffer-backed typed array,\n/// triggering `copy_shared_to_shared` via `memmove`.\n#[test]\nfn shared_typed_array_copy_within() {\n run_test_actions([\n TestAction::run(\n r#\"\n var sab = new SharedArrayBuffer(16);\n var arr = new Uint8Array(sab);\n for (var i = 0; i < 16; i++) arr[i] = i + 1;\n\n // Forward copy: copies bytes 4..12 to offset 0\n arr.copyWithin(0, 4, 12);\n \"#,\n ),\n TestAction::assert(\"arr[0] === 5\"),\n TestAction::assert(\"arr[7] === 12\"),\n TestAction::assert(\"arr[8] === 9\"),\n ]);\n}\n\n/// Tests backward `copyWithin` on a SharedArrayBuffer-backed typed array,\n/// triggering `copy_shared_to_shared_backwards` when source and dest overlap.\n#[test]\nfn shared_typed_array_copy_within_backward() {\n run_test_actions([\n TestAction::run(\n r#\"\n var sab = new SharedArrayBuffer(16);\n var arr = new Uint8Array(sab);\n for (var i = 0; i < 16; i++) arr[i] = i + 1;\n\n // Backward copy: copies bytes 0..8 to offset 4 (overlapping)\n arr.copyWithin(4, 0, 8);\n \"#,\n ),\n TestAction::assert(\"arr[0] === 1\"),\n TestAction::assert(\"arr[3] === 4\"),\n TestAction::assert(\"arr[4] === 1\"),\n TestAction::assert(\"arr[11] === 8\"),\n TestAction::assert(\"arr[12] === 13\"),\n ]);\n}\n\n/// Tests zero-length slice to exercise the `count == 0` early return.\n#[test]\nfn shared_array_buffer_slice_empty() {\n run_test_actions([\n TestAction::run(\n r#\"\n var sab = new SharedArrayBuffer(16);\n var view = new Uint8Array(sab);\n for (var i = 0; i < 16; i++) view[i] = i + 1;\n var sliced = sab.slice(5, 5);\n var result = new Uint8Array(sliced);\n \"#,\n ),\n TestAction::assert(\"result.length === 0\"),\n ]);\n}\n" }, { "path": "core/engine/src/builtins/array_buffer/utils.rs", "content": "use std::{ptr, slice::SliceIndex, sync::atomic::Ordering};\n\nuse portable_atomic::{AtomicU8, AtomicU64};\n\nuse crate::{\n Context, JsResult,\n builtins::typed_array::{ClampedU8, Element, TypedArrayElement, TypedArrayKind},\n object::JsObject,\n};\n\nuse super::ArrayBuffer;\n\n#[derive(Clone, Copy)]\npub(crate) enum BytesConstPtr {\n Bytes(*const u8),\n AtomicBytes(*const AtomicU8),\n}\n\nimpl BytesConstPtr {\n /// Offsets this const pointer by a positive amount.\n pub(crate) unsafe fn add(self, count: usize) -> Self {\n // SAFETY: the operation is guaranteed to be safe by the caller.\n unsafe {\n match self {\n Self::Bytes(p) => Self::Bytes(p.add(count)),\n Self::AtomicBytes(p) => Self::AtomicBytes(p.add(count)),\n }\n }\n }\n}\n\n#[derive(Clone, Copy)]\npub(crate) enum BytesMutPtr {\n Bytes(*mut u8),\n AtomicBytes(*const AtomicU8),\n}\n\nimpl BytesMutPtr {\n /// Offsets this mut pointer by a positive amount.\n pub(crate) unsafe fn add(self, count: usize) -> Self {\n // SAFETY: the operation is guaranteed to be safe by the caller.\n unsafe {\n match self {\n Self::Bytes(p) => Self::Bytes(p.add(count)),\n Self::AtomicBytes(p) => Self::AtomicBytes(p.add(count)),\n }\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum SliceRef<'a> {\n Slice(&'a [u8]),\n AtomicSlice(&'a [AtomicU8]),\n}\n\nimpl SliceRef<'_> {\n /// Gets the byte length of this `SliceRef`.\n pub(crate) fn len(&self) -> usize {\n match self {\n Self::Slice(buf) => buf.len(),\n Self::AtomicSlice(buf) => buf.len(),\n }\n }\n\n /// Gets a subslice of this `SliceRef`.\n pub(crate) fn subslice(&self, index: I) -> SliceRef<'_>\n where\n I: SliceIndex<[u8], Output = [u8]> + SliceIndex<[AtomicU8], Output = [AtomicU8]>,\n {\n match self {\n Self::Slice(buffer) => SliceRef::Slice(buffer.get(index).expect(\"index out of bounds\")),\n Self::AtomicSlice(buffer) => {\n SliceRef::AtomicSlice(buffer.get(index).expect(\"index out of bounds\"))\n }\n }\n }\n\n /// Copies the slice into a new `Vec`. For `AtomicSlice`, each byte is loaded with `SeqCst` ordering.\n #[must_use]\n pub(crate) fn to_vec(self) -> Vec {\n match self {\n Self::Slice(s) => s.to_vec(),\n Self::AtomicSlice(s) => {\n let count = s.len();\n let mut target = Vec::with_capacity(count);\n // SAFETY: we only copy `count` bytes, which should be in bounds\n // for both the target buffer and the source atomic slice.\n // `target` also has enough capacity for `count` elements and\n // all its elements are initialized by `memcpy`.\n unsafe {\n memcpy(\n BytesConstPtr::AtomicBytes(s.as_ptr()),\n BytesMutPtr::Bytes(target.as_mut_ptr()),\n count,\n );\n target.set_len(s.len());\n }\n target\n }\n }\n }\n\n /// Gets the starting address of this `SliceRef`.\n #[cfg(debug_assertions)]\n pub(crate) fn addr(&self) -> usize {\n match self {\n Self::Slice(buf) => buf.as_ptr().addr(),\n Self::AtomicSlice(buf) => buf.as_ptr().addr(),\n }\n }\n\n /// Gets a pointer to the underlying slice.\n pub(crate) fn as_ptr(&self) -> BytesConstPtr {\n match self {\n SliceRef::Slice(s) => BytesConstPtr::Bytes(s.as_ptr()),\n SliceRef::AtomicSlice(s) => BytesConstPtr::AtomicBytes(s.as_ptr()),\n }\n }\n\n /// [`GetValueFromBuffer ( arrayBuffer, byteIndex, type, isTypedArray, order [ , isLittleEndian ] )`][spec]\n ///\n /// The start offset is determined by the input buffer instead of a `byteIndex` parameter.\n ///\n /// # Safety\n ///\n /// - There must be enough bytes in `buffer` to read an element from an array with type `TypedArrayKind`.\n /// - `buffer` must be aligned to the alignment of said element.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-getvaluefrombuffer\n pub(crate) unsafe fn get_value(\n &self,\n kind: TypedArrayKind,\n order: Ordering,\n ) -> TypedArrayElement {\n unsafe fn read_elem(buffer: SliceRef<'_>, order: Ordering) -> T {\n // \n\n // 1. Assert: IsDetachedBuffer(arrayBuffer) is false.\n // 2. Assert: There are sufficient bytes in arrayBuffer starting at byteIndex to represent a value of type.\n #[cfg(debug_assertions)]\n {\n assert!(buffer.len() >= size_of::());\n assert_eq!(buffer.addr() % align_of::(), 0);\n }\n\n // 3. Let block be arrayBuffer.[[ArrayBufferData]].\n // 4. Let elementSize be the Element Size value specified in Table 70 for Element Type type.\n // 5. If IsSharedArrayBuffer(arrayBuffer) is true, then\n // a. Let execution be the [[CandidateExecution]] field of the surrounding agent's Agent Record.\n // b. Let eventsRecord be the Agent Events Record of execution.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier().\n // c. If isTypedArray is true and IsNoTearConfiguration(type, order) is true, let noTear be true; otherwise let noTear be false.\n // d. Let rawValue be a List of length elementSize whose elements are nondeterministically chosen byte values.\n // e. NOTE: In implementations, rawValue is the result of a non-atomic or atomic read instruction on the underlying hardware. The nondeterminism is a semantic prescription of the memory model to describe observable behaviour of hardware with weak consistency.\n // f. Let readEvent be ReadSharedMemory { [[Order]]: order, [[NoTear]]: noTear, [[Block]]: block, [[ByteIndex]]: byteIndex, [[ElementSize]]: elementSize }.\n // g. Append readEvent to eventsRecord.[[EventList]].\n // h. Append Chosen Value Record { [[Event]]: readEvent, [[ChosenValue]]: rawValue } to execution.[[ChosenValues]].\n // 6. Else,\n // a. Let rawValue be a List whose elements are bytes from block at indices in the interval from byteIndex (inclusive) to byteIndex + elementSize (exclusive).\n // 7. Assert: The number of elements in rawValue is elementSize.\n // 8. If isLittleEndian is not present, set isLittleEndian to the value of the [[LittleEndian]] field of the surrounding agent's Agent Record.\n // 9. Return RawBytesToNumeric(type, rawValue, isLittleEndian).\n\n // SAFETY: The invariants of this operation are ensured by the caller.\n unsafe { T::read(buffer).load(order) }\n }\n\n let buffer = *self;\n\n // SAFETY: The invariants of this operation are ensured by the caller.\n unsafe {\n match kind {\n TypedArrayKind::Int8 => read_elem::(buffer, order).into(),\n TypedArrayKind::Uint8 => read_elem::(buffer, order).into(),\n TypedArrayKind::Uint8Clamped => read_elem::(buffer, order).into(),\n TypedArrayKind::Int16 => read_elem::(buffer, order).into(),\n TypedArrayKind::Uint16 => read_elem::(buffer, order).into(),\n TypedArrayKind::Int32 => read_elem::(buffer, order).into(),\n TypedArrayKind::Uint32 => read_elem::(buffer, order).into(),\n TypedArrayKind::BigInt64 => read_elem::(buffer, order).into(),\n TypedArrayKind::BigUint64 => read_elem::(buffer, order).into(),\n #[cfg(feature = \"float16\")]\n TypedArrayKind::Float16 => {\n read_elem::(buffer, order).into()\n }\n TypedArrayKind::Float32 => read_elem::(buffer, order).into(),\n TypedArrayKind::Float64 => read_elem::(buffer, order).into(),\n }\n }\n }\n\n /// [`CloneArrayBuffer ( srcBuffer, srcByteOffset, srcLength )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-clonearraybuffer\n pub(crate) fn clone(&self, context: &mut Context) -> JsResult> {\n // 1. Assert: IsDetachedBuffer(srcBuffer) is false.\n\n // 2. Let targetBuffer be ? AllocateArrayBuffer(%ArrayBuffer%, srcLength).\n let target_buffer = ArrayBuffer::allocate(\n &context\n .realm()\n .intrinsics()\n .constructors()\n .array_buffer()\n .constructor()\n .into(),\n self.len() as u64,\n None,\n context,\n )?;\n\n // 3. Let srcBlock be srcBuffer.[[ArrayBufferData]].\n\n // 4. Let targetBlock be targetBuffer.[[ArrayBufferData]].\n {\n let mut target_buffer = target_buffer.borrow_mut();\n let target_block = target_buffer\n .data_mut()\n .bytes_mut()\n .expect(\"ArrayBuffer cannot be detached here\");\n\n // 5. Perform CopyDataBlockBytes(targetBlock, 0, srcBlock, srcByteOffset, srcLength).\n\n // SAFETY: Both buffers are of the same length, `buffer.len()`, which makes this operation\n // safe.\n unsafe {\n memcpy(\n self.as_ptr(),\n BytesMutPtr::Bytes(target_block.as_mut_ptr()),\n self.len(),\n );\n }\n }\n\n // 6. Return targetBuffer.\n Ok(target_buffer)\n }\n}\n\nimpl<'a> From<&'a [u8]> for SliceRef<'a> {\n fn from(value: &'a [u8]) -> Self {\n Self::Slice(value)\n }\n}\n\nimpl<'a> From<&'a [AtomicU8]> for SliceRef<'a> {\n fn from(value: &'a [AtomicU8]) -> Self {\n Self::AtomicSlice(value)\n }\n}\n\n#[derive(Debug)]\npub(crate) enum SliceRefMut<'a> {\n Slice(&'a mut [u8]),\n AtomicSlice(&'a [AtomicU8]),\n}\n\nimpl SliceRefMut<'_> {\n /// Gets the byte length of this `SliceRefMut`.\n pub(crate) fn len(&self) -> usize {\n match self {\n Self::Slice(buf) => buf.len(),\n Self::AtomicSlice(buf) => buf.len(),\n }\n }\n\n /// Gets a subslice of this `SliceRefMut`.\n #[expect(unused, reason = \"could still be useful in the future\")]\n pub(crate) fn subslice(&self, index: I) -> SliceRef<'_>\n where\n I: SliceIndex<[u8], Output = [u8]> + SliceIndex<[AtomicU8], Output = [AtomicU8]>,\n {\n match self {\n Self::Slice(buffer) => SliceRef::Slice(buffer.get(index).expect(\"index out of bounds\")),\n Self::AtomicSlice(buffer) => {\n SliceRef::AtomicSlice(buffer.get(index).expect(\"index out of bounds\"))\n }\n }\n }\n\n /// Gets a mutable subslice of this `SliceRefMut`.\n pub(crate) fn subslice_mut(&mut self, index: I) -> SliceRefMut<'_>\n where\n I: SliceIndex<[u8], Output = [u8]> + SliceIndex<[AtomicU8], Output = [AtomicU8]>,\n {\n match self {\n Self::Slice(buffer) => {\n SliceRefMut::Slice(buffer.get_mut(index).expect(\"index out of bounds\"))\n }\n Self::AtomicSlice(buffer) => {\n SliceRefMut::AtomicSlice(buffer.get(index).expect(\"index out of bounds\"))\n }\n }\n }\n\n /// Gets the starting address of this `SliceRefMut`.\n #[cfg(debug_assertions)]\n pub(crate) fn addr(&self) -> usize {\n match self {\n Self::Slice(buf) => buf.as_ptr().addr(),\n Self::AtomicSlice(buf) => buf.as_ptr().addr(),\n }\n }\n\n /// Gets a pointer to the underlying slice.\n pub(crate) fn as_ptr(&mut self) -> BytesMutPtr {\n match self {\n Self::Slice(s) => BytesMutPtr::Bytes(s.as_mut_ptr()),\n Self::AtomicSlice(s) => BytesMutPtr::AtomicBytes(s.as_ptr()),\n }\n }\n\n /// `25.1.2.12 SetValueInBuffer ( arrayBuffer, byteIndex, type, value, isTypedArray, order [ , isLittleEndian ] )`\n ///\n /// The start offset is determined by the input buffer instead of a `byteIndex` parameter.\n ///\n /// # Safety\n ///\n /// - There must be enough bytes in `buffer` to write the `TypedArrayElement`.\n /// - `buffer` must be aligned to the alignment of the `TypedArrayElement`.\n ///\n /// # Panics\n ///\n /// - Panics if the type of `value` is not equal to the content of `kind`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-setvalueinbuffer\n pub(crate) unsafe fn set_value(&mut self, value: TypedArrayElement, order: Ordering) {\n unsafe fn write_elem(buffer: SliceRefMut<'_>, value: T, order: Ordering) {\n // \n\n // 1. Assert: IsDetachedBuffer(arrayBuffer) is false.\n // 2. Assert: There are sufficient bytes in arrayBuffer starting at byteIndex to represent a value of type.\n // 3. Assert: value is a BigInt if IsBigIntElementType(type) is true; otherwise, value is a Number.\n #[cfg(debug_assertions)]\n {\n assert!(buffer.len() >= size_of::());\n assert_eq!(buffer.addr() % align_of::(), 0);\n }\n\n // 4. Let block be arrayBuffer.[[ArrayBufferData]].\n // 5. Let elementSize be the Element Size value specified in Table 70 for Element Type type.\n // 6. If isLittleEndian is not present, set isLittleEndian to the value of the [[LittleEndian]] field of the surrounding agent's Agent Record.\n // 7. Let rawBytes be NumericToRawBytes(type, value, isLittleEndian).\n // 8. If IsSharedArrayBuffer(arrayBuffer) is true, then\n // a. Let execution be the [[CandidateExecution]] field of the surrounding agent's Agent Record.\n // b. Let eventsRecord be the Agent Events Record of execution.[[EventsRecords]] whose [[AgentSignifier]] is AgentSignifier().\n // c. If isTypedArray is true and IsNoTearConfiguration(type, order) is true, let noTear be true; otherwise let noTear be false.\n // d. Append WriteSharedMemory { [[Order]]: order, [[NoTear]]: noTear, [[Block]]: block, [[ByteIndex]]: byteIndex, [[ElementSize]]: elementSize, [[Payload]]: rawBytes } to eventsRecord.[[EventList]].\n // 9. Else,\n // a. Store the individual bytes of rawBytes into block, starting at block[byteIndex].\n // 10. Return unused.\n\n // SAFETY: The invariants of this operation are ensured by the caller.\n unsafe {\n T::read_mut(buffer).store(value, order);\n }\n }\n\n // Have to rebind in order to remove the outer `&mut` ref.\n let buffer = match self {\n SliceRefMut::Slice(buf) => SliceRefMut::Slice(buf),\n SliceRefMut::AtomicSlice(buf) => SliceRefMut::AtomicSlice(buf),\n };\n\n // SAFETY: The invariants of this operation are ensured by the caller.\n unsafe {\n match value {\n TypedArrayElement::Int8(e) => write_elem(buffer, e, order),\n TypedArrayElement::Uint8(e) => write_elem(buffer, e, order),\n TypedArrayElement::Uint8Clamped(e) => write_elem(buffer, e, order),\n TypedArrayElement::Int16(e) => write_elem(buffer, e, order),\n TypedArrayElement::Uint16(e) => write_elem(buffer, e, order),\n TypedArrayElement::Int32(e) => write_elem(buffer, e, order),\n TypedArrayElement::Uint32(e) => write_elem(buffer, e, order),\n TypedArrayElement::BigInt64(e) => write_elem(buffer, e, order),\n TypedArrayElement::BigUint64(e) => write_elem(buffer, e, order),\n #[cfg(feature = \"float16\")]\n TypedArrayElement::Float16(e) => write_elem(buffer, e, order),\n TypedArrayElement::Float32(e) => write_elem(buffer, e, order),\n TypedArrayElement::Float64(e) => write_elem(buffer, e, order),\n }\n }\n }\n}\n\nimpl<'a> From<&'a mut [u8]> for SliceRefMut<'a> {\n fn from(value: &'a mut [u8]) -> Self {\n Self::Slice(value)\n }\n}\n\nimpl<'a> From<&'a [AtomicU8]> for SliceRefMut<'a> {\n fn from(value: &'a [AtomicU8]) -> Self {\n Self::AtomicSlice(value)\n }\n}\n\nconst BATCH_SIZE: usize = size_of::();\n\n/// Given a pointer address and total byte count, computes the number of\n/// head bytes needed to reach 8-byte alignment, the number of aligned\n/// 8-byte chunks, and the number of remaining tail bytes.\nfn compute_batch_offsets(ptr_addr: usize, count: usize) -> (usize, usize, usize) {\n let misalign = ptr_addr % BATCH_SIZE;\n let head = if misalign == 0 {\n 0\n } else {\n (BATCH_SIZE - misalign).min(count)\n };\n let remaining = count - head;\n let chunks = remaining / BATCH_SIZE;\n let tail = remaining % BATCH_SIZE;\n (head, chunks, tail)\n}\n\n/// Copies `count` bytes forward from `src` to `dest` using `AtomicU64` for aligned\n/// 8-byte chunks when both pointers share the same misalignment, falling back to\n/// byte-by-byte `AtomicU8` copies otherwise.\n///\n/// # Safety\n///\n/// - `src` must be valid for `count` reads of `AtomicU8`.\n/// - `dest` must be valid for `count` writes of `AtomicU8`.\n/// - The memory regions must not overlap.\nunsafe fn batched_atomic_copy_forward(src: *const AtomicU8, dest: *const AtomicU8, count: usize) {\n if count == 0 {\n return;\n }\n\n // Batch only if both pointers have the same misalignment, so that aligning\n // one automatically aligns the other. Otherwise, fall back to byte-by-byte.\n if (src as usize) % BATCH_SIZE != (dest as usize) % BATCH_SIZE {\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..count {\n (*dest.add(i)).store((*src.add(i)).load(Ordering::Relaxed), Ordering::Relaxed);\n }\n }\n return;\n }\n\n let (head, chunks, tail) = compute_batch_offsets(dest as usize, count);\n\n if chunks == 0 {\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..count {\n (*dest.add(i)).store((*src.add(i)).load(Ordering::Relaxed), Ordering::Relaxed);\n }\n }\n return;\n }\n\n // Phase 1: Copy unaligned head bytes until both pointers are 8-byte aligned.\n // SAFETY: ensured by the caller — both pointers are valid for `count` bytes.\n unsafe {\n for i in 0..head {\n (*dest.add(i)).store((*src.add(i)).load(Ordering::Relaxed), Ordering::Relaxed);\n }\n }\n\n // Verify both pointers are now aligned after Phase 1.\n #[cfg(debug_assertions)]\n {\n debug_assert_eq!((dest as usize + head) % BATCH_SIZE, 0);\n debug_assert_eq!((src as usize + head) % BATCH_SIZE, 0);\n }\n\n // Phase 2: Copy aligned 8-byte chunks using AtomicU64 load/store.\n // SAFETY: Both `src + head` and `dest + head` are now 8-byte aligned\n // (same misalignment guaranteed, Phase 1 aligned dest, so src is also aligned).\n // `AtomicU8` is `#[repr(transparent)]` over `u8`, so casting to `AtomicU64`\n // is valid when properly aligned.\n #[allow(clippy::cast_ptr_alignment)]\n unsafe {\n let src_u64 = src.add(head).cast::();\n let dest_u64 = dest.add(head).cast::();\n for i in 0..chunks {\n (*dest_u64.add(i)).store((*src_u64.add(i)).load(Ordering::Relaxed), Ordering::Relaxed);\n }\n }\n\n // Phase 3: Copy remaining tail bytes.\n let tail_start = head + chunks * BATCH_SIZE;\n // SAFETY: ensured by the caller — both pointers are valid for `count` bytes.\n unsafe {\n for i in 0..tail {\n (*dest.add(tail_start + i)).store(\n (*src.add(tail_start + i)).load(Ordering::Relaxed),\n Ordering::Relaxed,\n );\n }\n }\n}\n\n/// Copies `count` bytes backward from `src` to `dest` using `AtomicU64` for aligned\n/// 8-byte chunks when both pointers share the same misalignment, falling back to\n/// byte-by-byte `AtomicU8` copies otherwise.\n///\n/// # Safety\n///\n/// - `src` must be valid for `count` reads of `AtomicU8`.\n/// - `dest` must be valid for `count` writes of `AtomicU8`.\nunsafe fn batched_atomic_copy_backward(src: *const AtomicU8, dest: *const AtomicU8, count: usize) {\n if count == 0 {\n return;\n }\n\n // Batch only if both pointers have the same misalignment.\n if (src as usize) % BATCH_SIZE != (dest as usize) % BATCH_SIZE {\n // SAFETY: ensured by the caller.\n unsafe {\n for i in (0..count).rev() {\n (*dest.add(i)).store((*src.add(i)).load(Ordering::Relaxed), Ordering::Relaxed);\n }\n }\n return;\n }\n\n let (head, chunks, tail) = compute_batch_offsets(dest as usize, count);\n\n if chunks == 0 {\n // SAFETY: ensured by the caller.\n unsafe {\n for i in (0..count).rev() {\n (*dest.add(i)).store((*src.add(i)).load(Ordering::Relaxed), Ordering::Relaxed);\n }\n }\n return;\n }\n\n let tail_start = head + chunks * BATCH_SIZE;\n\n // Phase 1: Copy tail bytes backwards.\n // SAFETY: ensured by the caller — both pointers are valid for `count` bytes.\n unsafe {\n for i in (0..tail).rev() {\n (*dest.add(tail_start + i)).store(\n (*src.add(tail_start + i)).load(Ordering::Relaxed),\n Ordering::Relaxed,\n );\n }\n }\n\n // Verify both pointers are aligned after peeling tail bytes.\n #[cfg(debug_assertions)]\n {\n debug_assert_eq!((dest as usize + tail_start) % BATCH_SIZE, 0);\n debug_assert_eq!((src as usize + tail_start) % BATCH_SIZE, 0);\n }\n\n // Phase 2: Copy aligned 8-byte chunks backwards.\n // SAFETY: Both `src + head` and `dest + head` are 8-byte aligned\n // (same misalignment guaranteed, Phase 1 peeled tail bytes).\n #[allow(clippy::cast_ptr_alignment)]\n unsafe {\n let src_u64 = src.add(head).cast::();\n let dest_u64 = dest.add(head).cast::();\n for i in (0..chunks).rev() {\n (*dest_u64.add(i)).store((*src_u64.add(i)).load(Ordering::Relaxed), Ordering::Relaxed);\n }\n }\n\n // Phase 3: Copy remaining head bytes backwards.\n // SAFETY: ensured by the caller.\n unsafe {\n for i in (0..head).rev() {\n (*dest.add(i)).store((*src.add(i)).load(Ordering::Relaxed), Ordering::Relaxed);\n }\n }\n}\n\n/// Copies `count` bytes from non-atomic `src` to atomic `dest` using `u64`/`AtomicU64`\n/// for aligned 8-byte chunks when both pointers share the same misalignment.\n///\n/// # Safety\n///\n/// - `src` must be valid for `count` reads.\n/// - `dest` must be valid for `count` writes of `AtomicU8`.\n/// - The memory regions must not overlap.\nunsafe fn batched_copy_bytes_to_atomic(src: *const u8, dest: *const AtomicU8, count: usize) {\n if count == 0 {\n return;\n }\n\n // Batch only if both pointers have the same misalignment.\n if (src as usize) % BATCH_SIZE != (dest as usize) % BATCH_SIZE {\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..count {\n (*dest.add(i)).store(*src.add(i), Ordering::Relaxed);\n }\n }\n return;\n }\n\n let (head, chunks, tail) = compute_batch_offsets(dest as usize, count);\n\n if chunks == 0 {\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..count {\n (*dest.add(i)).store(*src.add(i), Ordering::Relaxed);\n }\n }\n return;\n }\n\n // Phase 1: Head bytes until both pointers are 8-byte aligned.\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..head {\n (*dest.add(i)).store(*src.add(i), Ordering::Relaxed);\n }\n }\n\n // Verify both pointers are now aligned after Phase 1.\n #[cfg(debug_assertions)]\n {\n debug_assert_eq!((dest as usize + head) % BATCH_SIZE, 0);\n debug_assert_eq!((src as usize + head) % BATCH_SIZE, 0);\n }\n\n // Phase 2: Aligned 8-byte chunks.\n // SAFETY: Both `src + head` and `dest + head` are 8-byte aligned.\n #[allow(clippy::cast_ptr_alignment)]\n unsafe {\n let src_u64 = src.add(head).cast::();\n let dest_u64 = dest.add(head).cast::();\n for i in 0..chunks {\n (*dest_u64.add(i)).store(ptr::read(src_u64.add(i)), Ordering::Relaxed);\n }\n }\n\n // Phase 3: Tail bytes.\n let tail_start = head + chunks * BATCH_SIZE;\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..tail {\n (*dest.add(tail_start + i)).store(*src.add(tail_start + i), Ordering::Relaxed);\n }\n }\n}\n\n/// Copies `count` bytes from atomic `src` to non-atomic `dest` using `AtomicU64`/`u64`\n/// for aligned 8-byte chunks when both pointers share the same misalignment.\n///\n/// # Safety\n///\n/// - `src` must be valid for `count` reads of `AtomicU8`.\n/// - `dest` must be valid for `count` writes.\n/// - The memory regions must not overlap.\nunsafe fn batched_copy_atomic_to_bytes(src: *const AtomicU8, dest: *mut u8, count: usize) {\n if count == 0 {\n return;\n }\n\n // Batch only if both pointers have the same misalignment.\n if (src as usize) % BATCH_SIZE != (dest as usize) % BATCH_SIZE {\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..count {\n *dest.add(i) = (*src.add(i)).load(Ordering::Relaxed);\n }\n }\n return;\n }\n\n let (head, chunks, tail) = compute_batch_offsets(src as usize, count);\n\n if chunks == 0 {\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..count {\n *dest.add(i) = (*src.add(i)).load(Ordering::Relaxed);\n }\n }\n return;\n }\n\n // Phase 1: Head bytes until both pointers are 8-byte aligned.\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..head {\n *dest.add(i) = (*src.add(i)).load(Ordering::Relaxed);\n }\n }\n\n // Verify both pointers are now aligned after Phase 1.\n #[cfg(debug_assertions)]\n {\n debug_assert_eq!((src as usize + head) % BATCH_SIZE, 0);\n debug_assert_eq!((dest as usize + head) % BATCH_SIZE, 0);\n }\n\n // Phase 2: Aligned 8-byte chunks.\n // SAFETY: Both `src + head` and `dest + head` are 8-byte aligned.\n #[allow(clippy::cast_ptr_alignment)]\n unsafe {\n let src_u64 = src.add(head).cast::();\n let dest_u64 = dest.add(head).cast::();\n for i in 0..chunks {\n ptr::write(dest_u64.add(i), (*src_u64.add(i)).load(Ordering::Relaxed));\n }\n }\n\n // Phase 3: Tail bytes.\n let tail_start = head + chunks * BATCH_SIZE;\n // SAFETY: ensured by the caller.\n unsafe {\n for i in 0..tail {\n *dest.add(tail_start + i) = (*src.add(tail_start + i)).load(Ordering::Relaxed);\n }\n }\n}\n\n/// Copies `count` bytes from `src` into `dest` using atomic relaxed loads and stores.\n///\n/// Uses `AtomicU64` for aligned 8-byte chunks and falls back to `AtomicU8` for\n/// unaligned head/tail bytes.\n///\n/// # Safety\n///\n/// - Both `src` and `dest` must have at least `count` bytes to read and write,\n/// respectively.\npub(super) unsafe fn copy_shared_to_shared(\n src: *const AtomicU8,\n dest: *const AtomicU8,\n count: usize,\n) {\n // SAFETY: The invariants of this operation are ensured by the caller.\n unsafe { batched_atomic_copy_forward(src, dest, count) }\n}\n\n/// Copies `count` bytes backwards from `src` into `dest` using atomic relaxed loads and stores.\n///\n/// Uses `AtomicU64` for aligned 8-byte chunks and falls back to `AtomicU8` for\n/// unaligned head/tail bytes.\n///\n/// # Safety\n///\n/// - Both `src` and `dest` must have at least `count` bytes to read and write,\n/// respectively.\nunsafe fn copy_shared_to_shared_backwards(\n src: *const AtomicU8,\n dest: *const AtomicU8,\n count: usize,\n) {\n // SAFETY: The invariants of this operation are ensured by the caller.\n unsafe { batched_atomic_copy_backward(src, dest, count) }\n}\n\n/// Copies `count` bytes from the buffer `src` into the buffer `dest`, using the atomic ordering\n/// `Ordering::Relaxed` if any of the buffers are atomic.\n///\n/// # Safety\n///\n/// - Both `src` and `dest` must have at least `count` bytes to read and write, respectively.\n/// - The region of memory referenced by `src` must not overlap with the region of memory\n/// referenced by `dest`.\npub(crate) unsafe fn memcpy(src: BytesConstPtr, dest: BytesMutPtr, count: usize) {\n match (src, dest) {\n // SAFETY: The invariants of this operation are ensured by the caller of the function.\n (BytesConstPtr::Bytes(src), BytesMutPtr::Bytes(dest)) => unsafe {\n ptr::copy_nonoverlapping(src, dest, count);\n },\n // SAFETY: The invariants of this operation are ensured by the caller of the function.\n (BytesConstPtr::Bytes(src), BytesMutPtr::AtomicBytes(dest)) => unsafe {\n batched_copy_bytes_to_atomic(src, dest, count);\n },\n // SAFETY: The invariants of this operation are ensured by the caller of the function.\n (BytesConstPtr::AtomicBytes(src), BytesMutPtr::Bytes(dest)) => unsafe {\n batched_copy_atomic_to_bytes(src, dest, count);\n },\n // SAFETY: The invariants of this operation are ensured by the caller of the function.\n (BytesConstPtr::AtomicBytes(src), BytesMutPtr::AtomicBytes(dest)) => unsafe {\n copy_shared_to_shared(src, dest, count);\n },\n }\n}\n\n/// Copies `count` bytes from the position `from` to the position `to` in `buffer`, but always\n/// copying from left to right.\n///\n///\n/// # Safety\n///\n/// - `ptr` must be valid from the offset `ptr + from` for `count` reads of bytes.\n/// - `ptr` must be valid from the offset `ptr + to` for `count` writes of bytes.\n// This looks like a worse version of `memmove`... and it is exactly that...\n// but it's the correct behaviour for a weird usage of `%TypedArray%.prototype.slice` so ¯\\_(ツ)_/¯.\n// Obviously don't use this if you need to implement something that requires a \"proper\" memmove.\npub(crate) unsafe fn memmove_naive(ptr: BytesMutPtr, from: usize, to: usize, count: usize) {\n match ptr {\n // SAFETY: The invariants of this operation are ensured by the caller of the function.\n BytesMutPtr::Bytes(ptr) => unsafe {\n for i in 0..count {\n ptr::copy(ptr.add(from + i), ptr.add(to + i), 1);\n }\n },\n // SAFETY: The invariants of this operation are ensured by the caller of the function.\n BytesMutPtr::AtomicBytes(ptr) => unsafe {\n let src = ptr.add(from);\n let dest = ptr.add(to);\n copy_shared_to_shared(src, dest, count);\n },\n }\n}\n\n/// Copies `count` bytes from the position `from` to the position `to` in `buffer`.\n///\n/// # Safety\n///\n/// - `ptr` must be valid from the offset `ptr + from` for `count` reads of bytes.\n/// - `ptr` must be valid from the offset `ptr + to` for `count` writes of bytes.\npub(crate) unsafe fn memmove(ptr: BytesMutPtr, from: usize, to: usize, count: usize) {\n match ptr {\n // SAFETY: The invariants of this operation are ensured by the caller of the function.\n BytesMutPtr::Bytes(ptr) => unsafe {\n let src = ptr.add(from);\n let dest = ptr.add(to);\n ptr::copy(src, dest, count);\n },\n // SAFETY: The invariants of this operation are ensured by the caller of the function.\n BytesMutPtr::AtomicBytes(ptr) => unsafe {\n let src = ptr.add(from);\n let dest = ptr.add(to);\n // Let's draw a simple array.\n //\n // | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |\n //\n // Now let's define `from`, `to` and `count` such that the below condition is satisfied.\n // `from = 0`\n // `to = 2`\n // `count = 4`\n //\n // We can now imagine that the array is pointed to by our indices:\n //\n // | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |\n // ^ ^\n // from to\n //\n // If we start copying bytes until `from + 2 = to`, we can see that the new array would be:\n //\n // | 0 | 1 | 0 | 1 | 0 | 5 | 6 | 7 | 8 |\n // ^ ^\n // from + 2 to + 2\n //\n // However, we've lost the data that was in the index 2! If this process\n // continues, this'll give the incorrect result:\n //\n // | 0 | 1 | 0 | 1 | 0 | 1 | 6 | 7 | 8 |\n //\n // To solve this, we just need to copy backwards to ensure we never override data that\n // we need in next iterations:\n //\n // | 0 | 1 | 2 | 3 | 4 | 3 | 6 | 7 | 8 |\n // ^ ^\n // from to\n //\n // | 0 | 1 | 2 | 3 | 2 | 3 | 6 | 7 | 8 |\n // ^ ^\n // from to\n //\n // | 0 | 1 | 0 | 1 | 2 | 3 | 6 | 7 | 8 |\n // ^ ^\n // from to\n if src < dest {\n copy_shared_to_shared_backwards(src, dest, count);\n } else {\n copy_shared_to_shared(src, dest, count);\n }\n },\n }\n}\n\n#[cfg(test)]\nmod tests_miri {\n use super::*;\n use portable_atomic::AtomicU8;\n use std::sync::atomic::Ordering;\n\n /// Tests `batched_atomic_copy_forward` with misaligned pointers\n /// (different misalignment) to exercise the byte-by-byte fallback.\n #[test]\n fn batched_forward_misaligned_fallback() {\n let src_data: Vec = (0..32).map(|i| AtomicU8::new(i as u8)).collect();\n let dest_data: Vec = (0..32).map(|_| AtomicU8::new(0)).collect();\n\n // SAFETY: Vec has 32 elements, offset 1 and 2 are within bounds.\n let src = unsafe { src_data.as_ptr().add(1) };\n // SAFETY: Vec has 32 elements, offset 2 is within bounds.\n let dest = unsafe { dest_data.as_ptr().add(2) };\n let count = 20;\n\n // SAFETY: Both pointers are valid for 20 reads/writes (32 - max_offset = 30 >= 20).\n unsafe { batched_atomic_copy_forward(src, dest, count) };\n\n for i in 0..count {\n // SAFETY: `src` is valid for `count` reads starting from its base.\n let expected = unsafe { (*src.add(i)).load(Ordering::Relaxed) };\n // SAFETY: `dest` is valid for `count` reads starting from its base.\n let actual = unsafe { (*dest.add(i)).load(Ordering::Relaxed) };\n assert_eq!(actual, expected, \"mismatch at index {i}\");\n }\n }\n\n /// Tests `batched_atomic_copy_backward` with misaligned pointers.\n #[test]\n fn batched_backward_misaligned_fallback() {\n let src_data: Vec = (0..32).map(|i| AtomicU8::new(i as u8)).collect();\n let dest_data: Vec = (0..32).map(|_| AtomicU8::new(0)).collect();\n\n // SAFETY: Vec has 32 elements, offset 1 is within bounds.\n let src = unsafe { src_data.as_ptr().add(1) };\n // SAFETY: Vec has 32 elements, offset 2 is within bounds.\n let dest = unsafe { dest_data.as_ptr().add(2) };\n let count = 20;\n\n // SAFETY: Both pointers are valid for 20 reads/writes (32 - max_offset = 30 >= 20).\n unsafe { batched_atomic_copy_backward(src, dest, count) };\n\n for i in 0..count {\n // SAFETY: `src` is valid for `count` reads starting from its base.\n let expected = unsafe { (*src.add(i)).load(Ordering::Relaxed) };\n // SAFETY: `dest` is valid for `count` reads starting from its base.\n let actual = unsafe { (*dest.add(i)).load(Ordering::Relaxed) };\n assert_eq!(actual, expected, \"mismatch at index {i}\");\n }\n }\n\n /// Tests `batched_copy_bytes_to_atomic` with misaligned pointers.\n #[test]\n fn batched_bytes_to_atomic_misaligned_fallback() {\n let src_data: Vec = (0..32).map(|i| i as u8).collect();\n let dest_data: Vec = (0..32).map(|_| AtomicU8::new(0)).collect();\n\n // SAFETY: Vec has 32 elements, offset 1 is within bounds.\n let src = unsafe { src_data.as_ptr().add(1) };\n // SAFETY: Vec has 32 elements, offset 2 is within bounds.\n let dest = unsafe { dest_data.as_ptr().add(2) };\n let count = 20;\n\n // SAFETY: Both pointers are valid for 20 reads/writes, regions do not overlap.\n unsafe { batched_copy_bytes_to_atomic(src, dest, count) };\n\n for i in 0..count {\n // SAFETY: `src` is valid for `count` reads starting from its base.\n let expected = unsafe { *src.add(i) };\n // SAFETY: `dest` is valid for `count` reads starting from its base.\n let actual = unsafe { (*dest.add(i)).load(Ordering::Relaxed) };\n assert_eq!(actual, expected, \"mismatch at index {i}\");\n }\n }\n\n /// Tests `batched_copy_atomic_to_bytes` with misaligned pointers.\n #[test]\n fn batched_atomic_to_bytes_misaligned_fallback() {\n let src_data: Vec = (0..32).map(|i| AtomicU8::new(i as u8)).collect();\n let mut dest_data: Vec = vec![0u8; 32];\n\n // SAFETY: Vec has 32 elements, offset 1 is within bounds.\n let src = unsafe { src_data.as_ptr().add(1) };\n // SAFETY: Vec has 32 elements, offset 2 is within bounds.\n let dest = unsafe { dest_data.as_mut_ptr().add(2) };\n let count = 20;\n\n // SAFETY: Both pointers are valid for 20 reads/writes, regions do not overlap.\n unsafe { batched_copy_atomic_to_bytes(src, dest, count) };\n\n for i in 0..count {\n // SAFETY: `src` is valid for `count` reads starting from its base.\n let expected = unsafe { (*src.add(i)).load(Ordering::Relaxed) };\n // SAFETY: `dest` is valid for `count` reads starting from its base.\n let actual = unsafe { *dest.add(i) };\n assert_eq!(actual, expected, \"mismatch at index {i}\");\n }\n }\n}\n" }, { "path": "core/engine/src/builtins/async_function/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `AsyncFunction` object.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-async-function-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/AsyncFunction\n\nuse crate::{\n Context, JsResult, JsString, JsValue,\n builtins::{BuiltInObject, function::BuiltInFunctionObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n};\n\nuse super::{BuiltInBuilder, BuiltInConstructor, IntrinsicObject};\n\n/// The internal representation of an `AsyncFunction` object.\n#[derive(Debug, Clone, Copy)]\npub struct AsyncFunction;\n\nimpl IntrinsicObject for AsyncFunction {\n fn init(realm: &Realm) {\n BuiltInBuilder::from_standard_constructor::(realm)\n .prototype(realm.intrinsics().constructors().function().constructor())\n .inherits(Some(\n realm.intrinsics().constructors().function().prototype(),\n ))\n .property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> crate::object::JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for AsyncFunction {\n const NAME: JsString = StaticJsStrings::ASYNC_FUNCTION;\n}\n\nimpl BuiltInConstructor for AsyncFunction {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 1;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::async_function;\n\n /// `AsyncFunction ( p1, p2, … , pn, body )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-async-function-constructor-arguments\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let active_function = context.active_function_object().unwrap_or_else(|| {\n context\n .intrinsics()\n .constructors()\n .async_function()\n .constructor()\n });\n BuiltInFunctionObject::create_dynamic_function(\n active_function,\n new_target,\n args,\n true,\n false,\n context,\n )\n .map(Into::into)\n }\n}\n" }, { "path": "core/engine/src/builtins/async_generator/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `AsyncGenerator` object.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-asyncgenerator-objects\n\nuse crate::{\n Context, JsArgs, JsData, JsError, JsExpect, JsResult, JsString,\n builtins::{\n Promise,\n generator::GeneratorContext,\n iterable::create_iter_result_object,\n promise::{PromiseCapability, if_abrupt_reject_promise},\n },\n context::intrinsics::Intrinsics,\n error::JsNativeError,\n js_string,\n native_function::NativeFunction,\n object::{CONSTRUCTOR, FunctionObjectBuilder, JsObject},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::JsValue,\n vm::{CompletionRecord, GeneratorResumeKind},\n};\nuse boa_gc::{Finalize, Trace};\nuse std::collections::VecDeque;\n\nuse super::{BuiltInBuilder, IntrinsicObject};\n\n/// Indicates the state of an async generator.\n#[derive(Debug, Clone, Copy, PartialEq)]\npub(crate) enum AsyncGeneratorState {\n SuspendedStart,\n SuspendedYield,\n Executing,\n DrainingQueue,\n Completed,\n}\n\n/// `AsyncGeneratorRequest Records`\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-asyncgeneratorrequest-records\n#[derive(Debug, Clone, Finalize, Trace)]\npub(crate) struct AsyncGeneratorRequest {\n /// The `[[Completion]]` slot.\n pub(crate) completion: CompletionRecord,\n\n /// The `[[Capability]]` slot.\n capability: PromiseCapability,\n}\n\n/// The internal representation of an `AsyncGenerator` object.\n#[derive(Debug, Finalize, Trace, JsData)]\npub struct AsyncGenerator {\n /// The `[[AsyncGeneratorState]]` internal slot.\n #[unsafe_ignore_trace]\n pub(crate) state: AsyncGeneratorState,\n\n /// The `[[AsyncGeneratorContext]]` internal slot.\n pub(crate) context: Option,\n\n /// The `[[AsyncGeneratorQueue]]` internal slot.\n pub(crate) queue: VecDeque,\n}\n\nimpl IntrinsicObject for AsyncGenerator {\n fn init(realm: &Realm) {\n BuiltInBuilder::with_intrinsic::(realm)\n .prototype(\n realm\n .intrinsics()\n .objects()\n .iterator_prototypes()\n .async_iterator(),\n )\n .static_method(Self::next, js_string!(\"next\"), 1)\n .static_method(Self::r#return, js_string!(\"return\"), 1)\n .static_method(Self::throw, js_string!(\"throw\"), 1)\n .static_property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::CONFIGURABLE,\n )\n .static_property(\n CONSTRUCTOR,\n realm\n .intrinsics()\n .constructors()\n .async_generator_function()\n .prototype(),\n Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n intrinsics.objects().async_generator()\n }\n}\n\nimpl AsyncGenerator {\n const NAME: JsString = StaticJsStrings::ASYNC_GENERATOR;\n\n /// `AsyncGenerator.prototype.next ( value )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgenerator-prototype-next\n pub(crate) fn next(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let generator be the this value.\n let generator = this;\n\n // 2. Let promiseCapability be ! NewPromiseCapability(%Promise%).\n let promise_capability = PromiseCapability::new(\n &context.intrinsics().constructors().promise().constructor(),\n context,\n )\n .js_expect(\"cannot fail with promise constructor\")?;\n\n // 3. Let result be Completion(AsyncGeneratorValidate(generator, empty)).\n // 4. IfAbruptRejectPromise(result, promiseCapability).\n let result: JsResult<_> = generator.as_object().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"generator resumed on non generator object\")\n .into()\n });\n let generator = if_abrupt_reject_promise!(result, promise_capability, context);\n let result: JsResult<_> = generator.clone().downcast::().map_err(|_| {\n JsNativeError::typ()\n .with_message(\"generator resumed on non generator object\")\n .into()\n });\n let generator = if_abrupt_reject_promise!(result, promise_capability, context);\n\n // 5. Let state be generator.[[AsyncGeneratorState]].\n let state = generator.borrow().data().state;\n\n // 6. If state is completed, then\n if state == AsyncGeneratorState::Completed {\n // a. Let iteratorResult be CreateIterResultObject(undefined, true).\n let iterator_result = create_iter_result_object(JsValue::undefined(), true, context);\n\n // b. Perform ! Call(promiseCapability.[[Resolve]], undefined, « iteratorResult »).\n promise_capability.resolve().call(\n &JsValue::undefined(),\n &[iterator_result],\n context,\n )?;\n\n // c. Return promiseCapability.[[Promise]].\n return Ok(promise_capability.promise().clone().into());\n }\n\n // 7. Let completion be NormalCompletion(value).\n let completion = CompletionRecord::Normal(args.get_or_undefined(0).clone());\n\n // 8. Perform AsyncGeneratorEnqueue(generator, completion, promiseCapability).\n Self::enqueue(&generator, completion.clone(), promise_capability.clone());\n\n // 9. If state is either suspendedStart or suspendedYield, then\n if state == AsyncGeneratorState::SuspendedStart\n || state == AsyncGeneratorState::SuspendedYield\n {\n // a. Perform AsyncGeneratorResume(generator, completion).\n Self::resume(&generator, completion, context)?;\n }\n\n // 11. Return promiseCapability.[[Promise]].\n Ok(promise_capability.promise().clone().into())\n }\n\n /// `AsyncGenerator.prototype.return ( value )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgenerator-prototype-return\n pub(crate) fn r#return(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let generator be the this value.\n let generator = this;\n\n // 2. Let promiseCapability be ! NewPromiseCapability(%Promise%).\n let promise_capability = PromiseCapability::new(\n &context.intrinsics().constructors().promise().constructor(),\n context,\n )\n .js_expect(\"cannot fail with promise constructor\")?;\n\n // 3. Let result be Completion(AsyncGeneratorValidate(generator, empty)).\n // 4. IfAbruptRejectPromise(result, promiseCapability).\n let result: JsResult<_> = generator.as_object().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"generator resumed on non generator object\")\n .into()\n });\n let generator_object = if_abrupt_reject_promise!(result, promise_capability, context);\n let result: JsResult<_> = generator_object.clone().downcast::().map_err(|_| {\n JsNativeError::typ()\n .with_message(\"generator resumed on non generator object\")\n .into()\n });\n let generator = if_abrupt_reject_promise!(result, promise_capability, context);\n\n // 5. Let completion be Completion Record { [[Type]]: return, [[Value]]: value, [[Target]]: empty }.\n let return_value = args.get_or_undefined(0).clone();\n let completion = CompletionRecord::Return(return_value.clone());\n\n // 6. Perform AsyncGeneratorEnqueue(generator, completion, promiseCapability).\n Self::enqueue(&generator, completion.clone(), promise_capability.clone());\n\n // 7. Let state be generator.[[AsyncGeneratorState]].\n let state = generator.borrow().data().state;\n\n // 8. If state is either suspended-start or completed, then\n if state == AsyncGeneratorState::SuspendedStart || state == AsyncGeneratorState::Completed {\n // a. Set generator.[[AsyncGeneratorState]] to draining-queue.\n generator.borrow_mut().data_mut().state = AsyncGeneratorState::DrainingQueue;\n\n // b. Perform ! AsyncGeneratorAwaitReturn(generator).\n Self::await_return(&generator, return_value, context)?;\n }\n // 9. Else if state is suspended-yield, then\n else if state == AsyncGeneratorState::SuspendedYield {\n // a. Perform AsyncGeneratorResume(generator, completion).\n Self::resume(&generator, completion, context)?;\n }\n // 10. Else,\n // a. Assert: state is either executing or draining-queue.\n\n // 11. Return promiseCapability.[[Promise]].\n Ok(promise_capability.promise().clone().into())\n }\n\n /// `AsyncGenerator.prototype.throw ( exception )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgenerator-prototype-throw\n pub(crate) fn throw(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let generator be the this value.\n let generator = this;\n\n // 2. Let promiseCapability be ! NewPromiseCapability(%Promise%).\n let promise_capability = PromiseCapability::new(\n &context.intrinsics().constructors().promise().constructor(),\n context,\n )\n .js_expect(\"cannot fail with promise constructor\")?;\n\n // 3. Let result be Completion(AsyncGeneratorValidate(generator, empty)).\n // 4. IfAbruptRejectPromise(result, promiseCapability).\n let result: JsResult<_> = generator.as_object().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"generator resumed on non generator object\")\n .into()\n });\n let generator_object = if_abrupt_reject_promise!(result, promise_capability, context);\n let result: JsResult<_> = generator_object.clone().downcast::().map_err(|_| {\n JsNativeError::typ()\n .with_message(\"generator resumed on non generator object\")\n .into()\n });\n let generator = if_abrupt_reject_promise!(result, promise_capability, context);\n let mut r#gen = generator.borrow_mut();\n\n // 5. Let state be generator.[[AsyncGeneratorState]].\n let mut state = r#gen.data().state;\n\n // 6. If state is suspendedStart, then\n if state == AsyncGeneratorState::SuspendedStart {\n // a. Set generator.[[AsyncGeneratorState]] to completed.\n r#gen.data_mut().state = AsyncGeneratorState::Completed;\n r#gen.data_mut().context = None;\n\n // b. Set state to completed.\n state = AsyncGeneratorState::Completed;\n }\n\n drop(r#gen);\n\n // 7. If state is completed, then\n if state == AsyncGeneratorState::Completed {\n // a. Perform ! Call(promiseCapability.[[Reject]], undefined, « exception »).\n promise_capability.reject().call(\n &JsValue::undefined(),\n &[args.get_or_undefined(0).clone()],\n context,\n )?;\n\n // b. Return promiseCapability.[[Promise]].\n return Ok(promise_capability.promise().clone().into());\n }\n\n // 8. Let completion be ThrowCompletion(exception).\n let completion =\n CompletionRecord::Throw(JsError::from_opaque(args.get_or_undefined(0).clone()));\n\n // 9. Perform AsyncGeneratorEnqueue(generator, completion, promiseCapability).\n Self::enqueue(&generator, completion.clone(), promise_capability.clone());\n\n // 10. If state is suspended-yield, then\n if state == AsyncGeneratorState::SuspendedYield {\n // a. Perform AsyncGeneratorResume(generator, completion).\n Self::resume(&generator, completion, context)?;\n }\n\n // 11. Else,\n // a. Assert: state is either executing or draining-queue.\n\n // 12. Return promiseCapability.[[Promise]].\n Ok(promise_capability.promise().clone().into())\n }\n\n /// `AsyncGeneratorEnqueue ( generator, completion, promiseCapability )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgeneratorenqueue\n pub(crate) fn enqueue(\n generator: &JsObject,\n completion: CompletionRecord,\n promise_capability: PromiseCapability,\n ) {\n let mut r#gen = generator.borrow_mut();\n // 1. Let request be AsyncGeneratorRequest { [[Completion]]: completion, [[Capability]]: promiseCapability }.\n let request = AsyncGeneratorRequest {\n completion,\n capability: promise_capability,\n };\n\n // 2. Append request to the end of generator.[[AsyncGeneratorQueue]].\n r#gen.data_mut().queue.push_back(request);\n }\n\n /// `AsyncGeneratorCompleteStep ( generator, completion, done [ , realm ] )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// # Errors\n ///\n /// Returns `EngineError::Panic` if the async generator request queue of `generator` is empty.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgeneratorcompletestep\n pub(crate) fn complete_step(\n generator: &JsObject,\n completion: JsResult,\n done: bool,\n realm: Option,\n context: &mut Context,\n ) -> JsResult<()> {\n // 1. Assert: generator.[[AsyncGeneratorQueue]] is not empty.\n // 2. Let next be the first element of generator.[[AsyncGeneratorQueue]].\n // 3. Remove the first element from generator.[[AsyncGeneratorQueue]].\n let next = generator\n .borrow_mut()\n .data_mut()\n .queue\n .pop_front()\n .js_expect(\"1. Assert: generator.[[AsyncGeneratorQueue]] is not empty.\")?;\n\n // 4. Let promiseCapability be next.[[Capability]].\n let promise_capability = &next.capability;\n\n // 5. Let value be completion.[[Value]].\n match completion {\n // 6. If completion is a throw completion, then\n Err(e) => {\n // a. Perform ! Call(promiseCapability.[[Reject]], undefined, « value »).\n promise_capability.reject().call(\n &JsValue::undefined(),\n &[e.into_opaque(context)?],\n context,\n )?;\n }\n\n // 7. Else,\n Ok(value) => {\n // a. Assert: completion is a normal completion.\n // b. If realm is present, then\n let iterator_result = if let Some(realm) = realm {\n // i. Let oldRealm be the running execution context's Realm.\n // ii. Set the running execution context's Realm to realm.\n let old_realm = context.enter_realm(realm);\n\n // iii. Let iteratorResult be CreateIteratorResultObject(value, done).\n let iterator_result = create_iter_result_object(value, done, context);\n\n // iv. Set the running execution context's Realm to oldRealm.\n context.enter_realm(old_realm);\n\n iterator_result\n } else {\n // c. Else,\n // i. Let iteratorResult be CreateIteratorResultObject(value, done).\n create_iter_result_object(value, done, context)\n };\n\n // d. Perform ! Call(promiseCapability.[[Resolve]], undefined, « iteratorResult »).\n promise_capability.resolve().call(\n &JsValue::undefined(),\n &[iterator_result],\n context,\n )?;\n }\n }\n // 8. Return unused.\n Ok(())\n }\n\n /// `AsyncGeneratorResume ( generator, completion )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// # Errors\n ///\n /// Returns `EngineError::Panic` if `generator` is neither in the `SuspendedStart` nor in the `SuspendedYield` states.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgeneratorresume\n pub(crate) fn resume(\n generator: &JsObject,\n completion: CompletionRecord,\n context: &mut Context,\n ) -> JsResult<()> {\n // 1. Assert: generator.[[AsyncGeneratorState]] is either suspended-start or suspended-yield.\n assert!(matches!(\n generator.borrow().data().state,\n AsyncGeneratorState::SuspendedStart | AsyncGeneratorState::SuspendedYield\n ));\n\n // 2. Let genContext be generator.[[AsyncGeneratorContext]].\n let mut generator_context = generator\n .borrow_mut()\n .data_mut()\n .context\n .take()\n .js_expect(\"generator context cannot be empty here\")?;\n\n // 5. Set generator.[[AsyncGeneratorState]] to executing.\n generator.borrow_mut().data_mut().state = AsyncGeneratorState::Executing;\n\n let (value, resume_kind) = match completion {\n CompletionRecord::Normal(val) => (val, GeneratorResumeKind::Normal),\n CompletionRecord::Return(val) => (val, GeneratorResumeKind::Return),\n CompletionRecord::Throw(err) => (err.into_opaque(context)?, GeneratorResumeKind::Throw),\n };\n\n // 3. Let callerContext be the running execution context.\n // 4. Suspend callerContext.\n // 6. Push genContext onto the execution context stack; genContext is now the running execution context.\n let result = generator_context.resume(Some(value), resume_kind, context);\n\n // 7. Resume the suspended evaluation of genContext using completion as the result of the operation that suspended it. Let result be the Completion Record returned by the resumed computation.\n generator.borrow_mut().data_mut().context = Some(generator_context);\n\n // 8. Assert: result is never an abrupt completion.\n assert!(!result.is_throw_completion());\n\n // 9. Assert: When we return here, genContext has already been removed from the execution context stack and\n // callerContext is the currently running execution context.\n // 10. Return unused.\n Ok(())\n }\n\n /// `AsyncGeneratorAwaitReturn ( generator )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// # Errors\n ///\n /// Returns `EngineError::Panic` if `generator` is not in the `DrainingQueue` state.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgeneratorawaitreturn\n pub(crate) fn await_return(\n generator: &JsObject,\n value: JsValue,\n context: &mut Context,\n ) -> JsResult<()> {\n // 1. Assert: generator.[[AsyncGeneratorState]] is draining-queue.\n assert_eq!(\n generator.borrow().data().state,\n AsyncGeneratorState::DrainingQueue\n );\n\n // 2. Let queue be generator.[[AsyncGeneratorQueue]].\n // 3. Assert: queue is not empty.\n // 4. Let next be the first element of queue.\n // 5. Let completion be Completion(next.[[Completion]]).\n // 6. Assert: completion is a return completion.\n\n // 7. Let promiseCompletion be Completion(PromiseResolve(%Promise%, completion.[[Value]])).\n let promise_completion = Promise::promise_resolve(\n &context.intrinsics().constructors().promise().constructor(),\n value,\n context,\n );\n\n let promise = match promise_completion {\n Ok(value) => value\n .downcast::()\n .ok()\n .js_expect(\"%Promise% constructor must always return a Promise object\")?,\n // 8. If promiseCompletion is an abrupt completion, then\n Err(e) => {\n // a. Perform AsyncGeneratorCompleteStep(generator, promiseCompletion, true).\n Self::complete_step(generator, Err(e), true, None, context)?;\n // b. Perform AsyncGeneratorDrainQueue(generator).\n Self::drain_queue(generator, context)?;\n // c. Return unused.\n return Ok(());\n }\n };\n\n // 9. Assert: promiseCompletion is a normal completion.\n // 10. Let promise be promiseCompletion.[[Value]].\n // 11. Let fulfilledClosure be a new Abstract Closure with parameters (value) that captures generator and performs the following steps when called:\n // 12. Let onFulfilled be CreateBuiltinFunction(fulfilledClosure, 1, \"\", « »).\n let on_fulfilled = FunctionObjectBuilder::new(\n context.realm(),\n NativeFunction::from_copy_closure_with_captures(\n |_this, args, generator, context| {\n // a. Assert: generator.[[AsyncGeneratorState]] is draining-queue.\n assert_eq!(\n generator.borrow().data().state,\n AsyncGeneratorState::DrainingQueue\n );\n\n // b. Let result be NormalCompletion(value).\n let result = Ok(args.get_or_undefined(0).clone());\n\n // c. Perform AsyncGeneratorCompleteStep(generator, result, true).\n Self::complete_step(generator, result, true, None, context)?;\n\n // d. Perform AsyncGeneratorDrainQueue(generator).\n Self::drain_queue(generator, context)?;\n\n // e. Return undefined.\n Ok(JsValue::undefined())\n },\n generator.clone(),\n ),\n )\n .name(js_string!())\n .length(1)\n .build();\n\n // 13. Let rejectedClosure be a new Abstract Closure with parameters (reason) that captures generator and performs the following steps when called:\n // 14. Let onRejected be CreateBuiltinFunction(rejectedClosure, 1, \"\", « »).\n let on_rejected = FunctionObjectBuilder::new(\n context.realm(),\n NativeFunction::from_copy_closure_with_captures(\n |_this, args, generator, context| {\n // a. Assert: generator.[[AsyncGeneratorState]] is draining-queue.\n assert_eq!(\n generator.borrow().data().state,\n AsyncGeneratorState::DrainingQueue\n );\n\n // b. Let result be ThrowCompletion(reason).\n let result = Err(JsError::from_opaque(args.get_or_undefined(0).clone()));\n\n // c. Perform AsyncGeneratorCompleteStep(generator, result, true).\n Self::complete_step(generator, result, true, None, context)?;\n\n // d. Perform AsyncGeneratorDrainQueue(generator).\n Self::drain_queue(generator, context)?;\n\n // e. Return undefined.\n Ok(JsValue::undefined())\n },\n generator.clone(),\n ),\n )\n .name(js_string!())\n .length(1)\n .build();\n\n // 15. Perform PerformPromiseThen(promise, onFulfilled, onRejected).\n Promise::perform_promise_then(\n &promise,\n Some(on_fulfilled),\n Some(on_rejected),\n None,\n context,\n );\n\n // 16. Return unused.\n Ok(())\n }\n\n /// `AsyncGeneratorDrainQueue ( generator )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// # Errors\n ///\n /// Returns `EngineError::Panic` if `generator` is not in the `DrainingQueue` state.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgeneratordrainqueue\n pub(crate) fn drain_queue(\n generator: &JsObject,\n context: &mut Context,\n ) -> JsResult<()> {\n // 1. Assert: generator.[[AsyncGeneratorState]] is draining-queue.\n assert_eq!(\n generator.borrow().data().state,\n AsyncGeneratorState::DrainingQueue\n );\n\n // 2. Let queue be generator.[[AsyncGeneratorQueue]].\n // 3. If queue is empty, then\n if generator.borrow().data().queue.is_empty() {\n // a. Set generator.[[AsyncGeneratorState]] to completed.\n generator.borrow_mut().data_mut().state = AsyncGeneratorState::Completed;\n generator.borrow_mut().data_mut().context = None;\n // b. Return unused.\n return Ok(());\n }\n\n // 4. Let done be false.\n // 5. Repeat, while done is false,\n loop {\n // a. Let next be the first element of queue.\n let next = generator\n .borrow()\n .data()\n .queue\n .front()\n .js_expect(\"must have entry\")?\n .completion\n .clone();\n\n // b. Let completion be Completion(next.[[Completion]]).\n match next {\n // c. If completion is a return completion, then\n CompletionRecord::Return(val) => {\n // i. Perform AsyncGeneratorAwaitReturn(generator).\n Self::await_return(generator, val, context)?;\n\n // ii. Set done to true.\n break;\n }\n // d. Else,\n completion => {\n // i. If completion is a normal completion, then\n // 1. Set completion to NormalCompletion(undefined).\n let completion = completion.consume().map(|_| JsValue::undefined());\n\n // ii. Perform AsyncGeneratorCompleteStep(generator, completion, true).\n Self::complete_step(generator, completion, true, None, context)?;\n\n // iii. If queue is empty, then\n if generator.borrow().data().queue.is_empty() {\n // 1. Set generator.[[AsyncGeneratorState]] to completed.\n generator.borrow_mut().data_mut().state = AsyncGeneratorState::Completed;\n generator.borrow_mut().data_mut().context = None;\n // 2. Set done to true.\n break;\n }\n }\n }\n }\n\n // 6. Return unused.\n Ok(())\n }\n}\n" }, { "path": "core/engine/src/builtins/async_generator_function/mod.rs", "content": "//! Boa's implementation of ECMAScript's `AsyncGeneratorFunction` object.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-asyncgeneratorfunction-objects\n\nuse crate::{\n Context, JsResult, JsString,\n builtins::{BuiltInObject, function::BuiltInFunctionObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n object::{JsObject, PROTOTYPE},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::JsValue,\n};\n\nuse super::{BuiltInBuilder, BuiltInConstructor, IntrinsicObject};\n\n/// The internal representation of an `AsyncGeneratorFunction` object.\n#[derive(Debug, Clone, Copy)]\npub struct AsyncGeneratorFunction;\n\nimpl IntrinsicObject for AsyncGeneratorFunction {\n fn init(realm: &Realm) {\n BuiltInBuilder::from_standard_constructor::(realm)\n .inherits(Some(\n realm.intrinsics().constructors().function().prototype(),\n ))\n .constructor_attributes(Attribute::CONFIGURABLE)\n .property(\n PROTOTYPE,\n realm.intrinsics().objects().async_generator(),\n Attribute::CONFIGURABLE,\n )\n .property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for AsyncGeneratorFunction {\n const NAME: JsString = StaticJsStrings::ASYNC_GENERATOR_FUNCTION;\n}\n\nimpl BuiltInConstructor for AsyncGeneratorFunction {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::async_generator_function;\n\n /// `AsyncGeneratorFunction ( p1, p2, … , pn, body )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-asyncgeneratorfunction\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let active_function = context.active_function_object().unwrap_or_else(|| {\n context\n .intrinsics()\n .constructors()\n .generator_function()\n .constructor()\n });\n BuiltInFunctionObject::create_dynamic_function(\n active_function,\n new_target,\n args,\n true,\n true,\n context,\n )\n .map(Into::into)\n }\n}\n" }, { "path": "core/engine/src/builtins/atomics/futex.rs", "content": "// TODO: track https://github.com/rust-lang/rfcs/pull/3467 to see if we can use `UnsafeAliased` instead\n// of raw pointers.\n\n// A bit of context about how exactly this thing works.\n//\n// `Atomics.wait/notify` is basically an emulation of the \"futex\" syscall, which internally uses\n// a wait queue attached to a certain memory address, where processes and threads can manipulate\n// it to synchronize between them.\n// More information: https://en.wikipedia.org/wiki/Futex\n//\n// Our emulation of the API is composed by three components:\n//\n// - `FutexWaiters`, which is a map of addresses to the corresponding wait queue for that address.\n// Internally uses intrusive linked lists to avoid allocating when adding a new waiter, which\n// reduces the time spent by a thread in the critical section.\n//\n// - `FutexWaiter`, which contains all the data necessary to be able to wake a waiter from another\n// thread. If `FutexWaiter` is part of a linked list, it has not been woken up. Otherwise,\n// it has been woken up by a call to `notify`. This is checked after waking up to see\n// if the waiter was indeed woken up or if it just sporadically woke up, which can happen\n// while waiting on a `CondVar`.\n//\n// - `CRITICAL_SECTION`, a global static that must be locked before registering or notifying any\n// waiter. This guarantees that only one agent can write to the wait queues at any point in time.\n//\n// We can emulate a typical execution using the API for demonstration purposes.\n// At the start of the program, we initially have an empty map of wait queues. We represent this\n// graphically as:\n//\n// Address │\n// │\n// ────────────┼────────────────────────────────────────────────────────────────────\n// │\n// │\n// │\n// │\n// │\n//\n// Each row here will represent an address and the corresponding wait queue for that address.\n//\n// Let's suppose that \"Thread 2\" wants to wait on the address 50. After locking the global mutex,\n// it first creates a new instante of a `FutexWaiter` and passes a pointer to it to the\n// `FutexWaiters::add_waiter`:\n//\n// Address │\n// │\n// ────────────┼──────────────────────────────────────────────────────────────────────\n// │\n// │ ┌───────────────┐\n// │ ┌─►│ │\n// │ │ │ Thread 2 │\n// │ │ │ FutexWaiter │\n// 50 ├────┘ │ │\n// │ │ │\n// │ │ cond_var │\n// │ │ │\n// │ │ │\n// │ └───────────────┘\n// │\n//\n// Immediately after this, \"Thread 2\" calls `cond_var.wait`, unlocks the global mutex and sleeps\n// until it is notified again (ignoring the spurious wakeups, those are handled in an infinite loop\n// anyways).\n//\n// Now, let's suppose that `Thread 1` has now acquired the lock and now wants to also\n// wait on the address `50`. Doing the same procedure as \"Thread 2\", our map now looks like:\n//\n// Address │\n// │\n// ────────────┼──────────────────────────────────────────────────────────────────────\n// │\n// │ ┌───────────────┐ ┌───────────────┐\n// │ ┌─►│ ├───────►│ │\n// │ │ │ Thread 2 │ │ Thread 1 │\n// │ │ │ FutexWaiter │ │ FutexWaiter │\n// 50 ├────┘ │ │ │ │\n// │ │ │ │ │\n// │ │ cond_var │ │ cond_var │\n// │ │ │◄───────┤ │\n// │ │ │ │ │\n// │ └───────────────┘ └───────────────┘\n// │\n//\n// Note how the head of our list contains the first waiter which was registered, and the\n// tail of our list is our most recent waiter.\n//\n// After \"Thread 1\" sleeps, \"Thread 3\" has the opportunity to lock the global mutex.\n// In this case, \"Thread 3\" will notify one waiter of the address 50 using the `cond_var` inside\n// `FutexWaiter`, and will also remove it from the linked list. In this case\n// the notified thread is \"Thread 2\":\n//\n// Address │\n// │\n// ────────────┼──────────────────────────────────────────────────────────────────────\n// │\n// │ ┌────────────────┐ ┌────────────────┐\n// │ │ │ ┌──►│ │\n// │ │ Thread 2 │ │ │ Thread 1 │\n// │ │ FutexWaiter │ │ │ FutexWaiter │\n// 50 ├───┐ │ │ │ │ │\n// │ │ │ │ │ │ │\n// │ │ │ cond_var │ │ │ cond_var │\n// │ │ │ │ │ │ │\n// │ │ │ │ │ │ │\n// │ │ └────────────────┘ │ └────────────────┘\n// │ │ │\n// │ └────────────────────────┘\n// │\n//\n// Then, when the lock is released and \"Thread 2\" has woken up, it tries to lock the global mutex\n// again, checking if it is still part of the linked list, or manually remove itself from the queue\n// if that's not the case.\n// In this case \"Thread 2\" has already been notified, which doesn't require any other handling, so it just\n// removes the `FutexWaiter` from its stack and returns `AtomicsWaitResult::Ok`.\n//\n// Address │\n// │\n// ────────────┼──────────────────────────────────────────────────────────────────────\n// │\n// │ ┌────────────────┐\n// │ ┌──────────────────────────►│ │\n// │ │ │ Thread 1 │\n// │ │ │ FutexWaiter │\n// 50 ├────┘ │ │\n// │ │ │\n// │ │ cond_var │\n// │ │ waiting: true │\n// │ │ │\n// │ └────────────────┘\n// │\n// │\n// │\n//\n// In a future point in time, \"Thread 1\" will be notified, which will proceed with the\n// exact same steps as \"Thread 2\", emptying the wait queue and finishing the execution of our\n// program.\n\n#![deny(unsafe_op_in_unsafe_fn)]\n#![deny(clippy::undocumented_unsafe_blocks)]\n#![allow(clippy::expl_impl_clone_on_copy)]\n\nuse std::{\n cell::Cell,\n fmt, ptr,\n sync::{Arc, atomic::Ordering},\n};\n\nuse crate::{\n Context, JsNativeError, JsResult, JsValue,\n builtins::{\n array_buffer::{SharedArrayBuffer, utils::SliceRef},\n promise::ResolvingFunctions,\n typed_array::Element,\n },\n job::{NativeAsyncJob, TimeoutJob},\n js_string,\n sys::time::{Duration, Instant},\n};\n\nuse std::sync::{Condvar, Mutex, MutexGuard};\n\nuse boa_string::JsString;\nuse intrusive_collections::{LinkedList, LinkedListLink, UnsafeRef, intrusive_adapter};\nuse small_btree::{Entry, SmallBTreeMap};\n\n/// The result of the [`wait`] and [`wait_async`] functions.\n#[derive(Debug, Clone, Copy)]\npub(super) enum AtomicsWaitResult {\n NotEqual,\n TimedOut,\n Ok,\n}\n\nimpl AtomicsWaitResult {\n pub(super) fn to_js_string(self) -> JsString {\n match self {\n AtomicsWaitResult::NotEqual => js_string!(\"not-equal\"),\n AtomicsWaitResult::TimedOut => js_string!(\"timed-out\"),\n AtomicsWaitResult::Ok => js_string!(\"ok\"),\n }\n }\n}\n\n/// Data used by async waiters.\n#[derive(Debug)]\nstruct AsyncWaiterData {\n // Only here to ensure the buffer does not get collected before all its\n // waiters.\n _buffer: SharedArrayBuffer,\n // Channel to signals the waiter that it has been timed out or notified.\n sender: oneshot::Sender,\n}\n\n/// A waiter for a memory address.\nstruct FutexWaiter {\n link: LinkedListLink,\n cond_var: Condvar,\n addr: usize,\n async_data: Cell>,\n}\n\nimpl fmt::Debug for FutexWaiter {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n f.debug_struct(\"FutexWaiter\")\n .field(\"link\", &self.link)\n .field(\"cond_var\", &self.cond_var)\n .field(\"addr\", &self.addr)\n .finish_non_exhaustive()\n }\n}\n\nintrusive_adapter!(FutexWaiterAdapter = UnsafeRef: FutexWaiter { link => LinkedListLink });\n\nimpl FutexWaiter {\n /// Creates a new `FutexWaiter` that will block the current thread while waiting.\n fn new_sync(addr: usize) -> Self {\n Self {\n link: LinkedListLink::new(),\n cond_var: Condvar::new(),\n addr,\n async_data: Cell::new(None),\n }\n }\n\n /// Creates a new `FutexWaiter` that will NOT block the current thread while waiting.\n #[allow(\n clippy::arc_with_non_send_sync,\n reason = \"across threads we only access the fields that are `Sync`\"\n )]\n fn new_async(data: AsyncWaiterData, addr: usize) -> Arc {\n Arc::new(Self {\n link: LinkedListLink::new(),\n cond_var: Condvar::new(),\n addr,\n async_data: Cell::new(Some(data)),\n })\n }\n}\n\n/// List of memory addresses and its corresponding list of waiters for that address.\nstruct FutexWaiters {\n waiters: SmallBTreeMap, 16>,\n}\n\n// SAFETY: `FutexWaiters` is not constructable outside its `get` method, and it's only exposed by\n// a global lock, meaning the inner data of `FutexWaiters` (which includes non-Send pointers)\n// can only be accessed by a single thread at once.\nunsafe impl Send for FutexWaiters {}\n\nimpl FutexWaiters {\n /// Gets the map of all shared data addresses and its corresponding list of agents waiting on that location.\n fn get() -> JsResult> {\n static CRITICAL_SECTION: Mutex = Mutex::new(FutexWaiters {\n waiters: SmallBTreeMap::new(),\n });\n\n CRITICAL_SECTION.lock().map_err(|_| {\n JsNativeError::typ()\n .with_message(\"failed to synchronize with the agent cluster\")\n .into()\n })\n }\n\n /// # Safety\n ///\n /// - `node` must NOT be linked to an existing waiter list.\n /// - `node` must always reference a valid instance of `FutexWaiter` until `node` is\n /// removed from its linked list. This can happen by either `remove_waiter` or `notify_many`.\n unsafe fn add_waiter(&mut self, node: &FutexWaiter) {\n // SAFETY: `node` must point to a valid instance.\n let node = unsafe { UnsafeRef::from_raw(ptr::from_ref(node)) };\n\n self.waiters\n .entry(node.addr)\n .or_insert_with(|| LinkedList::new(FutexWaiterAdapter::new()))\n .push_back(node);\n }\n\n /// # Safety\n ///\n /// - `node` must NOT be linked to an existing waiter list.\n unsafe fn add_async_waiter(&mut self, node: Arc) {\n // SAFETY: `node` is not linked by the guarantees of the caller.\n let node = unsafe { UnsafeRef::from_raw(Arc::into_raw(node)) };\n\n self.waiters\n .entry(node.addr)\n .or_insert_with(|| LinkedList::new(FutexWaiterAdapter::new()))\n .push_back(node);\n }\n\n /// Notifies at most `max_count` waiters that are waiting on the address `addr`, and\n /// returns the number of waiters that were notified.\n ///\n /// Equivalent to [`RemoveWaiters`][remove] and [`NotifyWaiter`][notify], but in a single operation.\n ///\n /// [remove]: https://tc39.es/ecma262/#sec-removewaiters\n /// [notify]: https://tc39.es/ecma262/#sec-notifywaiter\n fn notify_many(&mut self, addr: usize, max_count: u64) -> u64 {\n let Entry::Occupied(mut wl) = self.waiters.entry(addr) else {\n return 0;\n };\n\n for i in 0..max_count {\n let Some(elem) = wl.get_mut().pop_front() else {\n wl.remove();\n return i;\n };\n\n elem.cond_var.notify_one();\n\n if let Some(async_data) = elem.async_data.take() {\n // SAFETY: All entries on the waiter list must be valid, and all async entries\n // must come from an Arc.\n unsafe { Arc::from_raw(UnsafeRef::into_raw(elem)) };\n // - If the async waiter is still awaiting, this should never fail.\n // - If the async waiter was dropped, the channel is now closed.\n // We don't need to handle the error since this can only happen\n // if the async waiter task was dropped, and at that point the\n // message won't even matter.\n drop(async_data.sender.send(AtomicsWaitResult::Ok));\n }\n }\n\n if wl.get().is_empty() {\n wl.remove();\n }\n\n max_count\n }\n\n /// # Safety\n ///\n /// - `node` must point to a valid instance of `FutexWaiter`.\n /// - `node` must be inside the wait list associated with `node.addr`.\n #[track_caller]\n pub(super) unsafe fn remove_waiter(&mut self, node: &FutexWaiter) {\n debug_assert!(node.link.is_linked());\n\n let Entry::Occupied(mut wl) = self.waiters.entry(node.addr) else {\n panic!(\"node was not a valid `FutexWaiter`\");\n };\n\n // SAFETY: `node` must be inside the wait list associated with `node.addr`.\n let node = unsafe {\n let Some(node) = wl\n .get_mut()\n .cursor_mut_from_ptr(ptr::from_ref(node))\n .remove()\n else {\n panic!(\"node was not a valid `FutexWaiter`\")\n };\n node\n };\n\n if let Some(async_data) = node.async_data.take() {\n // SAFETY: all async entries must be managed by an Arc.\n unsafe {\n Arc::from_raw(UnsafeRef::into_raw(node));\n }\n // - If the async waiter is still awaiting, this should never fail.\n // - If the async waiter was dropped, the channel is now closed.\n // We don't need to handle the error since this can only happen\n // if the async waiter task was dropped, and at that point the\n // message won't even matter.\n drop(async_data.sender.send(AtomicsWaitResult::TimedOut));\n }\n\n if wl.get().is_empty() {\n wl.remove();\n }\n }\n}\n\n/// Adds this agent to the wait queue for the address pointed to by `buffer[offset..]`.\n///\n/// # Safety\n///\n/// - `addr` must be a multiple of `std::mem::size_of::()`.\n/// - `buffer` must contain at least `std::mem::size_of::()` bytes to read starting from `usize`.\n// our implementation guarantees that `SharedArrayBuffer` is always aligned to `u64` at minimum.\npub(super) unsafe fn wait(\n buffer: &SharedArrayBuffer,\n buf_len: usize,\n offset: usize,\n check: E,\n timeout: Option,\n) -> JsResult {\n // 11. Let block be buffer.[[ArrayBufferData]].\n // 12. Let offset be typedArray.[[ByteOffset]].\n // 13. Let byteIndexInBuffer be (i × 4) + offset.\n let buffer = &buffer.bytes_with_len(buf_len)[offset..];\n\n // 14. Let WL be GetWaiterList(block, indexedPosition).\n // 18. Perform EnterCriticalSection(WL).\n let mut waiters = FutexWaiters::get()?;\n\n // 13. Let elementType be TypedArrayElementType(typedArray).\n // 14. Let w be GetValueFromBuffer(buffer, indexedPosition, elementType, true, SeqCst).\n\n // SAFETY: The safety of this operation is guaranteed by the caller.\n let value = unsafe { E::read(SliceRef::AtomicSlice(buffer)).load(Ordering::SeqCst) };\n\n // 20. If v ≠ w, then\n // a. Perform LeaveCriticalSection(WL).\n // b. If mode is sync, return \"not-equal\".\n if check != value {\n return Ok(AtomicsWaitResult::NotEqual);\n }\n\n // 23. Let now be the time value (UTC) identifying the current time.\n // 24. Let additionalTimeout be an implementation-defined non-negative mathematical value.\n // 25. Let timeoutTime be ℝ(now) + t + additionalTimeout.\n // 26. NOTE: When t is +∞, timeoutTime is also +∞.\n let timeout_time = timeout.map(|to| (Instant::now(), to));\n\n // 27. Let waiterRecord be a new Waiter Record { [[AgentSignifier]]: thisAgent, [[PromiseCapability]]: promiseCapability, [[TimeoutTime]]: timeoutTime, [[Result]]: \"ok\" }.\n // ensure we can have aliased pointers to the waiter in a sound way.\n let waiter = FutexWaiter::new_sync(buffer.as_ptr().addr());\n\n // 28. Perform AddWaiter(WL, waiterRecord).\n // SAFETY: waiter is valid and we call `remove_waiter` below.\n unsafe {\n waiters.add_waiter(&waiter);\n }\n\n // 18. Let notified be SuspendAgent(WL, W, t).\n\n // `SuspendAgent(WL, W, t)`\n // https://tc39.es/ecma262/#sec-suspendthisagent\n\n // In a couple of places here we early return without removing the waiter from\n // the waiters list. This could seem unsound, but in reality all our early\n // returns are because the mutex is poisoned, and if that's the case then\n // no other thread can read the pointer to the waiter, so we can return safely.\n let result = loop {\n if !waiter.link.is_linked() {\n break AtomicsWaitResult::Ok;\n }\n\n if let Some((start, timeout)) = timeout_time {\n let Some(remaining) = timeout.checked_sub(start.elapsed()) else {\n break AtomicsWaitResult::TimedOut;\n };\n\n // This doesn't use `wait_timeout_while` because it has to mutably borrow `waiter`,\n // which is a big nono since we have pointers to that location while the borrow is\n // active.\n waiters = waiter\n .cond_var\n .wait_timeout(waiters, remaining)\n .map_err(|_| {\n JsNativeError::typ()\n .with_message(\"failed to synchronize with the agent cluster\")\n })?\n .0;\n } else {\n waiters = waiter.cond_var.wait(waiters).map_err(|_| {\n JsNativeError::typ().with_message(\"failed to synchronize with the agent cluster\")\n })?;\n }\n };\n\n // 19. If notified is true, then\n // a. Assert: W is not on the list of waiters in WL.\n // 20. Else,\n // a. Perform RemoveWaiter(WL, W).\n if waiter.link.is_linked() {\n // SAFETY: waiter is valid and contained in its waiter list if it is still linked.\n unsafe {\n waiters.remove_waiter(&waiter);\n }\n }\n\n // 21. Perform LeaveCriticalSection(WL).\n drop(waiters);\n\n // 22. If notified is true, return \"ok\".\n // 23. Return \"timed-out\".\n Ok(result)\n}\n\n/// Adds this agent to the wait queue for the address pointed to by `buffer[offset..]`,\n/// without blocking the execution thread.\n///\n/// # Safety\n///\n/// - `addr` must be a multiple of `std::mem::size_of::()`.\n/// - `buffer` must contain at least `std::mem::size_of::()` bytes to read starting from `usize`.\n// our implementation guarantees that `SharedArrayBuffer` is always aligned to `u64` at minimum.\npub(super) unsafe fn wait_async(\n buffer: &SharedArrayBuffer,\n buf_len: usize,\n offset: usize,\n check: E,\n timeout: Option,\n functions: ResolvingFunctions,\n context: &mut Context,\n) -> JsResult {\n // 11. Let block be buffer.[[ArrayBufferData]].\n // 12. Let offset be typedArray.[[ByteOffset]].\n // 13. Let byteIndexInBuffer be (i × 4) + offset.\n let buf = &buffer.bytes_with_len(buf_len)[offset..];\n\n // 14. Let WL be GetWaiterList(block, indexedPosition).\n // 17. Perform EnterCriticalSection(WL).\n let mut waiters = FutexWaiters::get()?;\n\n // 18. Let elementType be TypedArrayElementType(typedArray).\n // 19. Let w be GetValueFromBuffer(buffer, indexedPosition, elementType, true, SeqCst).\n // SAFETY: The safety of this operation is guaranteed by the caller.\n let value = unsafe { E::read(SliceRef::AtomicSlice(buf)).load(Ordering::SeqCst) };\n\n // 20. If v ≠ w, then\n // a. Perform LeaveCriticalSection(WL).\n // b. If mode is sync, return \"not-equal\".\n if check != value {\n return Ok(AtomicsWaitResult::NotEqual);\n }\n\n // 21. If t = 0 and mode is async, then\n // a. NOTE: There is no special handling of synchronous immediate timeouts. Asynchronous immediate\n // timeouts have special handling in order to fail fast and avoid unnecessary Promise jobs.\n // b. Perform LeaveCriticalSection(WL).\n if let Some(timeout) = &timeout\n && timeout.is_zero()\n {\n return Ok(AtomicsWaitResult::TimedOut);\n }\n\n // 23. Let now be the time value (UTC) identifying the current time.\n // 24. Let additionalTimeout be an implementation-defined non-negative mathematical value.\n // 25. Let timeoutTime be ℝ(now) + t + additionalTimeout.\n // 26. NOTE: When t is +∞, timeoutTime is also +∞.\n let (sender, receiver) = oneshot::async_channel();\n\n // 27. Let waiterRecord be a new Waiter Record { [[AgentSignifier]]: thisAgent,\n // [[PromiseCapability]]: promiseCapability, [[TimeoutTime]]: timeoutTime, [[Result]]: \"ok\"}.\n // ensure we can have aliased pointers to the waiter in a sound way.\n let waiter = FutexWaiter::new_async(\n AsyncWaiterData {\n _buffer: buffer.clone(),\n sender,\n },\n buf.as_ptr().addr(),\n );\n let weak_waiter = Arc::downgrade(&waiter);\n\n // 28. Perform AddWaiter(WL, waiterRecord).\n // SAFETY: `waiter` is pinned to the heap, so it must be valid.\n unsafe {\n waiters.add_async_waiter(waiter.clone());\n }\n\n // 30. Else if timeoutTime is finite, then\n // a. Perform EnqueueAtomicsWaitAsyncTimeoutJob(WL, waiterRecord).\n let timeout_cancel = if let Some(timeout) = timeout {\n // EnqueueAtomicsWaitAsyncTimeoutJob ( WL, waiterRecord )\n // https://tc39.es/ecma262/#sec-enqueueatomicswaitasynctimeoutjob\n\n // 1. Let timeoutJob be a new Job Abstract Closure with no parameters that captures WL and waiterRecord and performs the following steps when called:\n let job = TimeoutJob::with_realm(\n move |_| {\n // a. Perform EnterCriticalSection(WL).\n let mut waiters = FutexWaiters::get()?;\n\n // b. If WL.[[Waiters]] contains waiterRecord, then\n if let Some(waiter) = weak_waiter.upgrade()\n && waiter.link.is_linked()\n {\n // i. Let timeOfJobExecution be the time value (UTC) identifying the current time.\n // ii. Assert: ℝ(timeOfJobExecution) ≥ waiterRecord.[[TimeoutTime]] (ignoring potential non-monotonicity of time values).\n // iii. Set waiterRecord.[[Result]] to \"timed-out\".\n // SAFETY: the node is linked and still valid thanks to the reference count.\n unsafe {\n // iv. Perform RemoveWaiter(WL, waiterRecord).\n waiters.remove_waiter(&waiter);\n }\n }\n\n // c. Perform LeaveCriticalSection(WL).\n // d. Return unused.\n Ok(JsValue::undefined())\n },\n // 3. Let currentRealm be the current Realm Record.\n context.realm().clone(),\n // 2. Let now be the time value (UTC) identifying the current time.\n timeout,\n );\n\n let tc = job.cancelled_flag();\n\n // 4. Perform HostEnqueueTimeoutJob(timeoutJob, currentRealm, 𝔽(waiterRecord.[[TimeoutTime]]) - now).\n context.enqueue_job(job.into());\n\n // 5. Return unused.\n Some(tc)\n } else {\n None\n };\n\n context.enqueue_job(\n NativeAsyncJob::new(async move |context| {\n if let Ok(result) = receiver.await {\n // v. Perform NotifyWaiter(WL, waiterRecord).\n functions\n .resolve\n .call(\n &JsValue::undefined(),\n &[result.to_js_string().into()],\n &mut context.borrow_mut(),\n )\n .expect(\"default resolving functions cannot error\");\n } else {\n // The \"else\" branch can only happen if the channel was dropped in both\n // the timeout job and the whole waiters map, which is only possible if\n // we panicked. We just GIGO then, since it doesn't make sense to\n // resolve a promise in a thread that is panicking.\n }\n\n if let Some(flag) = timeout_cancel {\n flag.set();\n }\n\n Ok(JsValue::undefined())\n })\n .into(),\n );\n\n Ok(AtomicsWaitResult::Ok)\n}\n\n/// Notifies at most `count` agents waiting on the memory address pointed to by `buffer[offset..]`.\npub(super) fn notify(buffer: &SharedArrayBuffer, offset: usize, count: u64) -> JsResult {\n let addr = buffer.as_ptr().addr() + offset;\n\n // 7. Let WL be GetWaiterList(block, indexedPosition).\n // 8. Perform EnterCriticalSection(WL).\n let mut waiters = FutexWaiters::get()?;\n\n // 9. Let S be RemoveWaiters(WL, c).\n // 10. For each element W of S, do\n // a. Perform NotifyWaiter(WL, W).\n let count = waiters.notify_many(addr, count);\n\n // 11. Perform LeaveCriticalSection(WL).\n drop(waiters);\n\n Ok(count)\n}\n" }, { "path": "core/engine/src/builtins/atomics/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `Atomics` object.\n//!\n//! The `Atomics` object contains synchronization methods to orchestrate multithreading\n//! on contexts that live in separate threads.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-atomics-object\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Atomics\n\nmod futex;\n\nuse std::sync::atomic::Ordering;\n\nuse crate::{\n Context, JsArgs, JsNativeError, JsResult, JsString, JsValue,\n builtins::{BuiltInObject, OrdinaryObject},\n context::intrinsics::Intrinsics,\n js_string,\n object::{JsObject, JsPromise},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n sys::time::Duration,\n value::IntegerOrInfinity,\n};\n\nuse super::{\n BuiltInBuilder, IntrinsicObject,\n array_buffer::{BufferObject, BufferRef},\n typed_array::{Atomic, ContentType, Element, TypedArray, TypedArrayElement, TypedArrayKind},\n};\n\n/// Javascript `Atomics` object.\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\npub(crate) struct Atomics;\n\nimpl IntrinsicObject for Atomics {\n fn init(realm: &Realm) {\n let builder = BuiltInBuilder::with_intrinsic::(realm)\n .static_property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::READONLY | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .static_method(Atomics::add, js_string!(\"add\"), 3)\n .static_method(Atomics::bit_and, js_string!(\"and\"), 3)\n .static_method(Atomics::compare_exchange, js_string!(\"compareExchange\"), 4)\n .static_method(Atomics::swap, js_string!(\"exchange\"), 3)\n .static_method(Atomics::is_lock_free, js_string!(\"isLockFree\"), 1)\n .static_method(Atomics::load, js_string!(\"load\"), 2)\n .static_method(Atomics::bit_or, js_string!(\"or\"), 3)\n .static_method(Atomics::store, js_string!(\"store\"), 3)\n .static_method(Atomics::sub, js_string!(\"sub\"), 3)\n .static_method(Atomics::wait::, js_string!(\"wait\"), 4)\n .static_method(Atomics::wait::, js_string!(\"waitAsync\"), 4)\n .static_method(Atomics::notify, js_string!(\"notify\"), 3)\n .static_method(Atomics::bit_xor, js_string!(\"xor\"), 3);\n\n #[cfg(feature = \"experimental\")]\n let builder = builder.static_method(Atomics::pause, js_string!(\"pause\"), 0);\n\n builder.build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n intrinsics.objects().atomics()\n }\n}\n\nimpl BuiltInObject for Atomics {\n const NAME: JsString = StaticJsStrings::ATOMICS;\n}\n\nmacro_rules! atomic_op {\n ($(#[$attr:meta])* $name:ident) => {\n $(#[$attr])* fn $name(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n\n let array = args.get_or_undefined(0);\n let index = args.get_or_undefined(1);\n let value = args.get_or_undefined(2);\n\n // AtomicReadModifyWrite ( typedArray, index, value, op )\n // \n\n // 1. Let buffer be ? ValidateIntegerTypedArray(typedArray).\n let (ta, buf_len) = validate_integer_typed_array(array, false)?;\n\n // 2. Let indexedPosition be ? ValidateAtomicAccess(typedArray, index).\n let access = validate_atomic_access(&ta, buf_len, index, context)?;\n\n // 3. If typedArray.[[ContentType]] is BigInt, let v be ? ToBigInt(value).\n // 4. Otherwise, let v be 𝔽(? ToIntegerOrInfinity(value)).\n // 7. Let elementType be TypedArrayElementType(typedArray).\n let value = access.kind.get_element(value, context)?;\n\n // 5. If IsDetachedBuffer(buffer) is true, throw a TypeError exception.\n // 6. NOTE: The above check is not redundant with the check in ValidateIntegerTypedArray because the call\n // to ToBigInt or ToIntegerOrInfinity on the preceding lines can have arbitrary side effects, which could\n // cause the buffer to become detached.\n let ta = ta.borrow();\n let ta = ta.data();\n let mut buffer = ta.viewed_array_buffer().as_buffer_mut();\n let Some(mut data) = buffer.bytes_with_len(buf_len) else {\n return Err(JsNativeError::typ()\n .with_message(\"cannot execute atomic operation in detached buffer\")\n .into());\n };\n let data = data.subslice_mut(access.byte_offset..);\n\n // 8. Return GetModifySetValueInBuffer(buffer, indexedPosition, elementType, v, op).\n // SAFETY: The integer indexed object guarantees that the buffer is aligned.\n // The call to `validate_atomic_access` guarantees that the index is in-bounds.\n let value: TypedArrayElement = unsafe {\n match value {\n TypedArrayElement::Int8(num) => {\n i8::read_mut(data).$name(num, Ordering::SeqCst).into()\n }\n TypedArrayElement::Uint8(num) => {\n u8::read_mut(data).$name(num, Ordering::SeqCst).into()\n }\n TypedArrayElement::Int16(num) => i16::read_mut(data)\n .$name(num, Ordering::SeqCst)\n .into(),\n TypedArrayElement::Uint16(num) => u16::read_mut(data)\n .$name(num, Ordering::SeqCst)\n .into(),\n TypedArrayElement::Int32(num) => i32::read_mut(data)\n .$name(num, Ordering::SeqCst)\n .into(),\n TypedArrayElement::Uint32(num) => u32::read_mut(data)\n .$name(num, Ordering::SeqCst)\n .into(),\n TypedArrayElement::BigInt64(num) => i64::read_mut(data)\n .$name(num, Ordering::SeqCst)\n .into(),\n TypedArrayElement::BigUint64(num) => u64::read_mut(data)\n .$name(num, Ordering::SeqCst)\n .into(),\n TypedArrayElement::Uint8Clamped(_)\n | TypedArrayElement::Float32(_)\n | TypedArrayElement::Float64(_) => unreachable!(\n \"must have been filtered out by the call to `validate_integer_typed_array`\"\n ),\n #[cfg(feature = \"float16\")]\n TypedArrayElement::Float16(_) => unreachable!(\n \"must have been filtered out by the call to `validate_integer_typed_array`\"\n ),\n }\n };\n\n Ok(value.into())\n }\n };\n}\n\nimpl Atomics {\n /// [`Atomics.isLockFree ( size )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.islockfree\n fn is_lock_free(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let n be ? ToIntegerOrInfinity(size).\n let n = args.get_or_undefined(0).to_integer_or_infinity(context)?;\n\n // 2. Let AR be the Agent Record of the surrounding agent.\n Ok(match n.as_integer() {\n // 3. If n = 1, return AR.[[IsLockFree1]].\n Some(1) => <::Atomic as Atomic>::is_lock_free(),\n // 4. If n = 2, return AR.[[IsLockFree2]].\n Some(2) => <::Atomic as Atomic>::is_lock_free(),\n // 5. If n = 4, return true.\n Some(4) => true,\n // 6. If n = 8, return AR.[[IsLockFree8]].\n Some(8) => <::Atomic as Atomic>::is_lock_free(),\n // 7. Return false.\n _ => false,\n }\n .into())\n }\n\n /// [`Atomics.load ( typedArray, index )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.load\n fn load(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let array = args.get_or_undefined(0);\n let index = args.get_or_undefined(1);\n\n // 1. Let indexedPosition be ? ValidateAtomicAccessOnIntegerTypedArray(typedArray, index).\n let (ta, buf_len) = validate_integer_typed_array(array, false)?;\n let access = validate_atomic_access(&ta, buf_len, index, context)?;\n\n // 2. Perform ? RevalidateAtomicAccess(typedArray, indexedPosition).\n let ta = ta.borrow();\n let ta = ta.data();\n let buffer = ta.viewed_array_buffer().as_buffer();\n let Some(data) = buffer.bytes_with_len(buf_len) else {\n return Err(JsNativeError::typ()\n .with_message(\"cannot execute atomic operation in detached buffer\")\n .into());\n };\n let data = data.subslice(access.byte_offset..);\n\n // 3. Let buffer be typedArray.[[ViewedArrayBuffer]].\n // 4. Let elementType be TypedArrayElementType(typedArray).\n // 5. Return GetValueFromBuffer(buffer, indexedPosition, elementType, true, seq-cst).\n // SAFETY: The integer indexed object guarantees that the buffer is aligned.\n // The call to `validate_atomic_access` guarantees that the index is in-bounds.\n let value = unsafe { data.get_value(access.kind, Ordering::SeqCst) };\n\n Ok(value.into())\n }\n\n /// [`Atomics.store ( typedArray, index, value )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.store\n fn store(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let array = args.get_or_undefined(0);\n let index = args.get_or_undefined(1);\n let value = args.get_or_undefined(2);\n\n // 1. Let indexedPosition be ? ValidateAtomicAccessOnIntegerTypedArray(typedArray, index).\n let (ta, buf_len) = validate_integer_typed_array(array, false)?;\n let access = validate_atomic_access(&ta, buf_len, index, context)?;\n\n // bit of a hack to preserve the converted value\n // 2. If typedArray.[[ContentType]] is bigint, let v be ? ToBigInt(value).\n let converted: JsValue = if access.kind.content_type() == ContentType::BigInt {\n value.to_bigint(context)?.into()\n } else {\n // 3. Otherwise, let v be 𝔽(? ToIntegerOrInfinity(value)).\n match value.to_integer_or_infinity(context)? {\n IntegerOrInfinity::PositiveInfinity => f64::INFINITY,\n IntegerOrInfinity::Integer(i) => i as f64,\n IntegerOrInfinity::NegativeInfinity => f64::NEG_INFINITY,\n }\n .into()\n };\n let value = access.kind.get_element(&converted, context)?;\n\n // 4. Perform ? RevalidateAtomicAccess(typedArray, indexedPosition).\n let ta = ta.borrow();\n let ta = ta.data();\n let mut buffer = ta.viewed_array_buffer().as_buffer_mut();\n let Some(mut buffer) = buffer.bytes_with_len(buf_len) else {\n return Err(JsNativeError::typ()\n .with_message(\"cannot execute atomic operation in detached buffer\")\n .into());\n };\n let mut data = buffer.subslice_mut(access.byte_offset..);\n\n // 5. Let buffer be typedArray.[[ViewedArrayBuffer]].\n // 6. Let elementType be TypedArrayElementType(typedArray).\n // 7. Perform SetValueInBuffer(buffer, indexedPosition, elementType, v, true, seq-cst).\n // SAFETY: The integer indexed object guarantees that the buffer is aligned.\n // The call to `validate_atomic_access` guarantees that the index is in-bounds.\n unsafe {\n data.set_value(value, Ordering::SeqCst);\n }\n\n // 8. Return v.\n Ok(converted)\n }\n\n /// [`Atomics.compareExchange ( typedArray, index, expectedValue, replacementValue )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.compareexchange\n fn compare_exchange(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let array = args.get_or_undefined(0);\n let index = args.get_or_undefined(1);\n let expected = args.get_or_undefined(2);\n let replacement = args.get_or_undefined(3);\n\n // 1. Let indexedPosition be ? ValidateAtomicAccessOnIntegerTypedArray(typedArray, index).\n // 2. Let buffer be typedArray.[[ViewedArrayBuffer]].\n // 3. Let block be buffer.[[ArrayBufferData]].\n let (ta, buf_len) = validate_integer_typed_array(array, false)?;\n let access = validate_atomic_access(&ta, buf_len, index, context)?;\n\n // 4. If typedArray.[[ContentType]] is bigint, then\n // a. Let expected be ? ToBigInt(expectedValue).\n // b. Let replacement be ? ToBigInt(replacementValue).\n // 5. Else,\n // a. Let expected be 𝔽(? ToIntegerOrInfinity(expectedValue)).\n // b. Let replacement be 𝔽(? ToIntegerOrInfinity(replacementValue)).\n let exp = access.kind.get_element(expected, context)?.to_bits();\n let rep = access.kind.get_element(replacement, context)?.to_bits();\n\n // 6. Perform ? RevalidateAtomicAccess(typedArray, indexedPosition).\n let ta = ta.borrow();\n let ta = ta.data();\n let mut buffer = ta.viewed_array_buffer().as_buffer_mut();\n let Some(mut buffer) = buffer.bytes_with_len(buf_len) else {\n return Err(JsNativeError::typ()\n .with_message(\"cannot execute atomic operation in detached buffer\")\n .into());\n };\n let data = buffer.subslice_mut(access.byte_offset..);\n\n // 7. Let elementType be TypedArrayElementType(typedArray).\n // 8. Let elementSize be TypedArrayElementSize(typedArray).\n // 9. Let isLittleEndian be the value of the [[LittleEndian]] field of the surrounding agent's Agent Record.\n // 10. Let expectedBytes be NumericToRawBytes(elementType, expected, isLittleEndian).\n // 11. Let replacementBytes be NumericToRawBytes(elementType, replacement, isLittleEndian).\n // 12. If IsSharedArrayBuffer(buffer) is true, then\n // a. Let rawBytesRead be AtomicCompareExchangeInSharedBlock(block, indexedPosition, elementSize, expectedBytes, replacementBytes).\n // 13. Else,\n // a. Let rawBytesRead be a List of length elementSize whose elements are the sequence of elementSize bytes starting with block[indexedPosition].\n // b. If ByteListEqual(rawBytesRead, expectedBytes) is true, then\n // i. Store the individual bytes of replacementBytes into block, starting at block[indexedPosition].\n // 14. Return RawBytesToNumeric(elementType, rawBytesRead, isLittleEndian).\n\n // SAFETY: The integer indexed object guarantees that the buffer is aligned.\n // The call to `validate_atomic_access` guarantees that the index is in-bounds.\n let value: TypedArrayElement = unsafe {\n match access.kind {\n TypedArrayKind::Int8 => i8::read_mut(data)\n .compare_exchange(exp as i8, rep as i8, Ordering::SeqCst)\n .into(),\n TypedArrayKind::Uint8 => u8::read_mut(data)\n .compare_exchange(exp as u8, rep as u8, Ordering::SeqCst)\n .into(),\n TypedArrayKind::Int16 => i16::read_mut(data)\n .compare_exchange(exp as i16, rep as i16, Ordering::SeqCst)\n .into(),\n TypedArrayKind::Uint16 => u16::read_mut(data)\n .compare_exchange(exp as u16, rep as u16, Ordering::SeqCst)\n .into(),\n TypedArrayKind::Int32 => i32::read_mut(data)\n .compare_exchange(exp as i32, rep as i32, Ordering::SeqCst)\n .into(),\n TypedArrayKind::Uint32 => u32::read_mut(data)\n .compare_exchange(exp as u32, rep as u32, Ordering::SeqCst)\n .into(),\n TypedArrayKind::BigInt64 => i64::read_mut(data)\n .compare_exchange(exp as i64, rep as i64, Ordering::SeqCst)\n .into(),\n TypedArrayKind::BigUint64 => u64::read_mut(data)\n .compare_exchange(exp, rep, Ordering::SeqCst)\n .into(),\n TypedArrayKind::Uint8Clamped\n | TypedArrayKind::Float32\n | TypedArrayKind::Float64 => unreachable!(\n \"must have been filtered out by the call to `validate_integer_typed_array`\"\n ),\n #[cfg(feature = \"float16\")]\n TypedArrayKind::Float16 => unreachable!(\n \"must have been filtered out by the call to `validate_integer_typed_array`\"\n ),\n }\n };\n\n Ok(value.into())\n }\n\n // =========== Atomics.ops start ===========\n\n atomic_op! {\n /// [`Atomics.add ( typedArray, index, value )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.add\n add\n }\n\n atomic_op! {\n /// [`Atomics.and ( typedArray, index, value )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.and\n bit_and\n }\n\n atomic_op! {\n /// [`Atomics.exchange ( typedArray, index, value )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.exchange\n swap\n }\n\n atomic_op! {\n /// [`Atomics.or ( typedArray, index, value )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.or\n bit_or\n }\n\n atomic_op! {\n /// [`Atomics.sub ( typedArray, index, value )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.sub\n sub\n }\n\n atomic_op! {\n /// [`Atomics.xor ( typedArray, index, value )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.xor\n bit_xor\n }\n\n /// [`Atomics.wait ( typedArray, index, value, timeout )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.wait\n fn wait(\n _: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let array = args.get_or_undefined(0);\n let index = args.get_or_undefined(1);\n let value = args.get_or_undefined(2);\n let timeout = args.get_or_undefined(3);\n\n // 1. Let taRecord be ? ValidateIntegerTypedArray(typedArray, true).\n let (ta, buf_len) = validate_integer_typed_array(array, true)?;\n\n // 2. Let buffer be taRecord.[[Object]].[[ViewedArrayBuffer]].\n // 3. If IsSharedArrayBuffer(buffer) is false, throw a TypeError exception.\n let buffer = match ta.borrow().data().viewed_array_buffer() {\n BufferObject::SharedBuffer(buf) => buf.clone(),\n BufferObject::Buffer(_) => {\n return Err(JsNativeError::typ()\n .with_message(\"cannot use `ArrayBuffer` for an atomic wait\")\n .into());\n }\n };\n\n // 4. Let i be ? ValidateAtomicAccess(taRecord, index).\n let access = validate_atomic_access(&ta, buf_len, index, context)?;\n\n // 5. Let arrayTypeName be typedArray.[[TypedArrayName]].\n let value = if access.kind == TypedArrayKind::BigInt64 {\n // 6. If typedArray.[[TypedArrayName]] is \"BigInt64Array\", let v be ? ToBigInt64(value).\n value.to_big_int64(context)?\n } else {\n // 7. Else, let v be ? ToInt32(value).\n i64::from(value.to_i32(context)?)\n };\n\n // 8. Let q be ? ToNumber(timeout).\n // 9. If q is either NaN or +∞𝔽, let t be +∞; else if q is -∞𝔽, let t be 0; else let t be max(ℝ(q), 0).\n let mut timeout = timeout.to_number(context)?;\n // convert to nanoseconds to discard any excessively big timeouts.\n timeout = timeout.clamp(0.0, f64::INFINITY) * 1000.0 * 1000.0;\n let timeout = if timeout.is_nan() || timeout.is_infinite() || timeout > u64::MAX as f64 {\n None\n } else {\n Some(Duration::from_nanos(timeout as u64))\n };\n\n // 10. If mode is sync and AgentCanSuspend() is false, throw a TypeError exception.\n if !ASYNC && !context.can_block() {\n return Err(JsNativeError::typ()\n .with_message(\"agent cannot be suspended\")\n .into());\n }\n\n // SAFETY: the validity of `addr` is verified by our call to `validate_atomic_access`.\n if ASYNC {\n let (promise, resolvers) = JsPromise::new_pending(context);\n let result = unsafe {\n if access.kind == TypedArrayKind::BigInt64 {\n futex::wait_async(\n buffer.borrow().data(),\n buf_len,\n access.byte_offset,\n value,\n timeout,\n resolvers,\n context,\n )?\n } else {\n // value must fit into `i32` since it came from an `i32` above.\n futex::wait_async(\n buffer.borrow().data(),\n buf_len,\n access.byte_offset,\n value as i32,\n timeout,\n resolvers,\n context,\n )?\n }\n };\n\n let (is_async, value) = match result {\n futex::AtomicsWaitResult::NotEqual => (false, js_string!(\"not-equal\").into()),\n futex::AtomicsWaitResult::TimedOut => (false, js_string!(\"timed-out\").into()),\n futex::AtomicsWaitResult::Ok => (true, promise.into()),\n };\n\n Ok(context\n .intrinsics()\n .templates()\n .wait_async()\n .create(OrdinaryObject, vec![is_async.into(), value])\n .into())\n } else {\n let result = unsafe {\n if access.kind == TypedArrayKind::BigInt64 {\n futex::wait(\n buffer.borrow().data(),\n buf_len,\n access.byte_offset,\n value,\n timeout,\n )?\n } else {\n // value must fit into `i32` since it came from an `i32` above.\n futex::wait(\n buffer.borrow().data(),\n buf_len,\n access.byte_offset,\n value as i32,\n timeout,\n )?\n }\n };\n\n Ok(match result {\n futex::AtomicsWaitResult::NotEqual => js_string!(\"not-equal\"),\n futex::AtomicsWaitResult::TimedOut => js_string!(\"timed-out\"),\n futex::AtomicsWaitResult::Ok => js_string!(\"ok\"),\n }\n .into())\n }\n }\n\n /// [`Atomics.notify ( typedArray, index, count )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-atomics.notify\n fn notify(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let array = args.get_or_undefined(0);\n let index = args.get_or_undefined(1);\n let count = args.get_or_undefined(2);\n\n // 1. Let indexedPosition be ? ValidateAtomicAccessOnIntegerTypedArray(typedArray, index, true).\n let (ta, buf_len) = validate_integer_typed_array(array, true)?;\n let access = validate_atomic_access(&ta, buf_len, index, context)?;\n\n // 2. If count is undefined, then\n let count = if count.is_undefined() {\n // a. Let c be +∞.\n u64::MAX\n } else {\n // 3. Else,\n // a. Let intCount be ? ToIntegerOrInfinity(count).\n // b. Let c be max(intCount, 0).\n match count.to_integer_or_infinity(context)? {\n IntegerOrInfinity::PositiveInfinity => u64::MAX,\n IntegerOrInfinity::Integer(i) => i64::max(i, 0) as u64,\n IntegerOrInfinity::NegativeInfinity => 0,\n }\n };\n\n // 4. Let buffer be typedArray.[[ViewedArrayBuffer]].\n // 5. Let block be buffer.[[ArrayBufferData]].\n // 6. If IsSharedArrayBuffer(buffer) is false, return +0𝔽.\n let ta = ta.borrow();\n let BufferRef::SharedBuffer(shared) = ta.data().viewed_array_buffer().as_buffer() else {\n return Ok(0.into());\n };\n\n let count = futex::notify(&shared, access.byte_offset, count)?;\n\n // 12. Let n be the number of elements in S.\n // 13. Return 𝔽(n).\n Ok(count.into())\n }\n\n /// [`Atomics.pause ( [ iterationNumber ] )`][spec]\n ///\n /// [spec]: https://tc39.es/proposal-atomics-microwait/#Atomics.pause\n #[cfg(feature = \"experimental\")]\n fn pause(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n use super::Number;\n\n let iteration_number = args.get_or_undefined(0);\n\n // 1. If iterationNumber is not undefined, then\n let iterations = if iteration_number.is_undefined() {\n 1\n } else {\n // a. If iterationNumber is not an integral Number, throw a TypeError exception.\n if !Number::is_integer(iteration_number) {\n return Err(JsNativeError::typ()\n .with_message(\"`iterationNumber` must be an integral Number\")\n .into());\n }\n\n // b. If ℝ(iterationNumber) < 0, throw a RangeError exception.\n let iteration_number = iteration_number.to_number(context)? as i16;\n if iteration_number < 0 {\n return Err(JsNativeError::range()\n .with_message(\"`iterationNumber` must be a positive integer\")\n .into());\n }\n\n // Clamp to u16 so that the main thread cannot block using this.\n iteration_number as u16\n };\n\n // 2. If the execution environment of the ECMAScript implementation supports a signal that the current executing code\n // is in a spin-wait loop, send that signal. An ECMAScript implementation may send that signal multiple times,\n // determined by iterationNumber when not undefined. The number of times the signal is sent for an integral Number\n // N is at most the number of times it is sent for N + 1.\n for _ in 0..iterations {\n std::hint::spin_loop();\n }\n\n // 3. Return undefined.\n Ok(JsValue::undefined())\n }\n}\n\n/// [`ValidateIntegerTypedArray ( typedArray, waitable )`][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-validateintegertypedarray\nfn validate_integer_typed_array(\n array: &JsValue,\n waitable: bool,\n) -> JsResult<(JsObject, usize)> {\n // 1. Let taRecord be ? ValidateTypedArray(typedArray, unordered).\n // 2. NOTE: Bounds checking is not a synchronizing operation when typedArray's backing buffer is a growable SharedArrayBuffer.\n let ta_record = TypedArray::validate(array, Ordering::Relaxed)?;\n\n {\n let array = ta_record.0.borrow();\n\n // 3. If waitable is true, then\n if waitable {\n // a. If typedArray.[[TypedArrayName]] is neither \"Int32Array\" nor \"BigInt64Array\", throw a TypeError exception.\n if ![TypedArrayKind::Int32, TypedArrayKind::BigInt64].contains(&array.data().kind()) {\n return Err(JsNativeError::typ()\n .with_message(\"can only atomically wait using Int32 or BigInt64 arrays\")\n .into());\n }\n } else {\n // 4. Else,\n // a. Let type be TypedArrayElementType(typedArray).\n // b. If IsUnclampedIntegerElementType(type) is false and IsBigIntElementType(type) is false, throw a TypeError exception.\n if !array.data().kind().supports_atomic_ops() {\n return Err(JsNativeError::typ()\n .with_message(\n \"platform doesn't support atomic operations on the provided `TypedArray`\",\n )\n .into());\n }\n }\n }\n\n // 5. Return taRecord.\n Ok(ta_record)\n}\n\n#[derive(Debug, Copy, Clone)]\nstruct AtomicAccess {\n byte_offset: usize,\n kind: TypedArrayKind,\n}\n\n/// [`ValidateAtomicAccess ( taRecord, requestIndex )`][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-validateatomicaccess\nfn validate_atomic_access(\n array: &JsObject,\n buf_len: usize,\n request_index: &JsValue,\n context: &mut Context,\n) -> JsResult {\n // 5. Let typedArray be taRecord.[[Object]].\n let (length, kind, offset) = {\n let array = array.borrow();\n let array = array.data();\n\n // 1. Let length be typedArray.[[ArrayLength]].\n // 6. Let elementSize be TypedArrayElementSize(typedArray).\n // 7. Let offset be typedArray.[[ByteOffset]].\n (\n array.array_length(buf_len),\n array.kind(),\n array.byte_offset(),\n )\n };\n\n // 2. Let accessIndex be ? ToIndex(requestIndex).\n let access_index = request_index.to_index(context)?;\n\n // 3. Assert: accessIndex ≥ 0.\n // ensured by the type.\n\n // 4. If accessIndex ≥ length, throw a RangeError exception.\n if access_index >= length {\n return Err(JsNativeError::range()\n .with_message(\"index for typed array outside of bounds\")\n .into());\n }\n\n // 8. Return (accessIndex × elementSize) + offset.\n let offset = ((access_index * kind.element_size()) + offset) as usize;\n Ok(AtomicAccess {\n byte_offset: offset,\n kind,\n })\n}\n\n#[cfg(test)]\nmod tests;\n" }, { "path": "core/engine/src/builtins/atomics/tests.rs", "content": "use std::{rc::Rc, time::Duration};\n\nuse crate::{\n Context, JsValue,\n builtins::atomics::Atomics,\n js_string,\n module::IdleModuleLoader,\n object::{JsInt32Array, JsPromise, JsSharedArrayBuffer},\n value::TryFromJs,\n};\n\n#[test]\nfn waiterlist_block_indexedposition_wake() {\n const NUMAGENT: i32 = 2;\n const RUNNING: i32 = 4;\n\n let context = &mut Context::builder()\n .can_block(true)\n .module_loader(Rc::new(IdleModuleLoader))\n .build()\n .unwrap();\n let buffer = JsSharedArrayBuffer::new(size_of::() * 5, context).unwrap();\n let inner_buffer = buffer.inner();\n let i32a = JsInt32Array::from_shared_array_buffer(buffer.clone(), context).unwrap();\n\n std::thread::scope(|s| {\n let mut threads = Vec::new();\n for idx in [2, 0] {\n let buffer = inner_buffer.clone();\n let handle = s.spawn(move || {\n let context = &mut Context::builder()\n .can_block(true)\n .module_loader(Rc::new(IdleModuleLoader))\n .build()\n .unwrap();\n let buffer = JsSharedArrayBuffer::from_buffer(buffer, context);\n let i32a = JsInt32Array::from_shared_array_buffer(buffer, context).unwrap();\n\n Atomics::add(\n &JsValue::undefined(),\n &[i32a.clone().into(), RUNNING.into(), 1.into()],\n context,\n )\n .unwrap();\n\n let promise = JsPromise::try_from_js(\n &Atomics::wait::(\n &JsValue::undefined(),\n &[\n i32a.clone().into(),\n idx.into(),\n 0.into(),\n f64::INFINITY.into(),\n ],\n context,\n )\n .unwrap()\n .as_object()\n .unwrap()\n .get(js_string!(\"value\"), context)\n .unwrap(),\n context,\n )\n .unwrap();\n\n assert_eq!(\n promise\n .await_blocking(context)\n .unwrap()\n .to_string(context)\n .unwrap()\n .to_std_string_lossy(),\n \"ok\"\n );\n });\n threads.push(handle);\n }\n\n while Atomics::load(\n &JsValue::undefined(),\n &[i32a.clone().into(), RUNNING.into()],\n context,\n )\n .unwrap()\n .to_i32(context)\n .unwrap()\n != NUMAGENT\n {}\n\n std::thread::sleep(Duration::from_millis(100));\n\n assert_eq!(\n Atomics::load(\n &JsValue::undefined(),\n &[i32a.clone().into(), RUNNING.into()],\n context,\n )\n .unwrap()\n .to_i32(context)\n .unwrap(),\n NUMAGENT\n );\n\n for missing in [1, 3] {\n assert_eq!(\n Atomics::notify(\n &JsValue::undefined(),\n &[i32a.clone().into(), missing.into()],\n context\n )\n .unwrap()\n .to_i32(context)\n .unwrap(),\n 0\n );\n }\n\n for exists in [2, 0] {\n assert_eq!(\n Atomics::notify(\n &JsValue::undefined(),\n &[i32a.clone().into(), exists.into()],\n context\n )\n .unwrap()\n .to_i32(context)\n .unwrap(),\n 1\n );\n }\n });\n}\n" }, { "path": "core/engine/src/builtins/bigint/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `BigInt` object.\n//!\n//! `BigInt` is a built-in object that provides a way to represent whole numbers larger\n//! than the largest number JavaScript can reliably represent with the Number primitive\n//! and represented by the `Number.MAX_SAFE_INTEGER` constant.\n//! `BigInt` can be used for arbitrarily large integers.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-bigint-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt\n\nuse crate::{\n Context, JsArgs, JsBigInt, JsExpect, JsResult, JsString, JsValue,\n builtins::BuiltInObject,\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::JsNativeError,\n js_string,\n object::JsObject,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::{IntegerOrInfinity, PreferredType},\n};\nuse num_bigint::ToBigInt;\n\nuse super::{BuiltInBuilder, BuiltInConstructor, IntrinsicObject};\n\n#[cfg(test)]\nmod tests;\n\n/// `BigInt` implementation.\n#[derive(Debug, Clone, Copy)]\npub struct BigInt;\n\nimpl IntrinsicObject for BigInt {\n fn init(realm: &Realm) {\n BuiltInBuilder::from_standard_constructor::(realm)\n .method(Self::to_string, js_string!(\"toString\"), 0)\n .method(Self::to_locale_string, js_string!(\"toLocaleString\"), 0)\n .method(Self::value_of, js_string!(\"valueOf\"), 0)\n .static_method(Self::as_int_n, js_string!(\"asIntN\"), 2)\n .static_method(Self::as_uint_n, js_string!(\"asUintN\"), 2)\n .property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::READONLY | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for BigInt {\n const NAME: JsString = StaticJsStrings::BIG_INT;\n}\n\nimpl BuiltInConstructor for BigInt {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 4;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 2;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::bigint;\n\n /// `BigInt()`\n ///\n /// The `BigInt()` constructor is used to create `BigInt` objects.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-bigint-objects\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt/BigInt\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is not undefined, throw a TypeError exception.\n if !new_target.is_undefined() {\n return Err(JsNativeError::typ()\n .with_message(\"BigInt is not a constructor\")\n .into());\n }\n\n let value = args.get_or_undefined(0);\n\n // 2. Let prim be ? ToPrimitive(value, number).\n let prim = value.to_primitive(context, PreferredType::Number)?;\n\n // 3. If Type(prim) is Number, return ? NumberToBigInt(prim).\n if let Some(number) = prim.as_number() {\n return Self::number_to_bigint(number);\n }\n\n // 4. Otherwise, return ? ToBigInt(prim).\n Ok(prim.to_bigint(context)?.into())\n }\n}\n\nimpl BigInt {\n /// `NumberToBigInt ( number )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-numbertobigint\n fn number_to_bigint(number: f64) -> JsResult {\n // 1. If IsIntegralNumber(number) is false, throw a RangeError exception.\n if number.is_nan() || number.is_infinite() || number.fract() != 0.0 {\n return Err(JsNativeError::range()\n .with_message(format!(\"cannot convert {number} to a BigInt\"))\n .into());\n }\n\n // 2. Return the BigInt value that represents ℝ(number).\n Ok(JsBigInt::from(\n number\n .to_bigint()\n .js_expect(\"This conversion must be safe\")?,\n )\n .into())\n }\n\n /// The abstract operation `thisBigIntValue` takes argument value.\n ///\n /// The phrase “this `BigInt` value” within the specification of a method refers to the\n /// result returned by calling the abstract operation `thisBigIntValue` with the `this` value\n /// of the method invocation passed as the argument.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-thisbigintvalue\n fn this_bigint_value(value: &JsValue) -> JsResult {\n value\n // 1. If Type(value) is BigInt, return value.\n .as_bigint()\n // 2. If Type(value) is Object and value has a [[BigIntData]] internal slot, then\n // a. Assert: Type(value.[[BigIntData]]) is BigInt.\n // b. Return value.[[BigIntData]].\n .or_else(|| {\n value\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().cloned())\n })\n // 3. Throw a TypeError exception.\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"'this' is not a BigInt\")\n .into()\n })\n }\n\n /// `BigInt.prototype.toString( [radix] )`\n ///\n /// The `toString()` method returns a string representing the specified `BigInt` object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-bigint.prototype.tostring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt/toString\n #[allow(clippy::wrong_self_convention)]\n pub(crate) fn to_string(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let x be ? thisBigIntValue(this value).\n let x = Self::this_bigint_value(this)?;\n\n let radix = args.get_or_undefined(0);\n\n // 2. If radix is undefined, let radixMV be 10.\n let radix_mv = if radix.is_undefined() {\n // 5. If radixMV = 10, return ! ToString(x).\n // Note: early return optimization.\n return Ok(js_string!(x.to_string()).into());\n // 3. Else, let radixMV be ? ToIntegerOrInfinity(radix).\n } else {\n radix.to_integer_or_infinity(context)?\n };\n\n // 4. If radixMV < 2 or radixMV > 36, throw a RangeError exception.\n let radix_mv = match radix_mv {\n IntegerOrInfinity::Integer(i) if (2..=36).contains(&i) => i,\n _ => {\n return Err(JsNativeError::range()\n .with_message(\"radix must be an integer at least 2 and no greater than 36\")\n .into());\n }\n };\n\n // 5. If radixMV = 10, return ! ToString(x).\n if radix_mv == 10 {\n return Ok(js_string!(x.to_string()).into());\n }\n\n // 1. Let x be ? thisBigIntValue(this value).\n // 6. Return the String representation of this Number value using the radix specified by radixMV.\n // Letters a-z are used for digits with values 10 through 35.\n // The precise algorithm is implementation-defined, however the algorithm should be a generalization of that specified in 6.1.6.2.23.\n Ok(JsValue::new(js_string!(x.to_string_radix(radix_mv as u32))))\n }\n\n #[allow(\n unused_variables,\n reason = \"`args` is used if the `intl` feature is enabled\"\n )]\n fn to_locale_string(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n #[cfg(feature = \"intl\")]\n {\n // 1. Let x be ? ThisBigIntValue(this value).\n\n use fixed_decimal::Decimal;\n\n use crate::builtins::intl::NumberFormat;\n let x = Self::this_bigint_value(this)?;\n let locales = args.get_or_undefined(0).clone();\n let options = args.get_or_undefined(1).clone();\n\n // 2. Let numberFormat be ? Construct(%Intl.NumberFormat%, « locales, options »).\n let number_format = NumberFormat::new(&locales, &options, context)?;\n let x = &mut Decimal::try_from_str(&x.to_string())\n .map_err(|err| JsNativeError::range().with_message(err.to_string()))?;\n\n // 3. Return FormatNumeric(numberFormat, ℝ(x)).\n Ok(js_string!(number_format.format(x).to_string()).into())\n }\n\n #[cfg(not(feature = \"intl\"))]\n {\n // Arguments are reserved, so we cannot pass them to the `toString` method.\n Self::to_string(this, &[], context)\n }\n }\n\n /// `BigInt.prototype.valueOf()`\n ///\n /// The `valueOf()` method returns the wrapped primitive value of a Number object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-bigint.prototype.valueof\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt/valueOf\n pub(crate) fn value_of(this: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n Ok(JsValue::new(Self::this_bigint_value(this)?))\n }\n\n /// `BigInt.asIntN()`\n ///\n /// The `BigInt.asIntN()` method wraps the value of a `BigInt` to a signed integer between `-2**(width - 1)` and `2**(width-1) - 1`.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-bigint.asintn\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt/asIntN\n #[allow(clippy::wrong_self_convention)]\n pub(crate) fn as_int_n(\n _: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let (modulo, bits) = Self::calculate_as_uint_n(args, context)?;\n\n if bits > 0\n && modulo >= JsBigInt::pow(&JsBigInt::new(2), &JsBigInt::new(i64::from(bits) - 1))?\n {\n Ok(JsValue::new(JsBigInt::sub(\n &modulo,\n &JsBigInt::pow(&JsBigInt::new(2), &JsBigInt::new(i64::from(bits)))?,\n )))\n } else {\n Ok(JsValue::new(modulo))\n }\n }\n\n /// `BigInt.asUintN()`\n ///\n /// The `BigInt.asUintN()` method wraps the value of a `BigInt` to an unsigned integer between `0` and `2**(width) - 1`.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-bigint.asuintn\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/BigInt/asUintN\n #[allow(clippy::wrong_self_convention)]\n pub(crate) fn as_uint_n(\n _: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let (modulo, _) = Self::calculate_as_uint_n(args, context)?;\n\n Ok(JsValue::new(modulo))\n }\n\n /// Helper function to wrap the value of a `BigInt` to an unsigned integer.\n ///\n /// This function expects the same arguments as `as_uint_n` and wraps the value of a `BigInt`.\n /// Additionally to the wrapped unsigned value it returns the converted `bits` argument, so it\n /// can be reused from the `as_int_n` method.\n fn calculate_as_uint_n(args: &[JsValue], context: &mut Context) -> JsResult<(JsBigInt, u32)> {\n let bits_arg = args.get_or_undefined(0);\n let bigint_arg = args.get_or_undefined(1);\n\n let bits = bits_arg.to_index(context)?;\n let bits = u32::try_from(bits).unwrap_or(u32::MAX);\n\n let bigint = bigint_arg.to_bigint(context)?;\n\n Ok((\n JsBigInt::mod_floor(\n &bigint,\n &JsBigInt::pow(&JsBigInt::new(2), &JsBigInt::new(i64::from(bits)))?,\n ),\n bits,\n ))\n }\n}\n" }, { "path": "core/engine/src/builtins/bigint/tests.rs", "content": "use boa_macros::js_str;\n\nuse crate::{JsBigInt, JsNativeErrorKind, TestAction, run_test_actions};\n\n#[test]\nfn equality() {\n run_test_actions([\n TestAction::assert(\"0n == 0n\"),\n TestAction::assert(\"!(1n == 0n)\"),\n TestAction::assert(\n \"1000000000000000000000000000000000n == 1000000000000000000000000000000000n\",\n ),\n TestAction::assert(\"0n == ''\"),\n TestAction::assert(\"100n == '100'\"),\n TestAction::assert(\"!(100n == '100.5')\"),\n TestAction::assert(\"10000000000000000n == '10000000000000000'\"),\n TestAction::assert(\"'' == 0n\"),\n TestAction::assert(\"'100' == 100n\"),\n TestAction::assert(\"!('100.5' == 100n)\"),\n TestAction::assert(\"'10000000000000000' == 10000000000000000n\"),\n TestAction::assert(\"0n == 0\"),\n TestAction::assert(\"0n == 0.0\"),\n TestAction::assert(\"100n == 100\"),\n TestAction::assert(\"100n == 100.0\"),\n TestAction::assert(\"!(100n == '100.5')\"),\n TestAction::assert(\"!(100n == '1005')\"),\n TestAction::assert(\"10000000000000000n == 10000000000000000\"),\n TestAction::assert(\"0 == 0n\"),\n TestAction::assert(\"0.0 == 0n\"),\n TestAction::assert(\"100 == 100n\"),\n TestAction::assert(\"100.0 == 100n\"),\n TestAction::assert(\"!(100.5 == 100n)\"),\n TestAction::assert(\"!(1005 == 100n)\"),\n TestAction::assert(\"10000000000000000 == 10000000000000000n\"),\n ]);\n}\n\n#[test]\nfn bigint_function_conversion_from_integer() {\n run_test_actions([\n TestAction::assert_eq(\"BigInt(1000)\", JsBigInt::from(1000)),\n TestAction::assert_eq(\n \"BigInt(20000000000000000)\",\n JsBigInt::from_string(\"20000000000000000\").unwrap(),\n ),\n TestAction::assert_eq(\n \"BigInt(1000000000000000000000000000000000)\",\n JsBigInt::from_string(\"999999999999999945575230987042816\").unwrap(),\n ),\n ]);\n}\n\n#[test]\nfn bigint_function_conversion_from_rational() {\n run_test_actions([\n TestAction::assert_eq(\"BigInt(0.0)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt(1.0)\", JsBigInt::from(1)),\n TestAction::assert_eq(\"BigInt(10000.0)\", JsBigInt::from(10_000)),\n ]);\n}\n\n#[test]\nfn bigint_function_throws() {\n run_test_actions([\n TestAction::assert_native_error(\n \"BigInt(0.1)\",\n JsNativeErrorKind::Range,\n \"cannot convert 0.1 to a BigInt\",\n ),\n TestAction::assert_native_error(\n \"BigInt(null)\",\n JsNativeErrorKind::Type,\n \"cannot convert null to a BigInt\",\n ),\n TestAction::assert_native_error(\n \"BigInt(undefined)\",\n JsNativeErrorKind::Type,\n \"cannot convert undefined to a BigInt\",\n ),\n ]);\n}\n\n#[test]\nfn bigint_function_conversion_from_string() {\n run_test_actions([\n TestAction::assert_eq(\"BigInt('')\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt(' ')\", JsBigInt::from(0)),\n TestAction::assert_eq(\n \"BigInt('200000000000000000')\",\n JsBigInt::from_string(\"200000000000000000\").unwrap(),\n ),\n TestAction::assert_eq(\n \"BigInt('1000000000000000000000000000000000')\",\n JsBigInt::from_string(\"1000000000000000000000000000000000\").unwrap(),\n ),\n TestAction::assert_eq(\"BigInt('0b1111')\", JsBigInt::from(15)),\n TestAction::assert_eq(\"BigInt('0o70')\", JsBigInt::from(56)),\n TestAction::assert_eq(\"BigInt('0xFF')\", JsBigInt::from(255)),\n ]);\n}\n\n#[test]\nfn operations() {\n run_test_actions([\n TestAction::assert_eq(\"10000n + 1000n\", JsBigInt::from(11_000)),\n TestAction::assert_eq(\"10000n - 1000n\", JsBigInt::from(9_000)),\n TestAction::assert_eq(\n \"123456789n * 102030n\",\n JsBigInt::from_string(\"12596296181670\").unwrap(),\n ),\n TestAction::assert_eq(\"15000n / 50n\", JsBigInt::from(300)),\n TestAction::assert_eq(\"15001n / 50n\", JsBigInt::from(300)),\n TestAction::assert_native_error(\n \"1n/0n\",\n JsNativeErrorKind::Range,\n \"BigInt division by zero\",\n ),\n TestAction::assert_eq(\"15007n % 10n\", JsBigInt::from(7)),\n TestAction::assert_native_error(\n \"1n % 0n\",\n JsNativeErrorKind::Range,\n \"BigInt division by zero\",\n ),\n TestAction::assert_eq(\n \"100n ** 10n\",\n JsBigInt::from_string(\"100000000000000000000\").unwrap(),\n ),\n TestAction::assert_native_error(\n \"10n ** (-10n)\",\n JsNativeErrorKind::Range,\n \"BigInt negative exponent\",\n ),\n TestAction::assert_eq(\"8n << 2n\", JsBigInt::from(32)),\n TestAction::assert_native_error(\n \"1000n << 1000000000000000n\",\n JsNativeErrorKind::Range,\n \"Maximum BigInt size exceeded\",\n ),\n TestAction::assert_eq(\"8n >> 2n\", JsBigInt::from(2)),\n TestAction::assert_eq(\"1000n >> 1000000000000000n\", JsBigInt::zero()),\n TestAction::assert_eq(\"(-1000n) >> 1000000000000000n\", JsBigInt::from(-1)),\n TestAction::assert_eq(\"0n >> 1000000000000000n\", JsBigInt::zero()),\n // shift_left with large negative amount (equivalent to large right-shift)\n TestAction::assert_eq(\"1000n << (-1000000000000000n)\", JsBigInt::zero()),\n TestAction::assert_eq(\"(-1000n) << (-1000000000000000n)\", JsBigInt::from(-1)),\n TestAction::assert_eq(\"0n << (-1000000000000000n)\", JsBigInt::zero()),\n ]);\n}\n\n#[test]\nfn to_string() {\n run_test_actions([\n TestAction::assert_eq(\"1000n.toString()\", js_str!(\"1000\")),\n TestAction::assert_eq(\"1000n.toString(2)\", js_str!(\"1111101000\")),\n TestAction::assert_eq(\"255n.toString(16)\", js_str!(\"ff\")),\n TestAction::assert_eq(\"1000n.toString(36)\", js_str!(\"rs\")),\n ]);\n}\n\n#[test]\nfn to_string_invalid_radix() {\n run_test_actions([\n TestAction::assert_native_error(\n \"10n.toString(null)\",\n JsNativeErrorKind::Range,\n \"radix must be an integer at least 2 and no greater than 36\",\n ),\n TestAction::assert_native_error(\n \"10n.toString(-1)\",\n JsNativeErrorKind::Range,\n \"radix must be an integer at least 2 and no greater than 36\",\n ),\n TestAction::assert_native_error(\n \"10n.toString(37)\",\n JsNativeErrorKind::Range,\n \"radix must be an integer at least 2 and no greater than 36\",\n ),\n ]);\n}\n\n#[test]\nfn as_int_n() {\n run_test_actions([\n TestAction::assert_eq(\"BigInt.asIntN(0, 1n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asIntN(1, 1n)\", JsBigInt::from(-1)),\n TestAction::assert_eq(\"BigInt.asIntN(3, 10n)\", JsBigInt::from(2)),\n TestAction::assert_eq(\"BigInt.asIntN({}, 1n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asIntN(2, 0n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asIntN(2, -0n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\n \"BigInt.asIntN(2, -123456789012345678901n)\",\n JsBigInt::from(-1),\n ),\n TestAction::assert_eq(\n \"BigInt.asIntN(2, -123456789012345678900n)\",\n JsBigInt::from(0),\n ),\n TestAction::assert_eq(\n \"BigInt.asIntN(2, 123456789012345678900n)\",\n JsBigInt::from(0),\n ),\n TestAction::assert_eq(\n \"BigInt.asIntN(2, 123456789012345678901n)\",\n JsBigInt::from(1),\n ),\n TestAction::assert_eq(\n \"BigInt.asIntN(200, 0xcffffffffffffffffffffffffffffffffffffffffffffffffffn)\",\n JsBigInt::from(-1),\n ),\n TestAction::assert_eq(\n \"BigInt.asIntN(201, 0xcffffffffffffffffffffffffffffffffffffffffffffffffffn)\",\n JsBigInt::from_string(\"1606938044258990275541962092341162602522202993782792835301375\")\n .unwrap(),\n ),\n TestAction::assert_eq(\n \"BigInt.asIntN(200, 0xc89e081df68b65fedb32cffea660e55df9605650a603ad5fc54n)\",\n JsBigInt::from_string(\"-741470203160010616172516490008037905920749803227695190508460\")\n .unwrap(),\n ),\n TestAction::assert_eq(\n \"BigInt.asIntN(201, 0xc89e081df68b65fedb32cffea660e55df9605650a603ad5fc54n)\",\n JsBigInt::from_string(\"865467841098979659369445602333124696601453190555097644792916\")\n .unwrap(),\n ),\n ]);\n}\n\n#[test]\nfn as_int_n_errors() {\n run_test_actions([\n TestAction::assert_native_error(\n \"BigInt.asIntN(-1, 0n)\",\n JsNativeErrorKind::Range,\n \"Index must be between 0 and 2^53 - 1\",\n ),\n TestAction::assert_native_error(\n \"BigInt.asIntN(-2.5, 0n)\",\n JsNativeErrorKind::Range,\n \"Index must be between 0 and 2^53 - 1\",\n ),\n TestAction::assert_native_error(\n \"BigInt.asIntN(9007199254740992, 0n)\",\n JsNativeErrorKind::Range,\n \"Index must be between 0 and 2^53 - 1\",\n ),\n TestAction::assert_native_error(\n \"BigInt.asIntN(0n, 0n)\",\n JsNativeErrorKind::Type,\n \"argument must not be a bigint\",\n ),\n ]);\n}\n\n#[test]\nfn as_uint_n() {\n run_test_actions([\n TestAction::assert_eq(\"BigInt.asUintN(0, -2n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asUintN(0, -1n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asUintN(0, 0n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asUintN(0, 1n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asUintN(0, 2n)\", JsBigInt::from(0)),\n //\n TestAction::assert_eq(\"BigInt.asUintN(1, -3n)\", JsBigInt::from(1)),\n TestAction::assert_eq(\"BigInt.asUintN(1, -2n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asUintN(1, -1n)\", JsBigInt::from(1)),\n TestAction::assert_eq(\"BigInt.asUintN(1, 0n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asUintN(1, 1n)\", JsBigInt::from(1)),\n TestAction::assert_eq(\"BigInt.asUintN(1, 2n)\", JsBigInt::from(0)),\n TestAction::assert_eq(\"BigInt.asUintN(1, 3n)\", JsBigInt::from(1)),\n //\n TestAction::assert_eq(\n \"BigInt.asUintN(1, -123456789012345678901n)\",\n JsBigInt::from(1),\n ),\n TestAction::assert_eq(\n \"BigInt.asUintN(1, -123456789012345678900n)\",\n JsBigInt::from(0),\n ),\n TestAction::assert_eq(\n \"BigInt.asUintN(1, 123456789012345678900n)\",\n JsBigInt::from(0),\n ),\n TestAction::assert_eq(\n \"BigInt.asUintN(1, 123456789012345678901n)\",\n JsBigInt::from(1),\n ),\n //\n TestAction::assert_eq(\n \"BigInt.asUintN(200, 0xbffffffffffffffffffffffffffffffffffffffffffffffffffn)\",\n JsBigInt::from_string(\"1606938044258990275541962092341162602522202993782792835301375\")\n .unwrap(),\n ),\n TestAction::assert_eq(\n \"BigInt.asUintN(201, 0xbffffffffffffffffffffffffffffffffffffffffffffffffffn)\",\n JsBigInt::from_string(\"3213876088517980551083924184682325205044405987565585670602751\")\n .unwrap(),\n ),\n ]);\n}\n\n#[test]\nfn as_uint_n_errors() {\n run_test_actions([\n TestAction::assert_native_error(\n \"BigInt.asUintN(-1, 0n)\",\n JsNativeErrorKind::Range,\n \"Index must be between 0 and 2^53 - 1\",\n ),\n TestAction::assert_native_error(\n \"BigInt.asUintN(-2.5, 0n)\",\n JsNativeErrorKind::Range,\n \"Index must be between 0 and 2^53 - 1\",\n ),\n TestAction::assert_native_error(\n \"BigInt.asUintN(9007199254740992, 0n)\",\n JsNativeErrorKind::Range,\n \"Index must be between 0 and 2^53 - 1\",\n ),\n TestAction::assert_native_error(\n \"BigInt.asUintN(0n, 0n)\",\n JsNativeErrorKind::Type,\n \"argument must not be a bigint\",\n ),\n ]);\n}\n" }, { "path": "core/engine/src/builtins/boolean/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `Boolean` object.\n//!\n//! The `Boolean` object is an object wrapper for a boolean value.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-boolean-object\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Boolean\n\n#[cfg(test)]\nmod tests;\n\nuse crate::{\n Context, JsResult, JsString, JsValue,\n builtins::BuiltInObject,\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::JsNativeError,\n js_string,\n object::{JsObject, internal_methods::get_prototype_from_constructor},\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{BuiltInBuilder, BuiltInConstructor, IntrinsicObject};\n\n/// Boolean implementation.\n#[derive(Debug, Clone, Copy)]\npub(crate) struct Boolean;\n\nimpl IntrinsicObject for Boolean {\n fn init(realm: &Realm) {\n BuiltInBuilder::from_standard_constructor::(realm)\n .method(Self::to_string, js_string!(\"toString\"), 0)\n .method(Self::value_of, js_string!(\"valueOf\"), 0)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for Boolean {\n const NAME: JsString = StaticJsStrings::BOOLEAN;\n}\n\nimpl BuiltInConstructor for Boolean {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::boolean;\n\n /// `[[Construct]]` Create a new boolean object\n ///\n /// `[[Call]]` Creates a new boolean primitive\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // Get the argument, if any\n let data = args.first().is_some_and(JsValue::to_boolean);\n if new_target.is_undefined() {\n return Ok(JsValue::new(data));\n }\n let prototype =\n get_prototype_from_constructor(new_target, StandardConstructors::boolean, context)?;\n let boolean =\n JsObject::from_proto_and_data_with_shared_shape(context.root_shape(), prototype, data);\n\n Ok(boolean.into())\n }\n}\n\nimpl Boolean {\n /// An Utility function used to get the internal `[[BooleanData]]`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-thisbooleanvalue\n fn this_boolean_value(value: &JsValue) -> JsResult {\n value\n .as_boolean()\n .or_else(|| {\n value\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n })\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"'this' is not a boolean\")\n .into()\n })\n }\n\n /// The `toString()` method returns a string representing the specified `Boolean` object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-boolean-object\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Boolean/toString\n #[allow(clippy::wrong_self_convention)]\n pub(crate) fn to_string(this: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n let boolean = Self::this_boolean_value(this)?;\n Ok(JsValue::new(if boolean {\n js_string!(\"true\")\n } else {\n js_string!(\"false\")\n }))\n }\n\n /// The `valueOf()` method returns the primitive value of a `Boolean` object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-boolean.prototype.valueof\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Boolean/valueOf\n pub(crate) fn value_of(this: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n Ok(JsValue::new(Self::this_boolean_value(this)?))\n }\n}\n" }, { "path": "core/engine/src/builtins/boolean/tests.rs", "content": "use crate::{TestAction, run_test_actions};\nuse indoc::indoc;\n\n/// Test the correct type is returned from call and construct\n#[test]\nfn construct_and_call() {\n run_test_actions([\n TestAction::assert_with_op(\"new Boolean(1)\", |val, _| val.is_object()),\n TestAction::assert_with_op(\"Boolean(0)\", |val, _| val.is_boolean()),\n ]);\n}\n\n#[test]\nfn constructor_gives_true_instance() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n var trueVal = new Boolean(true);\n var trueNum = new Boolean(1);\n var trueString = new Boolean(\"true\");\n var trueBool = new Boolean(trueVal);\n \"#}),\n // Values should all be objects\n TestAction::assert_with_op(\"trueVal\", |val, _| val.is_object()),\n TestAction::assert_with_op(\"trueNum\", |val, _| val.is_object()),\n TestAction::assert_with_op(\"trueString\", |val, _| val.is_object()),\n TestAction::assert_with_op(\"trueBool\", |val, _| val.is_object()),\n // Values should all be truthy\n TestAction::assert(\"trueVal.valueOf()\"),\n TestAction::assert(\"trueNum.valueOf()\"),\n TestAction::assert(\"trueString.valueOf()\"),\n TestAction::assert(\"trueBool.valueOf()\"),\n ]);\n}\n\n#[test]\nfn instances_have_correct_proto_set() {\n run_test_actions([TestAction::assert(\n \"Object.getPrototypeOf(new Boolean(true)) === Boolean.prototype\",\n )]);\n}\n" }, { "path": "core/engine/src/builtins/builder.rs", "content": "use crate::{\n JsObject, JsString, JsValue, NativeFunction, js_string,\n native_function::{NativeFunctionObject, NativeFunctionPointer},\n object::{\n CONSTRUCTOR, FunctionBinding, JsFunction, JsPrototype, PROTOTYPE,\n shape::{property_table::PropertyTableInner, slot::SlotAttributes},\n },\n property::{Attribute, PropertyDescriptor, PropertyKey},\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{BuiltInConstructor, IntrinsicObject, function::ConstructorKind};\n\n/// Marker for a constructor function.\n// TODO: Remove this marker and use `Constructor` directly.\n#[allow(dead_code)]\npub(crate) struct Constructor {\n prototype: JsObject,\n inherits: JsPrototype,\n attributes: Attribute,\n}\n\n/// Marker for a constructor function without a custom prototype for its instances.\n// TODO: Remove this marker and use `ConstructorNoProto` directly.\n#[allow(dead_code)]\npub(crate) struct ConstructorNoProto;\n\n/// Marker for an ordinary function.\npub(crate) struct OrdinaryFunction;\n\n/// Indicates if the marker is a constructor.\npub(crate) trait IsConstructor {\n const IS_CONSTRUCTOR: bool;\n}\n\nimpl IsConstructor for Constructor {\n const IS_CONSTRUCTOR: bool = true;\n}\n\nimpl IsConstructor for ConstructorNoProto {\n const IS_CONSTRUCTOR: bool = true;\n}\n\nimpl IsConstructor for OrdinaryFunction {\n const IS_CONSTRUCTOR: bool = false;\n}\n\n/// Marker for a callable object.\npub(crate) struct Callable {\n function: NativeFunctionPointer,\n name: JsString,\n length: usize,\n kind: Kind,\n realm: Realm,\n}\n\n/// Marker for an ordinary object.\npub(crate) struct OrdinaryObject;\n\n/// Applies the pending builder data to the object.\npub(crate) trait ApplyToObject {\n fn apply_to(self, object: &JsObject);\n}\n\nimpl ApplyToObject for Constructor {\n fn apply_to(self, object: &JsObject) {\n object.insert(\n PROTOTYPE,\n PropertyDescriptor::builder()\n .value(self.prototype.clone())\n .writable(false)\n .enumerable(false)\n .configurable(false),\n );\n\n {\n let mut prototype = self.prototype.borrow_mut();\n prototype.set_prototype(self.inherits);\n prototype.insert(\n CONSTRUCTOR,\n PropertyDescriptor::builder()\n .value(object.clone())\n .writable(self.attributes.writable())\n .enumerable(self.attributes.enumerable())\n .configurable(self.attributes.configurable()),\n );\n }\n }\n}\n\nimpl ApplyToObject for ConstructorNoProto {\n fn apply_to(self, _: &JsObject) {}\n}\n\nimpl ApplyToObject for OrdinaryFunction {\n fn apply_to(self, _: &JsObject) {}\n}\n\nimpl ApplyToObject for Callable {\n fn apply_to(self, object: &JsObject) {\n {\n let mut function = object\n .downcast_mut::()\n .expect(\"Builtin must be a function object\");\n function.f = NativeFunction::from_fn_ptr(self.function);\n function.constructor = S::IS_CONSTRUCTOR.then_some(ConstructorKind::Base);\n function.realm = Some(self.realm);\n }\n object.insert(\n StaticJsStrings::LENGTH,\n PropertyDescriptor::builder()\n .value(self.length)\n .writable(false)\n .enumerable(false)\n .configurable(true),\n );\n object.insert(\n js_string!(\"name\"),\n PropertyDescriptor::builder()\n .value(self.name)\n .writable(false)\n .enumerable(false)\n .configurable(true),\n );\n\n self.kind.apply_to(object);\n }\n}\n\nimpl ApplyToObject for OrdinaryObject {\n fn apply_to(self, _: &JsObject) {}\n}\n\n/// Builder for creating built-in objects, like `Array`.\n///\n/// The marker `ObjectType` restricts the methods that can be called depending on the\n/// type of object that is being constructed.\n#[derive(Debug)]\n#[must_use = \"You need to call the `build` method in order for this to correctly assign the inner data\"]\npub(crate) struct BuiltInBuilder<'ctx, Kind> {\n realm: &'ctx Realm,\n object: JsObject,\n kind: Kind,\n prototype: JsObject,\n}\n\nimpl<'ctx> BuiltInBuilder<'ctx, OrdinaryObject> {\n pub(crate) fn with_intrinsic(\n realm: &'ctx Realm,\n ) -> BuiltInBuilder<'ctx, OrdinaryObject> {\n BuiltInBuilder {\n realm,\n object: I::get(realm.intrinsics()),\n kind: OrdinaryObject,\n prototype: realm.intrinsics().constructors().object().prototype(),\n }\n }\n}\n\npub(crate) struct BuiltInConstructorWithPrototype<'ctx> {\n realm: &'ctx Realm,\n function: NativeFunctionPointer,\n name: JsString,\n length: usize,\n\n constructor_property_table: PropertyTableInner,\n constructor_storage: Vec,\n constructor: JsObject,\n #[cfg(debug_assertions)]\n constructor_storage_slots_expected: usize,\n\n prototype_property_table: PropertyTableInner,\n prototype_storage: Vec,\n prototype: JsObject,\n #[cfg(debug_assertions)]\n prototype_storage_slots_expected: usize,\n __proto__: JsPrototype,\n inherits: Option,\n attributes: Attribute,\n /// If `Some`, the `constructor` property on the prototype will be installed\n /// as a get/set accessor pair instead of as a writable data property.\n /// This is needed by `Iterator.prototype.constructor` per the spec\n /// (web-compat requirement).\n constructor_accessor: Option<(JsFunction, JsFunction)>,\n}\n\n#[allow(dead_code)]\nimpl BuiltInConstructorWithPrototype<'_> {\n /// The number of storage slots that are always present in a standard\n /// constructor object.\n ///\n /// See [`BuiltInConstructorWithPrototype::build`].\n const OWN_CONSTRUCTOR_STORAGE_SLOTS: usize = 3;\n\n /// The number of storage slots properties that are always present in a\n /// standard constructor's prototype object when `constructor` is a **data** property.\n ///\n /// See [`BuiltInConstructorWithPrototype::build`].\n const OWN_PROTOTYPE_STORAGE_SLOTS: usize = 1;\n\n /// The number of storage slots properties that are always present in a\n /// standard constructor's prototype object when `constructor` is installed\n /// as a get/set **accessor** property (two slots: getter + setter).\n ///\n /// See [`BuiltInConstructorWithPrototype::constructor_accessor`].\n const OWN_PROTOTYPE_STORAGE_SLOTS_ACCESSOR: usize = 2;\n\n /// Specify how many arguments the constructor function takes.\n ///\n /// Default is `0`.\n #[inline]\n pub(crate) const fn length(mut self, length: usize) -> Self {\n self.length = length;\n self\n }\n\n /// Specify the name of the constructor function.\n ///\n /// Default is `\"\"`\n pub(crate) fn name(mut self, name: JsString) -> Self {\n self.name = name;\n self\n }\n\n /// Adds a new static method to the builtin object.\n pub(crate) fn static_method(\n mut self,\n function: NativeFunctionPointer,\n binding: B,\n length: usize,\n ) -> Self\n where\n B: Into,\n {\n let binding = binding.into();\n let function = BuiltInBuilder::callable(self.realm, function)\n .name(binding.name)\n .length(length)\n .build();\n\n debug_assert!(\n !self\n .constructor_property_table\n .map\n .contains_key(&binding.binding)\n );\n self.constructor_property_table.insert(\n binding.binding,\n SlotAttributes::WRITABLE | SlotAttributes::CONFIGURABLE,\n );\n self.constructor_storage.push(function.into());\n self\n }\n\n /// Adds a new static data property to the builtin object.\n pub(crate) fn static_property(mut self, key: K, value: V, attribute: Attribute) -> Self\n where\n K: Into,\n V: Into,\n {\n let key = key.into();\n\n debug_assert!(!self.constructor_property_table.map.contains_key(&key));\n self.constructor_property_table\n .insert(key, SlotAttributes::from_bits_truncate(attribute.bits()));\n self.constructor_storage.push(value.into());\n self\n }\n\n /// Adds a new static accessor property to the builtin object.\n pub(crate) fn static_accessor(\n mut self,\n key: K,\n get: Option,\n set: Option,\n attribute: Attribute,\n ) -> Self\n where\n K: Into,\n {\n let mut attributes = SlotAttributes::from_bits_truncate(attribute.bits());\n debug_assert!(!attributes.contains(SlotAttributes::WRITABLE));\n attributes.set(SlotAttributes::GET, get.is_some());\n attributes.set(SlotAttributes::SET, set.is_some());\n\n let key = key.into();\n\n debug_assert!(!self.constructor_property_table.map.contains_key(&key));\n self.constructor_property_table.insert(key, attributes);\n self.constructor_storage.extend([\n get.map(JsValue::new).unwrap_or_default(),\n set.map(JsValue::new).unwrap_or_default(),\n ]);\n self\n }\n\n /// Specify the `[[Prototype]]` internal field of the builtin object.\n ///\n /// Default is `Function.prototype` for constructors and `Object.prototype` for statics.\n pub(crate) fn prototype(mut self, prototype: JsObject) -> Self {\n self.__proto__ = Some(prototype);\n self\n }\n\n /// Adds a new method to the constructor's prototype.\n pub(crate) fn method(\n mut self,\n function: NativeFunctionPointer,\n binding: B,\n length: usize,\n ) -> Self\n where\n B: Into,\n {\n let binding = binding.into();\n let function = BuiltInBuilder::callable(self.realm, function)\n .name(binding.name)\n .length(length)\n .build();\n\n debug_assert!(\n !self\n .prototype_property_table\n .map\n .contains_key(&binding.binding)\n );\n self.prototype_property_table.insert(\n binding.binding,\n SlotAttributes::WRITABLE | SlotAttributes::CONFIGURABLE,\n );\n self.prototype_storage.push(function.into());\n self\n }\n\n /// Adds a new data property to the constructor's prototype.\n pub(crate) fn property(mut self, key: K, value: V, attribute: Attribute) -> Self\n where\n K: Into,\n V: Into,\n {\n let key = key.into();\n\n debug_assert!(!self.prototype_property_table.map.contains_key(&key));\n self.prototype_property_table\n .insert(key, SlotAttributes::from_bits_truncate(attribute.bits()));\n self.prototype_storage.push(value.into());\n self\n }\n\n /// Adds new accessor property to the constructor's prototype.\n pub(crate) fn accessor(\n mut self,\n key: K,\n get: Option,\n set: Option,\n attribute: Attribute,\n ) -> Self\n where\n K: Into,\n {\n let mut attributes = SlotAttributes::from_bits_truncate(attribute.bits());\n debug_assert!(!attributes.contains(SlotAttributes::WRITABLE));\n attributes.set(SlotAttributes::GET, get.is_some());\n attributes.set(SlotAttributes::SET, set.is_some());\n\n let key = key.into();\n\n debug_assert!(!self.prototype_property_table.map.contains_key(&key));\n self.prototype_property_table.insert(key, attributes);\n self.prototype_storage.extend([\n get.map(JsValue::new).unwrap_or_default(),\n set.map(JsValue::new).unwrap_or_default(),\n ]);\n self\n }\n\n /// Specifies the parent prototype which objects created by this constructor inherit from.\n ///\n /// Default is `Object.prototype`.\n #[allow(clippy::missing_const_for_fn)]\n pub(crate) fn inherits(mut self, prototype: JsPrototype) -> Self {\n self.inherits = prototype;\n self\n }\n\n /// Specifies the property attributes of the prototype's \"constructor\" property.\n pub(crate) const fn constructor_attributes(mut self, attributes: Attribute) -> Self {\n self.attributes = attributes;\n self\n }\n\n /// Installs `Iterator.prototype.constructor` (or any analogous property) as a\n /// configurable, non-enumerable **accessor** descriptor instead of the default\n /// writable data property.\n ///\n /// Per the [ECMAScript spec][spec], `Iterator.prototype.constructor` must be an\n /// accessor for web-compatibility reasons: previously the property did not exist, so\n /// making it a setter that ignores writes to the prototype avoids breaking existing code\n /// that assigns `Iterator.prototype.constructor = ...`.\n ///\n /// When this method is called the `PROTOTYPE_STORAGE_SLOTS` constant on the\n /// implementing built-in **must** account for two extra slots (getter + setter)\n /// instead of the usual one slot for a data property.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-iterator.prototype.constructor\n pub(crate) fn constructor_accessor(mut self, get: JsFunction, set: JsFunction) -> Self {\n self.constructor_accessor = Some((get, set));\n self\n }\n\n #[track_caller]\n pub(crate) fn build(mut self) {\n let length = self.length;\n let name = self.name.clone();\n let prototype = self.prototype.clone();\n self = self.static_property(js_string!(\"length\"), length, Attribute::CONFIGURABLE);\n self = self.static_property(js_string!(\"name\"), name, Attribute::CONFIGURABLE);\n self = self.static_property(PROTOTYPE, prototype, Attribute::empty());\n\n // Install the `constructor` property on the prototype — either as a writable\n // data property (the common case) or as a get/set accessor (needed by\n // `Iterator.prototype.constructor` for web-compat, see `constructor_accessor`).\n if let Some((get, set)) = self.constructor_accessor.take() {\n // Accessor path: two storage slots (getter + setter). The `CONSTRUCTOR` key\n // must NOT already be present (no duplicate insertion).\n let mut attributes = SlotAttributes::CONFIGURABLE;\n attributes.set(SlotAttributes::GET, true);\n attributes.set(SlotAttributes::SET, true);\n debug_assert!(\n !self\n .prototype_property_table\n .map\n .contains_key(&CONSTRUCTOR.into())\n );\n self.prototype_property_table\n .insert(CONSTRUCTOR.into(), attributes);\n self.prototype_storage\n .extend([JsValue::new(get), JsValue::new(set)]);\n #[cfg(debug_assertions)]\n assert!(\n self.prototype_storage.len()\n <= self.prototype_storage_slots_expected\n + Self::OWN_PROTOTYPE_STORAGE_SLOTS_ACCESSOR,\n \"expected to allocate at most {} prototype storage slots, got {}. \\\n constant {}::PROTOTYPE_STORAGE_SLOTS may need to be adjusted\",\n self.prototype_storage_slots_expected,\n self.prototype_storage.len() - Self::OWN_PROTOTYPE_STORAGE_SLOTS_ACCESSOR,\n self.name.display_escaped(),\n );\n } else {\n // Data property path (the default).\n let attributes = self.attributes;\n let object = self.constructor.clone();\n self = self.property(CONSTRUCTOR, object, attributes);\n #[cfg(debug_assertions)]\n assert!(\n self.prototype_storage.len()\n <= self.prototype_storage_slots_expected + Self::OWN_PROTOTYPE_STORAGE_SLOTS,\n \"expected to allocate at most {} prototype storage slots, got {}. \\\n constant {}::PROTOTYPE_STORAGE_SLOTS may need to be adjusted\",\n self.prototype_storage_slots_expected,\n self.prototype_storage.len() - Self::OWN_PROTOTYPE_STORAGE_SLOTS,\n self.name.display_escaped(),\n );\n }\n\n #[cfg(debug_assertions)]\n assert!(\n self.constructor_storage.len()\n <= self.constructor_storage_slots_expected + Self::OWN_CONSTRUCTOR_STORAGE_SLOTS,\n \"expected to allocate at most {} constructor storage slots, got {}. \\\n constant {}::CONSTRUCTOR_STORAGE_SLOTS may need to be adjusted\",\n self.constructor_storage_slots_expected,\n self.constructor_storage.len() - Self::OWN_CONSTRUCTOR_STORAGE_SLOTS,\n self.name.display_escaped(),\n );\n\n {\n let mut prototype = self.prototype.borrow_mut();\n prototype\n .properties_mut()\n .shape\n .as_unique()\n .expect(\"The object should have a unique shape\")\n .override_internal(self.prototype_property_table, self.inherits);\n\n let prototype_old_storage = std::mem::replace(\n &mut prototype.properties_mut().storage,\n self.prototype_storage,\n );\n\n debug_assert_eq!(prototype_old_storage.len(), 0);\n }\n\n {\n let mut function = self\n .constructor\n .downcast_mut::()\n .expect(\"Builtin must be a function object\");\n function.f = NativeFunction::from_fn_ptr(self.function);\n function.constructor = Some(ConstructorKind::Base);\n function.realm = Some(self.realm.clone());\n }\n\n let mut object = self.constructor.borrow_mut();\n object\n .properties_mut()\n .shape\n .as_unique()\n .expect(\"The object should have a unique shape\")\n .override_internal(self.constructor_property_table, self.__proto__);\n\n let object_old_storage = std::mem::replace(\n &mut object.properties_mut().storage,\n self.constructor_storage,\n );\n\n debug_assert_eq!(object_old_storage.len(), 0);\n }\n\n pub(crate) fn build_without_prototype(mut self) {\n let length = self.length;\n let name = self.name.clone();\n self = self.static_property(js_string!(\"length\"), length, Attribute::CONFIGURABLE);\n self = self.static_property(js_string!(\"name\"), name, Attribute::CONFIGURABLE);\n\n {\n let mut function = self\n .constructor\n .downcast_mut::()\n .expect(\"Builtin must be a function object\");\n function.f = NativeFunction::from_fn_ptr(self.function);\n function.constructor = Some(ConstructorKind::Base);\n function.realm = Some(self.realm.clone());\n }\n\n let mut object = self.constructor.borrow_mut();\n object\n .properties_mut()\n .shape\n .as_unique()\n .expect(\"The object should have a unique shape\")\n .override_internal(self.constructor_property_table, self.__proto__);\n\n let object_old_storage = std::mem::replace(\n &mut object.properties_mut().storage,\n self.constructor_storage,\n );\n\n debug_assert_eq!(object_old_storage.len(), 0);\n }\n}\n\npub(crate) struct BuiltInCallable<'ctx> {\n realm: &'ctx Realm,\n function: NativeFunctionPointer,\n name: JsString,\n length: usize,\n}\n\nimpl BuiltInCallable<'_> {\n /// Specify how many arguments the constructor function takes.\n ///\n /// Default is `0`.\n #[inline]\n pub(crate) const fn length(mut self, length: usize) -> Self {\n self.length = length;\n self\n }\n\n /// Specify the name of the constructor function.\n ///\n /// Default is `\"\"`\n pub(crate) fn name(mut self, name: JsString) -> Self {\n self.name = name;\n self\n }\n\n pub(crate) fn build(self) -> JsFunction {\n let object = self.realm.intrinsics().templates().function().create(\n NativeFunctionObject {\n f: NativeFunction::from_fn_ptr(self.function),\n name: self.name.clone(),\n constructor: None,\n realm: Some(self.realm.clone()),\n },\n vec![JsValue::new(self.length), JsValue::new(self.name)],\n );\n\n JsFunction::from_object_unchecked(object)\n }\n}\n\nimpl<'ctx> BuiltInBuilder<'ctx, OrdinaryObject> {\n pub(crate) fn callable(\n realm: &'ctx Realm,\n function: NativeFunctionPointer,\n ) -> BuiltInCallable<'ctx> {\n BuiltInCallable {\n realm,\n function,\n length: 0,\n name: js_string!(),\n }\n }\n\n pub(crate) fn callable_with_intrinsic(\n realm: &'ctx Realm,\n function: NativeFunctionPointer,\n ) -> BuiltInBuilder<'ctx, Callable> {\n BuiltInBuilder {\n realm,\n object: I::get(realm.intrinsics()),\n kind: Callable {\n function,\n name: js_string!(),\n length: 0,\n kind: OrdinaryFunction,\n realm: realm.clone(),\n },\n prototype: realm.intrinsics().constructors().function().prototype(),\n }\n }\n\n pub(crate) fn callable_with_object(\n realm: &'ctx Realm,\n object: JsObject,\n function: NativeFunctionPointer,\n ) -> BuiltInBuilder<'ctx, Callable> {\n BuiltInBuilder {\n realm,\n object,\n kind: Callable {\n function,\n name: js_string!(),\n length: 0,\n kind: OrdinaryFunction,\n realm: realm.clone(),\n },\n prototype: realm.intrinsics().constructors().function().prototype(),\n }\n }\n}\n\nimpl<'ctx> BuiltInBuilder<'ctx, Callable> {\n /// Create a new builder for a constructor function.\n ///\n /// This sets the properties ahead of time for optimizations\n /// (less reallocations).\n pub(crate) fn from_standard_constructor(\n realm: &'ctx Realm,\n ) -> BuiltInConstructorWithPrototype<'ctx> {\n let constructor = SC::STANDARD_CONSTRUCTOR(realm.intrinsics().constructors());\n BuiltInConstructorWithPrototype {\n realm,\n function: SC::constructor,\n name: js_string!(SC::NAME),\n length: SC::CONSTRUCTOR_ARGUMENTS,\n constructor_property_table: PropertyTableInner::with_capacity(\n SC::CONSTRUCTOR_STORAGE_SLOTS\n + BuiltInConstructorWithPrototype::OWN_CONSTRUCTOR_STORAGE_SLOTS,\n ),\n constructor_storage: Vec::with_capacity(\n SC::CONSTRUCTOR_STORAGE_SLOTS\n + BuiltInConstructorWithPrototype::OWN_CONSTRUCTOR_STORAGE_SLOTS,\n ),\n constructor: constructor.constructor(),\n #[cfg(debug_assertions)]\n constructor_storage_slots_expected: SC::CONSTRUCTOR_STORAGE_SLOTS,\n prototype_property_table: PropertyTableInner::with_capacity(\n SC::PROTOTYPE_STORAGE_SLOTS\n + BuiltInConstructorWithPrototype::OWN_PROTOTYPE_STORAGE_SLOTS,\n ),\n prototype_storage: Vec::with_capacity(\n SC::PROTOTYPE_STORAGE_SLOTS\n + BuiltInConstructorWithPrototype::OWN_PROTOTYPE_STORAGE_SLOTS,\n ),\n prototype: constructor.prototype(),\n #[cfg(debug_assertions)]\n prototype_storage_slots_expected: SC::PROTOTYPE_STORAGE_SLOTS,\n __proto__: Some(realm.intrinsics().constructors().function().prototype()),\n inherits: Some(realm.intrinsics().constructors().object().prototype()),\n attributes: Attribute::WRITABLE | Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE,\n constructor_accessor: None,\n }\n }\n}\n\nimpl BuiltInBuilder<'_, T> {\n /// Adds a new static method to the builtin object.\n pub(crate) fn static_method(\n self,\n function: NativeFunctionPointer,\n binding: B,\n length: usize,\n ) -> Self\n where\n B: Into,\n {\n let binding = binding.into();\n let function = BuiltInBuilder::callable(self.realm, function)\n .name(binding.name)\n .length(length)\n .build();\n\n self.object.insert(\n binding.binding,\n PropertyDescriptor::builder()\n .value(function)\n .writable(true)\n .enumerable(false)\n .configurable(true),\n );\n self\n }\n\n /// Adds a new static data property to the builtin object.\n pub(crate) fn static_property(self, key: K, value: V, attribute: Attribute) -> Self\n where\n K: Into,\n V: Into,\n {\n let property = PropertyDescriptor::builder()\n .value(value)\n .writable(attribute.writable())\n .enumerable(attribute.enumerable())\n .configurable(attribute.configurable());\n self.object.insert(key, property);\n self\n }\n\n /// Specify the `[[Prototype]]` internal field of the builtin object.\n ///\n /// Default is `Function.prototype` for constructors and `Object.prototype` for statics.\n pub(crate) fn prototype(mut self, prototype: JsObject) -> Self {\n self.prototype = prototype;\n self\n }\n}\n\nimpl BuiltInBuilder<'_, Callable> {\n /// Specify how many arguments the constructor function takes.\n ///\n /// Default is `0`.\n #[inline]\n pub(crate) const fn length(mut self, length: usize) -> Self {\n self.kind.length = length;\n self\n }\n\n /// Specify the name of the constructor function.\n ///\n /// Default is `\"\"`\n pub(crate) fn name(mut self, name: JsString) -> Self {\n self.kind.name = name;\n self\n }\n}\n\nimpl BuiltInBuilder<'_, OrdinaryObject> {\n /// Build the builtin object.\n pub(crate) fn build(self) -> JsObject {\n self.kind.apply_to(&self.object);\n\n self.object.set_prototype(Some(self.prototype));\n\n self.object\n }\n}\n\nimpl BuiltInBuilder<'_, Callable> {\n /// Build the builtin callable.\n pub(crate) fn build(self) -> JsFunction {\n self.kind.apply_to(&self.object);\n\n self.object.set_prototype(Some(self.prototype));\n\n JsFunction::from_object_unchecked(self.object)\n }\n}\n" }, { "path": "core/engine/src/builtins/dataview/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `DataView` object.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-dataview-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView\n\nuse std::sync::atomic::Ordering;\n\nuse crate::{\n Context, JsArgs, JsData, JsResult, JsString,\n builtins::BuiltInObject,\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::JsNativeError,\n js_string,\n object::{JsObject, internal_methods::get_prototype_from_constructor},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::JsValue,\n};\nuse boa_gc::{Finalize, Trace};\nuse bytemuck::{bytes_of, bytes_of_mut};\n\nuse super::{\n BuiltInBuilder, BuiltInConstructor, IntrinsicObject,\n array_buffer::{\n BufferObject,\n utils::{BytesConstPtr, BytesMutPtr, memcpy},\n },\n typed_array::{self, TypedArrayElement},\n};\n\n/// The internal representation of a `DataView` object.\n#[derive(Debug, Clone, Trace, Finalize, JsData)]\npub struct DataView {\n pub(crate) viewed_array_buffer: BufferObject,\n pub(crate) byte_length: Option,\n pub(crate) byte_offset: u64,\n}\n\nimpl DataView {\n /// Abstract operation [`GetViewByteLength ( viewRecord )`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-getviewbytelength\n fn byte_length(&self, buf_byte_len: usize) -> u64 {\n // 1. Assert: IsViewOutOfBounds(viewRecord) is false.\n debug_assert!(!self.is_out_of_bounds(buf_byte_len));\n\n // 2. Let view be viewRecord.[[Object]].\n // 3. If view.[[ByteLength]] is not auto, return view.[[ByteLength]].\n if let Some(byte_length) = self.byte_length {\n return byte_length;\n }\n\n // 4. Assert: IsFixedLengthArrayBuffer(view.[[ViewedArrayBuffer]]) is false.\n\n // 5. Let byteOffset be view.[[ByteOffset]].\n // 6. Let byteLength be viewRecord.[[CachedBufferByteLength]].\n // 7. Assert: byteLength is not detached.\n // 8. Return byteLength - byteOffset.\n buf_byte_len as u64 - self.byte_offset\n }\n\n /// Abstract operation [`IsViewOutOfBounds ( viewRecord )`][spec].\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-isviewoutofbounds\n fn is_out_of_bounds(&self, buf_byte_len: usize) -> bool {\n let buf_byte_len = buf_byte_len as u64;\n // 1. Let view be viewRecord.[[Object]].\n // 2. Let bufferByteLength be viewRecord.[[CachedBufferByteLength]].\n // 3. Assert: IsDetachedBuffer(view.[[ViewedArrayBuffer]]) is true if and only if bufferByteLength is detached.\n // 4. If bufferByteLength is detached, return true.\n // handled by the caller\n\n // 5. Let byteOffsetStart be view.[[ByteOffset]].\n\n // 6. If view.[[ByteLength]] is auto, then\n // a. Let byteOffsetEnd be bufferByteLength.\n // 7. Else,\n // a. Let byteOffsetEnd be byteOffsetStart + view.[[ByteLength]].\n let byte_offset_end = self\n .byte_length\n .map_or(buf_byte_len, |byte_length| byte_length + self.byte_offset);\n\n // 8. If byteOffsetStart > bufferByteLength or byteOffsetEnd > bufferByteLength, return true.\n // 9. NOTE: 0-length DataViews are not considered out-of-bounds.\n // 10. Return false.\n self.byte_offset > buf_byte_len || byte_offset_end > buf_byte_len\n }\n}\n\nimpl IntrinsicObject for DataView {\n fn init(realm: &Realm) {\n let flag_attributes = Attribute::CONFIGURABLE | Attribute::NON_ENUMERABLE;\n\n let get_buffer = BuiltInBuilder::callable(realm, Self::get_buffer)\n .name(js_string!(\"get buffer\"))\n .build();\n\n let get_byte_length = BuiltInBuilder::callable(realm, Self::get_byte_length)\n .name(js_string!(\"get byteLength\"))\n .build();\n\n let get_byte_offset = BuiltInBuilder::callable(realm, Self::get_byte_offset)\n .name(js_string!(\"get byteOffset\"))\n .build();\n\n let builder = BuiltInBuilder::from_standard_constructor::(realm)\n .accessor(\n js_string!(\"buffer\"),\n Some(get_buffer),\n None,\n flag_attributes,\n )\n .accessor(\n js_string!(\"byteLength\"),\n Some(get_byte_length),\n None,\n flag_attributes,\n )\n .accessor(\n js_string!(\"byteOffset\"),\n Some(get_byte_offset),\n None,\n flag_attributes,\n )\n .method(Self::get_big_int64, js_string!(\"getBigInt64\"), 1)\n .method(Self::get_big_uint64, js_string!(\"getBigUint64\"), 1)\n .method(Self::get_float32, js_string!(\"getFloat32\"), 1)\n .method(Self::get_float64, js_string!(\"getFloat64\"), 1)\n .method(Self::get_int8, js_string!(\"getInt8\"), 1)\n .method(Self::get_int16, js_string!(\"getInt16\"), 1)\n .method(Self::get_int32, js_string!(\"getInt32\"), 1)\n .method(Self::get_uint8, js_string!(\"getUint8\"), 1)\n .method(Self::get_uint16, js_string!(\"getUint16\"), 1)\n .method(Self::get_uint32, js_string!(\"getUint32\"), 1)\n .method(Self::set_big_int64, js_string!(\"setBigInt64\"), 2)\n .method(Self::set_big_uint64, js_string!(\"setBigUint64\"), 2)\n .method(Self::set_float32, js_string!(\"setFloat32\"), 2)\n .method(Self::set_float64, js_string!(\"setFloat64\"), 2)\n .method(Self::set_int8, js_string!(\"setInt8\"), 2)\n .method(Self::set_int16, js_string!(\"setInt16\"), 2)\n .method(Self::set_int32, js_string!(\"setInt32\"), 2)\n .method(Self::set_uint8, js_string!(\"setUint8\"), 2)\n .method(Self::set_uint16, js_string!(\"setUint16\"), 2)\n .method(Self::set_uint32, js_string!(\"setUint32\"), 2)\n .property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::READONLY | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n );\n\n #[cfg(feature = \"float16\")]\n let builder = builder\n .method(Self::get_float16, js_string!(\"getFloat16\"), 1)\n .method(Self::set_float16, js_string!(\"setFloat16\"), 2);\n\n builder.build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for DataView {\n const NAME: JsString = StaticJsStrings::DATA_VIEW;\n}\n\nimpl BuiltInConstructor for DataView {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 29;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::data_view;\n\n /// `DataView ( buffer [ , byteOffset [ , byteLength ] ] )`\n ///\n /// The `DataView` view provides a low-level interface for reading and writing multiple number\n /// types in a binary `ArrayBuffer`, without having to care about the platform's endianness.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview-buffer-byteoffset-bytelength\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/DataView\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, throw a TypeError exception.\n if new_target.is_undefined() {\n return Err(JsNativeError::typ()\n .with_message(\"cannot call `DataView` constructor without `new`\")\n .into());\n }\n let byte_len = args.get_or_undefined(2);\n\n // 2. Perform ? RequireInternalSlot(buffer, [[ArrayBufferData]]).\n let buffer = args\n .get_or_undefined(0)\n .as_object()\n .and_then(|o| o.clone().into_buffer_object().ok())\n .ok_or_else(|| JsNativeError::typ().with_message(\"buffer must be an ArrayBuffer\"))?;\n\n // 3. Let offset be ? ToIndex(byteOffset).\n let offset = args.get_or_undefined(1).to_index(context)?;\n\n let (buf_byte_len, is_fixed_len) = {\n let buffer = buffer.as_buffer();\n\n // 4. If IsDetachedBuffer(buffer) is true, throw a TypeError exception.\n let Some(slice) = buffer.bytes(Ordering::SeqCst) else {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer is detached\")\n .into());\n };\n\n // 5. Let bufferByteLength be ArrayBufferByteLength(buffer, seq-cst).\n let buf_len = slice.len() as u64;\n\n // 6. If offset > bufferByteLength, throw a RangeError exception.\n if offset > buf_len {\n return Err(JsNativeError::range()\n .with_message(\"Start offset is outside the bounds of the buffer\")\n .into());\n }\n\n // 7. Let bufferIsFixedLength be IsFixedLengthArrayBuffer(buffer).\n\n (buf_len, buffer.is_fixed_len())\n };\n\n // 8. If byteLength is undefined, then\n let view_byte_len = if byte_len.is_undefined() {\n // a. If bufferIsFixedLength is true, then\n // i. Let viewByteLength be bufferByteLength - offset.\n // b. Else,\n // i. Let viewByteLength be auto.\n is_fixed_len.then_some(buf_byte_len - offset)\n } else {\n // 9. Else,\n // a. Let viewByteLength be ? ToIndex(byteLength).\n let byte_len = byte_len.to_index(context)?;\n\n // b. If offset + viewByteLength > bufferByteLength, throw a RangeError exception.\n if offset + byte_len > buf_byte_len {\n return Err(JsNativeError::range()\n .with_message(\"Invalid data view length\")\n .into());\n }\n Some(byte_len)\n };\n\n // 10. Let O be ? OrdinaryCreateFromConstructor(NewTarget, \"%DataView.prototype%\",\n // « [[DataView]], [[ViewedArrayBuffer]], [[ByteLength]], [[ByteOffset]] »).\n let prototype =\n get_prototype_from_constructor(new_target, StandardConstructors::data_view, context)?;\n\n // 11. If IsDetachedBuffer(buffer) is true, throw a TypeError exception.\n // 12. Set bufferByteLength to ArrayBufferByteLength(buffer, seq-cst).\n let Some(buf_byte_len) = buffer\n .as_buffer()\n .bytes(Ordering::SeqCst)\n .map(|s| s.len() as u64)\n else {\n return Err(JsNativeError::typ()\n .with_message(\"ArrayBuffer can't be detached\")\n .into());\n };\n\n // 13. If offset > bufferByteLength, throw a RangeError exception.\n if offset > buf_byte_len {\n return Err(JsNativeError::range()\n .with_message(\"DataView offset outside of buffer array bounds\")\n .into());\n }\n\n // 14. If byteLength is not undefined, then\n // a. If offset + viewByteLength > bufferByteLength, throw a RangeError exception.\n if !byte_len.is_undefined()\n && let Some(view_byte_len) = view_byte_len\n && offset + view_byte_len > buf_byte_len\n {\n return Err(JsNativeError::range()\n .with_message(\"DataView offset outside of buffer array bounds\")\n .into());\n }\n\n let obj = JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n prototype,\n Self {\n // 15. Set O.[[ViewedArrayBuffer]] to buffer.\n viewed_array_buffer: buffer,\n // 16. Set O.[[ByteLength]] to viewByteLength.\n byte_length: view_byte_len,\n // 17. Set O.[[ByteOffset]] to offset.\n byte_offset: offset,\n },\n );\n\n // 18. Return O.\n Ok(obj.into())\n }\n}\n\nimpl DataView {\n /// `get DataView.prototype.buffer`\n ///\n /// The buffer accessor property represents the `ArrayBuffer` or `SharedArrayBuffer` referenced\n /// by the `DataView` at construction time.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-dataview.prototype.buffer\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/buffer\n pub(crate) fn get_buffer(\n this: &JsValue,\n _args: &[JsValue],\n _: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[DataView]]).\n let object = this.as_object();\n let view = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"`this` is not a DataView\"))?;\n // 3. Assert: O has a [[ViewedArrayBuffer]] internal slot.\n // 4. Let buffer be O.[[ViewedArrayBuffer]].\n let buffer = view.viewed_array_buffer.clone();\n // 5. Return buffer.\n Ok(buffer.into())\n }\n\n /// `get DataView.prototype.byteLength`\n ///\n /// The `byteLength` accessor property represents the length (in bytes) of the dataview.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-dataview.prototype.bytelength\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/byteLength\n pub(crate) fn get_byte_length(\n this: &JsValue,\n _args: &[JsValue],\n _: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[DataView]]).\n // 3. Assert: O has a [[ViewedArrayBuffer]] internal slot.\n let object = this.as_object();\n let view = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"`this` is not a DataView\"))?;\n\n // 4. Let viewRecord be MakeDataViewWithBufferWitnessRecord(O, seq-cst).\n // 5. If IsViewOutOfBounds(viewRecord) is true, throw a TypeError exception.\n let buffer = view.viewed_array_buffer.as_buffer();\n let Some(slice) = buffer\n .bytes(Ordering::SeqCst)\n .filter(|s| !view.is_out_of_bounds(s.len()))\n else {\n return Err(JsNativeError::typ()\n .with_message(\"view out of bounds for its inner buffer\")\n .into());\n };\n\n // 6. Let size be GetViewByteLength(viewRecord).\n let size = view.byte_length(slice.len());\n\n // 7. Return 𝔽(size).\n Ok(size.into())\n }\n\n /// `get DataView.prototype.byteOffset`\n ///\n /// The `byteOffset` accessor property represents the offset (in bytes) of this view from the\n /// start of its `ArrayBuffer` or `SharedArrayBuffer`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-get-dataview.prototype.byteoffset\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/byteOffset\n pub(crate) fn get_byte_offset(\n this: &JsValue,\n _args: &[JsValue],\n _: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. Perform ? RequireInternalSlot(O, [[DataView]]).\n let object = this.as_object();\n let view = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"`this` is not a DataView\"))?;\n\n // 3. Assert: O has a [[ViewedArrayBuffer]] internal slot.\n let buffer = view.viewed_array_buffer.as_buffer();\n // 4. Let viewRecord be MakeDataViewWithBufferWitnessRecord(O, seq-cst).\n // 5. If IsViewOutOfBounds(viewRecord) is true, throw a TypeError exception.\n if buffer\n .bytes(Ordering::SeqCst)\n .filter(|b| !view.is_out_of_bounds(b.len()))\n .is_none()\n {\n return Err(JsNativeError::typ()\n .with_message(\"data view is outside the bounds of its inner buffer\")\n .into());\n }\n\n // 6. Let offset be O.[[ByteOffset]].\n let offset = view.byte_offset;\n // 7. Return 𝔽(offset).\n Ok(offset.into())\n }\n\n /// `GetViewValue ( view, requestIndex, isLittleEndian, type )`\n ///\n /// The abstract operation `GetViewValue` takes arguments view, requestIndex, `isLittleEndian`,\n /// and type. It is used by functions on `DataView` instances to retrieve values from the\n /// view's buffer.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-getviewvalue\n fn get_view_value(\n view: &JsValue,\n request_index: &JsValue,\n is_little_endian: &JsValue,\n context: &mut Context,\n ) -> JsResult {\n // 1. Perform ? RequireInternalSlot(view, [[DataView]]).\n // 2. Assert: view has a [[ViewedArrayBuffer]] internal slot.\n let object = view.as_object();\n let view = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"`this` is not a DataView\"))?;\n\n // 3. Let getIndex be ? ToIndex(requestIndex).\n let get_index = request_index.to_index(context)?;\n\n // 4. Set isLittleEndian to ToBoolean(isLittleEndian).\n let is_little_endian = is_little_endian.to_boolean();\n\n // 6. Let viewRecord be MakeDataViewWithBufferWitnessRecord(view, unordered).\n // 7. NOTE: Bounds checking is not a synchronizing operation when view's backing buffer is a growable SharedArrayBuffer.\n // 8. If IsViewOutOfBounds(viewRecord) is true, throw a TypeError exception.\n let buffer = view.viewed_array_buffer.as_buffer();\n let Some(data) = buffer\n .bytes(Ordering::Relaxed)\n .filter(|buf| !view.is_out_of_bounds(buf.len()))\n else {\n return Err(JsNativeError::typ()\n .with_message(\"view out of bounds for its inner buffer\")\n .into());\n };\n\n // 5. Let viewOffset be view.[[ByteOffset]].\n let view_offset = view.byte_offset;\n\n // 9. Let viewSize be GetViewByteLength(viewRecord).\n let view_size = view.byte_length(data.len());\n\n // 10. Let elementSize be the Element Size value specified in Table 71 for Element Type type.\n let element_size = size_of::() as u64;\n\n // 11. If getIndex + elementSize > viewSize, throw a RangeError exception.\n if get_index + element_size > view_size {\n return Err(JsNativeError::range()\n .with_message(\"Offset is outside the bounds of the DataView\")\n .into());\n }\n\n // 12. Let bufferIndex be getIndex + viewOffset.\n let buffer_index = (get_index + view_offset) as usize;\n\n let src = data.subslice(buffer_index..);\n\n debug_assert!(src.len() >= size_of::());\n\n // 13. Return GetValueFromBuffer(view.[[ViewedArrayBuffer]], bufferIndex, type, false, unordered, isLittleEndian).\n // SAFETY: All previous checks ensure the element fits in the buffer.\n let value: TypedArrayElement = unsafe {\n let mut value = T::zeroed();\n memcpy(\n src.as_ptr(),\n BytesMutPtr::Bytes(bytes_of_mut(&mut value).as_mut_ptr()),\n size_of::(),\n );\n\n if is_little_endian {\n value.to_little_endian()\n } else {\n value.to_big_endian()\n }\n .into()\n };\n\n Ok(value.into())\n }\n\n /// `DataView.prototype.getBigInt64 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getBigInt64()` method gets a signed 64-bit integer (long long) at the specified byte\n /// offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getbigint64\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getBigInt64\n pub(crate) fn get_big_int64(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getBigUint64 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getBigUint64()` method gets an unsigned 64-bit integer (unsigned long long) at the\n /// specified byte offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getbiguint64\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getBigUint64\n pub(crate) fn get_big_uint64(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getFloat16 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getFloat16()` method gets a signed 16-bit float (float) at the specified byte offset\n /// from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getfloat16\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getFloat16\n #[cfg(feature = \"float16\")]\n pub(crate) fn get_float16(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getFloat32 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getFloat32()` method gets a signed 32-bit float (float) at the specified byte offset\n /// from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getfloat32\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getFloat32\n pub(crate) fn get_float32(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getFloat64 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getFloat64()` method gets a signed 64-bit float (double) at the specified byte offset\n /// from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getfloat64\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getFloat64\n pub(crate) fn get_float64(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getInt8 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getInt8()` method gets a signed 8-bit integer (byte) at the specified byte offset\n /// from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getint8\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getInt8\n pub(crate) fn get_int8(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getInt16 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getInt16()` method gets a signed 16-bit integer (short) at the specified byte offset\n /// from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getint16\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getInt16\n pub(crate) fn get_int16(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getInt32 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getInt32()` method gets a signed 32-bit integer (long) at the specified byte offset\n /// from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getint32\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getInt32\n pub(crate) fn get_int32(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getUint8 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getUint8()` method gets an unsigned 8-bit integer (unsigned byte) at the specified\n /// byte offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getuint8\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getUint8\n pub(crate) fn get_uint8(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getUint16 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getUint16()` method gets an unsigned 16-bit integer (unsigned short) at the specified\n /// byte offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getuint16\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getUint16\n pub(crate) fn get_uint16(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `DataView.prototype.getUint32 ( byteOffset [ , littleEndian ] )`\n ///\n /// The `getUint32()` method gets an unsigned 32-bit integer (unsigned long) at the specified\n /// byte offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.getuint32\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/getUint32\n pub(crate) fn get_uint32(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let is_little_endian = args.get_or_undefined(1);\n // 1. Let v be the this value.\n // 2. Return ? GetViewValue(v, byteOffset, littleEndian, BigInt64).\n Self::get_view_value::(this, byte_offset, is_little_endian, context)\n }\n\n /// `SetViewValue ( view, requestIndex, isLittleEndian, type )`\n ///\n /// The abstract operation `SetViewValue` takes arguments view, requestIndex, `isLittleEndian`,\n /// type, and value. It is used by functions on `DataView` instances to store values into the\n /// view's buffer.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-setviewvalue\n fn set_view_value(\n view: &JsValue,\n request_index: &JsValue,\n is_little_endian: &JsValue,\n value: &JsValue,\n context: &mut Context,\n ) -> JsResult {\n // 1. Perform ? RequireInternalSlot(view, [[DataView]]).\n // 2. Assert: view has a [[ViewedArrayBuffer]] internal slot.\n let object = view.as_object();\n let view = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"`this` is not a DataView\"))?;\n\n // 3. Let getIndex be ? ToIndex(requestIndex).\n let get_index = request_index.to_index(context)?;\n\n // 4. If IsBigIntElementType(type) is true, let numberValue be ? ToBigInt(value).\n // 5. Otherwise, let numberValue be ? ToNumber(value).\n let value = T::from_js_value(value, context)?;\n\n // 6. Set isLittleEndian to ToBoolean(isLittleEndian).\n let is_little_endian = is_little_endian.to_boolean();\n\n // 8. Let viewRecord be MakeDataViewWithBufferWitnessRecord(view, unordered).\n // 9. NOTE: Bounds checking is not a synchronizing operation when view's backing buffer is a growable SharedArrayBuffer.\n // 10. If IsViewOutOfBounds(viewRecord) is true, throw a TypeError exception.\n let mut buffer = view.viewed_array_buffer.as_buffer_mut();\n\n let Some(mut data) = buffer\n .bytes(Ordering::Relaxed)\n .filter(|buf| !view.is_out_of_bounds(buf.len()))\n else {\n return Err(JsNativeError::typ()\n .with_message(\"view out of bounds for its inner buffer\")\n .into());\n };\n\n // 11. Let viewSize be GetViewByteLength(viewRecord).\n let view_size = view.byte_length(data.len());\n\n // 7. Let viewOffset be view.[[ByteOffset]].\n let view_offset = view.byte_offset;\n\n // 12. Let elementSize be the Element Size value specified in Table 71 for Element Type type.\n let elem_size = size_of::();\n\n // 13. If getIndex + elementSize > viewSize, throw a RangeError exception.\n if get_index + elem_size as u64 > view_size {\n return Err(JsNativeError::range()\n .with_message(\"Offset is outside the bounds of DataView\")\n .into());\n }\n\n // 14. Let bufferIndex be getIndex + viewOffset.\n let buffer_index = (get_index + view_offset) as usize;\n\n let mut target = data.subslice_mut(buffer_index..);\n\n debug_assert!(target.len() >= size_of::());\n\n // 15. Perform SetValueInBuffer(view.[[ViewedArrayBuffer]], bufferIndex, type, numberValue, false, unordered, isLittleEndian).\n // SAFETY: All previous checks ensure the element fits in the buffer.\n unsafe {\n let value = if is_little_endian {\n value.to_little_endian()\n } else {\n value.to_big_endian()\n };\n\n memcpy(\n BytesConstPtr::Bytes(bytes_of(&value).as_ptr()),\n target.as_ptr(),\n size_of::(),\n );\n }\n\n // 16. Return undefined.\n Ok(JsValue::undefined())\n }\n\n /// `DataView.prototype.setBigInt64 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setBigInt64()` method stores a signed 64-bit integer (long long) value at the\n /// specified byte offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setbigint64\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setBigInt64\n pub(crate) fn set_big_int64(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, BigUint64, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setBigUint64 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setBigUint64()` method stores an unsigned 64-bit integer (unsigned long long) value at\n /// the specified byte offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setbiguint64\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setBigUint64\n pub(crate) fn set_big_uint64(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, BigUint64, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setFloat16 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setFloat16()` method stores a signed 16-bit float (float) value at the specified byte\n /// offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setfloat16\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setFloat16\n #[cfg(feature = \"float16\")]\n pub(crate) fn set_float16(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Float32, value).\n Self::set_view_value::(\n this,\n byte_offset,\n is_little_endian,\n value,\n context,\n )\n }\n\n /// `DataView.prototype.setFloat32 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setFloat32()` method stores a signed 32-bit float (float) value at the specified byte\n /// offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setfloat32\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setFloat32\n pub(crate) fn set_float32(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Float32, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setFloat64 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setFloat64()` method stores a signed 64-bit float (double) value at the specified byte\n /// offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setfloat64\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setFloat64\n pub(crate) fn set_float64(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Float64, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setInt8 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setInt8()` method stores a signed 8-bit integer (byte) value at the specified byte\n /// offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setint8\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setInt8\n pub(crate) fn set_int8(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Int8, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setInt16 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setInt16()` method stores a signed 16-bit integer (short) value at the specified byte\n /// offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setint16\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setInt16\n pub(crate) fn set_int16(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Int16, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setInt32 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setInt32()` method stores a signed 32-bit integer (long) value at the specified byte\n /// offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setint32\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setInt32\n pub(crate) fn set_int32(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Int32, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setUint8 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setUint8()` method stores an unsigned 8-bit integer (byte) value at the specified byte\n /// offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setuint8\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setUint8\n pub(crate) fn set_uint8(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Uint8, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setUint16 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setUint16()` method stores an unsigned 16-bit integer (unsigned short) value at the\n /// specified byte offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setuint16\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setUint16\n pub(crate) fn set_uint16(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Uint16, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n\n /// `DataView.prototype.setUint32 ( byteOffset, value [ , littleEndian ] )`\n ///\n /// The `setUint32()` method stores an unsigned 32-bit integer (unsigned long) value at the\n /// specified byte offset from the start of the `DataView`.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-dataview.prototype.setuint32\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DataView/setUint32\n pub(crate) fn set_uint32(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let byte_offset = args.get_or_undefined(0);\n let value = args.get_or_undefined(1);\n let is_little_endian = args.get_or_undefined(2);\n // 1. Let v be the this value.\n // 2. Return ? SetViewValue(v, byteOffset, littleEndian, Uint32, value).\n Self::set_view_value::(this, byte_offset, is_little_endian, value, context)\n }\n}\n" }, { "path": "core/engine/src/builtins/date/mod.rs", "content": "//! Boa's implementation of ECMAScript's `Date` object.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-date-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date\n\nuse crate::{\n Context, JsArgs, JsData, JsResult, JsString,\n builtins::{\n BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject,\n date::utils::{\n MS_PER_MINUTE, date_from_time, date_string, day, hour_from_time, local_time, make_date,\n make_day, make_full_year, make_time, min_from_time, month_from_time, ms_from_time,\n pad_five, pad_four, pad_six, pad_three, pad_two, parse_date, sec_from_time, time_clip,\n time_string, time_within_day, time_zone_string, to_date_string_t, utc_t, week_day,\n year_from_time,\n },\n },\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::JsNativeError,\n js_string,\n object::{JsObject, internal_methods::get_prototype_from_constructor},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::{JsValue, PreferredType},\n};\nuse boa_gc::{Finalize, Trace};\nuse boa_macros::js_str;\n\npub(crate) mod utils;\n\n#[cfg(test)]\nmod tests;\n\n/// The internal representation of a `Date` object.\n#[derive(Debug, Copy, Clone, Trace, Finalize, JsData)]\n#[boa_gc(empty_trace)]\npub struct Date(f64);\n\nimpl Date {\n /// Creates a new `Date`.\n pub(crate) const fn new(dt: f64) -> Self {\n Self(dt)\n }\n\n /// Creates a new `Date` from the current UTC time of the host.\n pub(crate) fn utc_now(context: &mut Context) -> Self {\n Self(context.clock().system_time_millis() as f64)\n }\n\n /// Formats this date as an ISO 8601 string for display purposes.\n ///\n /// Returns `None` if the date value is not finite (i.e. `Invalid Date`).\n pub(crate) fn to_iso_display(self) -> Option {\n let tv = self.0;\n if !tv.is_finite() {\n return None;\n }\n let year = year_from_time(tv);\n let year_str = if year.is_positive() && year >= 10000 {\n format!(\"+{year:06}\")\n } else if year >= 0 {\n format!(\"{year:04}\")\n } else {\n format!(\"-{:06}\", year.unsigned_abs())\n };\n Some(format!(\n \"{}-{:02}-{:02}T{:02}:{:02}:{:02}.{:03}Z\",\n year_str,\n month_from_time(tv) + 1,\n date_from_time(tv),\n hour_from_time(tv),\n min_from_time(tv),\n sec_from_time(tv),\n ms_from_time(tv),\n ))\n }\n}\n\nimpl IntrinsicObject for Date {\n fn init(realm: &Realm) {\n let to_utc_string = BuiltInBuilder::callable(realm, Self::to_utc_string)\n .name(js_string!(\"toUTCString\"))\n .length(0)\n .build();\n\n let to_primitive = BuiltInBuilder::callable(realm, Self::to_primitive)\n .name(js_string!(\"[Symbol.toPrimitive]\"))\n .length(1)\n .build();\n\n let builder = BuiltInBuilder::from_standard_constructor::(realm)\n .static_method(Self::now, js_string!(\"now\"), 0)\n .static_method(Self::parse, js_string!(\"parse\"), 1)\n .static_method(Self::utc, js_string!(\"UTC\"), 7)\n .method(Self::get_date::, js_string!(\"getDate\"), 0)\n .method(Self::get_day::, js_string!(\"getDay\"), 0)\n .method(Self::get_full_year::, js_string!(\"getFullYear\"), 0)\n .method(Self::get_hours::, js_string!(\"getHours\"), 0)\n .method(\n Self::get_milliseconds::,\n js_string!(\"getMilliseconds\"),\n 0,\n )\n .method(Self::get_minutes::, js_string!(\"getMinutes\"), 0)\n .method(Self::get_month::, js_string!(\"getMonth\"), 0)\n .method(Self::get_seconds::, js_string!(\"getSeconds\"), 0)\n .method(Self::get_time, js_string!(\"getTime\"), 0)\n .method(\n Self::get_timezone_offset,\n js_string!(\"getTimezoneOffset\"),\n 0,\n )\n .method(Self::get_date::, js_string!(\"getUTCDate\"), 0)\n .method(Self::get_day::, js_string!(\"getUTCDay\"), 0)\n .method(\n Self::get_full_year::,\n js_string!(\"getUTCFullYear\"),\n 0,\n )\n .method(Self::get_hours::, js_string!(\"getUTCHours\"), 0)\n .method(\n Self::get_milliseconds::,\n js_string!(\"getUTCMilliseconds\"),\n 0,\n )\n .method(Self::get_minutes::, js_string!(\"getUTCMinutes\"), 0)\n .method(Self::get_month::, js_string!(\"getUTCMonth\"), 0)\n .method(Self::get_seconds::, js_string!(\"getUTCSeconds\"), 0)\n .method(Self::get_year, js_string!(\"getYear\"), 0)\n .method(Self::set_date::, js_string!(\"setDate\"), 1)\n .method(Self::set_full_year::, js_string!(\"setFullYear\"), 3)\n .method(Self::set_hours::, js_string!(\"setHours\"), 4)\n .method(\n Self::set_milliseconds::,\n js_string!(\"setMilliseconds\"),\n 1,\n )\n .method(Self::set_minutes::, js_string!(\"setMinutes\"), 3)\n .method(Self::set_month::, js_string!(\"setMonth\"), 2)\n .method(Self::set_seconds::, js_string!(\"setSeconds\"), 2)\n .method(Self::set_time, js_string!(\"setTime\"), 1)\n .method(Self::set_date::, js_string!(\"setUTCDate\"), 1)\n .method(\n Self::set_full_year::,\n js_string!(\"setUTCFullYear\"),\n 3,\n )\n .method(Self::set_hours::, js_string!(\"setUTCHours\"), 4)\n .method(\n Self::set_milliseconds::,\n js_string!(\"setUTCMilliseconds\"),\n 1,\n )\n .method(Self::set_minutes::, js_string!(\"setUTCMinutes\"), 3)\n .method(Self::set_month::, js_string!(\"setUTCMonth\"), 2)\n .method(Self::set_seconds::, js_string!(\"setUTCSeconds\"), 2)\n .method(Self::set_year, js_string!(\"setYear\"), 1)\n .method(Self::to_date_string, js_string!(\"toDateString\"), 0)\n .method(Self::to_iso_string, js_string!(\"toISOString\"), 0)\n .method(Self::to_json, js_string!(\"toJSON\"), 1)\n .method(\n Self::to_locale_date_string,\n js_string!(\"toLocaleDateString\"),\n 0,\n )\n .method(Self::to_locale_string, js_string!(\"toLocaleString\"), 0)\n .method(\n Self::to_locale_time_string,\n js_string!(\"toLocaleTimeString\"),\n 0,\n )\n .method(Self::to_string, js_string!(\"toString\"), 0)\n .method(Self::to_time_string, js_string!(\"toTimeString\"), 0)\n .method(Self::value_of, js_string!(\"valueOf\"), 0)\n .property(\n js_string!(\"toGMTString\"),\n to_utc_string.clone(),\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n js_string!(\"toUTCString\"),\n to_utc_string,\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .property(\n JsSymbol::to_primitive(),\n to_primitive,\n Attribute::READONLY | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n );\n\n #[cfg(feature = \"temporal\")]\n let builder = builder.method(\n Self::to_temporal_instant,\n js_string!(\"toTemporalInstant\"),\n 0,\n );\n\n builder.build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for Date {\n const NAME: JsString = StaticJsStrings::DATE;\n}\n\nimpl BuiltInConstructor for Date {\n const CONSTRUCTOR_ARGUMENTS: usize = 7;\n const PROTOTYPE_STORAGE_SLOTS: usize = 48;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 3;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::date;\n\n /// [`Date ( ...values )`][spec]\n ///\n /// - When called as a function, returns a string displaying the current time in the UTC timezone.\n /// - When called as a constructor, it returns a new `Date` object from the provided arguments.\n /// The [MDN documentation][mdn] has a more extensive explanation on the usages and return\n /// values for all possible arguments.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date-constructor\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/Date\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, then\n if new_target.is_undefined() {\n // a. Let now be the time value (UTC) identifying the current time.\n let now = context.clock().system_time_millis();\n\n // b. Return ToDateString(now).\n return Ok(JsValue::from(to_date_string_t(\n now as f64,\n context.host_hooks().as_ref(),\n )));\n }\n\n // 2. Let numberOfArgs be the number of elements in values.\n let dv = match args {\n // 3. If numberOfArgs = 0, then\n [] => {\n // a. Let dv be the time value (UTC) identifying the current time.\n Self::utc_now(context)\n }\n // 4. Else if numberOfArgs = 1, then\n // a. Let value be values[0].\n [value] => {\n // b. If value is an Object and value has a [[DateValue]] internal slot, then\n let object = value.as_object();\n let tv =\n if let Some(date) = object.as_ref().and_then(JsObject::downcast_ref::) {\n // i. Let tv be value.[[DateValue]].\n date.0\n }\n // c. Else,\n else {\n // i. Let v be ? ToPrimitive(value).\n let v = value.to_primitive(context, PreferredType::Default)?;\n\n // ii. If v is a String, then\n if let Some(v) = v.as_string() {\n // 1. Assert: The next step never returns an abrupt completion because v is a String.\n // 2. Let tv be the result of parsing v as a date, in exactly the same manner as for the parse method (21.4.3.2).\n let tv = parse_date(&v, context.host_hooks().as_ref());\n if let Some(tv) = tv {\n tv as f64\n } else {\n f64::NAN\n }\n }\n // iii. Else,\n else {\n // 1. Let tv be ? ToNumber(v).\n v.to_number(context)?\n }\n };\n\n // d. Let dv be TimeClip(tv).\n Self(time_clip(tv))\n }\n // 5. Else,\n _ => {\n // Separating this into its own function to simplify the logic.\n //let dt = Self::construct_date(args, context)?\n // .and_then(|dt| context.host_hooks().local_from_naive_local(dt).earliest());\n //Self(dt.map(|dt| dt.timestamp_millis()))\n\n // a. Assert: numberOfArgs ≥ 2.\n // b. Let y be ? ToNumber(values[0]).\n let y = args.get_or_undefined(0).to_number(context)?;\n\n // c. Let m be ? ToNumber(values[1]).\n let m = args.get_or_undefined(1).to_number(context)?;\n\n // d. If numberOfArgs > 2, let dt be ? ToNumber(values[2]); else let dt be 1𝔽.\n let dt = args.get(2).map_or(Ok(1.0), |n| n.to_number(context))?;\n\n // e. If numberOfArgs > 3, let h be ? ToNumber(values[3]); else let h be +0𝔽.\n let h = args.get(3).map_or(Ok(0.0), |n| n.to_number(context))?;\n\n // f. If numberOfArgs > 4, let min be ? ToNumber(values[4]); else let min be +0𝔽.\n let min = args.get(4).map_or(Ok(0.0), |n| n.to_number(context))?;\n\n // g. If numberOfArgs > 5, let s be ? ToNumber(values[5]); else let s be +0𝔽.\n let s = args.get(5).map_or(Ok(0.0), |n| n.to_number(context))?;\n\n // h. If numberOfArgs > 6, let milli be ? ToNumber(values[6]); else let milli be +0𝔽.\n let milli = args.get(6).map_or(Ok(0.0), |n| n.to_number(context))?;\n\n // i. Let yr be MakeFullYear(y).\n let yr = make_full_year(y);\n\n // j. Let finalDate be MakeDate(MakeDay(yr, m, dt), MakeTime(h, min, s, milli)).\n let final_date = make_date(make_day(yr, m, dt), make_time(h, min, s, milli));\n\n // k. Let dv be TimeClip(UTC(finalDate)).\n Self(time_clip(utc_t(final_date, context.host_hooks().as_ref())))\n }\n };\n\n // 6. Let O be ? OrdinaryCreateFromConstructor(NewTarget, \"%Date.prototype%\", « [[DateValue]] »).\n let prototype =\n get_prototype_from_constructor(new_target, StandardConstructors::date, context)?;\n\n // 7. Set O.[[DateValue]] to dv.\n let obj =\n JsObject::from_proto_and_data_with_shared_shape(context.root_shape(), prototype, dv);\n\n // 8. Return O.\n Ok(obj.into())\n }\n}\n\nimpl Date {\n /// `Date.now()`\n ///\n /// The static `Date.now()` method returns the number of milliseconds elapsed since January 1, 1970 00:00:00 UTC.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.now\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/now\n #[allow(clippy::unnecessary_wraps)]\n pub(crate) fn now(_: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n Ok(JsValue::new(context.clock().system_time_millis()))\n }\n\n /// `Date.parse()`\n ///\n /// The `Date.parse()` method parses a string representation of a date, and returns the number of milliseconds since\n /// January 1, 1970, 00:00:00 UTC or `NaN` if the string is unrecognized or, in some cases, contains illegal date\n /// values.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.parse\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/parse\n pub(crate) fn parse(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n let date = args.get_or_undefined(0).to_string(context)?;\n Ok(parse_date(&date, context.host_hooks().as_ref())\n .map_or(JsValue::from(f64::NAN), JsValue::from))\n }\n\n /// `Date.UTC()`\n ///\n /// The `Date.UTC()` method accepts parameters similar to the `Date` constructor, but treats them as UTC.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.utc\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/UTC\n pub(crate) fn utc(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let y be ? ToNumber(year).\n let y = args.get_or_undefined(0).to_number(context)?;\n\n // 2. If month is present, let m be ? ToNumber(month); else let m be +0𝔽.\n let m = args\n .get(1)\n .map_or(Ok(0f64), |value| value.to_number(context))?;\n\n // 3. If date is present, let dt be ? ToNumber(date); else let dt be 1𝔽.\n let dt = args\n .get(2)\n .map_or(Ok(1f64), |value| value.to_number(context))?;\n\n // 4. If hours is present, let h be ? ToNumber(hours); else let h be +0𝔽.\n let h = args\n .get(3)\n .map_or(Ok(0f64), |value| value.to_number(context))?;\n\n // 5. If minutes is present, let min be ? ToNumber(minutes); else let min be +0𝔽.\n let min = args\n .get(4)\n .map_or(Ok(0f64), |value| value.to_number(context))?;\n\n // 6. If seconds is present, let s be ? ToNumber(seconds); else let s be +0𝔽.\n let s = args\n .get(5)\n .map_or(Ok(0f64), |value| value.to_number(context))?;\n\n // 7. If ms is present, let milli be ? ToNumber(ms); else let milli be +0𝔽.\n let milli = args\n .get(6)\n .map_or(Ok(0f64), |value| value.to_number(context))?;\n\n // 8. Let yr be MakeFullYear(y).\n let yr = make_full_year(y);\n\n // 9. Return TimeClip(MakeDate(MakeDay(yr, m, dt), MakeTime(h, min, s, milli))).\n Ok(JsValue::from(time_clip(make_date(\n make_day(yr, m, dt),\n make_time(h, min, s, milli),\n ))))\n }\n\n /// [`Date.prototype.getDate ( )`][local] and\n /// [`Date.prototype.getUTCDate ( )`][utc].\n ///\n /// The `getDate()` method returns the day of the month for the specified date.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.getdate\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.getutcdate\n pub(crate) fn get_date(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::new(f64::NAN));\n }\n\n if LOCAL {\n // 5. Return DateFromTime(LocalTime(t)).\n Ok(JsValue::from(date_from_time(local_time(\n t,\n context.host_hooks().as_ref(),\n ))))\n } else {\n // 5. Return DateFromTime(t).\n Ok(JsValue::from(date_from_time(t)))\n }\n }\n\n /// [`Date.prototype.getDay ( )`][local] and\n /// [`Date.prototype.getUTCDay ( )`][utc].\n ///\n /// The `getDay()` method returns the day of the week for the specified date, where 0 represents\n /// Sunday.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.getday\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.getutcday\n pub(crate) fn get_day(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 5. Return WeekDay(LocalTime(t)).\n Ok(JsValue::from(week_day(local_time(\n t,\n context.host_hooks().as_ref(),\n ))))\n } else {\n // 5. Return WeekDay(t).\n Ok(JsValue::from(week_day(t)))\n }\n }\n\n /// [`Date.prototype.getYear()`][spec].\n ///\n /// The `getYear()` method returns the year in the specified date according to local time.\n /// Because `getYear()` does not return full years (\"year 2000 problem\"), it is no longer used\n /// and has been replaced by the `getFullYear()` method.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.getyear\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/getYear\n pub(crate) fn get_year(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n // 5. Return YearFromTime(LocalTime(t)) - 1900𝔽.\n Ok(JsValue::from(\n year_from_time(local_time(t, context.host_hooks().as_ref())) - 1900,\n ))\n }\n\n /// [`Date.prototype.getFullYear ( )`][local] and\n /// [`Date.prototype.getUTCFullYear ( )`][utc].\n ///\n /// The `getFullYear()` method returns the year of the specified date.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.getfullyear\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.getutcfullyear\n pub(crate) fn get_full_year(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 5. Return YearFromTime(LocalTime(t)).\n Ok(JsValue::from(year_from_time(local_time(\n t,\n context.host_hooks().as_ref(),\n ))))\n } else {\n // 5. Return YearFromTime(t).\n Ok(JsValue::from(year_from_time(t)))\n }\n }\n\n /// [`Date.prototype.getHours ( )`][local] and\n /// [`Date.prototype.getUTCHours ( )`][utc].\n ///\n /// The `getHours()` method returns the hour for the specified date.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.gethours\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.getutchours\n pub(crate) fn get_hours(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 5. Return HourFromTime(LocalTime(t)).\n Ok(JsValue::from(hour_from_time(local_time(\n t,\n context.host_hooks().as_ref(),\n ))))\n } else {\n // 5. Return HourFromTime(t).\n Ok(JsValue::from(hour_from_time(t)))\n }\n }\n\n /// [`Date.prototype.getMilliseconds ( )`][local] and\n /// [`Date.prototype.getUTCMilliseconds ( )`][utc].\n ///\n /// The `getMilliseconds()` method returns the milliseconds in the specified date.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.getmilliseconds\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.getutcmilliseconds\n pub(crate) fn get_milliseconds(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 5. Return msFromTime(LocalTime(t)).\n Ok(JsValue::from(ms_from_time(local_time(\n t,\n context.host_hooks().as_ref(),\n ))))\n } else {\n // 5. Return msFromTime(t).\n Ok(JsValue::from(ms_from_time(t)))\n }\n }\n\n /// [`Date.prototype.getMinutes ( )`][local] and\n /// [`Date.prototype.getUTCMinutes ( )`][utc].\n ///\n /// The `getMinutes()` method returns the minutes in the specified date.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.getminutes\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.getutcminutes\n pub(crate) fn get_minutes(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 5. Return MinFromTime(LocalTime(t)).\n Ok(JsValue::from(min_from_time(local_time(\n t,\n context.host_hooks().as_ref(),\n ))))\n } else {\n // 5. Return MinFromTime(t).\n Ok(JsValue::from(min_from_time(t)))\n }\n }\n\n /// [`Date.prototype.getMonth ( )`][local] and\n /// [`Date.prototype.getUTCMonth ( )`][utc].\n ///\n /// The `getMonth()` method returns the month in the specified date, as a zero-based value\n /// (where zero indicates the first month of the year).\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.getmonth\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.getutcmonth\n pub(crate) fn get_month(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 5. Return MonthFromTime(LocalTime(t)).\n Ok(JsValue::from(month_from_time(local_time(\n t,\n context.host_hooks().as_ref(),\n ))))\n } else {\n // 5. Return MonthFromTime(t).\n Ok(JsValue::from(month_from_time(t)))\n }\n }\n\n /// [`Date.prototype.getSeconds ( )`][local] and\n /// [`Date.prototype.getUTCSeconds ( )`][utc].\n ///\n /// The `getSeconds()` method returns the seconds in the specified date.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.getseconds\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.getutcseconds\n pub(crate) fn get_seconds(\n this: &JsValue,\n _args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 5. Return SecFromTime(LocalTime(t)).\n Ok(JsValue::from(sec_from_time(local_time(\n t,\n context.host_hooks().as_ref(),\n ))))\n } else {\n // 5. Return SecFromTime(t).\n Ok(JsValue::from(sec_from_time(t)))\n }\n }\n\n /// `Date.prototype.getTime()`.\n ///\n /// The `getTime()` method returns the number of milliseconds since the Unix Epoch.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.gettime\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/getTime\n pub(crate) fn get_time(\n this: &JsValue,\n _args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Return dateObject.[[DateValue]].\n Ok(this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0\n .into())\n }\n\n /// `Date.prototype.getTimeZoneOffset()`.\n ///\n /// The `getTimezoneOffset()` method returns the time zone difference, in minutes, from current locale (host system\n /// settings) to UTC.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.gettimezoneoffset\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/getTimezoneOffset\n pub(crate) fn get_timezone_offset(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n // 5. Return (t - LocalTime(t)) / msPerMinute.\n Ok(JsValue::from(\n (t - local_time(t, context.host_hooks().as_ref())) / MS_PER_MINUTE,\n ))\n }\n\n /// [`Date.prototype.setDate ( date )`][local] and\n /// [`Date.prototype.setUTCDate ( date )`][utc].\n ///\n /// The `setDate()` method sets the day of the `Date` object relative to the beginning of the\n /// currently set month.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.setdate\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.setutcdate\n pub(crate) fn set_date(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be dateObject.[[DateValue]].\n let mut t = date.0;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n // 4. Let dt be ? ToNumber(date).\n let dt = args.get_or_undefined(0).to_number(context)?;\n\n // 5. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 6. Set t to LocalTime(t).\n t = local_time(t, context.host_hooks().as_ref());\n }\n\n // 7. Let newDate be MakeDate(MakeDay(YearFromTime(t), MonthFromTime(t), dt), TimeWithinDay(t)).\n let new_date = make_date(\n make_day(year_from_time(t).into(), month_from_time(t).into(), dt),\n time_within_day(t),\n );\n\n let u = if LOCAL {\n // 8. Let u be TimeClip(UTC(newDate)).\n time_clip(utc_t(new_date, context.host_hooks().as_ref()))\n } else {\n // 8. Let v be TimeClip(newDate).\n time_clip(new_date)\n };\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 9. Set dateObject.[[DateValue]] to u.\n date_mut.0 = u;\n\n // 10. Return u.\n Ok(JsValue::from(u))\n }\n\n /// [`Date.prototype.setFullYear ( year [ , month [ , date ] ] )`][local] and\n /// [Date.prototype.setUTCFullYear ( year [ , month [ , date ] ] )][utc].\n ///\n /// The `setFullYear()` method sets the full year for a specified date and returns the new\n /// timestamp.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.setfullyear\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.setutcfullyear\n pub(crate) fn set_full_year(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be dateObject.[[DateValue]].\n let t = date.0;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n let t = if LOCAL {\n // 5. If t is NaN, set t to +0𝔽; otherwise, set t to LocalTime(t).\n if t.is_nan() {\n 0.0\n } else {\n local_time(t, context.host_hooks().as_ref())\n }\n } else {\n // 4. If t is NaN, set t to +0𝔽.\n if t.is_nan() { 0.0 } else { t }\n };\n\n // 4. Let y be ? ToNumber(year).\n let y = args.get_or_undefined(0).to_number(context)?;\n\n // 6. If month is not present, let m be MonthFromTime(t); otherwise, let m be ? ToNumber(month).\n let m = if let Some(month) = args.get(1) {\n month.to_number(context)?\n } else {\n month_from_time(t).into()\n };\n\n // 7. If date is not present, let dt be DateFromTime(t); otherwise, let dt be ? ToNumber(date).\n let dt = if let Some(date) = args.get(2) {\n date.to_number(context)?\n } else {\n date_from_time(t).into()\n };\n\n // 8. Let newDate be MakeDate(MakeDay(y, m, dt), TimeWithinDay(t)).\n let new_date = make_date(make_day(y, m, dt), time_within_day(t));\n\n let u = if LOCAL {\n // 9. Let u be TimeClip(UTC(newDate)).\n time_clip(utc_t(new_date, context.host_hooks().as_ref()))\n } else {\n // 9. Let u be TimeClip(newDate).\n time_clip(new_date)\n };\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 10. Set dateObject.[[DateValue]] to u.\n date_mut.0 = u;\n\n // 11. Return u.\n Ok(JsValue::from(u))\n }\n\n /// [`Date.prototype.setHours ( hour [ , min [ , sec [ , ms ] ] ] )`][local] and\n /// [`Date.prototype.setUTCHours ( hour [ , min [ , sec [ , ms ] ] ] )`][utc].\n ///\n /// The `setHours()` method sets the hours for a specified date, and returns the number\n /// of milliseconds since January 1, 1970 00:00:00 UTC until the time represented by the\n /// updated `Date` instance.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.sethours\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.setutchours\n #[allow(clippy::many_single_char_names)]\n pub(crate) fn set_hours(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be dateObject.[[DateValue]].\n let mut t = date.0;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n // 4. Let h be ? ToNumber(hour).\n let h = args.get_or_undefined(0).to_number(context)?;\n\n // 5. If min is present, let m be ? ToNumber(min).\n let m = args.get(1).map(|v| v.to_number(context)).transpose()?;\n\n // 6. If sec is present, let s be ? ToNumber(sec).\n let s = args.get(2).map(|v| v.to_number(context)).transpose()?;\n\n // 7. If ms is present, let milli be ? ToNumber(ms).\n let milli = args.get(3).map(|v| v.to_number(context)).transpose()?;\n\n // 8. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 9. Set t to LocalTime(t).\n t = local_time(t, context.host_hooks().as_ref());\n }\n\n // 10. If min is not present, let m be MinFromTime(t).\n let m: f64 = m.unwrap_or_else(|| min_from_time(t).into());\n\n // 11. If sec is not present, let s be SecFromTime(t).\n let s = s.unwrap_or_else(|| sec_from_time(t).into());\n\n // 12. If ms is not present, let milli be msFromTime(t).\n let milli = milli.unwrap_or_else(|| ms_from_time(t).into());\n\n // 13. Let date be MakeDate(Day(t), MakeTime(h, m, s, milli)).\n let date = make_date(day(t), make_time(h, m, s, milli));\n\n let u = if LOCAL {\n // 14. Let u be TimeClip(UTC(date)).\n time_clip(utc_t(date, context.host_hooks().as_ref()))\n } else {\n // 14. Let u be TimeClip(date).\n time_clip(date)\n };\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 15. Set dateObject.[[DateValue]] to u.\n date_mut.0 = u;\n\n // 16. Return u.\n Ok(JsValue::from(u))\n }\n\n /// [`Date.prototype.setMilliseconds ( ms )`[local] and\n /// [`Date.prototype.setUTCMilliseconds ( ms )`][utc].\n ///\n /// The `setMilliseconds()` method sets the milliseconds for a specified date according to local time.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.setmilliseconds\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.setutcmilliseconds\n pub(crate) fn set_milliseconds(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be dateObject.[[DateValue]].\n let mut t = date.0;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n // 4. Set ms to ? ToNumber(ms).\n let ms = args.get_or_undefined(0).to_number(context)?;\n\n // 5. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 6. Set t to LocalTime(t).\n t = local_time(t, context.host_hooks().as_ref());\n }\n\n // 7. Let time be MakeTime(HourFromTime(t), MinFromTime(t), SecFromTime(t), ms).\n let time = make_time(\n hour_from_time(t).into(),\n min_from_time(t).into(),\n sec_from_time(t).into(),\n ms,\n );\n\n let u = if LOCAL {\n // 8. Let u be TimeClip(UTC(MakeDate(Day(t), time))).\n time_clip(utc_t(\n make_date(day(t), time),\n context.host_hooks().as_ref(),\n ))\n } else {\n // 8. Let u be TimeClip(MakeDate(Day(t), time)).\n time_clip(make_date(day(t), time))\n };\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 9. Set dateObject.[[DateValue]] to u.\n date_mut.0 = u;\n\n // 10. Return u.\n Ok(JsValue::from(u))\n }\n\n /// [`Date.prototype.setMinutes ( min [ , sec [ , ms ] ] )`][local] and\n /// [`Date.prototype.setUTCMinutes ( min [ , sec [ , ms ] ] )`][utc].\n ///\n /// The `setMinutes()` method sets the minutes for a specified date.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.setminutes\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.setutcminutes\n pub(crate) fn set_minutes(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be dateObject.[[DateValue]].\n let mut t = date.0;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n // 4. Let m be ? ToNumber(min).\n let m = args.get_or_undefined(0).to_number(context)?;\n\n // 5. If sec is present, let s be ? ToNumber(sec).\n let s = args.get(1).map(|v| v.to_number(context)).transpose()?;\n\n // 6. If ms is present, let milli be ? ToNumber(ms).\n let milli = args.get(2).map(|v| v.to_number(context)).transpose()?;\n\n // 7. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n if LOCAL {\n // 8. Set t to LocalTime(t).\n t = local_time(t, context.host_hooks().as_ref());\n }\n\n // 9. If sec is not present, let s be SecFromTime(t).\n let s = s.unwrap_or_else(|| sec_from_time(t).into());\n\n // 10. If ms is not present, let milli be msFromTime(t).\n let milli = milli.unwrap_or_else(|| ms_from_time(t).into());\n\n // 11. Let date be MakeDate(Day(t), MakeTime(HourFromTime(t), m, s, milli)).\n let date = make_date(day(t), make_time(hour_from_time(t).into(), m, s, milli));\n\n let u = if LOCAL {\n // 12. Let u be TimeClip(UTC(date)).\n time_clip(utc_t(date, context.host_hooks().as_ref()))\n } else {\n // 12. Let u be TimeClip(date).\n time_clip(date)\n };\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 13. Set dateObject.[[DateValue]] to u.\n date_mut.0 = u;\n\n // 14. Return u.\n Ok(JsValue::from(u))\n }\n\n /// [`Date.prototype.setMonth ( month [ , date ] )`][local] and\n /// [`Date.prototype.setUTCMonth ( month [ , date ] )`][utc].\n ///\n /// The `setMonth()` method sets the month for a specified date according to the currently set\n /// year.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.setmonth\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.setutcmonth\n pub(crate) fn set_month(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be dateObject.[[DateValue]].\n let mut t = date.0;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n // 4. Let m be ? ToNumber(month).\n let m = args.get_or_undefined(0).to_number(context)?;\n\n // 5. If date is present, let dt be ? ToNumber(date).\n let dt = args.get(1).map(|v| v.to_number(context)).transpose()?;\n\n // 6. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n // 7. Set t to LocalTime(t).\n if LOCAL {\n t = local_time(t, context.host_hooks().as_ref());\n }\n\n // 8. If date is not present, let dt be DateFromTime(t).\n let dt = dt.unwrap_or_else(|| date_from_time(t).into());\n\n // 9. Let newDate be MakeDate(MakeDay(YearFromTime(t), m, dt), TimeWithinDay(t)).\n let new_date = make_date(\n make_day(year_from_time(t).into(), m, dt),\n time_within_day(t),\n );\n\n let u = if LOCAL {\n // 10. Let u be TimeClip(UTC(newDate)).\n time_clip(utc_t(new_date, context.host_hooks().as_ref()))\n } else {\n // 10. Let u be TimeClip(newDate).\n time_clip(new_date)\n };\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 11. Set dateObject.[[DateValue]] to u.\n date_mut.0 = u;\n\n // 12. Return u.\n Ok(JsValue::from(u))\n }\n\n /// [`Date.prototype.setSeconds ( sec [ , ms ] )`[local] and\n /// [`Date.prototype.setUTCSeconds ( sec [ , ms ] )`][utc].\n ///\n /// The `setSeconds()` method sets the seconds for a specified date.\n ///\n /// [local]: https://tc39.es/ecma262/#sec-date.prototype.setseconds\n /// [utc]: https://tc39.es/ecma262/#sec-date.prototype.setutcseconds\n pub(crate) fn set_seconds(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be dateObject.[[DateValue]].\n let mut t = date.0;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n // 4. Let s be ? ToNumber(sec).\n let s = args.get_or_undefined(0).to_number(context)?;\n\n // 5. If ms is present, let milli be ? ToNumber(ms).\n let milli = args.get(1).map(|v| v.to_number(context)).transpose()?;\n\n // 6. If t is NaN, return NaN.\n if t.is_nan() {\n return Ok(JsValue::from(f64::NAN));\n }\n\n // 7. Set t to LocalTime(t).\n if LOCAL {\n t = local_time(t, context.host_hooks().as_ref());\n }\n\n // 8. If ms is not present, let milli be msFromTime(t).\n let milli = milli.unwrap_or_else(|| ms_from_time(t).into());\n\n // 9. Let date be MakeDate(Day(t), MakeTime(HourFromTime(t), MinFromTime(t), s, milli)).\n let date = make_date(\n day(t),\n make_time(hour_from_time(t).into(), min_from_time(t).into(), s, milli),\n );\n\n let u = if LOCAL {\n // 10. Let u be TimeClip(UTC(date)).\n time_clip(utc_t(date, context.host_hooks().as_ref()))\n } else {\n // 10. Let u be TimeClip(date).\n time_clip(date)\n };\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 11. Set dateObject.[[DateValue]] to u.\n date_mut.0 = u;\n\n // 12. Return u.\n Ok(JsValue::from(u))\n }\n\n /// [`Date.prototype.setYear()`][spec].\n ///\n /// The `setYear()` method sets the year for a specified date according to local time.\n ///\n /// # Note\n ///\n /// The [`Self::set_full_year`] method is preferred for nearly all purposes, because it avoids\n /// the “year 2000 problem.”\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/setYear\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.setyear\n pub(crate) fn set_year(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be dateObject.[[DateValue]].\n let t = date.0;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n // 4. Let y be ? ToNumber(year).\n let y = args.get_or_undefined(0).to_number(context)?;\n\n // 5. If t is NaN, set t to +0𝔽; otherwise, set t to LocalTime(t).\n let t = if t.is_nan() {\n 0.0\n } else {\n local_time(t, context.host_hooks().as_ref())\n };\n\n // 6. Let yyyy be MakeFullYear(y).\n let yyyy = make_full_year(y);\n\n // 7. Let d be MakeDay(yyyy, MonthFromTime(t), DateFromTime(t)).\n let d = make_day(yyyy, month_from_time(t).into(), date_from_time(t).into());\n\n // 8. Let date be MakeDate(d, TimeWithinDay(t)).\n let date = make_date(d, time_within_day(t));\n\n // 9. Let u be TimeClip(UTC(date)).\n let u = time_clip(utc_t(date, context.host_hooks().as_ref()));\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 10. Set dateObject.[[DateValue]] to u.\n date_mut.0 = u;\n\n // 11. Return u.\n Ok(JsValue::from(u))\n }\n\n /// [`Date.prototype.setTime()`][spec].\n ///\n /// The `setTime()` method sets the Date object to the time represented by a number of milliseconds\n /// since January 1, 1970, 00:00:00 UTC.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.settime\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/setTime\n pub(crate) fn set_time(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n let object = this.as_object();\n let date = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 3. Let t be ? ToNumber(time).\n let t = args.get_or_undefined(0).to_number(context)?;\n\n // NOTE (nekevss): `downcast_ref` is used and then dropped for a short lived borrow.\n // ToNumber() may call userland code which can modify the underlying date\n // which will cause a panic. In order to avoid this, we drop the borrow,\n // here and only `downcast_mut` when date will be modified.\n drop(date);\n\n // 4. Let v be TimeClip(t).\n let v = time_clip(t);\n\n let object = this.as_object();\n let mut date_mut = object\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?;\n\n // 5. Set dateObject.[[DateValue]] to v.\n date_mut.0 = v;\n\n // 6. Return v.\n Ok(JsValue::from(v))\n }\n\n /// [`Date.prototype.toDateString()`][spec].\n ///\n /// The `toDateString()` method returns the date portion of a Date object in English.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.todatestring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toDateString\n pub(crate) fn to_date_string(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let tv be dateObject.[[DateValue]].\n let tv = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If tv is NaN, return \"Invalid Date\".\n if tv.is_nan() {\n return Ok(js_string!(\"Invalid Date\").into());\n }\n\n // 5. Let t be LocalTime(tv).\n let t = local_time(tv, context.host_hooks().as_ref());\n\n // 6. Return DateString(t).\n Ok(JsValue::from(date_string(t)))\n }\n\n /// [`Date.prototype.toISOString()`][spec].\n ///\n /// The `toISOString()` method returns a string in simplified extended ISO format\n /// ([ISO 8601][iso8601]).\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [iso8601]: http://en.wikipedia.org/wiki/ISO_8601\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.toisostring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toISOString\n pub(crate) fn to_iso_string(\n this: &JsValue,\n _: &[JsValue],\n _: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let tv be dateObject.[[DateValue]].\n let tv = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If tv is not finite, throw a RangeError exception.\n if !tv.is_finite() {\n return Err(JsNativeError::range()\n .with_message(\"Invalid time value\")\n .into());\n }\n\n // 5. If tv corresponds with a year that cannot be represented in the Date Time String Format, throw a RangeError exception.\n // 6. Return a String representation of tv in the Date Time String Format on the UTC time scale,\n // including all format elements and the UTC offset representation \"Z\".\n let year = year_from_time(tv);\n let year = if year >= 10000 {\n js_string!(js_str!(\"+\"), pad_six(year.unsigned_abs(), &mut [0; 6]))\n } else if year >= 0 {\n pad_four(year.unsigned_abs(), &mut [0; 4]).into()\n } else {\n js_string!(js_str!(\"-\"), pad_six(year.unsigned_abs(), &mut [0; 6]))\n };\n let mut binding = [0; 2];\n let month = pad_two(month_from_time(tv) + 1, &mut binding);\n let mut binding = [0; 2];\n let day = pad_two(date_from_time(tv), &mut binding);\n let mut binding = [0; 2];\n let hour = pad_two(hour_from_time(tv), &mut binding);\n let mut binding = [0; 2];\n let minute = pad_two(min_from_time(tv), &mut binding);\n let mut binding = [0; 2];\n let second = pad_two(sec_from_time(tv), &mut binding);\n let mut binding = [0; 3];\n let millisecond = pad_three(ms_from_time(tv), &mut binding);\n\n Ok(JsValue::from(js_string!(\n &year,\n js_str!(\"-\"),\n month,\n js_str!(\"-\"),\n day,\n js_str!(\"T\"),\n hour,\n js_str!(\":\"),\n minute,\n js_str!(\":\"),\n second,\n js_str!(\".\"),\n millisecond,\n js_str!(\"Z\")\n )))\n }\n\n /// [`Date.prototype.toJSON()`][spec].\n ///\n /// The `toJSON()` method returns a string representation of the `Date` object.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.tojson\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toJSON\n pub(crate) fn to_json(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be ? ToObject(this value).\n let o = this.to_object(context)?;\n\n // 2. Let tv be ? ToPrimitive(O, number).\n let tv = this.to_primitive(context, PreferredType::Number)?;\n\n // 3. If Type(tv) is Number and tv is not finite, return null.\n if tv.as_number().is_some_and(|x| !f64::is_finite(x)) {\n return Ok(JsValue::null());\n }\n\n // 4. Return ? Invoke(O, \"toISOString\").\n let func = o.get(js_string!(\"toISOString\"), context)?;\n func.call(this, &[], context)\n }\n\n /// [`Date.prototype.toLocaleDateString()`][spec].\n ///\n /// The `toLocaleDateString()` method returns the date portion of the given Date instance according\n /// to language-specific conventions.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sup-date.prototype.tolocaledatestring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toLocaleDateString\n #[allow(\n unused_variables,\n reason = \"`args` and `context` are used when the `intl` feature is enabled\"\n )]\n pub(crate) fn to_locale_date_string(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n #[cfg(feature = \"intl\")]\n {\n use crate::builtins::intl::date_time_format::{\n FormatDefaults, FormatType, format_date_time_locale,\n };\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let x be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n // 4. If x is NaN, return \"Invalid Date\".\n if t.is_nan() {\n return Ok(JsValue::new(js_string!(\"Invalid Date\")));\n }\n // 5. Let dateFormat be ? CreateDateTimeFormat(%Intl.DateTimeFormat%, locales, options, date, date).\n // 6. Return ! FormatDateTime(dateFormat, x).\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n format_date_time_locale(\n locales,\n options,\n FormatType::Date,\n FormatDefaults::Date,\n t,\n context,\n )\n }\n #[cfg(not(feature = \"intl\"))]\n {\n Self::to_string(this, &[], context)\n }\n }\n\n /// [`Date.prototype.toLocaleString()`][spec].\n ///\n /// The `toLocaleString()` method returns a string representing the specified Date object.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sup-date.prototype.tolocalestring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toLocaleString\n #[allow(\n unused_variables,\n reason = \"`args` and `context` are used when the `intl` feature is enabled\"\n )]\n pub(crate) fn to_locale_string(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n #[cfg(feature = \"intl\")]\n {\n use crate::builtins::intl::date_time_format::{\n FormatDefaults, FormatType, format_date_time_locale,\n };\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let x be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n // 4. If x is NaN, return \"Invalid Date\".\n if t.is_nan() {\n return Ok(JsValue::new(js_string!(\"Invalid Date\")));\n }\n // 5. Let dateFormat be ? CreateDateTimeFormat(%Intl.DateTimeFormat%, locales, options, any, all).\n // 6. Return ! FormatDateTime(dateFormat, x).\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n format_date_time_locale(\n locales,\n options,\n FormatType::Any,\n FormatDefaults::All,\n t,\n context,\n )\n }\n #[cfg(not(feature = \"intl\"))]\n {\n Self::to_string(this, &[], context)\n }\n }\n\n /// [`Date.prototype.toLocaleTimeString()`][spec].\n ///\n /// The `toLocaleTimeString()` method returns the time portion of a Date object in human readable\n /// form in American English.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sup-date.prototype.tolocaletimestring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toLocaleTimeString\n #[allow(\n unused_variables,\n reason = \"`args` and `context` are used when the `intl` feature is enabled\"\n )]\n pub(crate) fn to_locale_time_string(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n #[cfg(feature = \"intl\")]\n {\n use crate::builtins::intl::date_time_format::{\n FormatDefaults, FormatType, format_date_time_locale,\n };\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let x be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n // 4. If x is NaN, return \"Invalid Date\".\n if t.is_nan() {\n return Ok(JsValue::new(js_string!(\"Invalid Date\")));\n }\n // 5. Let timeFormat be ? CreateDateTimeFormat(%Intl.DateTimeFormat%, locales, options, time, time).\n // 6. Return ! FormatDateTime(timeFormat, x).\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n format_date_time_locale(\n locales,\n options,\n FormatType::Time,\n FormatDefaults::Time,\n t,\n context,\n )\n }\n #[cfg(not(feature = \"intl\"))]\n {\n Self::to_string(this, &[], context)\n }\n }\n\n /// [`Date.prototype.toString()`][spec].\n ///\n /// The `toString()` method returns a string representing the specified Date object.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.tostring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toString\n pub(crate) fn to_string(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let tv be dateObject.[[DateValue]].\n let tv = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. Return ToDateString(tv).\n Ok(JsValue::from(to_date_string_t(\n tv,\n context.host_hooks().as_ref(),\n )))\n }\n\n /// [`Date.prototype.toTimeString()`][spec].\n ///\n /// The `toTimeString()` method returns the time portion of a Date object in human readable form\n /// in American English.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.totimestring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toTimeString\n pub(crate) fn to_time_string(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let tv be dateObject.[[DateValue]].\n let tv = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If tv is NaN, return \"Invalid Date\".\n if tv.is_nan() {\n return Ok(js_string!(\"Invalid Date\").into());\n }\n\n // 5. Let t be LocalTime(tv).\n let t = local_time(tv, context.host_hooks().as_ref());\n\n // 6. Return the string-concatenation of TimeString(t) and TimeZoneString(tv).\n Ok(JsValue::from(js_string!(\n &time_string(t),\n &time_zone_string(t, context.host_hooks().as_ref())\n )))\n }\n\n /// [`Date.prototype.toUTCString()`][spec].\n ///\n /// The `toUTCString()` method returns a string representing the specified Date object.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.toutcstring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toUTCString\n pub(crate) fn to_utc_string(\n this: &JsValue,\n _args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let tv be dateObject.[[DateValue]].\n let tv = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0;\n\n // 4. If tv is NaN, return \"Invalid Date\".\n if tv.is_nan() {\n return Ok(js_string!(\"Invalid Date\").into());\n }\n\n // 5. Let weekday be the Name of the entry in Table 63 with the Number WeekDay(tv).\n let weekday = match week_day(tv) {\n 0 => js_str!(\"Sun\"),\n 1 => js_str!(\"Mon\"),\n 2 => js_str!(\"Tue\"),\n 3 => js_str!(\"Wed\"),\n 4 => js_str!(\"Thu\"),\n 5 => js_str!(\"Fri\"),\n 6 => js_str!(\"Sat\"),\n _ => unreachable!(),\n };\n\n // 6. Let month be the Name of the entry in Table 64 with the Number MonthFromTime(tv).\n let month = match month_from_time(tv) {\n 0 => js_str!(\"Jan\"),\n 1 => js_str!(\"Feb\"),\n 2 => js_str!(\"Mar\"),\n 3 => js_str!(\"Apr\"),\n 4 => js_str!(\"May\"),\n 5 => js_str!(\"Jun\"),\n 6 => js_str!(\"Jul\"),\n 7 => js_str!(\"Aug\"),\n 8 => js_str!(\"Sep\"),\n 9 => js_str!(\"Oct\"),\n 10 => js_str!(\"Nov\"),\n 11 => js_str!(\"Dec\"),\n _ => unreachable!(),\n };\n\n // 7. Let day be ToZeroPaddedDecimalString(ℝ(DateFromTime(tv)), 2).\n let mut binding = [0; 2];\n let day = pad_two(date_from_time(tv), &mut binding);\n\n // 8. Let yv be YearFromTime(tv).\n let yv = year_from_time(tv);\n\n // 9. If yv is +0𝔽 or yv > +0𝔽, let yearSign be the empty String; otherwise, let yearSign be \"-\".\n let year_sign = if yv >= 0 { js_str!(\"\") } else { js_str!(\"-\") };\n\n // 10. Let paddedYear be ToZeroPaddedDecimalString(abs(ℝ(yv)), 4).\n let yv = yv.unsigned_abs();\n let padded_year: JsString = if yv >= 100_000 {\n pad_six(yv, &mut [0; 6]).into()\n } else if yv >= 10000 {\n pad_five(yv, &mut [0; 5]).into()\n } else {\n pad_four(yv, &mut [0; 4]).into()\n };\n\n // 11. Return the string-concatenation of\n // weekday,\n // \",\",\n // the code unit 0x0020 (SPACE),\n // day,\n // the code unit 0x0020 (SPACE),\n // month,\n // the code unit 0x0020 (SPACE),\n // yearSign,\n // paddedYear,\n // the code unit 0x0020 (SPACE),\n // and TimeString(tv).\n Ok(JsValue::from(js_string!(\n weekday,\n js_str!(\",\"),\n js_str!(\" \"),\n day,\n js_str!(\" \"),\n month,\n js_str!(\" \"),\n year_sign,\n &padded_year,\n js_str!(\" \"),\n &time_string(tv)\n )))\n }\n\n /// [`Date.prototype.valueOf()`][spec].\n ///\n /// The `valueOf()` method returns the primitive value of a `Date` object.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype.valueof\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/valueOf\n pub(crate) fn value_of(\n this: &JsValue,\n _args: &[JsValue],\n _context: &mut Context,\n ) -> JsResult {\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Return dateObject.[[DateValue]].\n Ok(this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not a Date\"))?\n .0\n .into())\n }\n\n /// [`Date.prototype [ @@toPrimitive ] ( hint )`][spec].\n ///\n /// The \\[@@toPrimitive\\]() method converts a Date object to a primitive value.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-date.prototype-@@toprimitive\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/@@toPrimitive\n pub(crate) fn to_primitive(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. If Type(O) is not Object, throw a TypeError exception.\n let o = this.as_object().ok_or_else(|| {\n JsNativeError::typ().with_message(\"Date.prototype[@@toPrimitive] called on non object\")\n })?;\n\n let hint = args.get_or_undefined(0);\n\n let try_first = match hint.as_string() {\n // 3. If hint is \"string\" or \"default\", then\n // a. Let tryFirst be string.\n Some(string) if string == \"string\" || string == \"default\" => PreferredType::String,\n // 4. Else if hint is \"number\", then\n // a. Let tryFirst be number.\n Some(number) if number == \"number\" => PreferredType::Number,\n // 5. Else, throw a TypeError exception.\n _ => {\n return Err(JsNativeError::typ()\n .with_message(\"Date.prototype[@@toPrimitive] called with invalid hint\")\n .into());\n }\n };\n\n // 6. Return ? OrdinaryToPrimitive(O, tryFirst).\n o.ordinary_to_primitive(context, try_first)\n }\n\n /// 14.9.1 `Date.prototype.toTemporalInstant ()`\n ///\n /// Returns a JavaScript Date as a `Temporal.Instant`.\n ///\n /// More information:\n /// - [Temporal Proposal][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/proposal-temporal/#sec-date.prototype.totemporalinstant\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toTemporalInstant/\n #[cfg(feature = \"temporal\")]\n pub(crate) fn to_temporal_instant(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n use crate::{builtins::temporal::create_temporal_instant, js_error};\n use num_traits::FromPrimitive;\n use temporal_rs::Instant;\n\n const NS_PER_MILLISECOND: i128 = 1_000_000;\n // 1. Let dateObject be the this value.\n // 2. Perform ? RequireInternalSlot(dateObject, [[DateValue]]).\n // 3. Let t be dateObject.[[DateValue]].\n let t = this\n .as_object()\n .and_then(|obj| obj.downcast_ref::().as_deref().copied())\n .ok_or_else(|| js_error!(TypeError: \"'this' is not a Date\"))?\n .0;\n\n // 4. Let ns be ? NumberToBigInt(t) × ℤ(10**6).\n let ns = i128::from_f64(t)\n .ok_or(js_error!(RangeError: \"[[DateValue]] is not an integral number.\"))?\n * NS_PER_MILLISECOND;\n // 5. Return ! CreateTemporalInstant(ns).\n create_temporal_instant(Instant::try_new(ns)?, None, context)\n }\n}\n" }, { "path": "core/engine/src/builtins/date/tests.rs", "content": "use crate::{\n JsNativeErrorKind, TestAction,\n builtins::date::utils::fast_atoi::{process_4, process_8},\n js_string, run_test_actions,\n};\nuse boa_macros::js_str;\nuse indoc::indoc;\nuse time::{OffsetDateTime, macros::format_description};\n\n// NOTE: Javascript Uses 0-based months, where time uses 1-based months.\n// Many of the assertions look wrong because of this.\n\nfn month_from_u8(month: u8) -> time::Month {\n match month {\n 1 => time::Month::January,\n 2 => time::Month::February,\n 3 => time::Month::March,\n 4 => time::Month::April,\n 5 => time::Month::May,\n 6 => time::Month::June,\n 7 => time::Month::July,\n 8 => time::Month::August,\n 9 => time::Month::September,\n 10 => time::Month::October,\n 11 => time::Month::November,\n 12 => time::Month::December,\n _ => unreachable!(),\n }\n}\n\nfn from_local(\n year: i32,\n month: u8,\n date: u8,\n hour: u8,\n minute: u8,\n second: u8,\n millisecond: u16,\n) -> OffsetDateTime {\n let t = time::Date::from_calendar_date(year, month_from_u8(month), date)\n .unwrap()\n .with_hms_milli(hour, minute, second, millisecond)\n .unwrap()\n .assume_utc();\n let offset = time::UtcOffset::local_offset_at(t).unwrap();\n t.replace_offset(offset)\n}\n\nfn timestamp_from_local(\n year: i32,\n month: u8,\n date: u8,\n hour: u8,\n minute: u8,\n second: u8,\n millisecond: u16,\n) -> i64 {\n let t = from_local(year, month, date, hour, minute, second, millisecond);\n t.unix_timestamp() * 1000 + i64::from(t.millisecond())\n}\n\nfn timestamp_from_utc(\n year: i32,\n month: u8,\n date: u8,\n hour: u8,\n minute: u8,\n second: u8,\n millisecond: u16,\n) -> i64 {\n let t = time::Date::from_calendar_date(year, month_from_u8(month), date)\n .unwrap()\n .with_hms_milli(hour, minute, second, millisecond)\n .unwrap()\n .assume_utc();\n t.unix_timestamp() * 1000 + i64::from(t.millisecond())\n}\n\n#[test]\nfn parse_ascii_digits() {\n let parse_8_ascii_digits = |val: &[u8; 8], len: usize| -> u64 {\n let val = u64::from_le_bytes(*val);\n process_8(val, len)\n };\n assert_eq!(12_345_678, parse_8_ascii_digits(b\"12345678\", 8));\n assert_eq!(123_456, parse_8_ascii_digits(b\"123456xx\", 6));\n assert_eq!(123, parse_8_ascii_digits(b\"123xxxxx\", 3));\n assert_eq!(123, parse_8_ascii_digits(b\"000123xx\", 6));\n assert_eq!(0, parse_8_ascii_digits(b\"00000000\", 8));\n let parse_4_ascii_digits = |val: &[u8; 4], len: usize| -> u64 {\n let val = u32::from_le_bytes(*val);\n u64::from(process_4(val, len))\n };\n assert_eq!(1234, parse_4_ascii_digits(b\"1234\", 4));\n assert_eq!(12, parse_4_ascii_digits(b\"12xx\", 2));\n assert_eq!(3, parse_4_ascii_digits(b\"003x\", 3));\n assert_eq!(23, parse_4_ascii_digits(b\"023x\", 3));\n assert_eq!(0, parse_4_ascii_digits(b\"0000\", 4));\n}\n\n#[test]\nfn date_this_time_value() {\n run_test_actions([TestAction::assert_native_error(\n \"({toString: Date.prototype.toString}).toString()\",\n JsNativeErrorKind::Type,\n \"'this' is not a Date\",\n )]);\n}\n\n#[test]\nfn date_ctor_call() {\n run_test_actions([\n TestAction::run(\"let a = new Date()\"),\n TestAction::inspect_context(|_| std::thread::sleep(std::time::Duration::from_millis(1))),\n TestAction::assert(\"a.getTime() != new Date().getTime()\"),\n ]);\n}\n\n#[test]\nfn date_ctor_call_string() {\n run_test_actions([TestAction::assert_eq(\n \"new Date('2020-06-08T09:16:15.779-06:30').getTime()\",\n timestamp_from_utc(2020, 6, 8, 15, 46, 15, 779),\n )]);\n}\n\n#[test]\nfn date_ctor_call_string_invalid() {\n run_test_actions([TestAction::assert_eq(\n \"new Date('nope').getTime()\",\n f64::NAN,\n )]);\n}\n\n#[test]\nfn date_ctor_call_number() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(1594199775779).getTime()\",\n timestamp_from_utc(2020, 7, 8, 9, 16, 15, 779),\n )]);\n}\n\n#[test]\nfn date_ctor_call_date() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(new Date(1594199775779)).getTime()\",\n timestamp_from_utc(2020, 7, 8, 9, 16, 15, 779),\n )]);\n}\n\n#[test]\nfn date_ctor_call_multiple() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).getTime()\",\n timestamp_from_local(2020, 7, 8, 9, 16, 15, 779),\n )]);\n}\n\n#[test]\nfn date_ctor_call_multiple_90s() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(99, 6, 8, 9, 16, 15, 779).getTime()\",\n timestamp_from_local(1999, 7, 8, 9, 16, 15, 779),\n )]);\n}\n\n#[test]\nfn date_ctor_call_multiple_nan() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(1/0, 6, 8, 9, 16, 15, 779).getTime()\", f64::NAN),\n TestAction::assert_eq(\"new Date(2020, 1/0, 8, 9, 16, 15, 779).getTime()\", f64::NAN),\n TestAction::assert_eq(\"new Date(2020, 6, 1/0, 9, 16, 15, 779).getTime()\", f64::NAN),\n TestAction::assert_eq(\"new Date(2020, 6, 8, 1/0, 16, 15, 779).getTime()\", f64::NAN),\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 1/0, 15, 779).getTime()\", f64::NAN),\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 1/0, 779).getTime()\", f64::NAN),\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 1/0).getTime()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_ctor_now_call() {\n run_test_actions([\n TestAction::run(\"let a = Date.now()\"),\n TestAction::inspect_context(|_| std::thread::sleep(std::time::Duration::from_millis(1))),\n TestAction::assert(\"a != Date.now()\"),\n ]);\n}\n\n#[test]\nfn date_ctor_parse_call() {\n run_test_actions([TestAction::assert_eq(\n \"Date.parse('2020-06-08T09:16:15.779-07:30')\",\n 1_591_634_775_779_i64,\n )]);\n}\n\n#[test]\nfn date_ctor_utc_call() {\n run_test_actions([TestAction::assert_eq(\n \"Date.UTC(2020, 6, 8, 9, 16, 15, 779)\",\n 1_594_199_775_779_i64,\n )]);\n}\n\n#[test]\nfn date_ctor_utc_call_nan() {\n run_test_actions([\n TestAction::assert_eq(\"Date.UTC(1/0, 6, 8, 9, 16, 15, 779)\", f64::NAN),\n TestAction::assert_eq(\"Date.UTC(2020, 1/0, 8, 9, 16, 15, 779)\", f64::NAN),\n TestAction::assert_eq(\"Date.UTC(2020, 6, 1/0, 9, 16, 15, 779)\", f64::NAN),\n TestAction::assert_eq(\"Date.UTC(2020, 6, 8, 1/0, 16, 15, 779)\", f64::NAN),\n TestAction::assert_eq(\"Date.UTC(2020, 6, 8, 9, 1/0, 15, 779)\", f64::NAN),\n TestAction::assert_eq(\"Date.UTC(2020, 6, 8, 9, 16, 1/0, 779)\", f64::NAN),\n TestAction::assert_eq(\"Date.UTC(2020, 6, 8, 9, 16, 15, 1/0)\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_date_call() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 779).getDate()\", 8),\n TestAction::assert_eq(\"new Date(1/0).getDate()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_day_call() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 779).getDay()\", 3),\n TestAction::assert_eq(\"new Date(1/0).getDay()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_full_year_call() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 779).getFullYear()\", 2020),\n TestAction::assert_eq(\"new Date(1/0).getFullYear()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_hours_call() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 779).getHours()\", 9),\n TestAction::assert_eq(\"new Date(1/0).getHours()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_milliseconds_call() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).getMilliseconds()\",\n 779,\n ),\n TestAction::assert_eq(\"new Date(1/0).getMilliseconds()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_minutes_call() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 779).getMinutes()\", 16),\n TestAction::assert_eq(\"new Date(1/0).getMinutes()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_month() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 779).getMonth()\", 6),\n TestAction::assert_eq(\"new Date(1/0).getMonth()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_seconds() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 779).getSeconds()\", 15),\n TestAction::assert_eq(\"new Date(1/0).getSeconds()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_time() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).getTime()\",\n timestamp_from_local(2020, 7, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\"new Date(1/0).getTime()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_year() {\n run_test_actions([\n TestAction::assert_eq(\"new Date(2020, 6, 8, 9, 16, 15, 779).getYear()\", 120),\n TestAction::assert_eq(\"new Date(1/0).getYear()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_timezone_offset() {\n run_test_actions([\n TestAction::assert(indoc! {r#\"\n new Date('1975-08-19T23:15:30+07:00').getTimezoneOffset() ===\n new Date('1975-08-19T23:15:30-02:00').getTimezoneOffset()\n \"#}),\n // NB: Host Settings, not TZ specified in the DateTime.\n TestAction::assert_eq(\n \"new Date('1975-08-19T23:15:30+07:00').getTimezoneOffset()\",\n {\n let t = from_local(1975, 8, 19, 23, 15, 30, 0);\n -t.offset().whole_seconds() / 60\n },\n ),\n ]);\n}\n\n#[test]\nfn date_proto_get_utc_date_call() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).getUTCDate()\",\n 8,\n ),\n TestAction::assert_eq(\"new Date(1/0).getUTCDate()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_utc_day_call() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).getUTCDay()\",\n 3,\n ),\n TestAction::assert_eq(\"new Date(1/0).getUTCDay()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_utc_full_year_call() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).getUTCFullYear()\",\n 2020,\n ),\n TestAction::assert_eq(\"new Date(1/0).getUTCFullYear()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_utc_hours_call() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).getUTCHours()\",\n 9,\n ),\n TestAction::assert_eq(\"new Date(1/0).getUTCHours()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_utc_milliseconds_call() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).getUTCMilliseconds()\",\n 779,\n ),\n TestAction::assert_eq(\"new Date(1/0).getUTCMilliseconds()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_utc_minutes_call() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).getUTCMinutes()\",\n 16,\n ),\n TestAction::assert_eq(\"new Date(1/0).getUTCMinutes()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_utc_month() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).getUTCMonth()\",\n 6,\n ),\n TestAction::assert_eq(\"new Date(1/0).getUTCMonth()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_get_utc_seconds() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).getUTCSeconds()\",\n 15,\n ),\n TestAction::assert_eq(\"new Date(1/0).getUTCSeconds()\", f64::NAN),\n ]);\n}\n\n#[test]\nfn date_proto_set_date() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setDate(21)\",\n timestamp_from_local(2020, 7, 21, 9, 16, 15, 779),\n ),\n // Date wraps to previous month for 0.\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setDate(0)\",\n timestamp_from_local(2020, 6, 30, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setDate(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_full_year() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setFullYear(2012)\",\n timestamp_from_local(2012, 7, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setFullYear(2012, 8)\",\n timestamp_from_local(2012, 9, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setFullYear(2012, 8, 10)\",\n timestamp_from_local(2012, 9, 10, 9, 16, 15, 779),\n ),\n // Out-of-bounds\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setFullYear(2012, 35)\",\n timestamp_from_local(2014, 12, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setFullYear(2012, -35)\",\n timestamp_from_local(2009, 2, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setFullYear(2012, 9, 950)\",\n timestamp_from_local(2015, 5, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setFullYear(2012, 9, -950)\",\n timestamp_from_local(2010, 2, 23, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setFullYear(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_hours() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setHours(11)\",\n timestamp_from_local(2020, 7, 8, 11, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setHours(11, 35)\",\n timestamp_from_local(2020, 7, 8, 11, 35, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setHours(11, 35, 23)\",\n timestamp_from_local(2020, 7, 8, 11, 35, 23, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setHours(11, 35, 23, 537)\",\n timestamp_from_local(2020, 7, 8, 11, 35, 23, 537),\n ),\n // Out-of-bounds\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setHours(10000, 20000, 30000, 40123)\",\n timestamp_from_local(2021, 9, 11, 21, 40, 40, 123),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setHours(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_milliseconds() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMilliseconds(597)\",\n timestamp_from_local(2020, 7, 8, 9, 16, 15, 597),\n ),\n // Out-of-bounds\n // Thorough tests are done by setHours\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMilliseconds(40123)\",\n timestamp_from_local(2020, 7, 8, 9, 16, 55, 123),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMilliseconds(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_minutes() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMinutes(11)\",\n timestamp_from_local(2020, 7, 8, 9, 11, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMinutes(11, 35)\",\n timestamp_from_local(2020, 7, 8, 9, 11, 35, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMinutes(11, 35, 537)\",\n timestamp_from_local(2020, 7, 8, 9, 11, 35, 537),\n ),\n // Out-of-bounds\n // Thorough tests are done by setHours\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMinutes(600000, 30000, 40123)\",\n timestamp_from_local(2021, 8, 29, 9, 20, 40, 123),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMinutes(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_month() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMonth(11)\",\n timestamp_from_local(2020, 12, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMonth(11, 16)\",\n timestamp_from_local(2020, 12, 16, 9, 16, 15, 779),\n ),\n // Out-of-bounds\n // Thorough tests are done by setFullYear\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMonth(40, 83)\",\n timestamp_from_local(2023, 7, 22, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setMonth(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_seconds() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setSeconds(11)\",\n timestamp_from_local(2020, 7, 8, 9, 16, 11, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setSeconds(11, 487)\",\n timestamp_from_local(2020, 7, 8, 9, 16, 11, 487),\n ),\n // Out-of-bounds\n // Thorough tests are done by setHour\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setSeconds(40000000, 40123)\",\n timestamp_from_local(2021, 10, 14, 8, 23, 20, 123),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setSeconds(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn set_year() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setYear(98)\",\n timestamp_from_local(1998, 7, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setYear(2001)\",\n timestamp_from_local(2001, 7, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setYear(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_time() {\n run_test_actions([TestAction::assert_eq(\n \"new Date().setTime(new Date(2020, 6, 8, 9, 16, 15, 779).getTime())\",\n timestamp_from_local(2020, 7, 8, 9, 16, 15, 779),\n )]);\n}\n\n#[test]\nfn date_proto_set_utc_date() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCDate(21)\",\n timestamp_from_utc(2020, 7, 21, 9, 16, 15, 779),\n ),\n // Date wraps to previous month for 0.\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCDate(0)\",\n timestamp_from_utc(2020, 6, 30, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCDate(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_utc_full_year() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCFullYear(2012)\",\n timestamp_from_utc(2012, 7, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCFullYear(2012, 8)\",\n timestamp_from_utc(2012, 9, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCFullYear(2012, 8, 10)\",\n timestamp_from_utc(2012, 9, 10, 9, 16, 15, 779),\n ),\n // Out-of-bounds\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCFullYear(2012, 35)\",\n timestamp_from_utc(2014, 12, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCFullYear(2012, -35)\",\n timestamp_from_utc(2009, 2, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCFullYear(2012, 9, 950)\",\n timestamp_from_utc(2015, 5, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCFullYear(2012, 9, -950)\",\n timestamp_from_utc(2010, 2, 23, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCFullYear(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_utc_hours() {\n // The local-time constructor `new Date(2020, 6, 8, 9, 16, 15, 779)` converts\n // local time to UTC internally. The resulting UTC components depend on the\n // host timezone offset, so we compute them dynamically.\n let base = from_local(2020, 7, 8, 9, 16, 15, 779).to_offset(time::UtcOffset::UTC);\n let base_y = base.year();\n let base_m = base.month() as u8;\n let base_d = base.day();\n let base_min = base.minute();\n let base_sec = base.second();\n let base_ms = base.millisecond();\n\n run_test_actions([\n // setUTCHours(11): only the UTC hour changes; date/min/sec/ms stay.\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setUTCHours(11)\",\n timestamp_from_utc(base_y, base_m, base_d, 11, base_min, base_sec, base_ms),\n ),\n // setUTCHours(h, m): hour and minutes are overridden; sec/ms stay.\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setUTCHours(11, 35)\",\n timestamp_from_utc(base_y, base_m, base_d, 11, 35, base_sec, base_ms),\n ),\n // setUTCHours(h, m, s): hour, minutes, seconds overridden; ms stays.\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setUTCHours(11, 35, 23)\",\n timestamp_from_utc(base_y, base_m, base_d, 11, 35, 23, base_ms),\n ),\n // setUTCHours(h, m, s, ms): all time components overridden.\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setUTCHours(11, 35, 23, 537)\",\n timestamp_from_utc(base_y, base_m, base_d, 11, 35, 23, 537),\n ),\n // Out-of-bounds: all time components specified, overflow wraps across days.\n // The base timestamp is Day(t) from the local-time date's internal UTC value.\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setUTCHours(10000, 20000, 30000, 40123)\",\n {\n // setUTCHours computes MakeDate(Day(t), MakeTime(h, m, s, ms)).\n // Day(t) is the UTC day count of the base date, so we reconstruct\n // by starting from the base UTC midnight and adding the overflow.\n let base_day_ms = timestamp_from_utc(base_y, base_m, base_d, 0, 0, 0, 0);\n let total_ms = i64::from(10000) * 3_600_000\n + i64::from(20000) * 60_000\n + i64::from(30000) * 1_000\n + 40123;\n base_day_ms + total_ms\n },\n ),\n TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).setUTCHours(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_utc_milliseconds() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMilliseconds(597)\",\n timestamp_from_utc(2020, 7, 8, 9, 16, 15, 597),\n ),\n // Out-of-bounds\n // Thorough tests are done by setHours\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMilliseconds(40123)\",\n timestamp_from_utc(2020, 7, 8, 9, 16, 55, 123),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMilliseconds(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_utc_minutes() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMinutes(11)\",\n timestamp_from_utc(2020, 7, 8, 9, 11, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMinutes(11, 35)\",\n timestamp_from_utc(2020, 7, 8, 9, 11, 35, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMinutes(11, 35, 537)\",\n timestamp_from_utc(2020, 7, 8, 9, 11, 35, 537),\n ),\n // Out-of-bounds\n // Thorough tests are done by setHours\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMinutes(600000, 30000, 40123)\",\n timestamp_from_utc(2021, 8, 29, 9, 20, 40, 123),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMinutes(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_utc_month() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMonth(11)\",\n timestamp_from_utc(2020, 12, 8, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMonth(11, 16)\",\n timestamp_from_utc(2020, 12, 16, 9, 16, 15, 779),\n ),\n // Out-of-bounds\n // Thorough tests are done by setFullYear\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMonth(40, 83)\",\n timestamp_from_utc(2023, 7, 22, 9, 16, 15, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCMonth(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_set_utc_seconds() {\n run_test_actions([\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCSeconds(11)\",\n timestamp_from_utc(2020, 7, 8, 9, 16, 11, 779),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCSeconds(11, 487)\",\n timestamp_from_utc(2020, 7, 8, 9, 16, 11, 487),\n ),\n // Out-of-bounds\n // Thorough tests are done by setHour\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCSeconds(40000000, 40123)\",\n timestamp_from_utc(2021, 10, 14, 8, 23, 20, 123),\n ),\n TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).setUTCSeconds(1/0)\",\n f64::NAN,\n ),\n ]);\n}\n\n#[test]\nfn date_proto_to_date_string() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).toDateString()\",\n js_str!(\"Wed Jul 08 2020\"),\n )]);\n}\n\n#[test]\nfn date_proto_to_gmt_string() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).toGMTString()\",\n js_str!(\"Wed, 08 Jul 2020 09:16:15 GMT\"),\n )]);\n}\n\n#[test]\nfn date_proto_to_iso_string() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).toISOString()\",\n js_str!(\"2020-07-08T09:16:15.779Z\"),\n )]);\n}\n\n#[test]\nfn date_proto_to_iso_string_year_zero() {\n run_test_actions([TestAction::assert_eq(\n r#\"new Date(\"0000-06-15T00:00:00Z\").toISOString()\"#,\n js_str!(\"0000-06-15T00:00:00.000Z\"),\n )]);\n}\n\n#[test]\nfn date_proto_to_json() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).toJSON()\",\n js_str!(\"2020-07-08T09:16:15.779Z\"),\n )]);\n}\n\n#[test]\nfn date_proto_to_string() {\n let to_string_format = format_description!(\n \"[weekday repr:short] [month repr:short] [day] [year] [hour]:[minute]:[second] GMT[offset_hour sign:mandatory][offset_minute][end]\"\n );\n let t = from_local(2020, 7, 8, 9, 16, 15, 779)\n .format(to_string_format)\n .unwrap();\n\n run_test_actions([TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).toString()\",\n js_string!(t),\n )]);\n}\n\n#[test]\nfn date_proto_to_time_string() {\n let to_time_string_format = format_description!(\n \"[hour]:[minute]:[second] GMT[offset_hour sign:mandatory][offset_minute][end]\"\n );\n let t = from_local(2020, 7, 8, 9, 16, 15, 779)\n .format(to_time_string_format)\n .unwrap();\n\n run_test_actions([TestAction::assert_eq(\n \"new Date(2020, 6, 8, 9, 16, 15, 779).toTimeString()\",\n js_string!(t),\n )]);\n}\n\n#[test]\nfn date_proto_to_utc_string() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).toUTCString()\",\n js_str!(\"Wed, 08 Jul 2020 09:16:15 GMT\"),\n )]);\n}\n\n#[test]\nfn date_proto_value_of() {\n run_test_actions([TestAction::assert_eq(\n \"new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)).valueOf()\",\n 1_594_199_775_779_i64,\n )]);\n}\n\n#[test]\nfn date_neg() {\n run_test_actions([TestAction::assert_eq(\n \"-new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779))\",\n -1_594_199_775_779_i64,\n )]);\n}\n\n#[test]\nfn date_json() {\n run_test_actions([TestAction::assert_eq(\n \"JSON.stringify({ date: new Date(Date.UTC(2020, 6, 8, 9, 16, 15, 779)) })\",\n js_string!(r#\"{\"date\":\"2020-07-08T09:16:15.779Z\"}\"#),\n )]);\n}\n\n#[test]\nfn date_parse_hour24_validation() {\n run_test_actions([\n // 24:00:00.000 is valid (midnight end-of-day)\n TestAction::assert(\"!isNaN(Date.parse('2024-01-01T24:00:00Z'))\"),\n TestAction::assert(\"!isNaN(Date.parse('2024-01-01T24:00:00.000Z'))\"),\n // hour 24 with non-zero minutes/seconds/ms must be NaN\n TestAction::assert(\"isNaN(Date.parse('2024-01-01T24:30:00Z'))\"),\n TestAction::assert(\"isNaN(Date.parse('2024-01-01T24:00:01Z'))\"),\n TestAction::assert(\"isNaN(Date.parse('2024-01-01T24:00:00.001Z'))\"),\n ]);\n}\n\n#[test]\n#[cfg(feature = \"intl\")]\nfn date_proto_to_locale_string_intl() {\n run_test_actions([\n // Invalid receiver: spec requires TypeError\n TestAction::assert_native_error(\n \"Date.prototype.toLocaleString.call({})\",\n JsNativeErrorKind::Type,\n \"'this' is not a Date\",\n ),\n TestAction::assert_native_error(\n \"Date.prototype.toLocaleDateString.call({})\",\n JsNativeErrorKind::Type,\n \"'this' is not a Date\",\n ),\n TestAction::assert_native_error(\n \"Date.prototype.toLocaleTimeString.call({})\",\n JsNativeErrorKind::Type,\n \"'this' is not a Date\",\n ),\n TestAction::assert_eq(\"new Date(NaN).toLocaleString()\", js_str!(\"Invalid Date\")),\n TestAction::assert(\"typeof new Date(2020, 6, 8).toLocaleString() === 'string'\"),\n TestAction::assert(\"typeof new Date(2020, 6, 8).toLocaleDateString() === 'string'\"),\n TestAction::assert(\"typeof new Date(2020, 6, 8).toLocaleTimeString() === 'string'\"),\n TestAction::assert(\"typeof new Date(0).toLocaleString('en-US') === 'string'\"),\n TestAction::assert(\"typeof new Date(0).toLocaleDateString('en-US') === 'string'\"),\n TestAction::assert(\"typeof new Date(0).toLocaleDateString('de-DE') === 'string'\"),\n TestAction::assert(\"typeof new Date(0).toLocaleTimeString('en-US') === 'string'\"),\n // Prove locale pipeline: different locales produce different output\n TestAction::assert(\n \"new Date(0).toLocaleDateString('en-US') !== new Date(0).toLocaleDateString('de-DE')\",\n ),\n TestAction::assert(\n \"new Date(0).toLocaleString('en-US') !== new Date(0).toLocaleString('de-DE')\",\n ),\n TestAction::assert(\n \"new Date(0).toLocaleTimeString('en-US') !== new Date(0).toLocaleTimeString('de-DE')\",\n ),\n // Prove ToDateTimeOptions pipeline: options affect output\n TestAction::assert(\n \"typeof new Date(0).toLocaleDateString('en-US', { dateStyle: 'short' }) === 'string'\",\n ),\n // Prove output is a string and not empty\n TestAction::assert(\n \"new Date(0).toLocaleDateString('en-US', { dateStyle: 'short' }).length > 0\",\n ),\n ]);\n}\n" }, { "path": "core/engine/src/builtins/date/utils.rs", "content": "use crate::{JsStr, JsString, context::HostHooks, js_string, value::IntegerOrInfinity};\nuse boa_macros::js_str;\nuse boa_string::JsStrVariant;\nuse std::slice::Iter;\nuse std::str;\nuse std::{borrow::Cow, iter::Peekable};\nuse time::{OffsetDateTime, PrimitiveDateTime, macros::format_description};\n\n// Time-related Constants\n//\n// More info:\n// - [ECMAScript reference][spec]\n//\n// https://tc39.es/ecma262/#sec-time-related-constants\n\n// HoursPerDay = 24\nconst HOURS_PER_DAY: f64 = 24.0;\n\n// MinutesPerHour = 60\nconst MINUTES_PER_HOUR: f64 = 60.0;\n\n// SecondsPerMinute = 60\nconst SECONDS_PER_MINUTE: f64 = 60.0;\n\n// msPerSecond = 1000𝔽\nconst MS_PER_SECOND: f64 = 1000.0;\n\n// msPerMinute = 60000𝔽 = msPerSecond × 𝔽(SecondsPerMinute)\npub(super) const MS_PER_MINUTE: f64 = MS_PER_SECOND * SECONDS_PER_MINUTE;\n\n// msPerHour = 3600000𝔽 = msPerMinute × 𝔽(MinutesPerHour)\nconst MS_PER_HOUR: f64 = MS_PER_MINUTE * MINUTES_PER_HOUR;\n\n// msPerDay = 86400000𝔽 = msPerHour × 𝔽(HoursPerDay)\nconst MS_PER_DAY: f64 = MS_PER_HOUR * HOURS_PER_DAY;\n\n/// Abstract operation `Day ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-day\npub(super) fn day(t: f64) -> f64 {\n // 1. Return 𝔽(floor(ℝ(t / msPerDay))).\n (t / MS_PER_DAY).floor()\n}\n\n/// Abstract operation `TimeWithinDay ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-timewithinday\npub(super) fn time_within_day(t: f64) -> f64 {\n // 1. Return 𝔽(ℝ(t) modulo ℝ(msPerDay)).\n t.rem_euclid(MS_PER_DAY)\n}\n\n/// Abstract operation `DaysInYear ( y )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-daysinyear\nfn days_in_year(y: f64) -> u16 {\n // 1. Let ry be ℝ(y).\n let ry = y;\n\n // 2. If (ry modulo 400) = 0, return 366𝔽.\n if ry.rem_euclid(400.0) == 0.0 {\n return 366;\n }\n\n // 3. If (ry modulo 100) = 0, return 365𝔽.\n if ry.rem_euclid(100.0) == 0.0 {\n return 365;\n }\n\n // 4. If (ry modulo 4) = 0, return 366𝔽.\n if ry.rem_euclid(4.0) == 0.0 {\n return 366;\n }\n\n // 5. Return 365𝔽.\n 365\n}\n\n/// Abstract operation `DayFromYear ( y )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-dayfromyear\nfn day_from_year(y: f64) -> f64 {\n // 1. Let ry be ℝ(y).\n // 2. NOTE: In the following steps, each _numYearsN_ is the number of years divisible by N\n // that occur between the epoch and the start of year y.\n // (The number is negative if y is before the epoch.)\n\n // 3. Let numYears1 be (ry - 1970).\n let num_years_1 = y - 1970.0;\n\n // 4. Let numYears4 be floor((ry - 1969) / 4).\n let num_years_4 = ((y - 1969.0) / 4.0).floor();\n\n // 5. Let numYears100 be floor((ry - 1901) / 100).\n let num_years_100 = ((y - 1901.0) / 100.0).floor();\n\n // 6. Let numYears400 be floor((ry - 1601) / 400).\n let num_years_400 = ((y - 1601.0) / 400.0).floor();\n\n // 7. Return 𝔽(365 × numYears1 + numYears4 - numYears100 + numYears400).\n 365.0 * num_years_1 + num_years_4 - num_years_100 + num_years_400\n}\n\n/// Abstract operation `TimeFromYear ( y )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-timefromyear\nfn time_from_year(y: f64) -> f64 {\n // 1. Return msPerDay × DayFromYear(y).\n MS_PER_DAY * day_from_year(y)\n}\n\n/// Abstract operation `YearFromTime ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-yearfromtime\npub(crate) fn year_from_time(t: f64) -> i32 {\n const MS_PER_AVERAGE_YEAR: f64 = 12.0 * 30.436_875 * MS_PER_DAY;\n\n // 1. Return the largest integral Number y (closest to +∞) such that TimeFromYear(y) ≤ t.\n let mut year = (((t + MS_PER_AVERAGE_YEAR / 2.0) / MS_PER_AVERAGE_YEAR).floor()) as i32 + 1970;\n if time_from_year(year.into()) > t {\n year -= 1;\n }\n year\n}\n\n/// Abstract operation `DayWithinYear ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-daywithinyear\nfn day_within_year(t: f64) -> u16 {\n // 1. Return Day(t) - DayFromYear(YearFromTime(t)).\n (day(t) - day_from_year(year_from_time(t).into())) as u16\n}\n\n/// Abstract operation `InLeapYear ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-inleapyear\nfn in_leap_year(t: f64) -> u16 {\n // 1. If DaysInYear(YearFromTime(t)) is 366𝔽, return 1𝔽; else return +0𝔽.\n (days_in_year(year_from_time(t).into()) == 366).into()\n}\n\n/// Abstract operation `MonthFromTime ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-monthfromtime\npub(crate) fn month_from_time(t: f64) -> u8 {\n // 1. Let inLeapYear be InLeapYear(t).\n let in_leap_year = in_leap_year(t);\n\n // 2. Let dayWithinYear be DayWithinYear(t).\n let day_within_year = day_within_year(t);\n\n match day_within_year {\n // 3. If dayWithinYear < 31𝔽, return +0𝔽.\n t if t < 31 => 0,\n // 4. If dayWithinYear < 59𝔽 + inLeapYear, return 1𝔽.\n t if t < 59 + in_leap_year => 1,\n // 5. If dayWithinYear < 90𝔽 + inLeapYear, return 2𝔽.\n t if t < 90 + in_leap_year => 2,\n // 6. If dayWithinYear < 120𝔽 + inLeapYear, return 3𝔽.\n t if t < 120 + in_leap_year => 3,\n // 7. If dayWithinYear < 151𝔽 + inLeapYear, return 4𝔽.\n t if t < 151 + in_leap_year => 4,\n // 8. If dayWithinYear < 181𝔽 + inLeapYear, return 5𝔽.\n t if t < 181 + in_leap_year => 5,\n // 9. If dayWithinYear < 212𝔽 + inLeapYear, return 6𝔽.\n t if t < 212 + in_leap_year => 6,\n // 10. If dayWithinYear < 243𝔽 + inLeapYear, return 7𝔽.\n t if t < 243 + in_leap_year => 7,\n // 11. If dayWithinYear < 273𝔽 + inLeapYear, return 8𝔽.\n t if t < 273 + in_leap_year => 8,\n // 12. If dayWithinYear < 304𝔽 + inLeapYear, return 9𝔽.\n t if t < 304 + in_leap_year => 9,\n // 13. If dayWithinYear < 334𝔽 + inLeapYear, return 10𝔽.\n t if t < 334 + in_leap_year => 10,\n // 14. Assert: dayWithinYear < 365𝔽 + inLeapYear.\n // 15. Return 11𝔽.\n _ => 11,\n }\n}\n\n/// Abstract operation `DateFromTime ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-datefromtime\npub(crate) fn date_from_time(t: f64) -> u8 {\n // 1. Let inLeapYear be InLeapYear(t).\n let in_leap_year = in_leap_year(t);\n\n // 2. Let dayWithinYear be DayWithinYear(t).\n let day_within_year = day_within_year(t);\n\n // 3. Let month be MonthFromTime(t).\n let month = month_from_time(t);\n\n let date = match month {\n // 4. If month is +0𝔽, return dayWithinYear + 1𝔽.\n 0 => day_within_year + 1,\n // 5. If month is 1𝔽, return dayWithinYear - 30𝔽.\n 1 => day_within_year - 30,\n // 6. If month is 2𝔽, return dayWithinYear - 58𝔽 - inLeapYear.\n 2 => day_within_year - 58 - in_leap_year,\n // 7. If month is 3𝔽, return dayWithinYear - 89𝔽 - inLeapYear.\n 3 => day_within_year - 89 - in_leap_year,\n // 8. If month is 4𝔽, return dayWithinYear - 119𝔽 - inLeapYear.\n 4 => day_within_year - 119 - in_leap_year,\n // 9. If month is 5𝔽, return dayWithinYear - 150𝔽 - inLeapYear.\n 5 => day_within_year - 150 - in_leap_year,\n // 10. If month is 6𝔽, return dayWithinYear - 180𝔽 - inLeapYear.\n 6 => day_within_year - 180 - in_leap_year,\n // 11. If month is 7𝔽, return dayWithinYear - 211𝔽 - inLeapYear.\n 7 => day_within_year - 211 - in_leap_year,\n // 12. If month is 8𝔽, return dayWithinYear - 242𝔽 - inLeapYear.\n 8 => day_within_year - 242 - in_leap_year,\n // 13. If month is 9𝔽, return dayWithinYear - 272𝔽 - inLeapYear.\n 9 => day_within_year - 272 - in_leap_year,\n // 14. If month is 10𝔽, return dayWithinYear - 303𝔽 - inLeapYear.\n 10 => day_within_year - 303 - in_leap_year,\n // 15. Assert: month is 11𝔽.\n // 16. Return dayWithinYear - 333𝔽 - inLeapYear.\n _ => day_within_year - 333 - in_leap_year,\n };\n date as u8\n}\n\n/// Abstract operation `WeekDay ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-weekday\npub(super) fn week_day(t: f64) -> u8 {\n // 1. Return 𝔽(ℝ(Day(t) + 4𝔽) modulo 7).\n (day(t) + 4.0).rem_euclid(7.0) as u8\n}\n\n/// Abstract operation `HourFromTime ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-hourfromtime\npub(crate) fn hour_from_time(t: f64) -> u8 {\n // 1. Return 𝔽(floor(ℝ(t / msPerHour)) modulo HoursPerDay).\n ((t / MS_PER_HOUR).floor()).rem_euclid(HOURS_PER_DAY) as u8\n}\n\n/// Abstract operation `MinFromTime ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-minfromtime\npub(crate) fn min_from_time(t: f64) -> u8 {\n // 1. Return 𝔽(floor(ℝ(t / msPerMinute)) modulo MinutesPerHour).\n ((t / MS_PER_MINUTE).floor()).rem_euclid(MINUTES_PER_HOUR) as u8\n}\n\n/// Abstract operation `SecFromTime ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-secfromtime\npub(crate) fn sec_from_time(t: f64) -> u8 {\n // 1. Return 𝔽(floor(ℝ(t / msPerSecond)) modulo SecondsPerMinute).\n ((t / MS_PER_SECOND).floor()).rem_euclid(SECONDS_PER_MINUTE) as u8\n}\n\n/// Abstract operation `msFromTime ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-msfromtime\npub(crate) fn ms_from_time(t: f64) -> u16 {\n // 1. Return 𝔽(ℝ(t) modulo ℝ(msPerSecond)).\n t.rem_euclid(MS_PER_SECOND) as u16\n}\n\n/// Abstract operation `LocalTime ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-localtime\npub(super) fn local_time(t: f64, hooks: &dyn HostHooks) -> f64 {\n t + f64::from(local_timezone_offset_seconds(t, hooks)) * MS_PER_SECOND\n}\n\n/// Abstract operation `UTC ( t )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-utc-t\npub(super) fn utc_t(t: f64, hooks: &dyn HostHooks) -> f64 {\n // 1. If t is not finite, return NaN.\n if !t.is_finite() {\n return f64::NAN;\n }\n\n t - f64::from(local_timezone_offset_seconds(t, hooks)) * MS_PER_SECOND\n}\n\n/// Abstract operation `MakeTime ( hour, min, sec, ms )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-maketime\npub(super) fn make_time(hour: f64, min: f64, sec: f64, ms: f64) -> f64 {\n // 1. If hour is not finite, min is not finite, sec is not finite, or ms is not finite, return NaN.\n if !hour.is_finite() || !min.is_finite() || !sec.is_finite() || !ms.is_finite() {\n return f64::NAN;\n }\n\n // 2. Let h be 𝔽(! ToIntegerOrInfinity(hour)).\n let h = hour.abs().floor().copysign(hour);\n\n // 3. Let m be 𝔽(! ToIntegerOrInfinity(min)).\n let m = min.abs().floor().copysign(min);\n\n // 4. Let s be 𝔽(! ToIntegerOrInfinity(sec)).\n let s = sec.abs().floor().copysign(sec);\n\n // 5. Let milli be 𝔽(! ToIntegerOrInfinity(ms)).\n let milli = ms.abs().floor().copysign(ms);\n\n // 6. Return ((h × msPerHour + m × msPerMinute) + s × msPerSecond) + milli.\n ((h * MS_PER_HOUR + m * MS_PER_MINUTE) + s * MS_PER_SECOND) + milli\n}\n\n/// Abstract operation `MakeDay ( year, month, date )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-makeday\npub(super) fn make_day(year: f64, month: f64, date: f64) -> f64 {\n // 1. If year is not finite, month is not finite, or date is not finite, return NaN.\n if !year.is_finite() || !month.is_finite() || !date.is_finite() {\n return f64::NAN;\n }\n\n // 2. Let y be 𝔽(! ToIntegerOrInfinity(year)).\n let y = year.abs().floor().copysign(year);\n\n // 3. Let m be 𝔽(! ToIntegerOrInfinity(month)).\n let m = month.abs().floor().copysign(month);\n\n // 4. Let dt be 𝔽(! ToIntegerOrInfinity(date)).\n let dt = date.abs().floor().copysign(date);\n\n // 5. Let ym be y + 𝔽(floor(ℝ(m) / 12)).\n let ym = y + (m / 12.0).floor();\n\n // 6. If ym is not finite, return NaN.\n if !ym.is_finite() {\n return f64::NAN;\n }\n\n // 7. Let mn be 𝔽(ℝ(m) modulo 12).\n let mn = m.rem_euclid(12.0) as u8;\n\n // 8. Find a finite time value t such that YearFromTime(t) is ym, MonthFromTime(t) is mn,\n // and DateFromTime(t) is 1𝔽;\n // but if this is not possible (because some argument is out of range), return NaN.\n let rest = if mn > 1 { 1.0 } else { 0.0 };\n let days_within_year_to_end_of_month = match mn {\n 0 => 0.0,\n 1 => 31.0,\n 2 => 59.0,\n 3 => 90.0,\n 4 => 120.0,\n 5 => 151.0,\n 6 => 181.0,\n 7 => 212.0,\n 8 => 243.0,\n 9 => 273.0,\n 10 => 304.0,\n 11 => 334.0,\n 12 => 365.0,\n _ => unreachable!(),\n };\n let t =\n (day_from_year(ym + rest) - 365.0 * rest + days_within_year_to_end_of_month) * MS_PER_DAY;\n\n // 9. Return Day(t) + dt - 1𝔽.\n day(t) + dt - 1.0\n}\n\n/// Abstract operation `MakeDate ( day, time )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-makedate\npub(super) fn make_date(day: f64, time: f64) -> f64 {\n // 1. If day is not finite or time is not finite, return NaN.\n if !day.is_finite() || !time.is_finite() {\n return f64::NAN;\n }\n\n // 2. Let tv be day × msPerDay + time.\n let tv = day * MS_PER_DAY + time;\n\n // 3. If tv is not finite, return NaN.\n if !tv.is_finite() {\n return f64::NAN;\n }\n\n // 4. Return tv.\n tv\n}\n\n/// Abstract operation `MakeFullYear ( year )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-makefullyear\npub(super) fn make_full_year(year: f64) -> f64 {\n // 1. If year is NaN, return NaN.\n if year.is_nan() {\n return f64::NAN;\n }\n\n // 2. Let truncated be ! ToIntegerOrInfinity(year).\n let truncated = IntegerOrInfinity::from(year);\n\n // 3. If truncated is in the inclusive interval from 0 to 99, return 1900𝔽 + 𝔽(truncated).\n // 4. Return 𝔽(truncated).\n match truncated {\n IntegerOrInfinity::Integer(i) if (0..=99).contains(&i) => 1900.0 + i as f64,\n IntegerOrInfinity::Integer(i) => i as f64,\n IntegerOrInfinity::PositiveInfinity => f64::INFINITY,\n IntegerOrInfinity::NegativeInfinity => f64::NEG_INFINITY,\n }\n}\n\n/// Abstract operation `TimeClip ( time )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-timeclip\npub(crate) fn time_clip(time: f64) -> f64 {\n // 1. If time is not finite, return NaN.\n if !time.is_finite() {\n return f64::NAN;\n }\n\n // 2. If abs(ℝ(time)) > 8.64 × 10**15, return NaN.\n if time.abs() > 8.64e15 {\n return f64::NAN;\n }\n\n // 3. Return 𝔽(! ToIntegerOrInfinity(time)).\n let time = time.trunc();\n if time.abs() == 0.0 {\n return 0.0;\n }\n\n time\n}\n\n/// Abstract operation `TimeString ( tv )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-timestring\npub(super) fn time_string(tv: f64) -> JsString {\n // 1. Let hour be ToZeroPaddedDecimalString(ℝ(HourFromTime(tv)), 2).\n let mut binding = [0; 2];\n let hour = pad_two(hour_from_time(tv), &mut binding);\n\n // 2. Let minute be ToZeroPaddedDecimalString(ℝ(MinFromTime(tv)), 2).\n let mut binding = [0; 2];\n let minute = pad_two(min_from_time(tv), &mut binding);\n\n // 3. Let second be ToZeroPaddedDecimalStringbindingFromTime(tv)), 2).\n let mut binding = [0; 2];\n let second = pad_two(sec_from_time(tv), &mut binding);\n\n // 4. Return the string-concatenation of\n // hour,\n // \":\",\n // minute,\n // \":\",\n // second,\n // the code unit 0x0020 (SPACE),\n // and \"GMT\".\n js_string!(\n hour,\n js_str!(\":\"),\n minute,\n js_str!(\":\"),\n second,\n js_str!(\" GMT\")\n )\n}\n\n/// Abstract operation `DateString ( tv )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-datestring\npub(super) fn date_string(tv: f64) -> JsString {\n // 1. Let weekday be the Name of the entry in Table 63 with the Number WeekDay(tv).\n let weekday = match week_day(tv) {\n 0 => js_str!(\"Sun\"),\n 1 => js_str!(\"Mon\"),\n 2 => js_str!(\"Tue\"),\n 3 => js_str!(\"Wed\"),\n 4 => js_str!(\"Thu\"),\n 5 => js_str!(\"Fri\"),\n 6 => js_str!(\"Sat\"),\n _ => unreachable!(),\n };\n\n // 2. Let month be the Name of the entry in Table 64 with the Number MonthFromTime(tv).\n let month = match month_from_time(tv) {\n 0 => js_str!(\"Jan\"),\n 1 => js_str!(\"Feb\"),\n 2 => js_str!(\"Mar\"),\n 3 => js_str!(\"Apr\"),\n 4 => js_str!(\"May\"),\n 5 => js_str!(\"Jun\"),\n 6 => js_str!(\"Jul\"),\n 7 => js_str!(\"Aug\"),\n 8 => js_str!(\"Sep\"),\n 9 => js_str!(\"Oct\"),\n 10 => js_str!(\"Nov\"),\n 11 => js_str!(\"Dec\"),\n _ => unreachable!(),\n };\n\n // 3. Let day be ToZeroPaddedDecimalString(ℝ(DateFromTime(tv)), 2).\n let mut binding = [0; 2];\n let day = pad_two(date_from_time(tv), &mut binding);\n\n // 4. Let yv be YearFromTime(tv).\n let yv = year_from_time(tv);\n\n // 5. If yv is +0𝔽 or yv > +0𝔽, let yearSign be the empty String; otherwise, let yearSign be \"-\".\n let year_sign = if yv >= 0 { js_str!(\"\") } else { js_str!(\"-\") };\n\n // 6. Let paddedYear be ToZeroPaddedDecimalString(abs(ℝ(yv)), 4).\n let yv = yv.unsigned_abs();\n let padded_year: JsString = if yv >= 100_000 {\n pad_six(yv, &mut [0; 6]).into()\n } else if yv >= 10000 {\n pad_five(yv, &mut [0; 5]).into()\n } else {\n pad_four(yv, &mut [0; 4]).into()\n };\n\n // 7. Return the string-concatenation of\n // weekday,\n // the code unit 0x0020 (SPACE),\n // month,\n // the code unit 0x0020 (SPACE),\n // day,\n // the code unit 0x0020 (SPACE),\n // yearSign,\n // and paddedYear.\n js_string!(\n weekday,\n js_str!(\" \"),\n month,\n js_str!(\" \"),\n day,\n js_str!(\" \"),\n year_sign,\n &padded_year\n )\n}\n\n/// Abstract operation `TimeZoneString ( tv )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-timezoneestring\npub(super) fn time_zone_string(t: f64, hooks: &dyn HostHooks) -> JsString {\n // 1. Let systemTimeZoneIdentifier be SystemTimeZoneIdentifier().\n // 2. If IsTimeZoneOffsetString(systemTimeZoneIdentifier) is true, then\n // a. Let offsetNs be ParseTimeZoneOffsetString(systemTimeZoneIdentifier).\n // 3. Else,\n // a. Let offsetNs be GetNamedTimeZoneOffsetNanoseconds(systemTimeZoneIdentifier, ℤ(ℝ(tv) × 10**6)).\n // 4. Let offset be 𝔽(truncate(offsetNs / 10**6)).\n let offset = f64::from(local_timezone_offset_seconds(t, hooks)) * MS_PER_SECOND;\n //let offset = hooks.local_timezone_offset_seconds((t / MS_PER_SECOND).floor() as i64);\n\n // 5. If offset is +0𝔽 or offset > +0𝔽, then\n let (offset_sign, abs_offset) = if offset >= 0.0 {\n // a. Let offsetSign be \"+\".\n // b. Let absOffset be offset.\n (js_str!(\"+\"), offset)\n }\n // 6. Else,\n else {\n // a. Let offsetSign be \"-\".\n // b. Let absOffset be -offset.\n (js_str!(\"-\"), -offset)\n };\n\n // 7. Let offsetMin be ToZeroPaddedDecimalString(ℝ(MinFromTime(absOffset)), 2).\n let mut binding = [0; 2];\n let offset_min = pad_two(min_from_time(abs_offset), &mut binding);\n\n // 8. Let offsetHour be ToZeroPaddedDecimalString(ℝ(HourFromTime(absOffset)), 2).\n let mut binding = [0; 2];\n let offset_hour = pad_two(hour_from_time(abs_offset), &mut binding);\n\n // 9. Let tzName be an implementation-defined string that is either the empty String or the\n // string-concatenation of the code unit 0x0020 (SPACE), the code unit 0x0028 (LEFT PARENTHESIS),\n // an implementation-defined timezone name, and the code unit 0x0029 (RIGHT PARENTHESIS).\n // 10. Return the string-concatenation of offsetSign, offsetHour, offsetMin, and tzName.\n js_string!(offset_sign, offset_hour, offset_min)\n}\n\n/// Abstract operation `ToDateString ( tv )`\n///\n/// More info:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-todatestring\npub(super) fn to_date_string_t(tv: f64, hooks: &dyn HostHooks) -> JsString {\n // 1. If tv is NaN, return \"Invalid Date\".\n if tv.is_nan() {\n return js_string!(\"Invalid Date\");\n }\n\n // 2. Let t be LocalTime(tv).\n let t = local_time(tv, hooks);\n\n // 3. Return the string-concatenation of\n // DateString(t),\n // the code unit 0x0020 (SPACE),\n // TimeString(t),\n // and TimeZoneString(tv).\n js_string!(\n &date_string(t),\n js_str!(\" \"),\n &time_string(t),\n &time_zone_string(t, hooks)\n )\n}\n\nfn local_timezone_offset_seconds(t: f64, hooks: &dyn HostHooks) -> i32 {\n let millis = t.rem_euclid(MS_PER_SECOND);\n let seconds = ((t - millis) / MS_PER_SECOND) as i64;\n hooks.local_timezone_offset_seconds(seconds)\n}\n\npub(super) fn pad_two(t: u8, output: &mut [u8; 2]) -> JsStr<'_> {\n *output = if t < 10 {\n [b'0', b'0' + t]\n } else {\n [b'0' + (t / 10), b'0' + (t % 10)]\n };\n debug_assert!(output.is_ascii());\n\n JsStr::latin1(output)\n}\n\npub(super) fn pad_three(t: u16, output: &mut [u8; 3]) -> JsStr<'_> {\n *output = [\n b'0' + (t / 100) as u8,\n b'0' + ((t / 10) % 10) as u8,\n b'0' + (t % 10) as u8,\n ];\n\n JsStr::latin1(output)\n}\n\npub(super) fn pad_four(t: u32, output: &mut [u8; 4]) -> JsStr<'_> {\n *output = [\n b'0' + (t / 1000) as u8,\n b'0' + ((t / 100) % 10) as u8,\n b'0' + ((t / 10) % 10) as u8,\n b'0' + (t % 10) as u8,\n ];\n\n JsStr::latin1(output)\n}\n\npub(super) fn pad_five(t: u32, output: &mut [u8; 5]) -> JsStr<'_> {\n *output = [\n b'0' + (t / 10_000) as u8,\n b'0' + ((t / 1000) % 10) as u8,\n b'0' + ((t / 100) % 10) as u8,\n b'0' + ((t / 10) % 10) as u8,\n b'0' + (t % 10) as u8,\n ];\n\n JsStr::latin1(output)\n}\n\npub(super) fn pad_six(t: u32, output: &mut [u8; 6]) -> JsStr<'_> {\n *output = [\n b'0' + (t / 100_000) as u8,\n b'0' + ((t / 10_000) % 10) as u8,\n b'0' + ((t / 1000) % 10) as u8,\n b'0' + ((t / 100) % 10) as u8,\n b'0' + ((t / 10) % 10) as u8,\n b'0' + (t % 10) as u8,\n ];\n\n JsStr::latin1(output)\n}\n\n/// Parse a date string according to the steps specified in [`Date.parse`][spec].\n///\n/// We parse three different formats:\n/// - The [`Date Time String Format`][spec-format] specified in the spec: `YYYY-MM-DDTHH:mm:ss.sssZ`\n/// - The `toString` format: `Thu Jan 01 1970 00:00:00 GMT+0000`\n/// - The `toUTCString` format: `Thu, 01 Jan 1970 00:00:00 GMT`\n///\n/// [spec]: https://tc39.es/ecma262/#sec-date.parse\n/// [spec-format]: https://tc39.es/ecma262/#sec-date-time-string-format\npub(super) fn parse_date(date: &JsString, hooks: &dyn HostHooks) -> Option {\n // All characters must be ASCII so we can return early if we find a non-ASCII character.\n let owned_js_str = date.as_str();\n let date = match owned_js_str.variant() {\n JsStrVariant::Latin1(s) => {\n if !s.is_ascii() {\n return None;\n }\n // SAFETY: Since all characters are ASCII we can safely convert this into str.\n Cow::Borrowed(unsafe { str::from_utf8_unchecked(s) })\n }\n JsStrVariant::Utf16(s) => {\n let date = String::from_utf16(s).ok()?;\n if !date.is_ascii() {\n return None;\n }\n Cow::Owned(date)\n }\n };\n\n // Date Time String Format: 'YYYY-MM-DDTHH:mm:ss.sssZ'\n if let Some(dt) = DateParser::new(&date, hooks).parse() {\n return Some(dt);\n }\n\n // `toString` format: `Thu Jan 01 1970 00:00:00 GMT+0000`\n if let Ok(t) = OffsetDateTime::parse(\n &date,\n &format_description!(\n \"[weekday repr:short] [month repr:short] [day] [year] [hour]:[minute]:[second] GMT[offset_hour sign:mandatory][offset_minute][end]\"\n ),\n ) {\n return Some(t.unix_timestamp() * 1000 + i64::from(t.millisecond()));\n }\n\n // `toUTCString` format: `Thu, 01 Jan 1970 00:00:00 GMT`\n if let Ok(t) = PrimitiveDateTime::parse(\n &date,\n &format_description!(\n \"[weekday repr:short], [day] [month repr:short] [year] [hour]:[minute]:[second] GMT[end]\"\n ),\n ) {\n let t = t.assume_utc();\n return Some(t.unix_timestamp() * 1000 + i64::from(t.millisecond()));\n }\n\n None\n}\n\n/// Parses a date string according to the [`Date Time String Format`][spec].\n///\n/// [spec]: https://tc39.es/ecma262/#sec-date-time-string-format\nstruct DateParser<'a> {\n hooks: &'a dyn HostHooks,\n input: Peekable>,\n year: i32,\n month: u32,\n day: u32,\n hour: u32,\n minute: u32,\n second: u32,\n millisecond: u32,\n offset: i64,\n}\n\n// Copied from https://github.com/RoDmitry/atoi_simd/blob/master/src/fallback.rs,\n// which is based on https://rust-malaysia.github.io/code/2020/07/11/faster-integer-parsing.html.\n#[doc(hidden)]\n#[allow(clippy::inline_always)]\npub(in crate::builtins::date) mod fast_atoi {\n #[inline(always)]\n pub(in crate::builtins::date) const fn process_8(mut val: u64, len: usize) -> u64 {\n val <<= 64_usize.saturating_sub(len << 3); // << 3 - same as mult by 8\n val = (val & 0x0F0F_0F0F_0F0F_0F0F).wrapping_mul(0xA01) >> 8;\n val = (val & 0x00FF_00FF_00FF_00FF).wrapping_mul(0x64_0001) >> 16;\n (val & 0x0000_FFFF_0000_FFFF).wrapping_mul(0x2710_0000_0001) >> 32\n }\n\n #[inline(always)]\n pub(in crate::builtins::date) const fn process_4(mut val: u32, len: usize) -> u32 {\n val <<= 32_usize.saturating_sub(len << 3); // << 3 - same as mult by 8\n val = (val & 0x0F0F_0F0F).wrapping_mul(0xA01) >> 8;\n (val & 0x00FF_00FF).wrapping_mul(0x64_0001) >> 16\n }\n}\n\nimpl<'a> DateParser<'a> {\n fn new(s: &'a str, hooks: &'a dyn HostHooks) -> Self {\n Self {\n hooks,\n input: s.as_bytes().iter().peekable(),\n year: 0,\n month: 1,\n day: 1,\n hour: 0,\n minute: 0,\n second: 0,\n millisecond: 0,\n offset: 0,\n }\n }\n\n fn next_expect(&mut self, expect: u8) -> Option<()> {\n self.input\n .next()\n .and_then(|c| if *c == expect { Some(()) } else { None })\n }\n\n fn next_ascii_digit(&mut self) -> Option {\n self.input\n .next()\n .and_then(|c| if c.is_ascii_digit() { Some(*c) } else { None })\n }\n\n fn next_n_ascii_digits(&mut self) -> Option<[u8; N]> {\n let mut digits = [0; N];\n for digit in &mut digits {\n *digit = self.next_ascii_digit()?;\n }\n Some(digits)\n }\n\n fn parse_n_ascii_digits(&mut self) -> Option {\n assert!(N <= 8, \"parse_n_ascii_digits parses no more than 8 digits\");\n if N == 0 {\n return None;\n }\n let ascii_digits = self.next_n_ascii_digits::()?;\n match N {\n 1..4 => {\n // When N is small, process digits naively.\n let mut res = 0;\n for digit in ascii_digits {\n res = res * 10 + u64::from(digit & 0xF);\n }\n Some(res)\n }\n 4 => {\n // Process digits as an u32 block.\n let mut src = [0; 4];\n src[..N].copy_from_slice(&ascii_digits);\n let val = u32::from_le_bytes(src);\n Some(u64::from(fast_atoi::process_4(val, N)))\n }\n _ => {\n // Process digits as an u64 block.\n let mut src = [0; 8];\n src[..N].copy_from_slice(&ascii_digits);\n let val = u64::from_le_bytes(src);\n Some(fast_atoi::process_8(val, N))\n }\n }\n }\n\n fn finish(&mut self) -> Option {\n if self.input.peek().is_some() {\n return None;\n }\n\n // Hour 24 is only valid as 24:00:00.000\n if self.hour == 24 && (self.minute != 0 || self.second != 0 || self.millisecond != 0) {\n return None;\n }\n\n let date = make_date(\n make_day(self.year.into(), (self.month - 1).into(), self.day.into()),\n make_time(\n self.hour.into(),\n self.minute.into(),\n self.second.into(),\n self.millisecond.into(),\n ),\n );\n\n let date = date + (self.offset as f64) * MS_PER_MINUTE;\n\n let t = time_clip(date);\n if t.is_finite() { Some(t as i64) } else { None }\n }\n\n fn finish_local(&mut self) -> Option {\n if self.input.peek().is_some() {\n return None;\n }\n\n // Hour 24 is only valid as 24:00:00.000\n if self.hour == 24 && (self.minute != 0 || self.second != 0 || self.millisecond != 0) {\n return None;\n }\n\n let date = make_date(\n make_day(self.year.into(), (self.month - 1).into(), self.day.into()),\n make_time(\n self.hour.into(),\n self.minute.into(),\n self.second.into(),\n self.millisecond.into(),\n ),\n );\n\n let t = time_clip(utc_t(date, self.hooks));\n if t.is_finite() { Some(t as i64) } else { None }\n }\n\n #[allow(clippy::as_conversions)]\n fn parse(&mut self) -> Option {\n self.parse_year()?;\n match self.input.peek() {\n Some(b'T') => return self.parse_time(),\n None => return self.finish(),\n _ => {}\n }\n self.next_expect(b'-')?;\n self.month = self.parse_n_ascii_digits::<2>()? as u32;\n if self.month < 1 || self.month > 12 {\n return None;\n }\n match self.input.peek() {\n Some(b'T') => return self.parse_time(),\n None => return self.finish(),\n _ => {}\n }\n self.next_expect(b'-')?;\n self.day = self.parse_n_ascii_digits::<2>()? as u32;\n if self.day < 1 || self.day > 31 {\n return None;\n }\n match self.input.peek() {\n Some(b'T') => self.parse_time(),\n _ => self.finish(),\n }\n }\n\n #[allow(clippy::as_conversions)]\n fn parse_year(&mut self) -> Option<()> {\n if let &&sign @ (b'+' | b'-') = self.input.peek()? {\n // Consume the sign.\n self.input.next();\n let year = self.parse_n_ascii_digits::<6>()? as i32;\n let neg = sign == b'-';\n if neg && year == 0 {\n return None;\n }\n self.year = if neg { -year } else { year };\n } else {\n self.year = self.parse_n_ascii_digits::<4>()? as i32;\n }\n Some(())\n }\n\n #[allow(clippy::as_conversions)]\n fn parse_time(&mut self) -> Option {\n self.next_expect(b'T')?;\n self.hour = self.parse_n_ascii_digits::<2>()? as u32;\n if self.hour > 24 {\n return None;\n }\n self.next_expect(b':')?;\n self.minute = self.parse_n_ascii_digits::<2>()? as u32;\n if self.minute > 59 {\n return None;\n }\n match self.input.peek() {\n Some(b':') => self.input.next(),\n None => return self.finish_local(),\n _ => {\n self.parse_timezone()?;\n return self.finish();\n }\n };\n self.second = self.parse_n_ascii_digits::<2>()? as u32;\n if self.second > 59 {\n return None;\n }\n match self.input.peek() {\n Some(b'.') => self.input.next(),\n None => return self.finish_local(),\n _ => {\n self.parse_timezone()?;\n return self.finish();\n }\n };\n self.millisecond = self.parse_n_ascii_digits::<3>()? as u32;\n if self.input.peek().is_some() {\n self.parse_timezone()?;\n self.finish()\n } else {\n self.finish_local()\n }\n }\n\n #[allow(clippy::as_conversions)]\n fn parse_timezone(&mut self) -> Option<()> {\n match self.input.next() {\n Some(b'Z') => return Some(()),\n Some(sign @ (b'+' | b'-')) => {\n let neg = *sign == b'-';\n let offset_hour = self.parse_n_ascii_digits::<2>()? as i64;\n if offset_hour > 23 {\n return None;\n }\n self.offset = if neg { offset_hour } else { -offset_hour } * 60;\n if self.input.peek().is_none() {\n return Some(());\n }\n self.next_expect(b':')?;\n let offset_minute = self.parse_n_ascii_digits::<2>()? as i64;\n if offset_minute > 59 {\n return None;\n }\n self.offset += if neg { offset_minute } else { -offset_minute };\n }\n _ => return None,\n }\n Some(())\n }\n}\n" }, { "path": "core/engine/src/builtins/error/aggregate.rs", "content": "//! This module implements the global `AggregateError` object.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-aggregate-error\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/AggregateError\n\nuse crate::{\n Context, JsArgs, JsExpect, JsResult, JsString, JsValue,\n builtins::{\n Array, BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject,\n iterable::IteratorHint,\n },\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n object::{JsObject, internal_methods::get_prototype_from_constructor},\n property::{Attribute, PropertyDescriptorBuilder},\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{Error, ErrorKind};\n\n#[derive(Debug, Clone, Copy)]\npub(crate) struct AggregateError;\n\nimpl IntrinsicObject for AggregateError {\n fn init(realm: &Realm) {\n let attribute = Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE;\n BuiltInBuilder::from_standard_constructor::(realm)\n .prototype(realm.intrinsics().constructors().error().constructor())\n .inherits(Some(realm.intrinsics().constructors().error().prototype()))\n .property(js_string!(\"name\"), Self::NAME, attribute)\n .property(js_string!(\"message\"), js_string!(), attribute)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for AggregateError {\n const NAME: JsString = StaticJsStrings::AGGREGATE_ERROR;\n}\n\nimpl BuiltInConstructor for AggregateError {\n const CONSTRUCTOR_ARGUMENTS: usize = 2;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::aggregate_error;\n\n /// [`AggregateError ( errors, message [ , options ] )`][spec]\n ///\n /// Creates a new aggregate error object.\n ///\n /// [spec]: AggregateError ( errors, message [ , options ] )\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, let newTarget be the active function object; else let newTarget be NewTarget.\n let new_target = &if new_target.is_undefined() {\n context\n .active_function_object()\n .unwrap_or_else(|| {\n context\n .intrinsics()\n .constructors()\n .aggregate_error()\n .constructor()\n })\n .into()\n } else {\n new_target.clone()\n };\n // 2. Let O be ? OrdinaryCreateFromConstructor(newTarget, \"%AggregateError.prototype%\", « [[ErrorData]] »).\n let prototype = get_prototype_from_constructor(\n new_target,\n StandardConstructors::aggregate_error,\n context,\n )?;\n let o = JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n prototype,\n Error::with_caller_position(ErrorKind::Aggregate, context),\n )\n .upcast();\n\n // 3. If message is not undefined, then\n let message = args.get_or_undefined(1);\n if !message.is_undefined() {\n // a. Let msg be ? ToString(message).\n let msg = message.to_string(context)?;\n\n // b. Perform CreateNonEnumerableDataPropertyOrThrow(O, \"message\", msg).\n o.create_non_enumerable_data_property_or_throw(js_string!(\"message\"), msg, context);\n }\n\n // 4. Perform ? InstallErrorCause(O, options).\n Error::install_error_cause(&o, args.get_or_undefined(2), context)?;\n\n // 5. Let errorsList be ? IteratorToList(? GetIterator(errors, sync)).\n let errors = args.get_or_undefined(0);\n let errors_list = errors\n .get_iterator(IteratorHint::Sync, context)?\n .into_list(context)?;\n\n // 6. Perform ! DefinePropertyOrThrow(O, \"errors\",\n // PropertyDescriptor {\n // [[Configurable]]: true,\n // [[Enumerable]]: false,\n // [[Writable]]: true,\n // [[Value]]: CreateArrayFromList(errorsList)\n // }).\n o.define_property_or_throw(\n js_string!(\"errors\"),\n PropertyDescriptorBuilder::new()\n .configurable(true)\n .enumerable(false)\n .writable(true)\n .value(Array::create_array_from_list(errors_list, context))\n .build(),\n context,\n )\n .js_expect(\"should not fail according to spec\")?;\n\n // 5. Return O.\n Ok(o.into())\n }\n}\n" }, { "path": "core/engine/src/builtins/error/eval.rs", "content": "//! This module implements the global `EvalError` object.\n//!\n//! Indicates an error regarding the global `eval()` function.\n//! This exception is not thrown by JavaScript anymore, however\n//! the `EvalError` object remains for compatibility.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-evalerror\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/EvalError\n\nuse crate::{\n Context, JsResult, JsString, JsValue,\n builtins::{BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n object::JsObject,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{Error, ErrorKind};\n\n/// JavaScript `EvalError` implementation.\n#[derive(Debug, Clone, Copy)]\npub(crate) struct EvalError;\n\nimpl IntrinsicObject for EvalError {\n fn init(realm: &Realm) {\n let attribute = Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE;\n BuiltInBuilder::from_standard_constructor::(realm)\n .prototype(realm.intrinsics().constructors().error().constructor())\n .inherits(Some(realm.intrinsics().constructors().error().prototype()))\n .property(js_string!(\"name\"), Self::NAME, attribute)\n .property(js_string!(\"message\"), js_string!(), attribute)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for EvalError {\n const NAME: JsString = StaticJsStrings::EVAL_ERROR;\n}\n\nimpl BuiltInConstructor for EvalError {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::eval_error;\n\n /// Create a new error object.\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n Error::native_error_constructor(\n new_target,\n args,\n context,\n ErrorKind::Eval,\n StandardConstructors::eval_error,\n )\n }\n}\n" }, { "path": "core/engine/src/builtins/error/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `Error` object.\n//!\n//! Error objects are thrown when runtime errors occur.\n//! The Error object can also be used as a base object for user-defined exceptions.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-error-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error\n\nuse crate::{\n Context, JsArgs, JsData, JsResult, JsString, JsValue,\n builtins::BuiltInObject,\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::{IgnoreEq, JsNativeError},\n js_string,\n object::{JsObject, internal_methods::get_prototype_from_constructor},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n vm::shadow_stack::{Backtrace, ShadowEntry},\n};\nuse boa_gc::{Finalize, Trace};\nuse boa_macros::js_str;\n\npub(crate) mod aggregate;\npub(crate) mod eval;\npub(crate) mod range;\npub(crate) mod reference;\npub(crate) mod syntax;\npub(crate) mod r#type;\npub(crate) mod uri;\n\n#[cfg(test)]\nmod tests;\n\npub(crate) use self::aggregate::AggregateError;\npub(crate) use self::eval::EvalError;\npub(crate) use self::range::RangeError;\npub(crate) use self::reference::ReferenceError;\npub(crate) use self::syntax::SyntaxError;\npub(crate) use self::r#type::TypeError;\npub(crate) use self::uri::UriError;\n\nuse super::{BuiltInBuilder, BuiltInConstructor, IntrinsicObject};\n\n/// A tag of built-in `Error` object, [ECMAScript spec][spec].\n///\n/// [spec]: https://tc39.es/ecma262/#sec-error-objects\n#[derive(Debug, Copy, Clone, Eq, PartialEq, Trace, Finalize, JsData)]\n#[boa_gc(empty_trace)]\n#[non_exhaustive]\npub enum ErrorKind {\n /// The `AggregateError` object type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-aggregate-error-objects\n Aggregate,\n\n /// The `Error` object type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-error-objects\n Error,\n\n /// The `EvalError` type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-evalerror\n Eval,\n\n /// The `TypeError` type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-typeerror\n Type,\n\n /// The `RangeError` type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-rangeerror\n Range,\n\n /// The `ReferenceError` type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-referenceerror\n Reference,\n\n /// The `SyntaxError` type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-syntaxerror\n Syntax,\n\n /// The `URIError` type.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-urierror\n Uri,\n}\n\n/// A built-in `Error` object, per the [ECMAScript spec][spec].\n///\n/// This is used internally to convert between [`JsObject`] and\n/// [`JsNativeError`] correctly, but it can also be used to manually create `Error`\n/// objects. However, the recommended way to create them is to construct a\n/// `JsNativeError` first, then call [`JsNativeError::into_opaque`],\n/// which will assign its prototype, properties and kind automatically.\n///\n/// For a description of every error kind and its usage, see\n/// [`JsNativeErrorKind`][crate::error::JsNativeErrorKind].\n///\n/// [spec]: https://tc39.es/ecma262/#sec-error-objects\n#[derive(Debug, Clone, PartialEq, Eq, Trace, Finalize, JsData)]\npub struct Error {\n pub(crate) tag: ErrorKind,\n\n // The position of where the Error was created does not affect equality check.\n #[unsafe_ignore_trace]\n pub(crate) position: IgnoreEq>,\n\n // The backtrace captured when this error was thrown. Stored here so it\n // survives the JsError → JsValue → JsError round-trip through promise\n // rejection. Does not affect equality checks.\n #[unsafe_ignore_trace]\n pub(crate) backtrace: IgnoreEq>,\n}\n\nimpl Error {\n /// Create a new [`Error`].\n #[inline]\n #[must_use]\n pub fn new(tag: ErrorKind) -> Self {\n Self {\n tag,\n position: IgnoreEq(None),\n backtrace: IgnoreEq(None),\n }\n }\n\n /// Create a new [`Error`] with the given optional [`ShadowEntry`].\n pub(crate) fn with_shadow_entry(tag: ErrorKind, entry: Option) -> Self {\n Self {\n tag,\n position: IgnoreEq(entry),\n backtrace: IgnoreEq(None),\n }\n }\n\n /// Get the position from the last called function.\n pub(crate) fn with_caller_position(tag: ErrorKind, context: &Context) -> Self {\n Self {\n tag,\n position: IgnoreEq(context.vm.shadow_stack.caller_position()),\n backtrace: IgnoreEq(None),\n }\n }\n}\n\nimpl IntrinsicObject for Error {\n fn init(realm: &Realm) {\n let attribute = Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE;\n let builder = BuiltInBuilder::from_standard_constructor::(realm)\n .property(js_string!(\"name\"), Self::NAME, attribute)\n .property(js_string!(\"message\"), js_string!(), attribute)\n .method(Self::to_string, js_string!(\"toString\"), 0);\n\n #[cfg(feature = \"experimental\")]\n let builder = builder.static_method(Error::is_error, js_string!(\"isError\"), 1);\n\n builder.build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for Error {\n const NAME: JsString = StaticJsStrings::ERROR;\n}\n\nimpl BuiltInConstructor for Error {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 3;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 1;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::error;\n\n /// `Error( message [ , options ] )`\n ///\n /// Creates a new error object.\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, let newTarget be the active function object; else let newTarget be NewTarget.\n let new_target = &if new_target.is_undefined() {\n context\n .active_function_object()\n .unwrap_or_else(|| context.intrinsics().constructors().error().constructor())\n .into()\n } else {\n new_target.clone()\n };\n\n // 2. Let O be ? OrdinaryCreateFromConstructor(newTarget, \"%Error.prototype%\", « [[ErrorData]] »).\n let prototype =\n get_prototype_from_constructor(new_target, StandardConstructors::error, context)?;\n let o = JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n prototype,\n Error::with_caller_position(ErrorKind::Error, context),\n )\n .upcast();\n\n // 3. If message is not undefined, then\n let message = args.get_or_undefined(0);\n if !message.is_undefined() {\n // a. Let msg be ? ToString(message).\n let msg = message.to_string(context)?;\n\n // b. Perform CreateNonEnumerableDataPropertyOrThrow(O, \"message\", msg).\n o.create_non_enumerable_data_property_or_throw(js_string!(\"message\"), msg, context);\n }\n\n // 4. Perform ? InstallErrorCause(O, options).\n Self::install_error_cause(&o, args.get_or_undefined(1), context)?;\n\n // 5. Return O.\n Ok(o.into())\n }\n}\n\nimpl Error {\n pub(crate) fn install_error_cause(\n o: &JsObject,\n options: &JsValue,\n context: &mut Context,\n ) -> JsResult<()> {\n // 1. If Type(options) is Object and ? HasProperty(options, \"cause\") is true, then\n // 1.a. Let cause be ? Get(options, \"cause\").\n if let Some(options) = options.as_object()\n && let Some(cause) = options.try_get(js_string!(\"cause\"), context)?\n {\n // b. Perform CreateNonEnumerableDataPropertyOrThrow(O, \"cause\", cause).\n o.create_non_enumerable_data_property_or_throw(js_string!(\"cause\"), cause, context);\n }\n\n // 2. Return unused.\n Ok(())\n }\n\n /// `Error.prototype.toString()`\n ///\n /// The `toString()` method returns a string representing the specified Error object.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-error.prototype.tostring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error/toString\n #[allow(clippy::wrong_self_convention)]\n pub(crate) fn to_string(\n this: &JsValue,\n _: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let O be the this value.\n // 2. If Type(O) is not Object, throw a TypeError exception.\n let o = this\n .as_object()\n .ok_or_else(|| JsNativeError::typ().with_message(\"'this' is not an Object\"))?;\n\n // 3. Let name be ? Get(O, \"name\").\n let name = o.get(js_string!(\"name\"), context)?;\n\n // 4. If name is undefined, set name to \"Error\"; otherwise set name to ? ToString(name).\n let name = if name.is_undefined() {\n js_string!(\"Error\")\n } else {\n name.to_string(context)?\n };\n\n // 5. Let msg be ? Get(O, \"message\").\n let msg = o.get(js_string!(\"message\"), context)?;\n\n // 6. If msg is undefined, set msg to the empty String; otherwise set msg to ? ToString(msg).\n let msg = if msg.is_undefined() {\n js_string!()\n } else {\n msg.to_string(context)?\n };\n\n // 7. If name is the empty String, return msg.\n if name.is_empty() {\n return Ok(msg.into());\n }\n\n // 8. If msg is the empty String, return name.\n if msg.is_empty() {\n return Ok(name.into());\n }\n\n // 9. Return the string-concatenation of name, the code unit 0x003A (COLON),\n // the code unit 0x0020 (SPACE), and msg.\n Ok(js_string!(&name, js_str!(\": \"), &msg).into())\n }\n\n /// [`Error.isError`][spec].\n ///\n /// Returns a boolean indicating whether the argument is a built-in Error instance or not.\n ///\n /// [spec]: https://tc39.es/proposal-is-error/#sec-error.iserror\n #[cfg(feature = \"experimental\")]\n #[allow(clippy::unnecessary_wraps)]\n fn is_error(_: &JsValue, args: &[JsValue], _: &mut Context) -> JsResult {\n // 1. Return IsError(arg).\n\n // https://tc39.es/proposal-is-error/#sec-iserror\n\n // 1. If argument is not an Object, return false.\n // 2. If argument has an [[ErrorData]] internal slot, return true.\n // 3. Return false.\n Ok(args\n .get_or_undefined(0)\n .as_object()\n .is_some_and(|o| o.is::())\n .into())\n }\n\n /// Shared constructor logic for all `NativeError` subtypes.\n ///\n /// Implements the [`NativeError ( message [ , options ] )`][spec] algorithm,\n /// which is identical for `EvalError`, `RangeError`, `ReferenceError`,\n /// `SyntaxError`, `TypeError`, and `URIError`.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-nativeerror\n pub(super) fn native_error_constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n error_kind: ErrorKind,\n constructor_fn: fn(&StandardConstructors) -> &StandardConstructor,\n ) -> JsResult {\n let new_target = &if new_target.is_undefined() {\n context\n .active_function_object()\n .unwrap_or_else(|| {\n constructor_fn(context.intrinsics().constructors()).constructor()\n })\n .into()\n } else {\n new_target.clone()\n };\n\n let prototype = get_prototype_from_constructor(new_target, constructor_fn, context)?;\n let o = JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n prototype,\n Error::with_caller_position(error_kind, context),\n )\n .upcast();\n\n let message = args.get_or_undefined(0);\n if !message.is_undefined() {\n let msg = message.to_string(context)?;\n o.create_non_enumerable_data_property_or_throw(js_string!(\"message\"), msg, context);\n }\n\n Error::install_error_cause(&o, args.get_or_undefined(1), context)?;\n\n Ok(o.into())\n }\n}\n" }, { "path": "core/engine/src/builtins/error/range.rs", "content": "//! This module implements the global `RangeError` object.\n//!\n//! Indicates a value that is not in the set or range of allowable values.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-rangeerror\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RangeError\n\nuse crate::{\n Context, JsResult, JsString, JsValue,\n builtins::{BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n object::JsObject,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{Error, ErrorKind};\n\n/// JavaScript `RangeError` implementation.\n#[derive(Debug, Clone, Copy)]\npub(crate) struct RangeError;\n\nimpl IntrinsicObject for RangeError {\n fn init(realm: &Realm) {\n let attribute = Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE;\n BuiltInBuilder::from_standard_constructor::(realm)\n .prototype(realm.intrinsics().constructors().error().constructor())\n .inherits(Some(realm.intrinsics().constructors().error().prototype()))\n .property(js_string!(\"name\"), Self::NAME, attribute)\n .property(js_string!(\"message\"), js_string!(), attribute)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for RangeError {\n const NAME: JsString = StaticJsStrings::RANGE_ERROR;\n}\n\nimpl BuiltInConstructor for RangeError {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::range_error;\n\n /// Create a new error object.\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n Error::native_error_constructor(\n new_target,\n args,\n context,\n ErrorKind::Range,\n StandardConstructors::range_error,\n )\n }\n}\n" }, { "path": "core/engine/src/builtins/error/reference.rs", "content": "//! This module implements the global `ReferenceError` object.\n//!\n//! Indicates an error that occurs when de-referencing an invalid reference\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-referenceerror\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ReferenceError\n\nuse crate::{\n Context, JsResult, JsString, JsValue,\n builtins::{BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n object::JsObject,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{Error, ErrorKind};\n\n#[derive(Debug, Clone, Copy)]\npub(crate) struct ReferenceError;\n\nimpl IntrinsicObject for ReferenceError {\n fn init(realm: &Realm) {\n let attribute = Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE;\n BuiltInBuilder::from_standard_constructor::(realm)\n .prototype(realm.intrinsics().constructors().error().constructor())\n .inherits(Some(realm.intrinsics().constructors().error().prototype()))\n .property(js_string!(\"name\"), Self::NAME, attribute)\n .property(js_string!(\"message\"), js_string!(), attribute)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for ReferenceError {\n const NAME: JsString = StaticJsStrings::REFERENCE_ERROR;\n}\n\nimpl BuiltInConstructor for ReferenceError {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::reference_error;\n\n /// Create a new error object.\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n Error::native_error_constructor(\n new_target,\n args,\n context,\n ErrorKind::Reference,\n StandardConstructors::reference_error,\n )\n }\n}\n" }, { "path": "core/engine/src/builtins/error/syntax.rs", "content": "//! This module implements the global `SyntaxError` object.\n//!\n//! The `SyntaxError` object represents an error when trying to interpret syntactically invalid code.\n//! It is thrown when the JavaScript context encounters tokens or token order that does not conform\n//! to the syntax of the language when parsing code.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-syntaxerror\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/SyntaxError\n\nuse crate::{\n Context, JsResult, JsString, JsValue,\n builtins::{BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n object::JsObject,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{Error, ErrorKind};\n\n/// JavaScript `SyntaxError` implementation.\n#[derive(Debug, Clone, Copy)]\npub(crate) struct SyntaxError;\n\nimpl IntrinsicObject for SyntaxError {\n fn init(realm: &Realm) {\n let attribute = Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE;\n BuiltInBuilder::from_standard_constructor::(realm)\n .prototype(realm.intrinsics().constructors().error().constructor())\n .inherits(Some(realm.intrinsics().constructors().error().prototype()))\n .property(js_string!(\"name\"), Self::NAME, attribute)\n .property(js_string!(\"message\"), js_string!(), attribute)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for SyntaxError {\n const NAME: JsString = StaticJsStrings::SYNTAX_ERROR;\n}\n\nimpl BuiltInConstructor for SyntaxError {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::syntax_error;\n\n /// Create a new error object.\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n Error::native_error_constructor(\n new_target,\n args,\n context,\n ErrorKind::Syntax,\n StandardConstructors::syntax_error,\n )\n }\n}\n" }, { "path": "core/engine/src/builtins/error/tests.rs", "content": "use crate::{TestAction, run_test_actions};\nuse boa_macros::js_str;\nuse indoc::indoc;\n\n#[test]\nfn error_to_string() {\n run_test_actions([\n TestAction::assert_eq(\"(new Error('1')).toString()\", js_str!(\"Error: 1\")),\n TestAction::assert_eq(\"(new RangeError('2')).toString()\", js_str!(\"RangeError: 2\")),\n TestAction::assert_eq(\n \"(new ReferenceError('3')).toString()\",\n js_str!(\"ReferenceError: 3\"),\n ),\n TestAction::assert_eq(\n \"(new SyntaxError('4')).toString()\",\n js_str!(\"SyntaxError: 4\"),\n ),\n TestAction::assert_eq(\"(new TypeError('5')).toString()\", js_str!(\"TypeError: 5\")),\n TestAction::assert_eq(\"(new EvalError('6')).toString()\", js_str!(\"EvalError: 6\")),\n TestAction::assert_eq(\"(new URIError('7')).toString()\", js_str!(\"URIError: 7\")),\n // no message\n TestAction::assert_eq(\"(new Error()).toString()\", js_str!(\"Error\")),\n TestAction::assert_eq(\"(new RangeError()).toString()\", js_str!(\"RangeError\")),\n TestAction::assert_eq(\n \"(new ReferenceError()).toString()\",\n js_str!(\"ReferenceError\"),\n ),\n TestAction::assert_eq(\"(new SyntaxError()).toString()\", js_str!(\"SyntaxError\")),\n TestAction::assert_eq(\"(new TypeError()).toString()\", js_str!(\"TypeError\")),\n TestAction::assert_eq(\"(new EvalError()).toString()\", js_str!(\"EvalError\")),\n TestAction::assert_eq(\"(new URIError()).toString()\", js_str!(\"URIError\")),\n // no name\n TestAction::assert_eq(\n indoc! {r#\"\n let message = new Error('message');\n message.name = '';\n message.toString()\n \"#},\n js_str!(\"message\"),\n ),\n ]);\n}\n\n#[test]\nfn error_names() {\n run_test_actions([\n TestAction::assert_eq(\"Error.name\", js_str!(\"Error\")),\n TestAction::assert_eq(\"EvalError.name\", js_str!(\"EvalError\")),\n TestAction::assert_eq(\"RangeError.name\", js_str!(\"RangeError\")),\n TestAction::assert_eq(\"ReferenceError.name\", js_str!(\"ReferenceError\")),\n TestAction::assert_eq(\"SyntaxError.name\", js_str!(\"SyntaxError\")),\n TestAction::assert_eq(\"URIError.name\", js_str!(\"URIError\")),\n TestAction::assert_eq(\"TypeError.name\", js_str!(\"TypeError\")),\n TestAction::assert_eq(\"AggregateError.name\", js_str!(\"AggregateError\")),\n ]);\n}\n\n#[test]\nfn error_lengths() {\n run_test_actions([\n TestAction::assert_eq(\"Error.length\", 1),\n TestAction::assert_eq(\"EvalError.length\", 1),\n TestAction::assert_eq(\"RangeError.length\", 1),\n TestAction::assert_eq(\"ReferenceError.length\", 1),\n TestAction::assert_eq(\"SyntaxError.length\", 1),\n TestAction::assert_eq(\"URIError.length\", 1),\n TestAction::assert_eq(\"TypeError.length\", 1),\n TestAction::assert_eq(\"AggregateError.length\", 2),\n ]);\n}\n" }, { "path": "core/engine/src/builtins/error/type.rs", "content": "//! This module implements the global `TypeError` object.\n//!\n//! The `TypeError` object represents an error when an operation could not be performed,\n//! typically (but not exclusively) when a value is not of the expected type.\n//!\n//! A `TypeError` may be thrown when:\n//! - an operand or argument passed to a function is incompatible with the type expected by that operator or function.\n//! - when attempting to modify a value that cannot be changed.\n//! - when attempting to use a value in an inappropriate way.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-typeerror\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypeError\n\nuse crate::{\n Context, JsResult, JsString, JsValue, NativeFunction,\n builtins::{BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::JsNativeError,\n js_string,\n native_function::NativeFunctionObject,\n object::JsObject,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{Error, ErrorKind};\n\n/// JavaScript `TypeError` implementation.\n#[derive(Debug, Clone, Copy)]\npub(crate) struct TypeError;\n\nimpl IntrinsicObject for TypeError {\n fn init(realm: &Realm) {\n let attribute = Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE;\n BuiltInBuilder::from_standard_constructor::(realm)\n .prototype(realm.intrinsics().constructors().error().constructor())\n .inherits(Some(realm.intrinsics().constructors().error().prototype()))\n .property(js_string!(\"name\"), Self::NAME, attribute)\n .property(js_string!(\"message\"), js_string!(), attribute)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for TypeError {\n const NAME: JsString = StaticJsStrings::TYPE_ERROR;\n}\n\nimpl BuiltInConstructor for TypeError {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::type_error;\n\n /// Create a new error object.\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n Error::native_error_constructor(\n new_target,\n args,\n context,\n ErrorKind::Type,\n StandardConstructors::type_error,\n )\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) struct ThrowTypeError;\n\nimpl IntrinsicObject for ThrowTypeError {\n fn init(realm: &Realm) {\n let obj = BuiltInBuilder::with_intrinsic::(realm)\n .prototype(realm.intrinsics().constructors().function().prototype())\n .static_property(StaticJsStrings::LENGTH, 0, Attribute::empty())\n .static_property(js_string!(\"name\"), js_string!(), Attribute::empty())\n .build();\n\n {\n let mut obj = obj\n .downcast_mut::()\n .expect(\"`%ThrowTypeError%` must be a function\");\n obj.f = NativeFunction::from_fn_ptr(|_, _, _| {\n Err(JsNativeError::typ()\n .with_message(\n \"'caller', 'callee', and 'arguments' properties may not be accessed on strict mode \\\n functions or the arguments objects for calls to them\",\n )\n .into())\n });\n obj.name = js_string!();\n obj.constructor = None;\n obj.realm = Some(realm.clone());\n }\n\n obj.borrow_mut().extensible = false;\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n intrinsics.objects().throw_type_error().into()\n }\n}\n" }, { "path": "core/engine/src/builtins/error/uri.rs", "content": "//! This module implements the global `URIError` object.\n//!\n//! The `URIError` object represents an error when a global URI handling\n//! function was used in a wrong way.\n//!\n//! More information:\n//! - [MDN documentation][mdn]\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-urierror\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/URIError\n\nuse crate::{\n Context, JsResult, JsString, JsValue,\n builtins::{BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n object::JsObject,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{Error, ErrorKind};\n\n/// JavaScript `URIError` implementation.\n#[derive(Debug, Clone, Copy)]\npub(crate) struct UriError;\n\nimpl IntrinsicObject for UriError {\n fn init(realm: &Realm) {\n let attribute = Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE;\n BuiltInBuilder::from_standard_constructor::(realm)\n .prototype(realm.intrinsics().constructors().error().constructor())\n .inherits(Some(realm.intrinsics().constructors().error().prototype()))\n .property(js_string!(\"name\"), Self::NAME, attribute)\n .property(js_string!(\"message\"), js_string!(), attribute)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for UriError {\n const NAME: JsString = StaticJsStrings::URI_ERROR;\n}\n\nimpl BuiltInConstructor for UriError {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::uri_error;\n\n /// Create a new error object.\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n Error::native_error_constructor(\n new_target,\n args,\n context,\n ErrorKind::Uri,\n StandardConstructors::uri_error,\n )\n }\n}\n" }, { "path": "core/engine/src/builtins/escape/mod.rs", "content": "//! Boa's implementation of ECMAScript's string escaping functions.\n//!\n//! The `escape()` function replaces all characters with escape sequences, with the exception of ASCII\n//! word characters (A–Z, a–z, 0–9, _) and @*_+-./.\n//!\n//! The `unescape()` function replaces any escape sequence with the character that it represents.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-additional-properties-of-the-global-object\n\nuse crate::{\n Context, JsArgs, JsObject, JsResult, JsString, JsValue, context::intrinsics::Intrinsics,\n js_string, realm::Realm, string::StaticJsStrings,\n};\n\nuse super::{BuiltInBuilder, BuiltInObject, IntrinsicObject};\n\n/// The `escape` function\n#[derive(Debug, Clone, Copy)]\npub(crate) struct Escape;\n\nimpl IntrinsicObject for Escape {\n fn init(realm: &Realm) {\n BuiltInBuilder::callable_with_intrinsic::(realm, escape)\n .name(Self::NAME)\n .length(1)\n .build();\n }\n fn get(intrinsics: &Intrinsics) -> JsObject {\n intrinsics.objects().escape().into()\n }\n}\n\nimpl BuiltInObject for Escape {\n const NAME: JsString = StaticJsStrings::ESCAPE;\n}\n\n/// Builtin JavaScript `escape ( string )` function.\nfn escape(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n /// Returns `true` if the codepoint `cp` is part of the `unescapedSet`.\n fn is_unescaped(cp: u16) -> bool {\n let Ok(cp) = TryInto::::try_into(cp) else {\n return false;\n };\n\n // 4. Let unescapedSet be the string-concatenation of the ASCII word characters and \"@*+-./\".\n cp.is_ascii_alphanumeric() || [b'_', b'@', b'*', b'+', b'-', b'.', b'/'].contains(&cp)\n }\n\n // 1. Set string to ? ToString(string).\n let string = args.get_or_undefined(0).to_string(context)?;\n\n // 3. Let R be the empty String.\n let mut vec = Vec::with_capacity(string.len());\n\n // 2. Let len be the length of string.\n // 5. Let k be 0.\n // 6. Repeat, while k < len,\n // a. Let C be the code unit at index k within string.\n for cp in &string {\n // b. If unescapedSet contains C, then\n if is_unescaped(cp) {\n // i. Let S be C.\n vec.push(cp);\n continue;\n }\n // c. Else,\n // i. Let n be the numeric value of C.\n // ii. If n < 256, then\n let c = if cp < 256 {\n // 1. Let hex be the String representation of n, formatted as an uppercase hexadecimal number.\n // 2. Let S be the string-concatenation of \"%\" and ! StringPad(hex, 2𝔽, \"0\", start).\n format!(\"%{cp:02X}\")\n }\n // iii. Else,\n else {\n // 1. Let hex be the String representation of n, formatted as an uppercase hexadecimal number.\n // 2. Let S be the string-concatenation of \"%u\" and ! StringPad(hex, 4𝔽, \"0\", start).\n format!(\"%u{cp:04X}\")\n };\n // d. Set R to the string-concatenation of R and S.\n // e. Set k to k + 1.\n vec.extend(c.encode_utf16());\n }\n\n // 7. Return R.\n Ok(js_string!(&vec[..]).into())\n}\n\n/// The `unescape` function\n#[derive(Debug, Clone, Copy)]\npub(crate) struct Unescape;\n\nimpl IntrinsicObject for Unescape {\n fn init(realm: &Realm) {\n BuiltInBuilder::callable_with_intrinsic::(realm, unescape)\n .name(Self::NAME)\n .length(1)\n .build();\n }\n fn get(intrinsics: &Intrinsics) -> JsObject {\n intrinsics.objects().unescape().into()\n }\n}\n\nimpl BuiltInObject for Unescape {\n const NAME: JsString = StaticJsStrings::UNESCAPE;\n}\n\n/// Builtin JavaScript `unescape ( string )` function.\nfn unescape(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n /// Converts a char `cp` to its corresponding hex digit value.\n fn to_hex_digit(cp: u16) -> Option {\n char::from_u32(u32::from(cp))\n .and_then(|c| c.to_digit(16))\n .and_then(|d| d.try_into().ok())\n }\n\n // 1. Set string to ? ToString(string).\n let string = args.get_or_undefined(0).to_string(context)?;\n\n // 3. Let R be the empty String.\n let mut vec = Vec::with_capacity(string.len());\n\n let mut codepoints = >::new(string.iter());\n\n // 2. Let len be the length of string.\n // 4. Let k be 0.\n // 5. Repeat, while k < len,\n loop {\n // a. Let C be the code unit at index k within string.\n let Some(cp) = codepoints.next() else {\n break;\n };\n\n // b. If C is the code unit 0x0025 (PERCENT SIGN), then\n if cp != u16::from(b'%') {\n vec.push(cp);\n continue;\n }\n\n // i. Let hexDigits be the empty String.\n // ii. Let optionalAdvance be 0.\n // TODO: Try blocks :(\n let Some(unescaped_cp) = (|| match *codepoints.peek_n(5) {\n // iii. If k + 5 < len and the code unit at index k + 1 within string is the code unit\n // 0x0075 (LATIN SMALL LETTER U), then\n [u, n1, n2, n3, n4] if u == u16::from(b'u') => {\n // 1. Set hexDigits to the substring of string from k + 2 to k + 6.\n // 2. Set optionalAdvance to 5.\n let n1 = to_hex_digit(n1)?;\n let n2 = to_hex_digit(n2)?;\n let n3 = to_hex_digit(n3)?;\n let n4 = to_hex_digit(n4)?;\n\n // TODO: https://github.com/rust-lang/rust/issues/77404\n for _ in 0..5 {\n codepoints.next();\n }\n\n Some((n1 << 12) + (n2 << 8) + (n3 << 4) + n4)\n }\n // iv. Else if k + 3 ≤ len, then\n [n1, n2, ..] => {\n // 1. Set hexDigits to the substring of string from k + 1 to k + 3.\n // 2. Set optionalAdvance to 2.\n let n1 = to_hex_digit(n1)?;\n let n2 = to_hex_digit(n2)?;\n\n // TODO: https://github.com/rust-lang/rust/issues/77404\n for _ in 0..2 {\n codepoints.next();\n }\n\n Some((n1 << 4) + n2)\n }\n _ => None,\n })() else {\n vec.push(u16::from(b'%'));\n continue;\n };\n\n // v. Let parseResult be ParseText(StringToCodePoints(hexDigits), HexDigits[~Sep]).\n // vi. If parseResult is a Parse Node, then\n // 1. Let n be the MV of parseResult.\n // 2. Set C to the code unit whose numeric value is n.\n // 3. Set k to k + optionalAdvance.\n // c. Set R to the string-concatenation of R and C.\n // d. Set k to k + 1.\n vec.push(unescaped_cp);\n }\n // 6. Return R.\n Ok(js_string!(&vec[..]).into())\n}\n\n/// An iterator that can peek `N` items.\nstruct PeekableN\nwhere\n I: Iterator,\n{\n iterator: I,\n buffer: [I::Item; N],\n buffered_end: usize,\n}\n\nimpl PeekableN\nwhere\n I: Iterator,\n I::Item: Default + Copy,\n{\n /// Creates a new `PeekableN`.\n fn new(iterator: I) -> Self {\n Self {\n iterator,\n buffer: [I::Item::default(); N],\n buffered_end: 0,\n }\n }\n\n /// Peeks `n` items from the iterator.\n fn peek_n(&mut self, count: usize) -> &[I::Item] {\n if count <= self.buffered_end {\n return &self.buffer[..count];\n }\n for _ in 0..(count - self.buffered_end) {\n let Some(next) = self.iterator.next() else {\n return &self.buffer[..self.buffered_end];\n };\n self.buffer[self.buffered_end] = next;\n self.buffered_end += 1;\n }\n\n &self.buffer[..count]\n }\n}\n\nimpl Iterator for PeekableN\nwhere\n I: Iterator,\n I::Item: Copy,\n{\n type Item = I::Item;\n\n fn next(&mut self) -> Option {\n if self.buffered_end > 0 {\n let item = self.buffer[0];\n self.buffer.rotate_left(1);\n self.buffered_end -= 1;\n return Some(item);\n }\n self.iterator.next()\n }\n}\n" }, { "path": "core/engine/src/builtins/eval/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `eval` function.\n//!\n//! The `eval()` function evaluates ECMAScript code represented as a string.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-eval-x\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/eval\n\nuse crate::{\n Context, JsArgs, JsExpect, JsResult, JsString, JsValue, SpannedSourceText,\n builtins::{BuiltInObject, function::OrdinaryFunction},\n bytecompiler::{ByteCompiler, prepare_eval_declaration_instantiation},\n context::intrinsics::Intrinsics,\n environments::SavedEnvironments,\n error::JsNativeError,\n js_string,\n object::JsObject,\n realm::Realm,\n spanned_source_text::SourceText,\n string::StaticJsStrings,\n vm::{CallFrame, CallFrameFlags, source_info::SourcePath},\n};\nuse boa_ast::{\n operations::{ContainsSymbol, contains, contains_arguments},\n scope::Scope,\n};\nuse boa_gc::Gc;\nuse boa_parser::{Parser, Source};\n\nuse super::{BuiltInBuilder, IntrinsicObject};\n\n#[derive(Debug, Clone, Copy)]\npub(crate) struct Eval;\n\nimpl IntrinsicObject for Eval {\n fn init(realm: &Realm) {\n BuiltInBuilder::callable_with_intrinsic::(realm, Self::eval)\n .name(Self::NAME)\n .length(1)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n intrinsics.objects().eval().into()\n }\n}\n\nimpl BuiltInObject for Eval {\n const NAME: JsString = StaticJsStrings::EVAL;\n}\n\nimpl Eval {\n /// `19.2.1 eval ( x )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-eval-x\n fn eval(_: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Return ? PerformEval(x, false, false).\n Self::perform_eval(args.get_or_undefined(0), false, None, false, context)\n }\n\n /// `19.2.1.1 PerformEval ( x, strictCaller, direct )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-performeval\n pub(crate) fn perform_eval(\n x: &JsValue,\n direct: bool,\n lexical_scope: Option,\n mut strict: bool,\n context: &mut Context,\n ) -> JsResult {\n bitflags::bitflags! {\n /// Flags used to throw early errors on invalid `eval` calls.\n #[derive(Default)]\n struct Flags: u8 {\n const IN_FUNCTION = 0b0001;\n const IN_METHOD = 0b0010;\n const IN_DERIVED_CONSTRUCTOR = 0b0100;\n const IN_CLASS_FIELD_INITIALIZER = 0b1000;\n }\n }\n\n /// Possible actions that can be executed after exiting this function to restore the environment to its\n /// original state.\n enum EnvStackAction {\n Truncate(usize),\n Restore(SavedEnvironments),\n }\n\n // 1. Assert: If direct is false, then strictCaller is also false.\n debug_assert!(direct || !strict);\n\n // 2. If Type(x) is not String, return x.\n // TODO: rework parser to take an iterator of `u32` unicode codepoints\n let Some(x) = x.as_string() else {\n return Ok(x.clone());\n };\n\n // Because of implementation details the following code differs from the spec.\n\n // 3. Let evalRealm be the current Realm Record.\n // 4. NOTE: In the case of a direct eval, evalRealm is the realm of both the caller of eval\n // and of the eval function itself.\n let eval_realm = context.realm().clone();\n\n // 5. Perform ? HostEnsureCanCompileStrings(evalRealm, « », x, direct).\n context\n .host_hooks()\n .ensure_can_compile_strings(eval_realm, &[], &x, direct, context)?;\n\n // 11. Perform the following substeps in an implementation-defined order, possibly interleaving parsing and error detection:\n // a. Let script be ParseText(StringToCodePoints(x), Script).\n // b. If script is a List of errors, throw a SyntaxError exception.\n // c. If script Contains ScriptBody is false, return undefined.\n // d. Let body be the ScriptBody of script.\n let x = x.to_vec();\n let source = Source::from_utf16(&x);\n\n let mut parser = Parser::new(source);\n parser.set_identifier(context.next_parser_identifier());\n if strict {\n parser.set_strict();\n }\n let (mut body, source) = parser.parse_eval(direct, context.interner_mut())?;\n\n // 6. Let inFunction be false.\n // 7. Let inMethod be false.\n // 8. Let inDerivedConstructor be false.\n // 9. Let inClassFieldInitializer be false.\n // a. Let thisEnvRec be GetThisEnvironment().\n let flags = match {\n let frame = context.vm.frame();\n frame\n .environments\n .get_this_environment(frame.realm.environment())\n }\n .as_function()\n {\n // 10. If direct is true, then\n // b. If thisEnvRec is a Function Environment Record, then\n Some(function_env) if direct => {\n // i. Let F be thisEnvRec.[[FunctionObject]].\n let function_object = function_env\n .slots()\n .function_object()\n .downcast_ref::()\n .js_expect(\"must be function object\")?;\n\n // ii. Set inFunction to true.\n let mut flags = Flags::IN_FUNCTION;\n\n // iii. Set inMethod to thisEnvRec.HasSuperBinding().\n if function_env.has_super_binding() {\n flags |= Flags::IN_METHOD;\n }\n\n // iv. If F.[[ConstructorKind]] is derived, set inDerivedConstructor to true.\n if function_object.is_derived_constructor() {\n flags |= Flags::IN_DERIVED_CONSTRUCTOR;\n }\n\n // v. Let classFieldInitializerName be F.[[ClassFieldInitializerName]].\n // vi. If classFieldInitializerName is not empty, set inClassFieldInitializer to true.\n if function_object.in_class_field_initializer() {\n flags |= Flags::IN_CLASS_FIELD_INITIALIZER;\n }\n\n flags\n }\n _ => Flags::default(),\n };\n\n if !flags.contains(Flags::IN_FUNCTION) && contains(&body, ContainsSymbol::NewTarget) {\n return Err(JsNativeError::syntax()\n .with_message(\"invalid `new.target` expression inside eval\")\n .into());\n }\n if !flags.contains(Flags::IN_METHOD) && contains(&body, ContainsSymbol::SuperProperty) {\n return Err(JsNativeError::syntax()\n .with_message(\"invalid `super` reference inside eval\")\n .into());\n }\n if !flags.contains(Flags::IN_DERIVED_CONSTRUCTOR)\n && contains(&body, ContainsSymbol::SuperCall)\n {\n return Err(JsNativeError::syntax()\n .with_message(\"invalid `super` call inside eval\")\n .into());\n }\n if flags.contains(Flags::IN_CLASS_FIELD_INITIALIZER) && contains_arguments(&body) {\n return Err(JsNativeError::syntax()\n .with_message(\"invalid `arguments` reference inside eval\")\n .into());\n }\n\n strict |= body.strict();\n\n // Because our environment model does not map directly to the spec, this section looks very different.\n // 12 - 13 are implicit in the call of `Context::compile_with_new_declarative`.\n // 14 - 33 are in the following section, together with EvalDeclarationInstantiation.\n let action = if direct {\n // If the call to eval is direct, the code is executed in the current environment.\n\n // Poison the last parent function environment, because it may contain new declarations after/during eval.\n if !strict {\n {\n let frame = context.vm.frame_mut();\n let global = frame.realm.environment();\n frame.environments.poison_until_last_function(global);\n }\n }\n\n // Set the compile time environment to the current running environment and save the number of current environments.\n let environments_len = context.vm.frame().environments.len();\n\n // Pop any added runtime environments that were not removed during the eval execution.\n EnvStackAction::Truncate(environments_len)\n } else {\n // If the call to eval is indirect, the code is executed in the global environment.\n\n // Pop all environments before the eval execution.\n let saved = context.vm.frame_mut().environments.pop_to_global();\n\n // Restore all environments to the state from before the eval execution.\n EnvStackAction::Restore(saved)\n };\n\n let context = &mut context.guard(move |ctx| match action {\n EnvStackAction::Truncate(len) => ctx.vm.frame_mut().environments.truncate(len),\n EnvStackAction::Restore(saved) => {\n ctx.vm.frame_mut().environments.truncate(0);\n ctx.vm.frame_mut().environments.restore_from_saved(saved);\n }\n });\n\n let (var_environment, mut variable_scope) =\n if let Some(e) = context.vm.frame().environments.outer_function_environment() {\n (e.0, e.1)\n } else {\n (\n context.realm().environment().clone(),\n context.realm().scope().clone(),\n )\n };\n\n let lexical_scope = lexical_scope.unwrap_or(context.realm().scope().clone());\n let lexical_scope = Scope::new(lexical_scope, strict);\n\n let mut annex_b_function_names = Vec::new();\n\n prepare_eval_declaration_instantiation(\n &mut annex_b_function_names,\n &body,\n strict,\n if strict {\n &lexical_scope\n } else {\n &variable_scope\n },\n &lexical_scope,\n context,\n )?;\n\n let in_with = context.vm.frame().environments.has_object_environment();\n\n let source_text = SourceText::new(source);\n let spanned_source_text = SpannedSourceText::new_source_only(source_text);\n\n let mut compiler = ByteCompiler::new(\n js_string!(\"\"),\n body.strict(),\n false,\n variable_scope.clone(),\n lexical_scope.clone(),\n false,\n false,\n context.interner_mut(),\n in_with,\n spanned_source_text,\n // TODO: Could give more information from previous shadow stack.\n SourcePath::Eval,\n );\n\n // Increments the number of open environments to\n // account for the environment scope pushed to\n // the context at the end of `perform_eval`.\n compiler.current_open_environments_count += 1;\n\n if strict {\n variable_scope = lexical_scope.clone();\n compiler.variable_scope = lexical_scope.clone();\n }\n\n #[cfg(feature = \"annex-b\")]\n {\n compiler\n .annex_b_function_names\n .clone_from(&annex_b_function_names);\n }\n\n let bindings = body\n .analyze_scope_eval(\n strict,\n &variable_scope,\n &lexical_scope,\n &annex_b_function_names,\n compiler.interner(),\n )\n .map_err(|e| JsNativeError::syntax().with_message(e))?;\n\n compiler.eval_declaration_instantiation(&body, strict, &variable_scope, bindings);\n\n compiler.compile_statement_list(body.statements(), true, false);\n\n let code_block = Gc::new(compiler.finish());\n\n // Strict calls don't need extensions, since all strict eval calls push a new\n // function environment before evaluating.\n if !strict {\n var_environment.extend_from_compile();\n }\n\n let env_fp = context.vm.frame().environments.len() as u32;\n let environments = context.vm.frame().environments.clone();\n let realm = context.realm().clone();\n context.vm.push_frame_with_stack(\n CallFrame::new(code_block.clone(), None, environments, realm)\n .with_env_fp(env_fp)\n .with_flags(CallFrameFlags::EXIT_EARLY),\n JsValue::undefined(),\n JsValue::null(),\n );\n\n context.realm().resize_global_env();\n\n // Pushing the scope here ensures any function objects created\n // in `eval_declaration_instantiation` get their proper\n // environment stack.\n {\n let frame = context.vm.frame_mut();\n let global = frame.realm.environment();\n frame\n .environments\n .push_lexical(lexical_scope.num_bindings_non_local(), global);\n }\n\n context\n .eval_declaration_instantiation(&code_block)\n .inspect_err(|_| {\n context.vm.pop_frame();\n })?;\n\n let record = context.run();\n context.vm.pop_frame();\n\n record.consume()\n }\n}\n" }, { "path": "core/engine/src/builtins/finalization_registry/mod.rs", "content": "//! Boa's implementation of ECMAScript's `FinalizationRegistry` object.\n\nuse std::{\n cell::{Cell, RefCell},\n slice,\n};\n\nuse boa_gc::{Ephemeron, Finalize, Gc, Trace, WeakGc};\n\nuse crate::{\n Context, JsArgs, JsData, JsObject, JsResult, JsSymbol, JsValue, JsVariant,\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n job::{Job, JobCallback, NativeAsyncJob},\n js_error, js_string,\n object::{\n ErasedVTableObject, JsFunction, VTableObject,\n internal_methods::get_prototype_from_constructor,\n },\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse super::{BuiltInConstructor, BuiltInObject, IntrinsicObject, builder::BuiltInBuilder};\n\n#[cfg(test)]\nmod tests;\n\n/// On GG collection, sends a message to a [`FinalizationRegistry`] indicating that it needs to\n/// be collected.\n#[derive(Trace)]\nstruct CleanupSignaler(#[unsafe_ignore_trace] Cell>>);\n\nimpl Finalize for CleanupSignaler {\n fn finalize(&self) {\n if let Some(sender) = self.0.take()\n && let Some(sender) = sender.upgrade()\n {\n // We don't need to handle errors:\n // - If the channel is full, the `FinalizationRegistry` has already\n // been enqueued for cleanup.\n // - If the channel is closed, the `FinalizationRegistry` was\n // GC'd, so we don't need to worry about cleanups.\n let _ = sender.try_send(());\n }\n }\n}\n\n/// A cell tracked by a [`FinalizationRegistry`].\n#[derive(Trace, Finalize)]\npub(crate) struct RegistryCell {\n target: Ephemeron,\n held_value: JsValue,\n unregister_token: Option>,\n}\n\n/// Boa's implementation of ECMAScript's [`FinalizationRegistry`] builtin object.\n///\n/// `FinalizationRegistry` provides a way to request that a cleanup callback get called at some point\n/// when a value registered with the registry has been reclaimed (garbage-collected).\n///\n/// [`FinalizationRegistry`]: https://tc39.es/ecma262/#sec-finalization-registry-objects\n#[derive(Trace, Finalize, JsData)]\npub(crate) struct FinalizationRegistry {\n realm: Realm,\n callback: JobCallback,\n #[unsafe_ignore_trace]\n cleanup_notifier: async_channel::Sender<()>,\n cells: Vec,\n}\n\nimpl IntrinsicObject for FinalizationRegistry {\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n\n fn init(realm: &Realm) {\n BuiltInBuilder::from_standard_constructor::(realm)\n .property(\n JsSymbol::to_string_tag(),\n js_string!(\"FinalizationRegistry\"),\n Attribute::CONFIGURABLE,\n )\n .method(Self::register, js_string!(\"register\"), 2)\n .method(Self::unregister, js_string!(\"unregister\"), 1)\n .build();\n }\n}\n\nimpl BuiltInObject for FinalizationRegistry {\n const NAME: crate::JsString = StaticJsStrings::FINALIZATION_REGISTRY;\n\n const ATTRIBUTE: Attribute = Attribute::WRITABLE.union(Attribute::CONFIGURABLE);\n}\n\nimpl BuiltInConstructor for FinalizationRegistry {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n const PROTOTYPE_STORAGE_SLOTS: usize = 3;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::finalization_registry;\n\n /// Constructor [`FinalizationRegistry ( cleanupCallback )`][cons]\n ///\n /// [cons]: https://tc39.es/ecma262/#sec-finalization-registry-cleanup-callback\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, throw a TypeError exception.\n if new_target.is_undefined() {\n return Err(js_error!(\n TypeError: \"FinalizationRegistry: cannot call constructor without `new`\"\n ));\n }\n\n // 2. If IsCallable(cleanupCallback) is false, throw a TypeError exception.\n let callback = args\n .get_or_undefined(0)\n .as_object()\n .and_then(JsFunction::from_object)\n .ok_or_else(|| {\n js_error!(\n TypeError: \"FinalizationRegistry: \\\n cleanup callback of registry must be callable\"\n )\n })?;\n\n // 3. Let finalizationRegistry be ? OrdinaryCreateFromConstructor(NewTarget,\n // \"%FinalizationRegistry.prototype%\", « [[Realm]], [[CleanupCallback]], [[Cells]] »).\n let prototype = get_prototype_from_constructor(\n new_target,\n StandardConstructors::finalization_registry,\n context,\n )?;\n\n // 4. Let fn be the active function object.\n // 5. Set finalizationRegistry.[[Realm]] to fn.[[Realm]].\n let realm = context.vm.frame().realm.clone();\n\n // 6. Set finalizationRegistry.[[CleanupCallback]] to HostMakeJobCallback(cleanupCallback).\n let callback = context.host_hooks().make_job_callback(callback, context);\n\n // 7. Set finalizationRegistry.[[Cells]] to a new empty List.\n let cells = Vec::new();\n\n let (sender, receiver) = async_channel::bounded(1);\n\n let registry = JsObject::new_unique(\n prototype,\n FinalizationRegistry {\n realm,\n callback,\n cells,\n cleanup_notifier: sender,\n },\n );\n\n let weak_registry = WeakGc::new(registry.inner());\n\n {\n async fn inner_cleanup(\n weak_registry: WeakGc>,\n receiver: async_channel::Receiver<()>,\n context: &RefCell<&mut Context>,\n ) -> JsResult {\n let Ok(()) = receiver.recv().await else {\n return Ok(JsValue::undefined());\n };\n\n let Some(registry) = weak_registry.upgrade().map(JsObject::from_inner) else {\n return Ok(JsValue::undefined());\n };\n\n let result = FinalizationRegistry::cleanup(®istry, &mut context.borrow_mut());\n\n context\n .borrow_mut()\n .enqueue_job(Job::FinalizationRegistryCleanupJob(NativeAsyncJob::new(\n async move |context| inner_cleanup(weak_registry, receiver, context).await,\n )));\n\n result.map(|()| JsValue::undefined())\n }\n\n context.enqueue_job(Job::FinalizationRegistryCleanupJob(NativeAsyncJob::new(\n async move |ctx| inner_cleanup(weak_registry, receiver, ctx).await,\n )));\n }\n\n // 8. Return finalizationRegistry.\n Ok(registry.upcast().into())\n }\n}\n\nimpl FinalizationRegistry {\n /// [`FinalizationRegistry.prototype.register ( target, heldValue [ , unregisterToken ] )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/sec-finalization-registry.prototype.register\n fn register(this: &JsValue, args: &[JsValue], _context: &mut Context) -> JsResult {\n // 1. Let finalizationRegistry be the this value.\n // 2. Perform ? RequireInternalSlot(finalizationRegistry, [[Cells]]).\n let this = this.as_object();\n let mut registry = this\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| {\n js_error!(\n TypeError: \"FinalizationRegistry.prototype.register: \\\n invalid object type for `this`\",\n )\n })?;\n\n let target = args.get_or_undefined(0);\n let held_value = args.get_or_undefined(1);\n let unregister_token = args.get_or_undefined(2);\n\n // 3. If CanBeHeldWeakly(target) is false, throw a TypeError exception.\n //\n // [`CanBeHeldWeakly ( v )`](https://tc39.es/ecma262/#sec-canbeheldweakly)\n //\n // 1. If v is an Object, return true.\n // 2. If v is a Symbol and KeyForSymbol(v) is undefined, return true.\n // 3. Return false.\n //\n // TODO: support Symbols\n let Some(target_obj) = target.as_object() else {\n return Err(js_error!(\n TypeError: \"FinalizationRegistry.prototype.register: \\\n `target` must be an Object or Symbol\",\n ));\n };\n\n // 4. If SameValue(target, heldValue) is true, throw a TypeError exception.\n if target == held_value {\n return Err(js_error!(\n TypeError: \"FinalizationRegistry.prototype.register: \\\n `heldValue` cannot be the same as `target`\"\n ));\n }\n\n // 5. If CanBeHeldWeakly(unregisterToken) is false, then\n //\n // // [`CanBeHeldWeakly ( v )`](https://tc39.es/ecma262/#sec-canbeheldweakly)\n //\n // 1. If v is an Object, return true.\n // 2. If v is a Symbol and KeyForSymbol(v) is undefined, return true.\n // 3. Return false.\n //\n // TODO: support Symbols\n let unregister_token = match unregister_token.variant() {\n JsVariant::Object(obj) => Some(WeakGc::new(obj.inner())),\n // b. Set unregisterToken to empty.\n JsVariant::Undefined => None,\n // a. If unregisterToken is not undefined, throw a TypeError exception.\n _ => {\n return Err(js_error!(\n TypeError: \"FinalizationRegistry.prototype.register: \\\n `unregisterToken` must be an Object, a Symbol, or undefined\",\n ));\n }\n };\n\n // 6. Let cell be the Record { [[WeakRefTarget]]: target, [[HeldValue]]: heldValue, [[UnregisterToken]]: unregisterToken }.\n let cell = RegistryCell {\n target: Ephemeron::new(\n target_obj.inner(),\n CleanupSignaler(Cell::new(Some(\n registry.cleanup_notifier.clone().downgrade(),\n ))),\n ),\n held_value: held_value.clone(),\n unregister_token,\n };\n\n // 7. Append cell to finalizationRegistry.[[Cells]].\n registry.cells.push(cell);\n\n // 8. Return undefined.\n Ok(JsValue::undefined())\n }\n\n /// [`FinalizationRegistry.prototype.unregister ( unregisterToken )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-finalization-registry.prototype.unregister\n fn unregister(this: &JsValue, args: &[JsValue], _context: &mut Context) -> JsResult {\n // 1. Let finalizationRegistry be the this value.\n // 2. Perform ? RequireInternalSlot(finalizationRegistry, [[Cells]]).\n let this = this.as_object();\n let mut registry = this\n .as_ref()\n .and_then(JsObject::downcast_mut::)\n .ok_or_else(|| {\n js_error!(\n TypeError: \"FinalizationRegistry.prototype.register: \\\n invalid object type for `this`\",\n )\n })?;\n\n // 3. If CanBeHeldWeakly(unregisterToken) is false, throw a TypeError exception.\\\n //\n // // [`CanBeHeldWeakly ( v )`](https://tc39.es/ecma262/#sec-canbeheldweakly)\n //\n // 1. If v is an Object, return true.\n // 2. If v is a Symbol and KeyForSymbol(v) is undefined, return true.\n // 3. Return false.\n //\n // TODO: support Symbols\n let unregister_token = args.get_or_undefined(0).as_object();\n let unregister_token = unregister_token\n .as_ref()\n .map(JsObject::inner)\n .ok_or_else(|| {\n js_error!(\n TypeError: \"FinalizationRegistry.prototype.unregister: \\\n `unregisterToken` must be an Object or a Symbol.\",\n )\n })?;\n\n // 4. Let removed be false.\n let mut removed = false;\n let mut i = 0;\n // 5. For each Record { [[WeakRefTarget]], [[HeldValue]], [[UnregisterToken]] } cell of finalizationRegistry.[[Cells]], do\n while i < registry.cells.len() {\n let cell = ®istry.cells[i];\n\n // a. If cell.[[UnregisterToken]] is not empty and SameValue(cell.[[UnregisterToken]], unregisterToken) is true, then\n if let Some(tok) = cell.unregister_token.as_ref()\n && let Some(tok) = tok.upgrade()\n && Gc::ptr_eq(&tok, unregister_token)\n {\n // i. Remove cell from finalizationRegistry.[[Cells]].\n let cell = registry.cells.swap_remove(i);\n let _key = cell.target.key();\n // TODO: it might be better to add a special ref for the value that\n // also preserves the original key instead.\n cell.target.value().and_then(|v| v.0.take());\n\n // ii. Set removed to true.\n removed = true;\n } else {\n i += 1;\n }\n }\n\n // 6. Return removed.\n Ok(removed.into())\n }\n\n /// Abstract operation [`CleanupFinalizationRegistry ( finalizationRegistry )`][spec].\n ///\n /// Cleans up all the cells of the finalization registry that are determined to be\n /// unreachable by the garbage collector.\n ///\n /// # Panics\n ///\n /// Panics if `obj` is not a `FinalizationRegistry` object.\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-cleanup-finalization-registry\n pub(crate) fn cleanup(\n obj: &JsObject,\n context: &mut Context,\n ) -> JsResult<()> {\n // 1. Assert: finalizationRegistry has [[Cells]] and [[CleanupCallback]] internal slots.\n // let obj = obj.borrow_mut();\n // let registry = obj.data_mut();\n\n // 2. Let callback be finalizationRegistry.[[CleanupCallback]].\n let callback = std::mem::replace(\n &mut obj.borrow_mut().data_mut().callback,\n JobCallback::new(context.intrinsics().objects().throw_type_error(), ()),\n );\n\n let mut i = 0;\n let result = loop {\n if i >= obj.borrow().data().cells.len() {\n break Ok(());\n }\n // 3. While finalizationRegistry.[[Cells]] contains a Record cell such that cell.[[WeakRefTarget]] is empty, an implementation may perform the following steps:\n if obj.borrow().data().cells[i].target.has_value() {\n i += 1;\n } else {\n // a. Choose any such cell.\n // b. Remove cell from finalizationRegistry.[[Cells]].\n let cell = obj.borrow_mut().data_mut().cells.swap_remove(i);\n // c. Perform ? HostCallJobCallback(callback, undefined, « cell.[[HeldValue]] »).\n let result = context.host_hooks().call_job_callback(\n &callback,\n &JsValue::undefined(),\n slice::from_ref(&cell.held_value),\n context,\n );\n\n if let Err(err) = result {\n break Err(err);\n }\n }\n };\n\n obj.borrow_mut().data_mut().callback = callback;\n\n // 4. Return unused.\n result\n }\n}\n" }, { "path": "core/engine/src/builtins/finalization_registry/tests.rs", "content": "mod miri {\n\n use indoc::indoc;\n\n use crate::{TestAction, run_test_actions};\n\n #[test]\n fn finalization_registry_simple() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n let counter = 0;\n const registry = new FinalizationRegistry(() => {\n counter++;\n });\n\n registry.register([\"foo\"]);\n \"#}),\n TestAction::assert_eq(\"counter\", 0),\n TestAction::inspect_context(|_| boa_gc::force_collect()),\n TestAction::inspect_context(|ctx| ctx.run_jobs().unwrap()),\n // Callback should run at least once\n TestAction::assert_eq(\"counter\", 1),\n ]);\n }\n\n #[test]\n fn finalization_registry_unregister() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n let counter = 0;\n const registry = new FinalizationRegistry(() => {\n counter++;\n });\n\n {\n let array = [\"foo\"];\n registry.register(array, undefined, array);\n registry.unregister(array);\n }\n\n \"#}),\n TestAction::assert_eq(\"counter\", 0),\n TestAction::inspect_context(|_| boa_gc::force_collect()),\n TestAction::inspect_context(|ctx| ctx.run_jobs().unwrap()),\n // Callback shouldn't run\n TestAction::assert_eq(\"counter\", 0),\n ]);\n }\n\n #[test]\n fn finalization_registry_held_value_handover() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n let counter = 0;\n const registry = new FinalizationRegistry((value) => {\n counter += value.increment;\n });\n\n registry.register([\"foo\"], { increment: 5 });\n \"#}),\n TestAction::assert_eq(\"counter\", 0),\n TestAction::inspect_context(|_| boa_gc::force_collect()),\n TestAction::inspect_context(|ctx| ctx.run_jobs().unwrap()),\n // Registry should handover the held value as argument\n TestAction::assert_eq(\"counter\", 5),\n ]);\n }\n\n #[test]\n fn finalization_registry_unrelated_unregister_token() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n let counter = 0;\n\n const registry = new FinalizationRegistry((value) => {\n counter += 1;\n });\n\n registry.register([\"foo\"], undefined, {});\n registry.unregister({});\n \"#}),\n TestAction::assert_eq(\"counter\", 0),\n TestAction::inspect_context(|_| boa_gc::force_collect()),\n TestAction::inspect_context(|ctx| ctx.run_jobs().unwrap()),\n // Object should not have been unregistered if the token is not the correct one\n TestAction::assert_eq(\"counter\", 1),\n ]);\n }\n}\n" }, { "path": "core/engine/src/builtins/function/arguments.rs", "content": "use crate::{\n Context, JsData, JsExpect, JsResult, JsValue,\n bytecompiler::ToJsString,\n environments::DeclarativeEnvironment,\n object::{\n JsObject,\n internal_methods::{\n InternalMethodPropertyContext, InternalObjectMethods, ORDINARY_INTERNAL_METHODS,\n ordinary_define_own_property, ordinary_delete, ordinary_get, ordinary_get_own_property,\n ordinary_set, ordinary_try_get,\n },\n },\n property::{DescriptorKind, PropertyDescriptor, PropertyKey},\n};\nuse boa_ast::{function::FormalParameterList, operations::bound_names, scope::Scope};\nuse boa_gc::{Finalize, Gc, Trace};\nuse boa_interner::Interner;\nuse rustc_hash::FxHashMap;\nuse thin_vec::{ThinVec, thin_vec};\n\n#[derive(Debug, Copy, Clone, Trace, Finalize, JsData)]\n#[boa_gc(empty_trace)]\npub(crate) struct UnmappedArguments;\n\nimpl UnmappedArguments {\n /// Creates a new unmapped Arguments ordinary object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-createunmappedargumentsobject\n #[allow(clippy::new_ret_no_self)]\n pub(crate) fn new(arguments_list: &[JsValue], context: &mut Context) -> JsObject {\n // 1. Let len be the number of elements in argumentsList.\n let len = arguments_list.len();\n\n let values_function = context.intrinsics().objects().array_prototype_values();\n let throw_type_error = context.intrinsics().objects().throw_type_error();\n\n // 2. Let obj be ! OrdinaryObjectCreate(%Object.prototype%, « [[ParameterMap]] »).\n // 3. Set obj.[[ParameterMap]] to undefined.\n // skipped because the `Arguments` enum ensures ordinary argument objects don't have a `[[ParameterMap]]`\n let obj = context\n .intrinsics()\n .templates()\n .unmapped_arguments()\n .create(\n Self,\n vec![\n // 4. Perform DefinePropertyOrThrow(obj, \"length\", PropertyDescriptor { [[Value]]: 𝔽(len),\n // [[Writable]]: true, [[Enumerable]]: false, [[Configurable]]: true }).\n len.into(),\n // 7. Perform ! DefinePropertyOrThrow(obj, @@iterator, PropertyDescriptor {\n // [[Value]]: %Array.prototype.values%, [[Writable]]: true, [[Enumerable]]: false,\n // [[Configurable]]: true }).\n values_function.into(),\n // 8. Perform ! DefinePropertyOrThrow(obj, \"callee\", PropertyDescriptor {\n // [[Get]]: %ThrowTypeError%, [[Set]]: %ThrowTypeError%, [[Enumerable]]: false,\n // [[Configurable]]: false }).\n throw_type_error.clone().into(), // get\n throw_type_error.into(), // set\n ],\n );\n\n // 5. Let index be 0.\n // 6. Repeat, while index < len,\n // a. Let val be argumentsList[index].\n // b. Perform ! CreateDataPropertyOrThrow(obj, ! ToString(𝔽(index)), val).\n // c. Set index to index + 1.\n obj.borrow_mut()\n .properties_mut()\n .override_indexed_properties(arguments_list.iter().cloned().collect());\n\n // 9. Return obj.\n obj\n }\n}\n\n/// `MappedArguments` represents an Arguments exotic object.\n///\n/// This struct stores all the data to access mapped function parameters in their environment.\n#[derive(Debug, Clone, Trace, Finalize)]\npub(crate) struct MappedArguments {\n #[unsafe_ignore_trace]\n binding_indices: Vec>,\n environment: Gc,\n}\n\nimpl JsData for MappedArguments {\n fn internal_methods(&self) -> &'static InternalObjectMethods {\n static METHODS: InternalObjectMethods = InternalObjectMethods {\n __get_own_property__: arguments_exotic_get_own_property,\n __define_own_property__: arguments_exotic_define_own_property,\n __try_get__: arguments_exotic_try_get,\n __get__: arguments_exotic_get,\n __set__: arguments_exotic_set,\n __delete__: arguments_exotic_delete,\n ..ORDINARY_INTERNAL_METHODS\n };\n\n &METHODS\n }\n}\n\nimpl MappedArguments {\n /// Deletes the binding with the given index from the parameter map.\n pub(crate) fn delete(&mut self, index: u32) {\n if let Some(binding) = self.binding_indices.get_mut(index as usize) {\n *binding = None;\n }\n }\n\n /// Get the value of the binding at the given index from the function environment.\n ///\n /// Note: This function is the abstract getter closure described in 10.4.4.7.1 `MakeArgGetter ( name, env )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-makearggetter\n pub(crate) fn get(&self, index: u32) -> Option {\n let binding_index = self\n .binding_indices\n .get(index as usize)\n .copied()\n .flatten()?;\n self.environment.get(binding_index)\n }\n\n /// Set the value of the binding at the given index in the function environment.\n ///\n /// Note: This function is the abstract setter closure described in 10.4.4.7.2 `MakeArgSetter ( name, env )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-makeargsetter\n pub(crate) fn set(&self, index: u32, value: &JsValue) {\n if let Some(binding_index) = self.binding_indices.get(index as usize).copied().flatten() {\n self.environment.set(binding_index, value.clone());\n }\n }\n}\n\nimpl MappedArguments {\n pub(crate) fn binding_indices(\n formals: &FormalParameterList,\n scope: &Scope,\n interner: &Interner,\n ) -> ThinVec> {\n // Section 17-19 are done first, for easier object creation in 11.\n //\n // The section 17-19 differs from the spec, due to the way the runtime environments work.\n //\n // This section creates getters and setters for all mapped arguments.\n // Getting and setting values on the `arguments` object will actually access the bindings in the environment:\n // ```\n // function f(a) {console.log(a); arguments[0] = 1; console.log(a)};\n // f(0) // 0, 1\n // ```\n //\n // The spec assumes, that identifiers are used at runtime to reference bindings in the environment.\n // We use indices to access environment bindings at runtime.\n // To map to function parameters to binding indices, we use the fact, that bindings in a\n // function environment start with all of the arguments in order:\n //\n // Note: The first binding (binding 0) is where \"arguments\" is stored.\n //\n // `function f (a,b,c)`\n // | binding index | `arguments` property key | identifier |\n // | 1 | 0 | a |\n // | 2 | 1 | b |\n // | 3 | 2 | c |\n //\n // Notice that the binding index does not correspond to the argument index:\n // `function f (a,a,b)` => binding indices 0 (a), 1 (b), 2 (c)\n // | binding index | `arguments` property key | identifier |\n // | - | 0 | - |\n // | 1 | 1 | a |\n // | 2 | 2 | b |\n //\n // While the `arguments` object contains all arguments, they must not be all bound.\n // In the case of duplicate parameter names, the last one is bound as the environment binding.\n //\n // The following logic implements the steps 17-19 adjusted for our environment structure.\n let mut bindings = FxHashMap::default();\n let mut property_index = 0;\n for name in bound_names(formals) {\n let binding_index = scope\n .get_binding(&name.to_js_string(interner))\n .expect(\"binding must exist\")\n .binding_index();\n\n let entry = bindings\n .entry(name)\n .or_insert((binding_index, property_index));\n\n entry.1 = property_index;\n property_index += 1;\n }\n\n let mut binding_indices = thin_vec![None; property_index];\n for (binding_index, property_index) in bindings.values() {\n binding_indices[*property_index] = Some(*binding_index);\n }\n\n binding_indices\n }\n\n /// Creates a new mapped Arguments exotic object.\n ///\n /// \n #[allow(clippy::new_ret_no_self)]\n pub(crate) fn new(\n func: &JsObject,\n binding_indices: &[Option],\n arguments_list: &[JsValue],\n env: &Gc,\n context: &Context,\n ) -> JsObject {\n // 1. Assert: formals does not contain a rest parameter, any binding patterns, or any initializers.\n // It may contain duplicate identifiers.\n // 2. Let len be the number of elements in argumentsList.\n let len = arguments_list.len();\n\n // 3. Let obj be ! MakeBasicObject(« [[Prototype]], [[Extensible]], [[ParameterMap]] »).\n // 4. Set obj.[[GetOwnProperty]] as specified in 10.4.4.1.\n // 5. Set obj.[[DefineOwnProperty]] as specified in 10.4.4.2.\n // 6. Set obj.[[Get]] as specified in 10.4.4.3.\n // 7. Set obj.[[Set]] as specified in 10.4.4.4.\n // 8. Set obj.[[Delete]] as specified in 10.4.4.5.\n // 9. Set obj.[[Prototype]] to %Object.prototype%.\n\n let range = binding_indices.len().min(len);\n let map = MappedArguments {\n binding_indices: binding_indices[..range].to_vec(),\n environment: env.clone(),\n };\n\n // %Array.prototype.values%\n let values_function = context.intrinsics().objects().array_prototype_values();\n\n // 11. Set obj.[[ParameterMap]] to map.\n let obj = context.intrinsics().templates().mapped_arguments().create(\n map,\n vec![\n // 16. Perform ! DefinePropertyOrThrow(obj, \"length\", PropertyDescriptor { [[Value]]: 𝔽(len),\n // [[Writable]]: true, [[Enumerable]]: false, [[Configurable]]: true }).\n len.into(),\n // 20. Perform ! DefinePropertyOrThrow(obj, @@iterator, PropertyDescriptor {\n // [[Value]]: %Array.prototype.values%, [[Writable]]: true, [[Enumerable]]: false,\n // [[Configurable]]: true }).\n values_function.into(),\n // 21. Perform ! DefinePropertyOrThrow(obj, \"callee\", PropertyDescriptor {\n // [[Value]]: func, [[Writable]]: true, [[Enumerable]]: false, [[Configurable]]: true }).\n func.clone().into(),\n ],\n );\n\n // 14. Let index be 0.\n // 15. Repeat, while index < len,\n // a. Let val be argumentsList[index].\n // b. Perform ! CreateDataPropertyOrThrow(obj, ! ToString(𝔽(index)), val).\n // Note: Direct initialization of indexed array is used here because `CreateDataPropertyOrThrow`\n // would cause a panic while executing exotic argument object set methods before the variables\n // in the environment are initialized.\n obj.borrow_mut()\n .properties_mut()\n .override_indexed_properties(arguments_list.iter().cloned().collect());\n\n // 22. Return obj.\n obj\n }\n}\n\n/// `[[GetOwnProperty]]` for arguments exotic objects.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-arguments-exotic-objects-getownproperty-p\npub(crate) fn arguments_exotic_get_own_property(\n obj: &JsObject,\n key: &PropertyKey,\n context: &mut InternalMethodPropertyContext<'_>,\n) -> JsResult> {\n // 1. Let desc be OrdinaryGetOwnProperty(args, P).\n // 2. If desc is undefined, return desc.\n let Some(desc) = ordinary_get_own_property(obj, key, context)? else {\n return Ok(None);\n };\n\n // 3. Let map be args.[[ParameterMap]].\n // 4. Let isMapped be ! HasOwnProperty(map, P).\n // 5. If isMapped is true, then\n if let PropertyKey::Index(index) = key\n && let Some(value) = obj\n .downcast_ref::()\n .js_expect(\"arguments exotic method must only be callable from arguments objects\")?\n .get(index.get())\n {\n // a. Set desc.[[Value]] to Get(map, P).\n return Ok(Some(\n PropertyDescriptor::builder()\n .value(value)\n .maybe_writable(desc.writable())\n .maybe_enumerable(desc.enumerable())\n .maybe_configurable(desc.configurable())\n .build(),\n ));\n }\n\n // 6. Return desc.\n Ok(Some(desc))\n}\n\n/// `[[DefineOwnProperty]]` for arguments exotic objects.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-arguments-exotic-objects-defineownproperty-p-desc\n#[allow(clippy::needless_pass_by_value)]\npub(crate) fn arguments_exotic_define_own_property(\n obj: &JsObject,\n key: &PropertyKey,\n desc: PropertyDescriptor,\n context: &mut InternalMethodPropertyContext<'_>,\n) -> JsResult {\n // 2. Let isMapped be HasOwnProperty(map, P).\n let mapped = if let &PropertyKey::Index(index) = &key {\n // 1. Let map be args.[[ParameterMap]].\n obj.downcast_ref::()\n .js_expect(\"arguments exotic method must only be callable from arguments objects\")?\n .get(index.get())\n .map(|value| (index, value))\n } else {\n None\n };\n\n let new_arg_desc = match desc.kind() {\n // 4. If isMapped is true and IsDataDescriptor(Desc) is true, then\n // a. If Desc.[[Value]] is not present and Desc.[[Writable]] is present and its\n // value is false, then\n DescriptorKind::Data {\n writable: Some(false),\n value: None,\n } =>\n // i. Set newArgDesc to a copy of Desc.\n // ii. Set newArgDesc.[[Value]] to Get(map, P).\n {\n if let Some((_, value)) = &mapped {\n PropertyDescriptor::builder()\n .value(value.clone())\n .writable(false)\n .maybe_enumerable(desc.enumerable())\n .maybe_configurable(desc.configurable())\n .build()\n } else {\n desc.clone()\n }\n }\n\n // 3. Let newArgDesc be Desc.\n _ => desc.clone(),\n };\n\n // 5. Let allowed be ? OrdinaryDefineOwnProperty(args, P, newArgDesc).\n // 6. If allowed is false, return false.\n if !ordinary_define_own_property(obj, key, new_arg_desc, context)? {\n return Ok(false);\n }\n\n // 7. If isMapped is true, then\n if let Some((index, _)) = mapped {\n // 1. Let map be args.[[ParameterMap]].\n let mut map = obj\n .downcast_mut::()\n .js_expect(\"arguments exotic method must only be callable from arguments objects\")?;\n\n // a. If IsAccessorDescriptor(Desc) is true, then\n if desc.is_accessor_descriptor() {\n // i. Call map.[[Delete]](P).\n map.delete(index.get());\n }\n // b. Else,\n else {\n // i. If Desc.[[Value]] is present, then\n if let Some(value) = desc.value() {\n // 1. Let setStatus be Set(map, P, Desc.[[Value]], false).\n // 2. Assert: setStatus is true because formal parameters mapped by argument objects are always writable.\n map.set(index.get(), value);\n }\n\n // ii. If Desc.[[Writable]] is present and its value is false, then\n if desc.writable() == Some(false) {\n // 1. Call map.[[Delete]](P).\n map.delete(index.get());\n }\n }\n }\n\n // 8. Return true.\n Ok(true)\n}\n\n/// Internal optimization method for `Arguments` exotic objects.\n///\n/// This method combines the internal methods `OrdinaryHasProperty` and `[[Get]]`.\n///\n/// More information:\n/// - [ECMAScript reference OrdinaryHasProperty][spec0]\n/// - [ECMAScript reference Get][spec1]\n///\n/// [spec0]: https://tc39.es/ecma262/#sec-ordinaryhasproperty\n/// [spec1]: https://tc39.es/ecma262/#sec-arguments-exotic-objects-get-p-receiver\npub(crate) fn arguments_exotic_try_get(\n obj: &JsObject,\n key: &PropertyKey,\n receiver: JsValue,\n context: &mut InternalMethodPropertyContext<'_>,\n) -> JsResult> {\n // 1. Let map be args.[[ParameterMap]].\n // 2. Let isMapped be ! HasOwnProperty(map, P).\n if let PropertyKey::Index(index) = key\n && let Some(value) = obj\n .downcast_ref::()\n .js_expect(\"arguments exotic method must only be callable from arguments objects\")?\n .get(index.get())\n {\n // a. Assert: map contains a formal parameter mapping for P.\n // b. Return Get(map, P).\n return Ok(Some(value));\n }\n\n // 3. If isMapped is false, then\n // a. Return ? OrdinaryGet(args, P, Receiver).\n ordinary_try_get(obj, key, receiver, context)\n}\n\n/// `[[Get]]` for arguments exotic objects.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-arguments-exotic-objects-get-p-receiver\npub(crate) fn arguments_exotic_get(\n obj: &JsObject,\n key: &PropertyKey,\n receiver: JsValue,\n context: &mut InternalMethodPropertyContext<'_>,\n) -> JsResult {\n // 1. Let map be args.[[ParameterMap]].\n // 2. Let isMapped be ! HasOwnProperty(map, P).\n if let PropertyKey::Index(index) = key\n && let Some(value) = obj\n .downcast_ref::()\n .js_expect(\"arguments exotic method must only be callable from arguments objects\")?\n .get(index.get())\n {\n // a. Assert: map contains a formal parameter mapping for P.\n // b. Return Get(map, P).\n return Ok(value);\n }\n\n // 3. If isMapped is false, then\n // a. Return ? OrdinaryGet(args, P, Receiver).\n ordinary_get(obj, key, receiver, context)\n}\n\n/// `[[Set]]` for arguments exotic objects.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-arguments-exotic-objects-set-p-v-receiver\npub(crate) fn arguments_exotic_set(\n obj: &JsObject,\n key: PropertyKey,\n value: JsValue,\n receiver: JsValue,\n context: &mut InternalMethodPropertyContext<'_>,\n) -> JsResult {\n // 1. If SameValue(args, Receiver) is false, then\n // a. Let isMapped be false.\n // 2. Else,\n if let PropertyKey::Index(index) = &key\n && JsValue::same_value(&obj.clone().into(), &receiver)\n {\n // a. Let map be args.[[ParameterMap]].\n // b. Let isMapped be ! HasOwnProperty(map, P).\n // 3. If isMapped is true, then\n // a. Let setStatus be Set(map, P, V, false).\n // b. Assert: setStatus is true because formal parameters mapped by argument objects are always writable.\n obj.downcast_ref::()\n .js_expect(\"arguments exotic method must only be callable from arguments objects\")?\n .set(index.get(), &value);\n }\n\n // 4. Return ? OrdinarySet(args, P, V, Receiver).\n ordinary_set(obj, key, value, receiver, context)\n}\n\n/// `[[Delete]]` for arguments exotic objects.\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-arguments-exotic-objects-delete-p\npub(crate) fn arguments_exotic_delete(\n obj: &JsObject,\n key: &PropertyKey,\n context: &mut InternalMethodPropertyContext<'_>,\n) -> JsResult {\n // 3. Let result be ? OrdinaryDelete(args, P).\n let result = ordinary_delete(obj, key, context)?;\n\n if result && let PropertyKey::Index(index) = key {\n // 1. Let map be args.[[ParameterMap]].\n // 2. Let isMapped be ! HasOwnProperty(map, P).\n // 4. If result is true and isMapped is true, then\n // a. Call map.[[Delete]](P).\n obj.downcast_mut::()\n .js_expect(\"arguments exotic method must only be callable from arguments objects\")?\n .delete(index.get());\n }\n\n // 5. Return result.\n Ok(result)\n}\n" }, { "path": "core/engine/src/builtins/function/bound.rs", "content": "use boa_gc::{Finalize, Trace};\n\nuse crate::{\n Context, JsExpect, JsObject, JsResult, JsValue,\n object::{\n JsData,\n internal_methods::{\n CallValue, InternalMethodCallContext, InternalObjectMethods, ORDINARY_INTERNAL_METHODS,\n },\n },\n};\n\n/// Binds a `Function Object` when `bind` is called.\n#[derive(Debug, Trace, Finalize)]\npub struct BoundFunction {\n target_function: JsObject,\n this: JsValue,\n args: Vec,\n}\n\nimpl JsData for BoundFunction {\n fn internal_methods(&self) -> &'static InternalObjectMethods {\n static CONSTRUCTOR_METHODS: InternalObjectMethods = InternalObjectMethods {\n __call__: bound_function_exotic_call,\n __construct__: bound_function_exotic_construct,\n ..ORDINARY_INTERNAL_METHODS\n };\n\n static FUNCTION_METHODS: InternalObjectMethods = InternalObjectMethods {\n __call__: bound_function_exotic_call,\n ..ORDINARY_INTERNAL_METHODS\n };\n\n if self.target_function.is_constructor() {\n &CONSTRUCTOR_METHODS\n } else {\n &FUNCTION_METHODS\n }\n }\n}\n\nimpl BoundFunction {\n /// Abstract operation `BoundFunctionCreate`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-boundfunctioncreate\n pub fn create(\n target_function: JsObject,\n this: JsValue,\n args: Vec,\n context: &mut Context,\n ) -> JsResult {\n // 1. Let proto be ? targetFunction.[[GetPrototypeOf]]().\n let proto = target_function.__get_prototype_of__(context)?;\n\n // 2. Let internalSlotsList be the internal slots listed in Table 35, plus [[Prototype]] and [[Extensible]].\n // 3. Let obj be ! MakeBasicObject(internalSlotsList).\n // 4. Set obj.[[Prototype]] to proto.\n // 5. Set obj.[[Call]] as described in 10.4.1.1.\n // 6. If IsConstructor(targetFunction) is true, then\n // a. Set obj.[[Construct]] as described in 10.4.1.2.\n // 7. Set obj.[[BoundTargetFunction]] to targetFunction.\n // 8. Set obj.[[BoundThis]] to boundThis.\n // 9. Set obj.[[BoundArguments]] to boundArgs.\n // 10. Return obj.\n Ok(JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n proto,\n Self {\n target_function,\n this,\n args,\n },\n )\n .upcast())\n }\n\n /// Get a reference to the bound function's this.\n #[must_use]\n pub const fn this(&self) -> &JsValue {\n &self.this\n }\n\n /// Get a reference to the bound function's target function.\n #[must_use]\n pub const fn target_function(&self) -> &JsObject {\n &self.target_function\n }\n\n /// Get a reference to the bound function's args.\n #[must_use]\n pub fn args(&self) -> &[JsValue] {\n self.args.as_slice()\n }\n}\n\n/// Internal method `[[Call]]` for Bound Function Exotic Objects\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-bound-function-exotic-objects-call-thisargument-argumentslist\n#[allow(clippy::unnecessary_wraps)]\nfn bound_function_exotic_call(\n obj: &JsObject,\n argument_count: usize,\n context: &mut InternalMethodCallContext<'_>,\n) -> JsResult {\n let bound_function = obj.downcast_ref::().js_expect(\n \"bound function exotic method should only be callable from bound function objects\",\n )?;\n\n // 1. Let target be F.[[BoundTargetFunction]].\n let target = bound_function.target_function();\n context\n .vm\n .stack\n .calling_convention_set_function(argument_count, target.clone().into());\n\n // 2. Let boundThis be F.[[BoundThis]].\n let bound_this = bound_function.this();\n context\n .vm\n .stack\n .calling_convention_set_this(argument_count, bound_this.clone());\n\n // 3. Let boundArgs be F.[[BoundArguments]].\n let bound_args = bound_function.args();\n\n // 4. Let args be the list-concatenation of boundArgs and argumentsList.\n context\n .vm\n .stack\n .calling_convention_insert_arguments(argument_count, bound_args);\n\n // 5. Return ? Call(target, boundThis, args).\n Ok(target.__call__(bound_args.len() + argument_count))\n}\n\n/// Internal method `[[Construct]]` for Bound Function Exotic Objects\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-bound-function-exotic-objects-construct-argumentslist-newtarget\n#[allow(clippy::unnecessary_wraps)]\nfn bound_function_exotic_construct(\n function_object: &JsObject,\n argument_count: usize,\n context: &mut InternalMethodCallContext<'_>,\n) -> JsResult {\n let new_target = context.vm.stack.pop();\n\n debug_assert!(new_target.is_object(), \"new.target should be an object\");\n\n let bound_function = function_object.downcast_ref::().js_expect(\n \"bound function exotic method should only be callable from bound function objects\",\n )?;\n\n // 1. Let target be F.[[BoundTargetFunction]].\n let target = bound_function.target_function();\n\n // 2. Assert: IsConstructor(target) is true.\n\n // 3. Let boundArgs be F.[[BoundArguments]].\n let bound_args = bound_function.args();\n\n // 4. Let args be the list-concatenation of boundArgs and argumentsList.\n context\n .vm\n .stack\n .calling_convention_insert_arguments(argument_count, bound_args);\n\n // 5. If SameValue(F, newTarget) is true, set newTarget to target.\n let function_object: JsValue = function_object.clone().into();\n let new_target = if JsValue::same_value(&function_object, &new_target) {\n target.clone().into()\n } else {\n new_target\n };\n\n // 6. Return ? Construct(target, args, newTarget).\n context.vm.stack.push(new_target);\n Ok(target.__construct__(bound_args.len() + argument_count))\n}\n" }, { "path": "core/engine/src/builtins/function/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `Function` object and Native Functions.\n//!\n//! Objects wrap `Function`s and expose them via call/construct slots.\n//!\n//! The `Function` object is used for matching text with a pattern.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-function-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function\n\nuse crate::{\n Context, JsArgs, JsExpect, JsResult, JsStr, JsString, JsValue, SpannedSourceText,\n builtins::{\n BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject, OrdinaryObject,\n },\n bytecompiler::FunctionCompiler,\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n environments::{EnvironmentStack, FunctionSlots, PrivateEnvironment, ThisBindingStatus},\n error::JsNativeError,\n js_error, js_string,\n native_function::NativeFunctionObject,\n object::{\n JsData, JsFunction, JsObject, PrivateElement, PrivateName,\n internal_methods::{\n CallValue, InternalMethodCallContext, InternalObjectMethods, ORDINARY_INTERNAL_METHODS,\n get_prototype_from_constructor,\n },\n },\n property::{Attribute, PropertyDescriptor, PropertyKey},\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::IntegerOrInfinity,\n vm::{ActiveRunnable, CallFrame, CallFrameFlags, CodeBlock},\n};\nuse boa_ast::{\n Position, Span, Spanned, StatementList,\n function::{FormalParameterList, FunctionBody},\n operations::{\n ContainsSymbol, all_private_identifiers_valid, bound_names, contains,\n lexically_declared_names,\n },\n scope::BindingLocatorScope,\n};\nuse boa_gc::{self, Finalize, Gc, Trace, custom_trace};\nuse boa_interner::Sym;\nuse boa_macros::js_str;\nuse boa_parser::{Parser, Source};\nuse thin_vec::ThinVec;\n\nuse super::Proxy;\n\npub(crate) mod arguments;\nmod bound;\n\npub use bound::BoundFunction;\n\n#[cfg(test)]\nmod tests;\n\n/// Represents the `[[ThisMode]]` internal slot of function objects.\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-ecmascript-function-objects\n#[derive(Debug, Trace, Finalize, PartialEq, Eq, Clone)]\npub enum ThisMode {\n /// The `this` value refers to the `this` value of a lexically enclosing function.\n Lexical,\n\n /// The `this` value is used exactly as provided by an invocation of the function.\n Strict,\n\n /// The `this` value of `undefined` or `null` is interpreted as a reference to the global object,\n /// and any other `this` value is first passed to `ToObject`.\n Global,\n}\n\nimpl ThisMode {\n /// Returns `true` if the this mode is `Lexical`.\n #[must_use]\n pub const fn is_lexical(&self) -> bool {\n matches!(self, Self::Lexical)\n }\n\n /// Returns `true` if the this mode is `Strict`.\n #[must_use]\n pub const fn is_strict(&self) -> bool {\n matches!(self, Self::Strict)\n }\n\n /// Returns `true` if the this mode is `Global`.\n #[must_use]\n pub const fn is_global(&self) -> bool {\n matches!(self, Self::Global)\n }\n}\n\n/// Represents the `[[ConstructorKind]]` internal slot of function objects.\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-ecmascript-function-objects\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\npub enum ConstructorKind {\n /// The class constructor is not derived.\n Base,\n\n /// The class constructor is a derived class constructor.\n Derived,\n}\n\nimpl ConstructorKind {\n /// Returns `true` if the constructor kind is `Base`.\n #[must_use]\n pub const fn is_base(&self) -> bool {\n matches!(self, Self::Base)\n }\n\n /// Returns `true` if the constructor kind is `Derived`.\n #[must_use]\n pub const fn is_derived(&self) -> bool {\n matches!(self, Self::Derived)\n }\n}\n\n/// Record containing the field definition of classes.\n///\n/// More information:\n/// - [ECMAScript specification][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-classfielddefinition-record-specification-type\n#[derive(Clone, Debug, Finalize)]\npub enum ClassFieldDefinition {\n /// A class field definition with a `string` or `symbol` as a name.\n Public(PropertyKey, JsFunction, Option),\n\n /// A class field definition with a private name.\n Private(PrivateName, JsFunction),\n}\n\nunsafe impl Trace for ClassFieldDefinition {\n custom_trace! {this, mark, {\n match this {\n Self::Public(_key, func, _) => {\n mark(func);\n }\n Self::Private(_, func) => {\n mark(func);\n }\n }\n }}\n}\n\n/// Boa representation of a JavaScript Function Object.\n///\n/// `FunctionBody` is specific to this interpreter, it will either be Rust code or JavaScript code\n/// (AST Node).\n///\n/// \n#[derive(Debug, Trace, Finalize)]\npub struct OrdinaryFunction {\n /// The code block containing the compiled function.\n pub(crate) code: Gc,\n\n /// The `[[Environment]]` internal slot.\n pub(crate) environments: EnvironmentStack,\n\n /// The `[[HomeObject]]` internal slot.\n pub(crate) home_object: Option,\n\n /// The `[[ScriptOrModule]]` internal slot.\n pub(crate) script_or_module: Option,\n\n /// The [`Realm`] the function is defined in.\n pub(crate) realm: Realm,\n\n /// The `[[Fields]]` internal slot.\n fields: ThinVec,\n\n /// The `[[PrivateMethods]]` internal slot.\n private_methods: ThinVec<(PrivateName, PrivateElement)>,\n}\n\nimpl JsData for OrdinaryFunction {\n fn internal_methods(&self) -> &'static InternalObjectMethods {\n static FUNCTION_METHODS: InternalObjectMethods = InternalObjectMethods {\n __call__: function_call,\n ..ORDINARY_INTERNAL_METHODS\n };\n\n static CONSTRUCTOR_METHODS: InternalObjectMethods = InternalObjectMethods {\n __call__: function_call,\n __construct__: function_construct,\n ..ORDINARY_INTERNAL_METHODS\n };\n\n if self.code.has_prototype_property() {\n &CONSTRUCTOR_METHODS\n } else {\n &FUNCTION_METHODS\n }\n }\n}\n\nimpl OrdinaryFunction {\n pub(crate) fn new(\n code: Gc,\n environments: EnvironmentStack,\n script_or_module: Option,\n realm: Realm,\n ) -> Self {\n Self {\n code,\n environments,\n home_object: None,\n script_or_module,\n realm,\n fields: ThinVec::default(),\n private_methods: ThinVec::default(),\n }\n }\n\n /// Returns the codeblock of the function.\n #[must_use]\n pub fn codeblock(&self) -> &CodeBlock {\n &self.code\n }\n\n /// Push a private environment to the function.\n pub(crate) fn push_private_environment(&mut self, environment: Gc) {\n self.environments.push_private(environment);\n }\n\n /// Returns true if the function object is a derived constructor.\n pub(crate) fn is_derived_constructor(&self) -> bool {\n self.code.is_derived_constructor()\n }\n\n /// Does this function have the `[[ClassFieldInitializerName]]` internal slot set to non-empty value.\n pub(crate) fn in_class_field_initializer(&self) -> bool {\n self.code.in_class_field_initializer()\n }\n\n /// Returns a reference to the function `[[HomeObject]]` slot if present.\n pub(crate) const fn get_home_object(&self) -> Option<&JsObject> {\n self.home_object.as_ref()\n }\n\n /// Sets the `[[HomeObject]]` slot if present.\n pub(crate) fn set_home_object(&mut self, object: JsObject) {\n self.home_object = Some(object);\n }\n\n /// Returns the values of the `[[Fields]]` internal slot.\n pub(crate) fn get_fields(&self) -> &[ClassFieldDefinition] {\n &self.fields\n }\n\n /// Pushes a value to the `[[Fields]]` internal slot if present.\n pub(crate) fn push_field(\n &mut self,\n key: PropertyKey,\n value: JsFunction,\n function_name: Option,\n ) {\n self.fields\n .push(ClassFieldDefinition::Public(key, value, function_name));\n }\n\n /// Pushes a private value to the `[[Fields]]` internal slot if present.\n pub(crate) fn push_field_private(&mut self, name: PrivateName, value: JsFunction) {\n self.fields.push(ClassFieldDefinition::Private(name, value));\n }\n\n /// Returns the values of the `[[PrivateMethods]]` internal slot.\n pub(crate) fn get_private_methods(&self) -> &[(PrivateName, PrivateElement)] {\n &self.private_methods\n }\n\n /// Pushes a private method to the `[[PrivateMethods]]` internal slot if present.\n pub(crate) fn push_private_method(&mut self, name: PrivateName, method: PrivateElement) {\n self.private_methods.push((name, method));\n }\n\n /// Gets the `Realm` from where this function originates.\n #[must_use]\n pub const fn realm(&self) -> &Realm {\n &self.realm\n }\n\n /// Checks if this function is an ordinary function.\n pub(crate) fn is_ordinary(&self) -> bool {\n self.code.is_ordinary()\n }\n}\n\n/// The internal representation of a `Function` object.\n#[derive(Debug, Clone, Copy)]\npub struct BuiltInFunctionObject;\n\nimpl IntrinsicObject for BuiltInFunctionObject {\n fn init(realm: &Realm) {\n let has_instance = BuiltInBuilder::callable(realm, Self::has_instance)\n .name(js_string!(\"[Symbol.hasInstance]\"))\n .length(1)\n .build();\n\n let throw_type_error = realm.intrinsics().objects().throw_type_error();\n\n BuiltInBuilder::from_standard_constructor::(realm)\n .method(Self::apply, js_string!(\"apply\"), 2)\n .method(Self::bind, js_string!(\"bind\"), 1)\n .method(Self::call, js_string!(\"call\"), 1)\n .method(Self::to_string, js_string!(\"toString\"), 0)\n .property(JsSymbol::has_instance(), has_instance, Attribute::default())\n .accessor(\n js_string!(\"caller\"),\n Some(throw_type_error.clone()),\n Some(throw_type_error.clone()),\n Attribute::CONFIGURABLE,\n )\n .accessor(\n js_string!(\"arguments\"),\n Some(throw_type_error.clone()),\n Some(throw_type_error),\n Attribute::CONFIGURABLE,\n )\n .build();\n\n let prototype = realm.intrinsics().constructors().function().prototype();\n\n BuiltInBuilder::callable_with_object(realm, prototype.clone(), Self::prototype)\n .name(js_string!())\n .length(0)\n .build();\n\n prototype.set_prototype(Some(realm.intrinsics().constructors().object().prototype()));\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for BuiltInFunctionObject {\n const NAME: JsString = StaticJsStrings::FUNCTION;\n}\n\nimpl BuiltInConstructor for BuiltInFunctionObject {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 10;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::function;\n\n /// `Function ( p1, p2, … , pn, body )`\n ///\n /// The `apply()` method invokes self with the first argument as the `this` value\n /// and the rest of the arguments provided as an array (or an array-like object).\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-function-p1-p2-pn-body\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/Function\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let active_function = context\n .active_function_object()\n .unwrap_or_else(|| context.intrinsics().constructors().function().constructor());\n Self::create_dynamic_function(active_function, new_target, args, false, false, context)\n .map(Into::into)\n }\n}\n\nimpl BuiltInFunctionObject {\n /// `CreateDynamicFunction ( constructor, newTarget, kind, args )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-createdynamicfunction\n pub(crate) fn create_dynamic_function(\n constructor: JsObject,\n new_target: &JsValue,\n args: &[JsValue],\n r#async: bool,\n generator: bool,\n context: &mut Context,\n ) -> JsResult {\n // 1. If newTarget is undefined, set newTarget to constructor.\n let new_target = if new_target.is_undefined() {\n constructor.into()\n } else {\n new_target.clone()\n };\n\n let strict = context.is_strict();\n\n let default = if r#async && generator {\n // 5. Else,\n // a. Assert: kind is async-generator.\n // b. Let prefix be \"async function*\".\n // c. Let exprSym be the grammar symbol AsyncGeneratorExpression.\n // d. Let bodySym be the grammar symbol AsyncGeneratorBody.\n // e. Let parameterSym be the grammar symbol FormalParameters[+Yield, +Await].\n // f. Let fallbackProto be \"%AsyncGeneratorFunction.prototype%\".\n StandardConstructors::async_generator_function\n } else if r#async {\n // 4. Else if kind is async, then\n // a. Let prefix be \"async function\".\n // b. Let exprSym be the grammar symbol AsyncFunctionExpression.\n // c. Let bodySym be the grammar symbol AsyncFunctionBody.\n // d. Let parameterSym be the grammar symbol FormalParameters[~Yield, +Await].\n // e. Let fallbackProto be \"%AsyncFunction.prototype%\".\n StandardConstructors::async_function\n } else if generator {\n // 3. Else if kind is generator, then\n // a. Let prefix be \"function*\".\n // b. Let exprSym be the grammar symbol GeneratorExpression.\n // c. Let bodySym be the grammar symbol GeneratorBody.\n // d. Let parameterSym be the grammar symbol FormalParameters[+Yield, ~Await].\n // e. Let fallbackProto be \"%GeneratorFunction.prototype%\".\n StandardConstructors::generator_function\n } else {\n // 2. If kind is normal, then\n // a. Let prefix be \"function\".\n // b. Let exprSym be the grammar symbol FunctionExpression.\n // c. Let bodySym be the grammar symbol FunctionBody[~Yield, ~Await].\n // d. Let parameterSym be the grammar symbol FormalParameters[~Yield, ~Await].\n // e. Let fallbackProto be \"%Function.prototype%\".\n StandardConstructors::function\n };\n\n // 22. Let proto be ? GetPrototypeFromConstructor(newTarget, fallbackProto).\n let prototype = get_prototype_from_constructor(&new_target, default, context)?;\n\n // 6. Let argCount be the number of elements in parameterArgs.\n let (body, param_list) = if let Some((body, params)) = args.split_last() {\n // 7. Let parameterStrings be a new empty List.\n let mut parameters = Vec::with_capacity(args.len());\n\n // 8. For each element arg of parameterArgs, do\n for param in params {\n // a. Append ? ToString(arg) to parameterStrings.\n parameters.push(param.to_string(context)?);\n }\n\n // 9. Let bodyString be ? ToString(bodyArg).\n let body = body.to_string(context)?;\n\n (body, parameters)\n } else {\n (js_string!(), Vec::new())\n };\n let current_realm = context.realm().clone();\n\n context.host_hooks().ensure_can_compile_strings(\n current_realm,\n ¶m_list,\n &body,\n false,\n context,\n )?;\n\n let parameters = if param_list.is_empty() {\n FormalParameterList::default()\n } else {\n // 12. Let P be the empty String.\n // 13. If argCount > 0, then\n // a. Set P to parameterStrings[0].\n // b. Let k be 1.\n // c. Repeat, while k < argCount,\n // i. Let nextArgString be parameterStrings[k].\n // ii. Set P to the string-concatenation of P, \",\" (a comma), and nextArgString.\n // iii. Set k to k + 1.\n\n // TODO: Replace with standard `Iterator::intersperse` iterator method when it's stabilized.\n // See: \n let parameters = itertools::Itertools::intersperse(\n param_list.iter().map(JsString::iter),\n js_str!(\",\").iter(),\n )\n .flatten()\n .collect::>();\n let mut parser = Parser::new(Source::from_utf16(¶meters));\n parser.set_identifier(context.next_parser_identifier());\n\n // 17. Let parameters be ParseText(StringToCodePoints(P), parameterSym).\n // 18. If parameters is a List of errors, throw a SyntaxError exception.\n let parameters = parser\n .parse_formal_parameters(context.interner_mut(), generator, r#async)\n .map_err(|e| {\n JsNativeError::syntax()\n .with_message(format!(\"failed to parse function parameters: {e}\"))\n })?;\n\n // It is a Syntax Error if FormalParameters Contains YieldExpression is true.\n if generator && contains(¶meters, ContainsSymbol::YieldExpression) {\n return Err(JsNativeError::syntax().with_message(\n if r#async {\n \"yield expression is not allowed in formal parameter list of async generator\"\n } else {\n \"yield expression is not allowed in formal parameter list of generator\"\n }\n ).into());\n }\n\n // It is a Syntax Error if FormalParameters Contains AwaitExpression is true.\n if r#async && contains(¶meters, ContainsSymbol::AwaitExpression) {\n return Err(JsNativeError::syntax()\n .with_message(\n if generator {\n \"await expression is not allowed in formal parameter list of async function\"\n } else {\n \"await expression is not allowed in formal parameter list of async generator\"\n })\n .into());\n }\n\n parameters\n };\n\n let body = if body.is_empty() {\n FunctionBody::new(StatementList::default(), Span::new((1, 1), (1, 1)))\n } else {\n // 14. Let bodyParseString be the string-concatenation of 0x000A (LINE FEED), bodyString, and 0x000A (LINE FEED).\n let mut body_parse = Vec::with_capacity(body.len());\n body_parse.push(u16::from(b'\\n'));\n body_parse.extend(body.iter());\n body_parse.push(u16::from(b'\\n'));\n\n // 19. Let body be ParseText(StringToCodePoints(bodyParseString), bodySym).\n // 20. If body is a List of errors, throw a SyntaxError exception.\n let mut parser = Parser::new(Source::from_utf16(&body_parse));\n parser.set_identifier(context.next_parser_identifier());\n\n // 19. Let body be ParseText(StringToCodePoints(bodyParseString), bodySym).\n // 20. If body is a List of errors, throw a SyntaxError exception.\n let body = parser\n .parse_function_body(context.interner_mut(), generator, r#async)\n .map_err(|e| {\n JsNativeError::syntax()\n .with_message(format!(\"failed to parse function body: {e}\"))\n })?;\n\n // It is a Syntax Error if AllPrivateIdentifiersValid of StatementList with argument « »\n // is false unless the source text containing ScriptBody is eval code that is being\n // processed by a direct eval.\n // https://tc39.es/ecma262/#sec-scripts-static-semantics-early-errors\n if !all_private_identifiers_valid(&body, Vec::new()) {\n return Err(JsNativeError::syntax()\n .with_message(\"invalid private identifier usage\")\n .into());\n }\n\n // 21. NOTE: The parameters and body are parsed separately to ensure that each is valid alone. For example, new Function(\"/*\", \"*/ ) {\") does not evaluate to a function.\n // 22. NOTE: If this step is reached, sourceText must have the syntax of exprSym (although the reverse implication does not hold). The purpose of the next two steps is to enforce any Early Error rules which apply to exprSym directly.\n // 23. Let expr be ParseText(sourceText, exprSym).\n // 24. If expr is a List of errors, throw a SyntaxError exception.\n // Check for errors that apply for the combination of body and parameters.\n\n // Early Error: If BindingIdentifier is present and the source text matched by BindingIdentifier is strict mode code,\n // it is a Syntax Error if the StringValue of BindingIdentifier is \"eval\" or \"arguments\".\n if body.strict() {\n for name in bound_names(¶meters) {\n if name == Sym::ARGUMENTS || name == Sym::EVAL {\n return Err(JsNativeError::syntax()\n .with_message(\"Unexpected 'eval' or 'arguments' in strict mode\")\n .into());\n }\n }\n }\n\n // Early Error: If the source code matching FormalParameters is strict mode code,\n // the Early Error rules for UniqueFormalParameters : FormalParameters are applied.\n if (body.strict()) && parameters.has_duplicates() {\n return Err(JsNativeError::syntax()\n .with_message(\"Duplicate parameter name not allowed in this context\")\n .into());\n }\n\n // Early Error: It is a Syntax Error if FunctionBodyContainsUseStrict of GeneratorBody is true\n // and IsSimpleParameterList of FormalParameters is false.\n if body.strict() && !parameters.is_simple() {\n return Err(JsNativeError::syntax()\n .with_message(\n \"Illegal 'use strict' directive in function with non-simple parameter list\",\n )\n .into());\n }\n\n // It is a Syntax Error if FunctionBody Contains SuperProperty is true.\n if contains(&body, ContainsSymbol::SuperProperty) {\n return Err(JsNativeError::syntax()\n .with_message(\"invalid `super` reference\")\n .into());\n }\n\n // It is a Syntax Error if FunctionBody Contains SuperCall is true.\n if contains(&body, ContainsSymbol::SuperCall) {\n return Err(JsNativeError::syntax()\n .with_message(\"invalid `super` call\")\n .into());\n }\n\n // It is a Syntax Error if any element of the BoundNames of FormalParameters\n // also occurs in the LexicallyDeclaredNames of FunctionBody.\n // https://tc39.es/ecma262/#sec-function-definitions-static-semantics-early-errors\n {\n let lexically_declared_names = lexically_declared_names(&body);\n for name in bound_names(¶meters) {\n if lexically_declared_names.contains(&name) {\n return Err(JsNativeError::syntax()\n .with_message(format!(\n \"Redeclaration of formal parameter `{}`\",\n context.interner().resolve_expect(name)\n ))\n .into());\n }\n }\n }\n\n body\n };\n\n // TODO: create SourceText : \"anonymous(\" parameters \\n \") {\" body_parse \"}\"\n\n let function_span_start = Position::new(1, 1);\n let function_span_end = body.span().end();\n let mut function = boa_ast::function::FunctionExpression::new(\n None,\n parameters,\n body,\n None,\n false,\n Span::new(function_span_start, function_span_end),\n );\n if let Err(reason) =\n function.analyze_scope(strict, context.realm().scope(), context.interner())\n {\n return Err(js_error!(SyntaxError: \"failed to analyze function scope: {}\", reason));\n }\n\n let in_with = context.vm.frame().environments.has_object_environment();\n let spanned_source_text = SpannedSourceText::new_empty();\n\n let code = FunctionCompiler::new(spanned_source_text)\n .name(js_string!(\"anonymous\"))\n .generator(generator)\n .r#async(r#async)\n .in_with(in_with)\n .force_function_scope(true)\n .compile(\n function.parameters(),\n function.body(),\n context.realm().scope().clone(),\n context.realm().scope().clone(),\n function.scopes(),\n function.contains_direct_eval(),\n context.interner_mut(),\n );\n\n let saved = context.vm.frame_mut().environments.pop_to_global();\n let function_object = crate::vm::create_function_object(code, prototype, context);\n context\n .vm\n .frame_mut()\n .environments\n .restore_from_saved(saved);\n\n Ok(function_object)\n }\n\n /// `Function.prototype.apply ( thisArg, argArray )`\n ///\n /// The `apply()` method invokes self with the first argument as the `this` value\n /// and the rest of the arguments provided as an array (or an array-like object).\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-function.prototype.apply\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/apply\n fn apply(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let func be the this value.\n // 2. If IsCallable(func) is false, throw a TypeError exception.\n let func = this.as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(format!(\"{} is not a function\", this.display()))\n })?;\n\n let this_arg = args.get_or_undefined(0);\n let arg_array = args.get_or_undefined(1);\n // 3. If argArray is undefined or null, then\n if arg_array.is_null_or_undefined() {\n // a. Perform PrepareForTailCall().\n // TODO?: 3.a. PrepareForTailCall\n\n // b. Return ? Call(func, thisArg).\n return func.call(this_arg, &[], context);\n }\n\n // 4. Let argList be ? CreateListFromArrayLike(argArray).\n let arg_list = arg_array.create_list_from_array_like(&[], context)?;\n\n // 5. Perform PrepareForTailCall().\n // TODO?: 5. PrepareForTailCall\n\n // 6. Return ? Call(func, thisArg, argList).\n func.call(this_arg, &arg_list, context)\n }\n\n /// `Function.prototype.bind ( thisArg, ...args )`\n ///\n /// The `bind()` method creates a new function that, when called, has its\n /// this keyword set to the provided value, with a given sequence of arguments\n /// preceding any provided when the new function is called.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-function.prototype.bind\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_objects/Function/bind\n fn bind(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let Target be the this value.\n // 2. If IsCallable(Target) is false, throw a TypeError exception.\n let target = this.as_callable().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"cannot bind `this` without a `[[Call]]` internal method\")\n })?;\n\n let this_arg = args.get_or_undefined(0).clone();\n let bound_args = args.get(1..).unwrap_or(&[]).to_vec();\n let arg_count = bound_args.len() as i64;\n\n // 3. Let F be ? BoundFunctionCreate(Target, thisArg, args).\n let f = BoundFunction::create(target.clone(), this_arg, bound_args, context)?;\n\n // 4. Let L be 0.\n let mut l = JsValue::new(0);\n\n // 5. Let targetHasLength be ? HasOwnProperty(Target, \"length\").\n // 6. If targetHasLength is true, then\n if target.has_own_property(StaticJsStrings::LENGTH, context)? {\n // a. Let targetLen be ? Get(Target, \"length\").\n let target_len = target.get(StaticJsStrings::LENGTH, context)?;\n // b. If Type(targetLen) is Number, then\n if target_len.is_number() {\n // 1. Let targetLenAsInt be ! ToIntegerOrInfinity(targetLen).\n match target_len\n .to_integer_or_infinity(context)\n .js_expect(\"to_integer_or_infinity cannot fail for a number\")?\n {\n // i. If targetLen is +∞𝔽, set L to +∞.\n IntegerOrInfinity::PositiveInfinity => l = f64::INFINITY.into(),\n // ii. Else if targetLen is -∞𝔽, set L to 0.\n IntegerOrInfinity::NegativeInfinity => {}\n // iii. Else,\n IntegerOrInfinity::Integer(target_len) => {\n // 2. Assert: targetLenAsInt is finite.\n // 3. Let argCount be the number of elements in args.\n // 4. Set L to max(targetLenAsInt - argCount, 0).\n l = (target_len - arg_count).max(0).into();\n }\n }\n }\n }\n\n // 7. Perform ! SetFunctionLength(F, L).\n f.define_property_or_throw(\n StaticJsStrings::LENGTH,\n PropertyDescriptor::builder()\n .value(l)\n .writable(false)\n .enumerable(false)\n .configurable(true),\n context,\n )\n .js_expect(\"defining the `length` property for a new object should not fail\")?;\n\n // 8. Let targetName be ? Get(Target, \"name\").\n let target_name = target.get(js_string!(\"name\"), context)?;\n\n // 9. If Type(targetName) is not String, set targetName to the empty String.\n let target_name = target_name.as_string().unwrap_or_default();\n\n // 10. Perform SetFunctionName(F, targetName, \"bound\").\n set_function_name(&f, &target_name.into(), Some(js_str!(\"bound\")), context)?;\n\n // 11. Return F.\n Ok(f.into())\n }\n\n /// `Function.prototype.call ( thisArg, ...args )`\n ///\n /// The `call()` method calls a function with a given this value and arguments provided individually.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-function.prototype.call\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/call\n fn call(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let func be the this value.\n // 2. If IsCallable(func) is false, throw a TypeError exception.\n let func = this.as_callable().ok_or_else(|| {\n JsNativeError::typ().with_message(format!(\"{} is not a function\", this.display()))\n })?;\n let this_arg = args.get_or_undefined(0);\n\n // 3. Perform PrepareForTailCall().\n // TODO?: 3. Perform PrepareForTailCall\n\n // 4. Return ? Call(func, thisArg, args).\n func.call(this_arg, args.get(1..).unwrap_or(&[]), context)\n }\n\n /// `Function.prototype.toString()`\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-function.prototype.tostring\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/toString\n #[allow(clippy::wrong_self_convention)]\n fn to_string(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let func be the this value.\n let func = this;\n\n // TODO:\n // 2. If func is an Object, func has a [[SourceText]] internal slot, func.[[SourceText]] is a sequence of Unicode code points,and HostHasSourceTextAvailable(func) is true, then\n // a. Return CodePointsToString(func.[[SourceText]]).\n\n // 3. If func is a built-in function object, return an implementation-defined String source code representation of func.\n // The representation must have the syntax of a NativeFunction. Additionally, if func has an [[InitialName]] internal slot and\n // func.[[InitialName]] is a String, the portion of the returned String that would be matched by\n // NativeFunctionAccessor_opt PropertyName must be the value of func.[[InitialName]].\n\n // 4. If func is an Object and IsCallable(func) is true, return an implementation-defined String source code representation of func.\n // The representation must have the syntax of a NativeFunction.\n // 5. Throw a TypeError exception.\n let Some(object) = func.as_callable() else {\n return Err(JsNativeError::typ().with_message(\"not a function\").into());\n };\n\n if object.is::() {\n let name = {\n // Is there a case here where if there is no name field on a value\n // name should default to None? Do all functions have names set?\n let value = object.get(js_string!(\"name\"), &mut *context)?;\n if value.is_null_or_undefined() {\n js_string!()\n } else {\n value.to_string(context)?\n }\n };\n return Ok(\n js_string!(js_str!(\"function \"), &name, js_str!(\"() { [native code] }\")).into(),\n );\n } else if object.is::() || object.is::() {\n return Ok(js_string!(\"function () { [native code] }\").into());\n }\n\n let function = object\n .downcast_ref::()\n .ok_or_else(|| JsNativeError::typ().with_message(\"not a function\"))?;\n\n let code = function.codeblock();\n if let Some(code_points) = code.source_info().text_spanned().to_code_points() {\n return Ok(JsString::from(code_points).into());\n }\n\n Ok(js_string!(\n js_str!(\"function \"),\n code.name(),\n js_str!(\"() { [native code] }\")\n )\n .into())\n }\n\n /// `Function.prototype [ @@hasInstance ] ( V )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-function.prototype-@@hasinstance\n fn has_instance(this: &JsValue, args: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let F be the this value.\n // 2. Return ? OrdinaryHasInstance(F, V).\n Ok(JsValue::ordinary_has_instance(this, args.get_or_undefined(0), context)?.into())\n }\n\n #[allow(clippy::unnecessary_wraps)]\n fn prototype(_: &JsValue, _: &[JsValue], _: &mut Context) -> JsResult {\n Ok(JsValue::undefined())\n }\n}\n\n/// Abstract operation `SetFunctionName`\n///\n/// More information:\n/// - [ECMAScript reference][spec]\n///\n/// [spec]: https://tc39.es/ecma262/#sec-setfunctionname\npub(crate) fn set_function_name(\n function: &JsObject,\n name: &PropertyKey,\n prefix: Option>,\n context: &mut Context,\n) -> JsResult<()> {\n // 1. Assert: F is an extensible object that does not have a \"name\" own property.\n // 2. If Type(name) is Symbol, then\n let mut name = match name {\n PropertyKey::Symbol(sym) => {\n // a. Let description be name's [[Description]] value.\n // b. If description is undefined, set name to the empty String.\n // c. Else, set name to the string-concatenation of \"[\", description, and \"]\".\n sym.description().map_or_else(\n || js_string!(),\n |desc| js_string!(js_str!(\"[\"), &desc, js_str!(\"]\")),\n )\n }\n PropertyKey::String(string) => string.clone(),\n PropertyKey::Index(index) => js_string!(format!(\"{}\", index.get())),\n };\n\n // 3. Else if name is a Private Name, then\n // a. Set name to name.[[Description]].\n // todo: implement Private Names\n\n // 4. If F has an [[InitialName]] internal slot, then\n // a. Set F.[[InitialName]] to name.\n // todo: implement [[InitialName]] for builtins\n\n // 5. If prefix is present, then\n if let Some(prefix) = prefix {\n name = js_string!(prefix, js_str!(\" \"), &name);\n // b. If F has an [[InitialName]] internal slot, then\n // i. Optionally, set F.[[InitialName]] to name.\n // todo: implement [[InitialName]] for builtins\n }\n\n // 6. Return ! DefinePropertyOrThrow(F, \"name\", PropertyDescriptor { [[Value]]: name,\n // [[Writable]]: false, [[Enumerable]]: false, [[Configurable]]: true }).\n function\n .define_property_or_throw(\n js_string!(\"name\"),\n PropertyDescriptor::builder()\n .value(name)\n .writable(false)\n .enumerable(false)\n .configurable(true),\n context,\n )\n .js_expect(\"defining the `name` property must not fail per the spec\")?;\n\n Ok(())\n}\n\n/// Call this object.\n///\n/// # Panics\n///\n/// Panics if the object is currently mutably borrowed.\n// \n// \npub(crate) fn function_call(\n function_object: &JsObject,\n argument_count: usize,\n #[allow(\n unused_variables,\n reason = \"Only used if native-backtrace feature is enabled\"\n )]\n context: &mut InternalMethodCallContext<'_>,\n) -> JsResult {\n context.check_runtime_limits()?;\n\n let function = function_object\n .downcast_ref::()\n .js_expect(\"not a function\")?;\n let realm = function.realm().clone();\n\n if function.code.is_class_constructor() {\n debug_assert!(\n function.is_ordinary(),\n \"only ordinary functions can be classes\"\n );\n return Err(JsNativeError::typ()\n .with_message(\"class constructor cannot be invoked without 'new'\")\n .with_realm(realm)\n .into());\n }\n\n let code = function.code.clone();\n let environments = function.environments.clone();\n let script_or_module = function.script_or_module.clone();\n\n drop(function);\n\n let env_fp = environments.len() as u32;\n\n let frame = CallFrame::new(code, script_or_module, environments, realm)\n .with_argument_count(argument_count as u32)\n .with_env_fp(env_fp);\n\n #[cfg(feature = \"native-backtrace\")]\n {\n let native_source_info = context.native_source_info();\n context\n .vm\n .shadow_stack\n .patch_last_native(native_source_info);\n }\n\n context.vm.push_frame(frame);\n context.vm.set_return_value(JsValue::undefined());\n\n let context = context.context();\n\n let lexical_this_mode = context.vm.frame().code_block.this_mode == ThisMode::Lexical;\n let this = if lexical_this_mode {\n ThisBindingStatus::Lexical\n } else {\n let this = context.vm.stack.get_this(context.vm.frame());\n if context.vm.frame().code_block.strict() {\n context.vm.frame_mut().flags |= CallFrameFlags::THIS_VALUE_CACHED;\n ThisBindingStatus::Initialized(this)\n } else if this.is_null_or_undefined() {\n context.vm.frame_mut().flags |= CallFrameFlags::THIS_VALUE_CACHED;\n let this: JsValue = context.realm().global_this().clone().into();\n context.vm.stack.set_this(\n context.vm.frames.last().js_expect(\"frame must exist\")?,\n this.clone(),\n );\n ThisBindingStatus::Initialized(this)\n } else {\n let this: JsValue = this\n .to_object(context)\n .js_expect(\"conversion cannot fail\")?\n .into();\n context.vm.frame_mut().flags |= CallFrameFlags::THIS_VALUE_CACHED;\n context.vm.stack.set_this(\n context.vm.frames.last().js_expect(\"frame must exist\")?,\n this.clone(),\n );\n ThisBindingStatus::Initialized(this)\n }\n };\n\n let mut last_env = 0;\n\n let has_binding_identifier = context.vm.frame().code_block().has_binding_identifier();\n let has_function_scope = context.vm.frame().code_block().has_function_scope();\n\n if has_binding_identifier {\n let frame = context.vm.frame_mut();\n let global = frame.realm.environment();\n let index = frame.environments.push_lexical(1, global);\n frame.environments.put_lexical_value(\n BindingLocatorScope::Stack(index),\n 0,\n function_object.clone().into(),\n global,\n );\n last_env += 1;\n }\n\n if has_function_scope {\n let scope = context.vm.frame().code_block().constant_scope(last_env);\n let frame = context.vm.frame_mut();\n let global = frame.realm.environment();\n frame.environments.push_function(\n scope,\n FunctionSlots::new(this, function_object.clone(), None),\n global,\n );\n }\n\n Ok(CallValue::Ready)\n}\n\n/// Construct an instance of this object with the specified arguments.\n///\n/// # Panics\n///\n/// Panics if the object is currently mutably borrowed.\n// \nfn function_construct(\n this_function_object: &JsObject,\n argument_count: usize,\n context: &mut InternalMethodCallContext<'_>,\n) -> JsResult {\n context.check_runtime_limits()?;\n\n let function = this_function_object\n .downcast_ref::()\n .js_expect(\"not a function\")?;\n let realm = function.realm().clone();\n\n debug_assert!(\n function.is_ordinary(),\n \"only ordinary functions can be constructed\"\n );\n\n let code = function.code.clone();\n let environments = function.environments.clone();\n let script_or_module = function.script_or_module.clone();\n drop(function);\n\n let env_fp = environments.len() as u32;\n\n let new_target = context.vm.stack.pop();\n\n let this = if code.is_derived_constructor() {\n None\n } else {\n // If the prototype of the constructor is not an object, then use the default object\n // prototype as prototype for the new object\n // see \n // see \n let prototype =\n get_prototype_from_constructor(&new_target, StandardConstructors::object, context)?;\n let this = JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n prototype,\n OrdinaryObject,\n )\n .upcast();\n\n this.initialize_instance_elements(this_function_object, context)?;\n\n Some(this)\n };\n\n let mut frame = CallFrame::new(code, script_or_module, environments, realm)\n .with_argument_count(argument_count as u32)\n .with_env_fp(env_fp)\n .with_flags(CallFrameFlags::CONSTRUCT);\n\n // We push the `this` below so we can mark this function as having the this value\n // cached if it's initialized.\n frame\n .flags\n .set(CallFrameFlags::THIS_VALUE_CACHED, this.is_some());\n\n #[cfg(feature = \"native-backtrace\")]\n {\n let native_source_info = context.native_source_info();\n context\n .vm\n .shadow_stack\n .patch_last_native(native_source_info);\n }\n\n context.vm.push_frame(frame);\n context.vm.set_return_value(JsValue::undefined());\n\n let mut last_env = 0;\n\n let has_binding_identifier = context.vm.frame().code_block().has_binding_identifier();\n let has_function_scope = context.vm.frame().code_block().has_function_scope();\n\n if has_binding_identifier {\n let frame = context.vm.frame_mut();\n let global = frame.realm.environment();\n let index = frame.environments.push_lexical(1, global);\n frame.environments.put_lexical_value(\n BindingLocatorScope::Stack(index),\n 0,\n this_function_object.clone().into(),\n global,\n );\n last_env += 1;\n }\n\n if has_function_scope {\n let scope = context.vm.frame().code_block().constant_scope(last_env);\n let frame = context.vm.frame_mut();\n let global = frame.realm.environment();\n frame.environments.push_function(\n scope,\n FunctionSlots::new(\n this.clone().map_or(ThisBindingStatus::Uninitialized, |o| {\n ThisBindingStatus::Initialized(o.into())\n }),\n this_function_object.clone(),\n Some(\n new_target\n .as_object()\n .js_expect(\"new.target should be an object\")?\n .clone(),\n ),\n ),\n global,\n );\n }\n\n let context = context.context();\n context.vm.stack.set_this(\n context.vm.frames.last().js_expect(\"frame must exist\")?,\n this.map(JsValue::new).unwrap_or_default(),\n );\n\n Ok(CallValue::Ready)\n}\n" }, { "path": "core/engine/src/builtins/function/tests.rs", "content": "use crate::{\n JsNativeErrorKind, JsValue, TestAction,\n error::JsNativeError,\n js_string,\n native_function::NativeFunction,\n object::{FunctionObjectBuilder, JsObject},\n property::{Attribute, PropertyDescriptor},\n run_test_actions,\n};\nuse boa_macros::js_str;\nuse indoc::indoc;\n\n#[allow(clippy::float_cmp)]\n#[test]\nfn arguments_object() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n function jason(a, b) {\n return arguments[0];\n }\n \"#}),\n TestAction::assert_eq(\"jason(100, 6)\", 100),\n ]);\n}\n\n#[test]\nfn self_mutating_function_when_calling() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n function x() {\n x.y = 3;\n }\n x();\n \"#}),\n TestAction::assert_eq(\"x.y\", 3),\n ]);\n}\n\n#[test]\nfn self_mutating_function_when_constructing() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n function x() {\n x.y = 3;\n }\n new x();\n \"#}),\n TestAction::assert_eq(\"x.y\", 3),\n ]);\n}\n\n#[test]\nfn function_prototype() {\n run_test_actions([\n TestAction::assert_eq(\"Function.prototype.name\", js_string!()),\n TestAction::assert_eq(\"Function.prototype.length\", 0),\n TestAction::assert_eq(\"Function.prototype()\", JsValue::undefined()),\n TestAction::assert_eq(\n \"Function.prototype(1, '', new String(''))\",\n JsValue::undefined(),\n ),\n TestAction::assert_native_error(\n \"new Function.prototype()\",\n JsNativeErrorKind::Type,\n \"not a constructor\",\n ),\n ]);\n}\n\n#[test]\nfn function_prototype_call() {\n run_test_actions([TestAction::assert_eq(\n \"Object.prototype.toString.call(new Error())\",\n js_str!(\"[object Error]\"),\n )]);\n}\n\n#[test]\nfn function_prototype_call_throw() {\n run_test_actions([TestAction::assert_native_error(\n indoc! {r#\"\n let call = Function.prototype.call;\n call(call)\n \"#},\n JsNativeErrorKind::Type,\n \"undefined is not a function\",\n )]);\n}\n\n#[test]\nfn function_prototype_call_multiple_args() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n function f(a, b) {\n this.a = a;\n this.b = b;\n }\n let o = {a: 0, b: 0};\n f.call(o, 1, 2);\n \"#}),\n TestAction::assert_eq(\"o.a\", 1),\n TestAction::assert_eq(\"o.b\", 2),\n ]);\n}\n\n#[test]\nfn function_prototype_apply() {\n run_test_actions([\n TestAction::run(\"const numbers = [6, 7, 3, 4, 2]\"),\n TestAction::assert_eq(\"Math.max.apply(null, numbers)\", 7),\n TestAction::assert_eq(\"Math.min.apply(null, numbers)\", 2),\n ]);\n}\n\n#[test]\nfn function_prototype_apply_on_object() {\n run_test_actions([\n TestAction::run(indoc! {r#\"\n function f(a, b) {\n this.a = a;\n this.b = b;\n }\n let o = {a: 0, b: 0};\n f.apply(o, [1, 2]);\n \"#}),\n TestAction::assert_eq(\"o.a\", 1),\n TestAction::assert_eq(\"o.b\", 2),\n ]);\n}\n\n#[test]\nfn closure_capture_clone() {\n run_test_actions([\n TestAction::inspect_context(|ctx| {\n let string = js_string!(\"Hello\");\n let object = JsObject::with_object_proto(ctx.intrinsics());\n object\n .define_property_or_throw(\n js_string!(\"key\"),\n PropertyDescriptor::builder()\n .value(js_string!(\" world!\"))\n .writable(false)\n .enumerable(false)\n .configurable(false),\n ctx,\n )\n .unwrap();\n\n let func = FunctionObjectBuilder::new(\n ctx.realm(),\n NativeFunction::from_copy_closure_with_captures(\n |_, _, captures, context| {\n let (string, object) = &captures;\n\n let hw = js_string!(\n string,\n &object\n .__get_own_property__(\n &js_string!(\"key\").into(),\n &mut context.into()\n )?\n .and_then(|prop| prop.value().and_then(JsValue::as_string))\n .ok_or_else(\n || JsNativeError::typ().with_message(\"invalid `key` property\")\n )?\n );\n Ok(hw.into())\n },\n (string, object),\n ),\n )\n .name(js_str!(\"closure\"))\n .build();\n\n ctx.register_global_property(js_str!(\"closure\"), func, Attribute::default())\n .unwrap();\n }),\n TestAction::assert_eq(\"closure()\", js_str!(\"Hello world!\")),\n ]);\n}\n\n#[test]\nfn function_constructor_early_errors_super() {\n run_test_actions([\n TestAction::assert_native_error(\n \"Function('super()')()\",\n JsNativeErrorKind::Syntax,\n \"invalid `super` call\",\n ),\n TestAction::assert_native_error(\n \"Function('super.a')()\",\n JsNativeErrorKind::Syntax,\n \"invalid `super` reference\",\n ),\n ]);\n}\n" }, { "path": "core/engine/src/builtins/generator/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `Generator` object.\n//!\n//! A Generator is an instance of a generator function and conforms to both the Iterator and Iterable interfaces.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-generator-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Generator\n\nuse crate::{\n Context, JsArgs, JsData, JsError, JsExpect, JsResult, JsString,\n builtins::iterable::create_iter_result_object,\n context::intrinsics::Intrinsics,\n error::JsNativeError,\n error::PanicError,\n js_string,\n object::{CONSTRUCTOR, JsObject},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::JsValue,\n vm::{CallFrame, CallFrameFlags, CompletionRecord, GeneratorResumeKind, Stack},\n};\nuse boa_gc::{Finalize, Trace, custom_trace};\n\nuse super::{BuiltInBuilder, IntrinsicObject};\n\n/// Indicates the state of a generator.\n#[derive(Debug, Finalize)]\npub(crate) enum GeneratorState {\n SuspendedStart {\n /// The `[[GeneratorContext]]` internal slot.\n context: GeneratorContext,\n },\n SuspendedYield {\n /// The `[[GeneratorContext]]` internal slot.\n context: GeneratorContext,\n },\n Executing,\n Completed,\n}\n\n// Need to manually implement, since `Trace` adds a `Drop` impl which disallows destructuring.\nunsafe impl Trace for GeneratorState {\n custom_trace!(this, mark, {\n match &this {\n Self::SuspendedStart { context } | Self::SuspendedYield { context } => mark(context),\n Self::Executing | Self::Completed => {}\n }\n });\n}\n\n/// Holds all information that a generator needs to continue it's execution.\n///\n/// All of the fields must be changed with those that are currently present in the\n/// context/vm before the generator execution starts/resumes and after it has ended/yielded.\n#[derive(Debug, Trace, Finalize)]\npub(crate) struct GeneratorContext {\n pub(crate) stack: Stack,\n pub(crate) call_frame: Option,\n}\n\nimpl GeneratorContext {\n /// Creates a new `GeneratorContext` from the current `Context` state.\n pub(crate) fn from_current(context: &mut Context, async_generator: Option) -> Self {\n let mut frame = context.vm.frame().clone();\n frame.environments = context.vm.frame().environments.clone();\n frame.realm = context.realm().clone();\n\n // Split the stack at fp. The split-off portion starts at what was fp,\n // so adjust rp and fp to be relative to the new base.\n let mut stack = context.vm.stack.split_off_frame(&frame);\n frame.rp -= frame.fp;\n frame.fp = 0;\n\n // NOTE: Since we get a pre-built call frame with stack, and we reuse them.\n // So we don't need to push the registers in subsequent calls.\n frame.flags |= CallFrameFlags::REGISTERS_ALREADY_PUSHED;\n\n if let Some(async_generator) = async_generator {\n stack.set_register(\n &frame,\n CallFrame::ASYNC_GENERATOR_OBJECT_REGISTER_INDEX,\n async_generator.into(),\n );\n }\n\n Self {\n call_frame: Some(frame),\n stack,\n }\n }\n\n /// Resumes execution with `GeneratorContext` as the current execution context.\n pub(crate) fn resume(\n &mut self,\n value: Option,\n resume_kind: GeneratorResumeKind,\n context: &mut Context,\n ) -> CompletionRecord {\n std::mem::swap(&mut context.vm.stack, &mut self.stack);\n let Some(frame) = self.call_frame.take() else {\n return CompletionRecord::Throw(PanicError::new(\"should have a call frame\").into());\n };\n let fp = frame.fp;\n let rp = frame.rp;\n context.vm.push_frame(frame);\n\n let frame = context.vm.frame_mut();\n frame.fp = fp;\n frame.rp = rp;\n frame.set_exit_early(true);\n\n if let Some(value) = value {\n context.vm.stack.push(value);\n }\n context.vm.stack.push(resume_kind);\n\n let result = context.run();\n\n std::mem::swap(&mut context.vm.stack, &mut self.stack);\n self.call_frame = context.vm.pop_frame();\n assert!(self.call_frame.is_some());\n result\n }\n\n /// Returns the async generator object, if the function that this [`GeneratorContext`] is from an async generator, [`None`] otherwise.\n pub(crate) fn async_generator_object(&self) -> JsResult> {\n let Some(frame) = self.call_frame.as_ref() else {\n return Ok(None);\n };\n\n if !frame.code_block().is_async_generator() {\n return Ok(None);\n }\n\n let val = self\n .stack\n .get_register(frame, CallFrame::ASYNC_GENERATOR_OBJECT_REGISTER_INDEX)\n .js_expect(\"registers must have an async generator object\")?;\n\n Ok(val.as_object())\n }\n}\n\n/// The internal representation of a `Generator` object.\n#[derive(Debug, Finalize, Trace, JsData)]\npub struct Generator {\n /// The `[[GeneratorState]]` internal slot.\n pub(crate) state: GeneratorState,\n}\n\nimpl IntrinsicObject for Generator {\n fn init(realm: &Realm) {\n BuiltInBuilder::with_intrinsic::(realm)\n .prototype(\n realm\n .intrinsics()\n .objects()\n .iterator_prototypes()\n .iterator(),\n )\n .static_method(Self::next, js_string!(\"next\"), 1)\n .static_method(Self::r#return, js_string!(\"return\"), 1)\n .static_method(Self::throw, js_string!(\"throw\"), 1)\n .static_property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::CONFIGURABLE,\n )\n .static_property(\n CONSTRUCTOR,\n realm\n .intrinsics()\n .constructors()\n .generator_function()\n .prototype(),\n Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n intrinsics.objects().generator()\n }\n}\n\nimpl Generator {\n const NAME: JsString = StaticJsStrings::GENERATOR;\n\n /// `Generator.prototype.next ( value )`\n ///\n /// The `next()` method returns an object with two properties done and value.\n /// You can also provide a parameter to the next method to send a value to the generator.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-generator.prototype.next\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Generator/next\n pub(crate) fn next(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Return ? GeneratorResume(this value, value, empty).\n Self::generator_resume(this, args.get_or_undefined(0).clone(), context)\n }\n\n /// `Generator.prototype.return ( value )`\n ///\n /// The `return()` method returns the given value and finishes the generator.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-generator.prototype.return\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Generator/return\n pub(crate) fn r#return(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let g be the this value.\n // 2. Let C be Completion { [[Type]]: return, [[Value]]: value, [[Target]]: empty }.\n // 3. Return ? GeneratorResumeAbrupt(g, C, empty).\n Self::generator_resume_abrupt(this, Ok(args.get_or_undefined(0).clone()), context)\n }\n\n /// `Generator.prototype.throw ( exception )`\n ///\n /// The `throw()` method resumes the execution of a generator by throwing an error into it\n /// and returns an object with two properties done and value.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-generator.prototype.throw\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Generator/throw\n pub(crate) fn throw(\n this: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. Let g be the this value.\n // 2. Let C be ThrowCompletion(exception).\n // 3. Return ? GeneratorResumeAbrupt(g, C, empty).\n Self::generator_resume_abrupt(\n this,\n Err(JsError::from_opaque(args.get_or_undefined(0).clone())),\n context,\n )\n }\n\n /// `27.5.3.3 GeneratorResume ( generator, value, generatorBrand )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-generatorresume\n pub(crate) fn generator_resume(\n r#gen: &JsValue,\n value: JsValue,\n context: &mut Context,\n ) -> JsResult {\n // 1. Let state be ? GeneratorValidate(generator, generatorBrand).\n let Some(generator_obj) = r#gen.as_object() else {\n return Err(JsNativeError::typ()\n .with_message(\"Generator method called on non generator\")\n .into());\n };\n let mut r#gen = generator_obj.downcast_mut::().ok_or_else(|| {\n JsNativeError::typ().with_message(\"generator resumed on non generator object\")\n })?;\n\n // 4. Let genContext be generator.[[GeneratorContext]].\n // 5. Let methodContext be the running execution context.\n // 6. Suspend methodContext.\n // 7. Set generator.[[GeneratorState]] to executing.\n let (mut generator_context, first_execution) =\n match std::mem::replace(&mut r#gen.state, GeneratorState::Executing) {\n GeneratorState::Executing => {\n return Err(JsNativeError::typ()\n .with_message(\"Generator should not be executing\")\n .into());\n }\n // 2. If state is completed, return CreateIterResultObject(undefined, true).\n GeneratorState::Completed => {\n r#gen.state = GeneratorState::Completed;\n return Ok(create_iter_result_object(\n JsValue::undefined(),\n true,\n context,\n ));\n }\n // 3. Assert: state is either suspendedStart or suspendedYield.\n GeneratorState::SuspendedStart { context } => (context, true),\n GeneratorState::SuspendedYield { context } => (context, false),\n };\n\n drop(r#gen);\n\n let record = generator_context.resume(\n (!first_execution).then_some(value),\n GeneratorResumeKind::Normal,\n context,\n );\n\n let mut r#gen = generator_obj\n .downcast_mut::()\n .js_expect(\"already checked this object type\")?;\n\n // 8. Push genContext onto the execution context stack; genContext is now the running execution context.\n // 9. Resume the suspended evaluation of genContext using NormalCompletion(value) as the result of the operation that suspended it. Let result be the value returned by the resumed computation.\n // 10. Assert: When we return here, genContext has already been removed from the execution context stack and methodContext is the currently running execution context.\n // 11. Return Completion(result).\n match record {\n CompletionRecord::Normal(value) => {\n r#gen.state = GeneratorState::SuspendedYield {\n context: generator_context,\n };\n Ok(value)\n }\n CompletionRecord::Return(value) => {\n r#gen.state = GeneratorState::Completed;\n Ok(create_iter_result_object(value, true, context))\n }\n CompletionRecord::Throw(err) => {\n r#gen.state = GeneratorState::Completed;\n Err(err)\n }\n }\n }\n\n /// `27.5.3.4 GeneratorResumeAbrupt ( generator, abruptCompletion, generatorBrand )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-generatorresumeabrupt\n pub(crate) fn generator_resume_abrupt(\n r#gen: &JsValue,\n abrupt_completion: JsResult,\n context: &mut Context,\n ) -> JsResult {\n // 1. Let state be ? GeneratorValidate(generator, generatorBrand).\n let Some(generator_obj) = r#gen.as_object() else {\n return Err(JsNativeError::typ()\n .with_message(\"Generator method called on non generator\")\n .into());\n };\n let mut r#gen = generator_obj.downcast_mut::().ok_or_else(|| {\n JsNativeError::typ().with_message(\"generator resumed on non generator object\")\n })?;\n\n // 4. Assert: state is suspendedYield.\n // 5. Let genContext be generator.[[GeneratorContext]].\n // 6. Let methodContext be the running execution context.\n // 7. Suspend methodContext.\n // 8. Set generator.[[GeneratorState]] to executing.\n let mut generator_context =\n match std::mem::replace(&mut r#gen.state, GeneratorState::Executing) {\n GeneratorState::Executing => {\n return Err(JsNativeError::typ()\n .with_message(\"Generator should not be executing\")\n .into());\n }\n // 2. If state is suspendedStart, then\n // 3. If state is completed, then\n GeneratorState::SuspendedStart { .. } | GeneratorState::Completed => {\n // a. Set generator.[[GeneratorState]] to completed.\n r#gen.state = GeneratorState::Completed;\n\n // b. Once a generator enters the completed state it never leaves it and its\n // associated execution context is never resumed. Any execution state associated\n // with generator can be discarded at this point.\n\n // a. If abruptCompletion.[[Type]] is return, then\n if let Ok(value) = abrupt_completion {\n // i. Return CreateIterResultObject(abruptCompletion.[[Value]], true).\n let value = create_iter_result_object(value, true, context);\n return Ok(value);\n }\n\n // b. Return Completion(abruptCompletion).\n return abrupt_completion;\n }\n GeneratorState::SuspendedYield { context } => context,\n };\n\n // 9. Push genContext onto the execution context stack; genContext is now the running execution context.\n // 10. Resume the suspended evaluation of genContext using abruptCompletion as the result of the operation that suspended it. Let result be the completion record returned by the resumed computation.\n // 11. Assert: When we return here, genContext has already been removed from the execution context stack and methodContext is the currently running execution context.\n // 12. Return Completion(result).\n drop(r#gen);\n\n let (value, resume_kind) = match abrupt_completion {\n Ok(value) => (value, GeneratorResumeKind::Return),\n Err(err) => (err.into_opaque(context)?, GeneratorResumeKind::Throw),\n };\n\n let record = generator_context.resume(Some(value), resume_kind, context);\n\n let mut r#gen = generator_obj.downcast_mut::().ok_or_else(|| {\n JsNativeError::typ().with_message(\"generator resumed on non generator object\")\n })?;\n\n match record {\n CompletionRecord::Normal(value) => {\n r#gen.state = GeneratorState::SuspendedYield {\n context: generator_context,\n };\n Ok(value)\n }\n CompletionRecord::Return(value) => {\n r#gen.state = GeneratorState::Completed;\n Ok(create_iter_result_object(value, true, context))\n }\n CompletionRecord::Throw(err) => {\n r#gen.state = GeneratorState::Completed;\n Err(err)\n }\n }\n }\n}\n" }, { "path": "core/engine/src/builtins/generator_function/mod.rs", "content": "//! Boa's implementation of ECMAScript's global `GeneratorFunction` object.\n//!\n//! The `GeneratorFunction` constructor creates a new generator function object.\n//! In ECMAScript, every generator function is actually a `GeneratorFunction` object.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//! - [MDN documentation][mdn]\n//!\n//! [spec]: https://tc39.es/ecma262/#sec-generatorfunction-objects\n//! [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/GeneratorFunction\n\nuse crate::{\n Context, JsResult, JsString,\n builtins::{BuiltInObject, function::BuiltInFunctionObject},\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n object::PROTOTYPE,\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n value::JsValue,\n};\n\nuse super::{BuiltInBuilder, BuiltInConstructor, IntrinsicObject};\n\n/// The internal representation of a `Generator` object.\n#[derive(Debug, Clone, Copy)]\npub struct GeneratorFunction;\n\nimpl IntrinsicObject for GeneratorFunction {\n fn init(realm: &Realm) {\n BuiltInBuilder::from_standard_constructor::(realm)\n .inherits(Some(\n realm.intrinsics().constructors().function().prototype(),\n ))\n .constructor_attributes(Attribute::CONFIGURABLE)\n .property(\n PROTOTYPE,\n realm.intrinsics().objects().generator(),\n Attribute::CONFIGURABLE,\n )\n .property(\n JsSymbol::to_string_tag(),\n Self::NAME,\n Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> crate::object::JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for GeneratorFunction {\n const NAME: JsString = StaticJsStrings::GENERATOR_FUNCTION;\n}\n\nimpl BuiltInConstructor for GeneratorFunction {\n const CONSTRUCTOR_ARGUMENTS: usize = 1;\n const PROTOTYPE_STORAGE_SLOTS: usize = 2;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 0;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::generator_function;\n\n /// `GeneratorFunction ( p1, p2, … , pn, body )`\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n ///\n /// [spec]: https://tc39.es/ecma262/#sec-generatorfunction\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let active_function = context.active_function_object().unwrap_or_else(|| {\n context\n .intrinsics()\n .constructors()\n .generator_function()\n .constructor()\n });\n BuiltInFunctionObject::create_dynamic_function(\n active_function,\n new_target,\n args,\n false,\n true,\n context,\n )\n .map(Into::into)\n }\n}\n" }, { "path": "core/engine/src/builtins/intl/collator/mod.rs", "content": "use boa_gc::{Finalize, Trace, custom_trace};\nuse icu_collator::{\n CollatorPreferences,\n options::{AlternateHandling, MaxVariable},\n preferences::{CollationCaseFirst, CollationNumericOrdering, CollationType},\n provider::CollationMetadataV1,\n};\n\nuse icu_locale::{Locale, extensions::unicode};\n\nuse crate::{\n Context, JsArgs, JsData, JsExpect, JsNativeError, JsResult, JsString, JsValue,\n builtins::{\n BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject, OrdinaryObject,\n options::get_option,\n },\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n native_function::NativeFunction,\n object::{\n FunctionObjectBuilder, JsFunction, JsObject,\n internal_methods::get_prototype_from_constructor,\n },\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n};\n\nuse super::{\n Service,\n locale::{canonicalize_locale_list, filter_locales, resolve_locale},\n options::{IntlOptions, coerce_options_to_object},\n};\n\nmod options;\npub(crate) use options::*;\n\n#[derive(Debug, Finalize, JsData)]\n#[allow(clippy::struct_field_names)]\npub(crate) struct Collator {\n locale: Locale,\n collation: Option,\n numeric: bool,\n case_first: Option,\n usage: Usage,\n sensitivity: Sensitivity,\n ignore_punctuation: bool,\n collator: icu_collator::Collator,\n bound_compare: Option,\n}\n\n// SAFETY: only `bound_compare` is a traceable object.\nunsafe impl Trace for Collator {\n custom_trace!(this, mark, mark(&this.bound_compare));\n}\n\nimpl Collator {\n /// Gets the inner [`icu_collator::Collator`] comparator.\n pub(crate) const fn collator(&self) -> &icu_collator::Collator {\n &self.collator\n }\n}\n\nimpl Service for Collator {\n type LangMarker = CollationMetadataV1;\n\n type Preferences = CollatorPreferences;\n}\n\nimpl IntrinsicObject for Collator {\n fn init(realm: &Realm) {\n let compare = BuiltInBuilder::callable(realm, Self::compare)\n .name(js_string!(\"get compare\"))\n .build();\n\n BuiltInBuilder::from_standard_constructor::(realm)\n .static_method(\n Self::supported_locales_of,\n js_string!(\"supportedLocalesOf\"),\n 1,\n )\n .property(\n JsSymbol::to_string_tag(),\n js_string!(\"Intl.Collator\"),\n Attribute::CONFIGURABLE,\n )\n .accessor(\n js_string!(\"compare\"),\n Some(compare),\n None,\n Attribute::CONFIGURABLE,\n )\n .method(Self::resolved_options, js_string!(\"resolvedOptions\"), 0)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for Collator {\n const NAME: JsString = StaticJsStrings::COLLATOR;\n}\n\nimpl BuiltInConstructor for Collator {\n const CONSTRUCTOR_ARGUMENTS: usize = 0;\n const PROTOTYPE_STORAGE_SLOTS: usize = 4;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 1;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::collator;\n\n /// Constructor [`Intl.Collator ( [ locales [ , options ] ] )`][spec].\n ///\n /// Constructor for `Collator` objects.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sec-intl.collator\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Collator\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, let newTarget be the active function object, else let newTarget be NewTarget.\n let new_target = &if new_target.is_undefined() {\n context\n .active_function_object()\n .unwrap_or_else(|| context.intrinsics().constructors().collator().constructor())\n .into()\n } else {\n new_target.clone()\n };\n // 2. Let internalSlotsList be « [[InitializedCollator]], [[Locale]], [[Usage]], [[Sensitivity]], [[IgnorePunctuation]], [[Collation]], [[BoundCompare]] ».\n // 3. If %Collator%.[[RelevantExtensionKeys]] contains \"kn\", then\n // a. Append [[Numeric]] as the last element of internalSlotsList.\n // 4. If %Collator%.[[RelevantExtensionKeys]] contains \"kf\", then\n // a. Append [[CaseFirst]] as the last element of internalSlotsList.\n // 5. Let collator be ? OrdinaryCreateFromConstructor(newTarget, \"%Collator.prototype%\", internalSlotsList).\n // 6. Return ? InitializeCollator(collator, locales, options).\n\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n\n // Abstract operation `InitializeCollator ( collator, locales, options )`\n // https://tc39.es/ecma402/#sec-initializecollator\n\n // 1. Let requestedLocales be ? CanonicalizeLocaleList(locales).\n let requested_locales = canonicalize_locale_list(locales, context)?;\n\n // 2. Set options to ? CoerceOptionsToObject(options).\n let options = coerce_options_to_object(options, context)?;\n\n // 3. Let usage be ? GetOption(options, \"usage\", string, « \"sort\", \"search\" », \"sort\").\n // 4. Set collator.[[Usage]] to usage.\n // 5. If usage is \"sort\", then\n // a. Let localeData be %Collator%.[[SortLocaleData]].\n // 6. Else,\n // a. Let localeData be %Collator%.[[SearchLocaleData]].\n let usage = get_option(&options, js_string!(\"usage\"), context)?.unwrap_or_default();\n\n // 7. Let opt be a new Record.\n // 8. Let matcher be ? GetOption(options, \"localeMatcher\", string, « \"lookup\", \"best fit\" », \"best fit\").\n // 9. Set opt.[[localeMatcher]] to matcher.\n let matcher =\n get_option(&options, js_string!(\"localeMatcher\"), context)?.unwrap_or_default();\n\n // 10. Let collation be ? GetOption(options, \"collation\", string, empty, undefined).\n // 11. If collation is not undefined, then\n // a. If collation does not match the Unicode Locale Identifier type nonterminal, throw a RangeError exception.\n // 12. Set opt.[[co]] to collation.\n // unicode `type`s that are not valid collation types are considered\n // \"unsupported\" instead of invalid.\n let collation = get_option::(&options, js_string!(\"collation\"), context)?\n .and_then(|val| CollationType::try_from(&val).ok());\n\n // 13. Let numeric be ? GetOption(options, \"numeric\", boolean, empty, undefined).\n // 14. If numeric is not undefined, then\n // a. Let numeric be ! ToString(numeric).\n // 15. Set opt.[[kn]] to numeric.\n let numeric = get_option(&options, js_string!(\"numeric\"), context)?;\n\n // 16. Let caseFirst be ? GetOption(options, \"caseFirst\", string, « \"upper\", \"lower\", \"false\" », undefined).\n // 17. Set opt.[[kf]] to caseFirst.\n let case_first = get_option(&options, js_string!(\"caseFirst\"), context)?;\n\n let mut intl_options = IntlOptions {\n matcher,\n preferences: {\n let mut prefs = CollatorPreferences::default();\n prefs.collation_type = collation;\n prefs.numeric_ordering = numeric.map(|kn| {\n if kn {\n CollationNumericOrdering::True\n } else {\n CollationNumericOrdering::False\n }\n });\n prefs.case_first = case_first;\n prefs\n },\n };\n\n // 18. Let relevantExtensionKeys be %Collator%.[[RelevantExtensionKeys]].\n // 19. Let r be ResolveLocale(%Collator%.[[AvailableLocales]], requestedLocales, opt, relevantExtensionKeys, localeData).\n let locale = resolve_locale::(\n requested_locales,\n &mut intl_options,\n context.intl_provider(),\n )?;\n\n // 20. Set collator.[[Locale]] to r.[[locale]].\n // 21. Let collation be r.[[co]].\n // 22. If collation is null, let collation be \"default\".\n // 23. Set collator.[[Collation]] to collation.\n let collation = intl_options.preferences.collation_type;\n\n // 24. If relevantExtensionKeys contains \"kn\", then\n // a. Set collator.[[Numeric]] to SameValue(r.[[kn]], \"true\").\n let numeric =\n intl_options.preferences.numeric_ordering == Some(CollationNumericOrdering::True);\n\n // 25. If relevantExtensionKeys contains \"kf\", then\n // a. Set collator.[[CaseFirst]] to r.[[kf]].\n let case_first = intl_options.preferences.case_first;\n\n // 26. Let sensitivity be ? GetOption(options, \"sensitivity\", string, « \"base\", \"accent\", \"case\", \"variant\" », undefined).\n // 28. Set collator.[[Sensitivity]] to sensitivity.\n let sensitivity = get_option(&options, js_string!(\"sensitivity\"), context)?\n // 27. If sensitivity is undefined, then\n // a. If usage is \"sort\", then\n // i. Let sensitivity be \"variant\".\n // b. Else,\n // i. Let dataLocale be r.[[dataLocale]].\n // ii. Let dataLocaleData be localeData.[[]].\n // iii. Let sensitivity be dataLocaleData.[[sensitivity]].\n .or_else(|| (usage == Usage::Sort).then_some(Sensitivity::Variant));\n\n // 29. Let ignorePunctuation be ? GetOption(options, \"ignorePunctuation\", boolean, empty, false).\n // 30. Set collator.[[IgnorePunctuation]] to ignorePunctuation.\n let ignore_punctuation = get_option(&options, js_string!(\"ignorePunctuation\"), context)?;\n\n let (strength, case_level) = sensitivity.map(Sensitivity::to_collator_options).unzip();\n\n let (alternate_handling, max_variable) = match ignore_punctuation {\n Some(true) => Some((AlternateHandling::Shifted, MaxVariable::Punctuation)).unzip(),\n Some(false) => (Some(AlternateHandling::NonIgnorable), None),\n None => None.unzip(),\n };\n\n let mut options = icu_collator::options::CollatorOptions::default();\n options.strength = strength;\n options.case_level = case_level;\n options.alternate_handling = alternate_handling;\n options.max_variable = max_variable;\n\n if usage == Usage::Search {\n intl_options.preferences.collation_type = Some(CollationType::Search);\n }\n\n let collator = icu_collator::Collator::try_new_with_buffer_provider(\n context.intl_provider().erased_provider(),\n intl_options.preferences,\n options,\n )\n .map_err(|e| JsNativeError::typ().with_message(e.to_string()))?;\n\n let resolved_options = collator.as_borrowed().resolved_options();\n\n let prototype =\n get_prototype_from_constructor(new_target, StandardConstructors::collator, context)?;\n let collator = JsObject::from_proto_and_data_with_shared_shape(\n context.root_shape(),\n prototype,\n Self {\n locale,\n collation,\n numeric,\n case_first,\n usage,\n sensitivity: sensitivity.unwrap_or(Sensitivity::Variant),\n ignore_punctuation: resolved_options.alternate_handling\n == AlternateHandling::Shifted\n && resolved_options.max_variable != MaxVariable::Space,\n collator,\n bound_compare: None,\n },\n );\n\n // 31. Return collator.\n Ok(collator.into())\n }\n}\n\nimpl Collator {\n /// [`Intl.Collator.supportedLocalesOf ( locales [ , options ] )`][spec].\n ///\n /// Returns an array containing those of the provided locales that are supported in collation\n /// without having to fall back to the runtime's default locale.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sec-intl.collator.supportedlocalesof\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Collator/supportedLocalesOf\n fn supported_locales_of(\n _: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n\n // 1. Let availableLocales be %Collator%.[[AvailableLocales]].\n // 2. Let requestedLocales be ? CanonicalizeLocaleList(locales).\n let requested_locales = canonicalize_locale_list(locales, context)?;\n\n // 3. Return ? FilterLocales(availableLocales, requestedLocales, options).\n filter_locales::(requested_locales, options, context).map(JsValue::from)\n }\n\n /// [`get Intl.Collator.prototype.compare`][spec].\n ///\n /// Compares two strings according to the sort order of this Intl.Collator object.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sec-intl.collator.prototype.compare\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Collator/compare\n fn compare(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let collator be the this value.\n // 2. Perform ? RequireInternalSlot(collator, [[InitializedCollator]]).\n let this = this.as_object().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"`resolvedOptions` can only be called on a `Collator` object\")\n })?;\n let collator_obj = this.clone();\n let mut collator = this.downcast_mut::().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"`resolvedOptions` can only be called on a `Collator` object\")\n })?;\n\n // 3. If collator.[[BoundCompare]] is undefined, then\n // a. Let F be a new built-in function object as defined in 10.3.3.1.\n // b. Set F.[[Collator]] to collator.\n // c. Set collator.[[BoundCompare]] to F.\n let bound_compare = if let Some(f) = collator.bound_compare.clone() {\n f\n } else {\n let bound_compare = FunctionObjectBuilder::new(\n context.realm(),\n // 10.3.3.1. Collator Compare Functions\n // https://tc39.es/ecma402/#sec-collator-compare-functions\n NativeFunction::from_copy_closure_with_captures(\n |_, args, collator, context| {\n // 1. Let collator be F.[[Collator]].\n // 2. Assert: Type(collator) is Object and collator has an [[InitializedCollator]] internal slot.\n let collator = collator\n .downcast_ref::()\n .js_expect(\"checked above that the object was a collator object\")?;\n\n // 3. If x is not provided, let x be undefined.\n // 5. Let X be ? ToString(x).\n let x = args\n .get_or_undefined(0)\n .to_string(context)?\n .iter()\n .collect::>();\n\n // 4. If y is not provided, let y be undefined.\n // 6. Let Y be ? ToString(y).\n let y = args\n .get_or_undefined(1)\n .to_string(context)?\n .iter()\n .collect::>();\n\n // 7. Return CompareStrings(collator, X, Y).\n\n let result = collator.collator.as_borrowed().compare_utf16(&x, &y) as i32;\n\n Ok(result.into())\n },\n collator_obj,\n ),\n )\n .length(2)\n .build();\n\n collator.bound_compare = Some(bound_compare.clone());\n bound_compare\n };\n\n // 4. Return collator.[[BoundCompare]].\n Ok(bound_compare.into())\n }\n\n /// [`Intl.Collator.prototype.resolvedOptions ( )`][spec].\n ///\n /// Returns a new object with properties reflecting the locale and collation options computed\n /// during initialization of this `Intl.Collator` object.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sec-intl.collator.prototype.resolvedoptions\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Collator/resolvedOptions\n fn resolved_options(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let collator be the this value.\n // 2. Perform ? RequireInternalSlot(collator, [[InitializedCollator]]).\n let object = this.as_object();\n let collator = object\n .as_ref()\n .and_then(JsObject::downcast_ref::)\n .ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"`resolvedOptions` can only be called on a `Collator` object\")\n })?;\n\n // 3. Let options be OrdinaryObjectCreate(%Object.prototype%).\n let options = context\n .intrinsics()\n .templates()\n .ordinary_object()\n .create(OrdinaryObject, vec![]);\n\n // 4. For each row of Table 4, except the header row, in table order, do\n // a. Let p be the Property value of the current row.\n // b. Let v be the value of collator's internal slot whose name is the Internal Slot value of the current row.\n // c. If the current row has an Extension Key value, then\n // i. Let extensionKey be the Extension Key value of the current row.\n // ii. If %Collator%.[[RelevantExtensionKeys]] does not contain extensionKey, then\n // 1. Let v be undefined.\n // d. If v is not undefined, then\n // i. Perform ! CreateDataPropertyOrThrow(options, p, v).\n // 5. Return options.\n options\n .create_data_property_or_throw(\n js_string!(\"locale\"),\n js_string!(collator.locale.to_string()),\n context,\n )\n .js_expect(\"operation must not fail per the spec\")?;\n options\n .create_data_property_or_throw(\n js_string!(\"usage\"),\n match collator.usage {\n Usage::Search => js_string!(\"search\"),\n Usage::Sort => js_string!(\"sort\"),\n },\n context,\n )\n .js_expect(\"operation must not fail per the spec\")?;\n options\n .create_data_property_or_throw(\n js_string!(\"sensitivity\"),\n match collator.sensitivity {\n Sensitivity::Base => js_string!(\"base\"),\n Sensitivity::Accent => js_string!(\"accent\"),\n Sensitivity::Case => js_string!(\"case\"),\n Sensitivity::Variant => js_string!(\"variant\"),\n },\n context,\n )\n .js_expect(\"operation must not fail per the spec\")?;\n options\n .create_data_property_or_throw(\n js_string!(\"ignorePunctuation\"),\n collator.ignore_punctuation,\n context,\n )\n .js_expect(\"operation must not fail per the spec\")?;\n options\n .create_data_property_or_throw(\n js_string!(\"collation\"),\n collator\n .collation\n .map(|co| js_string!(co.as_str()))\n .unwrap_or(js_string!(\"default\")),\n context,\n )\n .js_expect(\"operation must not fail per the spec\")?;\n options\n .create_data_property_or_throw(js_string!(\"numeric\"), collator.numeric, context)\n .js_expect(\"operation must not fail per the spec\")?;\n if let Some(kf) = collator.case_first {\n options\n .create_data_property_or_throw(\n js_string!(\"caseFirst\"),\n js_string!(kf.as_str()),\n context,\n )\n .js_expect(\"operation must not fail per the spec\")?;\n }\n\n // 5. Return options.\n Ok(options.into())\n }\n}\n" }, { "path": "core/engine/src/builtins/intl/collator/options.rs", "content": "use std::str::FromStr;\n\nuse icu_collator::{\n CollatorPreferences,\n options::{CaseLevel, Strength},\n preferences::{CollationCaseFirst, CollationType},\n provider::CollationMetadataV1,\n};\nuse icu_locale::LanguageIdentifier;\nuse icu_provider::{\n DataMarkerAttributes,\n prelude::icu_locale_core::{extensions::unicode, preferences::LocalePreferences},\n};\n\nuse crate::{\n Context, JsNativeError, JsResult, JsValue,\n builtins::{\n intl::{ServicePreferences, locale::validate_extension},\n options::{OptionType, ParsableOptionType},\n },\n context::icu::IntlProvider,\n};\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum Sensitivity {\n Base,\n Accent,\n Case,\n Variant,\n}\n\nimpl Sensitivity {\n /// Converts the sensitivity option to the equivalent ICU4X collator options.\n pub(crate) const fn to_collator_options(self) -> (Strength, CaseLevel) {\n match self {\n Self::Base => (Strength::Primary, CaseLevel::Off),\n Self::Accent => (Strength::Secondary, CaseLevel::Off),\n Self::Case => (Strength::Primary, CaseLevel::On),\n Self::Variant => (Strength::Tertiary, CaseLevel::On),\n }\n }\n}\n\n#[derive(Debug)]\npub(crate) struct ParseSensitivityError;\n\nimpl std::fmt::Display for ParseSensitivityError {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n f.write_str(\"provided string was not `base`, `accent`, `case` or `variant`\")\n }\n}\n\nimpl FromStr for Sensitivity {\n type Err = ParseSensitivityError;\n\n fn from_str(s: &str) -> Result {\n match s {\n \"base\" => Ok(Self::Base),\n \"accent\" => Ok(Self::Accent),\n \"case\" => Ok(Self::Case),\n \"variant\" => Ok(Self::Variant),\n _ => Err(ParseSensitivityError),\n }\n }\n}\n\nimpl ParsableOptionType for Sensitivity {}\n\n#[derive(Debug, Clone, Copy, Default, PartialEq, Eq)]\npub(crate) enum Usage {\n #[default]\n Sort,\n Search,\n}\n\n#[derive(Debug)]\npub(crate) struct ParseUsageError;\n\nimpl std::fmt::Display for ParseUsageError {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n f.write_str(\"provided string was not `sort` or `search`\")\n }\n}\n\nimpl FromStr for Usage {\n type Err = ParseUsageError;\n\n fn from_str(s: &str) -> Result {\n match s {\n \"sort\" => Ok(Self::Sort),\n \"search\" => Ok(Self::Search),\n _ => Err(ParseUsageError),\n }\n }\n}\n\nimpl ParsableOptionType for Usage {}\n\nimpl OptionType for CollationCaseFirst {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_str() {\n \"upper\" => Ok(Self::Upper),\n \"lower\" => Ok(Self::Lower),\n \"false\" => Ok(Self::False),\n _ => Err(JsNativeError::range()\n .with_message(\"provided string was not `upper`, `lower` or `false`\")\n .into()),\n }\n }\n}\n\nimpl ServicePreferences for CollatorPreferences {\n fn validate(&mut self, id: &LanguageIdentifier, provider: &IntlProvider) {\n self.collation_type = self.collation_type.take().filter(|co| {\n let attr = DataMarkerAttributes::from_str_or_panic(co.as_str());\n co != &CollationType::Search\n && validate_extension::(id, attr, provider)\n });\n }\n\n impl_service_preferences!(collation_type, numeric_ordering, case_first);\n}\n" }, { "path": "core/engine/src/builtins/intl/date_time_format/mod.rs", "content": "//! This module implements the global `Intl.DateTimeFormat` object.\n//!\n//! `Intl.DateTimeFormat` is a built-in object that has properties and methods for date and time i18n.\n//!\n//! More information:\n//! - [ECMAScript reference][spec]\n//!\n//! [spec]: https://tc39.es/ecma402/#datetimeformat-objects\n\nuse crate::{\n Context, JsArgs, JsData, JsExpect, JsResult, JsString, JsValue, NativeFunction,\n builtins::{\n BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject,\n date::utils::{\n date_from_time, hour_from_time, min_from_time, month_from_time, ms_from_time,\n sec_from_time, time_clip, year_from_time,\n },\n intl::{\n Service,\n date_time_format::options::{DateStyle, FormatMatcher, FormatOptions, TimeStyle},\n locale::{canonicalize_locale_list, filter_locales, resolve_locale},\n options::{IntlOptions, coerce_options_to_object},\n },\n options::get_option,\n },\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n error::JsNativeError,\n js_error, js_string,\n object::{\n FunctionObjectBuilder, JsFunction, JsObject, ObjectInitializer,\n internal_methods::get_prototype_from_constructor,\n },\n property::{Attribute, PropertyDescriptor},\n realm::Realm,\n string::StaticJsStrings,\n};\n\nuse boa_gc::{Finalize, Trace};\nuse icu_calendar::{Iso, preferences::CalendarAlgorithm};\nuse icu_datetime::{\n DateTimeFormatter, DateTimeFormatterPreferences,\n fieldsets::{\n builder::{DateFields, FieldSetBuilder},\n enums::CompositeFieldSet,\n },\n input::{Date, DateTime, Time, TimeZone, UtcOffset},\n options::{Length, TimePrecision},\n preferences::HourCycle as IcuHourCycle,\n};\nuse icu_decimal::preferences::NumberingSystem;\nuse icu_decimal::provider::DecimalSymbolsV1;\nuse icu_locale::{Locale, extensions::unicode::Value};\nuse icu_time::{\n TimeZoneInfo, ZonedDateTime,\n zone::{IanaParser, models::Base},\n};\nuse timezone_provider::provider::TimeZoneId;\n\nmod options;\n\n#[cfg(all(test, feature = \"intl_bundled\"))]\nmod tests;\n\n#[derive(Debug, Clone)]\npub(crate) enum FormatTimeZone {\n UtcOffset(UtcOffset),\n Identifier((TimeZone, TimeZoneId)),\n}\n\nimpl FormatTimeZone {\n pub(crate) fn to_time_zone_info(&self) -> TimeZoneInfo {\n match self {\n Self::Identifier((tz, _)) => tz.without_offset(),\n Self::UtcOffset(utc_offset) => TimeZone::UNKNOWN.with_offset(Some(*utc_offset)),\n }\n }\n}\n\n/// JavaScript `Intl.DateTimeFormat` object.\n#[derive(Debug, Clone, Trace, Finalize, JsData)]\n#[boa_gc(unsafe_empty_trace)] // Safety: No traceable types\n#[allow(dead_code)]\npub(crate) struct DateTimeFormat {\n locale: Locale,\n calendar_algorithm: Option, // TODO: Potentially remove ?\n numbering_system: Option,\n hour_cycle: Option,\n date_style: Option,\n time_style: Option,\n time_zone: FormatTimeZone,\n fieldset: CompositeFieldSet,\n formatter: DateTimeFormatter,\n bound_format: Option,\n resolved_options: Option,\n}\n\nimpl Service for DateTimeFormat {\n type LangMarker = DecimalSymbolsV1;\n\n type Preferences = DateTimeFormatterPreferences;\n}\n\nimpl IntrinsicObject for DateTimeFormat {\n fn init(realm: &Realm) {\n use crate::JsSymbol;\n let get_format = BuiltInBuilder::callable(realm, Self::get_format)\n .name(js_string!(\"get format\"))\n .build();\n\n BuiltInBuilder::from_standard_constructor::(realm)\n .static_method(\n Self::supported_locales_of,\n js_string!(\"supportedLocalesOf\"),\n 1,\n )\n .accessor(\n js_string!(\"format\"),\n Some(get_format),\n None,\n Attribute::CONFIGURABLE,\n )\n .method(Self::resolved_options, js_string!(\"resolvedOptions\"), 0)\n .property(\n JsSymbol::to_string_tag(),\n js_string!(\"Intl.DateTimeFormat\"),\n Attribute::READONLY | Attribute::NON_ENUMERABLE | Attribute::CONFIGURABLE,\n )\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for DateTimeFormat {\n const NAME: JsString = StaticJsStrings::DATE_TIME_FORMAT;\n}\n\nimpl BuiltInConstructor for DateTimeFormat {\n const CONSTRUCTOR_ARGUMENTS: usize = 0;\n const PROTOTYPE_STORAGE_SLOTS: usize = 4;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 1;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::date_time_format;\n /// The `Intl.DateTimeFormat` constructor is the `%DateTimeFormat%` intrinsic object and a standard built-in property of the `Intl` object.\n ///\n /// More information:\n /// - [ECMAScript reference][spec]\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#datetimeformat-objects\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DateTimeFormat\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // NOTE (nekevss): separate calls to `CreateDateTimeFormat` to avoid clone.\n // 1. If NewTarget is undefined, let newTarget be the active function object, else let newTarget be NewTarget.\n let new_target_inner = &if new_target.is_undefined() {\n context\n .active_function_object()\n .unwrap_or_else(|| {\n context\n .intrinsics()\n .constructors()\n .date_time_format()\n .constructor()\n })\n .into()\n } else {\n new_target.clone()\n };\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n\n // 2. Let dateTimeFormat be ? CreateDateTimeFormat(newTarget, locales, options, any, date).\n let dtf = create_date_time_format(\n locales,\n options,\n FormatType::Any,\n FormatDefaults::Date,\n context,\n )?;\n let prototype = get_prototype_from_constructor(\n new_target_inner,\n StandardConstructors::date_time_format,\n context,\n )?;\n let date_time_format = JsObject::from_proto_and_data(prototype, dtf);\n\n // 3. If the implementation supports the normative optional constructor mode of 4.3 Note 1, then\n // a. Let this be the this value.\n // b. Return ? ChainDateTimeFormat(dateTimeFormat, NewTarget, this).\n // ChainDateTimeFormat ( dateTimeFormat, newTarget, this )\n // \n\n let this = context.vm.stack.get_this(context.vm.frame());\n let Some(this_obj) = this.as_object() else {\n return Ok(date_time_format.into());\n };\n\n let constructor = context\n .intrinsics()\n .constructors()\n .date_time_format()\n .constructor();\n\n // 1. If newTarget is undefined and ? OrdinaryHasInstance(%Intl.DateTimeFormat%, this) is true, then\n if new_target.is_undefined()\n && JsValue::ordinary_has_instance(&constructor.into(), &this, context)?\n {\n let fallback_symbol = context\n .intrinsics()\n .objects()\n .intl()\n .borrow()\n .data()\n .fallback_symbol();\n\n // a. Perform ? DefinePropertyOrThrow(this, %Intl%.[[FallbackSymbol]],\n // PropertyDescriptor{ [[Value]]: dateTimeFormat, [[Writable]]: false,\n // [[Enumerable]]: false, [[Configurable]]: false }).\n this_obj.define_property_or_throw(\n fallback_symbol,\n PropertyDescriptor::builder()\n .value(date_time_format)\n .writable(false)\n .enumerable(false)\n .configurable(false),\n context,\n )?;\n // b. Return this.\n Ok(this)\n } else {\n // 4. Return dateTimeFormat.\n Ok(date_time_format.into())\n }\n }\n}\n\nimpl DateTimeFormat {\n fn get_format(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n // 1. Let dtf be the this value.\n // 2. If the implementation supports the normative optional constructor mode of 4.3 Note 1, then\n // a. Set dtf to ? UnwrapDateTimeFormat(dtf).\n // 3. Perform ? RequireInternalSlot(dtf, [[InitializedDateTimeFormat]]).\n let dtf_object = unwrap_date_time_format(this, context)?;\n let dtf_clone = dtf_object.clone();\n let mut dtf = dtf_object.borrow_mut();\n\n // 4. If dtf.[[BoundFormat]] is undefined, then\n // 5. Return dtf.[[BoundFormat]].\n if let Some(bound_format) = &dtf.data_mut().bound_format.clone() {\n Ok(bound_format.clone().into())\n } else {\n // a. Let F be a new built-in function object as defined in DateTime Format Functions (11.5.4).\n let bound_format = FunctionObjectBuilder::new(\n context.realm(),\n NativeFunction::from_copy_closure_with_captures(\n |_, args, dtf, context| {\n // 1. Let dtf be F.[[DateTimeFormat]].\n // 2. Assert: dtf is an Object and dtf has an [[InitializedDateTimeFormat]] internal slot.\n let date = args.get_or_undefined(0);\n // 3. If date is not provided or is undefined, then\n let x = if date.is_undefined() {\n // NOTE (nekevss) i64 should be sufficient for a millisecond\n // representation.\n // a. Let x be ! Call(%Date.now%, undefined).\n context.clock().system_time_millis() as f64\n // 4. Else,\n } else {\n // NOTE (nekevss) The i64 covers all MAX_SAFE_INTEGER values.\n // a. Let x be ? ToNumber(date).\n date.to_number(context)?\n };\n\n // 5. Return ? FormatDateTime(dtf, x).\n // A.O 11.5.6 PartitionDateTimePattern: 1. TimeClip(x). 2. If NaN throw. Then ToLocalTime and format.\n let x = time_clip(x);\n if x.is_nan() {\n return Err(js_error!(RangeError: \"formatted date cannot be NaN\"));\n }\n let result = format_timestamp_with_dtf(dtf.borrow().data(), x, context)?;\n Ok(JsValue::from(result))\n },\n dtf_clone,\n ),\n )\n .length(1)\n .build();\n\n // b. Set F.[[DateTimeFormat]] to dtf.\n // c. Set dtf.[[BoundFormat]] to F.\n dtf.data_mut().bound_format = Some(bound_format.clone());\n Ok(bound_format.into())\n }\n }\n\n /// [`Intl.DateTimeFormat.supportedLocalesOf ( locales [ , options ] )`][spec]\n ///\n /// Returns an array containing those of the provided locales that are\n /// supported in date and time formatting without having to fall back to\n /// the runtime's default locale.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sec-intl.datetimeformat.supportedlocalesof\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DateTimeFormat/supportedLocalesOf\n fn supported_locales_of(\n _: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n\n // 1. Let availableLocales be %DateTimeFormat%.[[AvailableLocales]].\n // 2. Let requestedLocales be ? CanonicalizeLocaleList(locales).\n let requested_locales = canonicalize_locale_list(locales, context)?;\n\n // 3. Return ? FilterLocales(availableLocales, requestedLocales, options).\n filter_locales::(requested_locales, options, context).map(JsValue::from)\n }\n\n /// [`Intl.DateTimeFormat.prototype.resolvedOptions ( )`][spec]\n ///\n /// [spec]: https://tc39.es/ecma402/#sec-intl.datetimeformat.prototype.resolvedoptions\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DateTimeFormat/resolvedOptions\n fn resolved_options(this: &JsValue, _: &[JsValue], context: &mut Context) -> JsResult {\n //This function provides access to the locale and options computed during initialization of the object.\n\n // 1. Let dtf be the this value.\n // 2. If the implementation supports the normative optional constructor mode of 4.3 Note 1, then\n // a. Set dtf to ? UnwrapDateTimeFormat(dtf).\n // 3. Perform ? RequireInternalSlot(dtf, [[InitializedDateTimeFormat]]).\n let dtf_object = unwrap_date_time_format(this, context)?;\n if let Some(cached) = dtf_object.borrow().data().resolved_options.clone() {\n return Ok(cached.into());\n }\n\n // 4. Let options be OrdinaryObjectCreate(%Object.prototype%).\n // 5. For each row of Table 15, except the header row, in table order, do\n // a. Let p be the Property value of the current row.\n // b. If there is an Internal Slot value in the current row, then\n // i. Let v be the value of dtf's internal slot whose name is the Internal Slot value of the current row.\n // c. Else,\n // i. Let format be dtf.[[DateTimeFormat]].\n // ii. If format has a field [[

]] and dtf.[[DateStyle]] is undefined and dtf.[[TimeStyle]] is undefined, then\n // 1. Let v be format.[[

]].\n // iii. Else,\n // 1. Let v be undefined.\n // d. If v is not undefined, then\n // i. If there is a Conversion value in the current row, then\n // 1. Let conversion be the Conversion value of the current row.\n // 2. If conversion is hour12, then\n // a. If v is \"h11\" or \"h12\", set v to true. Otherwise, set v to false.\n // 3. Else,\n // a. Assert: conversion is number.\n // b. Set v to 𝔽(v).\n // ii. Perform ! CreateDataPropertyOrThrow(options, p, v).\n let result = {\n let dtf = dtf_object.borrow();\n let dtf = dtf.data();\n\n let mut options = ObjectInitializer::new(context);\n options.property(\n js_string!(\"locale\"),\n js_string!(dtf.locale.to_string()),\n Attribute::all(),\n );\n\n if let Some(ca) = &dtf.calendar_algorithm {\n options.property(\n js_string!(\"calendar\"),\n js_string!(ca.as_str()),\n Attribute::all(),\n );\n }\n\n if let Some(nu) = &dtf.numbering_system {\n options.property(\n js_string!(\"numberingSystem\"),\n js_string!(nu.as_str()),\n Attribute::all(),\n );\n }\n\n let time_zone_str = match &dtf.time_zone {\n FormatTimeZone::UtcOffset(offset) => {\n let seconds = offset.to_seconds();\n let hours = seconds / 3600;\n let minutes = (seconds.abs() % 3600) / 60;\n format!(\"{hours:+03}:{minutes:02}\")\n }\n FormatTimeZone::Identifier((tz, _id)) => tz.to_string(),\n };\n options.property(\n js_string!(\"timeZone\"),\n js_string!(time_zone_str),\n Attribute::all(),\n );\n\n if let Some(hc) = &dtf.hour_cycle {\n options.property(\n js_string!(\"hourCycle\"),\n js_string!(hc.as_str()),\n Attribute::all(),\n );\n //h11/h12 -> true, h23/h24 -> false , because its h12 conversion time\n let hour12 = matches!(hc, IcuHourCycle::H11 | IcuHourCycle::H12);\n options.property(js_string!(\"hour12\"), hour12, Attribute::all());\n }\n\n if let Some(ds) = dtf.date_style {\n let ds_str = match ds {\n DateStyle::Full => \"full\",\n DateStyle::Long => \"long\",\n DateStyle::Medium => \"medium\",\n DateStyle::Short => \"short\",\n };\n options.property(\n js_string!(\"dateStyle\"),\n js_string!(ds_str),\n Attribute::all(),\n );\n }\n\n if let Some(ts) = dtf.time_style {\n let ts_str = match ts {\n TimeStyle::Full => \"full\",\n TimeStyle::Long => \"long\",\n TimeStyle::Medium => \"medium\",\n TimeStyle::Short => \"short\",\n };\n options.property(\n js_string!(\"timeStyle\"),\n js_string!(ts_str),\n Attribute::all(),\n );\n }\n\n options.build()\n };\n\n // 6. Return options.\n dtf_object.borrow_mut().data_mut().resolved_options = Some(result.clone());\n Ok(result.into())\n }\n}\n\n// Represents a ISO8601 ToLocalTime Record\n//\n// https://tc39.es/ecma402/#sec-datetimeformat-tolocaltime-records\nstruct ToLocalTime {\n year: i32,\n month: u8,\n day: u8,\n hour: u8,\n minute: u8,\n second: u8,\n subsecond: u32,\n}\n\nimpl ToLocalTime {\n // NOTE (nekevss): we may need to adjust the below steps.\n //\n // The core problem is how to adopt the spec steps while also\n // acting as a proper intermediate between built-ins and ICU4X.\n /// The below steps are adapted from 11.5.6 and 11.5.12\n pub(crate) fn from_local_epoch_milliseconds(local_millis: f64) -> JsResult {\n // 11.5.6, 1. Let x be TimeClip(x).\n let x = time_clip(local_millis);\n // 11.5.6, 2. If x is NaN, throw a RangeError exception.\n if x.is_nan() {\n return Err(js_error!(RangeError: \"formattable time value cannot be NaN\"));\n }\n // NOTE: The switch to BigInt just for the value to be reverted to float\n // during ToLocalTime calculations\n // 11.5.6, 3. Let epochNanoseconds be ℤ(ℝ(x) × 10**6).\n let epoch_nanoseconds = (x * 1_000_000f64) as i128;\n\n // We convert back to milliseconds: 𝔽(floor(tz / 10**6))\n let t = epoch_nanoseconds.div_euclid(1_000_000) as f64;\n\n // 11.5.5, Step 12. Return ToLocalTime record values\n // Also see, 11.5.12\n let year = year_from_time(t);\n let month = month_from_time(t);\n let day = date_from_time(t);\n let hour = hour_from_time(t);\n let minute = min_from_time(t);\n let second = sec_from_time(t);\n let ms = u32::from(ms_from_time(t));\n\n // 11.5.5, Step 15.f.v. If p is \"month\", set v to v + 1.\n let month = month + 1; // This month is zero based (0-11)\n\n Ok(Self {\n year,\n month,\n day,\n hour,\n minute,\n second,\n subsecond: ms * 1_000_000,\n })\n }\n\n pub(crate) fn to_formattable_datetime(&self) -> JsResult> {\n Ok(DateTime {\n date: Date::try_new_iso(self.year, self.month, self.day)\n .ok()\n .js_expect(\"TimeClip ensures valid range.\")?,\n time: Time::try_new(self.hour, self.minute, self.second, self.subsecond)\n .ok()\n .js_expect(\"valid values\")?,\n })\n }\n}\n\n// ==== Abstract Operations ====\n\n/// Creates a [`DateTimeFormat`] struct (internal slots only). The constructor wraps this in a\n/// `JsObject` with the correct prototype; Date.prototype.toLocaleString (and friends) use it\n/// directly with [`format_timestamp_with_dtf`] without allocating a JS object.\npub(crate) fn create_date_time_format(\n locales: &JsValue,\n options: &JsValue,\n date_time_format_type: FormatType,\n defaults: FormatDefaults,\n context: &mut Context,\n) -> JsResult {\n // 2. Let hour12 be undefined. <- TODO\n // 3. Let modifyResolutionOptions be a new Abstract Closure with parameters (options) that captures hour12 and performs the following steps when called:\n // a. Set hour12 to options.[[hour12]].\n // b. Remove field [[hour12]] from options.\n // c. If hour12 is not undefined, set options.[[hc]] to null.\n // 4. Let optionsResolution be ? ResolveOptions(%Intl.DateTimeFormat%, %Intl.DateTimeFormat%.[[LocaleData]],\n // locales, options, « coerce-options », modifyResolutionOptions).\n //\n // NOTE: We inline ResolveOptions here. (Could be worked into an abstract operation util function)\n // ResolveOptions 1. Let requestedLocales be ? CanonicalizeLocaleList(locales).\n let requested_locales = canonicalize_locale_list(locales, context)?;\n // NOTE: skip ResolveOptions 2, which is based on `REQUIRE-OPTIONS` vs `COERCE-OPTIONS`\n // ResolveOptions 3. If specialBehaviours is present and contains coerce-options,\n // set options to ? CoerceOptionsToObject(options). Otherwise, set options to ? GetOptionsObject(options).\n let options = coerce_options_to_object(options, context)?;\n // ResolveOptions 4. Let matcher be ? GetOption(options, \"localeMatcher\", string, « \"lookup\", \"best fit\" », \"best fit\").\n let matcher = get_option(&options, js_string!(\"localeMatcher\"), context)?.unwrap_or_default();\n\n // NOTE: We unroll the below const loop in step 6 using the\n // ResolutionOptionDescriptors from the internal slots\n // https://tc39.es/ecma402/#sec-intl.datetimeformat-internal-slots\n let mut preferences = DateTimeFormatterPreferences::default();\n\n // 6. For each Resolution Option Descriptor desc of constructor.[[ResolutionOptionDescriptors]], do\n // a. If desc has a [[Type]] field, let type be desc.[[Type]]. Otherwise, let type be string.\n // b. If desc has a [[Values]] field, let values be desc.[[Values]]. Otherwise, let values be empty.\n // c. Let value be ? GetOption(options, desc.[[Property]], type, values, undefined).\n // d. If value is not undefined, then\n // i. Set value to ! ToString(value).\n // ii. If value cannot be matched by the type Unicode locale nonterminal, throw a RangeError exception.\n // e. Let key be desc.[[Key]].\n // f. Set opt.[[]] to value.\n\n // Handle { [[Key]]: \"ca\", [[Property]]: \"calendar\" }\n preferences.calendar_algorithm =\n get_option::(&options, js_string!(\"calendar\"), context)?\n .map(|ca| CalendarAlgorithm::try_from(&ca))\n .transpose()\n .map_err(|_icu4x_error| js_error!(RangeError: \"unknown calendar algorithm\"))?;\n\n // { [[Key]]: \"nu\", [[Property]]: \"numberingSystem\" }\n preferences.numbering_system =\n get_option::(&options, js_string!(\"numberingSystem\"), context)?\n .map(NumberingSystem::try_from)\n .transpose()\n .map_err(|_icu4x_error| js_error!(RangeError: \"unknown numbering system\"))?;\n\n // { [[Key]]: \"hour12\", [[Property]]: \"hour12\", [[Type]]: boolean }\n let hour_12 = get_option::(&options, js_string!(\"hour12\"), context)?;\n\n // { [[Key]]: \"hc\", [[Property]]: \"hourCycle\", [[Values]]: « \"h11\", \"h12\", \"h23\", \"h24\" » }\n preferences.hour_cycle =\n get_option::(&options, js_string!(\"hourCycle\"), context)?\n .map(|hc| {\n // Handle steps 3.a-c here\n // c. If hour12 is not undefined, set options.[[hc]] to null.\n if hour_12.is_some() {\n Ok(None)\n } else {\n IcuHourCycle::try_from(hc).map(Some)\n }\n })\n .transpose()\n .map_err(|_icu4x_error| js_error!(RangeError: \"unknown hour cycle\"))?\n .flatten();\n\n let mut intl_options = IntlOptions {\n matcher,\n preferences,\n };\n\n // ResolveOptions 8. Let resolution be ResolveLocale(constructor.[[AvailableLocales]], requestedLocales,\n // opt, constructor.[[RelevantExtensionKeys]], localeData).\n let resolved_locale = resolve_locale::(\n requested_locales,\n &mut intl_options,\n context.intl_provider(),\n )?;\n\n // TODO: The resolved calendar, numbering system, and hour cycle should come from\n // the ICU4X locale resolution result, not hardcoded defaults. However, ICU4X does\n // not yet expose getters for these computed values on DateTimeFormatter.\n // This means e.g. `new Intl.DateTimeFormat(\"ar\").resolvedOptions().numberingSystem`\n // incorrectly returns \"latn\" instead of \"arab\".\n // Tracked at: unicode-org/icu4x#5868\n if intl_options.preferences.calendar_algorithm.is_none() {\n intl_options.preferences.calendar_algorithm = CalendarAlgorithm::try_from(\n &Value::try_from_str(\"gregory\").expect(\"'gregory' is a valid BCP 47 value\"),\n )\n .ok();\n }\n\n if intl_options.preferences.numbering_system.is_none() {\n intl_options.preferences.numbering_system = NumberingSystem::try_from(\n Value::try_from_str(\"latn\").expect(\"'latn' is a valid BCP 47 value\"),\n )\n .ok();\n }\n\n if intl_options.preferences.hour_cycle.is_none() {\n intl_options.preferences.hour_cycle = IcuHourCycle::try_from(\n &Value::try_from_str(\"h12\").expect(\"'h12' is a valid BCP 47 value\"),\n )\n .ok();\n }\n // 5. Set options to optionsResolution.[[Options]].\n // 6. Let r be optionsResolution.[[ResolvedLocale]].\n // 7. Set (deferred) dateTimeFormat.[[Locale]] to r.[[Locale]].\n // 8. Let (deferred) resolvedCalendar be r.[[ca]].\n // 9. Set (deferred) dateTimeFormat.[[Calendar]] to resolvedCalendar.\n // 10. Set (deferred) dateTimeFormat.[[NumberingSystem]] to r.[[nu]].\n // 11. Let (deferred) resolvedLocaleData be r.[[LocaleData]].\n\n // TODO: Handle hour12 and hc\n // 12. If hour12 is true, then\n // a. Let hc be resolvedLocaleData.[[hourCycle12]].\n // 13. Else if hour12 is false, then\n // a. Let hc be resolvedLocaleData.[[hourCycle24]].\n // 14. Else,\n // a. Assert: hour12 is undefined.\n // b. Let hc be r.[[hc]].\n // c. If hc is null, set hc to resolvedLocaleData.[[hourCycle]].\n\n // 15. Let timeZone be ? Get(options, \"timeZone\").\n let time_zone = options.get(js_string!(\"timeZone\"), context)?;\n\n // 16. If timeZone is undefined, then\n let time_zone = if time_zone.is_undefined() {\n // TODO (nekevss): Resolve system time zone\n // a. Set timeZone to SystemTimeZoneIdentifier().\n JsString::from(\"Etc/UTC\")\n // 17. Else,\n } else {\n // a. Set timeZone to ? ToString(timeZone).\n time_zone.to_string(context)?\n };\n // 18. If IsTimeZoneOffsetString(timeZone) is true, then\n let time_zone_string = time_zone.to_std_string_escaped();\n // Note: Should a timezone enum be part of temporal_rs, icu_time, or an ECMA402 wrapper lib\n let time_zone = if let Ok(utc_offset) = UtcOffset::try_from_str(&time_zone_string) {\n // a. Let parseResult be ParseText(StringToCodePoints(timeZone), UTCOffset).\n // b. Assert: parseResult is a Parse Node.\n // c. If parseResult contains more than one MinuteSecond Parse Node, throw a RangeError exception.\n // d. Let offsetNanoseconds be ParseTimeZoneOffsetString(timeZone).\n // e. Let offsetMinutes be offsetNanoseconds / (6 × 10**10).\n // f. Assert: offsetMinutes is an integer.\n // g. Set timeZone to FormatOffsetTimeZoneIdentifier(offsetMinutes).\n FormatTimeZone::UtcOffset(utc_offset)\n } else {\n // 19. Else,\n // a. Let timeZoneIdentifierRecord be GetAvailableNamedTimeZoneIdentifier(timeZone).\n // b. If timeZoneIdentifierRecord is empty, throw a RangeError exception.\n // c. Set timeZone to timeZoneIdentifierRecord.[[PrimaryIdentifier]].\n let parser =\n IanaParser::try_new_with_buffer_provider(context.intl_provider().erased_provider())\n .map_err(|_| {\n JsNativeError::error().with_message(\"Failed to init time zone data provider\")\n })?;\n let time_zone = parser.as_borrowed().parse(&time_zone_string);\n let time_zone_id = context\n .timezone_provider()\n .get(time_zone_string.as_bytes())\n .map_err(|_| {\n JsNativeError::range()\n .with_message(format!(\"{time_zone_string:#?} was not a valid time zone.\"))\n })?;\n FormatTimeZone::Identifier((time_zone, time_zone_id))\n };\n // 20. (deferred) Set dateTimeFormat.[[TimeZone]] to timeZone.\n\n // 21. Let formatOptions be a new Record.\n // 22. Set formatOptions.[[hourCycle]] to hc.\n // 23. Let hasExplicitFormatComponents be false.\n\n // NOTE (nekevss): Step 24 is adopted in the `FormatOptions`\n // 24. For each row of Table 16, except the header row, in table order, do\n // a. Let prop be the name given in the Property column of the current row.\n // b. If prop is \"fractionalSecondDigits\", then\n // i. Let value be ? GetNumberOption(options, \"fractionalSecondDigits\", 1, 3, undefined).\n // c. Else,\n // i. Let values be a List whose elements are the strings given in the Values column of the current row.\n // ii. Let value be ? GetOption(options, prop, string, values, undefined).\n // d. Set formatOptions.[[]] to value.\n // e. If value is not undefined, then\n // i. Set hasExplicitFormatComponents to true.\n let mut format_options = FormatOptions::try_init(&options, preferences.hour_cycle, context)?;\n\n // TODO: how should formatMatcher be used?\n // 25. Let formatMatcher be ? GetOption(options, \"formatMatcher\", string, « \"basic\", \"best fit\" », \"best fit\").\n let format_matcher =\n get_option::(&options, js_string!(\"formatMatcher\"), context)?\n .unwrap_or(FormatMatcher::BestFit);\n // 26. Let dateStyle be ? GetOption(options, \"dateStyle\", string, « \"full\", \"long\", \"medium\", \"short\" », undefined).\n let date_style = get_option::(&options, js_string!(\"dateStyle\"), context)?;\n // 27. Set dateTimeFormat.[[DateStyle]] to dateStyle.\n // 28. Let timeStyle be ? GetOption(options, \"timeStyle\", string, « \"full\", \"long\", \"medium\", \"short\" », undefined).\n let time_style = get_option::(&options, js_string!(\"timeStyle\"), context)?;\n // 29. (deferred) Set dateTimeFormat.[[TimeStyle]] to timeStyle.\n // 30. If dateStyle is not undefined or timeStyle is not undefined, then\n let fieldset = if date_style.is_some() || time_style.is_some() {\n // a. If hasExplicitFormatComponents is true, then\n if format_options.has_explicit_format_components() {\n // i. Throw a TypeError exception.\n return Err(\n js_error!(TypeError: \"cannot have explicit format components when timeStyle or dateStyle is defined\"),\n );\n }\n // b. If required is date and timeStyle is not undefined, then\n if date_time_format_type == FormatType::Date && time_style.is_some() {\n // i. Throw a TypeError exception.\n return Err(\n js_error!(TypeError: \"timeStyle cannot be defined for a date DateTimeFormat\"),\n );\n }\n // c. If required is time and dateStyle is not undefined, then\n if date_time_format_type == FormatType::Time && date_style.is_some() {\n // i. Throw a TypeError exception.\n return Err(\n js_error!(TypeError: \"dateStyle cannot be defined for a time DateTimeFormat\"),\n );\n }\n // TODO (nekevss): implement d-e\n // TODO (nekevss): Do we have access to the styles?\n // d. Let styles be resolvedLocaleData.[[styles]].[[]].\n // e. Let bestFormat be DateTimeStyleFormat(dateStyle, timeStyle, styles).\n date_time_style_format(date_style, time_style)?\n // 31. Else,\n } else {\n // a. Let needDefaults be true.\n // b. If required is date or any, then\n // i. For each property name prop of « \"weekday\", \"year\", \"month\", \"day\" », do\n // 1. Let value be formatOptions.[[]].\n // 2. If value is not undefined, set needDefaults to false.\n // c. If required is time or any, then\n // i. For each property name prop of « \"dayPeriod\", \"hour\", \"minute\", \"second\", \"fractionalSecondDigits\" », do\n // 1. Let value be formatOptions.[[]].\n // 2. If value is not undefined, set needDefaults to false.\n let needs_defaults = format_options.check_dtf_type(date_time_format_type);\n // d. If needDefaults is true and defaults is either date or all, then\n if needs_defaults && defaults != FormatDefaults::Time {\n // i. For each property name prop of « \"year\", \"month\", \"day\" », do\n // 1. Set formatOptions.[[]] to \"numeric\".\n format_options.set_date_defaults();\n }\n // e. If needDefaults is true and defaults is either time or all, then\n if needs_defaults && defaults != FormatDefaults::Date {\n // i. For each property name prop of « \"hour\", \"minute\", \"second\" », do\n // 1. Set formatOptions.[[]] to \"numeric\".\n format_options.set_time_defaults();\n }\n // TODO (nekevss): Do we have access to the localized formats via `icu_datetime`. Is there\n // a specific API by which this is accessed.\n //\n // f. Let formats be resolvedLocaleData.[[formats]].[[]].\n // g. If formatMatcher is \"basic\", then\n // i. Let bestFormat be BasicFormatMatcher(formatOptions, formats).\n // h. Else,\n // i. Let bestFormat be BestFitFormatMatcher(formatOptions, formats).\n match format_matcher {\n FormatMatcher::Basic | FormatMatcher::BestFit => {\n best_fit_date_time_format(&format_options)?\n }\n }\n };\n // 32. Set dateTimeFormat.[[DateTimeFormat]] to bestFormat.\n // 33. If bestFormat has a field [[hour]], then\n // a. Set dateTimeFormat.[[HourCycle]] to hc.\n // 34. Return dateTimeFormat.\n let formatter = DateTimeFormatter::try_new_with_buffer_provider(\n context.intl_provider().erased_provider(),\n resolved_locale.clone().into(),\n fieldset,\n )\n .map_err(|e| JsNativeError::range().with_message(format!(\"failed to load formatter: {e}\")))?;\n\n Ok(DateTimeFormat {\n locale: resolved_locale,\n calendar_algorithm: intl_options.preferences.calendar_algorithm,\n numbering_system: intl_options.preferences.numbering_system,\n hour_cycle: intl_options.preferences.hour_cycle,\n date_style,\n time_style,\n time_zone,\n fieldset,\n formatter,\n bound_format: None,\n resolved_options: None,\n })\n}\n\n/// Formats a timestamp (epoch milliseconds) using the given [`DateTimeFormat`] internals.\n///\n/// This is the shared implementation used by:\n/// - the bound `format` function created in `get_format`, and\n/// - [`format_date_time_locale`] used by `Date.prototype.toLocaleString` (and friends).\n///\n/// It corresponds to the *post*-`TimeClip` portion of\n/// [`FormatDateTime(dtf, x)`](https://tc39.es/ecma402/#sec-formatdatetime),\n/// and the `ToLocalTime` / `PartitionDateTimePattern` logic from\n/// [11.5.6](https://tc39.es/ecma402/#sec-partitiondatetimepattern) and\n/// [11.5.12](https://tc39.es/ecma402/#sec-tolocaltime).\n///\n/// Callers must have already applied `TimeClip` and `NaN` check\n/// (`FormatDateTime` steps 1–2). This helper implements:\n///\n/// 11.5.6 `PartitionDateTimePattern` ( dtf, x )\n/// 1. Let x be TimeClip(x). (Done by caller)\n/// 2. If x is `NaN`, throw a `RangeError` exception. (Done by caller)\n/// 3. Let epochNanoseconds be ℤ(ℝ(x) × 10^6).\n/// 4. Let timeZone be dtf.[[`TimeZone`]].\n/// 5. Let offsetNs be GetOffsetNanosecondsFor(timeZone, epochNanoseconds).\n/// 6. Let tz be 𝔽(ℝ(x) + ℝ(offsetNs) / 10^6).\n///\n/// Then calls `ToLocalTime::from_local_epoch_milliseconds` to obtain calendar fields,\n/// and formats the resulting `ZonedDateTime` with ICU4X.\nfn format_timestamp_with_dtf(\n dtf: &DateTimeFormat,\n timestamp: f64,\n context: &mut Context,\n) -> JsResult {\n // PartitionDateTimePattern ( dtf, x ) step 3:\n // Let epochNanoseconds be ℤ(ℝ(x) × 10^6).\n //\n // NOTE: `timestamp` is already `TimeClip`'d by the caller and represents *UTC epoch milliseconds*.\n let epoch_ns = timestamp as i128 * 1_000_000;\n\n // PartitionDateTimePattern ( dtf, x ) step 4:\n // Let timeZone be dtf.[[`TimeZone`]].\n let time_zone = &dtf.time_zone;\n\n // PartitionDateTimePattern ( dtf, x ) step 5:\n // Let offsetNs be GetOffsetNanosecondsFor(timeZone, epochNanoseconds).\n //\n // NOTE: the spec describes the offset in *nanoseconds*. Internally, we obtain/normalize it to\n // seconds (and then milliseconds) for use with `ToLocalTime::from_local_epoch_milliseconds`.\n let time_zone_offset_seconds = match time_zone {\n FormatTimeZone::UtcOffset(offset) => offset.to_seconds(),\n FormatTimeZone::Identifier((_, time_zone_id)) => {\n let offset_seconds = context\n .timezone_provider()\n .transition_nanoseconds_for_utc_epoch_nanoseconds(*time_zone_id, epoch_ns)\n .map_err(\n |_e| js_error!(RangeError: \"unable to determine transition nanoseconds\"),\n )?;\n offset_seconds.0 as i32\n }\n };\n\n // PartitionDateTimePattern ( dtf, x ) step 6:\n // Let tz be 𝔽(ℝ(x) + ℝ(offsetNs) / 10^6).\n let tz = timestamp + f64::from(time_zone_offset_seconds * 1_000);\n let fields = ToLocalTime::from_local_epoch_milliseconds(tz)?;\n let dt = fields.to_formattable_datetime()?;\n let tz_info = time_zone.to_time_zone_info();\n let tz_info_at_time = tz_info.at_date_time_iso(dt);\n let zdt = ZonedDateTime {\n date: dt.date,\n time: dt.time,\n zone: tz_info_at_time,\n };\n let result = dtf.formatter.format(&zdt).to_string();\n Ok(JsString::from(result))\n}\n\nfn date_time_style_format(\n date_style: Option,\n time_style: Option,\n) -> JsResult {\n let mut builder = FieldSetBuilder::default();\n builder.length = match date_style {\n Some(DateStyle::Full | DateStyle::Long) => Some(Length::Long),\n Some(DateStyle::Medium) => Some(Length::Medium),\n Some(DateStyle::Short) => Some(Length::Short),\n None => match time_style {\n Some(TimeStyle::Full | TimeStyle::Long) => Some(Length::Long),\n Some(TimeStyle::Medium) => Some(Length::Medium),\n Some(TimeStyle::Short) => Some(Length::Short),\n None => return Err(js_error!(TypeError: \"dateStyle or timeStyle must be defined\")),\n },\n };\n builder.date_fields = match date_style {\n Some(DateStyle::Full) => Some(DateFields::YMDE),\n Some(DateStyle::Long | DateStyle::Medium | DateStyle::Short) => Some(DateFields::YMD),\n None => None, // NOTE: timeStyle being undefined is checked when setting length\n };\n builder.time_precision = match time_style {\n Some(TimeStyle::Full | TimeStyle::Long | TimeStyle::Medium) => Some(TimePrecision::Second),\n Some(TimeStyle::Short) => Some(TimePrecision::Minute),\n None => None, // NOTE: dateStyle being undefined is checked when setting length\n };\n builder\n .build_composite()\n .map_err(|e| JsNativeError::range().with_message(e.to_string()).into())\n}\n\nfn best_fit_date_time_format(format_options: &FormatOptions) -> JsResult {\n let mut builder = FieldSetBuilder::default();\n builder.length = format_options.to_length();\n builder.date_fields = format_options.to_date_fields();\n builder.time_precision = format_options.to_time_fields();\n builder.zone_style = format_options.to_zone_style();\n builder\n .build_composite()\n .map_err(|e| JsNativeError::range().with_message(e.to_string()).into())\n}\n\n/// Represents the `required` and `defaults` arguments in the abstract operation\n/// `toDateTimeOptions`.\n#[derive(Debug, Clone, Copy, PartialEq)]\npub(crate) enum FormatType {\n Date,\n Time,\n Any,\n}\n\n/// Indicates which default fields should be applied when `ToDateTimeOptions`\n/// determines defaults are needed. `All` applies both date and time defaults.\n#[derive(Debug, Clone, Copy, PartialEq)]\npub(crate) enum FormatDefaults {\n Date,\n Time,\n /// Apply both date and time defaults (e.g. for `toLocaleString`).\n All,\n}\n\n/// Abstract operation [`UnwrapDateTimeFormat ( dtf )`][spec].\n///\n/// This also checks that the returned object is a `DateTimeFormat`, which skips the\n/// call to `RequireInternalSlot`.\n///\n/// [spec]: https://tc39.es/ecma402/#sec-unwrapdatetimeformat\nfn unwrap_date_time_format(\n dtf: &JsValue,\n context: &mut Context,\n) -> JsResult> {\n // 1. If Type(dtf) is not Object, throw a TypeError exception.\n let dtf_o = dtf.as_object().ok_or_else(|| {\n JsNativeError::typ()\n .with_message(\"value was not an initialized `Intl.DateTimeFormat` object\")\n })?;\n\n if let Ok(dtf) = dtf_o.clone().downcast::() {\n // 3. Return dtf.\n return Ok(dtf);\n }\n\n // 2. If dtf does not have an [[InitializedDateTimeFormat]] internal slot and\n // ? OrdinaryHasInstance(%Intl.DateTimeFormat%, dtf) is true, then\n let constructor = context\n .intrinsics()\n .constructors()\n .date_time_format()\n .constructor();\n if JsValue::ordinary_has_instance(&constructor.into(), dtf, context)? {\n let fallback_symbol = context\n .intrinsics()\n .objects()\n .intl()\n .borrow()\n .data()\n .fallback_symbol();\n\n // a. Return ? Get(dtf, %Intl%.[[FallbackSymbol]]).\n if let Some(dtf) = dtf_o\n .get(fallback_symbol, context)?\n .as_object()\n .and_then(|o| o.downcast::().ok())\n {\n return Ok(dtf);\n }\n }\n\n Err(JsNativeError::typ()\n .with_message(\"object was not an initialized `Intl.DateTimeFormat` object\")\n .into())\n}\n\n/// Shared helper used by Date.prototype.toLocaleString,\n/// Date.prototype.toLocaleDateString, and Date.prototype.toLocaleTimeString.\n/// Applies `ToDateTimeOptions` defaults, calls [`create_date_time_format`], and formats\n/// the timestamp via [`format_timestamp_with_dtf`] without allocating a JS object.\n#[allow(clippy::too_many_arguments)]\npub(crate) fn format_date_time_locale(\n locales: &JsValue,\n options: &JsValue,\n format_type: FormatType,\n defaults: FormatDefaults,\n timestamp: f64,\n context: &mut Context,\n) -> JsResult {\n let options = coerce_options_to_object(options, context)?;\n if format_type != FormatType::Time\n && get_option::(&options, js_string!(\"dateStyle\"), context)?.is_none()\n {\n options.create_data_property_or_throw(\n js_string!(\"dateStyle\"),\n JsValue::from(js_string!(\"long\")),\n context,\n )?;\n }\n if format_type != FormatType::Date\n && get_option::(&options, js_string!(\"timeStyle\"), context)?.is_none()\n {\n options.create_data_property_or_throw(\n js_string!(\"timeStyle\"),\n JsValue::from(js_string!(\"long\")),\n context,\n )?;\n }\n let options_value = options.into();\n let dtf = create_date_time_format(locales, &options_value, format_type, defaults, context)?;\n // FormatDateTime steps 1–2: TimeClip and NaN check (format_timestamp_with_dtf does ToLocalTime + format only).\n let x = time_clip(timestamp);\n if x.is_nan() {\n return Err(js_error!(RangeError: \"formatted date cannot be NaN\"));\n }\n let result = format_timestamp_with_dtf(&dtf, x, context)?;\n Ok(JsValue::from(result))\n}\n" }, { "path": "core/engine/src/builtins/intl/date_time_format/options.rs", "content": "//! Intl.DateTimeFormat options module\n\nuse crate::{\n Context, JsError, JsNativeError, JsObject, JsResult, JsValue,\n builtins::{\n intl::{\n ServicePreferences, date_time_format::FormatType, locale::validate_extension,\n options::get_number_option,\n },\n options::{OptionType, get_option},\n },\n context::icu::IntlProvider,\n js_error, js_string,\n};\nuse icu_calendar::cal::{\n Buddhist, ChineseTraditional, Coptic, Ethiopian, Gregorian, Hebrew, Hijri, Indian, Japanese,\n KoreanTraditional, Persian, Roc, hijri,\n};\nuse icu_datetime::{\n DateTimeFormatterPreferences,\n fieldsets::builder::{DateFields, ZoneStyle},\n options::{Length, SubsecondDigits as IcuSubsecondDigits, TimePrecision},\n preferences::{CalendarAlgorithm, HijriCalendarAlgorithm, HourCycle as IcuHourCycle},\n scaffold::CldrCalendar,\n};\n\nuse icu_decimal::provider::DecimalSymbolsV1;\nuse icu_locale::extensions::unicode::Value;\nuse icu_provider::{\n DataMarker, DataMarkerAttributes, DryDataProvider,\n prelude::icu_locale_core::{\n LanguageIdentifier, extensions::unicode, preferences::LocalePreferences,\n },\n};\n\npub(crate) enum HourCycle {\n H11,\n H12,\n H23,\n H24,\n}\n\nimpl OptionType for HourCycle {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"h11\" => Ok(Self::H11),\n \"h12\" => Ok(Self::H12),\n \"h23\" => Ok(Self::H23),\n \"h24\" => Ok(Self::H24),\n _ => Err(js_error!(RangeError: \"unknown hourCycle option\")),\n }\n }\n}\n\nimpl TryFrom for IcuHourCycle {\n type Error = JsError;\n fn try_from(hc: HourCycle) -> Result {\n match hc {\n HourCycle::H11 => Ok(IcuHourCycle::H11),\n HourCycle::H12 => Ok(IcuHourCycle::H12),\n HourCycle::H23 => Ok(IcuHourCycle::H23),\n // TODO: Work on support for H24, potentially remove depending on fate\n // of H24 option.\n HourCycle::H24 => Err(js_error!(RangeError: \"h24 not currently supported.\")),\n }\n }\n}\n\npub(super) enum FormatMatcher {\n Basic,\n BestFit,\n}\n\nimpl OptionType for FormatMatcher {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"basic\" => Ok(Self::Basic),\n \"best fit\" => Ok(Self::BestFit),\n _ => Err(js_error!(RangeError: \"unknown formatMatcher option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(super) enum DateStyle {\n Full,\n Long,\n Medium,\n Short,\n}\n\nimpl OptionType for DateStyle {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"full\" => Ok(Self::Full),\n \"long\" => Ok(Self::Long),\n \"medium\" => Ok(Self::Medium),\n \"short\" => Ok(Self::Short),\n _ => Err(js_error!(RangeError: \"unknown dateStyle option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(super) enum TimeStyle {\n Full,\n Long,\n Medium,\n Short,\n}\n\nimpl OptionType for TimeStyle {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"full\" => Ok(Self::Full),\n \"long\" => Ok(Self::Long),\n \"medium\" => Ok(Self::Medium),\n \"short\" => Ok(Self::Short),\n _ => Err(js_error!(RangeError: \"unknown timeStyle option\")),\n }\n }\n}\n\nimpl OptionType for CalendarAlgorithm {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n let s = value.to_string(context)?.to_std_string_escaped();\n Value::try_from_str(&s)\n .ok()\n .and_then(|v| CalendarAlgorithm::try_from(&v).ok())\n .ok_or_else(|| {\n JsNativeError::range()\n .with_message(format!(\"provided calendar `{s}` is invalid\"))\n .into()\n })\n }\n}\n\n// TODO: track https://github.com/unicode-org/icu4x/issues/6597 and\n// https://github.com/tc39/ecma402/issues/1002 for resolution on\n// `HourCycle::H24`.\nimpl OptionType for IcuHourCycle {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_str() {\n \"h11\" => Ok(IcuHourCycle::H11),\n \"h12\" => Ok(IcuHourCycle::H12),\n \"h23\" => Ok(IcuHourCycle::H23),\n _ => Err(js_error!(RangeError: \"provided hour cycle was not `h11`, `h12` or `h23`\")),\n }\n }\n}\n\n// ==== Formatting options ====\n//\n// This section includes formatting options that act as an intermediary between\n// user space and ICU4X's datetimeformat composite fields.\n\npub(super) struct FormatOptions {\n _hour_cycle: Option, // -> ???\n week_day: Option, // e -> Maps to DateField\n era: Option, // G -> Maps to YearStyle\n year: Option, // Y -> Maps to DateField\n month: Option, // M -> Maps to DateField\n day: Option, // D -> Maps to DateField\n day_period: Option, // a -> ???\n hour: Option, // Maps to TimePrecision\n minute: Option, // Maps to TimePrecision\n second: Option, // Maps to TimePrecision\n fractional_second_digits: Option, // Maps to TimePrecision\n time_zone_name: Option, // Maps to ZoneStyle\n}\n\nimpl FormatOptions {\n pub(super) fn try_init(\n options: &JsObject,\n hour_cycle: Option, // TODO: Is option correct?\n context: &mut Context,\n ) -> JsResult {\n // Below is adapted and inlined from Step 24 of `CreateDateTimeFormat`\n let week_day = get_option::(options, js_string!(\"weekDay\"), context)?;\n let era = get_option::(options, js_string!(\"era\"), context)?;\n let year = get_option::(options, js_string!(\"year\"), context)?;\n let month = get_option::(options, js_string!(\"month\"), context)?;\n let day = get_option::(options, js_string!(\"day\"), context)?;\n let day_period = get_option::(options, js_string!(\"dayPeriod\"), context)?;\n let hour = get_option::(options, js_string!(\"hour\"), context)?;\n let minute = get_option::(options, js_string!(\"minute\"), context)?;\n let second = get_option::(options, js_string!(\"second\"), context)?;\n let fractional_second_digits =\n get_number_option(options, js_string!(\"fractionalSecondDigits\"), 1, 3, context)?\n .map(SubsecondDigits::from_i32);\n let time_zone_name =\n get_option::(options, js_string!(\"timeZoneName\"), context)?;\n\n Ok(Self {\n _hour_cycle: hour_cycle,\n week_day,\n era,\n year,\n month,\n day,\n day_period,\n hour,\n minute,\n second,\n fractional_second_digits,\n time_zone_name,\n })\n }\n\n pub(super) fn set_date_defaults(&mut self) {\n self.year = Some(Year::Numeric);\n self.month = Some(Month::Numeric);\n self.day = Some(Day::Numeric);\n }\n\n pub(super) fn set_time_defaults(&mut self) {\n self.hour = Some(Hour::Numeric);\n self.minute = Some(Minute::Numeric);\n self.second = Some(Second::Numeric);\n }\n\n pub(super) fn has_explicit_format_components(&self) -> bool {\n match self {\n Self {\n week_day: None,\n era: None,\n year: None,\n month: None,\n day: None,\n day_period: None,\n hour: None,\n minute: None,\n second: None,\n fractional_second_digits: None,\n time_zone_name: None,\n ..\n } => false,\n // If any of the format fields is Some(_), return true\n _ => true,\n }\n }\n\n pub(super) fn check_dtf_type(&self, required: FormatType) -> bool {\n // a. Let needDefaults be true.\n // b. If required is date or any, then\n // i. For each property name prop of « \"weekday\", \"year\", \"month\", \"day\" », do\n // 1. Let value be formatOptions.[[]].\n // 2. If value is not undefined, set needDefaults to false.\n // c. If required is time or any, then\n // i. For each property name prop of « \"dayPeriod\", \"hour\", \"minute\", \"second\", \"fractionalSecondDigits\" », do\n // 1. Let value be formatOptions.[[]].\n // 2. If value is not undefined, set needDefaults to false.\n if required != FormatType::Time && self.has_date_defaults() {\n return false;\n }\n if required != FormatType::Date && self.has_time_defaults() {\n return false;\n }\n true\n }\n\n pub(super) fn has_date_defaults(&self) -> bool {\n self.week_day.is_some() || self.year.is_some() || self.month.is_some() || self.day.is_some()\n }\n\n pub(super) fn has_time_defaults(&self) -> bool {\n self.day_period.is_some()\n || self.hour.is_some()\n || self.minute.is_some()\n || self.second.is_some()\n || self.fractional_second_digits.is_some()\n }\n\n pub(super) fn to_length(&self) -> Option {\n match (self.month, self.week_day, self.day_period, self.era) {\n (Some(month), _, _, _) => Some(month.to_length()),\n (None, Some(week_day), _, _) => Some(week_day.to_length()),\n (None, None, Some(day_period), _) => Some(day_period.to_length()),\n (None, None, None, Some(era)) => Some(era.to_length()),\n (None, None, None, None) => None,\n }\n }\n\n /// Convert the current `FormatOptions` to a [`DateFields`].\n pub(super) fn to_date_fields(&self) -> Option {\n match (self.year, self.month, self.day, self.week_day) {\n (Some(_y), _m, _d, Some(_e)) => Some(DateFields::YMDE),\n (Some(_y), _m, Some(_d), None) => Some(DateFields::YMD),\n (Some(_y), Some(_m), None, None) => Some(DateFields::YM),\n (Some(_y), None, None, None) => Some(DateFields::Y),\n (None, Some(_m), _d, Some(_e)) => Some(DateFields::MDE),\n (None, Some(_m), Some(_d), None) => Some(DateFields::MD),\n (None, Some(_m), None, None) => Some(DateFields::M),\n (None, None, Some(_d), Some(_e)) => Some(DateFields::DE),\n (None, None, Some(_d), None) => Some(DateFields::D),\n (None, None, None, Some(_e)) => Some(DateFields::E),\n (None, None, None, None) => None,\n }\n }\n\n /// Convert the current `FormatOptions` to a [`TimePrecision`].\n pub(super) fn to_time_fields(&self) -> Option {\n match (\n self.hour,\n self.minute,\n self.second,\n self.fractional_second_digits,\n ) {\n (_h, _m, _s, Some(digits)) => Some(TimePrecision::Subsecond(digits.into())),\n (_h, _m, Some(_s), None) => Some(TimePrecision::Second),\n (_h, Some(_m), None, None) => Some(TimePrecision::Minute),\n (Some(_h), None, None, None) => Some(TimePrecision::Hour),\n (None, None, None, None) => None,\n }\n }\n\n /// Convert the current `FormatOptions` to a [`ZoneStyle`].\n pub(super) fn to_zone_style(&self) -> Option {\n self.time_zone_name.map(TimeZoneName::to_zone_style)\n }\n}\n\n// ==== Format Options ====\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum WeekDay {\n Narrow,\n Short,\n Long,\n}\n\nimpl OptionType for WeekDay {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"narrow\" => Ok(Self::Narrow),\n \"short\" => Ok(Self::Short),\n \"long\" => Ok(Self::Long),\n _ => Err(js_error!(RangeError: \"unknown weekDay option\")),\n }\n }\n}\n\nimpl WeekDay {\n pub(crate) fn to_length(self) -> Length {\n match self {\n Self::Long => Length::Long,\n Self::Short => Length::Medium,\n Self::Narrow => Length::Short,\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum Era {\n Narrow,\n Short,\n Long,\n}\n\nimpl Era {\n pub(crate) fn to_length(self) -> Length {\n match self {\n Self::Long => Length::Long,\n Self::Short => Length::Medium,\n Self::Narrow => Length::Short,\n }\n }\n}\n\nimpl OptionType for Era {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"narrow\" => Ok(Self::Narrow),\n \"short\" => Ok(Self::Short),\n \"long\" => Ok(Self::Long),\n _ => Err(js_error!(RangeError: \"unknown era option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum Year {\n TwoDigit,\n Numeric,\n}\n\nimpl OptionType for Year {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"2-digit\" => Ok(Self::TwoDigit),\n \"numeric\" => Ok(Self::Numeric),\n _ => Err(js_error!(RangeError: \"unknown year option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum Month {\n TwoDigit,\n Numeric,\n Narrow,\n Short,\n Long,\n}\n\nimpl Month {\n pub(crate) fn to_length(self) -> Length {\n // NOTE (nekevss): after a brief glance, narrow does not appear to be\n // currently supported by ICU4X ... TBD\n match self {\n Self::Long => Length::Long,\n Self::Short => Length::Medium,\n _ => Length::Short,\n }\n }\n}\n\nimpl OptionType for Month {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"2-digit\" => Ok(Self::TwoDigit),\n \"numeric\" => Ok(Self::Numeric),\n \"narrow\" => Ok(Self::Narrow),\n \"short\" => Ok(Self::Short),\n \"long\" => Ok(Self::Long),\n _ => Err(js_error!(RangeError: \"unknown month option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum Day {\n TwoDigit,\n Numeric,\n}\n\nimpl OptionType for Day {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"2-digit\" => Ok(Self::TwoDigit),\n \"numeric\" => Ok(Self::Numeric),\n _ => Err(js_error!(RangeError: \"unknown day option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum DayPeriod {\n Narrow,\n Short,\n Long,\n}\n\nimpl DayPeriod {\n pub(crate) fn to_length(self) -> Length {\n match self {\n Self::Long => Length::Long,\n Self::Short => Length::Medium,\n Self::Narrow => Length::Short,\n }\n }\n}\n\nimpl OptionType for DayPeriod {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"narrow\" => Ok(Self::Narrow),\n \"short\" => Ok(Self::Short),\n \"long\" => Ok(Self::Long),\n _ => Err(js_error!(RangeError: \"unknown dayPeriod option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum Hour {\n TwoDigit,\n Numeric,\n}\n\nimpl OptionType for Hour {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"2-digit\" => Ok(Self::TwoDigit),\n \"numeric\" => Ok(Self::Numeric),\n _ => Err(js_error!(RangeError: \"unknown hour option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum Minute {\n TwoDigit,\n Numeric,\n}\n\nimpl OptionType for Minute {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"2-digit\" => Ok(Self::TwoDigit),\n \"numeric\" => Ok(Self::Numeric),\n _ => Err(js_error!(RangeError: \"unknown minute option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum Second {\n TwoDigit,\n Numeric,\n}\n\nimpl OptionType for Second {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"2-digit\" => Ok(Self::TwoDigit),\n \"numeric\" => Ok(Self::Numeric),\n _ => Err(js_error!(RangeError: \"unknown second option\")),\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum SubsecondDigits {\n S1,\n S2,\n S3,\n}\n\nimpl SubsecondDigits {\n fn from_i32(i: i32) -> SubsecondDigits {\n match i {\n 1 => SubsecondDigits::S1,\n 2 => SubsecondDigits::S2,\n 3 => SubsecondDigits::S3,\n _ => unreachable!(\"subSecondDigits must be previously constrained.\"),\n }\n }\n}\n\nimpl From for IcuSubsecondDigits {\n fn from(value: SubsecondDigits) -> Self {\n match value {\n SubsecondDigits::S1 => IcuSubsecondDigits::S1,\n SubsecondDigits::S2 => IcuSubsecondDigits::S2,\n SubsecondDigits::S3 => IcuSubsecondDigits::S3,\n }\n }\n}\n\n#[derive(Debug, Clone, Copy)]\npub(crate) enum TimeZoneName {\n Short,\n Long,\n ShortOffset,\n LongOffset,\n ShortGeneric,\n LongGeneric,\n}\n\nimpl OptionType for TimeZoneName {\n fn from_value(value: JsValue, context: &mut Context) -> JsResult {\n match value.to_string(context)?.to_std_string_escaped().as_ref() {\n \"short\" => Ok(Self::Short),\n \"long\" => Ok(Self::Long),\n \"shortOffset\" => Ok(Self::ShortOffset),\n \"longOffset\" => Ok(Self::LongOffset),\n \"shortGeneric\" => Ok(Self::ShortGeneric),\n \"longGeneric\" => Ok(Self::LongGeneric),\n _ => Err(js_error!(RangeError: \"unknown timeZoneName option\")),\n }\n }\n}\n\nimpl TimeZoneName {\n fn to_zone_style(self) -> ZoneStyle {\n match self {\n TimeZoneName::LongGeneric => ZoneStyle::GenericLong,\n TimeZoneName::ShortGeneric => ZoneStyle::GenericShort,\n TimeZoneName::LongOffset => ZoneStyle::LocalizedOffsetLong,\n TimeZoneName::ShortOffset => ZoneStyle::LocalizedOffsetShort,\n TimeZoneName::Long => ZoneStyle::SpecificLong,\n TimeZoneName::Short => ZoneStyle::SpecificShort,\n }\n }\n}\n\n// The below handles the [[RelevantExtensionKeys]] of DateTimeFormatters\n// internal slots.\n//\n// See https://tc39.es/ecma402/#sec-intl.datetimeformat-internal-slots\nimpl ServicePreferences for DateTimeFormatterPreferences {\n fn validate(&mut self, id: &LanguageIdentifier, provider: &IntlProvider) {\n // Handle LDML unicode key \"nu\", Numbering system\n self.numbering_system = self.numbering_system.take().filter(|nu| {\n let attr = DataMarkerAttributes::from_str_or_panic(nu.as_str());\n validate_extension::(id, attr, provider)\n });\n\n // Handle LDML unicode key \"ca\", Calendar algorithm\n self.calendar_algorithm = self.calendar_algorithm.take().filter(|ca| match ca {\n CalendarAlgorithm::Buddhist => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Chinese => {\n has_calendar_data_for_locale::(id, provider)\n }\n CalendarAlgorithm::Coptic => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Dangi => {\n has_calendar_data_for_locale::(id, provider)\n }\n CalendarAlgorithm::Ethiopic => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Gregory => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Hebrew => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Indian => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Japanese => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Persian => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Roc => has_calendar_data_for_locale::(id, provider),\n CalendarAlgorithm::Hijri(Some(\n HijriCalendarAlgorithm::Civil | HijriCalendarAlgorithm::Tbla,\n )) => has_calendar_data_for_locale::>(id, provider),\n CalendarAlgorithm::Hijri(Some(HijriCalendarAlgorithm::Umalqura)) => {\n has_calendar_data_for_locale::>(id, provider)\n }\n CalendarAlgorithm::Hijri(Some(HijriCalendarAlgorithm::Rgsa) | None) => true,\n _ => false,\n });\n\n // NOTE (nekevss): issue: this will not support `H24` as ICU4X does\n // not currently support it.\n //\n // track: https://github.com/unicode-org/icu4x/issues/6597\n // Handle LDML unicode key \"hc\", Hour cycle\n // No need to validate hour_cycle since it only affects formatting\n // behaviour.\n }\n\n impl_service_preferences!(numbering_system, calendar_algorithm, hour_cycle);\n}\n\nfn has_calendar_data_for_locale(\n id: &LanguageIdentifier,\n provider: &IntlProvider,\n) -> bool\nwhere\n IntlProvider: DryDataProvider,\n{\n use icu_datetime::provider::neo::marker_attrs;\n use icu_provider::prelude::{\n DataIdentifierBorrowed, DataRequest, DataRequestMetadata,\n icu_locale_core::preferences::LocalePreferences,\n };\n\n let info = ::INFO;\n let locale = info.make_locale(LocalePreferences::from(id));\n let req = DataRequest {\n id: DataIdentifierBorrowed::for_marker_attributes_and_locale(marker_attrs::ABBR, &locale),\n metadata: {\n let mut md = DataRequestMetadata::default();\n md.silent = true;\n md\n },\n };\n\n let Ok(md) = DryDataProvider::dry_load(provider, req) else {\n return false;\n };\n\n md.locale.is_none_or(|loc| !loc.is_unknown())\n}\n" }, { "path": "core/engine/src/builtins/intl/date_time_format/tests.rs", "content": "use indoc::indoc;\n\nuse crate::{TestAction, run_test_actions};\n\n// Intl.DateTimeFormat tests\n\n#[cfg(feature = \"intl_bundled\")]\n#[test]\nfn dtf_basic() {\n run_test_actions([\n TestAction::run(indoc! {\"\n // Setup date\n const date = new Date(Date.UTC(2020, 11, 20, 3, 23, 16, 738));\n\n let formatter = new Intl.DateTimeFormat('en-US');\n let result = formatter.format(date);\n \"}),\n TestAction::assert_eq(\"result === '12/20/20'\", true),\n ]);\n run_test_actions([\n TestAction::run(indoc! {\"\n // Setup date\n const date = new Date(Date.UTC(2020, 11, 20, 3, 23, 16, 738));\n\n let formatter = new Intl.DateTimeFormat('en-US', { dateStyle: 'full' });\n let result = formatter.format(date);\n \"}),\n TestAction::assert_eq(\"result === 'Sunday, December 20, 2020'\", true),\n ]);\n run_test_actions([\n TestAction::run(indoc! {\"\n // Setup date\n const date = new Date(Date.UTC(2020, 11, 20, 3, 23, 16, 738));\n\n let formatter = new Intl.DateTimeFormat('en-GB');\n let result = formatter.format(date);\n \"}),\n TestAction::assert_eq(\"result === '20/12/2020'\", true),\n ]);\n run_test_actions([\n TestAction::run(indoc! {\"\n // Setup date\n const date = new Date(Date.UTC(2020, 11, 20, 3, 23, 16, 738));\n\n let formatter = new Intl.DateTimeFormat('en-GB', {\n dateStyle: 'full',\n timeStyle: 'long',\n });\n let result = formatter.format(date);\n \"}),\n TestAction::assert_eq(\"result === 'Sunday, 20 December 2020 at 03:23:16'\", true),\n ]);\n run_test_actions([\n TestAction::run(indoc! {\"\n // Setup date\n const date = new Date(Date.UTC(2020, 11, 20, 3, 23, 16, 738));\n\n let formatter = new Intl.DateTimeFormat('en-GB', {\n dateStyle: 'full',\n timeStyle: 'long',\n timeZone: 'Australia/Sydney',\n });\n let result = formatter.format(date);\n \"}),\n TestAction::assert_eq(\"result === 'Sunday, 20 December 2020 at 14:23:16'\", true),\n ]);\n}\n" }, { "path": "core/engine/src/builtins/intl/list_format/mod.rs", "content": "use std::fmt::Write;\n\nuse boa_gc::{Finalize, Trace};\nuse icu_list::{\n ListFormatter, ListFormatterPreferences,\n options::{ListFormatterOptions, ListLength},\n provider::{ListAndV1, ListFormatterPatterns},\n};\nuse icu_locale::Locale;\n\nuse crate::{\n Context, JsArgs, JsData, JsExpect, JsNativeError, JsResult, JsString, JsValue,\n builtins::{\n Array, BuiltInBuilder, BuiltInConstructor, BuiltInObject, IntrinsicObject, OrdinaryObject,\n intl::options::EmptyPreferences,\n iterable::IteratorHint,\n options::{get_option, get_options_object},\n },\n context::intrinsics::{Intrinsics, StandardConstructor, StandardConstructors},\n js_string,\n object::{JsObject, internal_methods::get_prototype_from_constructor},\n property::Attribute,\n realm::Realm,\n string::StaticJsStrings,\n symbol::JsSymbol,\n};\n\nuse super::{\n Service,\n locale::{canonicalize_locale_list, filter_locales, resolve_locale},\n options::IntlOptions,\n};\n\nmod options;\npub(crate) use options::*;\n\n#[derive(Debug, Trace, Finalize, JsData)]\n// Safety: `ListFormat` only contains non-traceable types.\n#[boa_gc(unsafe_empty_trace)]\npub(crate) struct ListFormat {\n locale: Locale,\n typ: ListFormatType,\n style: ListLength,\n native: ListFormatter,\n}\n\nimpl Service for ListFormat {\n type LangMarker = ListAndV1;\n\n const ATTRIBUTES: &'static icu_provider::DataMarkerAttributes = ListFormatterPatterns::WIDE;\n\n type Preferences = EmptyPreferences;\n}\n\nimpl IntrinsicObject for ListFormat {\n fn init(realm: &Realm) {\n BuiltInBuilder::from_standard_constructor::(realm)\n .static_method(\n Self::supported_locales_of,\n js_string!(\"supportedLocalesOf\"),\n 1,\n )\n .property(\n JsSymbol::to_string_tag(),\n js_string!(\"Intl.ListFormat\"),\n Attribute::CONFIGURABLE,\n )\n .method(Self::format, js_string!(\"format\"), 1)\n .method(Self::format_to_parts, js_string!(\"formatToParts\"), 1)\n .method(Self::resolved_options, js_string!(\"resolvedOptions\"), 0)\n .build();\n }\n\n fn get(intrinsics: &Intrinsics) -> JsObject {\n Self::STANDARD_CONSTRUCTOR(intrinsics.constructors()).constructor()\n }\n}\n\nimpl BuiltInObject for ListFormat {\n const NAME: JsString = StaticJsStrings::LIST_FORMAT;\n}\n\nimpl BuiltInConstructor for ListFormat {\n const CONSTRUCTOR_ARGUMENTS: usize = 0;\n const PROTOTYPE_STORAGE_SLOTS: usize = 4;\n const CONSTRUCTOR_STORAGE_SLOTS: usize = 1;\n\n const STANDARD_CONSTRUCTOR: fn(&StandardConstructors) -> &StandardConstructor =\n StandardConstructors::list_format;\n\n /// Constructor [`Intl.ListFormat ( [ locales [ , options ] ] )`][spec].\n ///\n /// Constructor for `ListFormat` objects.\n ///\n /// More information:\n /// - [MDN documentation][mdn]\n ///\n /// [spec]: https://tc39.es/ecma402/#sec-Intl.ListFormat\n /// [mdn]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat\n fn constructor(\n new_target: &JsValue,\n args: &[JsValue],\n context: &mut Context,\n ) -> JsResult {\n // 1. If NewTarget is undefined, throw a TypeError exception.\n if new_target.is_undefined() {\n return Err(JsNativeError::typ()\n .with_message(\"cannot call `Intl.ListFormat` constructor without `new`\")\n .into());\n }\n\n let locales = args.get_or_undefined(0);\n let options = args.get_or_undefined(1);\n\n // 3. Let requestedLocales be ? CanonicalizeLocaleList(locales).\n let requested_locales = canonicalize_locale_list(locales, context)?;\n\n // 4. Set options to ? GetOptionsObject(options).\n let options = get_options_object(options)?;\n\n // 5. Let opt be a new Record.\n // 6. Let matcher be ? GetOption(options, \"localeMatcher\", string, « \"lookup\", \"best fit\" », \"best fit\").\n let matcher =\n get_option(&options, js_string!(\"localeMatcher\"), context)?.unwrap_or_default();\n\n // 7. Set opt.[[localeMatcher]] to matcher.\n // 8. Let localeData be %ListFormat%.[[LocaleData]].\n // 9. Let r be ResolveLocale(%ListFormat%.[[AvailableLocales]], requestedLocales, opt, %ListFormat%.[[RelevantExtensionKeys]], localeData).\n // 10. Set listFormat.[[Locale]] to r.[[locale]].\n let locale = resolve_locale::(\n requested_locales,\n &mut IntlOptions {\n matcher,\n ..Default::default()\n },\n context.intl_provider(),\n )?;\n\n // 11. Let type be ? GetOption(options, \"type\", string, « \"conjunction\", \"disjunction\", \"unit\" », \"conjunction\").\n // 12. Set listFormat.[[Type]] to type.\n let typ = get_option(&options, js_string!(\"type\"), context)?.unwrap_or_default();\n\n // 13. Let style be ? GetOption(options, \"style\", string, « \"long\", \"short\", \"narrow\" », \"long\").\n // 14. Set listFormat.[[Style]] to style.\n let style = get_option(&options, js_string!(\"style\"), context)?.unwrap_or(ListLength::Wide);\n\n // 15. Let dataLocale be r.[[dataLocale]].\n // 16. Let dataLocaleData be localeData.[[]].\n // 17. Let dataLocaleTypes be dataLocaleData.[[]].\n // 18. Set listFormat.[[Templates]] to dataLocaleTypes.[[