[ { "path": ".devcontainer/Dockerfile", "content": "# Original Dockerfile by Sébastien HOUZÉ, https://github.com/shouze\n# Adapted for use as devcontainer\nFROM perl:slim AS base\n\nRUN export DEBIAN_FRONTEND=noninteractive \\\n && apt-get update \\\n && apt-get install -y --no-install-recommends \\\n ca-certificates \\\n git \\\n unzip \\\n locales \\\n locales \\\n exuberant-ctags \\\n build-essential \\\n && rm -rf /var/lib/apt/lists/*\n\n# Generate locale\nRUN sed -i '/en_US.UTF-8/s/^# //g' /etc/locale.gen && \\\n locale-gen\nENV LANG en_US.UTF-8 \nENV LANGUAGE en_US:en \nENV LC_ALL en_US.UTF-8 \n\n# Install all dependencies\nRUN cpanm \\\n Algorithm::Diff \\\n Digest::MD5 \\\n Parallel::ForkManager \\\n Regexp::Common \\\n Perl::LanguageServer \\\n Perl::Tidy \\\n && rm -rf $HOME/.cpanm\n" }, { "path": ".devcontainer/devcontainer.json", "content": "{\n \"build\": { \"dockerfile\": \"Dockerfile\" },\n \"extensions\": [\n \"mhutchie.git-graph\",\n \"eamodio.gitlens\",\n \"richterger.perl\",\n \"cfgweb.vscode-perl\",\n \"gruntfuggly.todo-tree\"\n ]\n}\n" }, { "path": ".dockerignore", "content": ".github\nLICENSE\nREADME.md\n" }, { "path": ".github/FUNDING.yml", "content": "# These are supported funding model platforms\n\ngithub: [AlDanial] \n" }, { "path": ".github/ISSUE_TEMPLATE/report-a-bug.md", "content": "---\nname: report a bug\nabout: report a bug\ntitle: ''\nlabels: ''\nassignees: ''\n\n---\n\n**Describe the bug**\nA concise description of the problem you found with cloc.\n\n**cloc; OS; OS version**\n - cloc version:\n - If running the cloc source, Perl version:\n - OS (eg Linux, Windows, macOS, etc):\n - OS version:\n\n**To Reproduce**\nSteps one can follow reproduce the behavior you're seeing.\n\n**Expected result**\nA concise description of what you expected to happen.\n\n**Additional context**\nAdd any other context about the problem here.\n" }, { "path": ".github/ISSUE_TEMPLATE/request-an-enhancement.md", "content": "---\nname: request an enhancement\nabout: request support for additional languages or new capabilities\ntitle: ''\nlabels: ''\nassignees: ''\n\n---\n\n**If you want an unsupported language added, provide:**\n - language name:\n - file extension(s):\n - method(s) of commenting text:\n - location of sample code:\n\n**For other enhancements:**\nGive a concise description of what you want cloc to be able to do.\n" }, { "path": ".github/workflows/build.yml", "content": "# This workflow will build a container image,\n# to run all tests (syntax checking + integration tests) on each PR and git push.\n\non: [push, pull_request]\n\nname: Run all tests\n\njobs:\n deploy:\n name: Deploy\n runs-on: ubuntu-latest\n timeout-minutes: 4\n steps:\n - name: Checkout\n uses: actions/checkout@v1\n\n - name: Run tests\n id: run-tests\n env:\n IMAGE_TAG: ${{ github.sha }}\n run: |\n # Build a docker container to run tests\n docker build . --target test\n" }, { "path": ".github/workflows/release-ready.yml", "content": "name: Create release\n\non:\n pull_request:\n types: [closed]\n\njobs:\n create_release:\n if: ${{ github.event.pull_request.merged == true && startsWith(github.head_ref, 'release-v') }}\n runs-on: ubuntu-latest\n\n steps:\n - name: Checkout repository\n uses: actions/checkout@v4\n with:\n ref: \"master\"\n\n - name: Extract version from branch name\n id: get_version\n run: |\n BRANCH=\"${GITHUB_HEAD_REF:-${GITHUB_REF#refs/heads/}}\"\n if [[ \"$BRANCH\" =~ release-v([0-9]+\\.[0-9]+) ]]; then\n VERSION=\"${BASH_REMATCH[1]}\"\n echo \"VERSION=$VERSION\" >> $GITHUB_OUTPUT\n echo \"DISPLAY_VERSION=v$VERSION\" >> $GITHUB_OUTPUT\n else\n echo \"Branch name does not match expected format (release-vX.XX)!\" && exit 1\n fi\n\n - name: Package repository as tar.gz\n run: |\n VER=\"${{ steps.get_version.outputs.VERSION }}\"\n git archive --format=tar.gz -o cloc-$VER.tar.gz HEAD\n\n - name: Get artifact url\n id: get_artifact_url\n env:\n GH_TOKEN: ${{ secrets.GITHUB_TOKEN }}\n run: |\n ARTIFACT_COMMENT=$(gh pr view ${{ github.event.pull_request.number }} --json comments -q '\n .comments \n | sort_by(.createdAt) \n | reverse \n | map(select(.body | contains(\"**Built executable artifact:**\"))) \n | .[0].body\n ')\n if [ -z \"$ARTIFACT_COMMENT\" ]; then\n echo \"No matching comment found.\"\n exit 1\n fi\n MATCHING_URLS=$(echo \"$ARTIFACT_COMMENT\" | grep -oP 'https:\\/\\/[^\\s\\)]+')\n if [ -z \"$MATCHING_URLS\" ]; then\n echo \"No URL found in the comment.\"\n exit 1\n fi\n ARTIFACT_URL=$(echo \"$MATCHING_URLS\" | head -n 1)\n RUN_ID=$(echo \"$ARTIFACT_URL\" | grep -oP '/actions/runs/\\K[0-9]+')\n echo \"RUN_ID=$RUN_ID\" >> $GITHUB_OUTPUT\n echo \"Artifact URL: $ARTIFACT_URL\"\n \n - name: Download artifact\n uses: actions/download-artifact@v4\n with:\n name: cloc-${{ steps.get_version.outputs.VERSION }}-executable\n github-token: ${{ secrets.GITHUB_TOKEN }}\n run-id: ${{ steps.get_artifact_url.outputs.RUN_ID }}\n\n - name: Prepare renamed release assets\n run: |\n VER=\"${{ steps.get_version.outputs.VERSION }}\"\n cp cloc cloc-$VER.pl\n cp Unix/NEWS release_notes-$VER.txt\n\n - name: Create GitHub release with assets\n uses: softprops/action-gh-release@v2\n with:\n tag_name: \"${{ steps.get_version.outputs.DISPLAY_VERSION }}\"\n name: \"${{ steps.get_version.outputs.DISPLAY_VERSION }}\"\n body: \"${{ github.event.pull_request.body }}\"\n token: ${{ secrets.GITHUB_TOKEN }}\n files: |\n cloc-${{ steps.get_version.outputs.VERSION }}.tar.gz\n README.md\n cloc-${{ steps.get_version.outputs.VERSION }}.pl\n cloc-${{ steps.get_version.outputs.VERSION }}.exe\n release_notes-${{ steps.get_version.outputs.VERSION }}.txt\n" }, { "path": ".github/workflows/release-staging.yml", "content": "name: Build Windows executable\n\non:\n pull_request:\n types: [labeled]\n\njobs:\n staging_build:\n if: ${{ github.event.label.name == 'release-ready' }}\n runs-on: windows-latest\n\n steps:\n - name: Checkout repository\n uses: actions/checkout@v4\n with:\n ref: ${{ github.head_ref }}\n\n # Branch name must be in the format \"release-vX.XX\"\n - name: Extract version from branch name\n id: get_version\n shell: pwsh\n run: |\n $branch = \"${{ github.head_ref }}\"\n if (-not $branch) { $branch = \"${{ github.ref }}\" }\n if ($branch -match 'release-v(?[0-9]+\\.[0-9]+)') {\n $ver = $Matches[\"ver\"]\n echo \"VERSION_NUM=$ver\" >> $env:GITHUB_OUTPUT\n echo \"DISPLAY_VERSION=v$ver\" >> $env:GITHUB_OUTPUT\n Write-Host \"Extracted version: $ver\"\n }\n else {\n Write-Error \"Branch name does not match expected format (release-vX.XX).\"\n }\n\n - name: Update version in cloc files\n shell: pwsh\n run: |\n $ver = \"${{ steps.get_version.outputs.VERSION_NUM }}\"\n Write-Host \"Updating version in cloc and Unix/cloc to '$ver'\"\n $replaceVer = 'my $VERSION = \"' + $ver + '\";'\n (Get-Content cloc) -replace 'my \\$VERSION = \".*\";', $replaceVer | Set-Content cloc\n (Get-Content Unix/cloc) -replace 'my \\$VERSION = \".*\";', $replaceVer | Set-Content Unix/cloc\n\n - name: Update README.md with version and date\n shell: pwsh\n run: |\n $ver = \"${{ steps.get_version.outputs.VERSION_NUM }}\"\n $disp = \"${{ steps.get_version.outputs.DISPLAY_VERSION }}\"\n $currentDate = (Get-Date).ToString(\"MMM. d, yyyy\")\n Write-Host \"Updating README.md with version $disp and date $currentDate\"\n (Get-Content README.md) `\n -replace 'Latest release:\\s+v\\d+\\.\\d+\\s+\\(.*\\)', \"Latest release: $disp ($currentDate)\" `\n -replace 'badge/version-\\d+\\.\\d+', \"badge/version-$ver\" `\n -replace 'cloc-\\d+\\.\\d+\\.pl', \"cloc-$ver.pl\" `\n -replace 'cloc-\\d+\\.\\d+\\.exe(?!:)', \"cloc-$ver.exe\" `\n -replace 'pp -M Win32::LongPath -M Encode::Unicode -M Digest::MD5 -c -x -o cloc-\\d+\\.\\d+\\.exe', \"pp -M Win32::LongPath -M Encode::Unicode -M Digest::MD5 -c -x -o cloc-$ver.exe\" `\n -replace 'cloc-\\d+\\.\\d+\\.exe', \"cloc-$ver.exe\" | Set-Content README.md\n \n - name: Install or upgrade Strawberry Perl\n shell: pwsh\n run: |\n if (Get-Command perl -ErrorAction SilentlyContinue) {\n # see https://github.com/StrawberryPerl/Perl-Dist-Strawberry/issues/19#issuecomment-2401043349\n choco uninstall strawberryperl -y\n }\n choco install strawberryperl --no-progress -y\n perl -V\n cpan -v\n\n - name: Install CPAN dependencies\n shell: pwsh\n run: |\n cpan -i App::cpanminus\n cpanm Digest::MD5\n cpanm Regexp::Common\n cpanm Algorithm::Diff\n cpanm PAR::Packer\n cpanm Win32::LongPath || cpanm -n Win32::LongPath\n \n - name: Build executable\n shell: pwsh\n run: |\n $ver = \"${{ steps.get_version.outputs.VERSION_NUM }}\"\n pp -M Win32::LongPath -M Encode::Unicode -M Digest::MD5 -c -x -o \"cloc-$ver.exe\" cloc\n\n - name: Upload executable to VirusTotal and get analysis URL\n id: vt_upload\n shell: pwsh\n run: |\n $ver = \"${{ steps.get_version.outputs.VERSION_NUM }}\"\n $apiKey = \"${{ secrets.VIRUSTOTAL_API_KEY }}\"\n $exeFile = \"cloc-$ver.exe\"\n $absoluteFilePath = (Get-Location).Path + \"\\\" + $exeFile\n Write-Host \"Uploading $absoluteFilePath to VirusTotal...\"\n $headers=@{}\n $headers.Add(\"accept\", \"application/json\")\n $headers.Add(\"content-type\", \"multipart/form-data\")\n $headers.Add(\"x-apikey\", $apiKey)\n $response = Invoke-RestMethod -Uri \"https://www.virustotal.com/api/v3/files\" `\n -Method POST `\n -Headers $headers `\n -Form @{ file = Get-Item -Path $absoluteFilePath }\n $vtAnalysisId = $response.data.id\n $response2 = Invoke-WebRequest -Uri \"https://www.virustotal.com/api/v3/analyses/$vtAnalysisId\" -Method GET -Headers $headers\n $vtId = ($response2.Content | ConvertFrom-Json).data.links.item.Split(\"/\")[-1]\n $vtUrl = \"https://www.virustotal.com/gui/file/$vtId\"\n echo \"VT_URL=$vtUrl\" >> $env:GITHUB_OUTPUT\n Write-Host \"VirusTotal analysis available at $vtUrl\"\n \n - name: Upload artifact\n uses: actions/upload-artifact@v4\n id: upload-artifact\n with:\n name: cloc-${{ steps.get_version.outputs.VERSION_NUM }}-executable\n path: cloc-${{ steps.get_version.outputs.VERSION_NUM }}.exe\n\n - name: Post comment with artifact and VirusTotal URL\n uses: peter-evans/create-or-update-comment@v4\n with:\n issue-number: ${{ github.event.pull_request.number }}\n body: |\n **Built executable artifact:**\n [Download the executable artifact from this workflow run](${{ steps.upload-artifact.outputs.artifact-url }})\n\n **VirusTotal Analysis:** ${{ steps.vt_upload.outputs.VT_URL }}\n\n - name: Clean up local exe\n shell: pwsh\n run: |\n $ver = \"${{ steps.get_version.outputs.VERSION_NUM }}\"\n Remove-Item \"cloc-$ver.exe\"\n\n - name: Update README recent versions entry\n shell: pwsh\n run: |\n $ver = \"${{ steps.get_version.outputs.VERSION_NUM }}\"\n $vtUrl = \"${{ steps.vt_upload.outputs.VT_URL }}\"\n $readme = Get-Content README.md -Raw\n $pattern = 'The entries for recent versions are:\\s*\\r?\\n\\s*\\r?\\n'\n $replacement = \"The entries for recent versions are:`n`ncloc-$ver.exe:`n$vtUrl`n`n\"\n $newReadme = [regex]::Replace($readme, $pattern, $replacement)\n Set-Content -Path README.md -Value $newReadme\n (Get-Content README.md -Raw) -replace '\\r?\\n\\s*\\r?\\n$', \"\" | Set-Content README.md\n\n - name: Update Unix/NEWS with release notes\n shell: pwsh\n run: |\n $ver = \"${{ steps.get_version.outputs.VERSION_NUM }}\"\n $currentDate = (Get-Date).ToString(\"MMM. d, yyyy\")\n $event = Get-Content $env:GITHUB_EVENT_PATH -Raw | ConvertFrom-Json\n $prBody = $event.pull_request.body -replace '\"', '`\"'\n $processedNotes = $prBody -replace '- ', ' o ' -replace '[\\*\\`_]', ''\n $newsContent = Get-Content Unix/NEWS -Raw -Encoding UTF8\n $header = @(\n \" Release Notes for cloc version $ver\",\n \" https://github.com/AlDanial/cloc\",\n \" $currentDate\"\n )\n $newNews = $header + \"\" + $processedNotes + \"\" + (\"=\" * 76) + $newsContent\n Set-Content -Path Unix/NEWS -Value $newNews -Encoding UTF8\n (Get-Content Unix/NEWS -Raw) -replace '\\r?\\n\\s*\\r?\\n$', \"\" | Set-Content Unix/NEWS -Encoding UTF8\n\n - name: Commit changes\n shell: pwsh\n run: |\n $ver = \"${{ steps.get_version.outputs.VERSION_NUM }}\"\n git config user.name \"github-actions\"\n git config user.email \"actions@github.com\"\n git add cloc README.md Unix/NEWS Unix/cloc\n git commit -m \"chore: prepare release version $ver\"\n git push\n" }, { "path": ".gitignore", "content": "cloc-?.??.*\nrelease_notes-?.??.txt\n\n# Visual Studio Code and extensions\n.vstags\n.vscode/perl-lang\n.gitmodules\nUnix/cloc_submodule_test\n" }, { "path": ".vscode/launch.json", "content": "{\n // Further information: https://go.microsoft.com/fwlink/?linkid=830387\n \"version\": \"0.2.0\",\n \"configurations\": [\n {\n \"type\": \"perl\",\n \"request\": \"launch\",\n \"name\": \"Perl-Debug\",\n \"program\": \"${workspaceFolder}/${relativeFile}\",\n \"stopOnEntry\": true,\n \"reloadModules\": true\n }\n ]\n}" }, { "path": "Dockerfile", "content": "# Dockerfile by Sébastien HOUZÉ, https://github.com/shouze\nFROM perl:slim AS builder\n\nRUN export DEBIAN_FRONTEND=noninteractive \\\n && apt-get update \\\n && apt-get install -y --no-install-recommends \\\n dos2unix \\\n gcc\n\n#Install all dependencies\nRUN cpanm \\\n Algorithm::Diff \\\n Digest::MD5 \\\n Parallel::ForkManager \\\n Regexp::Common\n\n#Copy source code\nCOPY cloc /usr/src/\nRUN find /usr/src/ -type f -exec dos2unix {} \\;\n\nFROM perl:slim AS base\n\nRUN export DEBIAN_FRONTEND=noninteractive \\\n && apt-get update \\\n && apt-get install -y --no-install-recommends \\\n git \\\n unzip \\\n && rm -rf /var/lib/apt/lists/*\n\n#Copy dependencies and source prepared in base image\nCOPY --from=builder /usr/local/lib/perl5 /usr/local/lib/perl5\nCOPY --from=builder /usr/src/ /usr/src/\n\n####################\nFROM base AS test\n\nRUN export DEBIAN_FRONTEND=noninteractive \\\n && apt-get update \\\n && apt-get install -y --no-install-recommends \\\n ca-certificates\n\n#Copy test code\nCOPY .git /usr/src/.git\nCOPY tests /usr/src/tests\nCOPY Unix /usr/src/Unix\n\nWORKDIR /usr/src/Unix\n\n#Checkout of cloc_submodule_test for t/02_git.t tests\nRUN git clone https://github.com/AlDanial/cloc_submodule_test.git\n\n#Run tests\nRUN make test\n\n####################\nFROM base AS final\n\nWORKDIR /tmp\n\nENTRYPOINT [\"/usr/src/cloc\"]\nCMD [\"--help\"]\n" }, { "path": "Dockerfile.build", "content": "FROM alpine:3.11\n\nRUN apk add --no-cache cloc\nENTRYPOINT [\"cloc\"]" }, { "path": "LICENSE", "content": " GNU GENERAL PUBLIC LICENSE\n Version 2, June 1991\n\n Copyright (C) 1989, 1991 Free Software Foundation, Inc., \n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n Everyone is permitted to copy and distribute verbatim copies\n of this license document, but changing it is not allowed.\n\n Preamble\n\n The licenses for most software are designed to take away your\nfreedom to share and change it. By contrast, the GNU General Public\nLicense is intended to guarantee your freedom to share and change free\nsoftware--to make sure the software is free for all its users. This\nGeneral Public License applies to most of the Free Software\nFoundation's software and to any other program whose authors commit to\nusing it. (Some other Free Software Foundation software is covered by\nthe GNU Lesser General Public License instead.) You can apply it to\nyour programs, too.\n\n When we speak of free software, we are referring to freedom, not\nprice. Our General Public Licenses are designed to make sure that you\nhave the freedom to distribute copies of free software (and charge for\nthis service if you wish), that you receive source code or can get it\nif you want it, that you can change the software or use pieces of it\nin new free programs; and that you know you can do these things.\n\n To protect your rights, we need to make restrictions that forbid\nanyone to deny you these rights or to ask you to surrender the rights.\nThese restrictions translate to certain responsibilities for you if you\ndistribute copies of the software, or if you modify it.\n\n For example, if you distribute copies of such a program, whether\ngratis or for a fee, you must give the recipients all the rights that\nyou have. You must make sure that they, too, receive or can get the\nsource code. And you must show them these terms so they know their\nrights.\n\n We protect your rights with two steps: (1) copyright the software, and\n(2) offer you this license which gives you legal permission to copy,\ndistribute and/or modify the software.\n\n Also, for each author's protection and ours, we want to make certain\nthat everyone understands that there is no warranty for this free\nsoftware. If the software is modified by someone else and passed on, we\nwant its recipients to know that what they have is not the original, so\nthat any problems introduced by others will not reflect on the original\nauthors' reputations.\n\n Finally, any free program is threatened constantly by software\npatents. We wish to avoid the danger that redistributors of a free\nprogram will individually obtain patent licenses, in effect making the\nprogram proprietary. To prevent this, we have made it clear that any\npatent must be licensed for everyone's free use or not licensed at all.\n\n The precise terms and conditions for copying, distribution and\nmodification follow.\n\n GNU GENERAL PUBLIC LICENSE\n TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\n\n 0. This License applies to any program or other work which contains\na notice placed by the copyright holder saying it may be distributed\nunder the terms of this General Public License. The \"Program\", below,\nrefers to any such program or work, and a \"work based on the Program\"\nmeans either the Program or any derivative work under copyright law:\nthat is to say, a work containing the Program or a portion of it,\neither verbatim or with modifications and/or translated into another\nlanguage. (Hereinafter, translation is included without limitation in\nthe term \"modification\".) Each licensee is addressed as \"you\".\n\nActivities other than copying, distribution and modification are not\ncovered by this License; they are outside its scope. The act of\nrunning the Program is not restricted, and the output from the Program\nis covered only if its contents constitute a work based on the\nProgram (independent of having been made by running the Program).\nWhether that is true depends on what the Program does.\n\n 1. You may copy and distribute verbatim copies of the Program's\nsource code as you receive it, in any medium, provided that you\nconspicuously and appropriately publish on each copy an appropriate\ncopyright notice and disclaimer of warranty; keep intact all the\nnotices that refer to this License and to the absence of any warranty;\nand give any other recipients of the Program a copy of this License\nalong with the Program.\n\nYou may charge a fee for the physical act of transferring a copy, and\nyou may at your option offer warranty protection in exchange for a fee.\n\n 2. You may modify your copy or copies of the Program or any portion\nof it, thus forming a work based on the Program, and copy and\ndistribute such modifications or work under the terms of Section 1\nabove, provided that you also meet all of these conditions:\n\n a) You must cause the modified files to carry prominent notices\n stating that you changed the files and the date of any change.\n\n b) You must cause any work that you distribute or publish, that in\n whole or in part contains or is derived from the Program or any\n part thereof, to be licensed as a whole at no charge to all third\n parties under the terms of this License.\n\n c) If the modified program normally reads commands interactively\n when run, you must cause it, when started running for such\n interactive use in the most ordinary way, to print or display an\n announcement including an appropriate copyright notice and a\n notice that there is no warranty (or else, saying that you provide\n a warranty) and that users may redistribute the program under\n these conditions, and telling the user how to view a copy of this\n License. (Exception: if the Program itself is interactive but\n does not normally print such an announcement, your work based on\n the Program is not required to print an announcement.)\n\nThese requirements apply to the modified work as a whole. If\nidentifiable sections of that work are not derived from the Program,\nand can be reasonably considered independent and separate works in\nthemselves, then this License, and its terms, do not apply to those\nsections when you distribute them as separate works. But when you\ndistribute the same sections as part of a whole which is a work based\non the Program, the distribution of the whole must be on the terms of\nthis License, whose permissions for other licensees extend to the\nentire whole, and thus to each and every part regardless of who wrote it.\n\nThus, it is not the intent of this section to claim rights or contest\nyour rights to work written entirely by you; rather, the intent is to\nexercise the right to control the distribution of derivative or\ncollective works based on the Program.\n\nIn addition, mere aggregation of another work not based on the Program\nwith the Program (or with a work based on the Program) on a volume of\na storage or distribution medium does not bring the other work under\nthe scope of this License.\n\n 3. You may copy and distribute the Program (or a work based on it,\nunder Section 2) in object code or executable form under the terms of\nSections 1 and 2 above provided that you also do one of the following:\n\n a) Accompany it with the complete corresponding machine-readable\n source code, which must be distributed under the terms of Sections\n 1 and 2 above on a medium customarily used for software interchange; or,\n\n b) Accompany it with a written offer, valid for at least three\n years, to give any third party, for a charge no more than your\n cost of physically performing source distribution, a complete\n machine-readable copy of the corresponding source code, to be\n distributed under the terms of Sections 1 and 2 above on a medium\n customarily used for software interchange; or,\n\n c) Accompany it with the information you received as to the offer\n to distribute corresponding source code. (This alternative is\n allowed only for noncommercial distribution and only if you\n received the program in object code or executable form with such\n an offer, in accord with Subsection b above.)\n\nThe source code for a work means the preferred form of the work for\nmaking modifications to it. For an executable work, complete source\ncode means all the source code for all modules it contains, plus any\nassociated interface definition files, plus the scripts used to\ncontrol compilation and installation of the executable. However, as a\nspecial exception, the source code distributed need not include\nanything that is normally distributed (in either source or binary\nform) with the major components (compiler, kernel, and so on) of the\noperating system on which the executable runs, unless that component\nitself accompanies the executable.\n\nIf distribution of executable or object code is made by offering\naccess to copy from a designated place, then offering equivalent\naccess to copy the source code from the same place counts as\ndistribution of the source code, even though third parties are not\ncompelled to copy the source along with the object code.\n\n 4. You may not copy, modify, sublicense, or distribute the Program\nexcept as expressly provided under this License. Any attempt\notherwise to copy, modify, sublicense or distribute the Program is\nvoid, and will automatically terminate your rights under this License.\nHowever, parties who have received copies, or rights, from you under\nthis License will not have their licenses terminated so long as such\nparties remain in full compliance.\n\n 5. You are not required to accept this License, since you have not\nsigned it. However, nothing else grants you permission to modify or\ndistribute the Program or its derivative works. These actions are\nprohibited by law if you do not accept this License. Therefore, by\nmodifying or distributing the Program (or any work based on the\nProgram), you indicate your acceptance of this License to do so, and\nall its terms and conditions for copying, distributing or modifying\nthe Program or works based on it.\n\n 6. Each time you redistribute the Program (or any work based on the\nProgram), the recipient automatically receives a license from the\noriginal licensor to copy, distribute or modify the Program subject to\nthese terms and conditions. You may not impose any further\nrestrictions on the recipients' exercise of the rights granted herein.\nYou are not responsible for enforcing compliance by third parties to\nthis License.\n\n 7. If, as a consequence of a court judgment or allegation of patent\ninfringement or for any other reason (not limited to patent issues),\nconditions are imposed on you (whether by court order, agreement or\notherwise) that contradict the conditions of this License, they do not\nexcuse you from the conditions of this License. If you cannot\ndistribute so as to satisfy simultaneously your obligations under this\nLicense and any other pertinent obligations, then as a consequence you\nmay not distribute the Program at all. For example, if a patent\nlicense would not permit royalty-free redistribution of the Program by\nall those who receive copies directly or indirectly through you, then\nthe only way you could satisfy both it and this License would be to\nrefrain entirely from distribution of the Program.\n\nIf any portion of this section is held invalid or unenforceable under\nany particular circumstance, the balance of the section is intended to\napply and the section as a whole is intended to apply in other\ncircumstances.\n\nIt is not the purpose of this section to induce you to infringe any\npatents or other property right claims or to contest validity of any\nsuch claims; this section has the sole purpose of protecting the\nintegrity of the free software distribution system, which is\nimplemented by public license practices. Many people have made\ngenerous contributions to the wide range of software distributed\nthrough that system in reliance on consistent application of that\nsystem; it is up to the author/donor to decide if he or she is willing\nto distribute software through any other system and a licensee cannot\nimpose that choice.\n\nThis section is intended to make thoroughly clear what is believed to\nbe a consequence of the rest of this License.\n\n 8. If the distribution and/or use of the Program is restricted in\ncertain countries either by patents or by copyrighted interfaces, the\noriginal copyright holder who places the Program under this License\nmay add an explicit geographical distribution limitation excluding\nthose countries, so that distribution is permitted only in or among\ncountries not thus excluded. In such case, this License incorporates\nthe limitation as if written in the body of this License.\n\n 9. The Free Software Foundation may publish revised and/or new versions\nof the General Public License from time to time. Such new versions will\nbe similar in spirit to the present version, but may differ in detail to\naddress new problems or concerns.\n\nEach version is given a distinguishing version number. If the Program\nspecifies a version number of this License which applies to it and \"any\nlater version\", you have the option of following the terms and conditions\neither of that version or of any later version published by the Free\nSoftware Foundation. If the Program does not specify a version number of\nthis License, you may choose any version ever published by the Free Software\nFoundation.\n\n 10. If you wish to incorporate parts of the Program into other free\nprograms whose distribution conditions are different, write to the author\nto ask for permission. For software which is copyrighted by the Free\nSoftware Foundation, write to the Free Software Foundation; we sometimes\nmake exceptions for this. Our decision will be guided by the two goals\nof preserving the free status of all derivatives of our free software and\nof promoting the sharing and reuse of software generally.\n\n NO WARRANTY\n\n 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY\nFOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN\nOTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES\nPROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED\nOR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS\nTO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE\nPROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,\nREPAIR OR CORRECTION.\n\n 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\nWILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR\nREDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,\nINCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING\nOUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED\nTO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY\nYOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER\nPROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGES.\n\n END OF TERMS AND CONDITIONS\n\n How to Apply These Terms to Your New Programs\n\n If you develop a new program, and you want it to be of the greatest\npossible use to the public, the best way to achieve this is to make it\nfree software which everyone can redistribute and change under these terms.\n\n To do so, attach the following notices to the program. It is safest\nto attach them to the start of each source file to most effectively\nconvey the exclusion of warranty; and each file should have at least\nthe \"copyright\" line and a pointer to where the full notice is found.\n\n {description}\n Copyright (C) {year} {fullname}\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 along\n with this program; if not, write to the Free Software Foundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n\nAlso add information on how to contact you by electronic and paper mail.\n\nIf the program is interactive, make it output a short notice like this\nwhen it starts in an interactive mode:\n\n Gnomovision version 69, Copyright (C) year name of author\n Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\n This is free software, and you are welcome to redistribute it\n under certain conditions; type `show c' for details.\n\nThe hypothetical commands `show w' and `show c' should show the appropriate\nparts of the General Public License. Of course, the commands you use may\nbe called something other than `show w' and `show c'; they could even be\nmouse-clicks or menu items--whatever suits your program.\n\nYou should also get your employer (if you work as a programmer) or your\nschool, if any, to sign a \"copyright disclaimer\" for the program, if\nnecessary. Here is a sample; alter the names:\n\n Yoyodyne, Inc., hereby disclaims all copyright interest in the program\n `Gnomovision' (which makes passes at compilers) written by James Hacker.\n\n {signature of Ty Coon}, 1 April 1989\n Ty Coon, President of Vice\n\nThis General Public License does not permit incorporating your program into\nproprietary programs. If your program is a subroutine library, you may\nconsider it more useful to permit linking proprietary applications with the\nlibrary. If this is what you want to do, use the GNU Lesser General\nPublic License instead of this License.\n\n" }, { "path": "README.md", "content": "# cloc\n*Count Lines of Code*\n\n* * *\ncloc counts blank lines, comment lines, and physical lines of source code in many programming languages.\n\nLatest release: v2.08 (Jan. 24, 2026)\n\n[![Version](https://img.shields.io/badge/version-2.08-blue.svg)](https://github.com/AlDanial/cloc)\n[![Contributors](https://img.shields.io/github/contributors/AlDanial/cloc.svg)](https://github.com/AlDanial/cloc/graphs/contributors)\n[![DOI](https://zenodo.org/badge/doi/10.5281/zenodo.42029482.svg)](https://doi.org/10.5281/zenodo.42029482)\n[![Forks](https://img.shields.io/github/forks/AlDanial/cloc.svg)](https://github.com/AlDanial/cloc/network/members)\n[![Downloads](https://img.shields.io/github/downloads/AlDanial/cloc/total.svg)]()\n\ncloc moved to GitHub in September 2015 after being hosted\nat http://cloc.sourceforge.net/ since August 2006.\n\n# Quick Start\n\n\n\nStep 1: Install cloc (see [Install from Github Releases](#install-from-github-releases)\nand [Install via package manager](#install-via-package-manager)) or run cloc's\n[docker image](#run-via-docker). The Windows executable has no requirements.\nThe source version of cloc requires a Perl interpreter, and the\nDocker version of cloc requires a Docker installation.\n\nStep 2: Open a terminal (`cmd.exe` on Windows).\n\nStep 3: Invoke cloc to count your source files, directories, archives,\nor git commits.\nThe executable name differs depending on whether you use the\ndevelopment source version (`cloc`), source for a\nreleased version (`cloc-2.08.pl`) or a Windows executable\n(`cloc-2.08.exe`).\n\nOn this page, `cloc` is the generic term\nused to refer to any of these.\n\n[Include Security](https://www.youtube.com/user/IncludeSecurity) has a\n[YouTube video](https://www.youtube.com/watch?v=eRLTkDMsCqs)\nshowing the steps in action.\n\n**a file**\n```\nprompt> cloc hello.c\n 1 text file.\n 1 unique file.\n 0 files ignored.\n\nhttps://github.com/AlDanial/cloc v 1.65 T=0.04 s (28.3 files/s, 340.0 lines/s)\n-------------------------------------------------------------------------------\nLanguage files blank comment code\n-------------------------------------------------------------------------------\nC 1 0 7 5\n-------------------------------------------------------------------------------\n```\n\n**a directory**\n```\nprompt> cloc gcc-5.2.0/gcc/c\n 16 text files.\n 15 unique files.\n 3 files ignored.\n\nhttps://github.com/AlDanial/cloc v 1.65 T=0.23 s (57.1 files/s, 188914.0 lines/s)\n-------------------------------------------------------------------------------\nLanguage files blank comment code\n-------------------------------------------------------------------------------\nC 10 4680 6621 30812\nC/C++ Header 3 99 286 496\n-------------------------------------------------------------------------------\nSUM: 13 4779 6907 31308\n-------------------------------------------------------------------------------\n```\n\n**an archive**\n\nWe'll pull cloc's source zip file from GitHub, then count the contents:\n```\nprompt> wget https://github.com/AlDanial/cloc/archive/master.zip\n\nprompt> cloc master.zip\nhttps://github.com/AlDanial/cloc v 1.65 T=0.07 s (26.8 files/s, 141370.3 lines/s)\n-------------------------------------------------------------------------------\nLanguage files blank comment code\n-------------------------------------------------------------------------------\nPerl 2 725 1103 8713\n-------------------------------------------------------------------------------\nSUM: 2 725 1103 8713\n-------------------------------------------------------------------------------\n```\n\n**a git repository, using a specific commit**\n\nThis example uses code from\nPuDB, a fantastic Python debugger.\n\n```\nprompt> git clone https://github.com/inducer/pudb.git\n\nprompt> cd pudb\n\nprompt> cloc 6be804e07a5db\n 48 text files.\n 41 unique files. \n 8 files ignored.\n\ngithub.com/AlDanial/cloc v 1.99 T=0.04 s (1054.9 files/s, 189646.8 lines/s)\n-------------------------------------------------------------------------------\nLanguage files blank comment code\n-------------------------------------------------------------------------------\nPython 28 1519 728 4659\nreStructuredText 6 102 20 203\nYAML 2 9 2 75\nBourne Shell 3 6 0 17\nText 1 0 0 11\nmake 1 4 6 10\n-------------------------------------------------------------------------------\nSUM: 41 1640 756 4975\n-------------------------------------------------------------------------------\n```\n\n**each subdirectory of a particular directory**\n\nSay you have a directory with three different git-managed projects,\nProject0, Project1, and Project2. You can use your shell's looping\ncapability to count the code in each. This example uses bash (scroll down for cmd.exe example):\n```\nprompt> for d in ./*/ ; do (cd \"$d\" && echo \"$d\" && cloc --vcs git); done\n./Project0/\n7 text files.\n 7 unique files.\n 1 file ignored.\n\ngithub.com/AlDanial/cloc v 1.71 T=0.02 s (390.2 files/s, 25687.6 lines/s)\n-------------------------------------------------------------------------------\nLanguage files blank comment code\n-------------------------------------------------------------------------------\nD 4 61 32 251\nMarkdown 1 9 0 38\nmake 1 0 0 4\n-------------------------------------------------------------------------------\nSUM: 6 70 32 293\n-------------------------------------------------------------------------------\n./Project1/\n 7 text files.\n 7 unique files.\n 0 files ignored.\n\ngithub.com/AlDanial/cloc v 1.71 T=0.02 s (293.0 files/s, 52107.1 lines/s)\n-------------------------------------------------------------------------------\nLanguage files blank comment code\n-------------------------------------------------------------------------------\nGo 7 165 282 798\n-------------------------------------------------------------------------------\nSUM: 7 165 282 798\n-------------------------------------------------------------------------------\n./Project2/\n 49 text files.\n 47 unique files.\n 13 files ignored.\n\ngithub.com/AlDanial/cloc v 1.71 T=0.10 s (399.5 files/s, 70409.4 lines/s)\n-------------------------------------------------------------------------------\nLanguage files blank comment code\n-------------------------------------------------------------------------------\nPython 33 1226 1026 3017\nC 4 327 337 888\nMarkdown 1 11 0 28\nYAML 1 0 2 12\n-------------------------------------------------------------------------------\nSUM: 39 1564 1365 3945\n-------------------------------------------------------------------------------\n```\n\n**each subdirectory of a particular directory (Windows/cmd.exe)**\n```\nfor /D %I in (.\\*) do cd %I && cloc --vcs git && cd ..\n```\n\n# Overview\n\ncloc counts blank lines, comment lines, and physical lines of source\ncode in [many programming languages](#recognized-languages). Given two versions of\na code base, cloc can compute differences in blank, comment, and source\nlines. It is written entirely in Perl with no dependencies outside the\nstandard distribution of Perl v5.6 and higher (code from some external\nmodules is [embedded within\ncloc](https://github.com/AlDanial/cloc#regexp_common)) and so is\nquite portable. cloc is known to run on many flavors of Linux, FreeBSD,\nNetBSD, OpenBSD, macOS, AIX, HP-UX, Solaris, IRIX, z/OS, and Windows.\n(To run the Perl source version of cloc on Windows one needs\n[ActiveState Perl](http://www.activestate.com/activeperl) 5.6.1 or\nhigher, [Strawberry Perl](http://strawberryperl.com/),\nWindows Subsystem for Linux,\n[Cygwin](http://www.cygwin.com/),\n[MobaXTerm](http://mobaxterm.mobatek.net/) with the Perl plug-in\ninstalled,\nor\na mingw environment and terminal such as provided by\n[Git for Windows](https://gitforwindows.org/).\nAlternatively one can use the Windows binary of cloc\ngenerated with [PAR::Packer](http://search.cpan.org/~rschupp/PAR-Packer-1.019/lib/pp.pm)\nto run on Windows computers that have neither Perl nor Cygwin.)\n\nIn addition to counting code in individual text files, directories,\nand git repositories, cloc can also count code in archive files such\nas ``.tar`` (including compressed versions), ``.zip``, Python\nwheel ``.whl``, Jupyter notebook ``.ipynb``, source RPMs ``.rpm``\nor ``.src`` (requires ``rpm2cpio``),\nand Debian ``.deb`` files (requires ``dpkg-deb``).\n\ncloc contains code from David Wheeler's\n[SLOCCount](http://www.dwheeler.com/sloccount/),\nDamian Conway and Abigail's Perl module\n[Regexp::Common](http://search.cpan.org/%7Eabigail/Regexp-Common-2.120/lib/Regexp/Common.pm),\nSean M. Burke's Perl module\n[Win32::Autoglob](http://search.cpan.org/%7Esburke/Win32-Autoglob-1.01/Autoglob.pm),\nand Tye McQueen's Perl module\n[Algorithm::Diff](http://search.cpan.org/%7Etyemq/Algorithm-Diff-1.1902/lib/Algorithm/Diff.pm).\nLanguage scale factors were derived from Mayes Consulting, LLC web site\nhttp://softwareestimator.com/IndustryData2.htm.\n\nNew releases nominally appear every six months.\n\n## Install from Github Releases\n\nGrab the latest release of cloc from the [Releases section of this repository](https://github.com/AlDanial/cloc/releases).\n\n### Source version on Linux/macOS\n\nSave the latest source file, for example `cloc-2.08.pl`,\nas `cloc` (if you prefer the shorter command name) somewhere on your `PATH`.\nAfter downloading, make the file executable:\n\n```shell\ncd ~/Downloads\nmv cloc-2.08.pl cloc\nchmod a+rx cloc\n./cloc --version # make sure it runs\nmv cloc ~/bin # for example, if ~/bin is in $PATH\n```\n\n### Source version on Windows\n\nYou'll need a Perl interpreter such as [Strawberry Perl](http://strawberryperl.com/)\ninstalled to run the source version of cloc.\nAfter downloading the cloc source file, open a command prompt or PowerShell window,\nnavigate to the download directory (`C:\\TEMP` in the example below), then test cloc with:\n\n```dos\ncd C:\\TEMP>\nC:TEMP\\> perl cloc-2.08.pl --version\n```\n\n### Binary version on Windows\n\nDownload the latest released Windows executable, for example `cloc-2.08.exe`\nand save it as `cloc.exe` (if desired) in a directory on your `PATH`.\n\nThere is no binary version for Linux or macOS.\n\n## Install via package manager\nDepending your operating system, one of these installation methods may\nwork for you (all but the last two entries for Windows require\na Perl interpreter):\n\n npm install -g cloc # https://www.npmjs.com/package/cloc\n sudo apt install cloc # Debian, Ubuntu\n sudo yum install cloc # Red Hat, Fedora\n sudo dnf install cloc # Fedora 22 or later\n sudo pacman -S cloc # Arch\n yay -S cloc-git # Arch AUR (latest git version)\n sudo emerge -av dev-util/cloc # Gentoo https://packages.gentoo.org/packages/dev-util/cloc\n sudo apk add cloc # Alpine Linux\n doas pkg_add cloc # OpenBSD\n sudo pkg install cloc # FreeBSD\n sudo port install cloc # macOS with MacPorts\n brew install cloc # macOS with Homebrew\n winget install AlDanial.Cloc # Windows with winget (might not work, ref https://github.com/AlDanial/cloc/issues/849)\n choco install cloc # Windows with Chocolatey\n scoop install cloc # Windows with Scoop\n\n**Note**: I don't control any of these packages.\nIf you encounter a bug in cloc using one of the above\npackages, try with cloc pulled from the latest stable release here\non GitHub (link follows below) before submitting a problem report.\n\n## Run via docker\n\nThese docker commands count lines of code in and below\nthe current directory:\n\n```shell\ndocker run --rm -v $PWD:/tmp aldanial/cloc .\n```\n\n### Run via docker on git-bash\n```shell\ndocker run --rm -v \"/$(pwd -W)\":/tmp aldanial/cloc .\n```\n\n## Development version\n\nDownload the cloc source code at https://github.com/AlDanial/cloc/raw/master/cloc and\nsave it as the file `cloc` (or `cloc.pl`, or whatever executable name you wish).\nThe next step depends on the operating system you're using.\n\n# License\n\ncloc is licensed under the\n[GNU General Public License, v 2](http://www.gnu.org/licenses/gpl-2.0.html),\nexcluding portions which\nare copied from other sources. Code\ncopied from the Regexp::Common, Win32::Autoglob, and Algorithm::Diff\nPerl modules is subject to the\n[Artistic License](https://opensource.org/license/artistic-2-0).\n\n# Why Use cloc?\n\ncloc has many features that make it easy to use, thorough, extensible, and portable:\n\n1. Exists as a single, self-contained file that requires minimal installation effort---just download the file and run it.\n2. Can read language comment definitions from a file and thus potentially work with computer languages that do not yet exist.\n3. Allows results from multiple runs to be summed together by language and by project.\n4. Can produce results in a variety of formats: plain text, Markdown, SQL, JSON, XML, YAML, comma separated values.\n5. Can count code within compressed archives (tar balls, Zip files, Java .ear files).\n6. Has numerous troubleshooting options.\n7. Handles file and directory names with spaces and other unusual characters.\n8. Has no dependencies outside the standard Perl distribution.\n9. Runs on Linux, FreeBSD, NetBSD, OpenBSD, macOS, AIX, HP-UX, Solaris, IRIX, and z/OS systems that have Perl 5.6 or higher. The source version runs on Windows with either ActiveState Perl, Strawberry Perl, Cygwin, or MobaXTerm+Perl plugin. Alternatively on Windows one can run the Windows binary which has no dependencies.\n\n# Other Counters\n\nIf cloc does not suit your needs here are other freely available counters to consider:\n\n* [loc](https://github.com/cgag/loc/)\n* [gcloc](https://github.com/JoaoDanielRufino/gcloc)\n* [gocloc](https://github.com/hhatto/gocloc/)\n* [Ohcount](https://github.com/blackducksoftware/ohcount/)\n* [scc](https://github.com/boyter/scc/)\n* [sclc](https://code.google.com/archive/p/sclc/)\n* [SLOCCount](http://www.dwheeler.com/sloccount/)\n* [Sonar](http://www.sonarsource.org/)\n* [tokei](https://github.com/Aaronepower/tokei/)\n* [Unified Code Count](http://csse.usc.edu/ucc_new/wordpress/)\n\nOther references:\n\n* QSM's [directory](http://www.qsm.com/CodeCounters.html) of code counting tools.\n* The [Wikipedia entry](http://en.wikipedia.org/wiki/Source_lines_of_code) for source code line counts.\n\n# Regexp::Common, Digest::MD5, Win32::Autoglob, Algorithm::Diff\n\nAlthough cloc does not need Perl modules outside those found in the\nstandard distribution, cloc does rely on a few external modules. Code\nfrom three of these external modules--Regexp::Common, Win32::Autoglob,\nand Algorithm::Diff--is embedded within cloc. A fourth module,\nDigest::MD5, is used only if it is available. If cloc finds\nRegexp::Common or Algorithm::Diff installed locally it will use those\ninstallation. If it doesn't, cloc will install the parts of\nRegexp::Common and/or Algorithm:Diff it needs to temporary directories\nthat are created at the start of a cloc run then removed when the run is\ncomplete. The necessary code from Regexp::Common v2.120 and\nAlgorithm::Diff v1.1902 are embedded within the cloc source code (see\nsubroutines `Install_Regexp_Common()` and `Install_Algorithm_Diff()` ).\nOnly three lines are needed from Win32::Autoglob and these are included\ndirectly in cloc.\n\nAdditionally, cloc will use Digest::MD5 to validate uniqueness among\nequally-sized input files if Digest::MD5 is installed locally.\n\nA parallel processing option, `--processes=*N*`, was introduced with\ncloc version 1.76 to enable faster runs on multi-core machines. However,\nto use it, one must have the module Parallel::ForkManager installed.\nThis module does not work reliably on Windows so parallel processing\nwill only work on Unix-like operating systems.\n\nThe Windows binary is built on a computer that has both Regexp::Common\nand Digest::MD5 installed locally.\n\n# Building a Windows Executable\n\n#### Create your own executable\nThe most robust option for creating a Windows executable of\ncloc is to use [ActiveState's Perl Development Kit](http://www.activestate.com/perl-dev-kit).\nIt includes a utility, `perlapp`, which can build stand-alone\nWindows, Mac, and Linux binaries of Perl source code.\n\n[perl2exe](http://www.indigostar.com/perl2exe/)\nwill also do the trick. If you do have `perl2exe`, modify lines\n84-87 in the cloc source code for a minor code\nmodification that is necessary to make a cloc Windows executable.\n\nOtherwise, to build a Windows executable with `pp` from\n`PAR::Packer`, first install a Windows-based Perl distribution\n(for example Strawberry Perl or ActivePerl) following their\ninstructions. Next, open a command prompt, aka a DOS window and install\nthe PAR::Packer module. Finally, invoke the newly installed `pp`\ncommand with the cloc source code to create an `.exe` file:\n\n```\nC:> cpan -i Digest::MD5\nC:> cpan -i Regexp::Common\nC:> cpan -i Algorithm::Diff\nC:> cpan -i PAR::Packer\nC:> cpan -i Win32::LongPath\nC:> pp -M Win32::LongPath -M Encode::Unicode -M Digest::MD5 -c -x -o cloc-2.08.exe cloc-2.08.pl\n```\n\nA variation on the instructions above is if you installed the portable\nversion of Strawberry Perl, you will need to run `portableshell.bat` first\nto properly set up your environment.\n\nThe Windows executable in the Releases section, `cloc-2.08.exe`,\nwas built on a 64 bit Windows 11 computer using\n[Strawberry Perl](http://strawberryperl.com/)\n5.32.1 and\n[PAR::Packer](http://search.cpan.org/~rschupp/PAR-Packer-1.064/lib/pp.pm)\nto build the `.exe`.\n\n#### Is the Windows executable safe to run? Does it have malware?\n\nIdeally, no one would need the Windows executable because they\nhave a Perl interpreter installed on their machines and can\nrun the cloc source file.\nOn centrally-managed corporate Windows machines, however, this\nthis may be difficult or impossible.\n\nThe Windows executable distributed with cloc is provided as\na best-effort of a virus and malware-free `.exe`.\nYou are encouraged to run your own virus scanners against the\nexecutable and also check sites such\nhttps://www.virustotal.com/ .\nThe entries for recent versions are:\n\ncloc-2.08.exe:\nhttps://www.virustotal.com/gui/file/4529557d957ade0dd45746eae10e9c51ee01061bb617eeeab256672faf6e42c6?nocache=1\n\ncloc-2.06.exe:\nhttps://www.virustotal.com/gui/file/bbe48de9102d0f2520d292d65897001c1d068340eb7cd74dd1ee30c1a9091c4a?nocache=1\n\ncloc-2.04.exe:\nhttps://www.virustotal.com/gui/file/89cda0038bf4e13c6c13ebc1e60bec4dfad362e69ac8a5b8e2d5ebe3020359e1\n\ncloc-2.02-winget.exe: (includes [PR 850](https://github.com/AlDanial/cloc/pull/850) to allow\n[running from a symlink on Windows](https://github.com/AlDanial/cloc/issues/849))\nhttps://www.virustotal.com/gui/file/be033061e091fea48a5bc9e8964cee0416ddd5b34bd5226a1c9aa4b30bdba66a?nocache=1\n\ncloc-2.02.exe:\nhttps://www.virustotal.com/gui/file/369ed76125f7399cd582d169adf39a2e08ae5066031fea0cc8b2836ea50e7ce2?nocache=1\n\ncloc-2.00.exe:\nhttps://www.virustotal.com/gui/file/7a234ef0cb495de1b5776acf88c5554e2bab1fb02725a5fb85756a6db3121c1f\n\n#### Why is the Windows executable so large?\n\nWindows executables of cloc versions 1.60 and earlier, created with\nperl2exe as noted above, are about 1.6 MB, while versions 1.62 and 1.54, created\nwith `PAR::Packer`, are 11 MB.\nVersion 1.66, built with a newer version of `PAR::Packer`, is about 5.5 MB.\nWhy are the `PAR::Packer`, executables so\nmuch larger than those built with perl2exe? My theory is that perl2exe\nuses smarter tree pruning logic\nthan `PAR::Packer`, but that's pure speculation.\n\n# Basic Use\n\ncloc is a command line program that takes file, directory, and/or\narchive names as inputs. Here's an example of running cloc against the\nPerl v5.22.0 source distribution:\n\n```\nprompt> cloc perl-5.22.0.tar.gz\n 5605 text files.\n 5386 unique files.\n 2176 files ignored.\n\nhttps://github.com/AlDanial/cloc v 1.65 T=25.49 s (134.7 files/s, 51980.3 lines/s)\n-----------------------------------------------------------------------------------\nLanguage files blank comment code\n-----------------------------------------------------------------------------------\nPerl 2892 136396 184362 536445\nC 130 24676 33684 155648\nC/C++ Header 148 9766 16569 147858\nBourne Shell 112 4044 6796 42668\nPascal 8 458 1603 8592\nXML 33 142 0 2410\nYAML 49 20 15 2078\nC++ 10 313 277 2033\nmake 4 426 488 1986\nProlog 12 438 2 1146\nJSON 14 1 0 1037\nyacc 1 85 76 998\nWindows Message File 1 102 11 489\nDOS Batch 14 92 41 389\nWindows Resource File 3 10 0 85\nD 1 5 7 8\nLisp 2 0 3 4\n-----------------------------------------------------------------------------------\nSUM: 3434 176974 243934 903874\n-----------------------------------------------------------------------------------\n\n```\n\nTo run cloc on Windows computers, open up a command (aka DOS) window\nand invoke cloc.exe from the command line there.\nAlternatively, try ClocViewer, the GUI wrapper around cloc found at\nhttps://github.com/Roemer/ClocViewer.\n\nSee also https://github.com/jmensch1/codeflower for a\ngraphical rendering of cloc results.\n\n# GUI Frontends\n\nSeveral GUI frontends to cloc are available:\n\n* [cloctui](https://github.com/edward-jazzhands/cloctui)\n* [ClocViewer](https://github.com/Roemer/ClocViewer)\n* [codeflower](https://github.com/jmensch1/codeflower)\n\n# Options\n\n
\nFull options list (cloc --help) (click the triangle to see all option)\n\n```\nprompt> cloc --help\n\nUsage: cloc [options] | | \n\n Count, or compute differences of, physical lines of source code in the\n given files (may be archives such as compressed tarballs or zip files,\n or git commit hashes or branch names) and/or recursively below the\n given directories.\n\n Input Options\n --extract-with= This option is only needed if cloc is unable\n to figure out how to extract the contents of\n the input file(s) by itself.\n Use to extract binary archive files (e.g.:\n .tar.gz, .zip, .Z). Use the literal '>FILE<' as\n a stand-in for the actual file(s) to be\n extracted. For example, to count lines of code\n in the input files\n gcc-4.2.tar.gz perl-5.8.8.tar.gz\n on Unix use\n --extract-with='gzip -dc >FILE< | tar xf -'\n or, if you have GNU tar,\n --extract-with='tar zxf >FILE<'\n and on Windows use, for example:\n --extract-with=\"\\\"c:\\Program Files\\WinZip\\WinZip32.exe\\\" -e -o >FILE< .\"\n (if WinZip is installed there).\n --list-file= Take the list of file and/or directory names to\n process from , which has one file/directory\n name per line. Only exact matches are counted;\n relative path names will be resolved starting from\n the directory where cloc is invoked. Set \n to - to read file names from a STDIN pipe.\n See also --exclude-list-file.\n --diff-list-file= Take the pairs of file names to be diff'ed from\n , whose format matches the output of\n --diff-alignment. (Run with that option to\n see a sample.) The language identifier at the\n end of each line is ignored. This enables --diff\n mode and bypasses file pair alignment logic.\n --vcs= Invoke a system call to to obtain a list of\n files to work on. If is 'git', then will\n invoke 'git ls-files' to get a file list and\n 'git submodule status' to get a list of submodules\n whose contents will be ignored. See also --git\n which accepts git commit hashes and branch names.\n If is 'svn' then will invoke 'svn list -R'.\n The primary benefit is that cloc will then skip\n files explicitly excluded by the versioning tool\n in question, ie, those in .gitignore or have the\n svn:ignore property.\n Alternatively may be any system command\n that generates a list of files.\n Note: cloc must be in a directory which can read\n the files as they are returned by . cloc will\n not download files from remote repositories.\n 'svn list -R' may refer to a remote repository\n to obtain file names (and therefore may require\n authentication to the remote repository), but\n the files themselves must be local.\n Setting to 'auto' selects between 'git'\n and 'svn' (or neither) depending on the presence\n of a .git or .svn subdirectory below the directory\n where cloc is invoked. --files-from is a synonym\n for --vcs.\n --unicode Check binary files to see if they contain Unicode\n expanded ASCII text. This causes performance to\n drop noticeably.\n\n Processing Options\n --autoconf Count .in files (as processed by GNU autoconf) of\n recognized languages. See also --no-autogen.\n --by-file Report results for every source file encountered.\n --by-file-by-lang Report results for every source file encountered\n in addition to reporting by language.\n --config Read command line switches from instead of\n the default location of /home/al/.config/cloc/options.txt.\n The file should contain one switch, along with\n arguments (if any), per line. Blank lines and lines\n beginning with '#' are skipped. Options given on\n the command line take priority over entries read from\n the file.\n --count-and-diff \n First perform direct code counts of source file(s)\n of and separately, then perform a diff\n of these. Inputs may be pairs of files, directories,\n or archives. If --out or --report-file is given,\n three output files will be created, one for each\n of the two counts and one for the diff. See also\n --diff, --diff-alignment, --diff-timeout,\n --ignore-case, --ignore-whitespace.\n --diff Compute differences in code and comments between\n source file(s) of and . The inputs\n may be any mix of files, directories, archives,\n or git commit hashes. Use --diff-alignment to\n generate a list showing which file pairs where\n compared. When comparing git branches, only files\n which have changed in either commit are compared.\n See also --git, --count-and-diff, --diff-alignment,\n --diff-list-file, --diff-timeout, --ignore-case,\n --ignore-whitespace.\n --diff-timeout Ignore files which take more than seconds\n to process. Default is 10 seconds. Setting \n to 0 allows unlimited time. (Large files with many\n repeated lines can cause Algorithm::Diff::sdiff()\n to take hours.) See also --timeout.\n --docstring-as-code cloc considers docstrings to be comments, but this is\n not always correct as docstrings represent regular\n strings when they appear on the right hand side of an\n assignment or as function arguments. This switch\n forces docstrings to be counted as code.\n --follow-links [Unix only] Follow symbolic links to directories\n (sym links to files are always followed).\n See also --stat.\n --force-lang=[,]\n Process all files that have a extension\n with the counter for language . For\n example, to count all .f files with the\n Fortran 90 counter (which expects files to\n end with .f90) instead of the default Fortran 77\n counter, use\n --force-lang=\"Fortran 90,f\"\n If is omitted, every file will be counted\n with the counter. This option can be\n specified multiple times (but that is only\n useful when is given each time).\n See also --script-lang, --lang-no-ext.\n --force-lang-def= Load language processing filters from ,\n then use these filters instead of the built-in\n filters. Note: languages which map to the same\n file extension (for example:\n MATLAB/Mathematica/Objective-C/MUMPS/Mercury;\n Pascal/PHP; Lisp/OpenCL; Lisp/Julia; Perl/Prolog)\n will be ignored as these require additional\n processing that is not expressed in language\n definition files. Use --read-lang-def to define\n new language filters without replacing built-in\n filters (see also --write-lang-def,\n --write-lang-def-incl-dup).\n --git Forces the inputs to be interpreted as git targets\n (commit hashes, branch names, et cetera) if these\n are not first identified as file or directory\n names. This option overrides the --vcs=git logic\n if this is given; in other words, --git gets its\n list of files to work on directly from git using\n the hash or branch name rather than from\n 'git ls-files'. This option can be used with\n --diff to perform line count diffs between git\n commits, or between a git commit and a file,\n directory, or archive. Use -v/--verbose to see\n the git system commands cloc issues.\n --git-diff-rel Same as --git --diff, or just --diff if the inputs\n are recognized as git targets. Only files which\n have changed in either commit are compared.\n --git-diff-all Git diff strategy #2: compare all files in the\n repository between the two commits.\n --ignore-whitespace Ignore horizontal white space when comparing files\n with --diff. See also --ignore-case.\n --ignore-case Ignore changes in case within file contents;\n consider upper- and lowercase letters equivalent\n when comparing files with --diff. See also\n --ignore-whitespace.\n --ignore-case-ext Ignore case of file name extensions. This will\n cause problems counting some languages\n (specifically, .c and .C are associated with C and\n C++; this switch would count .C files as C rather\n than C++ on *nix operating systems). File name\n case insensitivity is always true on Windows.\n --lang-no-ext= Count files without extensions using the \n counter. This option overrides internal logic\n for files without extensions (where such files\n are checked against known scripting languages\n by examining the first line for #!). See also\n --force-lang, --script-lang.\n --max-file-size= Skip files larger than megabytes when\n traversing directories. By default, =100.\n cloc's memory requirement is roughly twenty times\n larger than the largest file so running with\n files larger than 100 MB on a computer with less\n than 2 GB of memory will cause problems.\n Note: this check does not apply to files\n explicitly passed as command line arguments.\n --no-autogen[=list] Ignore files generated by code-production systems\n such as GNU autoconf. To see a list of these files\n (then exit), run with --no-autogen list\n See also --autoconf.\n --original-dir [Only effective in combination with\n --strip-comments] Write the stripped files\n to the same directory as the original files.\n --read-binary-files Process binary files in addition to text files.\n This is usually a bad idea and should only be\n attempted with text files that have embedded\n binary data.\n --read-lang-def= Load new language processing filters from \n and merge them with those already known to cloc.\n If defines a language cloc already knows\n about, cloc's definition will take precedence.\n Use --force-lang-def to over-ride cloc's\n definitions (see also --write-lang-def,\n --write-lang-def-incl-dup).\n --script-lang=, Process all files that invoke as a #!\n scripting language with the counter for language\n . For example, files that begin with\n #!/usr/local/bin/perl5.8.8\n will be counted with the Perl counter by using\n --script-lang=Perl,perl5.8.8\n The language name is case insensitive but the\n name of the script language executable, ,\n must have the right case. This option can be\n specified multiple times. See also --force-lang,\n --lang-no-ext.\n --sdir= Use as the scratch directory instead of\n letting File::Temp chose the location. Files\n written to this location are not removed at\n the end of the run (as they are with File::Temp).\n --skip-uniqueness Skip the file uniqueness check. This will give\n a performance boost at the expense of counting\n files with identical contents multiple times\n (if such duplicates exist).\n --stat Some file systems (AFS, CD-ROM, FAT, HPFS, SMB)\n do not have directory 'nlink' counts that match\n the number of its subdirectories. Consequently\n cloc may undercount or completely skip the\n contents of such file systems. This switch forces\n File::Find to stat directories to obtain the\n correct count. File search speed will decrease.\n See also --follow-links.\n --stdin-name= Give a file name to use to determine the language\n for standard input. (Use - as the input name to\n receive source code via STDIN.)\n --strip-comments= For each file processed, write to the current\n directory a version of the file which has blank\n and commented lines removed (in-line comments\n persist). The name of each stripped file is the\n original file name with . appended to it.\n It is written to the current directory unless\n --original-dir is on.\n --strip-str-comments Replace comment markers embedded in strings with\n 'xx'. This attempts to work around a limitation\n in Regexp::Common::Comment where comment markers\n embedded in strings are seen as actual comment\n markers and not strings, often resulting in a\n 'Complex regular subexpression recursion limit'\n warning and incorrect counts. There are two\n disadvantages to using this switch: 1/code count\n performance drops, and 2/code generated with\n --strip-comments will contain different strings\n where ever embedded comments are found.\n --sum-reports Input arguments are report files previously\n created with the --report-file option in plain\n format (eg. not JSON, YAML, XML, or SQL).\n Makes a cumulative set of results containing the\n sum of data from the individual report files.\n --timeout Ignore files which take more than seconds\n to process at any of the language's filter stages.\n The default maximum number of seconds spent on a\n filter stage is the number of lines in the file\n divided by one thousand. Setting to 0 allows\n unlimited time. See also --diff-timeout.\n --processes=NUM [Available only on systems with a recent version\n of the Parallel::ForkManager module. Not\n available on Windows.] Sets the maximum number of\n cores that cloc uses. The default value of 0\n disables multiprocessing.\n --unix Override the operating system autodetection\n logic and run in UNIX mode. See also\n --windows, --show-os.\n --use-sloccount If SLOCCount is installed, use its compiled\n executables c_count, java_count, pascal_count,\n php_count, and xml_count instead of cloc's\n counters. SLOCCount's compiled counters are\n substantially faster than cloc's and may give\n a performance improvement when counting projects\n with large files. However, these cloc-specific\n features will not be available: --diff,\n --count-and-diff, --strip-comments, --unicode.\n --windows Override the operating system autodetection\n logic and run in Microsoft Windows mode.\n See also --unix, --show-os.\n\n Filter Options\n --include-content= Only count files containing text that matches the\n given regular expression.\n --exclude-content= Exclude files containing text that matches the given\n regular expression.\n --exclude-dir=[,D2,] Exclude the given comma separated directories\n D1, D2, D3, et cetera, from being scanned. For\n example --exclude-dir=.cache,test will skip\n all files and subdirectories that have /.cache/\n or /test/ as their parent directory.\n Directories named .bzr, .cvs, .hg, .git, .svn,\n and .snapshot are always excluded.\n This option only works with individual directory\n names so including file path separators is not\n allowed. Use --fullpath and --not-match-d=\n to supply a regex matching multiple subdirectories.\n --exclude-ext=[,[...]]\n Do not count files having the given file name\n extensions.\n --exclude-lang=[,L2[...]]\n Exclude the given comma separated languages\n L1, L2, L3, et cetera, from being counted.\n --exclude-list-file= Ignore files and/or directories whose names\n appear in . should have one file\n name per line. Only exact matches are ignored;\n relative path names will be resolved starting from\n the directory where cloc is invoked.\n See also --list-file.\n --fullpath Modifies the behavior of --match-f, --not-match-f,\n and --not-match-d to include the file's path\n in the regex, not just the file's basename.\n (This does not expand each file to include its\n absolute path, instead it uses as much of\n the path as is passed in to cloc.)\n Note: --match-d always looks at the full\n path and therefore is unaffected by --fullpath.\n --include-ext=[,ext2[...]]\n Count only languages having the given comma\n separated file extensions. Use --show-ext to\n see the recognized extensions.\n --include-lang=[,L2[...]]\n Count only the given comma separated languages\n L1, L2, L3, et cetera. Use --show-lang to see\n the list of recognized languages.\n --match-d= Only count files in directories matching the Perl\n regex. For example\n --match-d='/(src|include)/'\n only counts files in directories containing\n /src/ or /include/. Unlike --not-match-d,\n --match-f, and --not-match-f, --match-d always\n compares the fully qualified path against the\n regex.\n --not-match-d= Count all files except those in directories\n matching the Perl regex. Only the trailing\n directory name is compared, for example, when\n counting in /usr/local/lib, only 'lib' is\n compared to the regex.\n Add --fullpath to compare parent directories to\n the regex.\n Do not include file path separators at the\n beginning or end of the regex.\n --match-f= Only count files whose basenames match the Perl\n regex. For example\n --match-f='^[Ww]idget'\n only counts files that start with Widget or widget.\n Add --fullpath to include parent directories\n in the regex instead of just the basename.\n --not-match-f= Count all files except those whose basenames\n match the Perl regex. Add --fullpath to include\n parent directories in the regex instead of just\n the basename.\n --skip-archive= Ignore files that end with the given Perl regular\n expression. For example, if given\n --skip-archive='(zip|tar(.(gz|Z|bz2|xz|7z))?)'\n the code will skip files that end with .zip,\n .tar, .tar.gz, .tar.Z, .tar.bz2, .tar.xz, and\n .tar.7z.\n --skip-win-hidden On Windows, ignore hidden files.\n\n Debug Options\n --categorized= Save file sizes in bytes, identified languages\n and names of categorized files to .\n --counted= Save names of processed source files to .\n --diff-alignment= Write to a list of files and file pairs\n showing which files were added, removed, and/or\n compared during a run with --diff. This switch\n forces the --diff mode on.\n --explain= Print the filters used to remove comments for\n language and exit. In some cases the\n filters refer to Perl subroutines rather than\n regular expressions. An examination of the\n source code may be needed for further explanation.\n --help Print this usage information and exit.\n --found= Save names of every file found to .\n --ignored= Save names of ignored files and the reason they\n were ignored to .\n --print-filter-stages Print processed source code before and after\n each filter is applied.\n --show-ext[=] Print information about all known (or just the\n given) file extensions and exit.\n --show-lang[=] Print information about all known (or just the\n given) languages and exit.\n --show-os Print the value of the operating system mode\n and exit. See also --unix, --windows.\n -v[=] Verbose switch (optional numeric value).\n -verbose[=] Long form of -v.\n --version Print the version of this program and exit.\n --write-lang-def= Writes to the language processing filters\n then exits. Useful as a first step to creating\n custom language definitions. Note: languages which\n map to the same file extension will be excluded.\n (See also --force-lang-def, --read-lang-def).\n --write-lang-def-incl-dup=\n Same as --write-lang-def, but includes duplicated\n extensions. This generates a problematic language\n definition file because cloc will refuse to use\n it until duplicates are removed.\n\n Output Options\n --3 Print third-generation language output.\n (This option can cause report summation to fail\n if some reports were produced with this option\n while others were produced without it.)\n --by-percent X Instead of comment and blank line counts, show\n these values as percentages based on the value\n of X in the denominator:\n X = 'c' -> # lines of code\n X = 'cm' -> # lines of code + comments\n X = 'cb' -> # lines of code + blanks\n X = 'cmb' -> # lines of code + comments + blanks\n For example, if using method 'c' and your code\n has twice as many lines of comments as lines\n of code, the value in the comment column will\n be 200%. The code column remains a line count.\n --csv Write the results as comma separated values.\n --csv-delimiter= Use the character as the delimiter for comma\n separated files instead of ,. This switch forces --csv to be on.\n --file-encoding= Write output files using the encoding instead of\n the default ASCII ( = 'UTF-7'). Examples: 'UTF-16',\n 'euc-kr', 'iso-8859-16'. Known encodings can be\n printed with\n perl -MEncode -e 'print join(\"\\n\", Encode->encodings(\":all\")), \"\\n\"'\n --hide-rate Do not show line and file processing rates in the\n output header. This makes output deterministic.\n --json Write the results as JavaScript Object Notation\n (JSON) formatted output.\n --md Write the results as Markdown-formatted text.\n --out= Synonym for --report-file=.\n --percent Show counts as percentages of sums for each column.\n Same as '--by-percent t'.\n --progress-rate= Show progress update after every files are\n processed (default =100). Set to 0 to\n suppress progress output (useful when redirecting\n output to STDOUT).\n --quiet Suppress all information messages except for\n the final report.\n --report-file= Write the results to instead of STDOUT.\n --sql= Write results as SQL create and insert statements\n which can be read by a database program such as\n SQLite. If is -, output is sent to STDOUT.\n --sql-append Append SQL insert statements to the file specified\n by --sql and do not generate table creation\n statements. Only valid with the --sql option.\n --sql-project= Use as the project identifier for the\n current run. Only valid with the --sql option.\n --sql-style=\n\n\n
\n';\n    print \"<- html_header\\n\" if $opt_v > 2;\n} # 1}}}\nsub html_end {                               # {{{1\nreturn\n'
\n\n\n';\n} # 1}}}\nsub die_unknown_lang { # {{{1\n my ($lang, $option_name) = @_;\n die \"Unknown language '$lang' used with $option_name option. \" .\n \"The command\\n $script --show-lang\\n\" .\n \"will print all recognized languages. Language names are \" .\n \"case sensitive.\\n\" ;\n} # 1}}}\nsub unicode_file { # {{{1\n my $file = shift @_;\n\n print \"-> unicode_file($file)\\n\" if $opt_v > 2;\n return 0 if (get_size($file) > 2_000_000);\n # don't bother trying to test binary files bigger than 2 MB\n\n my $IN = open_file('<', $file, 1);\n if (!defined $IN) {\n warn \"Unable to read $file; ignoring.\\n\";\n return 0;\n }\n my @lines = <$IN>;\n $IN->close;\n\n if (unicode_to_ascii( join('', @lines) )) {\n print \"<- unicode_file()\\n\" if $opt_v > 2;\n return 1;\n } else {\n print \"<- unicode_file()\\n\" if $opt_v > 2;\n return 0;\n }\n\n} # 1}}}\nsub unicode_to_ascii { # {{{1\n my $string = shift @_;\n\n # A trivial attempt to convert UTF-16 little or big endian\n # files into ASCII. These files exhibit the following byte\n # sequence:\n # byte 1: 255\n # byte 2: 254\n # byte 3: ord of ASCII character\n # byte 4: 0\n # byte 3+i: ord of ASCII character\n # byte 4+i: 0\n # or\n # byte 1: 255\n # byte 2: 254\n # byte 3: 0\n # byte 4: ord of ASCII character\n # byte 3+i: 0\n # byte 4+i: ord of ASCII character\n #\n print \"-> unicode_to_ascii()\\n\" if $opt_v > 2;\n\n my $length = length $string;\n#print \"length=$length\\n\";\n return '' if $length <= 3;\n my @unicode = split(//, $string);\n\n # check the first 100 characters (= 200 bytes) for big or\n # little endian UTF-16 encoding\n my $max_peek = $length < 200 ? $length : 200;\n my $max_for_pass = $length < 200 ? 0.9*$max_peek/2 : 90;\n my @view_1 = ();\n for (my $i = 2; $i < $max_peek; $i += 2) { push @view_1, $unicode[$i] }\n my @view_2 = ();\n for (my $i = 3; $i < $max_peek; $i += 2) { push @view_2, $unicode[$i] }\n\n my $points_1 = 0;\n foreach my $C (@view_1) {\n ++$points_1 if (32 <= ord($C) and ord($C) <= 127) or ord($C) == 13\n or ord($C) == 10\n or ord($C) == 9;\n }\n\n my $points_2 = 0;\n foreach my $C (@view_2) {\n ++$points_2 if (32 <= ord($C) and ord($C) <= 127) or ord($C) == 13\n or ord($C) == 10\n or ord($C) == 9;\n }\n#print \"points 1: $points_1\\n\";\n#print \"points 2: $points_2\\n\";\n#print \"max_peek : $max_peek\\n\";\n#print \"max_for_pass: $max_for_pass\\n\";\n\n my $offset = undef;\n if ($points_1 > $max_for_pass) { $offset = 2; }\n elsif ($points_2 > $max_for_pass) { $offset = 3; }\n else {\n print \"<- unicode_to_ascii() a p1=$points_1 p2=$points_2\\n\" if $opt_v > 2;\n return '';\n } # neither big or little endian UTF-16\n\n my @ascii = ();\n for (my $i = $offset; $i < $length; $i += 2) {\n # some compound characters are made of HT (9), LF (10), or CR (13)\n # True HT, LF, CR are followed by 00; only add those.\n my $L = $unicode[$i];\n if (ord($L) == 9 or ord($L) == 10 or ord($L) == 13) {\n my $companion;\n if ($points_1) {\n last if $i+1 >= $length;\n $companion = $unicode[$i+1];\n } else {\n $companion = $unicode[$i-1];\n }\n if (ord($companion) == 0) {\n push @ascii, $L;\n } else {\n push @ascii, \" \"; # no clue what this letter is\n }\n } else {\n push @ascii, $L;\n }\n }\n print \"<- unicode_to_ascii() b p1=$points_1 p2=$points_2\\n\" if $opt_v > 2;\n return join(\"\", @ascii);\n} # 1}}}\nsub uncompress_archive_cmd { # {{{1\n my ($archive_file, ) = @_;\n\n # Wrap $archive_file in single or double quotes in the system\n # commands below to avoid filename chicanery (including\n # spaces in the names).\n\n print \"-> uncompress_archive_cmd($archive_file)\\n\" if $opt_v > 2;\n my $extract_cmd = \"\";\n my $missing = \"\";\n if ($opt_extract_with) {\n ( $extract_cmd = $opt_extract_with ) =~ s/>FILE -\";\n } elsif ($archive_file =~ /\\.tar$/ and $ON_WINDOWS) {\n $extract_cmd = \"tar -xf \\\"$archive_file\\\"\";\n } elsif (($archive_file =~ /\\.tar\\.(gz|Z)$/ or\n $archive_file =~ /\\.tgz$/ ) and !$ON_WINDOWS) {\n if (external_utility_exists(\"gzip --version\")) {\n if (external_utility_exists(\"tar --version\")) {\n $extract_cmd = \"gzip -dc '$archive_file' | tar xf -\";\n } else {\n $missing = \"tar\";\n }\n } else {\n $missing = \"gzip\";\n }\n } elsif ($archive_file =~ /\\.tar\\.bz2$/ and !$ON_WINDOWS) {\n if (external_utility_exists(\"bzip2 --help\")) {\n if (external_utility_exists(\"tar --version\")) {\n $extract_cmd = \"bzip2 -dc '$archive_file' | tar xf -\";\n } else {\n $missing = \"tar\";\n }\n } else {\n $missing = \"bzip2\";\n }\n } elsif ($archive_file =~ /\\.tar\\.xz$/ and !$ON_WINDOWS) {\n if (external_utility_exists(\"unxz --version\")) {\n if (external_utility_exists(\"tar --version\")) {\n $extract_cmd = \"unxz -dc '$archive_file' | tar xf -\";\n } else {\n $missing = \"tar\";\n }\n } else {\n $missing = \"bzip2\";\n }\n } elsif ($archive_file =~ /\\.tar$/ and !$ON_WINDOWS) {\n $extract_cmd = \"tar xf '$archive_file'\";\n } elsif ($archive_file =~ /\\.src\\.rpm$/i and !$ON_WINDOWS) {\n if (external_utility_exists(\"cpio --version\")) {\n if (external_utility_exists(\"rpm2cpio\")) {\n $extract_cmd = \"rpm2cpio '$archive_file' | cpio -i\";\n } else {\n $missing = \"rpm2cpio\";\n }\n } else {\n $missing = \"cpio\";\n }\n } elsif ($archive_file =~ /\\.(whl|zip)$/i and !$ON_WINDOWS) {\n if (external_utility_exists(\"unzip\")) {\n $extract_cmd = \"unzip -qq -d . '$archive_file'\";\n } else {\n $missing = \"unzip\";\n }\n } elsif ($archive_file =~ /\\.deb$/i and !$ON_WINDOWS) {\n # only useful if the .deb contains source code--most\n # .deb files just have compiled executables\n if (external_utility_exists(\"dpkg-deb\")) {\n $extract_cmd = \"dpkg-deb -x '$archive_file' .\";\n } else {\n $missing = \"dpkg-deb\";\n }\n } elsif ($ON_WINDOWS and $archive_file =~ /\\.(whl|zip)$/i) {\n # use unzip on Windows (comes with git-for-Windows)\n if (external_utility_exists(\"unzip\")) {\n $extract_cmd = \"unzip -qq -d . \\\"$archive_file\\\" \";\n } else {\n $missing = \"unzip\";\n }\n }\n print \"<- uncompress_archive_cmd\\n\" if $opt_v > 2;\n if ($missing) {\n die \"Unable to expand $archive_file because external\\n\",\n \"utility '$missing' is not available.\\n\",\n \"Another possibility is to use the --extract-with option.\\n\";\n } else {\n return $extract_cmd;\n }\n}\n# 1}}}\nsub read_list_file { # {{{1\n my ($file, ) = @_;\n # reads filenames from a STDIN pipe if $file == \"-\"\n\n print \"-> read_list_file($file)\\n\" if $opt_v > 2;\n my @entry = ();\n\n if ($file eq \"-\") {\n # read from a STDIN pipe\n my $IN;\n open($IN, $file);\n if (!defined $IN) {\n warn \"Unable to read $file; ignoring.\\n\";\n return ();\n }\n while (<$IN>) {\n next if /^\\s*$/ or /^\\s*#/; # skip empty or commented lines\n s/\\cM$//; # DOS to Unix\n chomp;\n push @entry, $_;\n }\n $IN->close;\n } else {\n # read from an actual file\n foreach my $line (read_file($file)) {\n next if $line =~ /^\\s*$/ or $line =~ /^\\s*#/;\n $line =~ s/\\cM$//; # DOS to Unix\n chomp $line;\n push @entry, $line;\n }\n }\n\n print \"<- read_list_file\\n\" if $opt_v > 2;\n return @entry;\n}\n# 1}}}\nsub external_utility_exists { # {{{1\n my $exe = shift @_;\n\n # remove args, if any\n my $leading_exe = $exe;\n $leading_exe =~ s/^(\\S+)\\s*.*?$/$1/;\n\n my $success = 0;\n if ($ON_WINDOWS) {\n $success = 1 unless system $exe . ' > nul';\n } else {\n $success = 1 unless system $exe . ' >/dev/null 2>&1';\n if (!$success) {\n $success = 1 unless system \"which\" . \" $leading_exe\" . ' >/dev/null 2>&1';\n }\n }\n\n return $success;\n} # 1}}}\nsub write_xsl_file { # {{{1\n print \"-> write_xsl_file\\n\" if $opt_v > 2;\n my $XSL = # {{{2\n'\n\n\n \n \n \n \n CLOC Results\n \n \n \n

\n';\n# 2}}}\n\n if ($opt_by_file) {\n $XSL .= #
{{{2\n' \n \n \n \n \n \n \n \n';\n $XSL .=\n' \n \n' if $opt_3;\n $XSL .=\n' \n \n \n \n \n \n \n \n \n \n';\n $XSL .=\n' \n \n' if $opt_3;\n $XSL .=\n' \n \n \n \n \n \n \n \n';\n $XSL .=\n' \n \n' if $opt_3;\n $XSL .=\n' \n \n
FileBlankCommentCodeLanguage3rd Generation EquivalentScale
Total
\n
\n';\n# 2}}}\n }\n\n if (!$opt_by_file or $opt_by_file_by_lang) {\n $XSL .= #
{{{2\n' \n \n \n \n \n \n \n \n';\n $XSL .=\n' \n \n' if $opt_3;\n $XSL .=\n' \n \n \n \n \n \n \n \n \n \n';\n $XSL .=\n' \n \n' if $opt_3;\n $XSL .=\n' \n \n \n \n \n \n \n \n';\n $XSL .=\n' \n \n' if $opt_3;\n $XSL .=\n' \n \n
LanguageFilesBlankCommentCodeScale3rd Generation Equivalent
Total
\n';\n# 2}}}\n }\n\n $XSL.= <<'EO_XSL'; # {{{2\n \n \n \n\n\nEO_XSL\n# 2}}}\n\n my $XSL_DIFF = <<'EO_DIFF_XSL'; # {{{2\n\n\n\n \n \n \n \n CLOC Results\n \n \n \n

\nEO_DIFF_XSL\n# 2}}}\n\n if ($opt_by_file) {\n $XSL_DIFF.= <<'EO_DIFF_XSL'; # {{{2\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Same
FileBlankCommentCode
\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Modified
FileBlankCommentCode
\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Added
FileBlankCommentCode
\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Removed
FileBlankCommentCode
\nEO_DIFF_XSL\n# 2}}}\n }\n\n if (!$opt_by_file or $opt_by_file_by_lang) {\n $XSL_DIFF.= <<'EO_DIFF_XSL'; # {{{2\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Same
LanguageFilesBlankCommentCode
\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Modified
LanguageFilesBlankCommentCode
\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Added
LanguageFilesBlankCommentCode
\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Removed
LanguageFilesBlankCommentCode
\nEO_DIFF_XSL\n# 2}}}\n\n }\n\n $XSL_DIFF.= <<'EO_DIFF_XSL'; # {{{2\n \n \n \n\nEO_DIFF_XSL\n# 2}}}\n if ($opt_diff) {\n write_file($CLOC_XSL, {}, ( $XSL_DIFF ) );\n } else {\n write_file($CLOC_XSL, {}, ( $XSL ) );\n }\n print \"<- write_xsl_file\\n\" if $opt_v > 2;\n} # 1}}}\nsub normalize_file_names { # {{{1\n print \"-> normalize_file_names\\n\" if $opt_v > 2;\n my (@files, ) = @_;\n\n # Returns a hash of file names reduced to a canonical form\n # (fully qualified file names, all path separators changed to /,\n # Windows file names lowercased). Hash values are the original\n # file name.\n\n my %normalized = ();\n foreach my $F (@files) {\n my $F_norm = $F;\n if ($ON_WINDOWS) {\n $F_norm = lc $F_norm; # for case insensitive file name comparisons\n $F_norm =~ s{\\\\}{/}g; # Windows directory separators to Unix\n $F_norm =~ s{^\\./}{}g; # remove leading ./\n if (($F_norm !~ m{^/}) and ($F_norm !~ m{^\\w:/})) {\n # looks like a relative path; prefix with cwd\n $F_norm = lc \"$cwd/$F_norm\";\n }\n } else {\n $F_norm =~ s{^\\./}{}g; # remove leading ./\n if ($F_norm !~ m{^/}) {\n # looks like a relative path; prefix with cwd\n $F_norm = \"$cwd/$F_norm\";\n }\n }\n # Remove trailing / so it does not interfere with further regex code\n # that does not expect it\n $F_norm =~ s{/+$}{};\n $normalized{ $F_norm } = $F;\n }\n print \"<- normalize_file_names\\n\" if $opt_v > 2;\n return %normalized;\n} # 1}}}\nsub combine_diffs { # {{{1\n # subroutine by Andy (awalshe@sf.net)\n # https://sourceforge.net/tracker/?func=detail&aid=3261017&group_id=174787&atid=870625\n my ($ra_files) = @_;\n print \"-> combine_diffs\\n\" if $opt_v > 2;\n\n my $res = \"$URL v $VERSION\\n\";\n my $dl = '-';\n my $width = 79;\n # columns are in this order\n my @cols = ('files', 'blank', 'comment', 'code');\n my %HoH = ();\n\n foreach my $file (@{$ra_files}) {\n my $IN = open_file('<', $file, 1);\n if (!defined $IN) {\n warn \"Unable to read $file; ignoring.\\n\";\n next;\n }\n\n my $sec;\n while (<$IN>) {\n chomp;\n s/\\cM$//;\n next if /^(http|Language|-----)/;\n if (/^[A-Za-z0-9]+/) { # section title\n $sec = $_;\n chomp($sec);\n $HoH{$sec} = () if ! exists $HoH{$sec};\n next;\n }\n\n if (/^\\s(same|modified|added|removed)/) { # calculated totals row\n my @ar = grep { $_ ne '' } split(/ /, $_);\n chomp(@ar);\n my $ttl = shift @ar;\n my $i = 0;\n foreach(@ar) {\n my $t = \"${ttl}${dl}${cols[$i]}\";\n $HoH{$sec}{$t} = 0 if ! exists $HoH{$sec}{$t};\n $HoH{$sec}{$t} += $_;\n $i++;\n }\n }\n }\n $IN->close;\n }\n\n # rows are in this order\n my @rows = ('same', 'modified', 'added', 'removed');\n\n $res .= sprintf(\"%s\\n\", \"-\" x $width);\n $res .= sprintf(\"%-19s %14s %14s %14s %14s\\n\", 'Language',\n $cols[0], $cols[1], $cols[2], $cols[3]);\n $res .= sprintf(\"%s\\n\", \"-\" x $width);\n\n # no inputs? %HoH will be empty\n return $res unless %HoH;\n\n for my $sec ( keys %HoH ) {\n next if $sec =~ /SUM:/;\n next unless defined $HoH{$sec}; # eg, the header line\n $res .= \"$sec\\n\";\n foreach (@rows) {\n $res .= sprintf(\" %-18s %14s %14s %14s %14s\\n\",\n $_, $HoH{$sec}{\"${_}${dl}${cols[0]}\"},\n $HoH{$sec}{\"${_}${dl}${cols[1]}\"},\n $HoH{$sec}{\"${_}${dl}${cols[2]}\"},\n $HoH{$sec}{\"${_}${dl}${cols[3]}\"});\n }\n }\n $res .= sprintf(\"%s\\n\", \"-\" x $width);\n my $sec = 'SUM:';\n $res .= \"$sec\\n\";\n foreach (@rows) {\n $res .= sprintf(\" %-18s %14s %14s %14s %14s\\n\",\n $_, $HoH{$sec}{\"${_}${dl}${cols[0]}\"},\n $HoH{$sec}{\"${_}${dl}${cols[1]}\"},\n $HoH{$sec}{\"${_}${dl}${cols[2]}\"},\n $HoH{$sec}{\"${_}${dl}${cols[3]}\"});\n }\n $res .= sprintf(\"%s\\n\", \"-\" x $width);\n\n print \"<- combine_diffs\\n\" if $opt_v > 2;\n return $res;\n} # 1}}}\nsub combine_csv_diffs { # {{{1\n my ($delimiter, $ra_files) = @_;\n print \"-> combine_csv_diffs\\n\" if $opt_v > 2;\n\n my %sum = (); # sum{ language } = array of 17 values\n foreach my $file (@{$ra_files}) {\n my $IN = open_file('<', $file, 1);\n if (!defined $IN) {\n warn \"Unable to read $file; ignoring.\\n\";\n next;\n }\n\n my $sec;\n while (<$IN>) {\n next if /^Language${delimiter}\\s==\\sfiles${delimiter}/;\n chomp;\n my @words = split(/$delimiter/);\n my $n_col = scalar(@words);\n if ($n_col != 18) {\n warn \"combine_csv_diffs(): Parse failure line $. of $file\\n\";\n warn \"Expected 18 columns, got $n_col\\n\";\n die;\n }\n my $Lang = $words[0];\n my @count = map { int($_) } @words[1..16];\n if (defined $sum{$Lang}) {\n for (my $i = 0; $i < 16; $i++) {\n $sum{$Lang}[$i] += $count[$i];\n }\n } else {\n @{$sum{$Lang}} = @count;\n }\n }\n $IN->close;\n }\n\n my @header = (\"Language\", \"== files\", \"!= files\", \"+ files\", \"- files\",\n \"== blank\", \"!= blank\", \"+ blank\", \"- blank\", \"== comment\",\n \"!= comment\", \"+ comment\", \"- comment\", \"== code\",\n \"!= code\", \"+ code\", \"- code\", \"$URL v $VERSION\" );\n\n my $res = join(\"$delimiter \", @header) . \"$delimiter\\n\";\n foreach my $Lang (sort keys %sum) {\n $res .= $Lang . \"$delimiter \";\n for (my $i = 0; $i < 16; $i++) {\n $res .= $sum{$Lang}[$i] . \"$delimiter \";\n }\n $res .= \"\\n\";\n }\n\n print \"<- combine_csv_diffs\\n\" if $opt_v > 2;\n return $res;\n} # 1}}}\nsub get_time { # {{{1\n if ($HAVE_Time_HiRes) {\n return Time::HiRes::time();\n } else {\n return time();\n }\n} # 1}}}\nsub really_is_D { # {{{1\n # Ref bug 131, files ending with .d could be init.d scripts\n # instead of D language source files.\n my ($file , # in\n $rh_Err , # in hash of error codes\n $raa_errors , # out\n ) = @_;\n print \"-> really_is_D($file)\\n\" if $opt_v > 2;\n my ($possible_script, $L) = peek_at_first_line($file, $rh_Err, $raa_errors);\n\n print \"<- really_is_D($file)\\n\" if $opt_v > 2;\n return $possible_script; # null string if D, otherwise a language\n} # 1}}}\nsub no_autogen_files { # {{{1\n # ref https://github.com/AlDanial/cloc/issues/151\n my ($print,) = @_;\n print \"-> no_autogen($print)\\n\" if $opt_v > 2;\n\n # These sometimes created manually?\n # acinclude.m4\n # configure.ac\n # Makefile.am\n\n my @files = qw (\n aclocal.m4\n announce-gen\n autogen.sh\n bootstrap\n compile\n config.guess\n config.h.in\n config.rpath\n config.status\n config.sub\n configure\n configure.in\n depcomp\n gendocs.sh\n gitlog-to-changelog\n git-version-gen\n gnupload\n gnu-web-doc-update\n install-sh\n libtool\n libtool.m4\n link-warning.h\n ltmain.sh\n lt~obsolete.m4\n ltoptions.m4\n ltsugar.m4\n ltversion.in\n ltversion.m4\n Makefile.in\n mdate-sh\n missing\n mkinstalldirs\n test-driver\n texinfo.tex\n update-copyright\n useless-if-before-free\n vc-list-files\n ylwrap\n );\n\n if ($print) {\n printf \"cloc will ignore these %d files with --no-autogen:\\n\", scalar @files;\n foreach my $F (@files) {\n print \" $F\\n\";\n }\n print \"Additionally, Go files with '// Code generated by .* DO NOT EDIT.'\\n\";\n print \"on the first line are ignored.\\n\";\n }\n print \"<- no_autogen()\\n\" if $opt_v > 2;\n return @files;\n} # 1}}}\nsub load_from_config_file { # {{{1\n # Supports all options except --config itself which would\n # be pointless.\n my ($config_file,\n $rs_by_file ,\n $rs_by_file_by_lang ,\n $rs_categorized ,\n $rs_counted ,\n $rs_include_ext ,\n $rs_include_lang ,\n $rs_include_content ,\n $rs_exclude_content ,\n $rs_exclude_lang ,\n $rs_exclude_dir ,\n $rs_exclude_list_file ,\n $rs_explain ,\n $rs_extract_with ,\n $rs_found ,\n $rs_count_diff ,\n $rs_diff_list_files ,\n $rs_diff ,\n $rs_diff_alignment ,\n $rs_diff_timeout ,\n $rs_timeout ,\n $rs_html ,\n $rs_ignored ,\n $rs_unique ,\n $rs_quiet ,\n $rs_force_lang_def ,\n $rs_read_lang_def ,\n $rs_show_ext ,\n $rs_show_lang ,\n $rs_progress_rate ,\n $rs_print_filter_stages ,\n $rs_report_file ,\n $ra_script_lang ,\n $rs_sdir ,\n $rs_skip_uniqueness ,\n $rs_strip_code ,\n $rs_strip_comments ,\n $rs_original_dir ,\n $rs_sum_reports ,\n $rs_hide_rate ,\n $rs_processes ,\n $rs_unicode ,\n $rs_3 ,\n $rs_v ,\n $rs_vcs ,\n $rs_include_submodules ,\n $rs_version ,\n $rs_write_lang_def ,\n $rs_write_lang_def_incl_dup,\n $rs_xml ,\n $rs_xsl ,\n $ra_force_lang ,\n $rs_lang_no_ext ,\n $rs_yaml ,\n $rs_csv ,\n $rs_csv_delimiter ,\n $rs_json ,\n $rs_md ,\n $rs_fullpath ,\n $rs_match_f ,\n $ra_not_match_f ,\n $rs_match_d ,\n $ra_not_match_d ,\n $rs_list_file ,\n $rs_help ,\n $rs_skip_win_hidden ,\n $rs_read_binary_files ,\n $rs_sql ,\n $rs_sql_project ,\n $rs_sql_append ,\n $rs_sql_style ,\n $rs_inline ,\n $rs_exclude_ext ,\n $rs_ignore_whitespace ,\n $rs_ignore_case ,\n $rs_ignore_case_ext ,\n $ra_ignore_regex ,\n $rs_follow_links ,\n $rs_autoconf ,\n $rs_sum_one ,\n $rs_by_percent ,\n $rs_stdin_name ,\n $rs_force_on_windows ,\n $rs_force_on_unix ,\n $rs_show_os ,\n $rs_skip_archive ,\n $rs_max_file_size ,\n $rs_use_sloccount ,\n $rs_no_autogen ,\n $rs_force_git ,\n $rs_strip_str_comments ,\n $rs_file_encoding ,\n $rs_docstring_as_code ,\n $rs_stat ,\n $rs_thousands_delimiter ,\n $rs_show_errors ,\n ) = @_;\n # look for runtime configuration file in\n # $ENV{'HOME'}/.config/cloc/options.txt -> POSIX\n # $ENV{'APPDATA'} . 'cloc'\n\n print \"-> load_from_config_file($config_file)\\n\" if $opt_v and $opt_v > 2;\n if (!is_file($config_file)) {\n print \"<- load_from_config_file() (no such file: $config_file)\\n\" if $opt_v and $opt_v > 2;\n return;\n } elsif (!can_read($config_file)) {\n print \"<- load_from_config_file() (unable to read $config_file)\\n\" if $opt_v and $opt_v > 2;\n return;\n }\n print \"Reading options from $config_file.\\n\" if defined $opt_v;\n\n my $has_force_lang = @{$ra_force_lang};\n my $has_script_lang = @{$ra_script_lang};\n my @lines = read_file($config_file);\n foreach (@lines) {\n next if /^\\s*$/ or /^\\s*#/;\n s/\\s*--//;\n s/^\\s+//;\n if (!defined ${$rs_by_file} and /^(by_file|by-file)/) { ${$rs_by_file} = 1;\n } elsif (!defined ${$rs_by_file_by_lang} and /^(by_file_by_lang|by-file-by-lang)/) { ${$rs_by_file_by_lang} = 1;\n } elsif (!defined ${$rs_categorized} and /^categorized(=|\\s+)(.*?)$/) { ${$rs_categorized} = $2;\n } elsif (!defined ${$rs_counted} and /^counted(=|\\s+)(.*?)$/) { ${$rs_counted} = $2;\n } elsif (!defined ${$rs_include_ext} and /^(?:include_ext|include-ext)(=|\\s+)(.*?)$/) { ${$rs_include_ext} = $2;\n } elsif (!defined ${$rs_include_lang} and /^(?:include_lang|include-lang)(=|\\s+)(.*?)$/) { ${$rs_include_lang} = $2;\n } elsif (!defined ${$rs_include_content} and /^(?:include_content|include-content)(=|\\s+)(.*?)$/) { ${$rs_include_content} = $2;\n } elsif (!defined ${$rs_exclude_content} and /^(?:exclude_content|exclude-content)(=|\\s+)(.*?)$/) { ${$rs_exclude_content} = $2;\n } elsif (!defined ${$rs_exclude_lang} and /^(?:exclude_lang|exclude-lang)(=|\\s+)(.*?)$/) { ${$rs_exclude_lang} = $2;\n } elsif (!defined ${$rs_exclude_dir} and /^(?:exclude_dir|exclude-dir)(=|\\s+)(.*?)$/) { ${$rs_exclude_dir} = $2;\n } elsif (!defined ${$rs_explain} and /^explain(=|\\s+)(.*?)$/) { ${$rs_explain} = $2;\n } elsif (!defined ${$rs_extract_with} and /^(?:extract_with|extract-with)(=|\\s+)(.*?)$/) { ${$rs_extract_with} = $2;\n } elsif (!defined ${$rs_found} and /^found(=|\\s+)(.*?)$/) { ${$rs_found} = $2;\n } elsif (!defined ${$rs_count_diff} and /^(count_and_diff|count-and-diff)/) { ${$rs_count_diff} = 1;\n } elsif (!defined ${$rs_diff_list_files} and /^(diff_list_files|diff-list-files)/) { ${$rs_diff_list_files} = 1;\n } elsif (!defined ${$rs_diff} and /^diff/) { ${$rs_diff} = 1;\n } elsif (!defined ${$rs_diff_alignment} and /^(?:diff-alignment|diff_alignment)(=|\\s+)(.*?)$/) { ${$rs_diff_alignment} = $2;\n } elsif (!defined ${$rs_diff_timeout} and /^(?:diff-timeout|diff_timeout)(=|\\s+)i/) { ${$rs_diff_timeout} = $1;\n } elsif (!defined ${$rs_timeout} and /^timeout(=|\\s+)i/) { ${$rs_timeout} = $1;\n } elsif (!defined ${$rs_html} and /^html/) { ${$rs_html} = 1;\n } elsif (!defined ${$rs_ignored} and /^ignored(=|\\s+)(.*?)$/) { ${$rs_ignored} = $2;\n } elsif (!defined ${$rs_unique} and /^unique(=|\\s+)(.*?)$/) { ${$rs_unique} = $2;\n } elsif (!defined ${$rs_quiet} and /^quiet/) { ${$rs_quiet} = 1;\n } elsif (!defined ${$rs_force_lang_def} and /^(?:force_lang_def|force-lang-def)(=|\\s+)(.*?)$/) { ${$rs_force_lang_def} = $2;\n } elsif (!defined ${$rs_read_lang_def} and /^(?:read_lang_def|read-lang-def)(=|\\s+)(.*?)$/) { ${$rs_read_lang_def} = $2;\n } elsif (!defined ${$rs_progress_rate} and /^(?:progress_rate|progress-rate)(=|\\s+)(\\d+)/) { ${$rs_progress_rate} = $2;\n } elsif (!defined ${$rs_print_filter_stages} and /^(print_filter_stages|print-filter-stages)/) { ${$rs_print_filter_stages}= 1;\n } elsif (!defined ${$rs_report_file} and /^(?:report_file|report-file)(=|\\s+)(.*?)$/) { ${$rs_report_file} = $2;\n } elsif (!defined ${$rs_report_file} and /^out(=|\\s+)(.*?)$/) { ${$rs_report_file} = $2;\n } elsif (!defined ${$rs_sdir} and /^sdir(=|\\s+)(.*?)$/) { ${$rs_sdir} = $2;\n } elsif (!defined ${$rs_skip_uniqueness} and /^(skip_uniqueness|skip-uniqueness)/) { ${$rs_skip_uniqueness} = 1;\n } elsif (!defined ${$rs_strip_code} and /^(?:strip_code|strip-code)(=|\\s+)(.*?)$/) { ${$rs_strip_code} = $2;\n } elsif (!defined ${$rs_strip_comments} and /^(?:strip_comments|strip-comments)(=|\\s+)(.*?)$/) { ${$rs_strip_comments} = $2;\n } elsif (!defined ${$rs_original_dir} and /^(original_dir|original-dir)/) { ${$rs_original_dir} = 1;\n } elsif (!defined ${$rs_sum_reports} and /^(sum_reports|sum-reports)/) { ${$rs_sum_reports} = 1;\n } elsif (!defined ${$rs_hide_rate} and /^(hid_rate|hide-rate)/) { ${$rs_hide_rate} = 1;\n } elsif (!defined ${$rs_processes} and /^processes(=|\\s+)(\\d+)/) { ${$rs_processes} = $2;\n } elsif (!defined ${$rs_unicode} and /^unicode/) { ${$rs_unicode} = 1;\n } elsif (!defined ${$rs_3} and /^3/) { ${$rs_3} = 1;\n } elsif (!defined ${$rs_vcs} and /^vcs(=|\\s+)(\\S+)/) { ${$rs_vcs} = $2;\n } elsif (!defined ${$rs_include_submodules} and /^include-submodules/) { ${$rs_include_submodules} = 1;\n } elsif (!defined ${$rs_version} and /^version/) { ${$rs_version} = 1;\n } elsif (!defined ${$rs_write_lang_def} and /^(?:write_lang_def|write-lang-def)(=|\\s+)(.*?)$/) { ${$rs_write_lang_def} = $2;\n } elsif (!defined ${$rs_write_lang_def_incl_dup} and /^(?:write_lang_def_incl_dup|write-lang-def-incl-dup)(=|\\s+)(.*?)$/) { ${$rs_write_lang_def_incl_dup} = $2;\n } elsif (!defined ${$rs_xml} and /^xml/) { ${$rs_xml} = 1;\n } elsif (!defined ${$rs_xsl} and /^xsl(=|\\s+)(.*?)$/) { ${$rs_xsl} = $2;\n } elsif (!defined ${$rs_lang_no_ext} and /^(?:lang_no_ext|lang-no-ext)(=|\\s+)(.*?)$/) { ${$rs_lang_no_ext} = $2;\n } elsif (!defined ${$rs_yaml} and /^yaml/) { ${$rs_yaml} = 1;\n } elsif (!defined ${$rs_csv} and /^csv/) { ${$rs_csv} = 1;\n } elsif (!defined ${$rs_csv_delimiter} and /^(?:csv_delimiter|csv-delimiter)(=|\\s+)(.*?)$/) { ${$rs_csv_delimiter} = $2;\n } elsif (!defined ${$rs_json} and /^json/) { ${$rs_json} = 1;\n } elsif (!defined ${$rs_md} and /^md/) { ${$rs_md} = 1;\n } elsif (!defined ${$rs_fullpath} and /^fullpath/) { ${$rs_fullpath} = 1;\n } elsif (!defined ${$rs_match_f} and /^(?:match_f|match-f)(=|\\s+)['\"]?(.*?)['\"]?$/) { ${$rs_match_f} = $2;\n } elsif (! @{$ra_not_match_f} and /^(?:not_match_f|not-match-f)(=|\\s+)['\"]?(.*?)['\"]?$/) { push @{$ra_not_match_f} , $2;\n } elsif (!defined ${$rs_match_d} and /^(?:match_d|match-d)(=|\\s+)['\"]?(.*?)['\"]?$/) { ${$rs_match_d} = $2;\n } elsif (! @{$ra_not_match_d} and /^(?:not_match_d|not-match-d)(=|\\s+)['\"]?(.*?)['\"]?$/) { push @{$ra_not_match_d} , $2;\n } elsif (!defined ${$rs_list_file} and /^(?:list_file|list-file)(=|\\s+)(.*?)$/) { ${$rs_list_file} = $2;\n } elsif (!defined ${$rs_help} and /^help/) { ${$rs_help} = 1;\n } elsif (!defined ${$rs_skip_win_hidden} and /^(skip_win_hidden|skip-win-hidden)/) { ${$rs_skip_win_hidden} = 1;\n } elsif (!defined ${$rs_read_binary_files} and /^(read_binary_files|read-binary-files)/) { ${$rs_read_binary_files} = 1;\n } elsif (!defined ${$rs_sql} and /^sql(=|\\s+)(.*?)$/) { ${$rs_sql} = $2;\n } elsif (!defined ${$rs_sql_project} and /^(?:sql_project|sql-project)(=|\\s+)(.*?)$/) { ${$rs_sql_project} = $2;\n } elsif (!defined ${$rs_sql_append} and /^(sql_append|sql-append)/) { ${$rs_sql_append} = 1;\n } elsif (!defined ${$rs_sql_style} and /^(?:sql_style|sql-style)(=|\\s+)(.*?)$/) { ${$rs_sql_style} = $2;\n } elsif (!defined ${$rs_inline} and /^inline/) { ${$rs_inline} = 1;\n } elsif (!defined ${$rs_exclude_ext} and /^(?:exclude_ext|exclude-ext)(=|\\s+)(.*?)$/) { ${$rs_exclude_ext} = $2;\n } elsif (!defined ${$rs_ignore_whitespace} and /^(ignore_whitespace|ignore-whitespace)/) { ${$rs_ignore_whitespace} = 1;\n } elsif (!defined ${$rs_ignore_case_ext} and /^(ignore_case_ext|ignore-case-ext)/) { ${$rs_ignore_case_ext} = 1;\n } elsif (!defined ${$rs_ignore_case} and /^(ignore_case|ignore-case)/) { ${$rs_ignore_case} = 1;\n } elsif (! @{$ra_ignore_regex} and /^(?:ignore_regex|ignore-regex)(=|\\s+)['\"]?(.*?)['\"]?$/) { push @{$ra_ignore_regex}, $2;\n } elsif (!defined ${$rs_follow_links} and /^(follow_links|follow-links)/) { ${$rs_follow_links} = 1;\n } elsif (!defined ${$rs_autoconf} and /^autoconf/) { ${$rs_autoconf} = 1;\n } elsif (!defined ${$rs_sum_one} and /^(sum_one|sum-one)/) { ${$rs_sum_one} = 1;\n } elsif (!defined ${$rs_by_percent} and /^(?:by_percent|by-percent)(=|\\s+)(.*?)$/) { ${$rs_by_percent} = $2;\n } elsif (!defined ${$rs_stdin_name} and /^(?:stdin_name|stdin-name)(=|\\s+)(.*?)$/) { ${$rs_stdin_name} = $2;\n } elsif (!defined ${$rs_force_on_windows} and /^windows/) { ${$rs_force_on_windows} = 1;\n } elsif (!defined ${$rs_force_on_unix} and /^unix/) { ${$rs_force_on_unix} = 1;\n } elsif (!defined ${$rs_show_os} and /^(show_os|show-os)/) { ${$rs_show_os} = 1;\n } elsif (!defined ${$rs_skip_archive} and /^(?:skip_archive|skip-archive)(=|\\s+)(.*?)$/) { ${$rs_skip_archive} = $2;\n } elsif (!defined ${$rs_max_file_size} and /^(?:max_file_size|max-file-size)(=|\\s+)(\\d+)/) { ${$rs_max_file_size} = $2;\n } elsif (!defined ${$rs_use_sloccount} and /^(use_sloccount|use-sloccount)/) { ${$rs_use_sloccount} = 1;\n } elsif (!defined ${$rs_no_autogen} and /^(no_autogen|no-autogen)/) { ${$rs_no_autogen} = 1;\n } elsif (!defined ${$rs_force_git} and /^git/) { ${$rs_force_git} = 1;\n } elsif (!defined ${$rs_exclude_list_file} and /^(?:exclude_list_file|exclude-list-file)(=|\\s+)(.*?)$/)\n { ${$rs_exclude_list_file} = $2;\n } elsif (!defined ${$rs_v} and /^(verbose|v)((=|\\s+)(\\d+))?/) {\n if (!defined $4) { ${$rs_v} = 0; }\n else { ${$rs_v} = $4; }\n } elsif (!$has_script_lang and /^(?:script_lang|script-lang)(=|\\s+)(.*?)$/) {\n push @{$ra_script_lang} , $2;\n } elsif (!$has_force_lang and /^(?:force_lang|force-lang)(=|\\s+)(.*?)$/) {\n push @{$ra_force_lang} , $2;\n } elsif (!defined ${$rs_show_ext} and /^(show_ext|show-ext)((=|\\s+)(.*))?$/) {\n if (!defined $4) { ${$rs_show_ext} = 0; }\n else { ${$rs_show_ext} = $4; }\n } elsif (!defined ${$rs_show_lang} and /^(show_lang|show-lang)((=|\\s+)(.*))?s/){\n if (!defined $4) { ${$rs_show_lang} = 0; }\n else { ${$rs_show_lang} = $4; }\n } elsif (!defined ${$rs_strip_str_comments} and /^(strip_str_comments|strip-str-comments)/) { ${$rs_strip_str_comments} = 1;\n } elsif (!defined ${$rs_file_encoding} and /^(?:file_encoding|file-encoding)(=|\\s+)(\\S+)/) { ${$rs_file_encoding} = $2;\n } elsif (!defined ${$rs_docstring_as_code} and /^(docstring_as_code|docstring-as-code)/) { ${$rs_docstring_as_code} = 1;\n } elsif (!defined ${$rs_stat} and /stat/) { ${$rs_stat} = 1;\n } elsif (!defined ${$rs_thousands_delimiter} and /^ksep|thousands-delimiter(=|\\s+)(.*?)$/) { ${$rs_thousands_delimiter}= $2;\n } elsif (!defined ${$rs_show_errors} and /show_errors|show-errors/) { ${$rs_show_errors} = 1;\n }\n\n }\n} # 1}}}\nsub trick_pp_packer_encode { # {{{1\n use Encode;\n # PAR::Packer gives 'Unknown PerlIO layer \"encoding\"' unless it is\n # forced into using this module.\n my ($OUT, $JunkFile) = tempfile(UNLINK => 1); # delete on exit\n open($OUT, \"> :encoding(utf8)\", $JunkFile);\n close($OUT);\n}\n# 1}}}\nsub really_is_smarty { # {{{1\n # Given filename, returns TRUE if its contents look like Smarty template\n my ($filename, ) = @_;\n\n print \"-> really_is_smarty($filename)\\n\" if $opt_v > 2;\n\n my @lines = read_file($filename);\n\n my $points = 0;\n foreach my $L (@lines) {\n if (($L =~ /\\{(if|include)\\s/) or\n ($L =~ /\\{\\/if\\}/) or\n ($L =~ /(\\{\\*|\\*\\})/) or\n ($L =~ /\\{\\$\\w/)) {\n ++$points;\n }\n last if $points >= 2;\n }\n print \"<- really_is_smarty(points=$points)\\n\" if $opt_v > 2;\n return $points >= 2;\n} # 1}}}\nsub check_alternate_config_files { # {{{1\n my ($list_file, $exclude_list_file, $read_lang_def,\n $force_lang_def, $diff_list_file, ) = @_;\n my $found_it = \"\";\n foreach my $file ($list_file,\n $exclude_list_file,\n $read_lang_def,\n $force_lang_def,\n $diff_list_file ) {\n next unless defined $file;\n my $dir = dirname $file;\n next unless can_read($dir) and is_dir($dir);\n my $bn = basename $config_file;\n if (can_read(\"$dir/$bn\")) {\n $found_it = \"$dir/$bn\";\n print \"Using configuration file $found_it\\n\" if $opt_v;\n last;\n }\n }\n return $found_it;\n}\n# 1}}}\nsub write_null_results { # {{{\n my ($json, $xml, $report_file,) = @_;\n print \"-> write_null_results\\n\" if $opt_v > 2;\n if ((defined $json) or (defined $xml)) {\n my $line = \"\";\n if (defined $json) {\n $line = \"{}\";\n } else {\n $line = '';\n }\n if (defined $report_file) {\n open OUT, \">$report_file\" or die \"Cannot write to $report_file $!\\n\";\n print OUT \"$line\\n\";\n close OUT;\n } else {\n print \"$line\\n\";\n }\n }\n print \"<- write_null_results\\n\" if $opt_v > 2;\n} # }}}\nsub glob2regex { # {{{\n # convert simple xpath-style glob pattern to a regex\n my $globstr = shift;\n my $re = $globstr;\n $re =~ s{^[\"']}{};\n $re =~ s{^\\.\\/}{};\n $re =~ s{[\"']$}{};\n $re =~ s{\\.}{\\\\.}g;\n $re =~ s{\\*\\*}{\\cx}g; # ctrl x = .*?\n $re =~ s{\\*}{\\cy}g; # ctrl y = [^/]*\n $re =~ s{\\cx}{.*?}g;\n $re =~ s{\\cy}{[^/]*}g;\n return '^' . $re . '$';\n} # }}}\nsub load_json { # {{{1\n #\n # Load a cloc-generated JSON string into %contents\n # $contents{filename}{blank|comment|code|language} = value\n # then print in a variety of formats.\n #\n my ($json_string, ) = @_;\n print \"-> load_json()\\n\" if $opt_v > 2;\n\n my %contents = ();\n my $heading = undef;\n foreach (split /\\n/, $json_string) {\n if (/^{?\"(.*?)\"/) {\n $heading = $1;\n } else {\n if (/^\\s+\"(.*?)\"\\s*:\\s+(\\d+(\\.\\d+)?)\\b/) {\n # numeric value\n $contents{$heading}{$1} = $2;\n } elsif (/^\\s+\"(.*?)\"\\s*:\\s+\"(.*?)\"/) {\n $contents{$heading}{$1} = $2;\n }\n }\n }\n my $url = $contents{'header'}{'cloc_url'};\n my $ver = $contents{'header'}{'cloc_version'};\n my $sec = $contents{'header'}{'elapsed_seconds'};\n my $n_file = $contents{'header'}{'n_files'};\n my $n_line = $contents{'header'}{'n_lines'};\n $sec = $sec == 0 ? 1.0e-3 : $sec;\n my $header = sprintf \"%s v %s T=%.2f s (%.1f files/s, %.1f lines/s)\",\n $url, $ver, $sec, $n_file/$sec, $n_line/$sec;\n delete $contents{'header'};\n delete $contents{'SUM'};\n\n my @file_list = (sort { $contents{$b}{'code'} <=>\n $contents{$a}{'code'} } keys %contents );\n#die Dumper(\\%contents);\n # Determine column widths for output\n my $file_len = 0;\n my $lang_len = 0;\n foreach my $file (keys %contents) {\n my $flen = length $file;\n my $llen = length $contents{$file}{'language'};\n $file_len = $file_len > $flen ? $file_len : $flen;\n $lang_len = $lang_len > $llen ? $lang_len : $llen;\n }\n print \"<- load_json()\\n\" if $opt_v > 2;\n return $file_len, $lang_len, $header, %contents;\n}\n# 1}}}\nsub print_format_n { # {{{1\n # by file with\n # format 1 : Language | files | blank | comment | code\n # format 2 : Language | files | blank | comment | code | total\n # format 3 : File | Language | blank | comment | code\n # format 4 : File | blank | comment | code | total\n # format 5 : File | Language | blank | comment | code | total\n my ($format, $file_len, $lang_len, $header, %contents) = @_;\n print \"-> print_format_n($format)\\n\" if $opt_v > 2;\n my @prt_lines = ();\n\n # 8 = characters in \"Language\"\n $lang_len = max(8, $lang_len);\n my %str_fmt = (\n 1 => sprintf(\"%%-%ds %%7s %%7s %%7s %%7s\\n\", $lang_len),\n 2 => sprintf(\"%%-%ds %%7s %%7s %%7s %%7s %%7s\\n\", $lang_len),\n 3 => sprintf(\"%%-%ds %%-%ds %%7s %%7s %%7s\\n\", $file_len, $lang_len),\n 4 => sprintf(\"%%-%ds %%7s %%7s %%7s %%7s\\n\", $file_len),\n 5 => sprintf(\"%%-%ds %%-%ds %%7s %%7s %%7s %%7s\\n\", $file_len, $lang_len),\n );\n my %val_fmt = (\n 1 => sprintf(\"%%-%ds %%7s %%7s %%7s %%7s\\n\", $lang_len),\n 2 => sprintf(\"%%-%ds %%7s %%7s %%7s %%7s %%7s\\n\", $lang_len),\n 3 => sprintf(\"%%-%ds %%-%ds %%7s %%7s %%7s\\n\", $file_len, $lang_len),\n 4 => sprintf(\"%%-%ds %%7s %%7s %%7s %%7s\\n\", $file_len),\n 5 => sprintf(\"%%-%ds %%-%ds %%7d %%7s %%7s %%7s\\n\", $file_len, $lang_len),\n );\n my %language = ();\n foreach my $file (keys %contents) {\n my $lang = $contents{$file}{'language'};\n $language{$lang}{'files'} += 1;\n foreach my $category ('blank', 'comment', 'code',) {\n $language{$lang}{$category} += $contents{$file}{$category};\n $language{$lang}{'total'} += $contents{$file}{$category};\n }\n }\n my @file_list = (sort { $contents{$b}{'code'} <=>\n $contents{$a}{'code'} } keys %contents );\n my @lang_list = (sort { $language{$b}{'code'} <=>\n $language{$a}{'code'} } keys %language );\n\n my %hyphens = (\n 1 => \"-\" x ($lang_len + 4*9),\n 2 => \"-\" x ($lang_len + 5*9),\n 3 => \"-\" x ($lang_len + $file_len + 2 + 3*9),\n 4 => \"-\" x ($file_len + 4*9),\n 5 => \"-\" x ($lang_len + $file_len + 2 + 4*9),\n );\n my %col_headings = (\n 1 => [\"Language\", \"files\", \"blank\", \"comment\", \"code\"],\n 2 => [\"Language\", \"files\", \"blank\", \"comment\", \"code\", \"Total\"],\n 3 => [\"File\", \"Language\", \"blank\", \"comment\", \"code\"],\n 4 => [\"File\", \"blank\", \"comment\", \"code\", \"Total\"],\n 5 => [\"File\", \"Language\", \"blank\", \"comment\", \"code\", \"Total\"],\n );\n\n push @prt_lines, \"$header\\n\";\n push @prt_lines, \"$hyphens{$format}\\n\";\n push @prt_lines, sprintf $str_fmt{$format}, @{$col_headings{$format}};\n push @prt_lines, \"$hyphens{$format}\\n\";\n my ($n_files, $n_blank, $n_comment, $n_code, $n_total) = (0, 0, 0, 0, 0);\n my @out;\n my $sum;\n if ($format < 3) {\n # by language\n foreach my $lang (@lang_list) {\n my ($nF, $nB, $nCm, $nCo) = ($language{$lang}{'files'},\n $language{$lang}{'blank'},\n $language{$lang}{'comment'},\n $language{$lang}{'code'});\n $n_files += $nF;\n $n_blank += $nB;\n $n_comment += $nCm;\n $n_code += $nCo;\n $n_total += $nB + $nCm + $nCo;\n $sum = $nB + $nCm + $nCo;\n if ($opt_thousands_delimiter) {\n $sum = separate_thousands($sum, $opt_thousands_delimiter);\n $nF = separate_thousands($nF, $opt_thousands_delimiter);\n $nB = separate_thousands($nB, $opt_thousands_delimiter);\n $nCm = separate_thousands($nCm, $opt_thousands_delimiter);\n $nCo = separate_thousands($nCo, $opt_thousands_delimiter);\n }\n if ($format == 1) {\n @out = ($lang, $nF, $nB, $nCm, $nCo);\n } else {\n @out = ($lang, $nF, $nB, $nCm, $nCo, $sum);\n }\n push @prt_lines, sprintf $str_fmt{$format}, @out;\n }\n } else {\n # by file\n foreach my $file (@file_list) {\n my ($nB, $nCm, $nCo) = ($contents{$file}{'blank'},\n $contents{$file}{'comment'},\n $contents{$file}{'code'});\n $n_blank += $nB;\n $n_comment += $nCm;\n $n_code += $nCo;\n $n_total += $nB + $nCm + $nCo;\n $sum = $nB + $nCm + $nCo;\n if ($opt_thousands_delimiter) {\n $sum = separate_thousands($sum, $opt_thousands_delimiter);\n $nB = separate_thousands($nB, $opt_thousands_delimiter);\n $nCm = separate_thousands($nCm, $opt_thousands_delimiter);\n $nCo = separate_thousands($nCo, $opt_thousands_delimiter);\n }\n my $lang = $contents{$file}{'language'};\n if ($format == 1) {\n } elsif ($format == 3) {\n @out = ($file, $lang, $nB, $nCm, $nCo);\n } elsif ($format == 4) {\n @out = ($file, $nB, $nCm, $nCo, $sum);\n } else {\n @out = ($file, $lang, $nB, $nCm, $nCo, $sum);\n }\n push @prt_lines, sprintf $str_fmt{$format}, @out;\n }\n }\n push @prt_lines, \"$hyphens{$format}\\n\";\n if (scalar @file_list > 1) {\n if ($opt_thousands_delimiter) {\n $n_files = separate_thousands($n_files, $opt_thousands_delimiter);\n $n_blank = separate_thousands($n_blank, $opt_thousands_delimiter);\n $n_comment = separate_thousands($n_comment, $opt_thousands_delimiter);\n $n_code = separate_thousands($n_code, $opt_thousands_delimiter);\n $n_total = separate_thousands($n_total, $opt_thousands_delimiter);\n }\n if ($format == 1) {\n @out = ( \"SUM\", $n_files, $n_blank, $n_comment, $n_code);\n } elsif ($format == 2) {\n @out = ( \"SUM\", $n_files, $n_blank, $n_comment, $n_code, $n_total);\n } elsif ($format == 3) {\n @out = ( \"SUM\", \" \", $n_blank, $n_comment, $n_code);\n } elsif ($format == 4) {\n @out = ( \"SUM\", $n_blank, $n_comment, $n_code, $n_total);\n } else {\n @out = ( \"SUM\", \" \", $n_blank, $n_comment, $n_code, $n_total);\n }\n push @prt_lines, sprintf $str_fmt{$format}, @out;\n push @prt_lines, \"$hyphens{$format}\\n\";\n }\n return @prt_lines;\n print \"<- print_format_n()\\n\" if $opt_v > 2;\n} # 1}}}\nsub parse_ignore_regex { # {{{1\n #\n # Convert the list of \"language(s)|regex\" into a hash\n # $ignore_regex{language} = [list of regex]\n\n my ($ra_lang_regex , # in, as given on command line\n $rhaa_Filters_by_Language, # in, hash of filters by language\n $rha_ignore_regex) = @_;\n print \"-> parse_ignore_regex()\\n\" if $opt_v > 2;\n\n foreach my $lang_regex (@{$ra_lang_regex}) {\n die \"Missing '|' character in --ignore-regex '$lang_regex'\\n\"\n unless $lang_regex =~ /\\|/;\n my ($lang, $regex) = split(/\\|/, $lang_regex, 2);\n die \"Invalid --ignore-regex: $lang_regex\\n\"\n unless defined $lang and defined $regex;\n my @languages = split(/,/, $lang);\n foreach my $lang (@languages) {\n if ($lang eq '*') {\n foreach my $lang (keys %{$rhaa_Filters_by_Language}) {\n push @{$rha_ignore_regex->{$lang}}, $regex;\n }\n } else {\n die \"Unknown language '$lang' in --ignore-regex '$lang_regex'\\n\"\n unless defined $rhaa_Filters_by_Language->{$lang};\n push @{$rha_ignore_regex->{$lang}}, $regex;\n }\n#print \"lang=$lang regex=[$regex]\\n\";\n }\n }\n#use Data::Dumper;\n#print Dumper($rha_ignore_regex);\n print \"<- parse_ignore_regex()\\n\" if $opt_v > 2;\n}\n# 1}}}\n# really_is_pascal, really_is_incpascal, really_is_php from SLOCCount\nmy %php_files = (); # really_is_php()\nsub really_is_pascal { # {{{1\n# Given filename, returns TRUE if its contents really are Pascal.\n\n# This isn't as obvious as it seems.\n# Many \".p\" files are Perl files\n# (such as /usr/src/redhat/BUILD/ispell-3.1/dicts/czech/glob.p),\n# others are C extractions\n# (such as /usr/src/redhat/BUILD/linux/include/linux/umsdos_fs.p\n# and some files in linuxconf).\n# However, test files in \"p2c\" really are Pascal, for example.\n\n# Note that /usr/src/redhat/BUILD/ucd-snmp-4.1.1/ov/bitmaps/UCD.20.p\n# is actually C code. The heuristics determine that they're not Pascal,\n# but because it ends in \".p\" it's not counted as C code either.\n# I believe this is actually correct behavior, because frankly it\n# looks like it's automatically generated (it's a bitmap expressed as code).\n# Rather than guess otherwise, we don't include it in a list of\n# source files. Let's face it, someone who creates C files ending in \".p\"\n# and expects them to be counted by default as C files in SLOCCount needs\n# their head examined. I suggest examining their head\n# with a sucker rod (see syslogd(8) for more on sucker rods).\n\n# This heuristic counts as Pascal such files such as:\n# /usr/src/redhat/BUILD/teTeX-1.0/texk/web2c/tangleboot.p\n# Which is hand-generated. We don't count woven documents now anyway,\n# so this is justifiable.\n\n my $filename = shift;\n chomp($filename);\n\n# The heuristic is as follows: it's Pascal _IF_ it has all of the following\n# (ignoring {...} and (*...*) comments):\n# 1. \"^..program NAME\" or \"^..unit NAME\",\n# 2. \"procedure\", \"function\", \"^..interface\", or \"^..implementation\",\n# 3. a \"begin\", and\n# 4. it ends with \"end.\",\n#\n# Or it has all of the following:\n# 1. \"^..module NAME\" and\n# 2. it ends with \"end.\".\n#\n# Or it has all of the following:\n# 1. \"^..program NAME\",\n# 2. a \"begin\", and\n# 3. it ends with \"end.\".\n#\n# The \"end.\" requirements in particular filter out non-Pascal.\n#\n# Note (jgb): this does not detect Pascal main files in fpc, like\n# fpc-1.0.4/api/test/testterminfo.pas, which does not have \"program\" in\n# it\n\n my $is_pascal = 0; # Value to determine.\n\n my $has_program = 0;\n my $has_unit = 0;\n my $has_module = 0;\n my $has_procedure_or_function = 0;\n my $found_begin = 0;\n my $found_terminating_end = 0;\n my $has_begin = 0;\n\n my $PASCAL_FILE = open_file('<', $filename, 0);\n die \"Can't open $filename to determine if it's pascal.\\n\" if !defined $PASCAL_FILE;\n while(<$PASCAL_FILE>) {\n s/\\{.*?\\}//g; # Ignore {...} comments on this line; imperfect, but effective.\n s/\\(\\*.*?\\*\\)//g; # Ignore (*...*) comments on this line; imperfect, but effective.\n if (m/\\bprogram\\s+[A-Za-z]/i) {$has_program=1;}\n if (m/\\bunit\\s+[A-Za-z]/i) {$has_unit=1;}\n if (m/\\bmodule\\s+[A-Za-z]/i) {$has_module=1;}\n if (m/\\bprocedure\\b/i) { $has_procedure_or_function = 1; }\n if (m/\\bfunction\\b/i) { $has_procedure_or_function = 1; }\n if (m/^\\s*interface\\s+/i) { $has_procedure_or_function = 1; }\n if (m/^\\s*implementation\\s+/i) { $has_procedure_or_function = 1; }\n if (m/\\bbegin\\b/i) { $has_begin = 1; }\n # Originally I said:\n # \"This heuristic fails if there are multi-line comments after\n # \"end.\"; I haven't seen that in real Pascal programs:\"\n # But jgb found there are a good quantity of them in Debian, specially in\n # fpc (at the end of a lot of files there is a multiline comment\n # with the changelog for the file).\n # Therefore, assume Pascal if \"end.\" appears anywhere in the file.\n if (m/end\\.\\s*$/i) {$found_terminating_end = 1;}\n# elsif (m/\\S/) {$found_terminating_end = 0;}\n }\n close($PASCAL_FILE);\n\n # Okay, we've examined the entire file looking for clues;\n # let's use those clues to determine if it's really Pascal:\n\n if ( ( ($has_unit || $has_program) && $has_procedure_or_function &&\n $has_begin && $found_terminating_end ) ||\n ( $has_module && $found_terminating_end ) ||\n ( $has_program && $has_begin && $found_terminating_end ) )\n {$is_pascal = 1;}\n\n return $is_pascal;\n} # 1}}}\nsub really_is_incpascal { # {{{1\n# Given filename, returns TRUE if its contents really are Pascal.\n# For .inc files (mainly seen in fpc)\n\n my $filename = shift;\n chomp($filename);\n\n# The heuristic is as follows: it is Pascal if any of the following:\n# 1. really_is_pascal returns true\n# 2. Any usual reserved word is found (program, unit, const, begin...)\n\n # If the general routine for Pascal files works, we have it\n if (really_is_pascal($filename)) {\n return 1;\n }\n\n my $is_pascal = 0; # Value to determine.\n my $found_begin = 0;\n\n my $PASCAL_FILE = open_file('<', $filename, 0);\n die \"Can't open $filename to determine if it's pascal.\\n\" if !defined $PASCAL_FILE;\n while(<$PASCAL_FILE>) {\n s/\\{.*?\\}//g; # Ignore {...} comments on this line; imperfect, but effective.\n s/\\(\\*.*?\\*\\)//g; # Ignore (*...*) comments on this line; imperfect, but effective.\n if (m/\\bprogram\\s+[A-Za-z]/i) {$is_pascal=1;}\n if (m/\\bunit\\s+[A-Za-z]/i) {$is_pascal=1;}\n if (m/\\bmodule\\s+[A-Za-z]/i) {$is_pascal=1;}\n if (m/\\bprocedure\\b/i) {$is_pascal = 1; }\n if (m/\\bfunction\\b/i) {$is_pascal = 1; }\n if (m/^\\s*interface\\s+/i) {$is_pascal = 1; }\n if (m/^\\s*implementation\\s+/i) {$is_pascal = 1; }\n if (m/\\bconstant\\s+/i) {$is_pascal=1;}\n if (m/\\bbegin\\b/i) { $found_begin = 1; }\n if ((m/end\\.\\s*$/i) && ($found_begin = 1)) {$is_pascal = 1;}\n if ($is_pascal) {\n last;\n }\n }\n\n close($PASCAL_FILE);\n return $is_pascal;\n} # 1}}}\nsub really_is_php { # {{{1\n# Given filename, returns TRUE if its contents really is php.\n\n my $filename = shift;\n chomp($filename);\n\n my $is_php = 0; # Value to determine.\n # Need to find a matching pair of surrounds, with ending after beginning:\n my $normal_surround = 0; # \n my $script_surround = 0; # ; bit 0 = \n\n\n" }, { "path": "tests/inputs/Java.java", "content": "// from http://www.roesler-ac.de/wolfram/hello.htm\n// Hello World in Java\n\n// 2016-12-02: additional code by https://github.com/filippucher1\n// to test /* within quoted string github issue #140\n\n@Controller\n@RequestMapping( \"/path/*\" )\npublic class ControllerClass {\n/** \n* javadoc\n* style\n*/\n\n/* block comment 1 - on one line */\n\n/* \n block comment 2\n*/\n\n/* \n* block comment 3\n*/\n\nimport java.io.*;\nclass HelloWorld {\n static public void main( String args[] ) {\n System.out.println( \"Hello World!\" );\n }\n}\n" }, { "path": "tests/inputs/JetCar.cls", "content": "' https://github.com/badcodes/vb6.git NextPage/JetCar.cls\r\n\r\nVERSION 1.0 CLASS\r\nBEGIN\r\n MultiUse = -1 'True\r\n Persistable = 0 'NotPersistable\r\n DataBindingBehavior = 0 'vbNone\r\n DataSourceBehavior = 0 'vbNone\r\n MTSTransactionMode = 0 'NotAnMTSObject\r\nEND\r\nAttribute VB_Name = \"JetCar\"\r\nAttribute VB_GlobalNameSpace = False\r\nAttribute VB_Creatable = True\r\nAttribute VB_PredeclaredId = False\r\nAttribute VB_Exposed = True\r\n\r\nOption Explicit\r\n\r\nPublic Sub AddUrlList(params)\r\nDim l As Long\r\nDim pCount As Long\r\n\r\nDim fTmp As String\r\n\r\nDo\r\nfTmp = BuildPath(Environ$(\"temp\"), \"NextPage.\" & Int(Rnd(Time) * 1000 + 1))\r\nLoop While PathExists(fTmp)\r\n\r\nIf PathExists(fTmp) Then Kill fTmp\r\n\r\nOpen fTmp For Output As #10\r\n\r\npCount = UBound(params)\r\n\r\nFor l = 0 To pCount\r\nPrint #10, params(l)\r\nNext\r\n\r\nClose #10\r\n\r\nShell BuildPath(App.Path, \"NextPage.exe\") & \" \" & fTmp, vbNormalFocus\r\n\r\n\r\n'JetCarCatch.AddUrlList params\r\nEnd Sub\r\n\r\nPublic Sub AddUrl(URL)\r\n\r\n\r\nDim fTmp As String\r\nDo\r\nfTmp = BuildPath(Environ$(\"temp\"), \"NextPage.\" & Int(Rnd(Time) * 1000 + 1))\r\nLoop While PathExists(fTmp)\r\nIf PathExists(fTmp) Then Kill fTmp\r\n\r\nOpen fTmp For Output As #10\r\nPrint #10, URL\r\nClose #10\r\n\r\nShell BuildPath(App.Path, \"NextPage.exe\") & \" \" & fTmp, vbNormalFocus\r\n\r\nEnd Sub\r\n" }, { "path": "tests/inputs/LaTeX.tex", "content": "% ftp://tug.ctan.org/tex-archive/macros/latex/base/sample2e.tex\n% This is a sample LaTeX input file. (Version of 12 August 2004.)\n%\n% A '%' character causes TeX to ignore all remaining text on the line,\n% and is used for comments like this one.\n\n\\documentclass{article} % Specifies the document class\n\n % The preamble begins here.\n\\title{An Example Document} % Declares the document's title.\n\\author{Leslie Lamport} % Declares the author's name.\n\\date{January 21, 1994} % Deleting this command produces today's date.\n\n\\newcommand{\\ip}[2]{(#1, #2)}\n % Defines \\ip{arg1}{arg2} to mean\n % (arg1, arg2).\n\n%\\newcommand{\\ip}[2]{\\langle #1 | #2\\rangle}\n % This is an alternative definition of\n % \\ip that is commented out.\n\n\\begin{document} % End of preamble and beginning of text.\n\n\\maketitle % Produces the title.\n\nThis is an example input file. Comparing it with\nthe output it generates can show you how to\nproduce a simple document of your own.\n\n\\section{Ordinary Text} % Produces section heading. Lower-level\n % sections are begun with similar \n % \\subsection and \\subsubsection commands.\n\nThe ends of words and sentences are marked \n by spaces. It doesn't matter how many \nspaces you type; one is as good as 100. The\nend of a line counts as a space.\n\nOne or more blank lines denote the end \nof a paragraph. \n\nSince any number of consecutive spaces are treated\nlike a single one, the formatting of the input\nfile makes no difference to\n \\LaTeX, % The \\LaTeX command generates the LaTeX logo.\nbut it makes a difference to you. When you use\n\\LaTeX, making your input file as easy to read \nas possible will be a great help as you write \nyour document and when you change it. This sample \nfile shows how you can add comments to your own input \nfile.\n\nBecause printing is different from typewriting,\nthere are a number of things that you have to do\ndifferently when preparing an input file than if\nyou were just typing the document directly.\nQuotation marks like\n ``this'' \nhave to be handled specially, as do quotes within\nquotes:\n ``\\,`this' % \\, separates the double and single quote.\n is what I just \n wrote, not `that'\\,''. \n\nDashes come in three sizes: an \n intra-word \ndash, a medium dash for number ranges like \n 1--2, \nand a punctuation \n dash---like \nthis.\n\nA sentence-ending space should be larger than the\nspace between words within a sentence. You\nsometimes have to type special commands in\nconjunction with punctuation characters to get\nthis right, as in the following sentence.\n Gnats, gnus, etc.\\ all % `\\ ' makes an inter-word space.\n begin with G\\@. % \\@ marks end-of-sentence punctuation.\nYou should check the spaces after periods when\nreading your output to make sure you haven't\nforgotten any special cases. Generating an\nellipsis\n \\ldots\\ % `\\ ' is needed after `\\ldots' because TeX \n % ignores spaces after command names like \\ldots \n % made from \\ + letters.\n %\n % Note how a `%' character causes TeX to ignore \n % the end of the input line, so these blank lines \n % do not start a new paragraph.\n %\nwith the right spacing around the periods requires\na special command.\n\n\\LaTeX\\ interprets some common characters as\ncommands, so you must type special commands to\ngenerate them. These characters include the\nfollowing:\n \\$ \\& \\% \\# \\{ and \\}.\n\nIn printing, text is usually emphasized with an\n \\emph{italic} \ntype style. \n\n\\begin{em}\n A long segment of text can also be emphasized \n in this way. Text within such a segment can be \n given \\emph{additional} emphasis.\n\\end{em}\n\nIt is sometimes necessary to prevent \\LaTeX\\ from\nbreaking a line where it might otherwise do so.\nThis may be at a space, as between the ``Mr.''\\ and\n``Jones'' in\n ``Mr.~Jones'', % ~ produces an unbreakable interword space.\nor within a word---especially when the word is a\nsymbol like\n \\mbox{\\emph{itemnum}} \nthat makes little sense when hyphenated across\nlines.\n\nFootnotes\\footnote{This is an example of a footnote.}\npose no problem.\n\n\\LaTeX\\ is good at typesetting mathematical formulas\nlike\n \\( x-3y + z = 7 \\) \nor\n \\( a_{1} > x^{2n} + y^{2n} > x' \\)\nor \n \\( \\ip{A}{B} = \\sum_{i} a_{i} b_{i} \\).\nThe spaces you type in a formula are \nignored. Remember that a letter like\n $x$ % $ ... $ and \\( ... \\) are equivalent\nis a formula when it denotes a mathematical\nsymbol, and it should be typed as one.\n\n\\section{Displayed Text}\n\nText is displayed by indenting it from the left\nmargin. Quotations are commonly displayed. There\nare short quotations\n\\begin{quote}\n This is a short quotation. It consists of a \n single paragraph of text. See how it is formatted.\n\\end{quote}\nand longer ones.\n\\begin{quotation}\n This is a longer quotation. It consists of two\n paragraphs of text, neither of which are\n particularly interesting.\n\n This is the second paragraph of the quotation. It\n is just as dull as the first paragraph.\n\\end{quotation}\nAnother frequently-displayed structure is a list.\nThe following is an example of an \\emph{itemized}\nlist.\n\\begin{itemize}\n \\item This is the first item of an itemized list.\n Each item in the list is marked with a ``tick''.\n You don't have to worry about what kind of tick\n mark is used.\n\n \\item This is the second item of the list. It\n contains another list nested inside it. The inner\n list is an \\emph{enumerated} list.\n \\begin{enumerate}\n \\item This is the first item of an enumerated \n list that is nested within the itemized list.\n\n \\item This is the second item of the inner list. \n \\LaTeX\\ allows you to nest lists deeper than \n you really should.\n \\end{enumerate}\n This is the rest of the second item of the outer\n list. It is no more interesting than any other\n part of the item.\n \\item This is the third item of the list.\n\\end{itemize}\nYou can even display poetry.\n\\begin{verse}\n There is an environment \n for verse \\\\ % The \\\\ command separates lines\n Whose features some poets % within a stanza.\n will curse. \n\n % One or more blank lines separate stanzas.\n\n For instead of making\\\\\n Them do \\emph{all} line breaking, \\\\\n It allows them to put too many words on a line when they'd rather be \n forced to be terse.\n\\end{verse}\n\nMathematical formulas may also be displayed. A\ndisplayed formula \nis \none-line long; multiline\nformulas require special formatting instructions.\n \\[ \\ip{\\Gamma}{\\psi'} = x'' + y^{2} + z_{i}^{n}\\]\nDon't start a paragraph with a displayed equation,\nnor make one a paragraph by itself.\n\n\\end{document} % End of document.\n" }, { "path": "tests/inputs/Lanczos.m", "content": "function [phiKM, AscendingLambda] = Lanczos(K, M, sigma, Jmax)\n[rows,cols] = size(K); \nif (rows ~= cols) \n fprintf('Lanczos needs square matrices'); \nend \nZ = K - sigma*M; % initialize some\nQ = zeros(rows,Jmax+1); % variables\nT = zeros(Jmax,Jmax); %\nrRand = randn(rows,1); %\nrOld = rRand;\nbetaOld = sqrt(rOld'*M*rOld); %\nfor j = 1:Jmax, %\n Q(:,j+1) = rOld/betaOld; %\n u = Z \\ (M*Q(:,j+1) - Z*Q(:,j)*betaOld); % D.S.Scott's formulation\n alpha = Q(:,j+1)'*M*u; % of the recurrence\n r = u - alpha*Q(:,j+1); %\n for i=1:3, %\n sum = zeros(rows,1); % repeat a full orhto-\n for k=2:j+1, % gonalization three\n sum = sum + (Q(:,k)'*M*r)*Q(:,k); % times to ensure\n end; % high quality\n r = r - sum; % solutions\n end; %\n beta = sqrt(r'*M*r); %\n T(j,j) = alpha; %\n if (j ~= Jmax) % augment [T] with new\n T(j+1,j) = beta; % alpha_i, beta_i+1\n T(j,j+1) = beta; %\n end; %\n Jactual = j; %\n if (abs(beta) < 1.0e-12) % singular beta; going\n break % any more will introduce\n end % spurious modes\n betaOld = beta; %\n rOld = r; %\nend %\n[phiT,lambdaT] = eig(T(1:Jactual,1:Jactual)); % solve [T]{y} = L{y}\nlambdaKM = zeros(Jactual,1); %\nfor j = 1:Jactual, % invert and shift the\n lambdaKM(j) = sigma + 1/lambdaT(j,j); % eigenvalues to the\nend % user's domain\n[AscendingLambda, ordering] = sort(lambdaKM); %\nphiKM = zeros(rows,Jactual); % sort the eigenvalues\nUnOrdphiKM = zeros(rows,Jactual); % in ascending order\nUnOrdphiKM = Q(:,2:Jactual+1)*phiT; %\nfor j = 1:Jactual, % resequence the e-vectors\n phiKM(:,j) = UnOrdphiKM(:,ordering(j)); % to correspond to the\nend % e-values\n" }, { "path": "tests/inputs/LogMain.re", "content": "/* LogMain.re */\n/*\n * Example from http://2ality.com/2017/12/modules-reasonml.html\n */\n\nlet () = Log.make()\n |> Log.logStr(\" /* Hello\") /* another comment */\n |> Log.logStr(\"everyone\")\n |> Log.print;\n\n/* Output:\nHello\neveryone\n*/\n" }, { "path": "tests/inputs/Lookup.agda", "content": "{- \nhttps://raw.githubusercontent.com/agda/agda/master/examples/Lookup.agda\n -}\nmodule Lookup where\n\ndata Bool : Set where\n false : Bool\n true : Bool\n\ndata IsTrue : Bool -> Set where\n isTrue : IsTrue true\n\ndata List (A : Set) : Set where\n [] : List A\n _::_ : A -> List A -> List A\n\ndata _×_ (A B : Set) : Set where\n _,_ : A -> B -> A × B\n\nmodule Map {- comment -}\n (Key : Set)\n (_==_ : Key -> Key -> Bool)\n (Code : Set)\n (Val : Code -> Set) where\n\n infixr 40 _⟼_,_\n infix 20 _∈_\n\n data Map : List Code -> Set where\n ε : Map []\n _⟼_,_ : forall {c cs} ->\n Key -> Val c -> Map cs -> Map (c :: cs)\n\n _∈_ : forall {cs} -> Key -> Map cs -> Bool\n k ∈ ε = false\n k ∈ (k' ⟼ _ , m) with k == k'\n ... | true = true\n ... | false = k ∈ m\n\n Lookup : forall {cs} -> (k : Key)(m : Map cs) -> IsTrue (k ∈ m) -> Set\n Lookup k ε ()\n Lookup k (_⟼_,_ {c} k' _ m) p with k == k'\n ... | true = Val c\n ... | false = Lookup k m p\n\n lookup : {cs : List Code}(k : Key)(m : Map cs)(p : IsTrue (k ∈ m)) ->\n Lookup k m p\n lookup k ε ()\n lookup k (k' ⟼ v , m) p with k == k'\n ... | true = v\n ... | false = lookup k m p\n" }, { "path": "tests/inputs/MSDOS.bat", "content": "REM from http://www.roesler-ac.de/wolfram/hello.htm\n@ECHO OFF\nREM Hello World for DOS batch\n\nECHO Hello World!\n" }, { "path": "tests/inputs/Makefile", "content": "############################################################################\n#\n# Program: ARPACK\n#\n# Module: Makefile\n#\n# Purpose: Sources Makefile\n#\n# Creation date: February 22, 1996\n#\n# Modified:a September 9, 1996\n#\n# Send bug reports, comments or suggestions to arpack.caam.rice.edu\n#\n############################################################################\n#\\SCCS Information: @(#) \n# FILE: Makefile SID: 2.2 DATE OF SID: 9/24/96 RELEASE: 2\n \ninclude ../ARmake.inc\n \n############################################################################\n# To create or add to the library, enter make followed by one or\n# more of the precisions desired. Targets sdrv, ddrv, cdrv,\n# zdrv are used to add to the library LAPACK routines needed by driver\n# programs in the EXAMPLES directory.\n#\n# Some examples:\n# make single\n# make single sdrv\n# make single complex\n# make single double complex complex16\n# Alternatively, the command\n# make\n# without any arguments creates a library of all four precisions.\n# The library also contains all extra BLAS routines used by driver\n# programs in the EXAMPLES directory.\n#\n# The name of the library is defined by $(ARPACKLIB) in\n# ../ARmake.inc and is created at the next higher directory level.\n#\n#\nSOBJ = sgeqr2.o slabad.o slacon.o slacpy.o sladiv.o slae2.o slaev2.o\\\n slaexc.o slagtm.o slahqr.o slaln2.o slamch.o slange.o slanhs.o\\\n slanst.o slanv2.o slaptm.o slapy2.o slapy3.o slaran.o slarf.o\\\n slarfg.o slarfx.o slarnd.o slarnv.o slartg.o slaruv.o slascl.o\\\n slaset.o slasr.o slasrt.o slassq.o slasy2.o sorm2r.o ssteqr.o\\\n strevc.o strexc.o strsen.o strsyl.o\n\nDOBJ = dgeqr2.o dlabad.o dlacon.o dlacpy.o dladiv.o dlae2.o dlaev2.o\\\n dlaexc.o dlagtm.o dlahqr.o dlaln2.o dlamch.o dlange.o dlanhs.o\\\n dlanst.o dlanv2.o dlaptm.o dlapy2.o dlapy3.o dlaran.o dlarf.o\\\n dlarfg.o dlarfx.o dlarnd.o dlarnv.o dlartg.o dlaruv.o dlascl.o\\\n dlaset.o dlasr.o dlasrt.o dlassq.o dlasy2.o dorm2r.o dsteqr.o\\\n dtrevc.o dtrexc.o dtrsen.o dtrsyl.o\n\nIOBJ = ilaenv.o lsame.o lsamen.o xerbla.o xlaenv.o\n\nCIOBJ = icmax1.o \n\nZIOBJ = izmax1.o\n\nCOBJ = cgeqr2.o clacon.o clacpy.o cladiv.o clahqr.o clange.o clanhs.o\\\n clarf.o clarfg.o clarnv.o clartg.o clascl.o claset.o classq.o\\\n clatrs.o cmach.o crot.o ctrevc.o ctrexc.o ctrsen.o ctrsyl.o\\\n cunm2r.o\\\n scsum1.o slabad.o sladiv.o slamch.o slapy2.o slapy3.o slaruv.o\n\nZOBJ = zgeqr2.o zlacon.o zlacpy.o zladiv.o zlahqr.o zlange.o zlanhs.o\\\n zlarf.o zlarfg.o zlarnv.o zlartg.o zlascl.o zlaset.o zlassq.o\\\n zlatrs.o zmach.o zrot.o ztrevc.o ztrexc.o ztrsen.o ztrsyl.o\\\n zunm2r.o\\\n dzsum1.o dlabad.o dladiv.o dlamch.o dlapy2.o dlapy3.o dlaruv.o\n#\n# The following LAPACK routines are not needed by ARPACK\n# source code. They are used by the drivers in EXAMPLES\n# directory.\n#\nSDRVOBJ = sgbtf2.o sgbtrf.o sgbtrs.o sgttrf.o sgttrs.o spttrf.o spttrs.o\\\n slaswp.o \n\nDDRVOBJ = dgbtf2.o dgbtrf.o dgbtrs.o dgttrf.o dgttrs.o dpttrf.o dpttrs.o\\\n dlaswp.o\n\nCDRVOBJ = cgbtf2.o cgbtrf.o cgbtrs.o cgttrf.o cgttrs.o claswp.o clacgv.o\n\nZDRVOBJ = zgbtrf.o zgbtrs.o zgbtf2.o zgttrf.o zgttrs.o zlaswp.o zlacgv.o\n\n.SUFFIXES: .o .F .f\n\n.f.o:\n\t$(FC) $(FFLAGS) -c $<\n\nall: single double complex complex16 sdrv ddrv cdrv zdrv\n \nsingle: $(SOBJ) $(IOBJ)\n\t$(AR) $(ARFLAGS) $(ARPACKLIB) $(SOBJ) $(IOBJ)\n\t$(RANLIB) $(ARPACKLIB)\n \ndouble: $(DOBJ) $(IOBJ)\n\t$(AR) $(ARFLAGS) $(ARPACKLIB) $(DOBJ) $(IOBJ)\n\t$(RANLIB) $(ARPACKLIB)\n\ncomplex: $(COBJ) $(CIOBJ) $(IOBJ)\n\t$(AR) $(ARFLAGS) $(ARPACKLIB) $(COBJ) $(CIOBJ) $(IOBJ)\n\t$(RANLIB) $(ARPACKLIB)\n\ncomplex16: $(ZOBJ) $(ZIOBJ) $(IOBJ)\n\t$(AR) $(ARFLAGS) $(ARPACKLIB) $(ZOBJ) $(ZIOBJ) $(IOBJ)\n\t$(RANLIB) $(ARPACKLIB) \n#\n# Add routines needed by driver programs (in the EXAMPLES\n# directory) to $(ARPACKLIB).\n#\nsdrv: $(SDRVOBJ) $(CDRVOBJ)\n\t$(AR) $(ARFLAGS) $(ARPACKLIB) $(SDRVOBJ) $(CDRVOBJ)\n\t$(RANLIB) $(ARPACKLIB)\n\nddrv: $(DDRVOBJ) $(ZDRVOBJ)\n\t$(AR) $(ARFLAGS) $(ARPACKLIB) $(DDRVOBJ) $(ZDRVOBJ)\n\t$(RANLIB) $(ARPACKLIB)\n\ncdrv: $(CDRVOBJ)\n\t$(AR) $(ARFLAGS) $(ARPACKLIB) $(CDRVOBJ)\n\t$(RANLIB) $(ARPACKLIB)\n\nzdrv: $(ZDRVOBJ)\n\t$(AR) $(ARFLAGS) $(ARPACKLIB) $(ZDRVOBJ)\n\t$(RANLIB) $(ARPACKLIB)\n\n# clean\t- remove all object files\n#\nclean:\n\trm -f *.o a.out core\n" }, { "path": "tests/inputs/Mako.mako", "content": "## This is the test file for mako extenstion\n## As Mako can be used as a template to render almost any other\n## language we only count mako comments as comments.\n\n
    \n% for x in range(10):\n \n
  1. ${strong(x)}
    2. \n% endfor\n
\n\n<%def name=\"strong(x)\">\n ${x}\n\n\n## Result:\n## Lines: 20\n## Code: 9\n## Comment: 8\n## Blank: 3\n" }, { "path": "tests/inputs/Mathematica_1.m", "content": "(* http://spot.colorado.edu/~sitelic/samplecode/mathematica/imagesfile.html\n *)\n\nimage = Import[\"denise.png\",\"PNG\"] (* or *)\n\nimage = Import[\"denise.gif\",\"GIF\"]\n\nA = image[[1,1]]/255.;\nListDensityPlot[A,Mesh->False, AspectRatio->Automatic]\n\n(*\n -- or -- \n *)\n\nShow[Graphics[Raster[A]], AspectRatio->Automatic]\n\n\nblurA = ListConvolve[Table[1/25,{5},{5}],A];\n\nShow[Graphics[Raster[blurA]], AspectRatio->Automatic]\nB = Fourier[A];\n\n(*\n delete\n higher frequencies *)\n\nB[[Range[30,278],All]]=0;\n\nB[[All,Range[30,202]]]=0;\n\nShow[Graphics[Raster[ Re[InverseFourier[B]] ]], AspectRatio->Automatic]\n" }, { "path": "tests/inputs/Mathematica_2.wlt", "content": "(* \n http://spot.colorado.edu/~sitelic/samplecode/mathematica/imagesfile.html\n *)\n\nimage = Import[\"denise.png\",\"PNG\"] (* or *)\n\nimage = Import[\"denise.gif\",\"GIF\"]\n\nA = image[[1,1]]/255.;\nListDensityPlot[A,Mesh->False, AspectRatio->Automatic]\n\n(*\n -- or -- \n *)\n\nShow[Graphics[Raster[A]], AspectRatio->Automatic]\n\n\nblurA = ListConvolve[Table[1/25,{5},{5}],A];\n\nShow[Graphics[Raster[blurA]], AspectRatio->Automatic]\nB = Fourier[A];\n\n(*\n delete\n higher frequencies *)\n\nB[[Range[30,278],All]]=0;\n\nB[[All,Range[30,202]]]=0;\n\nShow[Graphics[Raster[ Re[InverseFourier[B]] ]], AspectRatio->Automatic]\n" }, { "path": "tests/inputs/Mojo.mojom", "content": "// Mojo files usually start with a multiline comment and/or copyright\n// statement. They are otherwise quite close to C++ files.\n\nmodule example_service.mojom;\n\nimport \"mojo/public/mojom/base/time.mojom\";\nimport \"some/other/project/base.mojom\";\n\nenum BasicEnum {\n kField1,\n kField2,\n};\n\nstruct BasicStruct {\n // Comment about a field.\n mojo_base.mojom.TimeDelta duration;\n};\n\n[annotation]\ninterface ExampleInterface {\n // Returns a thing from a place using its arguments.\n DecodeInput(array input_data, BasicEnum value, bool flag,\n int64 size_of_the_thing)\n => (BasicStruct? result_maybe);\n\n Frobnicate(map?>?>?> ridiculous) => (array guid);\n};\n" }, { "path": "tests/inputs/Mumps.mps", "content": "; from http://www.roesler-ac.de/wolfram/hello.htm\r\n; Hello World in Mumps-M\r\n w !,\"Hello World\"\r\n" }, { "path": "tests/inputs/Octave.m", "content": "% from http://www.roesler-ac.de/wolfram/hello.htm\r\n#Hello World in Octave (http://www.octave.org/)\r\nprintf(\"Hello World\\n\");\r\n" }, { "path": "tests/inputs/Once.HC", "content": "/*\nhttps://raw.githubusercontent.com/cia-foundation/TempleOS/archive/Once.HC\n*/\n//Place this file in /Home and change\n//anything you want.\n\n//This file is executed by the\n//first terminal window upon start-up.\n//See $LK,\"Once\",A=\"FF:~/HomeSys.HC,Once\"$ and $LK,\"Home Files\",A=\"FF:::/Doc/GuideLines.DD,/Home Files\"$.\n\n//Delete the rest from this file.\n\nU0 Tmp()\n{\n OnceExe;\n switch (sys_boot_src.u16[0]) {\n case BOOT_SRC_ROM:\n \"Continue booting hard drive \";\n if (YorN) {\n\tDocBottom;\n\tExeFile(\"C:/Home/Once\");\n }\n break;\n case BOOT_SRC_DVD:\n \"\\nIf you answer 'No' you can play with\\n\"\n\t \"the live CD without installing.\\n\\n\"\n\t \"Install onto hard drive \";\n if (YorN) {\n\tDocBottom;\n\tRunFile(\"::/Misc/OSInstall\",,TRUE);\n }\n if (FileFind(\"::/Misc/Tour\")) {\n\t\"\\nTake Tour\";\n\tif (YorN) {\n\t DocBottom;\n\t Cd(\"::/Misc/Tour\");\n\t InFile(\"Tour\");\n\t}\n }\n break;\n/* case BOOT_SRC_RAM:\n case BOOT_SRC_HARDDRV:\n \"$$PURPLE$$$$TX+CX,\\\"Tip of the Day\\\"$$$$FG$$\\n\";\n TipOfDay;\n Type(\"::/Doc/Customize.DD\");\n if */ (FileFind(\"::/Misc/Tour\")) {\n\t\"\\nTake Tour\";\n\tif (YorN) {\n\t DocBottom;\n\t Cd(\"::/Misc/Tour\");\n\t InFile(\"Tour\");\n\t}\n }\n break;\n }\n}\n\nTmp;\n" }, { "path": "tests/inputs/Pascal.p", "content": "(* from http://www.roesler-ac.de/wolfram/hello.htm *)\n{Hello World in Pascal}\n\nprogram HelloWorld(output);\nbegin\n WriteLn('Hello World!');\nend.\n" }, { "path": "tests/inputs/Pascal.pas", "content": "(* from http://www.roesler-ac.de/wolfram/hello.htm *)\n{Hello World in Pascal}\n\nprogram HelloWorld(output);\nbegin\n WriteLn('Hello World!');\nend.\n" }, { "path": "tests/inputs/Pascal.pp", "content": "(* from http://www.roesler-ac.de/wolfram/hello.htm *)\n{Hello World in Pascal}\n{! compiler directive, not a comment}\n\nprogram HelloWorld(output);\nbegin \n WriteLn('Hello World!'); (*\n *)\nend.\n" }, { "path": "tests/inputs/PlusCalExample.tla", "content": "---- MODULE PlusCalExample ----\n(* TLA+/PlusCal example program. *)\n(* Multi-line\n (* nested *)\n comment *)\n\\* Single-line comment\n\n\\* The code below appears to be a TLA+ comment but is PlusCal code which should\n\\* always be line-counted.\n\\* Grammar rules for PlusCal are specified in appendices A and C of A PlusCal\n\\* User's Manual: https://lamport.azurewebsites.net/tla/c-manual.pdf\n(*\nPlusCal options (-sf)\n--algorithm Example {\n process (A = 0) {\n Start: skip;\n }\n}\nThis is a comment line.\n*)\n\n\\* The code between BEGIN( )TRANSLATION and END( )TRANSLATION should be\n\\* line-counted as generated code.\n\\* BEGIN TRANSLATION (chksum(pcal) = \"7bf2389f\" /\\ chksum(tla) = \"dd78b4d4\")\nVARIABLE pc\n\nvars == << pc >>\n\nProcSet == {0}\n\nInit == /\\ pc = [self \\in ProcSet |-> \"Start\"]\n\nStart == /\\ pc[0] = \"Start\"\n /\\ TRUE\n /\\ pc' = [pc EXCEPT ![0] = \"Done\"]\n\nA == Start\n\n(* Allow infinite stuttering to prevent deadlock on termination. *)\nTerminating == /\\ \\A self \\in ProcSet: pc[self] = \"Done\"\n /\\ UNCHANGED vars\n\nNext == A\n \\/ Terminating\n\nSpec == /\\ Init /\\ [][Next]_vars\n /\\ SF_vars(A)\n\nTermination == <>(\\A self \\in ProcSet: pc[self] = \"Done\")\n\n\\* END TRANSLATION\n\n====\n" }, { "path": "tests/inputs/Prelude.dhall", "content": "{- https://github.com/dhall-lang/dhall-nethack/raw/master/Prelude.dhall\n This file provides a central `Prelude` import for the rest of the library to\n use so that the integrity check only needs to be updated in one place\n whenever upgrading the interpreter.\n\n This allows the user to provide their own Prelude import using the\n `DHALL_PRELUDE` environment variable, like this:\n\n ```\n $ export DHALL_PRELUDE='https://prelude.dhall-lang.org/package.dhall sha256:...'\n ```\n\n Note that overriding the Prelude in this way only works if this repository\n is imported locally. Remote imports do not have access to environment\n variables and any attempt to import one will fall back to the next available\n import. To learn more, read:\n\n * https://github.com/dhall-lang/dhall-lang/wiki/Safety-guarantees#cross-site-scripting-xss\n\n This file also provides an import without the integrity check as a slower\n fallback if the user is using a different version of the Dhall interpreter.\n-}\n\n env:DHALL_PRELUDE\n? https://raw.githubusercontent.com/dhall-lang/dhall-lang/v8.0.0/Prelude/package.dhall sha256:0c04cbe34f1f2d408e8c8b8cb0aa3ff4d5656336910f7e86190a6d14326f966d\n? https://raw.githubusercontent.com/dhall-lang/dhall-lang/v8.0.0/Prelude/package.dhall\n" }, { "path": "tests/inputs/ProcessPO.odx", "content": "#if __DESIGNER_DATA\n#error Do not define __DESIGNER_DATA.\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n#endif // __DESIGNER_DATA\n[Microsoft.XLANGs.BaseTypes.BPELExportable(false)]\nmodule BTSJSON\n{\n internal porttype PortType_1\n {\n oneway Operation_1\n {\n PO\n };\n };\n internal porttype PortType_2\n {\n oneway Operation_1\n {\n Invoice\n };\n };\n [Microsoft.XLANGs.BaseTypes.BPELExportable(false)]\n internal service ProcessPO\n {\n [Microsoft.XLANGs.BaseTypes.LogicalBinding()]\n port implements PortType_1 ReceiveJSONPO;\n [Microsoft.XLANGs.BaseTypes.LogicalBinding()]\n port uses PortType_2 SendJSONInvoice;\n message PO PurchaseOrder;\n message Invoice InvoiceMsg;\n body ()\n {\n [Microsoft.XLANGs.BaseTypes.DesignerPosition(\"d478ac91-37ac-418c-b2c8-2f778319667c\")]\n activate receive (ReceiveJSONPO.Operation_1, PurchaseOrder);\n [Microsoft.XLANGs.BaseTypes.DesignerPosition(\"959a30c2-92c8-47d1-8df6-7243e961bb23\")]\n construct InvoiceMsg\n {\n [Microsoft.XLANGs.BaseTypes.DesignerPosition(\"ac70f963-dad1-4533-85c1-e8ecd4117659\")]\n transform (InvoiceMsg) = BTSJSON.POToInvoice (PurchaseOrder);\n }\n [Microsoft.XLANGs.BaseTypes.DesignerPosition(\"61187953-153a-45c9-bc90-b537e4765026\")]\n send (SendJSONInvoice.Operation_1, InvoiceMsg);\n }\n }\n}\n\n" }, { "path": "tests/inputs/RedBlackTree.res", "content": "// a portion of https://github.com/github/linguist/raw/master/samples/ReScript/RedBlackTree.res\n\n/*\nCredit to Wikipedia's article on [Red-black\ntree](http://en.wikipedia.org/wiki/Red–black_tree)\n\n**Note:** doesn't handle duplicate entries. This is by design.\n\n## Overview example:\n\n```\nvar rbt = new RedBlackTree([7, 5, 1, 8])\nrbt.add(2) // => 2\nrbt.add(10) // => 10\nrbt.has(5) // => true\nrbt.remove(8) // => 8\n```\n\n## Properties:\n\n- size: The total number of items.\n*/\n\ntype nodeColor =\n | Red\n | Black\n\n/*\nProperty of a red-black tree, taken from Wikipedia:\n1. A node is either red or black.\n2. Root is black.\n3. Leaves are all null and considered black.\n4. Both children of a red node are black.\n5. Every path from a node to any of its descendent leaves contains the same\nnumber of black nodes.\n*/\n\ntype rec node<'value> = {\n mutable left: option>,\n mutable right: option>,\n mutable parent: option>,\n mutable sum: float,\n mutable color : nodeColor,\n mutable height: float,\n mutable value: 'value,\n}\n\ntype t<'value> = {\n mutable size: int,\n mutable root: option>,\n compare: (. 'value, 'value) => int,\n}\n\nlet createNode = (~color, ~value, ~height) =>\n {left:None, right:None, parent:None, sum:0., height, value, color}\n\nexternal castNotOption: option<'a> => 'a = \"%identity\"\n\nlet updateSum = (node) => {\n let leftSum = switch node.left {\n | None => 0.\n | Some(left) => left.sum\n }\n let rightSum = switch node.right {\n | None => 0.\n | Some(right) => right.sum\n }\n node.sum = leftSum +. rightSum +. node.height\n}\n\n/* Update the sum for the node and parents recursively. */\nlet rec updateSumRecursive = (rbt, node) => {\n updateSum(node)\n switch node.parent {\n | None => ()\n | Some(parent) =>\n rbt->updateSumRecursive(parent)\n }\n}\n\nlet grandParentOf = node => {\n switch node.parent {\n | None => None\n | Some(ref_) => ref_.parent\n }\n}\n\nlet isLeft = node => {\n switch node.parent {\n | None => false\n | Some(parent) => Some(node) === parent.left\n }\n}\n\nlet leftOrRightSet = (~node, x, value) => {\n isLeft(node) ? x.left=value : x.right=value\n}\n\nlet siblingOf = node => {\n if isLeft(node) {\n castNotOption(node.parent).right\n } else {\n castNotOption(node.parent).left\n }\n}\n\nlet uncleOf = node => {\n switch grandParentOf(node) {\n | None => None\n | Some(grandParentOfNode) =>\n if isLeft(castNotOption(node.parent)) {\n grandParentOfNode.right\n } else {\n grandParentOfNode.left\n }\n }\n}\n\nlet rec findNode = (rbt, node, value) => {\n switch node {\n | None => None\n | Some(node) =>\n let cmp = rbt.compare(. value, node.value)\n if cmp === 0 {\n Some(node)\n } else if cmp < 0 {\n findNode(rbt, node.left, value)\n } else {\n findNode(rbt, node.right, value)\n }\n }\n}\n\nlet has = (rbt, value) => findNode(rbt, rbt.root, value) !== None\n\nlet rec peekMinNode = node => switch node {\n | None => None\n | Some(node) =>\n node.left === None ? Some(node) : node.left->peekMinNode\n}\n\nlet rec peekMaxNode = node => switch node {\n | None => None\n | Some(node) =>\n node.right === None ? Some(node) : node.right->peekMaxNode\n}\n\nlet rotateLeft = (rbt, node) => {\n let parent = node.parent\n let right = node.right\n switch parent {\n | Some(parent) =>\n parent->leftOrRightSet(~node, right)\n | None =>\n rbt.root = right\n }\n node.parent = right\n let right = right->castNotOption // precondition\n let rightLeft = right.left\n node.right = rightLeft\n switch rightLeft {\n | Some(rightLeft) =>\n rightLeft.parent = Some(node)\n | None =>\n ()\n }\n right.parent = parent\n right.left = Some(node)\n updateSum(node)\n updateSum(right)\n}\n\n// After adding the node, we need to operate on it to preserve the tree's\n// properties by filtering it through a series of cases. It'd be easier if\n// there's tail recursion in JavaScript, as some cases fix the node but\n// restart the cases on the node's ancestor. We'll have to use loops for now.\n\nlet rec _addLoop = (rbt, currentNode) => {\n // Case 1: node is root. Violates 1. Paint it black.\n if Some(currentNode) === rbt.root {\n currentNode.color = Black\n }\n\n // Case 2: parent black. No properties violated. After that, parent is sure\n // to be red.\n else if (currentNode.parent->castNotOption).color === Black {\n ()\n }\n\n // Case 3: if node's parent and uncle are red, they are painted black.\n // Their parent (node's grandparent) should be painted red, and the\n // grandparent red. Note that node certainly has a grandparent, since at\n // this point, its parent's red, which can't be the root.\n\n // After the painting, the grandparent might violate 2 or 4.\n else if({\n let uncle = uncleOf(currentNode)\n uncle !== None && (uncle->castNotOption).color === Red\n }) {\n (currentNode.parent->castNotOption).color = Black\n (uncleOf(currentNode)->castNotOption).color = Black\n (grandParentOf(currentNode)->castNotOption).color = Red\n _addLoop(rbt, grandParentOf(currentNode)->castNotOption)\n }\n else {\n // At this point, uncle is either black or doesn't exist.\n\n // Case 4: parent red, uncle black, node is right child, parent is left\n // child. Do a left rotation. Then, former parent passes through case 5.\n let currentNode =\n if !isLeft(currentNode) && isLeft(currentNode.parent->castNotOption) {\n rotateLeft(rbt, currentNode.parent->castNotOption)\n currentNode.left->castNotOption\n } else if isLeft(currentNode) && !isLeft(currentNode.parent->castNotOption) {\n rotateRight(rbt, currentNode.parent->castNotOption)\n currentNode.right->castNotOption\n } else {\n currentNode\n }\n\n // Case 5: parent red, uncle black, node is left child, parent is left\n // child. Right rotation. Switch parent and grandparent's color.\n (currentNode.parent->castNotOption).color = Black\n (grandParentOf(currentNode)->castNotOption).color = Red\n if isLeft(currentNode) {\n rotateRight(rbt, grandParentOf(currentNode)->castNotOption)\n } else {\n rotateLeft(rbt, grandParentOf(currentNode)->castNotOption)\n }\n }\n}\n" }, { "path": "tests/inputs/RemoteSiteHelperTest.cls", "content": "// https://github.com/financialforcedev/apex-mdapi.git\n// apex-mdapi/apex-mdapi/src/classes/RemoteSiteHelperTest.cls\n@IsTest\nprivate class RemoteSiteHelperTest \n{\n\t@IsTest\n\tprivate static void testCheckMetadataAPIConnection()\n\t{\t\t\t\n \t// Metadata API web Service mock implementation for tests\n Test.setMock(WebServiceMock.class, new WebServiceMockImpl());\n\t\t\n\t\tRemoteSiteHelperController controller = new RemoteSiteHelperController();\n\t\tSystem.assertEquals(true, controller.MetadataConnectionWarning);\t\t\n\t\tcontroller.MetadataResponse = '';\n\t\tcontroller.displayMetadataResponse();\n\t\tSystem.assertEquals(false, controller.MetadataConnectionWarning);\n\t\tcontroller.MetadataResponse = 'Some Error Creating Remote Site Setting';\n\t\tcontroller.displayMetadataResponse();\n\t\tSystem.assertEquals(true, controller.MetadataConnectionWarning);\n\t}\n\t\n /**\n * Metadata API web service mock class for tests above\n **/\n\tprivate class WebServiceMockImpl implements WebServiceMock \n\t{\n\t\tpublic void doInvoke(\n\t\t\tObject stub, Object request, Map response,\n\t\t\tString endpoint, String soapAction, String requestName,\n\t\t\tString responseNS, String responseName, String responseType) \n\t\t{\n\t\t\tthrow new TestException();\n\t\t}\n\t}\n\t\n\tpublic class TestException extends Exception { }\n}\n" }, { "path": "tests/inputs/RenderTest.metal", "content": "//\n// RenderTest.metal\n// RenderTest\n//\n\n#include \nusing namespace metal;\n#include \"RenderTest.h\"\n\n// Vertex Shader Output\nstruct RenderTestVertexOut {\n float4 position [[position]];\n float pointSize [[point_size]];\n float3 color;\n};\n\nvertex RenderTestVertexOut renderPointVertex(uint vertexID [[vertex_id]],\n constant RenderTestUniforms &uniforms [[buffer(0)]],\n constant TestPoint *points [[buffer(1)]]) {\n \n RenderPointVertexOut out;\n out.position = points[vertexID].position;\n out.pointSize = uniforms.particleSize;\n out.color = float3(1,0,0);\n \n return out;\n}\n\nfragment float4 renderTestFragment(RenderTestVertexOut in [[stage_in]]) {\n return float4(in.color, 1);\n}\n//\n// RenderTest.metal\n// RenderTest\n//\n\n#include \nusing namespace metal;\n#include \"RenderTest.h\"\n\n// Vertex Shader Output\nstruct RenderTestVertexOut {\n float4 position [[position]];\n float pointSize [[point_size]];\n float3 color;\n};\n\nvertex RenderTestVertexOut renderPointVertex(uint vertexID [[vertex_id]],\n constant RenderTestUniforms &uniforms [[buffer(0)]],\n constant TestPoint *points [[buffer(1)]]) {\n \n RenderPointVertexOut out;\n out.position = points[vertexID].position;\n out.pointSize = uniforms.particleSize;\n out.color = float3(1,0,0);\n \n return out;\n}\n\nfragment float4 renderTestFragment(RenderTestVertexOut in [[stage_in]]) {\n return float4(in.color, 1);\n}\n\n" }, { "path": "tests/inputs/Rounds.scad", "content": "// https://raw.githubusercontent.com/UBaer21/UB.scad/main/examples/UBexamples/Rounds.scad\r\ninclude//https://github.com/UBaer21/UB.scad\r\n/*[Hidden]*/\r\n useVersion=22.016;\r\n designVersion=1.1;\r\n info=true;\r\n\r\n/*[ Round Objects ]*/\r\nr=[16,8,4,2]; // corner 1-4 radius - can also be just a number\r\n\r\n\r\nLinEx(20) Quad(20);\r\n\r\nLinEx() Quad([25,30],r=r);\r\nTz(20)LinEx2()Rund(1,2)Stern(5,r1=12,r2=5);\r\n\r\nRundrum(x=30,y=40,r=r)Quad(x=15,y=20,r=r/2,center=false);\r\nTz(30)Rundrum(x=15,eck=3,r=3)Quad(x=5,y=3,r=1,center=false);\r\n\r\nT(50)Pille(l=20,d=10);\r\nT(65)Pille(l=20,d=10,rad=[1,15]);\r\nT(80)Pille(l=20,d=10,rad=1);\r\n\r\n\r\n\r\nT(-50) {\r\n RotEx()T(10)Pille();\r\n RotEx()T(-8)Pille();\r\n}\r\nT(-80) Kassette(gon=3,r=5,help=1);\r\nT(-80,30) Kassette(gon=4,r=[5,2,4,1],mitte=false,help=1);\r\n\r\nT(-80,60)Rundrum(20,20,r=5,grad=60,grad2=120)rotate(90)Vollwelle(extrude=1);\r\n\r\nT(-50,30) RotEx()T(10)Quad(5);\r\n\r\nT(y=-60){\r\n \r\n Prisma(10,20,30,c1=5,s=3);\r\n T(15)Prisma(10,20,30,x2=5,y2=10,c1=5,s=3);\r\n T(30)Prisma(10,20,30,x2=5,y2=10,x2d=10,c1=5,s=3);\r\n T(60) Box(20,z=20,eck=5,s=5,c=10,outer=false);// outer = x= side radius or edge\r\n \r\n T(-30) Tz(15)Superellipse(r=[10,20,30]/2,help=1);\r\n T(-50) Tz(15)Superellipse(r=[10,20,30]/2,n=10);\r\n T(-70) Tz(15)Superellipse(r=[10,20,30]/2,n=4,n3=20);\r\n \r\n}\r\n\r\n\r\nT(y=90){\r\n Torus(trx=5,help=1);\r\n Torus(dia=30,d=5,end=true);\r\n Torus(dia=43,d=5,end=1,grad=270);\r\n Torus(dia=59,d=5,end=+10,grad=270)Quad($d,10);\r\n Torus(dia=79,trxEnd=-9,d=5,end=1,grad=270)Quad($d,10);\r\n T(80) Polar(3)RingSeg(120,r=15,help=1,size=3,h=5,fn2=16);\r\n}\r\n\r\nT(y=160){\r\n RStern();\r\n T(x=50) RStern(messpunkt=0)circle();\r\n}\r\n" }, { "path": "tests/inputs/Sample.mc", "content": "; /* http://msdn.microsoft.com/en-us/library/windows/desktop/dd996907%28v=vs.85%29.aspx \n; more comments\n; */\n\n; // ***** Sample.mc *****\n; // This is the header section.\n\nMessageIdTypedef=DWORD\n\nSeverityNames=(Success=0x0:STATUS_SEVERITY_SUCCESS\nInformational=0x1:STATUS_SEVERITY_INFORMATIONAL\nWarning=0x2:STATUS_SEVERITY_WARNING\nError=0x3:STATUS_SEVERITY_ERROR\n)\n\nFacilityNames=(System=0x0:FACILITY_SYSTEM\nRuntime=0x2:FACILITY_RUNTIME\nStubs=0x3:FACILITY_STUBS\nIo=0x4:FACILITY_IO_ERROR_CODE\n)\n\nLanguageNames=(English=0x409:MSG00409)\nLanguageNames=(Japanese=0x411:MSG00411)\n\n; // The following are message definitions.\n\nMessageId=0x1\nSeverity=Error\nFacility=Runtime\nSymbolicName=MSG_BAD_COMMAND\nLanguage=English\nYou have chosen an incorrect command.\n.\n\nLanguage=Japanese\n\n.\n\nMessageId=0x2\nSeverity=Warning\nFacility=Io\nSymbolicName=MSG_BAD_PARM1\nLanguage=English\nCannot reconnect to the server.\n.\n\nLanguage=Japanese\n\n.\n\nMessageId=0x3\nSeverity=Success\nFacility=System\nSymbolicName=MSG_STRIKE_ANY_KEY\nLanguage=English\nPress any key to continue . . . %0\n.\n\nLanguage=Japanese\n\n.\n\nMessageId=0x4\nSeverity=Error\nFacility=System\nSymbolicName=MSG_CMD_DELETE\nLanguage=English\nFile %1 contains %2 which is in error.\n.\n\nLanguage=Japanese\n\n.\n\nMessageId=0x5\nSeverity=Informational\nFacility=System\nSymbolicName=MSG_RETRYS\nLanguage=English\nThere have been %1!d! attempts with %2!d!%% success%! Disconnect from \nthe server and try again later.\n.\n\nLanguage=Japanese\n\n.\n" }, { "path": "tests/inputs/SimpleODE.mo", "content": "/*\nbased on\nhttps://raw.githubusercontent.com/casella/ScalableTestSuite/master/ScalableTestSuite/Elementary/SimpleODE.mo\n\n*/\n\nwithin ScalableTestSuite.Elementary;\npackage SimpleODE \"Models with simple ODE systems\"\n package Models\n model CascadedFirstOrder\n \"N cascaded first order systems, approximating a pure delay\"\n parameter Integer N = 10 \"Order of the system\";\n parameter Modelica.Units.SI.Time T=1 \"System delay\";\n final parameter Modelica.Units.SI.Time tau=T/N \"Individual time constant\";\n Real x[N]( each start = 0, each fixed = true) \"State array\";\n Real u = 1 \"Cascaded system input\";\n equation\n tau*der(x[1]) = u - x[1];\n for i in 2:N loop\n tau*der(x[i]) = x[i-1] - x[i];\n end for;\n annotation(\n experiment(StopTime = 2,Tolerance = 1e-6),\n Documentation(info = \"

This model is meant to try out the tool\n performance with ODE systems of possibly very large size, with high\n sparsity degree.

\n

The model is a cascaded connection of first order linear systems,\n approximating a pure delay of T seconds as N approaches\n infinity. It contains exactly N state variables and N\n differential equations.

\"));\n end CascadedFirstOrder;\n end Models;\n\n package ScaledExperiments\n model CascadedFirstOrder_N_100\n extends Models.CascadedFirstOrder(N=100);\n annotation(experiment(StopTime = 2, Tolerance = 1e-6),\n __OpenModelica_simulationFlags(s = \"ida\"));\n end CascadedFirstOrder_N_100;\n\n// model CascadedFirstOrder_N_200\n// extends Models.CascadedFirstOrder(N=200);\n// annotation(experiment(StopTime = 2, Tolerance = 1e-6),\n// __OpenModelica_simulationFlags(s = \"ida\"));\n// end CascadedFirstOrder_N_200;\n\n model CascadedFirstOrder_N_400\n extends Models.CascadedFirstOrder(N=400);\n annotation(experiment(StopTime = 2, Tolerance = 1e-6),\n __OpenModelica_simulationFlags(s = \"ida\"));\n end CascadedFirstOrder_N_400;\n\n model CascadedFirstOrder_N_25600\n extends Models.CascadedFirstOrder(N=25600);\n annotation(experiment(StopTime = 2, Tolerance = 1e-6),\n __OpenModelica_simulationFlags(s = \"ida\"));\n end CascadedFirstOrder_N_25600;\n end ScaledExperiments;\nend SimpleODE;\n" }, { "path": "tests/inputs/Slim.html.slim", "content": "
\n\n" }, { "path": "tests/inputs/Slint-helloworld.slint", "content": "component MyButton inherits Text {\n color: black;\n // ...\n}\n\nexport component MyApp inherits Window {\n preferred-width: 200px;\n preferred-height: 100px;\n Rectangle {\n width: 200px;\n height: 100px;\n background: green;\n \n }/* */\n MyButton { \n x:0;y:0; // hello\n text: \"hello\";\n }\n MyButton { // world\n y:0;\n x: 50px;\n text: \"world\";\n }\n}" }, { "path": "tests/inputs/Snakefile", "content": "\"\"\"\nA sample Snakefile for testing line counting\n\"\"\"\n\nSAMPLES = [\"A\", \"B\"]\n\n\n# This is a\n# multiline\n# comment\nrule all:\n input:\n \"plots/quals.svg\"\n\n\nrule bwa_map:\n input:\n \"data/genome.fa\", # Inline comments are also supported\n \"data/samples/{sample}.fastq\"\n output:\n \"mapped_reads/{sample}.bam\"\n shell:\n \"bwa mem {input} | samtools view -Sb - > {output}\"\n\n\nrule samtools_sort:\n input:\n \"mapped_reads/{sample}.bam\"\n output:\n \"sorted_reads/{sample}.bam\"\n shell:\n \"samtools sort -T sorted_reads/{wildcards.sample} \"\n \"-O bam {input} > {output}\"\n\n\nrule samtools_index:\n input:\n \"sorted_reads/{sample}.bam\"\n output:\n \"sorted_reads/{sample}.bam.bai\"\n shell:\n \"samtools index {input}\"\n\n\nrule bcftools_call:\n input:\n fa=\"data/genome.fa\",\n bam=expand(\"sorted_reads/{sample}.bam\", sample=SAMPLES),\n bai=expand(\"sorted_reads/{sample}.bam.bai\", sample=SAMPLES)\n output:\n \"calls/all.vcf\"\n shell:\n \"bcftools mpileup -f {input.fa} {input.bam} | \"\n \"bcftools call -mv - > {output}\"\n\n\nrule plot_quals:\n input:\n \"calls/all.vcf\"\n output:\n \"plots/quals.svg\"\n script:\n \"scripts/plot-quals.py\"\n" }, { "path": "tests/inputs/Splice.hs-boot", "content": "-- https://gitlab.haskell.org/ghc/ghc.git\n-- ghc/compiler/GHC/Tc/Gen/Splice.hs-boot\n\n{-# LANGUAGE TypeFamilies #-}\n\nmodule GHC.Tc.Gen.Splice where\n\nimport GHC.Prelude\nimport GHC.Types.Name\nimport GHC.Hs.Expr ( PendingRnSplice, DelayedSplice )\nimport GHC.Tc.Types( TcM , SpliceType )\nimport GHC.Tc.Utils.TcType ( ExpRhoType )\nimport GHC.Types.Annotations ( Annotation, CoreAnnTarget )\nimport GHC.Hs.Extension ( GhcRn, GhcPs, GhcTc )\n\nimport GHC.Hs ( HsQuote, HsExpr, LHsExpr, LHsType, LPat, LHsDecl, ThModFinalizers, HsUntypedSpliceResult, HsTypedSpliceResult, HsTypedSplice )\nimport qualified GHC.Boot.TH.Syntax as TH\nimport qualified GHC.Boot.TH.Monad as TH\n\ntcTypedSplice :: HsTypedSpliceResult\n -> HsTypedSplice GhcRn\n -> ExpRhoType\n -> TcM (HsExpr GhcTc)\n\ntcTypedBracket :: HsExpr GhcRn\n -> LHsExpr GhcRn\n -> ExpRhoType\n -> TcM (HsExpr GhcTc)\ntcUntypedBracket :: HsExpr GhcRn\n -> HsQuote GhcRn\n -> [PendingRnSplice]\n -> ExpRhoType\n\n -> TcM (HsExpr GhcTc)\n\n\nrunTopSplice :: DelayedSplice -> TcM (HsExpr GhcTc)\n\nrunAnnotation :: CoreAnnTarget -> LHsExpr GhcRn -> TcM Annotation\ngetUntypedSpliceBody :: HsUntypedSpliceResult (HsExpr GhcRn) -> TcM (HsExpr GhcRn)\n\ntcTopSpliceExpr :: SpliceType -> TcM (LHsExpr GhcTc) -> TcM (LHsExpr GhcTc)\n\nrunMetaE :: LHsExpr GhcTc -> TcM (LHsExpr GhcPs)\nrunMetaP :: LHsExpr GhcTc -> TcM (LPat GhcPs)\nrunMetaT :: LHsExpr GhcTc -> TcM (LHsType GhcPs)\nrunMetaD :: LHsExpr GhcTc -> TcM [LHsDecl GhcPs]\n\nlookupThName_maybe :: TH.Name -> TcM (Maybe Name)\nrunQuasi :: TH.Q a -> TcM a\nrunRemoteModFinalizers :: ThModFinalizers -> TcM ()\nfinishTH :: TcM ()\n" }, { "path": "tests/inputs/Sys.hx", "content": "/*\n https://raw.githubusercontent.com/HaxeFoundation/haxe/development/std/Sys.hx\n * Copyright (C)2005-2016 Haxe Foundation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n */\n/**\n\tThis class gives you access to many base functionalities of system platforms. Looks in `sys` sub packages for more system APIs.\n**/\n@:require(sys)\nextern class Sys {\n\n\t/**\n\t\tPrint any value on the standard output.\n\t**/\n\tstatic function print( v : Dynamic ) : Void;\n\n\t/**\n\t\tPrint any value on the standard output, followed by a newline.\n\t**/\n\tstatic function println( v : Dynamic ) : Void;\n\n\t/**\n\t\tReturns all the arguments that were passed by the commandline.\n\t**/\n\tstatic function args() : Array;\n\n\t/**\n\t\tReturns the value of the given environment variable.\n\t**/\n\tstatic function getEnv( s : String ) : String;\n\n\t/**\n\t\tSet the value of the given environment variable.\n\t**/\n\tstatic function putEnv( s : String, v : String ) : Void;\n\n\t/**\n\t\tReturns the whole environement variables.\n\t**/\n\tstatic function environment() : Map;\n\n\t/**\n\t\tSuspend the current execution for the given time (in seconds).\n\t**/\n\tstatic function sleep( seconds : Float ) : Void;\n\n\t/**\n\t\tChange the current time locale, which will affect `DateTools.format` date formating.\n\t\tReturns true if the locale was successfully changed\n\t**/\n\tstatic function setTimeLocale( loc : String ) : Bool;\n\n\t/**\n\t\tGet the current working directory (usually the one in which the program was started)\n\t**/\n\tstatic function getCwd() : String;\n\n\t/**\n\t\tChange the current working directory.\n\t**/\n\tstatic function setCwd( s : String ) : Void;\n\n\t/**\n\t\tReturns the name of the system you are running on. For instance :\n\t\t\t\"Windows\", \"Linux\", \"BSD\" and \"Mac\" depending on your desktop OS.\n\t**/\n\tstatic function systemName() : String;\n\n\t/**\n\t\tRun the given command. The command output will be printed on the same output as the current process.\n\t\tThe current process will block until the command terminates and it will return the command result (0 if there was no error).\n\n\t\tCommand arguments can be passed in two ways: 1. using `args`, 2. appending to `cmd` and leaving `args` as `null`.\n\n\t\t 1. When using `args` to pass command arguments, each argument will be automatically quoted, and shell meta-characters will be escaped if needed.\n\t\t`cmd` should be an executable name that can be located in the `PATH` environment variable, or a path to an executable.\n\n\t\t 2. When `args` is not given or is `null`, command arguments can be appended to `cmd`. No automatic quoting/escaping will be performed. `cmd` should be formatted exactly as it would be when typed at the command line.\n\t\tIt can run executables, as well as shell commands that are not executables (e.g. on Windows: `dir`, `cd`, `echo` etc).\n\n\t\tRead the `sys.io.Process` api for a more complete way to start background processes.\n\t**/\n\tstatic function command( cmd : String, ?args : Array ) : Int;\n\n\t/**\n\t\tExit the current process with the given error code.\n\t**/\n\tstatic function exit( code : Int ) : Void;\n\n\t/**\n\t\tGives the most precise timestamp value (in seconds).\n\t**/\n\tstatic function time() : Float;\n\n\t/**\n\t\tGives the most precise timestamp value (in seconds) but only account for the actual time spent running on the CPU for the current thread/process.\n\t**/\n\tstatic function cpuTime() : Float;\n\n\t/**\n\t\tReturns the path to the current executable that we are running.\n\t**/\n\t@:deprecated(\"Use programPath instead\") static function executablePath() : String;\n\n\t/**\n\t\tReturns the absolute path to the current program file that we are running.\n\t\tConcretely, for an executable binary, it returns the path to the binary.\n\t\tFor a script (e.g. a PHP file), it returns the path to the script.\n\t**/\n\tstatic function programPath() : String;\n\n\t/**\n\t\tRead a single input character from the standard input (without blocking) and returns it. Setting `echo` to true will also display it on the output.\n\t**/\n\tstatic function getChar( echo : Bool ) : Int;\n\n\t/**\n\t\tReturns the process standard input, from which you can read what user enters. Usually it will block until the user send a full input line. See `getChar` for an alternative.\n\t**/\n\tstatic function stdin() : haxe.io.Input;\n\n\t/**\n\t\tReturns the process standard output on which you can write.\n\t**/\n\tstatic function stdout() : haxe.io.Output;\n\n\t/**\n\t\tReturns the process standard error on which you can write.\n\t**/\n\tstatic function stderr() : haxe.io.Output;\n\n}\n" }, { "path": "tests/inputs/TLAExample.tla", "content": "---- MODULE TLAExample ----\n(* TLA+ example program. *)\n(* Multi-line\n (* nested *)\n comment *)\n\\* Single-line comment\n\nVARIABLES tlaIsCool\n\nInit == tlaIsCool = TRUE\n\nNext == tlaIsCool = TRUE /\\ tlaIsCool' = TRUE\n====\n" }, { "path": "tests/inputs/TableGen-ARM.td", "content": "//===-- ARM.td - Describe the ARM Target Machine -----------*- tablegen -*-===//\n//\n// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n// See https://llvm.org/LICENSE.txt for license information.\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n//\n//===----------------------------------------------------------------------===//\n//\n//\n//===----------------------------------------------------------------------===//\n\n//===----------------------------------------------------------------------===//\n// Target-independent interfaces which we are implementing\n//===----------------------------------------------------------------------===//\n\ninclude \"llvm/Target/Target.td\"\n\n//===----------------------------------------------------------------------===//\n// ARM Subtarget state.\n//\n\ndef ModeThumb : SubtargetFeature<\"thumb-mode\", \"InThumbMode\",\n \"true\", \"Thumb mode\">;\n\ndef ModeSoftFloat : SubtargetFeature<\"soft-float\",\"UseSoftFloat\",\n \"true\", \"Use software floating \"\n \"point features.\">;\n\n\n//===----------------------------------------------------------------------===//\n// ARM Subtarget features.\n//\n\n// Floating Point, HW Division and Neon Support\n\n// FP loads/stores/moves, shared between VFP and MVE (even in the integer-only\n// version).\ndef FeatureFPRegs : SubtargetFeature<\"fpregs\", \"HasFPRegs\", \"true\",\n \"Enable FP registers\">;\n\n// 16-bit FP loads/stores/moves, shared between VFP (with the v8.2A FP16\n// extension) and MVE (even in the integer-only version).\ndef FeatureFPRegs16 : SubtargetFeature<\"fpregs16\", \"HasFPRegs16\", \"true\",\n \"Enable 16-bit FP registers\",\n [FeatureFPRegs]>;\n\ndef FeatureFPRegs64 : SubtargetFeature<\"fpregs64\", \"HasFPRegs64\", \"true\",\n \"Enable 64-bit FP registers\",\n [FeatureFPRegs]>;\n\ndef FeatureFP64 : SubtargetFeature<\"fp64\", \"HasFP64\", \"true\",\n \"Floating point unit supports \"\n \"double precision\",\n [FeatureFPRegs64]>;\n\ndef FeatureD32 : SubtargetFeature<\"d32\", \"HasD32\", \"true\",\n \"Extend FP to 32 double registers\">;\n\nmulticlass VFPver prev,\n list otherimplies,\n list vfp2prev = []> {\n def _D16_SP: SubtargetFeature<\n name#\"d16sp\", query#\"D16SP\", \"true\",\n description#\" with only 16 d-registers and no double precision\",\n !foreach(v, prev, !cast(v # \"_D16_SP\")) #\n !foreach(v, vfp2prev, !cast(v # \"_SP\")) #\n otherimplies>;\n def _SP: SubtargetFeature<\n name#\"sp\", query#\"SP\", \"true\",\n description#\" with no double precision\",\n !foreach(v, prev, !cast(v # \"_SP\")) #\n otherimplies # [FeatureD32, !cast(NAME # \"_D16_SP\")]>;\n def _D16: SubtargetFeature<\n name#\"d16\", query#\"D16\", \"true\",\n description#\" with only 16 d-registers\",\n !foreach(v, prev, !cast(v # \"_D16\")) #\n vfp2prev #\n otherimplies # [FeatureFP64, !cast(NAME # \"_D16_SP\")]>;\n def \"\": SubtargetFeature<\n name, query, \"true\", description,\n prev # otherimplies # [\n !cast(NAME # \"_D16\"),\n !cast(NAME # \"_SP\")]>;\n}\n\ndef FeatureVFP2_SP : SubtargetFeature<\"vfp2sp\", \"HasVFPv2SP\", \"true\",\n \"Enable VFP2 instructions with \"\n \"no double precision\",\n [FeatureFPRegs]>;\n\ndef FeatureVFP2 : SubtargetFeature<\"vfp2\", \"HasVFPv2\", \"true\",\n \"Enable VFP2 instructions\",\n [FeatureFP64, FeatureVFP2_SP]>;\n\ndefm FeatureVFP3: VFPver<\"vfp3\", \"HasVFPv3\", \"Enable VFP3 instructions\",\n [], [], [FeatureVFP2]>;\n\ndef FeatureNEON : SubtargetFeature<\"neon\", \"HasNEON\", \"true\",\n \"Enable NEON instructions\",\n [FeatureVFP3]>;\n\ndef FeatureFP16 : SubtargetFeature<\"fp16\", \"HasFP16\", \"true\",\n \"Enable half-precision \"\n \"floating point\">;\n\ndefm FeatureVFP4: VFPver<\"vfp4\", \"HasVFPv4\", \"Enable VFP4 instructions\",\n [FeatureVFP3], [FeatureFP16]>;\n\ndefm FeatureFPARMv8: VFPver<\"fp-armv8\", \"HasFPARMv8\", \"Enable ARMv8 FP\",\n [FeatureVFP4], []>;\n\ndef FeatureFullFP16 : SubtargetFeature<\"fullfp16\", \"HasFullFP16\", \"true\",\n \"Enable full half-precision \"\n \"floating point\",\n [FeatureFPARMv8_D16_SP, FeatureFPRegs16]>;\n\ndef FeatureFP16FML : SubtargetFeature<\"fp16fml\", \"HasFP16FML\", \"true\",\n \"Enable full half-precision \"\n \"floating point fml instructions\",\n [FeatureFullFP16]>;\n\ndef FeatureHWDivThumb : SubtargetFeature<\"hwdiv\",\n \"HasHardwareDivideInThumb\", \"true\",\n \"Enable divide instructions in Thumb\">;\n\ndef FeatureHWDivARM : SubtargetFeature<\"hwdiv-arm\",\n \"HasHardwareDivideInARM\", \"true\",\n \"Enable divide instructions in ARM mode\">;\n\n// Atomic Support\ndef FeatureDB : SubtargetFeature<\"db\", \"HasDataBarrier\", \"true\",\n \"Has data barrier (dmb/dsb) instructions\">;\n\ndef FeatureV7Clrex : SubtargetFeature<\"v7clrex\", \"HasV7Clrex\", \"true\",\n \"Has v7 clrex instruction\">;\n\ndef FeatureDFB : SubtargetFeature<\"dfb\", \"HasFullDataBarrier\", \"true\",\n \"Has full data barrier (dfb) instruction\">;\n\ndef FeatureAcquireRelease : SubtargetFeature<\"acquire-release\",\n \"HasAcquireRelease\", \"true\",\n \"Has v8 acquire/release (lda/ldaex \"\n \" etc) instructions\">;\n\n\ndef FeatureSlowFPBrcc : SubtargetFeature<\"slow-fp-brcc\", \"SlowFPBrcc\", \"true\",\n \"FP compare + branch is slow\">;\n\ndef FeaturePerfMon : SubtargetFeature<\"perfmon\", \"HasPerfMon\", \"true\",\n \"Enable support for Performance \"\n \"Monitor extensions\">;\n\n\n// TrustZone Security Extensions\ndef FeatureTrustZone : SubtargetFeature<\"trustzone\", \"HasTrustZone\", \"true\",\n \"Enable support for TrustZone \"\n \"security extensions\">;\n\ndef Feature8MSecExt : SubtargetFeature<\"8msecext\", \"Has8MSecExt\", \"true\",\n \"Enable support for ARMv8-M \"\n \"Security Extensions\">;\n\ndef FeatureSHA2 : SubtargetFeature<\"sha2\", \"HasSHA2\", \"true\",\n \"Enable SHA1 and SHA256 support\", [FeatureNEON]>;\n\ndef FeatureAES : SubtargetFeature<\"aes\", \"HasAES\", \"true\",\n \"Enable AES support\", [FeatureNEON]>;\n\ndef FeatureCrypto : SubtargetFeature<\"crypto\", \"HasCrypto\", \"true\",\n \"Enable support for \"\n \"Cryptography extensions\",\n [FeatureNEON, FeatureSHA2, FeatureAES]>;\n\ndef FeatureCRC : SubtargetFeature<\"crc\", \"HasCRC\", \"true\",\n \"Enable support for CRC instructions\">;\n\ndef FeatureDotProd : SubtargetFeature<\"dotprod\", \"HasDotProd\", \"true\",\n \"Enable support for dot product instructions\",\n [FeatureNEON]>;\n\n// Not to be confused with FeatureHasRetAddrStack (return address stack)\ndef FeatureRAS : SubtargetFeature<\"ras\", \"HasRAS\", \"true\",\n \"Enable Reliability, Availability \"\n \"and Serviceability extensions\">;\n\n// Fast computation of non-negative address offsets\ndef FeatureFPAO : SubtargetFeature<\"fpao\", \"HasFPAO\", \"true\",\n \"Enable fast computation of \"\n \"positive address offsets\">;\n\n// Fast execution of AES crypto operations\ndef FeatureFuseAES : SubtargetFeature<\"fuse-aes\", \"HasFuseAES\", \"true\",\n \"CPU fuses AES crypto operations\">;\n\n// Fast execution of bottom and top halves of literal generation\ndef FeatureFuseLiterals : SubtargetFeature<\"fuse-literals\", \"HasFuseLiterals\", \"true\",\n \"CPU fuses literal generation operations\">;\n\n// The way of reading thread pointer \ndef FeatureReadTp : SubtargetFeature<\"read-tp-hard\", \"ReadTPHard\", \"true\",\n \"Reading thread pointer from register\">;\n\n// Cyclone can zero VFP registers in 0 cycles.\ndef FeatureZCZeroing : SubtargetFeature<\"zcz\", \"HasZeroCycleZeroing\", \"true\",\n \"Has zero-cycle zeroing instructions\">;\n\n// Whether it is profitable to unpredicate certain instructions during if-conversion\ndef FeatureProfUnpredicate : SubtargetFeature<\"prof-unpr\",\n \"IsProfitableToUnpredicate\", \"true\",\n \"Is profitable to unpredicate\">;\n\n// Some targets (e.g. Swift) have microcoded VGETLNi32.\ndef FeatureSlowVGETLNi32 : SubtargetFeature<\"slow-vgetlni32\",\n \"HasSlowVGETLNi32\", \"true\",\n \"Has slow VGETLNi32 - prefer VMOV\">;\n\n// Some targets (e.g. Swift) have microcoded VDUP32.\ndef FeatureSlowVDUP32 : SubtargetFeature<\"slow-vdup32\", \"HasSlowVDUP32\",\n \"true\",\n \"Has slow VDUP32 - prefer VMOV\">;\n\n// Some targets (e.g. Cortex-A9) prefer VMOVSR to VMOVDRR even when using NEON\n// for scalar FP, as this allows more effective execution domain optimization.\ndef FeaturePreferVMOVSR : SubtargetFeature<\"prefer-vmovsr\", \"PreferVMOVSR\",\n \"true\", \"Prefer VMOVSR\">;\n\n// Swift has ISHST barriers compatible with Atomic Release semantics but weaker\n// than ISH\ndef FeaturePrefISHSTBarrier : SubtargetFeature<\"prefer-ishst\", \"PreferISHST\",\n \"true\", \"Prefer ISHST barriers\">;\n\n// Some targets (e.g. Cortex-A9) have muxed AGU and NEON/FPU.\ndef FeatureMuxedUnits : SubtargetFeature<\"muxed-units\", \"HasMuxedUnits\",\n \"true\",\n \"Has muxed AGU and NEON/FPU\">;\n\n// Whether VLDM/VSTM starting with odd register number need more microops\n// than single VLDRS\ndef FeatureSlowOddRegister : SubtargetFeature<\"slow-odd-reg\", \"SlowOddRegister\",\n \"true\", \"VLDM/VSTM starting \"\n \"with an odd register is slow\">;\n\n// Some targets have a renaming dependency when loading into D subregisters.\ndef FeatureSlowLoadDSubreg : SubtargetFeature<\"slow-load-D-subreg\",\n \"SlowLoadDSubregister\", \"true\",\n \"Loading into D subregs is slow\">;\n\ndef FeatureUseWideStrideVFP : SubtargetFeature<\"wide-stride-vfp\",\n \"UseWideStrideVFP\", \"true\",\n \"Use a wide stride when allocating VFP registers\">;\n\n// Some targets (e.g. Cortex-A15) never want VMOVS to be widened to VMOVD.\ndef FeatureDontWidenVMOVS : SubtargetFeature<\"dont-widen-vmovs\",\n \"DontWidenVMOVS\", \"true\",\n \"Don't widen VMOVS to VMOVD\">;\n\n// Some targets (e.g. Cortex-A15) prefer to avoid mixing operations on different\n// VFP register widths.\ndef FeatureSplatVFPToNeon : SubtargetFeature<\"splat-vfp-neon\",\n \"SplatVFPToNeon\", \"true\",\n \"Splat register from VFP to NEON\",\n [FeatureDontWidenVMOVS]>;\n\n// Whether or not it is profitable to expand VFP/NEON MLA/MLS instructions.\ndef FeatureExpandMLx : SubtargetFeature<\"expand-fp-mlx\",\n \"ExpandMLx\", \"true\",\n \"Expand VFP/NEON MLA/MLS instructions\">;\n\n// Some targets have special RAW hazards for VFP/NEON VMLA/VMLS.\ndef FeatureHasVMLxHazards : SubtargetFeature<\"vmlx-hazards\", \"HasVMLxHazards\",\n \"true\", \"Has VMLx hazards\">;\n\n// Some targets (e.g. Cortex-A9) want to convert VMOVRS, VMOVSR and VMOVS from\n// VFP to NEON, as an execution domain optimization.\ndef FeatureNEONForFPMovs : SubtargetFeature<\"neon-fpmovs\",\n \"UseNEONForFPMovs\", \"true\",\n \"Convert VMOVSR, VMOVRS, \"\n \"VMOVS to NEON\">;\n\n// Some processors benefit from using NEON instructions for scalar\n// single-precision FP operations. This affects instruction selection and should\n// only be enabled if the handling of denormals is not important.\ndef FeatureNEONForFP : SubtargetFeature<\"neonfp\",\n \"UseNEONForSinglePrecisionFP\",\n \"true\",\n \"Use NEON for single precision FP\">;\n\n// On some processors, VLDn instructions that access unaligned data take one\n// extra cycle. Take that into account when computing operand latencies.\ndef FeatureCheckVLDnAlign : SubtargetFeature<\"vldn-align\", \"CheckVLDnAlign\",\n \"true\",\n \"Check for VLDn unaligned access\">;\n\n// Some processors have a nonpipelined VFP coprocessor.\ndef FeatureNonpipelinedVFP : SubtargetFeature<\"nonpipelined-vfp\",\n \"NonpipelinedVFP\", \"true\",\n \"VFP instructions are not pipelined\">;\n\n// Some processors have FP multiply-accumulate instructions that don't\n// play nicely with other VFP / NEON instructions, and it's generally better\n// to just not use them.\ndef FeatureHasSlowFPVMLx : SubtargetFeature<\"slowfpvmlx\", \"SlowFPVMLx\", \"true\",\n \"Disable VFP / NEON MAC instructions\">;\n\n// VFPv4 added VFMA instructions that can similar be fast or slow.\ndef FeatureHasSlowFPVFMx : SubtargetFeature<\"slowfpvfmx\", \"SlowFPVFMx\", \"true\",\n \"Disable VFP / NEON FMA instructions\">;\n\n// Cortex-A8 / A9 Advanced SIMD has multiplier accumulator forwarding.\ndef FeatureVMLxForwarding : SubtargetFeature<\"vmlx-forwarding\",\n \"HasVMLxForwarding\", \"true\",\n \"Has multiplier accumulator forwarding\">;\n\n// Disable 32-bit to 16-bit narrowing for experimentation.\ndef FeaturePref32BitThumb : SubtargetFeature<\"32bit\", \"Pref32BitThumb\", \"true\",\n \"Prefer 32-bit Thumb instrs\">;\n\ndef FeaturePrefLoopAlign32 : SubtargetFeature<\"loop-align\", \"PrefLoopLogAlignment\",\"2\",\n \"Prefer 32-bit alignment for loops\">;\n\ndef FeatureMVEVectorCostFactor1 : SubtargetFeature<\"mve1beat\", \"MVEVectorCostFactor\", \"1\",\n \"Model MVE instructions as a 1 beat per tick architecture\">;\n\ndef FeatureMVEVectorCostFactor2 : SubtargetFeature<\"mve2beat\", \"MVEVectorCostFactor\", \"2\",\n \"Model MVE instructions as a 2 beats per tick architecture\">;\n\ndef FeatureMVEVectorCostFactor4 : SubtargetFeature<\"mve4beat\", \"MVEVectorCostFactor\", \"4\",\n \"Model MVE instructions as a 4 beats per tick architecture\">;\n\n/// Some instructions update CPSR partially, which can add false dependency for\n/// out-of-order implementation, e.g. Cortex-A9, unless each individual bit is\n/// mapped to a separate physical register. Avoid partial CPSR update for these\n/// processors.\ndef FeatureAvoidPartialCPSR : SubtargetFeature<\"avoid-partial-cpsr\",\n \"AvoidCPSRPartialUpdate\", \"true\",\n \"Avoid CPSR partial update for OOO execution\">;\n\n/// Disable +1 predication cost for instructions updating CPSR.\n/// Enabled for Cortex-A57.\ndef FeatureCheapPredicableCPSR : SubtargetFeature<\"cheap-predicable-cpsr\",\n \"CheapPredicableCPSRDef\",\n \"true\",\n \"Disable +1 predication cost for instructions updating CPSR\">;\n\ndef FeatureAvoidMOVsShOp : SubtargetFeature<\"avoid-movs-shop\",\n \"AvoidMOVsShifterOperand\", \"true\",\n \"Avoid movs instructions with \"\n \"shifter operand\">;\n\n// Some processors perform return stack prediction. CodeGen should avoid issue\n// \"normal\" call instructions to callees which do not return.\ndef FeatureHasRetAddrStack : SubtargetFeature<\"ret-addr-stack\",\n \"HasRetAddrStack\", \"true\",\n \"Has return address stack\">;\n\n// Some processors have no branch predictor, which changes the expected cost of\n// taking a branch which affects the choice of whether to use predicated\n// instructions.\ndef FeatureHasNoBranchPredictor : SubtargetFeature<\"no-branch-predictor\",\n \"HasBranchPredictor\", \"false\",\n \"Has no branch predictor\">;\n\n/// DSP extension.\ndef FeatureDSP : SubtargetFeature<\"dsp\", \"HasDSP\", \"true\",\n \"Supports DSP instructions in \"\n \"ARM and/or Thumb2\">;\n\n// Multiprocessing extension.\ndef FeatureMP : SubtargetFeature<\"mp\", \"HasMPExtension\", \"true\",\n \"Supports Multiprocessing extension\">;\n\n// Virtualization extension - requires HW divide (ARMv7-AR ARMARM - 4.4.8).\ndef FeatureVirtualization : SubtargetFeature<\"virtualization\",\n \"HasVirtualization\", \"true\",\n \"Supports Virtualization extension\",\n [FeatureHWDivThumb, FeatureHWDivARM]>;\n\n// Special TRAP encoding for NaCl, which looks like a TRAP in Thumb too.\n// See ARMInstrInfo.td for details.\ndef FeatureNaClTrap : SubtargetFeature<\"nacl-trap\", \"UseNaClTrap\", \"true\",\n \"NaCl trap\">;\n\ndef FeatureStrictAlign : SubtargetFeature<\"strict-align\",\n \"StrictAlign\", \"true\",\n \"Disallow all unaligned memory \"\n \"access\">;\n\ndef FeatureLongCalls : SubtargetFeature<\"long-calls\", \"GenLongCalls\", \"true\",\n \"Generate calls via indirect call \"\n \"instructions\">;\n\ndef FeatureExecuteOnly : SubtargetFeature<\"execute-only\",\n \"GenExecuteOnly\", \"true\",\n \"Enable the generation of \"\n \"execute only code.\">;\n\ndef FeatureReserveR9 : SubtargetFeature<\"reserve-r9\", \"ReserveR9\", \"true\",\n \"Reserve R9, making it unavailable\"\n \" as GPR\">;\n\ndef FeatureNoMovt : SubtargetFeature<\"no-movt\", \"NoMovt\", \"true\",\n \"Don't use movt/movw pairs for \"\n \"32-bit imms\">;\n\ndef FeatureNoNegativeImmediates\n : SubtargetFeature<\"no-neg-immediates\",\n \"NegativeImmediates\", \"false\",\n \"Convert immediates and instructions \"\n \"to their negated or complemented \"\n \"equivalent when the immediate does \"\n \"not fit in the encoding.\">;\n\n// Use the MachineScheduler for instruction scheduling for the subtarget.\ndef FeatureUseMISched: SubtargetFeature<\"use-misched\", \"UseMISched\", \"true\",\n \"Use the MachineScheduler\">;\n\ndef FeatureNoPostRASched : SubtargetFeature<\"disable-postra-scheduler\",\n \"DisablePostRAScheduler\", \"true\",\n \"Don't schedule again after register allocation\">;\n\n// Armv8.5-A extensions\n\ndef FeatureSB : SubtargetFeature<\"sb\", \"HasSB\", \"true\",\n \"Enable v8.5a Speculation Barrier\" >;\n\n// Armv8.6-A extensions\ndef FeatureBF16 : SubtargetFeature<\"bf16\", \"HasBF16\", \"true\",\n \"Enable support for BFloat16 instructions\", [FeatureNEON]>;\n\ndef FeatureMatMulInt8 : SubtargetFeature<\"i8mm\", \"HasMatMulInt8\",\n \"true\", \"Enable Matrix Multiply Int8 Extension\", [FeatureNEON]>;\n\n// Armv8.1-M extensions\n\ndef FeatureLOB : SubtargetFeature<\"lob\", \"HasLOB\", \"true\",\n \"Enable Low Overhead Branch \"\n \"extensions\">;\n\ndef FeatureFixCMSE_CVE_2021_35465 : SubtargetFeature<\"fix-cmse-cve-2021-35465\",\n \"FixCMSE_CVE_2021_35465\", \"true\",\n \"Mitigate against the cve-2021-35465 \"\n \"security vulnurability\">;\n\ndef FeaturePACBTI : SubtargetFeature<\"pacbti\", \"HasPACBTI\", \"true\",\n \"Enable Pointer Authentication and Branch \"\n \"Target Identification\">;\n\ndef FeatureNoBTIAtReturnTwice : SubtargetFeature<\"no-bti-at-return-twice\",\n \"NoBTIAtReturnTwice\", \"true\",\n \"Don't place a BTI instruction \"\n \"after a return-twice\">;\n\n//===----------------------------------------------------------------------===//\n// ARM architecture class\n//\n\n// A-series ISA\ndef FeatureAClass : SubtargetFeature<\"aclass\", \"ARMProcClass\", \"AClass\",\n \"Is application profile ('A' series)\">;\n\n// R-series ISA\ndef FeatureRClass : SubtargetFeature<\"rclass\", \"ARMProcClass\", \"RClass\",\n \"Is realtime profile ('R' series)\">;\n\n// M-series ISA\ndef FeatureMClass : SubtargetFeature<\"mclass\", \"ARMProcClass\", \"MClass\",\n \"Is microcontroller profile ('M' series)\">;\n\n\ndef FeatureThumb2 : SubtargetFeature<\"thumb2\", \"HasThumb2\", \"true\",\n \"Enable Thumb2 instructions\">;\n\ndef FeatureNoARM : SubtargetFeature<\"noarm\", \"NoARM\", \"true\",\n \"Does not support ARM mode execution\">;\n\n//===----------------------------------------------------------------------===//\n// ARM ISAa.\n//\n\ndef HasV4TOps : SubtargetFeature<\"v4t\", \"HasV4TOps\", \"true\",\n \"Support ARM v4T instructions\">;\n\ndef HasV5TOps : SubtargetFeature<\"v5t\", \"HasV5TOps\", \"true\",\n \"Support ARM v5T instructions\",\n [HasV4TOps]>;\n\ndef HasV5TEOps : SubtargetFeature<\"v5te\", \"HasV5TEOps\", \"true\",\n \"Support ARM v5TE, v5TEj, and \"\n \"v5TExp instructions\",\n [HasV5TOps]>;\n\ndef HasV6Ops : SubtargetFeature<\"v6\", \"HasV6Ops\", \"true\",\n \"Support ARM v6 instructions\",\n [HasV5TEOps]>;\n\ndef HasV6MOps : SubtargetFeature<\"v6m\", \"HasV6MOps\", \"true\",\n \"Support ARM v6M instructions\",\n [HasV6Ops]>;\n\ndef HasV8MBaselineOps : SubtargetFeature<\"v8m\", \"HasV8MBaselineOps\", \"true\",\n \"Support ARM v8M Baseline instructions\",\n [HasV6MOps]>;\n\ndef HasV6KOps : SubtargetFeature<\"v6k\", \"HasV6KOps\", \"true\",\n \"Support ARM v6k instructions\",\n [HasV6Ops]>;\n\ndef HasV6T2Ops : SubtargetFeature<\"v6t2\", \"HasV6T2Ops\", \"true\",\n \"Support ARM v6t2 instructions\",\n [HasV8MBaselineOps, HasV6KOps, FeatureThumb2]>;\n\ndef HasV7Ops : SubtargetFeature<\"v7\", \"HasV7Ops\", \"true\",\n \"Support ARM v7 instructions\",\n [HasV6T2Ops, FeaturePerfMon,\n FeatureV7Clrex]>;\n\ndef HasV8MMainlineOps :\n SubtargetFeature<\"v8m.main\", \"HasV8MMainlineOps\", \"true\",\n \"Support ARM v8M Mainline instructions\",\n [HasV7Ops]>;\n\ndef HasV8Ops : SubtargetFeature<\"v8\", \"HasV8Ops\", \"true\",\n \"Support ARM v8 instructions\",\n [HasV7Ops, FeatureAcquireRelease]>;\n\ndef HasV8_1aOps : SubtargetFeature<\"v8.1a\", \"HasV8_1aOps\", \"true\",\n \"Support ARM v8.1a instructions\",\n [HasV8Ops]>;\n\ndef HasV8_2aOps : SubtargetFeature<\"v8.2a\", \"HasV8_2aOps\", \"true\",\n \"Support ARM v8.2a instructions\",\n [HasV8_1aOps]>;\n\ndef HasV8_3aOps : SubtargetFeature<\"v8.3a\", \"HasV8_3aOps\", \"true\",\n \"Support ARM v8.3a instructions\",\n [HasV8_2aOps]>;\n\ndef HasV8_4aOps : SubtargetFeature<\"v8.4a\", \"HasV8_4aOps\", \"true\",\n \"Support ARM v8.4a instructions\",\n [HasV8_3aOps, FeatureDotProd]>;\n\ndef HasV8_5aOps : SubtargetFeature<\"v8.5a\", \"HasV8_5aOps\", \"true\",\n \"Support ARM v8.5a instructions\",\n [HasV8_4aOps, FeatureSB]>;\n\ndef HasV8_6aOps : SubtargetFeature<\"v8.6a\", \"HasV8_6aOps\", \"true\",\n \"Support ARM v8.6a instructions\",\n [HasV8_5aOps, FeatureBF16,\n FeatureMatMulInt8]>;\n\ndef HasV8_7aOps : SubtargetFeature<\"v8.7a\", \"HasV8_7aOps\", \"true\",\n \"Support ARM v8.7a instructions\",\n [HasV8_6aOps]>;\n\ndef HasV9_0aOps : SubtargetFeature<\"v9a\", \"HasV9_0aOps\", \"true\",\n \"Support ARM v9a instructions\",\n [HasV8_5aOps]>;\n\ndef HasV9_1aOps : SubtargetFeature<\"v9.1a\", \"HasV9_1aOps\", \"true\",\n \"Support ARM v9.1a instructions\",\n [HasV8_6aOps, HasV9_0aOps]>;\n\ndef HasV9_2aOps : SubtargetFeature<\"v9.2a\", \"HasV9_2aOps\", \"true\",\n \"Support ARM v9.2a instructions\",\n [HasV8_7aOps, HasV9_1aOps]>;\n\ndef HasV8_1MMainlineOps : SubtargetFeature<\n \"v8.1m.main\", \"HasV8_1MMainlineOps\", \"true\",\n \"Support ARM v8-1M Mainline instructions\",\n [HasV8MMainlineOps]>;\ndef HasMVEIntegerOps : SubtargetFeature<\n \"mve\", \"HasMVEIntegerOps\", \"true\",\n \"Support M-Class Vector Extension with integer ops\",\n [HasV8_1MMainlineOps, FeatureDSP, FeatureFPRegs16, FeatureFPRegs64]>;\ndef HasMVEFloatOps : SubtargetFeature<\n \"mve.fp\", \"HasMVEFloatOps\", \"true\",\n \"Support M-Class Vector Extension with integer and floating ops\",\n [HasMVEIntegerOps, FeatureFPARMv8_D16_SP, FeatureFullFP16]>;\n\ndef HasCDEOps : SubtargetFeature<\"cde\", \"HasCDEOps\", \"true\",\n \"Support CDE instructions\",\n [HasV8MMainlineOps]>;\n\nforeach i = {0-7} in\n def FeatureCoprocCDE#i : SubtargetFeature<\"cdecp\"#i,\n \"CoprocCDE[\"#i#\"]\", \"true\",\n \"Coprocessor \"#i#\" ISA is CDEv1\",\n [HasCDEOps]>;\n\n//===----------------------------------------------------------------------===//\n// Control codegen mitigation against Straight Line Speculation vulnerability.\n//===----------------------------------------------------------------------===//\n\ndef FeatureHardenSlsRetBr : SubtargetFeature<\"harden-sls-retbr\",\n \"HardenSlsRetBr\", \"true\",\n \"Harden against straight line speculation across RETurn and BranchRegister \"\n \"instructions\">;\ndef FeatureHardenSlsBlr : SubtargetFeature<\"harden-sls-blr\",\n \"HardenSlsBlr\", \"true\",\n \"Harden against straight line speculation across indirect calls\">;\ndef FeatureHardenSlsNoComdat : SubtargetFeature<\"harden-sls-nocomdat\",\n \"HardenSlsNoComdat\", \"true\",\n \"Generate thunk code for SLS mitigation in the normal text section\">;\n\n//===----------------------------------------------------------------------===//\n// ARM Processor subtarget features.\n//\n\ndef ProcA5 : SubtargetFeature<\"a5\", \"ARMProcFamily\", \"CortexA5\",\n \"Cortex-A5 ARM processors\", []>;\ndef ProcA7 : SubtargetFeature<\"a7\", \"ARMProcFamily\", \"CortexA7\",\n \"Cortex-A7 ARM processors\", []>;\ndef ProcA8 : SubtargetFeature<\"a8\", \"ARMProcFamily\", \"CortexA8\",\n \"Cortex-A8 ARM processors\", []>;\ndef ProcA9 : SubtargetFeature<\"a9\", \"ARMProcFamily\", \"CortexA9\",\n \"Cortex-A9 ARM processors\", []>;\ndef ProcA12 : SubtargetFeature<\"a12\", \"ARMProcFamily\", \"CortexA12\",\n \"Cortex-A12 ARM processors\", []>;\ndef ProcA15 : SubtargetFeature<\"a15\", \"ARMProcFamily\", \"CortexA15\",\n \"Cortex-A15 ARM processors\", []>;\ndef ProcA17 : SubtargetFeature<\"a17\", \"ARMProcFamily\", \"CortexA17\",\n \"Cortex-A17 ARM processors\", []>;\ndef ProcA32 : SubtargetFeature<\"a32\", \"ARMProcFamily\", \"CortexA32\",\n \"Cortex-A32 ARM processors\", []>;\ndef ProcA35 : SubtargetFeature<\"a35\", \"ARMProcFamily\", \"CortexA35\",\n \"Cortex-A35 ARM processors\", []>;\ndef ProcA53 : SubtargetFeature<\"a53\", \"ARMProcFamily\", \"CortexA53\",\n \"Cortex-A53 ARM processors\", []>;\ndef ProcA55 : SubtargetFeature<\"a55\", \"ARMProcFamily\", \"CortexA55\",\n \"Cortex-A55 ARM processors\", []>;\ndef ProcA57 : SubtargetFeature<\"a57\", \"ARMProcFamily\", \"CortexA57\",\n \"Cortex-A57 ARM processors\", []>;\ndef ProcA72 : SubtargetFeature<\"a72\", \"ARMProcFamily\", \"CortexA72\",\n \"Cortex-A72 ARM processors\", []>;\ndef ProcA73 : SubtargetFeature<\"a73\", \"ARMProcFamily\", \"CortexA73\",\n \"Cortex-A73 ARM processors\", []>;\ndef ProcA75 : SubtargetFeature<\"a75\", \"ARMProcFamily\", \"CortexA75\",\n \"Cortex-A75 ARM processors\", []>;\ndef ProcA76 : SubtargetFeature<\"a76\", \"ARMProcFamily\", \"CortexA76\",\n \"Cortex-A76 ARM processors\", []>;\ndef ProcA77 : SubtargetFeature<\"a77\", \"ARMProcFamily\", \"CortexA77\",\n \"Cortex-A77 ARM processors\", []>;\ndef ProcA78 : SubtargetFeature<\"cortex-a78\", \"ARMProcFamily\", \"CortexA78\",\n \"Cortex-A78 ARM processors\", []>;\ndef ProcA78C : SubtargetFeature<\"a78c\", \"ARMProcFamily\", \"CortexA78C\",\n \"Cortex-A78C ARM processors\", []>;\ndef ProcA710 : SubtargetFeature<\"cortex-a710\", \"ARMProcFamily\",\n \"CortexA710\", \"Cortex-A710 ARM processors\", []>;\ndef ProcX1 : SubtargetFeature<\"cortex-x1\", \"ARMProcFamily\", \"CortexX1\",\n \"Cortex-X1 ARM processors\", []>;\n\ndef ProcV1 : SubtargetFeature<\"neoverse-v1\", \"ARMProcFamily\",\n \"NeoverseV1\", \"Neoverse-V1 ARM processors\", []>;\n\ndef ProcKrait : SubtargetFeature<\"krait\", \"ARMProcFamily\", \"Krait\",\n \"Qualcomm Krait processors\", []>;\ndef ProcKryo : SubtargetFeature<\"kryo\", \"ARMProcFamily\", \"Kryo\",\n \"Qualcomm Kryo processors\", []>;\ndef ProcSwift : SubtargetFeature<\"swift\", \"ARMProcFamily\", \"Swift\",\n \"Swift ARM processors\", []>;\n\ndef ProcExynos : SubtargetFeature<\"exynos\", \"ARMProcFamily\", \"Exynos\",\n \"Samsung Exynos processors\",\n [FeatureZCZeroing,\n FeatureUseWideStrideVFP,\n FeatureSplatVFPToNeon,\n FeatureSlowVGETLNi32,\n FeatureSlowVDUP32,\n FeatureSlowFPBrcc,\n FeatureProfUnpredicate,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureHasRetAddrStack,\n FeatureFuseLiterals,\n FeatureFuseAES,\n FeatureExpandMLx,\n FeatureCrypto,\n FeatureCRC]>;\n\ndef ProcR4 : SubtargetFeature<\"r4\", \"ARMProcFamily\", \"CortexR4\",\n \"Cortex-R4 ARM processors\", []>;\ndef ProcR5 : SubtargetFeature<\"r5\", \"ARMProcFamily\", \"CortexR5\",\n \"Cortex-R5 ARM processors\", []>;\ndef ProcR7 : SubtargetFeature<\"r7\", \"ARMProcFamily\", \"CortexR7\",\n \"Cortex-R7 ARM processors\", []>;\ndef ProcR52 : SubtargetFeature<\"r52\", \"ARMProcFamily\", \"CortexR52\",\n \"Cortex-R52 ARM processors\", []>;\n\ndef ProcM3 : SubtargetFeature<\"m3\", \"ARMProcFamily\", \"CortexM3\",\n \"Cortex-M3 ARM processors\", []>;\ndef ProcM7 : SubtargetFeature<\"m7\", \"ARMProcFamily\", \"CortexM7\",\n \"Cortex-M7 ARM processors\", []>;\n\n//===----------------------------------------------------------------------===//\n// ARM Helper classes.\n//\n\nclass Architecture features>\n : SubtargetFeature;\n\nclass ProcNoItin Features>\n : Processor;\n\n\n//===----------------------------------------------------------------------===//\n// ARM architectures\n//\n\ndef ARMv2 : Architecture<\"armv2\", \"ARMv2\", []>;\n\ndef ARMv2a : Architecture<\"armv2a\", \"ARMv2a\", []>;\n\ndef ARMv3 : Architecture<\"armv3\", \"ARMv3\", []>;\n\ndef ARMv3m : Architecture<\"armv3m\", \"ARMv3m\", []>;\n\ndef ARMv4 : Architecture<\"armv4\", \"ARMv4\", []>;\n\ndef ARMv4t : Architecture<\"armv4t\", \"ARMv4t\", [HasV4TOps]>;\n\ndef ARMv5t : Architecture<\"armv5t\", \"ARMv5t\", [HasV5TOps]>;\n\ndef ARMv5te : Architecture<\"armv5te\", \"ARMv5te\", [HasV5TEOps]>;\n\ndef ARMv5tej : Architecture<\"armv5tej\", \"ARMv5tej\", [HasV5TEOps]>;\n\ndef ARMv6 : Architecture<\"armv6\", \"ARMv6\", [HasV6Ops,\n FeatureDSP]>;\n\ndef ARMv6t2 : Architecture<\"armv6t2\", \"ARMv6t2\", [HasV6T2Ops,\n FeatureDSP]>;\n\ndef ARMv6k : Architecture<\"armv6k\", \"ARMv6k\", [HasV6KOps]>;\n\ndef ARMv6kz : Architecture<\"armv6kz\", \"ARMv6kz\", [HasV6KOps,\n FeatureTrustZone]>;\n\ndef ARMv6m : Architecture<\"armv6-m\", \"ARMv6m\", [HasV6MOps,\n FeatureNoARM,\n ModeThumb,\n FeatureDB,\n FeatureMClass,\n FeatureStrictAlign]>;\n\ndef ARMv6sm : Architecture<\"armv6s-m\", \"ARMv6sm\", [HasV6MOps,\n FeatureNoARM,\n ModeThumb,\n FeatureDB,\n FeatureMClass,\n FeatureStrictAlign]>;\n\ndef ARMv7a : Architecture<\"armv7-a\", \"ARMv7a\", [HasV7Ops,\n FeatureNEON,\n FeatureDB,\n FeatureDSP,\n FeatureAClass]>;\n\ndef ARMv7ve : Architecture<\"armv7ve\", \"ARMv7ve\", [HasV7Ops,\n FeatureNEON,\n FeatureDB,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureAClass]>;\n\ndef ARMv7r : Architecture<\"armv7-r\", \"ARMv7r\", [HasV7Ops,\n FeatureDB,\n FeatureDSP,\n FeatureHWDivThumb,\n FeatureRClass]>;\n\ndef ARMv7m : Architecture<\"armv7-m\", \"ARMv7m\", [HasV7Ops,\n FeatureThumb2,\n FeatureNoARM,\n ModeThumb,\n FeatureDB,\n FeatureHWDivThumb,\n FeatureMClass]>;\n\ndef ARMv7em : Architecture<\"armv7e-m\", \"ARMv7em\", [HasV7Ops,\n FeatureThumb2,\n FeatureNoARM,\n ModeThumb,\n FeatureDB,\n FeatureHWDivThumb,\n FeatureMClass,\n FeatureDSP]>;\n\ndef ARMv8a : Architecture<\"armv8-a\", \"ARMv8a\", [HasV8Ops,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCrypto,\n FeatureCRC]>;\n\ndef ARMv81a : Architecture<\"armv8.1-a\", \"ARMv81a\", [HasV8_1aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCrypto,\n FeatureCRC]>;\n\ndef ARMv82a : Architecture<\"armv8.2-a\", \"ARMv82a\", [HasV8_2aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCrypto,\n FeatureCRC,\n FeatureRAS]>;\n\ndef ARMv83a : Architecture<\"armv8.3-a\", \"ARMv83a\", [HasV8_3aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCrypto,\n FeatureCRC,\n FeatureRAS]>;\n\ndef ARMv84a : Architecture<\"armv8.4-a\", \"ARMv84a\", [HasV8_4aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCrypto,\n FeatureCRC,\n FeatureRAS,\n FeatureDotProd]>;\n\ndef ARMv85a : Architecture<\"armv8.5-a\", \"ARMv85a\", [HasV8_5aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCrypto,\n FeatureCRC,\n FeatureRAS,\n FeatureDotProd]>;\ndef ARMv86a : Architecture<\"armv8.6-a\", \"ARMv86a\", [HasV8_6aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCrypto,\n FeatureCRC,\n FeatureRAS,\n FeatureDotProd]>;\ndef ARMv87a : Architecture<\"armv8.7-a\", \"ARMv87a\", [HasV8_7aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCrypto,\n FeatureCRC,\n FeatureRAS,\n FeatureDotProd]>;\n\ndef ARMv9a : Architecture<\"armv9-a\", \"ARMv9a\", [HasV9_0aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCRC,\n FeatureRAS,\n FeatureDotProd]>;\ndef ARMv91a : Architecture<\"armv9.1-a\", \"ARMv91a\", [HasV9_1aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCRC,\n FeatureRAS,\n FeatureDotProd]>;\ndef ARMv92a : Architecture<\"armv9.2-a\", \"ARMv92a\", [HasV9_2aOps,\n FeatureAClass,\n FeatureDB,\n FeatureFPARMv8,\n FeatureNEON,\n FeatureDSP,\n FeatureTrustZone,\n FeatureMP,\n FeatureVirtualization,\n FeatureCRC,\n FeatureRAS,\n FeatureDotProd]>;\n\ndef ARMv8r : Architecture<\"armv8-r\", \"ARMv8r\", [HasV8Ops,\n FeatureRClass,\n FeatureDB,\n FeatureDFB,\n FeatureDSP,\n FeatureCRC,\n FeatureMP,\n FeatureVirtualization,\n FeatureFPARMv8,\n FeatureNEON]>;\n\ndef ARMv8mBaseline : Architecture<\"armv8-m.base\", \"ARMv8mBaseline\",\n [HasV8MBaselineOps,\n FeatureNoARM,\n ModeThumb,\n FeatureDB,\n FeatureHWDivThumb,\n FeatureV7Clrex,\n Feature8MSecExt,\n FeatureAcquireRelease,\n FeatureMClass,\n FeatureStrictAlign]>;\n\ndef ARMv8mMainline : Architecture<\"armv8-m.main\", \"ARMv8mMainline\",\n [HasV8MMainlineOps,\n FeatureNoARM,\n ModeThumb,\n FeatureDB,\n FeatureHWDivThumb,\n Feature8MSecExt,\n FeatureAcquireRelease,\n FeatureMClass]>;\n\ndef ARMv81mMainline : Architecture<\"armv8.1-m.main\", \"ARMv81mMainline\",\n [HasV8_1MMainlineOps,\n FeatureNoARM,\n ModeThumb,\n FeatureDB,\n FeatureHWDivThumb,\n Feature8MSecExt,\n FeatureAcquireRelease,\n FeatureMClass,\n FeatureRAS,\n FeatureLOB]>;\n\n// Aliases\ndef IWMMXT : Architecture<\"iwmmxt\", \"ARMv5te\", [ARMv5te]>;\ndef IWMMXT2 : Architecture<\"iwmmxt2\", \"ARMv5te\", [ARMv5te]>;\ndef XScale : Architecture<\"xscale\", \"ARMv5te\", [ARMv5te]>;\ndef ARMv6j : Architecture<\"armv6j\", \"ARMv7a\", [ARMv6]>;\ndef ARMv7k : Architecture<\"armv7k\", \"ARMv7a\", [ARMv7a]>;\ndef ARMv7s : Architecture<\"armv7s\", \"ARMv7a\", [ARMv7a]>;\n\n//===----------------------------------------------------------------------===//\n// Register File Description\n//===----------------------------------------------------------------------===//\n\ninclude \"ARMRegisterInfo.td\"\ninclude \"ARMRegisterBanks.td\"\ninclude \"ARMCallingConv.td\"\n\n//===----------------------------------------------------------------------===//\n// ARM schedules.\n//===----------------------------------------------------------------------===//\n//\ninclude \"ARMPredicates.td\"\ninclude \"ARMSchedule.td\"\n\n//===----------------------------------------------------------------------===//\n// Instruction Descriptions\n//===----------------------------------------------------------------------===//\n\ninclude \"ARMInstrInfo.td\"\ndef ARMInstrInfo : InstrInfo;\n\n//===----------------------------------------------------------------------===//\n// ARM schedules\n//\ninclude \"ARMScheduleV6.td\"\ninclude \"ARMScheduleA8.td\"\ninclude \"ARMScheduleA9.td\"\ninclude \"ARMScheduleSwift.td\"\ninclude \"ARMScheduleR52.td\"\ninclude \"ARMScheduleA57.td\"\ninclude \"ARMScheduleM4.td\"\ninclude \"ARMScheduleM7.td\"\n\n//===----------------------------------------------------------------------===//\n// ARM processors\n//\n// Dummy CPU, used to target architectures\ndef : ProcessorModel<\"generic\", CortexA8Model, []>;\n\n// FIXME: Several processors below are not using their own scheduler\n// model, but one of similar/previous processor. These should be fixed.\n\ndef : ProcNoItin<\"arm8\", [ARMv4]>;\ndef : ProcNoItin<\"arm810\", [ARMv4]>;\ndef : ProcNoItin<\"strongarm\", [ARMv4]>;\ndef : ProcNoItin<\"strongarm110\", [ARMv4]>;\ndef : ProcNoItin<\"strongarm1100\", [ARMv4]>;\ndef : ProcNoItin<\"strongarm1110\", [ARMv4]>;\n\ndef : ProcNoItin<\"arm7tdmi\", [ARMv4t]>;\ndef : ProcNoItin<\"arm7tdmi-s\", [ARMv4t]>;\ndef : ProcNoItin<\"arm710t\", [ARMv4t]>;\ndef : ProcNoItin<\"arm720t\", [ARMv4t]>;\ndef : ProcNoItin<\"arm9\", [ARMv4t]>;\ndef : ProcNoItin<\"arm9tdmi\", [ARMv4t]>;\ndef : ProcNoItin<\"arm920\", [ARMv4t]>;\ndef : ProcNoItin<\"arm920t\", [ARMv4t]>;\ndef : ProcNoItin<\"arm922t\", [ARMv4t]>;\ndef : ProcNoItin<\"arm940t\", [ARMv4t]>;\ndef : ProcNoItin<\"ep9312\", [ARMv4t]>;\n\ndef : ProcNoItin<\"arm10tdmi\", [ARMv5t]>;\ndef : ProcNoItin<\"arm1020t\", [ARMv5t]>;\n\ndef : ProcNoItin<\"arm9e\", [ARMv5te]>;\ndef : ProcNoItin<\"arm926ej-s\", [ARMv5te]>;\ndef : ProcNoItin<\"arm946e-s\", [ARMv5te]>;\ndef : ProcNoItin<\"arm966e-s\", [ARMv5te]>;\ndef : ProcNoItin<\"arm968e-s\", [ARMv5te]>;\ndef : ProcNoItin<\"arm10e\", [ARMv5te]>;\ndef : ProcNoItin<\"arm1020e\", [ARMv5te]>;\ndef : ProcNoItin<\"arm1022e\", [ARMv5te]>;\ndef : ProcNoItin<\"xscale\", [ARMv5te]>;\ndef : ProcNoItin<\"iwmmxt\", [ARMv5te]>;\n\ndef : Processor<\"arm1136j-s\", ARMV6Itineraries, [ARMv6]>;\ndef : Processor<\"arm1136jf-s\", ARMV6Itineraries, [ARMv6,\n FeatureVFP2,\n FeatureHasSlowFPVMLx]>;\n\ndef : Processor<\"cortex-m0\", ARMV6Itineraries, [ARMv6m,\n FeatureHasNoBranchPredictor]>;\ndef : Processor<\"cortex-m0plus\", ARMV6Itineraries, [ARMv6m,\n FeatureHasNoBranchPredictor]>;\ndef : Processor<\"cortex-m1\", ARMV6Itineraries, [ARMv6m,\n FeatureHasNoBranchPredictor]>;\ndef : Processor<\"sc000\", ARMV6Itineraries, [ARMv6m,\n FeatureHasNoBranchPredictor]>;\n\ndef : Processor<\"arm1176jz-s\", ARMV6Itineraries, [ARMv6kz]>;\ndef : Processor<\"arm1176jzf-s\", ARMV6Itineraries, [ARMv6kz,\n FeatureVFP2,\n FeatureHasSlowFPVMLx]>;\n\ndef : Processor<\"mpcorenovfp\", ARMV6Itineraries, [ARMv6k]>;\ndef : Processor<\"mpcore\", ARMV6Itineraries, [ARMv6k,\n FeatureVFP2,\n FeatureHasSlowFPVMLx]>;\n\ndef : Processor<\"arm1156t2-s\", ARMV6Itineraries, [ARMv6t2]>;\ndef : Processor<\"arm1156t2f-s\", ARMV6Itineraries, [ARMv6t2,\n FeatureVFP2,\n FeatureHasSlowFPVMLx]>;\n\ndef : ProcessorModel<\"cortex-a5\", CortexA8Model, [ARMv7a, ProcA5,\n FeatureHasRetAddrStack,\n FeatureTrustZone,\n FeatureSlowFPBrcc,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureVMLxForwarding,\n FeatureMP,\n FeatureVFP4]>;\n\ndef : ProcessorModel<\"cortex-a7\", CortexA8Model, [ARMv7a, ProcA7,\n FeatureHasRetAddrStack,\n FeatureTrustZone,\n FeatureSlowFPBrcc,\n FeatureHasVMLxHazards,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureVMLxForwarding,\n FeatureMP,\n FeatureVFP4,\n FeatureVirtualization]>;\n\ndef : ProcessorModel<\"cortex-a8\", CortexA8Model, [ARMv7a, ProcA8,\n FeatureHasRetAddrStack,\n FeatureNonpipelinedVFP,\n FeatureTrustZone,\n FeatureSlowFPBrcc,\n FeatureHasVMLxHazards,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureVMLxForwarding]>;\n\ndef : ProcessorModel<\"cortex-a9\", CortexA9Model, [ARMv7a, ProcA9,\n FeatureHasRetAddrStack,\n FeatureTrustZone,\n FeatureHasVMLxHazards,\n FeatureVMLxForwarding,\n FeatureFP16,\n FeatureAvoidPartialCPSR,\n FeatureExpandMLx,\n FeaturePreferVMOVSR,\n FeatureMuxedUnits,\n FeatureNEONForFPMovs,\n FeatureCheckVLDnAlign,\n FeatureMP]>;\n\ndef : ProcessorModel<\"cortex-a12\", CortexA9Model, [ARMv7a, ProcA12,\n FeatureHasRetAddrStack,\n FeatureTrustZone,\n FeatureVMLxForwarding,\n FeatureVFP4,\n FeatureAvoidPartialCPSR,\n FeatureVirtualization,\n FeatureMP]>;\n\ndef : ProcessorModel<\"cortex-a15\", CortexA9Model, [ARMv7a, ProcA15,\n FeatureDontWidenVMOVS,\n FeatureSplatVFPToNeon,\n FeatureHasRetAddrStack,\n FeatureMuxedUnits,\n FeatureTrustZone,\n FeatureVFP4,\n FeatureMP,\n FeatureCheckVLDnAlign,\n FeatureAvoidPartialCPSR,\n FeatureVirtualization]>;\n\ndef : ProcessorModel<\"cortex-a17\", CortexA9Model, [ARMv7a, ProcA17,\n FeatureHasRetAddrStack,\n FeatureTrustZone,\n FeatureMP,\n FeatureVMLxForwarding,\n FeatureVFP4,\n FeatureAvoidPartialCPSR,\n FeatureVirtualization]>;\n\n// FIXME: krait has currently the same features as A9 plus VFP4 and HWDiv\ndef : ProcessorModel<\"krait\", CortexA9Model, [ARMv7a, ProcKrait,\n FeatureHasRetAddrStack,\n FeatureMuxedUnits,\n FeatureCheckVLDnAlign,\n FeatureVMLxForwarding,\n FeatureFP16,\n FeatureAvoidPartialCPSR,\n FeatureVFP4,\n FeatureHWDivThumb,\n FeatureHWDivARM]>;\n\ndef : ProcessorModel<\"swift\", SwiftModel, [ARMv7a, ProcSwift,\n FeatureHasRetAddrStack,\n FeatureNEONForFP,\n FeatureVFP4,\n FeatureUseWideStrideVFP,\n FeatureMP,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureAvoidPartialCPSR,\n FeatureAvoidMOVsShOp,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureHasVMLxHazards,\n FeatureProfUnpredicate,\n FeaturePrefISHSTBarrier,\n FeatureSlowOddRegister,\n FeatureSlowLoadDSubreg,\n FeatureSlowVGETLNi32,\n FeatureSlowVDUP32,\n FeatureUseMISched,\n FeatureNoPostRASched]>;\n\ndef : ProcessorModel<\"cortex-r4\", CortexA8Model, [ARMv7r, ProcR4,\n FeatureHasRetAddrStack,\n FeatureAvoidPartialCPSR]>;\n\ndef : ProcessorModel<\"cortex-r4f\", CortexA8Model, [ARMv7r, ProcR4,\n FeatureHasRetAddrStack,\n FeatureSlowFPBrcc,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureVFP3_D16,\n FeatureAvoidPartialCPSR]>;\n\ndef : ProcessorModel<\"cortex-r5\", CortexA8Model, [ARMv7r, ProcR5,\n FeatureHasRetAddrStack,\n FeatureVFP3_D16,\n FeatureSlowFPBrcc,\n FeatureHWDivARM,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureAvoidPartialCPSR]>;\n\ndef : ProcessorModel<\"cortex-r7\", CortexA8Model, [ARMv7r, ProcR7,\n FeatureHasRetAddrStack,\n FeatureVFP3_D16,\n FeatureFP16,\n FeatureMP,\n FeatureSlowFPBrcc,\n FeatureHWDivARM,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureAvoidPartialCPSR]>;\n\ndef : ProcessorModel<\"cortex-r8\", CortexA8Model, [ARMv7r,\n FeatureHasRetAddrStack,\n FeatureVFP3_D16,\n FeatureFP16,\n FeatureMP,\n FeatureSlowFPBrcc,\n FeatureHWDivARM,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureAvoidPartialCPSR]>;\n\ndef : ProcessorModel<\"cortex-m3\", CortexM4Model, [ARMv7m,\n ProcM3,\n FeaturePrefLoopAlign32,\n FeatureUseMISched,\n FeatureHasNoBranchPredictor]>;\n\ndef : ProcessorModel<\"sc300\", CortexM4Model, [ARMv7m,\n ProcM3,\n FeatureUseMISched,\n FeatureHasNoBranchPredictor]>;\n\ndef : ProcessorModel<\"cortex-m4\", CortexM4Model, [ARMv7em,\n FeatureVFP4_D16_SP,\n FeaturePrefLoopAlign32,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureUseMISched,\n FeatureHasNoBranchPredictor]>;\n\ndef : ProcessorModel<\"cortex-m7\", CortexM7Model, [ARMv7em,\n ProcM7,\n FeatureFPARMv8_D16,\n FeatureUseMISched]>;\n\ndef : ProcNoItin<\"cortex-m23\", [ARMv8mBaseline,\n FeatureNoMovt,\n FeatureHasNoBranchPredictor]>;\n\ndef : ProcessorModel<\"cortex-m33\", CortexM4Model, [ARMv8mMainline,\n FeatureDSP,\n FeatureFPARMv8_D16_SP,\n FeaturePrefLoopAlign32,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureUseMISched,\n FeatureHasNoBranchPredictor,\n FeatureFixCMSE_CVE_2021_35465]>;\n\ndef : ProcessorModel<\"cortex-m35p\", CortexM4Model, [ARMv8mMainline,\n FeatureDSP,\n FeatureFPARMv8_D16_SP,\n FeaturePrefLoopAlign32,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureUseMISched,\n FeatureHasNoBranchPredictor,\n FeatureFixCMSE_CVE_2021_35465]>;\n\ndef : ProcessorModel<\"cortex-m55\", CortexM4Model, [ARMv81mMainline,\n FeatureDSP,\n FeatureFPARMv8_D16,\n FeatureUseMISched,\n FeatureHasNoBranchPredictor,\n FeaturePrefLoopAlign32,\n FeatureHasSlowFPVMLx,\n HasMVEFloatOps,\n FeatureFixCMSE_CVE_2021_35465]>;\n\ndef : ProcNoItin<\"cortex-a32\", [ARMv8a,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC]>;\n\ndef : ProcNoItin<\"cortex-a35\", [ARMv8a, ProcA35,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC]>;\n\ndef : ProcNoItin<\"cortex-a53\", [ARMv8a, ProcA53,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureFPAO]>;\n\ndef : ProcNoItin<\"cortex-a55\", [ARMv82a, ProcA55,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureDotProd]>;\n\ndef : ProcessorModel<\"cortex-a57\", CortexA57Model, [ARMv8a, ProcA57,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureFPAO,\n FeatureAvoidPartialCPSR,\n FeatureCheapPredicableCPSR]>;\n\ndef : ProcessorModel<\"cortex-a72\", CortexA57Model, [ARMv8a, ProcA72,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC]>;\n\ndef : ProcNoItin<\"cortex-a73\", [ARMv8a, ProcA73,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC]>;\n\ndef : ProcNoItin<\"cortex-a75\", [ARMv82a, ProcA75,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureDotProd]>;\n\ndef : ProcNoItin<\"cortex-a76\", [ARMv82a, ProcA76,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureFullFP16,\n FeatureDotProd]>;\n\ndef : ProcNoItin<\"cortex-a76ae\", [ARMv82a, ProcA76,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureFullFP16,\n FeatureDotProd]>;\n\ndef : ProcNoItin<\"cortex-a77\", [ARMv82a, ProcA77,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureFullFP16,\n FeatureDotProd]>;\n\ndef : ProcNoItin<\"cortex-a78\", [ARMv82a, ProcA78,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureFullFP16,\n FeatureDotProd]>;\n\ndef : ProcNoItin<\"cortex-a78c\", [ARMv82a, ProcA78C,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureDotProd,\n FeatureFullFP16]>;\n\ndef : ProcNoItin<\"cortex-a710\", [ARMv9a, ProcA710,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureFP16FML,\n FeatureBF16,\n FeatureMatMulInt8,\n FeatureSB]>;\n\ndef : ProcNoItin<\"cortex-x1\", [ARMv82a, ProcX1,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureFullFP16,\n FeatureDotProd]>;\n\ndef : ProcNoItin<\"neoverse-v1\", [ARMv84a,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureFullFP16,\n FeatureBF16,\n FeatureMatMulInt8]>;\n\ndef : ProcNoItin<\"neoverse-n1\", [ARMv82a,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC,\n FeatureDotProd]>;\n\ndef : ProcNoItin<\"neoverse-n2\", [ARMv85a,\n FeatureBF16,\n FeatureMatMulInt8,\n FeaturePerfMon]>;\n\ndef : ProcessorModel<\"cyclone\", SwiftModel, [ARMv8a, ProcSwift,\n FeatureHasRetAddrStack,\n FeatureNEONForFP,\n FeatureVFP4,\n FeatureMP,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureAvoidPartialCPSR,\n FeatureAvoidMOVsShOp,\n FeatureHasSlowFPVMLx,\n FeatureHasSlowFPVFMx,\n FeatureCrypto,\n FeatureUseMISched,\n FeatureZCZeroing,\n FeatureNoPostRASched]>;\n\ndef : ProcNoItin<\"exynos-m3\", [ARMv8a, ProcExynos]>;\ndef : ProcNoItin<\"exynos-m4\", [ARMv82a, ProcExynos,\n FeatureFullFP16,\n FeatureDotProd]>;\ndef : ProcNoItin<\"exynos-m5\", [ARMv82a, ProcExynos,\n FeatureFullFP16,\n FeatureDotProd]>;\n\ndef : ProcNoItin<\"kryo\", [ARMv8a, ProcKryo,\n FeatureHWDivThumb,\n FeatureHWDivARM,\n FeatureCrypto,\n FeatureCRC]>;\n\ndef : ProcessorModel<\"cortex-r52\", CortexR52Model, [ARMv8r, ProcR52,\n FeatureUseMISched,\n FeatureFPAO]>;\n\n//===----------------------------------------------------------------------===//\n// Declare the target which we are implementing\n//===----------------------------------------------------------------------===//\n\ndef ARMAsmWriter : AsmWriter {\n string AsmWriterClassName = \"InstPrinter\";\n int PassSubtarget = 1;\n int Variant = 0;\n bit isMCAsmWriter = 1;\n}\n\ndef ARMAsmParser : AsmParser {\n bit ReportMultipleNearMisses = 1;\n}\n\ndef ARMAsmParserVariant : AsmParserVariant {\n int Variant = 0;\n string Name = \"ARM\";\n string BreakCharacters = \".\";\n}\n\ndef ARM : Target {\n // Pull in Instruction Info.\n let InstructionSet = ARMInstrInfo;\n let AssemblyWriters = [ARMAsmWriter];\n let AssemblyParsers = [ARMAsmParser];\n let AssemblyParserVariants = [ARMAsmParserVariant];\n let AllowRegisterRenaming = 1;\n}\n" }, { "path": "tests/inputs/Test.daml", "content": "-- https://raw.githubusercontent.com/digital-asset/daml/refs/heads/main/sdk/test-common/src/main/daml/model/Test.daml\n-- (truncated)\n-- Copyright (c) 2025 Digital Asset (Switzerland) GmbH and/or its affiliates. All rights reserved.\n-- SPDX-License-Identifier: Apache-2.0\n\n{-# LANGUAGE CPP #-}\n\n-- file that contains the declarations used in the sandbox tests\n\nmodule Test where\n\nimport Iou()\nimport IouTrade()\n\ntemplate Dummy\n with\n operator : Party\n where\n signatory operator\n\n choice DummyChoice1 : ()\n controller operator\n do return ()\n\n choice FailingChoice : ()\n controller operator\n do assert False\n\n nonconsuming choice Clone: ContractId Dummy\n controller operator\n do create Dummy with operator\n\n nonconsuming choice FailingClone : ()\n controller operator\n do clone <- exercise self Clone\n exercise self FailingChoice\n\n choice ConsumeIfTimeIsBetween : ()\n with\n begin : Time\n end : Time\n controller operator\n do currentTime <- getTime\n assert (begin <= currentTime)\n assert (currentTime <= end)\n\n choice WrapWithAddress : ContractId AddressWrapper\n with address : Address\n controller operator\n do create AddressWrapper with operator; address\n\n choice PublicChoice: ()\n with\n anyParty: Party\n controller anyParty\n do return ()\n\ndata Address = Address\n { street: Text\n , city: Text\n , state: Text\n , zip: Text\n } deriving (Eq, Show)\n\n-- DEL-4615\ntemplate AddressWrapper\n with\n operator: Party\n address: Address\n where\n signatory operator\n" }, { "path": "tests/inputs/Tk", "content": "#!/usr/local/bin/wish -f\n# from http://www.roesler-ac.de/wolfram/hello.htm\n# Hello World in Tk\n\nlabel .l -text \"Hello World!\"\npack .l\n" }, { "path": "tests/inputs/Trapezoid_Rule.ipynb", "content": "{\n \"cells\": [\n {\n \"cell_type\": \"markdown\",\n \"metadata\": {},\n \"source\": [\n \"# Basic Numerical Integration: the Trapezoid Rule\"\n ]\n },\n {\n \"cell_type\": \"markdown\",\n \"metadata\": {},\n \"source\": [\n \"A simple illustration of the trapezoid rule for definite integration:\\n\",\n \"\\n\",\n \"$$\\n\",\n \"\\\\int_{a}^{b} f(x)\\\\, dx \\\\approx \\\\frac{1}{2} \\\\sum_{k=1}^{N} \\\\left( x_{k} - x_{k-1} \\\\right) \\\\left( f(x_{k}) + f(x_{k-1}) \\\\right).\\n\",\n \"$$\\n\",\n \"
\\n\",\n \"First, we define a simple function and sample it between 0 and 10 at 200 points\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 1,\n \"metadata\": {\n \"collapsed\": false\n },\n \"outputs\": [],\n \"source\": [\n \"%matplotlib inline\\n\",\n \"import numpy as np\\n\",\n \"import matplotlib.pyplot as plt\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 2,\n \"metadata\": {\n \"collapsed\": false\n },\n \"outputs\": [],\n \"source\": [\n \"def f(x):\\n\",\n \" return (x-3)*(x-5)*(x-7)+85\\n\",\n \"\\n\",\n \"x = np.linspace(0, 10, 200)\\n\",\n \"y = f(x)\"\n ]\n },\n {\n \"cell_type\": \"markdown\",\n \"metadata\": {},\n \"source\": [\n \"Choose a region to integrate over and take only a few points in that region\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 3,\n \"metadata\": {\n \"collapsed\": true\n },\n \"outputs\": [],\n \"source\": [\n \"a, b = 1, 8 # the left and right boundaries\\n\",\n \"N = 5 # the number of points\\n\",\n \"xint = np.linspace(a, b, N)\\n\",\n \"yint = f(xint)\"\n ]\n },\n {\n \"cell_type\": \"markdown\",\n \"metadata\": {},\n \"source\": [\n \"Plot both the function and the area below it in the trapezoid approximation\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 4,\n \"metadata\": {\n \"collapsed\": false\n },\n \"outputs\": [],\n \"source\": [\n \"plt.plot(x, y, lw=2)\\n\",\n \"plt.axis([0, 9, 0, 140])\\n\",\n \"plt.fill_between(xint, 0, yint, facecolor='gray', alpha=0.4)\\n\",\n \"plt.text(0.5 * (a + b), 30,r\\\"$\\\\int_a^b f(x)dx$\\\", horizontalalignment='center', fontsize=20);\"\n ]\n },\n {\n \"cell_type\": \"markdown\",\n \"metadata\": {},\n \"source\": [\n \"Compute the integral both at high accuracy and with the trapezoid approximation\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 5,\n \"metadata\": {\n \"collapsed\": false\n },\n \"outputs\": [\n {\n \"name\": \"stdout\",\n \"output_type\": \"stream\",\n \"text\": [\n \"The integral is: 565.2499999999999 +/- 6.275535646693696e-12\\n\",\n \"The trapezoid approximation with 5 points is: 559.890625\\n\"\n ]\n }\n ],\n \"source\": [\n \"from __future__ import print_function\\n\",\n \"from scipy.integrate import quad\\n\",\n \"integral, error = quad(f, a, b)\\n\",\n \"integral_trapezoid = sum( (xint[1:] - xint[:-1]) * (yint[1:] + yint[:-1]) ) / 2\\n\",\n \"print(\\\"The integral is:\\\", integral, \\\"+/-\\\", error)\\n\",\n \"print(\\\"The trapezoid approximation with\\\", len(xint), \\\"points is:\\\", integral_trapezoid)\"\n ]\n }\n ],\n \"metadata\": {\n \"kernelspec\": {\n \"display_name\": \"Python 3\",\n \"language\": \"python\",\n \"name\": \"python3\"\n },\n \"language_info\": {\n \"codemirror_mode\": {\n \"name\": \"ipython\",\n \"version\": 3\n },\n \"file_extension\": \".py\",\n \"mimetype\": \"text/x-python\",\n \"name\": \"python\",\n \"nbconvert_exporter\": \"python\",\n \"pygments_lexer\": \"ipython3\",\n \"version\": \"3.4.2\"\n }\n },\n \"nbformat\": 4,\n \"nbformat_minor\": 0\n}\n" }, { "path": "tests/inputs/TypeScript.ts", "content": "//\n// Copyright (c) Microsoft Corporation. All rights reserved.\n// \n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n\nmodule TypeScript {\n class Base64Format {\n static encodedValues = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n static encode(inValue: number) {\n if (inValue < 64) {\n return Base64Format.encodedValues.charAt(inValue);\n }\n throw TypeError(inValue + \": not a 64 based value\");\n }\n\n static decodeChar(inChar: string) {\n if (inChar.length === 1) {\n return Base64Format.encodedValues.indexOf(inChar);\n } else {\n throw TypeError('\"' + inChar + '\" must have length 1');\n }\n }\n }\n\n export class Base64VLQFormat {\n static encode(inValue: number) {\n // Add a new least significant bit that has the sign of the value.\n // if negative number the least significant bit that gets added to the number has value 1\n // else least significant bit value that gets added is 0\n // eg. -1 changes to binary : 01 [1] => 3\n // +1 changes to binary : 01 [0] => 2\n if (inValue < 0) {\n inValue = ((-inValue) << 1) + 1;\n }\n else {\n inValue = inValue << 1;\n }\n\n // Encode 5 bits at a time starting from least significant bits\n var encodedStr = \"\";\n do {\n var currentDigit = inValue & 31; // 11111\n inValue = inValue >> 5;\n if (inValue > 0) {\n // There are still more digits to decode, set the msb (6th bit)\n currentDigit = currentDigit | 32; \n }\n encodedStr = encodedStr + Base64Format.encode(currentDigit);\n } while (inValue > 0);\n\n return encodedStr;\n }\n\n static decode(inString: string) {\n var result = 0;\n var negative = false;\n\n var shift = 0;\n for (var i = 0; i < inString.length; i++) {\n var byte = Base64Format.decodeChar(inString[i]);\n if (i === 0) {\n // Sign bit appears in the LSBit of the first value\n if ((byte & 1) === 1) {\n negative = true;\n }\n result = (byte >> 1) & 15; // 1111x\n } else {\n result = result | ((byte & 31) << shift); // 11111\n }\n\n shift += (i === 0) ? 4 : 5;\n\n if ((byte & 32) === 32) {\n // Continue\n } else {\n return { value: negative ? -(result) : result, rest: inString.substr(i + 1) };\n }\n }\n\n throw new Error(getDiagnosticMessage(DiagnosticCode.Base64_value_0_finished_with_a_continuation_bit, [inString]));\n }\n }\n}\n\n" }, { "path": "tests/inputs/TypeScript_2.ts", "content": "import { createServer } from 'http' // from @frankdugan3, an example of TypeScript code\n \nexport const server = createServer((req, res) => { // that was misidentified as Qt Linguist in cloc\n res.writeHead(200, { 'Content-type': 'text/plain' }) // versions before 1.78\n res.write('Hello world!')\n res.end()\n}).listen(8080)\n" }, { "path": "tests/inputs/USS.uss", "content": "/* https://github.com/AlDanial/cloc/pull/919 */\n/* name selector (like ID selector in CSS) */\n#root {\n /* \n some style\n this is an example of a multiline comment \n */\n}\n\n/* class selector (like in CSS) */\n.hidden {\n display: none;\n}\n" }, { "path": "tests/inputs/UXML.uxml", "content": "\n\n \n \n{% endblock %}\n{% block content %}\n

Index

\n#}\n

\n Welcome to my awesome homepage.\n

\n{% endblock %}\n" }, { "path": "tests/inputs/child_template.njk", "content": "{# https://jinja.palletsprojects.com/en/2.11.x/templates/#comments #}\nse.html\" %}\n{% block title %}Index{% endblock %}\n{% block head %}\n {{ super() }}\n \n{% endblock %}\n{% block content %}\n

Index

\n#}\n

\n Welcome to my awesome homepage.\n

\n{% endblock %}\n" }, { "path": "tests/inputs/clarityfiles.clar", "content": ";; Test fixture for Clarity language\n;; This file covers various comment and code patterns\n\n(define-constant TEST_CONSTANT u100)\n\n;; Full line comment before code\n(define-read-only (test-function (param uint))\n (ok param)\n)\n\n;; Another comment\n(define-map test-map\n uint\n bool\n)\n\n(define-public (public-function)\n ;; Inline comment in function\n (begin\n ;; Nested comment\n (ok true)\n )\n)\n\n;; Trailing comment on code line\n(define-data-var counter uint u0) ;; end of line comment\n\n;; Multiple blank lines above\n\n(define-constant ANOTHER_CONSTANT u200)\n\n" }, { "path": "tests/inputs/class.imba", "content": "# https://github.com/imba/imba/raw/master/test/syntax/class.imba\nextern describe, test, ok, eq, it\n\nclass Organism\n\n\tvar lvar = 10\n\n\tdef self.type\n\t\t'organism'\n\n\tdef initialize\n\t\t@ivar = 1\n\t\n\tdef lineage\n\t\t'organism'\n\t\t\n\tdef name\n\t\t'organism'\n\n\tdef speak\n\t\t'ghaarg'\n\n\tdef alive\n\t\tyes\n\n\tdef lvar\n\t\tlvar\n\n\t# hmm, maybe we shouldnt allow this?\n\t#\tclass Other\n\t#\n\t#\t\tdef inner\n\t#\t\t\tyes\n\t\t\nclass Virus < Organism\n\n\tdef initialize\n\t\t@ivar = 2\n\n\tdef lineage\n\t\t\"{name}.{super.lineage}\"\n\n\tdef name\n\t\t'virus'\n\nclass Animal < Organism\n\n\t# def self.type\n\t# \"animal.{super}\"\n\n\tdef lineage\n\t\t\"animal.{super.lineage}\"\n\nclass Cat < Animal\n\n\t# def self.type\n\t# \"cat.{super}\"\n\n\tdef lineage\n\t\t\"cat.{super.lineage}\"\n\n\tdef speak\n\t\t'miau'\n\nclass Dog < Animal\n\n\t# def self.type\n\t# \"dog.{super}\"\n\tdef lineage\n\t\t\"dog.{super.lineage}\"\n\t\t\n\tdef speak\n\t\t'woff'\n\t\t\n\nclass Human < Animal\n\n\tdef lineage\n\t\t\"human.{super.lineage}\"\n\n\tdef speak\n\t\t'hello'\n\nclass Zombie < Human\n\n\tdef lineage\n\t\t\"zombie.{super.lineage}\"\n\n\tdef alive\n\t\tno\n\n\ndescribe 'Syntax - Class' do\n\n\t# test 'nested classes work' do\n\t# \tok !!Organism.Other\n\n\ttest 'should' do\n\n\t\t# you can define variables local to classbody\n\t\tvar obj = Organism.new\n\t\teq obj.lvar, 10\n\n\tdescribe 'Methods' do\n\n\t\tit 'should define class methods' do\n\t\t\teq Organism.type, 'organism'\n\n\t\tit 'should inherit class methods' do\n\t\t\teq Virus:type, Organism:type\n\n\t\t# it 'should call super in class methods' do\n\t\t# eq Dog.type, \"dog.animal.organism\"\n\t\t# eq Cat.type, \"cat.animal.organism\"\n\n\tdescribe 'Instance' do\n\n\t\tit 'should call the parent constructor by default' do\n\t\t\tvar obj = Cat.new\n\t\t\teq obj.@ivar, 1\n\n\t\tit 'should define instance methods' do\n\t\t\tvar obj = Organism.new\n\t\t\tvar val = obj.alive\n\t\t\t# eq val, true\n\t\t\tok obj.alive\n\t\t\teq obj.speak, 'ghaarg'\n\n\t\tit 'should inherit instance methods' do\n\t\t\tvar obj = Virus.new\n\t\t\tok obj.alive\n\n\n\t\tit 'should override instance methods' do\n\t\t\teq Organism.new.name, 'organism'\n\t\t\teq Virus.new.name, 'virus'\n\n\t\tit 'should call super in instance methods' do\n\t\t\t# Should not refer to the prototype directly?\n\t\t\teq Virus.new.lineage, 'virus.organism'\n\t\t\teq Zombie.new.lineage, 'zombie.human.animal.organism'\n\n\ttest 'define methods outside scope' do\n\t\tclass Cls\n\t\t\tdef self.a do 1\n\t\t\tdef a do 2\n\n\t\tdef Cls.b\n\t\t\t1\n\n\t\textend class Cls\n\t\t\tdef b\n\t\t\t\t2\n\n\t\teq Cls.a, 1\n\t\teq Cls.b, 1\n\n\t\teq Cls.new.a, 2\n\t\teq Cls.new.b, 2\n\n\t\n\ttest 'Scoping' do\n\n\t\tvar variable = 1\n\n\t\tlocal class A\n\t\t\tvar variable = 2\n\n\t\t\tdef self.base\n\t\t\t\tvariable\n\n\t\t\tdef self.add add\n\t\t\t\tvariable += add\n\n\t\t\tdef initialize add\n\t\t\t\t@sum = variable + add\n\t\t\t\tself\n\n\t\t\tdef base\n\t\t\t\tvariable\n\n\t\t\tdef sum\n\t\t\t\t@sum\n\n\t\teq variable, 1\n\t\teq A.base, 2\n\t\teq A.new.base, 2\n\t\teq A.new(5).sum, 7\n\n\t\tA.add(2)\n\n\t\teq variable, 1\n ###\t\teq A.base, 4 ###\n\n###\t\t\t\t\t\n\ttest 'issue #71' do\n\t\tvar res\n\t\tvar def ping cb\n\t\t\tres = cb()\n\n\t\tclass A\n\t\t\tping do self\n\n\t\teq res, A\n\n###\t\t\t\t\t\n\n\n\n" }, { "path": "tests/inputs/cli-args.nf", "content": "#!/usr/bin/env nextflow\n// https://github.com/nextflow-io/nextflow/raw/refs/heads/master/tests/cli-args.nf\n/*\n * Copyright 2013-2024, Seqera Labs\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n \nprintln \"alpha: ${params.alpha}\"\nprintln \"beta : ${params.beta}\"\nprintln \"delta: ${params.delta}\"\nprintln \"gamma: ${params.gamma}\"\nprintln \"omega: ${params.omega}\"\nprintln \"args : ${args.join('_')}\"\n" }, { "path": "tests/inputs/cloc-dev.code-workspace", "content": "{\n // this is a comment\n\t\"folders\": [\n\t\t{\n\t\t\t\"path\": \".\"\n\t\t},\n\t\t{\n\t\t\t\"path\": \"tests\"\n\t\t},\n\t\t{\n\t\t\t\"path\": \"Unix\"\n\t\t}\n /* \n more\n comments \n */\n\t],\n\t\"settings\": {}\n}\n" }, { "path": "tests/inputs/cloc_counts.csv", "content": "files,language,blank,comment,code,\"github.com/AlDanial/cloc v 1.89 T=0.15 s (1625.6 files/s, 119625.7 lines/s)\"\n2,ANTLR Grammar,200,59,1012\n3,R,95,312,698\n1,C/C++ Header,191,780,617\n11,C++,132,183,603\n2,Forth,17,84,529\n4,TypeScript,53,39,416\n1,Logtalk,59,57,368\n7,C,110,72,354\n2,Windows Message File,89,9,348\n2,TeX,36,64,265\n1,Racket,32,159,247\n1,SVG,19,4,242\n1,Glade,0,22,232\n1,DIET,10,4,230\n1,Windows Resource File,42,45,218\n3,Assembly,40,140,204\n2,make,49,85,139\n1,Zig,2,10,128\n5,Bourne Shell,17,7,123\n2,Idris,38,90,117\n1,ECPP,26,34,116\n2,Prolog,43,8,114\n1,Ruby,11,30,111\n1,Hoon,0,10,110\n1,Imba,71,30,108\n1,Thrift,57,134,97\n1,Xtend,17,52,91\n1,Lean,36,20,90\n1,Odin,32,56,90\n2,Smalltalk,19,5,85\n1,Vuejs Component,10,2,85\n5,Java,13,28,81\n1,Scheme,10,18,78\n1,MXML,23,5,74\n2,Perl,44,72,73\n3,Visual Basic,48,57,72\n3,MATLAB,3,11,68\n1,Oracle PL/SQL,0,15,67\n1,Haml,5,16,66\n1,Swift,23,13,65\n1,Fish Shell,14,47,62\n1,RAML,5,3,62\n1,Verilog-SystemVerilog,4,20,62\n1,Clean,10,30,58\n1,Qt Linguist,0,4,57\n1,SaltStack,6,1,55\n1,Dockerfile,4,1,53\n1,Meson,13,9,48\n1,Fennel,6,3,44\n1,JCL,0,18,44\n1,HCL,14,36,43\n1,Nim,5,13,43\n1,Nix,15,15,43\n1,Sass,14,0,43\n3,Go,14,41,40\n1,Raku,19,12,39\n3,SQL,24,36,39\n1,Agda,10,3,38\n3,COBOL,5,8,35\n4,Haskell,23,26,35\n1,RobotFramework,9,5,35\n1,AsciiDoc,17,27,34\n1,EJS,0,11,34\n1,IPL,6,15,33\n1,PO File,9,18,33\n1,GLSL,10,14,32\n1,WebAssembly,8,20,32\n2,Mustache,5,7,31\n2,Specman e,4,12,31\n1,Squirrel,6,4,31\n7,Python,16,54,30\n1,ASP.NET,8,0,29\n1,Apex Class,3,6,28\n1,Cucumber,3,2,28\n1,Drools,7,16,28\n1,Freemarker Template,0,2,27\n1,Puppet,2,2,27\n1,Bazel,7,1,26\n2,PHP,11,13,26\n1,LFE,15,21,25\n1,Objective-C,11,11,25\n1,Scala,8,8,25\n1,Brainfuck,1,3,24\n6,Fortran 90,1,18,24\n1,Haxe,26,99,24\n1,Lisp,5,26,24\n3,C#,8,7,23\n1,Blade,10,5,22\n1,JSON,0,0,22\n1,JSON5,0,4,22\n2,Mathematica,24,17,22\n1,Stata,7,7,22\n1,TOML,8,4,22\n1,Jupyter Notebook,0,126,21\n1,Smarty,1,1,21\n1,YAML,0,1,20\n1,BrightScript,0,3,19\n1,Igor Pro,4,6,19\n1,PL/M,1,5,19\n1,Solidity,0,2,19\n1,TTCN,11,16,19\n2,XSLT,0,4,19\n4,Pascal,4,15,18\n1,Windows Module Definition,1,1,18\n1,Gradle,0,2,17\n1,Mojo,6,4,17\n2,Razor,6,7,17\n2,Logos,6,3,16\n1,Gencat NLS,1,4,15\n5,JavaScript,3,0,15\n1,Pig Latin,19,40,15\n1,SWIG,4,4,15\n1,TNSDL,5,3,15\n1,Embedded Crystal,4,4,14\n1,F#,3,6,14\n1,GraphQL,1,2,14\n2,IDL,25,7,14\n1,SugarSS,5,4,13\n1,Velocity Template Language,0,20,13\n1,Starlark,3,4,11\n1,Jinja Template,0,6,10\n1,Slim,0,3,10\n1,reStructuredText,6,4,10\n1,Kotlin,0,3,9\n1,Mako,3,8,9\n1,Svelte,2,2,9\n1,Vala,0,5,9\n3,XML,0,5,9\n1,F# Script,1,2,8\n1,FXML,2,3,8\n1,SparForte,6,8,8\n1,WXML,3,2,8\n1,Elixir,3,10,7\n2,Fortran 77,1,8,7\n1,INI,2,3,7\n3,Lua,9,33,7\n1,Chapel,7,35,6\n2,Julia,4,15,5\n1,PL/I,0,7,5\n1,APL,3,6,4\n1,Arduino Sketch,1,5,4\n1,ReasonML,2,8,4\n1,Rmd,10,19,4\n1,WXSS,0,0,4\n1,Groovy,0,3,3\n1,LLVM IR,2,6,3\n1,Literate Idris,2,2,3\n1,ProGuard,7,14,3\n1,Tcl/Tk,1,2,3\n1,dhall,6,17,3\n1,ColdFusion,1,2,2\n1,DOS Batch,1,2,2\n1,Focus,1,2,1\n1,MUMPS,0,2,1\n1,XQuery,0,1,1\n1,xBase,0,9,1\n243,SUM,2381,4182,11319\n" }, { "path": "tests/inputs/clusterConf.ttcn", "content": "// http://www.wiley.com/legacy/wileychi/ttcn-3/supp/clusterConf.ttcn\n\n/* ------------------------------------------------------------\n *\n * $Id: clusterConf.ttcn,v 1.5 2005/02/10 07:33:55 deiss Exp $\n * \n * @author Thomas Deiss\n * @remark Copyright: Nokia, 2004, 2005\n * \n * @remark DISCLAIMER: This TTCN-3 code is experimental code.\n * Its purpose is to highlight strengths and weaknesses of\n * TTCN-3, but it is not intended to be directly added to \n * real test suites. The reader is strongly advised to check the code\n * whether it fits the readers purpose and adapt it accordingly.\n *\n * @desc This module contains type definitions for clusters of components.\n */\n\nmodule clusterConf {\n\n group g_ports {\n\n type port AnyPort mixed {\n inout all\n }\n \n } // endgroup g_ports\n\n group g_components {\n \n type component Server {\n port AnyPort pt_servers\n }\n\n type component Supervisor {\n port AnyPort pt_servers;\n port AnyPort pt_cluster\n }\n \n type component Worker {\n port AnyPort pt_servers\n }\n \n } // endgroup g_components\n\n} //endmodule clusterConf\n" }, { "path": "tests/inputs/comments.rhai", "content": "// https://github.com/rhaiscript/rhai/raw/refs/heads/main/scripts/comments.rhai\n\n// Note: nested /* */ comments, as below, are not handled correctly by cloc\n\n// I am a single line comment!\n\n\nlet /* I am a spy in a variable declaration! */ x = 5;\n\n/* I am a simple\n multi-line\n comment */\n\n/* look /* at /* that, /* multi-line */ comments */ can be */ nested */\n\n/* surrounded by */ let this_is_not_a_comment = true // comments\n" }, { "path": "tests/inputs/comments_in_str.svelte", "content": "\n\n
Hello
\n" }, { "path": "tests/inputs/comp.ecpp", "content": "\n\n \n\n\n\n

Calling subcomponents

\n\n

\nEcpp-pages can embed other pages. These embedded pages are called\nsubcomponents. They come in 2 variants: local and external. Local\nsubcomponents are defined inside another component with\n<%def componentname> and closed with\n</def>. External subcomponents are normal components.\n

\n\n

\nA subcomponentcall starts with <& and ends with\n&>. Insert the componentname between these tags. If you omit the\nlibrary-part of the component, the current library is used. If the\ncomponentname is a single word, ecpp looks for a local component, which is\ncalled if found. Otherwise it is a external componentcall.\n

\n\n

\nYou can dynamically build componentnames, by putting a c++-expression inside\nbrackets. This expression is evaluated on runtime and the resulting component\nis called. The expression can be of type (or convertable to)\nstd::string, tnt::Compident or tnt::Subcompident.\n

\n\n

\nAfter the componentname you can add named parameters. Put a name followed by\n'=' and a value. The value is either a constant string or a expression. A\nexpression must be bracketed. If you want to pass just the same parameters\nyour current component received, put the single word qparam into the\nlist (actually you can pass any cxxtools::query_params-variable).\n

\n\n

\nA special case are local components, which have c++-parameters. You can put a\nnormal parameterlist just like in c++-functions after the defition\n(<%def>-block) after the componentname. The can only be called locally.\n

\n\n

Just a local componentcall

\n\n

\n <& localcomp param1=\"value1\" &>\n

\n\n

\n <& localcomp param1=\"value1\" &>\n

\n\n\n

Another local componentcall. We pass a c++-parameter.

\n

\n <& localcomp_p(5) &>\n

\n

\n <& localcomp_p(5) >\n

\n\n\n

A external componentcall (localcomp \"extcomp\" does not exist)

\n\n

\n <& subcomp param1=\"value1\" &>\n

\n

\n <& subcomp param1=\"value1\" &>\n

\n\n

a external componentcall

\n\n

\n <& extcomp@extlib param1=\"value1\" &>\n

\n

\n <& extcomp@extlib param1=\"value1\" &>\n

\n\n

a external subcomponentcall

\n\n

\n <& extcomp.subcomp@extlib param1=\"value1\" &>\n

\n

\n <& extcomp.subcomp@extlib param1=\"value1\" &>\n

\n\n

compose componentname by expression

\n<{\n // define some variables here\n std::string compname = \"extcomp\";\n std::string libname = \"extlib\";\n}>\n

\n <& (compname + '@' + libname) param1=\"value1\" &>\n

\n

\n <& (compname + '@' + libname) param1=\"value1\" &>\n

\n\n

call component by componentidentifier

\n

\n <& (tnt::Compident(compname, libname)) param1=\"value1\" &>\n

\n

\n <& (tnt::Compident(libname, compname)) param1=\"value1\" &>\n

\n\n

pass a expression as parameter

\n

\n <& localcomp param1=(1+5) qparam param2=\"uhu\"&>\n

\n

\n <& localcomp param1=(1+5) qparam param2=\"uhu\"&>\n

\n\n

pass multiple values with the same name as parameter

\n

\n <& localcomp param3=\"value1\" param3=\"value2\"\n param4=\"17\" param4=(28) &>\n

\n <& localcomp param3=\"value1\" param3=\"value2\"\n param4=\"17\" param4=(28) &>\n\n<%doc>\n

call subcomponents in c++-blocks

\n

\n callComp(\"extcomp@extlib\", request, reply, qparam);\n

\n

\n<{\n callComp(\"extcomp@extlib\", request, reply, qparam);\n}>\n

\n\n\n\n\n<%def localcomp>\n<%args>\nparam1;\nparam2;\nparam3[];\nint param4[];\n\n This is a local subcomponent.\n We got a parameter param1 with the value <$param1$>.\n% if (!param2.empty()) {\n We got param2 also. Its value is <$param2$>.\n% }\n We got <$ param3.size() $> times \"param3\" and <$ param4.size() $> times\n \"param4\".\n The values of param3 are:\n <{ std::copy(param3.begin(), param3.end(),\n std::ostream_iterator(reply.out(), \", \")); }>.\n The values of param4 are:\n <{ std::copy(param4.begin(), param4.end(),\n std::ostream_iterator(reply.out(), \", \")); }>.\n\n\n\n<%def localcomp_p(int i)>\nThis is a local subcomponent with parameter.\nWe got a c++-integer-parameter with the value <$i$>.\nThis component can only be called locally because of c++-parameters.\n\n" }, { "path": "tests/inputs/complex_union.derw", "content": "-- https://github.com/eeue56/derw/blob/main/examples/complex_union.derw\ntype Animal =\n Dog { name: string }\n | Cat { lives: number }\n\nsayHiToPet: Animal -> string\nsayHiToPet pet =\n case pet of\n Dog { name } ->\n `Good boy ${name}!`\n\t{-\n Cat { lives } ->\n \"You have \" + lives + \" lives remaining.\"\n\t-}\n\nmain: void\nmain =\n Dog { name: \"roof\" }\n |> sayHiToPet\n |> console.log\n" }, { "path": "tests/inputs/conditions.CBL", "content": " $ SET SOURCEFORMAT\"FREE\"\r\nIDENTIFICATION DIVISION.\r\nPROGRAM-ID. Conditions.\r\nAUTHOR. Michael Coughlan.\r\n* An example program demonstrating the use of \r\n* condition names (level 88's).\r\n* The EVALUATE and PERFORM verbs are also used.\r\n\r\nDATA DIVISION.\r\nWORKING-STORAGE SECTION.\r\n01 Char PIC X.\r\n 88 Vowel VALUE \"a\", \"e\", \"i\", \"o\", \"u\".\r\n 88 Consonant VALUE \"b\", \"c\", \"d\", \"f\", \"g\", \"h\"\r\n \"j\" THRU \"n\", \"p\" THRU \"t\", \"v\" THRU \"z\".\r\n 88 Digit VALUE \"0\" THRU \"9\".\r\n 88 ValidCharacter VALUE \"a\" THRU \"z\", \"0\" THRU \"9\".\r\n\r\nPROCEDURE DIVISION.\r\nBegin.\r\n DISPLAY \"Enter lower case character or digit. No data ends.\".\r\n ACCEPT Char.\r\n PERFORM UNTIL NOT ValidCharacter\r\n EVALUATE TRUE\r\n WHEN Vowel DISPLAY \"The letter \" Char \" is a vowel.\"\r\n WHEN Consonant DISPLAY \"The letter \" Char \" is a consonant.\"\r\n WHEN Digit DISPLAY Char \" is a digit.\"\r\n WHEN OTHER DISPLAY \"problems found\"\r\n END-EVALUATE\r\n END-PERFORM\r\n STOP RUN.\r\n \r\n" }, { "path": "tests/inputs/config.junos", "content": "## Last commit: 2017-02-16 10:48:24 PST by root\n# based on https://github.com/Juniper/Intro-to-Using-Ansible-with-Junos-OS/raw/master/library/config.conf\nversion 14.2R6.5;\ngroups {\n re0 {\n system {\n /* host-name be-mx480-1-re0; */\n }\n interfaces {\n fxp0 {\n/*\n unit 0 {\n family inet {\n filter {\n group 1; */\n }\n address **.***.*.**/22;\n }\n }\n }\n }\n }\n re1 {\n system {\n host-name be-mx480-1-re1;\n }\n interfaces {\n fxp0 {\n unit 0 {\n family inet {\n filter {\n group 1;\n }\n address **.***.*.**/22;\n }\n }\n }\n }\n }\n global {\n system {\n domain-name ********;\n domain-search [ ******** ];\n backup-router **.***.*.*** destination *.*.*.*;\n time-zone America/Los_Angeles;\n debugger-on-panic;\n debugger-on-break;\n dump-on-panic;\n authentication-order [ radius password ];\n root-authentication {\n encrypted-password ******\n }\n name-server {\n ***.***.*.**;\n ***.***.**.***;\n ***.**.**.***;\n ***.**.**.***;\n }\n radius-server {\n ***.***.**.***\n ***.***.**.**\n }\n login {\n class superuser-local {\n permissions all;\n }\n user labadmin {\n uid 2003;\n class superuser;\n shell csh;\n authentication {\n encrypted-password ****\n }\n }\n }\n services {\n finger;\n ftp;\n rlogin;\n rsh;\n ssh;\n telnet;\n xnm-clear-text;\n netconf {\n ssh;\n }\n }\n syslog {\n user * {\n any emergency;\n }\n file messages {\n any warning;\n authorization info;\n archive world-readable;\n }\n file security {\n interactive-commands any;\n archive world-readable;\n }\n }\n processes {\n routing enable;\n ntp enable;\n management enable;\n watchdog enable;\n snmp enable;\n inet-process enable;\n mib-process enable;\n }\n ntp {\n boot-server ***.**.**.*;\n server ***.**.**.*;\n }\n }\n snmp {\n location \"Software lab\";\n interface fxp0.0;\n community public {\n authorization read-only;\n }\n community private {\n authorization read-write;\n }\n }\n routing-options {\n static {\n route 10.***.*.*/16 {\n next-hop 10.***.*.***;\n retain;\n no-readvertise;\n }\n }\n }\n }\n}\napply-groups [ global re0 re1 ];\n" }, { "path": "tests/inputs/cpp-example.inc", "content": "#\n# Copyright OpenEmbedded Contributors\n#\n# SPDX-License-Identifier: MIT\n#\n\nLICENSE = \"MIT\"\nLIC_FILES_CHKSUM = \"file://${COMMON_LICENSE_DIR}/MIT;md5=0835ade698e0bcf8506ecda2f7b4f302\"\n\nDEPENDS += \"json-c\"\n\nPV = \"1.0\"\n\nSRC_URI = \"\\\n file://cpp-example.cpp \\\n file://cpp-example-lib.hpp \\\n file://cpp-example-lib.cpp \\\n file://test-cpp-example.cpp \\\n file://run-ptest \\\n\"\n\nS = \"${WORKDIR}\"\n\ninherit ptest\n" }, { "path": "tests/inputs/cross-platform.just", "content": "# https://github.com/casey/just/blob/master/examples/cross-platform.just\n# use with https://github.com/casey/just\n#\n# Example cross-platform Python project\n#\n\npython_dir := if os_family() == \"windows\" { \"./.venv/Scripts\" } else { \"./.venv/bin\" }\npython := python_dir + if os_family() == \"windows\" { \"/python.exe\" } else { \"/python3\" }\nsystem_python := if os_family() == \"windows\" { \"py.exe -3.9\" } else { \"python3.9\" }\n\n# Set up development environment\nbootstrap:\n if test ! -e .venv; then {{ system_python }} -m venv .venv; fi\n {{ python }} -m pip install --upgrade pip wheel pip-tools\n {{ python_dir }}/pip-sync\n\n# Upgrade Python dependencies\nupgrade-deps: && bootstrap\n {{ python_dir }}/pip-compile --upgrade\n\n# Sample project script 1\nscript1:\n {{ python }} script1.py\n\n# Sample project script 2\nscript2 *ARGS:\n {{ python }} script2.py {{ ARGS }}\n" }, { "path": "tests/inputs/csharp-designer.designer.cs", "content": "//------------------------------------------------------------------------------\n// \n// This code was generated by a tool.\n// Runtime Version:4.0.30319.42000\n//\n// Changes to this file may cause incorrect behavior and will be lost if\n// the code is regenerated.\n// \n//------------------------------------------------------------------------------\n\nnamespace StyleCop.CSharp {\n using System;\n \n \n /// \n /// A strongly-typed resource class, for looking up localized strings, etc.\n /// \n // This class was auto-generated by the StronglyTypedResourceBuilder\n // class via a tool like ResGen or Visual Studio.\n // To add or remove a member, edit your .ResX file then rerun ResGen\n // with the /str option, or rebuild your VS project.\n [global::System.CodeDom.Compiler.GeneratedCodeAttribute(\"System.Resources.Tools.StronglyTypedResourceBuilder\", \"4.0.0.0\")]\n [global::System.Diagnostics.DebuggerNonUserCodeAttribute()]\n [global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]\n internal class Strings {\n \n private static global::System.Resources.ResourceManager resourceMan;\n \n private static global::System.Globalization.CultureInfo resourceCulture;\n \n [global::System.Diagnostics.CodeAnalysis.SuppressMessageAttribute(\"Microsoft.Performance\", \"CA1811:AvoidUncalledPrivateCode\")]\n internal Strings() {\n }\n \n /// \n /// Returns the cached ResourceManager instance used by this class.\n /// \n [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]\n internal static global::System.Resources.ResourceManager ResourceManager {\n get {\n if (object.ReferenceEquals(resourceMan, null)) {\n global::System.Resources.ResourceManager temp = new global::System.Resources.ResourceManager(\"StyleCop.CSharp.Strings\", typeof(Strings).Assembly);\n resourceMan = temp;\n }\n return resourceMan;\n }\n }\n \n /// \n /// Looks up a localized string similar to StyleCop.\n /// \n internal static string Title {\n get {\n return ResourceManager.GetString(\"Title\", resourceCulture);\n }\n }\n }\n}\n" }, { "path": "tests/inputs/cucumber.feature", "content": "# https://raw.githubusercontent.com/diaspora/diaspora/master/features/mobile/activity_stream.feature\n@javascript @mobile\nFeature: Viewing my activity on the steam mobile page\n In order to navigate Diaspora*\n As a mobile user\n I want to view my activity stream\n\n Background:\n Given following users exist:\n | username |\n | alice |\n | bob |\n And a user with username \"bob\" is connected with \"alice\"\n And \"alice@alice.alice\" has a public post with text \"Hello! I am #newhere\"\n # another comment\n Scenario: Show my activity empty\n When I sign in as \"bob@bob.bob\" on the mobile website\n When I go to the activity stream page\n Then I should see \"My activity\" within \"#main\"\n And I should not see \"Hello! I am #newhere\"\n\n Scenario: Show liked post on my activity\n When I sign in as \"bob@bob.bob\" on the mobile website\n When I click on selector \"a.like-action.inactive\"\n And I go to the activity stream page\n Then I should see \"My activity\" within \"#main\"\n And I should see \"Hello! I am #newhere\" within \".ltr\"\n\n Scenario: Show own post on my activity\n When I sign in as \"alice@alice.alice\" on the mobile website\n And I go to the activity stream page\n Then I should see \"My activity\" within \"#main\"\n And I should see \"Hello! I am #newhere\" within \".ltr\"\n" }, { "path": "tests/inputs/custom.triple.extension.js", "content": "js 4\n" }, { "path": "tests/inputs/darwin-configuration.nix", "content": "# https://raw.githubusercontent.com/input-output-hk/iohk-ops/develop/nix-darwin/darwin-configuration.nix\n{ config, pkgs, ... }:\n\nlet\n opsLib = import ;\n\nin {\n imports = [ ];\n\n # List packages installed in system profile. To search by name, run:\n # $ nix-env -qaP | grep wget\n environment.systemPackages = with pkgs; [\n nix-repl\n nix\n tmux\n ncdu\n git\n ] ++ (if pkgs.stdenv.isDarwin then [\n darwin.cctools\n ] else []);\n\n # Create /etc/bashrc that loads the nix-darwin environment.\n programs.bash.enable = true;\n # programs.zsh.enable = true;\n # programs.fish.enable = true;\n\n # Used for backwards compatibility, please read the changelog before changing.\n # $ darwin-rebuild changelog\n system.stateVersion = 2;\n\n # You should generally set this to the total number of logical cores in your system.\n # $ sysctl -n hw.ncpu\n nix.maxJobs = 4;\n nix.buildCores = 0;\n nix.useSandbox = false; # this seems to break things when enabled\n nix.extraOptions = ''\n gc-keep-derivations = true\n gc-keep-outputs = true\n '';\n\n nix.binaryCachePublicKeys = [ \"hydra.iohk.io:f/Ea+s+dFdN+3Y/G+FDgSq+a5NEWhJGzdjvKNGv0/EQ=\" ];\n nix.binaryCaches = [ \"https://hydra.iohk.io\" ];\n nix.trustedUsers = [ \"@admin\" ];\n\n nix.nixPath = [\n \"nixpkgs=UNSET\"\n \"darwin=UNSET\"\n \"darwin-config=UNSET\"\n \"iohk-ops=UNSET\"\n ];\n\n ########################################################################\n\n # try to ensure 25G of free space\n nix.gc.automatic = true;\n nix.gc.options = \"--max-freed $((25 * 1024**3 - 1024 * $(df -P -k /nix/store | tail -n 1 | awk '{ print $4 }')))\";\n\n ########################################################################\n\n services.nix-daemon.enable = true;\n\n # Recreate /run/current-system symlink after boot.\n services.activate-system.enable = true;\n\n system.activationScripts.postActivation.text = ''\n printf \"disabling spotlight indexing... \"\n mdutil -i off -d / &> /dev/null\n mdutil -E / &> /dev/null\n echo \"ok\"\n '';\n\n ########################################################################\n}\n" }, { "path": "tests/inputs/dd/bb/cc/MoreTeapotsRenderer.cpp", "content": "/*\n * Copyright 2013 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n//--------------------------------------------------------------------------------\n// MoreTeapotsRenderer.cpp\n// Render teapots\n//--------------------------------------------------------------------------------\n//--------------------------------------------------------------------------------\n// Include files\n//--------------------------------------------------------------------------------\n#include \"MoreTeapotsRenderer.h\"\n\n//--------------------------------------------------------------------------------\n// Teapot model data\n//--------------------------------------------------------------------------------\n#include \"teapot.inl\"\n\n//--------------------------------------------------------------------------------\n// Ctor\n//--------------------------------------------------------------------------------\nMoreTeapotsRenderer::MoreTeapotsRenderer() :\n geometry_instancing_support_( false )\n{\n\n}\n\n//--------------------------------------------------------------------------------\n// Dtor\n//--------------------------------------------------------------------------------\nMoreTeapotsRenderer::~MoreTeapotsRenderer()\n{\n Unload();\n}\n\n//--------------------------------------------------------------------------------\n// Init\n//--------------------------------------------------------------------------------\nvoid MoreTeapotsRenderer::Init( const int32_t numX,\n const int32_t numY,\n const int32_t numZ )\n{\n if( ndk_helper::GLContext::GetInstance()->GetGLVersion() >= 3.0 )\n {\n geometry_instancing_support_ = true;\n }\n else if( ndk_helper::GLContext::GetInstance()->CheckExtension( \"GL_NV_draw_instanced\" )\n && ndk_helper::GLContext::GetInstance()->CheckExtension(\n \"GL_NV_uniform_buffer_object\" ) )\n {\n LOGI( \"Supported via extension!\" );\n //_bGeometryInstancingSupport = true;\n //_bARBSupport = true; //Need to patch shaders\n //Currently this has been disabled\n }\n\n //Settings\n glFrontFace( GL_CCW );\n\n //Create Index buffer\n num_indices_ = sizeof(teapotIndices) / sizeof(teapotIndices[0]);\n glGenBuffers( 1, &ibo_ );\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, ibo_ );\n glBufferData( GL_ELEMENT_ARRAY_BUFFER, sizeof(teapotIndices), teapotIndices, GL_STATIC_DRAW );\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, 0 );\n\n //Create VBO\n num_vertices_ = sizeof(teapotPositions) / sizeof(teapotPositions[0]) / 3;\n int32_t iStride = sizeof(TEAPOT_VERTEX);\n int32_t iIndex = 0;\n TEAPOT_VERTEX* p = new TEAPOT_VERTEX[num_vertices_];\n for( int32_t i = 0; i < num_vertices_; ++i )\n {\n p[i].pos[0] = teapotPositions[iIndex];\n p[i].pos[1] = teapotPositions[iIndex + 1];\n p[i].pos[2] = teapotPositions[iIndex + 2];\n\n p[i].normal[0] = teapotNormals[iIndex];\n p[i].normal[1] = teapotNormals[iIndex + 1];\n p[i].normal[2] = teapotNormals[iIndex + 2];\n iIndex += 3;\n }\n glGenBuffers( 1, &vbo_ );\n glBindBuffer( GL_ARRAY_BUFFER, vbo_ );\n glBufferData( GL_ARRAY_BUFFER, iStride * num_vertices_, p, GL_STATIC_DRAW );\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\n delete[] p;\n\n //Init Projection matrices\n teapot_x_ = numX;\n teapot_y_ = numY;\n teapot_z_ = numZ;\n vec_mat_models_.reserve( teapot_x_ * teapot_y_ * teapot_z_ );\n\n UpdateViewport();\n\n const float total_width = 500.f;\n float gap_x = total_width / (teapot_x_ - 1);\n float gap_y = total_width / (teapot_y_ - 1);\n float gap_z = total_width / (teapot_z_ - 1);\n float offset_x = -total_width / 2.f;\n float offset_y = -total_width / 2.f;\n float offset_z = -total_width / 2.f;\n\n for( int32_t iX = 0; iX < teapot_x_; ++iX )\n for( int32_t iY = 0; iY < teapot_y_; ++iY )\n for( int32_t iZ = 0; iZ < teapot_z_; ++iZ )\n {\n vec_mat_models_.push_back(\n ndk_helper::Mat4::Translation( iX * gap_x + offset_x, iY * gap_y + offset_y,\n iZ * gap_z + offset_z ) );\n vec_colors_.push_back(\n ndk_helper::Vec3( random() / float( RAND_MAX * 1.1 ),\n random() / float( RAND_MAX * 1.1 ),\n random() / float( RAND_MAX * 1.1 ) ) );\n\n float fX = random() / float( RAND_MAX ) - 0.5f;\n float fY = random() / float( RAND_MAX ) - 0.5f;\n vec_rotations_.push_back( ndk_helper::Vec2( fX * 0.05f, fY * 0.05f ) );\n vec_current_rotations_.push_back( ndk_helper::Vec2( fX * M_PI, fY * M_PI ) );\n }\n\n if( geometry_instancing_support_ )\n {\n //\n //Create parameter dictionary for shader patch\n std::map param;\n param[std::string( \"%NUM_TEAPOT%\" )] = ToString( teapot_x_ * teapot_y_ * teapot_z_ );\n param[std::string( \"%LOCATION_VERTEX%\" )] = ToString( ATTRIB_VERTEX );\n param[std::string( \"%LOCATION_NORMAL%\" )] = ToString( ATTRIB_NORMAL );\n if( arb_support_ )\n param[std::string( \"%ARB%\" )] = std::string( \"ARB\" );\n else\n param[std::string( \"%ARB%\" )] = std::string( \"\" );\n\n //Load shader\n bool b = LoadShadersES3( &shader_param_, \"Shaders/VS_ShaderPlainES3.vsh\",\n \"Shaders/ShaderPlainES3.fsh\", param );\n if( b )\n {\n //\n //Create uniform buffer\n //\n GLuint bindingPoint = 1;\n GLuint blockIndex;\n blockIndex = glGetUniformBlockIndex( shader_param_.program_, \"ParamBlock\" );\n glUniformBlockBinding( shader_param_.program_, blockIndex, bindingPoint );\n\n //Retrieve array stride value\n int32_t iNumIndices;\n glGetActiveUniformBlockiv( shader_param_.program_, blockIndex,\n GL_UNIFORM_BLOCK_ACTIVE_UNIFORMS, &iNumIndices );\n GLint i[iNumIndices];\n GLint stride[iNumIndices];\n glGetActiveUniformBlockiv( shader_param_.program_, blockIndex,\n GL_UNIFORM_BLOCK_ACTIVE_UNIFORM_INDICES, i );\n glGetActiveUniformsiv( shader_param_.program_, iNumIndices, (GLuint*) i,\n GL_UNIFORM_ARRAY_STRIDE, stride );\n\n ubo_matrix_stride_ = stride[0] / sizeof(float);\n ubo_vector_stride_ = stride[2] / sizeof(float);\n\n glGenBuffers( 1, &ubo_ );\n glBindBuffer( GL_UNIFORM_BUFFER, ubo_ );\n glBindBufferBase( GL_UNIFORM_BUFFER, bindingPoint, ubo_ );\n\n //Store color value which wouldn't be updated every frame\n int32_t iSize = teapot_x_ * teapot_y_ * teapot_z_\n * (ubo_matrix_stride_ + ubo_matrix_stride_ + ubo_vector_stride_); //Mat4 + Mat4 + Vec3 + 1 stride\n float* pBuffer = new float[iSize];\n float* pColor = pBuffer + teapot_x_ * teapot_y_ * teapot_z_ * ubo_matrix_stride_ * 2;\n for( int32_t i = 0; i < teapot_x_ * teapot_y_ * teapot_z_; ++i )\n {\n memcpy( pColor, &vec_colors_[i], 3 * sizeof(float) );\n pColor += ubo_vector_stride_; //Assuming std140 layout which is 4 DWORD stride for vectors\n }\n\n glBufferData( GL_UNIFORM_BUFFER, iSize * sizeof(float), pBuffer, GL_DYNAMIC_DRAW );\n delete[] pBuffer;\n }\n else\n {\n LOGI( \"Shader compilation failed!! Falls back to ES2.0 pass\" );\n //This happens some devices.\n geometry_instancing_support_ = false;\n //Load shader for GLES2.0\n LoadShaders( &shader_param_, \"Shaders/VS_ShaderPlain.vsh\", \"Shaders/ShaderPlain.fsh\" );\n }\n }\n else\n {\n //Load shader for GLES2.0\n LoadShaders( &shader_param_, \"Shaders/VS_ShaderPlain.vsh\", \"Shaders/ShaderPlain.fsh\" );\n }\n}\n\nvoid MoreTeapotsRenderer::UpdateViewport()\n{\n int32_t viewport[4];\n glGetIntegerv( GL_VIEWPORT, viewport );\n float fAspect = (float) viewport[2] / (float) viewport[3];\n\n const float CAM_NEAR = 5.f;\n const float CAM_FAR = 10000.f;\n bool bRotate = false;\n mat_projection_ = ndk_helper::Mat4::Perspective( fAspect, 1.f, CAM_NEAR, CAM_FAR );\n}\n\n//--------------------------------------------------------------------------------\n// Unload\n//--------------------------------------------------------------------------------\nvoid MoreTeapotsRenderer::Unload()\n{\n if( vbo_ )\n {\n glDeleteBuffers( 1, &vbo_ );\n vbo_ = 0;\n }\n if( ubo_ )\n {\n glDeleteBuffers( 1, &ubo_ );\n ubo_ = 0;\n }\n if( ibo_ )\n {\n glDeleteBuffers( 1, &ibo_ );\n ibo_ = 0;\n }\n if( shader_param_.program_ )\n {\n glDeleteProgram( shader_param_.program_ );\n shader_param_.program_ = 0;\n }\n}\n\n//--------------------------------------------------------------------------------\n// Update\n//--------------------------------------------------------------------------------\nvoid MoreTeapotsRenderer::Update( float fTime )\n{\n const float CAM_X = 0.f;\n const float CAM_Y = 0.f;\n const float CAM_Z = 2000.f;\n\n mat_view_ = ndk_helper::Mat4::LookAt( ndk_helper::Vec3( CAM_X, CAM_Y, CAM_Z ),\n ndk_helper::Vec3( 0.f, 0.f, 0.f ), ndk_helper::Vec3( 0.f, 1.f, 0.f ) );\n\n if( camera_ )\n {\n camera_->Update();\n mat_view_ = camera_->GetTransformMatrix() * mat_view_ * camera_->GetRotationMatrix();\n }\n}\n\n//--------------------------------------------------------------------------------\n// Render\n//--------------------------------------------------------------------------------\nvoid MoreTeapotsRenderer::Render()\n{\n // Bind the VBO\n glBindBuffer( GL_ARRAY_BUFFER, vbo_ );\n\n int32_t iStride = sizeof(TEAPOT_VERTEX);\n // Pass the vertex data\n glVertexAttribPointer( ATTRIB_VERTEX, 3, GL_FLOAT, GL_FALSE, iStride, BUFFER_OFFSET( 0 ) );\n glEnableVertexAttribArray( ATTRIB_VERTEX );\n\n glVertexAttribPointer( ATTRIB_NORMAL, 3, GL_FLOAT, GL_FALSE, iStride,\n BUFFER_OFFSET( 3 * sizeof(GLfloat) ) );\n glEnableVertexAttribArray( ATTRIB_NORMAL );\n\n // Bind the IB\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, ibo_ );\n\n glUseProgram( shader_param_.program_ );\n\n TEAPOT_MATERIALS material = { { 1.0f, 1.0f, 1.0f, 10.f }, { 0.1f, 0.1f, 0.1f }, };\n\n //Update uniforms\n //\n //using glUniform3fv here was troublesome..\n //\n glUniform4f( shader_param_.material_specular_, material.specular_color[0],\n material.specular_color[1], material.specular_color[2], material.specular_color[3] );\n glUniform3f( shader_param_.material_ambient_, material.ambient_color[0],\n material.ambient_color[1], material.ambient_color[2] );\n\n glUniform3f( shader_param_.light0_, 100.f, -200.f, -600.f );\n\n if( geometry_instancing_support_ )\n {\n //\n //Geometry instancing, new feature in GLES3.0\n //\n\n //Update UBO\n glBindBuffer( GL_UNIFORM_BUFFER, ubo_ );\n float* p = (float*) glMapBufferRange( GL_UNIFORM_BUFFER, 0,\n teapot_x_ * teapot_y_ * teapot_z_ * (ubo_matrix_stride_ * 2) * sizeof(float),\n GL_MAP_WRITE_BIT | GL_MAP_INVALIDATE_RANGE_BIT );\n float* pMVPMat = p;\n float* pMVMat = p + teapot_x_ * teapot_y_ * teapot_z_ * ubo_matrix_stride_;\n for( int32_t i = 0; i < teapot_x_ * teapot_y_ * teapot_z_; ++i )\n {\n //Rotation\n float fX, fY;\n vec_current_rotations_[i] += vec_rotations_[i];\n vec_current_rotations_[i].Value( fX, fY );\n ndk_helper::Mat4 mat_rotation = ndk_helper::Mat4::RotationX( fX )\n * ndk_helper::Mat4::RotationY( fY );\n\n // Feed Projection and Model View matrices to the shaders\n ndk_helper::Mat4 mat_v = mat_view_ * vec_mat_models_[i] * mat_rotation;\n ndk_helper::Mat4 mat_vp = mat_projection_ * mat_v;\n\n memcpy( pMVPMat, mat_vp.Ptr(), sizeof(mat_v) );\n pMVPMat += ubo_matrix_stride_;\n\n memcpy( pMVMat, mat_v.Ptr(), sizeof(mat_v) );\n pMVMat += ubo_matrix_stride_;\n }\n glUnmapBuffer( GL_UNIFORM_BUFFER );\n\n //Instanced rendering\n glDrawElementsInstanced( GL_TRIANGLES, num_indices_, GL_UNSIGNED_SHORT, BUFFER_OFFSET(0),\n teapot_x_ * teapot_y_ * teapot_z_ );\n\n }\n else\n {\n //Regular rendering pass\n for( int32_t i = 0; i < teapot_x_ * teapot_y_ * teapot_z_; ++i )\n {\n //Set diffuse\n float x, y, z;\n vec_colors_[i].Value( x, y, z );\n glUniform4f( shader_param_.material_diffuse_, x, y, z, 1.f );\n\n //Rotation\n vec_current_rotations_[i] += vec_rotations_[i];\n vec_current_rotations_[i].Value( x, y );\n ndk_helper::Mat4 mat_rotation = ndk_helper::Mat4::RotationX( x )\n * ndk_helper::Mat4::RotationY( y );\n\n // Feed Projection and Model View matrices to the shaders\n ndk_helper::Mat4 mat_v = mat_view_ * vec_mat_models_[i] * mat_rotation;\n ndk_helper::Mat4 mat_vp = mat_projection_ * mat_v;\n glUniformMatrix4fv( shader_param_.matrix_projection_, 1, GL_FALSE, mat_vp.Ptr() );\n glUniformMatrix4fv( shader_param_.matrix_view_, 1, GL_FALSE, mat_v.Ptr() );\n\n glDrawElements( GL_TRIANGLES, num_indices_, GL_UNSIGNED_SHORT, BUFFER_OFFSET(0) );\n\n }\n }\n\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, 0 );\n}\n\n//--------------------------------------------------------------------------------\n// LoadShaders\n//--------------------------------------------------------------------------------\nbool MoreTeapotsRenderer::LoadShaders( SHADER_PARAMS* params,\n const char* strVsh,\n const char* strFsh )\n{\n //\n //Shader load for GLES2\n //In GLES2.0, shader attribute locations need to be explicitly specified before linking\n //\n GLuint program;\n GLuint vertShader, fragShader;\n char *vertShaderPathname, *fragShaderPathname;\n\n // Create shader program\n program = glCreateProgram();\n LOGI( \"Created Shader %d\", program );\n\n // Create and compile vertex shader\n if( !ndk_helper::shader::CompileShader( &vertShader, GL_VERTEX_SHADER, strVsh ) )\n {\n LOGI( \"Failed to compile vertex shader\" );\n glDeleteProgram( program );\n return false;\n }\n\n // Create and compile fragment shader\n if( !ndk_helper::shader::CompileShader( &fragShader, GL_FRAGMENT_SHADER, strFsh ) )\n {\n LOGI( \"Failed to compile fragment shader\" );\n glDeleteProgram( program );\n return false;\n }\n\n // Attach vertex shader to program\n glAttachShader( program, vertShader );\n\n // Attach fragment shader to program\n glAttachShader( program, fragShader );\n\n // Bind attribute locations\n // this needs to be done prior to linking\n glBindAttribLocation( program, ATTRIB_VERTEX, \"myVertex\" );\n glBindAttribLocation( program, ATTRIB_NORMAL, \"myNormal\" );\n\n // Link program\n if( !ndk_helper::shader::LinkProgram( program ) )\n {\n LOGI( \"Failed to link program: %d\", program );\n\n if( vertShader )\n {\n glDeleteShader( vertShader );\n vertShader = 0;\n }\n if( fragShader )\n {\n glDeleteShader( fragShader );\n fragShader = 0;\n }\n if( program )\n {\n glDeleteProgram( program );\n }\n return false;\n }\n\n // Get uniform locations\n params->matrix_projection_ = glGetUniformLocation( program, \"uPMatrix\" );\n params->matrix_view_ = glGetUniformLocation( program, \"uMVMatrix\" );\n\n params->light0_ = glGetUniformLocation( program, \"vLight0\" );\n params->material_diffuse_ = glGetUniformLocation( program, \"vMaterialDiffuse\" );\n params->material_ambient_ = glGetUniformLocation( program, \"vMaterialAmbient\" );\n params->material_specular_ = glGetUniformLocation( program, \"vMaterialSpecular\" );\n\n // Release vertex and fragment shaders\n if( vertShader )\n glDeleteShader( vertShader );\n if( fragShader )\n glDeleteShader( fragShader );\n\n params->program_ = program;\n return true;\n}\n\nbool MoreTeapotsRenderer::LoadShadersES3( SHADER_PARAMS* params,\n const char* strVsh,\n const char* strFsh,\n std::map&shaderParams )\n{\n //\n //Shader load for GLES3\n //In GLES3.0, shader attribute index can be described in a shader code directly with layout() attribute\n //\n GLuint program;\n GLuint vertShader, fragShader;\n char *vertShaderPathname, *fragShaderPathname;\n\n // Create shader program\n program = glCreateProgram();\n LOGI( \"Created Shader %d\", program );\n\n // Create and compile vertex shader\n if( !ndk_helper::shader::CompileShader( &vertShader, GL_VERTEX_SHADER, strVsh, shaderParams ) )\n {\n LOGI( \"Failed to compile vertex shader\" );\n glDeleteProgram( program );\n return false;\n }\n\n // Create and compile fragment shader\n if( !ndk_helper::shader::CompileShader( &fragShader, GL_FRAGMENT_SHADER, strFsh,\n shaderParams ) )\n {\n LOGI( \"Failed to compile fragment shader\" );\n glDeleteProgram( program );\n return false;\n }\n\n // Attach vertex shader to program\n glAttachShader( program, vertShader );\n\n // Attach fragment shader to program\n glAttachShader( program, fragShader );\n\n // Link program\n if( !ndk_helper::shader::LinkProgram( program ) )\n {\n LOGI( \"Failed to link program: %d\", program );\n\n if( vertShader )\n {\n glDeleteShader( vertShader );\n vertShader = 0;\n }\n if( fragShader )\n {\n glDeleteShader( fragShader );\n fragShader = 0;\n }\n if( program )\n {\n glDeleteProgram( program );\n }\n\n return false;\n }\n\n // Get uniform locations\n params->light0_ = glGetUniformLocation( program, \"vLight0\" );\n params->material_ambient_ = glGetUniformLocation( program, \"vMaterialAmbient\" );\n params->material_specular_ = glGetUniformLocation( program, \"vMaterialSpecular\" );\n\n // Release vertex and fragment shaders\n if( vertShader )\n glDeleteShader( vertShader );\n if( fragShader )\n glDeleteShader( fragShader );\n\n params->program_ = program;\n return true;\n}\n\n//--------------------------------------------------------------------------------\n// Bind\n//--------------------------------------------------------------------------------\nbool MoreTeapotsRenderer::Bind( ndk_helper::TapCamera* camera )\n{\n camera_ = camera;\n return true;\n}\n\n//--------------------------------------------------------------------------------\n// Helper functions\n//--------------------------------------------------------------------------------\nstd::string MoreTeapotsRenderer::ToString( const int32_t i )\n{\n char str[64];\n snprintf( str, sizeof(str), \"%d\", i );\n return std::string( str );\n}\n\n" }, { "path": "tests/inputs/dd/bb/config.c", "content": "/* Generated automatically from /s/ndk-toolchain/src/python/Python-2.7.5/Modules/config.c.in by makesetup. */\n/* -*- C -*- ***********************************************\nCopyright (c) 2000, BeOpen.com.\nCopyright (c) 1995-2000, Corporation for National Research Initiatives.\nCopyright (c) 1990-1995, Stichting Mathematisch Centrum.\nAll rights reserved.\n\nSee the file \"Misc/COPYRIGHT\" for information on usage and\nredistribution of this file, and for a DISCLAIMER OF ALL WARRANTIES.\n******************************************************************/\n\n/* Module configuration */\n\n/* !!! !!! !!! This file is edited by the makesetup script !!! !!! !!! */\n\n/* This file contains the table of built-in modules.\n See init_builtin() in import.c. */\n\n#include \"Python.h\"\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n\nextern void initposix(void);\nextern void initthread(void);\nextern void initsignal(void);\nextern void initerrno(void);\nextern void init_sre(void);\nextern void init_codecs(void);\nextern void init_weakref(void);\nextern void initzipimport(void);\nextern void init_symtable(void);\nextern void initxxsubtype(void);\n\n/* -- ADDMODULE MARKER 1 -- */\n\nextern void PyMarshal_Init(void);\nextern void initimp(void);\nextern void initgc(void);\nextern void init_ast(void);\nextern void _PyWarnings_Init(void);\n\nstruct _inittab _PyImport_Inittab[] = {\n\n\t{\"posix\", initposix},\n\t{\"thread\", initthread},\n\t{\"signal\", initsignal},\n\t{\"errno\", initerrno},\n\t{\"_sre\", init_sre},\n\t{\"_codecs\", init_codecs},\n\t{\"_weakref\", init_weakref},\n\t{\"zipimport\", initzipimport},\n\t{\"_symtable\", init_symtable},\n\t{\"xxsubtype\", initxxsubtype},\n\n/* -- ADDMODULE MARKER 2 -- */\n\n /* This module lives in marshal.c */\n {\"marshal\", PyMarshal_Init},\n\n /* This lives in import.c */\n {\"imp\", initimp},\n\n /* This lives in Python/Python-ast.c */\n {\"_ast\", init_ast},\n\n /* These entries are here for sys.builtin_module_names */\n {\"__main__\", NULL},\n {\"__builtin__\", NULL},\n {\"sys\", NULL},\n {\"exceptions\", NULL},\n\n /* This lives in gcmodule.c */\n {\"gc\", initgc},\n\n /* This lives in _warnings.c */\n {\"_warnings\", _PyWarnings_Init},\n\n /* Sentinel */\n {0, 0}\n};\n\n\n#ifdef __cplusplus\n}\n#endif\n" }, { "path": "tests/inputs/dd/bb/ee/TeapotRenderer.cpp", "content": "/*\n * Copyright 2013 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n//--------------------------------------------------------------------------------\n// TeapotRenderer.cpp\n// Render a teapot\n//--------------------------------------------------------------------------------\n//--------------------------------------------------------------------------------\n// Include files\n//--------------------------------------------------------------------------------\n#include \"TeapotRenderer.h\"\n\n//--------------------------------------------------------------------------------\n// Teapot model data\n//--------------------------------------------------------------------------------\n#include \"teapot.inl\"\n\n//--------------------------------------------------------------------------------\n// Ctor\n//--------------------------------------------------------------------------------\nTeapotRenderer::TeapotRenderer()\n{\n\n}\n\n//--------------------------------------------------------------------------------\n// Dtor\n//--------------------------------------------------------------------------------\nTeapotRenderer::~TeapotRenderer()\n{\n Unload();\n}\n\nvoid TeapotRenderer::Init()\n{\n //Settings\n glFrontFace( GL_CCW );\n\n //Load shader\n LoadShaders( &shader_param_, \"Shaders/VS_ShaderPlain.vsh\",\n \"Shaders/ShaderPlain.fsh\" );\n\n //Create Index buffer\n num_indices_ = sizeof(teapotIndices) / sizeof(teapotIndices[0]);\n glGenBuffers( 1, &ibo_ );\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, ibo_ );\n glBufferData( GL_ELEMENT_ARRAY_BUFFER, sizeof(teapotIndices), teapotIndices,\n GL_STATIC_DRAW );\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, 0 );\n\n //Create VBO\n num_vertices_ = sizeof(teapotPositions) / sizeof(teapotPositions[0]) / 3;\n int32_t iStride = sizeof(TEAPOT_VERTEX);\n int32_t iIndex = 0;\n TEAPOT_VERTEX* p = new TEAPOT_VERTEX[num_vertices_];\n for( int32_t i = 0; i < num_vertices_; ++i )\n {\n p[i].pos[0] = teapotPositions[iIndex];\n p[i].pos[1] = teapotPositions[iIndex + 1];\n p[i].pos[2] = teapotPositions[iIndex + 2];\n\n p[i].normal[0] = teapotNormals[iIndex];\n p[i].normal[1] = teapotNormals[iIndex + 1];\n p[i].normal[2] = teapotNormals[iIndex + 2];\n iIndex += 3;\n }\n glGenBuffers( 1, &vbo_ );\n glBindBuffer( GL_ARRAY_BUFFER, vbo_ );\n glBufferData( GL_ARRAY_BUFFER, iStride * num_vertices_, p, GL_STATIC_DRAW );\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\n\n delete[] p;\n\n UpdateViewport();\n mat_model_ = ndk_helper::Mat4::Translation( 0, 0, -15.f );\n\n ndk_helper::Mat4 mat = ndk_helper::Mat4::RotationX( M_PI / 3 );\n mat_model_ = mat * mat_model_;\n}\n\nvoid TeapotRenderer::UpdateViewport()\n{\n //Init Projection matrices\n int32_t viewport[4];\n glGetIntegerv( GL_VIEWPORT, viewport );\n float fAspect = (float) viewport[2] / (float) viewport[3];\n\n const float CAM_NEAR = 5.f;\n const float CAM_FAR = 10000.f;\n bool bRotate = false;\n mat_projection_ = ndk_helper::Mat4::Perspective( fAspect, 1.f, CAM_NEAR, CAM_FAR );\n}\n\nvoid TeapotRenderer::Unload()\n{\n if( vbo_ )\n {\n glDeleteBuffers( 1, &vbo_ );\n vbo_ = 0;\n }\n\n if( ibo_ )\n {\n glDeleteBuffers( 1, &ibo_ );\n ibo_ = 0;\n }\n\n if( shader_param_.program_ )\n {\n glDeleteProgram( shader_param_.program_ );\n shader_param_.program_ = 0;\n }\n}\n\nvoid TeapotRenderer::Update( float fTime )\n{\n const float CAM_X = 0.f;\n const float CAM_Y = 0.f;\n const float CAM_Z = 700.f;\n\n mat_view_ = ndk_helper::Mat4::LookAt( ndk_helper::Vec3( CAM_X, CAM_Y, CAM_Z ),\n ndk_helper::Vec3( 0.f, 0.f, 0.f ), ndk_helper::Vec3( 0.f, 1.f, 0.f ) );\n\n if( camera_ )\n {\n camera_->Update();\n mat_view_ = camera_->GetTransformMatrix() * mat_view_\n * camera_->GetRotationMatrix() * mat_model_;\n }\n else\n {\n mat_view_ = mat_view_ * mat_model_;\n }\n}\n\nvoid TeapotRenderer::Render()\n{\n //\n // Feed Projection and Model View matrices to the shaders\n ndk_helper::Mat4 mat_vp = mat_projection_ * mat_view_;\n\n // Bind the VBO\n glBindBuffer( GL_ARRAY_BUFFER, vbo_ );\n\n int32_t iStride = sizeof(TEAPOT_VERTEX);\n // Pass the vertex data\n glVertexAttribPointer( ATTRIB_VERTEX, 3, GL_FLOAT, GL_FALSE, iStride,\n BUFFER_OFFSET( 0 ) );\n glEnableVertexAttribArray( ATTRIB_VERTEX );\n\n glVertexAttribPointer( ATTRIB_NORMAL, 3, GL_FLOAT, GL_FALSE, iStride,\n BUFFER_OFFSET( 3 * sizeof(GLfloat) ) );\n glEnableVertexAttribArray( ATTRIB_NORMAL );\n\n // Bind the IB\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, ibo_ );\n\n glUseProgram( shader_param_.program_ );\n\n TEAPOT_MATERIALS material = { { 1.0f, 0.5f, 0.5f }, { 1.0f, 1.0f, 1.0f, 10.f }, {\n 0.1f, 0.1f, 0.1f }, };\n\n //Update uniforms\n glUniform4f( shader_param_.material_diffuse_, material.diffuse_color[0],\n material.diffuse_color[1], material.diffuse_color[2], 1.f );\n\n glUniform4f( shader_param_.material_specular_, material.specular_color[0],\n material.specular_color[1], material.specular_color[2],\n material.specular_color[3] );\n //\n //using glUniform3fv here was troublesome\n //\n glUniform3f( shader_param_.material_ambient_, material.ambient_color[0],\n material.ambient_color[1], material.ambient_color[2] );\n\n glUniformMatrix4fv( shader_param_.matrix_projection_, 1, GL_FALSE, mat_vp.Ptr() );\n glUniformMatrix4fv( shader_param_.matrix_view_, 1, GL_FALSE, mat_view_.Ptr() );\n glUniform3f( shader_param_.light0_, 100.f, -200.f, -600.f );\n\n glDrawElements( GL_TRIANGLES, num_indices_, GL_UNSIGNED_SHORT, BUFFER_OFFSET(0) );\n\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, 0 );\n}\n\nbool TeapotRenderer::LoadShaders( SHADER_PARAMS* params,\n const char* strVsh,\n const char* strFsh )\n{\n GLuint program;\n GLuint vert_shader, frag_shader;\n char *vert_shader_pathname, *frag_shader_pathname;\n\n // Create shader program\n program = glCreateProgram();\n LOGI( \"Created Shader %d\", program );\n\n // Create and compile vertex shader\n if( !ndk_helper::shader::CompileShader( &vert_shader, GL_VERTEX_SHADER, strVsh ) )\n {\n LOGI( \"Failed to compile vertex shader\" );\n glDeleteProgram( program );\n return false;\n }\n\n // Create and compile fragment shader\n if( !ndk_helper::shader::CompileShader( &frag_shader, GL_FRAGMENT_SHADER, strFsh ) )\n {\n LOGI( \"Failed to compile fragment shader\" );\n glDeleteProgram( program );\n return false;\n }\n\n // Attach vertex shader to program\n glAttachShader( program, vert_shader );\n\n // Attach fragment shader to program\n glAttachShader( program, frag_shader );\n\n // Bind attribute locations\n // this needs to be done prior to linking\n glBindAttribLocation( program, ATTRIB_VERTEX, \"myVertex\" );\n glBindAttribLocation( program, ATTRIB_NORMAL, \"myNormal\" );\n glBindAttribLocation( program, ATTRIB_UV, \"myUV\" );\n\n // Link program\n if( !ndk_helper::shader::LinkProgram( program ) )\n {\n LOGI( \"Failed to link program: %d\", program );\n\n if( vert_shader )\n {\n glDeleteShader( vert_shader );\n vert_shader = 0;\n }\n if( frag_shader )\n {\n glDeleteShader( frag_shader );\n frag_shader = 0;\n }\n if( program )\n {\n glDeleteProgram( program );\n }\n\n return false;\n }\n\n // Get uniform locations\n params->matrix_projection_ = glGetUniformLocation( program, \"uPMatrix\" );\n params->matrix_view_ = glGetUniformLocation( program, \"uMVMatrix\" );\n\n params->light0_ = glGetUniformLocation( program, \"vLight0\" );\n params->material_diffuse_ = glGetUniformLocation( program, \"vMaterialDiffuse\" );\n params->material_ambient_ = glGetUniformLocation( program, \"vMaterialAmbient\" );\n params->material_specular_ = glGetUniformLocation( program, \"vMaterialSpecular\" );\n\n // Release vertex and fragment shaders\n if( vert_shader )\n glDeleteShader( vert_shader );\n if( frag_shader )\n glDeleteShader( frag_shader );\n\n params->program_ = program;\n return true;\n}\n\nbool TeapotRenderer::Bind( ndk_helper::TapCamera* camera )\n{\n camera_ = camera;\n return true;\n}\n\n" }, { "path": "tests/inputs/demo.odin", "content": "// portion of https://github.com/odin-lang/Odin/raw/master/examples/demo/demo.odin\npackage main\n\nimport \"core:fmt\"\nimport \"core:mem\"\nimport \"core:os\"\n\n\n/*\n\tThe Odin programming language is fast, concise, readable, pragmatic and open sourced.\n\tIt is designed with the intent of replacing C with the following goals:\n\t * simplicity\n\t * high performance\n\t * built for modern systems\n\t * joy of programming\n\n*/\n\nthe_basics :: proc() {\n\tfmt.println(\"\\n# the basics\");\n\n\t{ // The Basics\n\t\tfmt.println(\"Hellope\");\n\n\t\t// Lexical elements and literals\n\t\t// A comment\n\n\t\tmy_integer_variable: int; // A comment for documentaton\n\n\t\t// Multi-line comments begin with /* and end with */. Multi-line comments can\n\t\t// also be nested (unlike in C):\n\t\t/*\n\t\t\tYou can have any text or code here and\n\t\t\thave it be commented.\n\t\t*/\n\n\t\t// Note: `:=` is two tokens, `:` and `=`. The following are equivalent,\n\t\t/*\n\t\t\ti: int = 123;\n\t\t\ti: = 123;\n\t\t\ti := 123;\n\t\t*/\n\n\t\t_ = my_integer_variable;\n\t\t_ = x;\n\t}\n}\n\ncontrol_flow :: proc() {\n\tfmt.println(\"\\n# control flow\");\n\t{ // Control flow\n\t\t// For loop\n\t\t// Odin has only one loop statement, the `for` loop\n\n\t\t// Basic for loop\n\t\tfor i := 0; i < 10; i += 1 {\n\t\t\tfmt.println(i);\n\t\t}\n\n\t\t// NOTE: Unlike other languages like C, there are no parentheses `( )` surrounding the three components.\n\t\t// Braces `{ }` or a `do` are always required>\n\t\tfor i := 0; i < 10; i += 1 { }\n\t\tfor i := 0; i < 10; i += 1 do fmt.print();\n\n\t\t// The initial and post statements are optional\n\t\ti := 0;\n\t\tfor ; i < 10; {\n\t\t\ti += 1;\n\t\t}\n\n\t\t// You can defer an entire block too:\n\t\t{\n\t\t\tbar :: proc() {}\n\n\t\t\tdefer {\n\t\t\t\tfmt.println(\"1\");\n\t\t\t\tfmt.println(\"2\");\n\t\t\t}\n\n\t\t\tcond := false;\n\t\t\tdefer if cond {\n\t\t\t\tbar();\n\t\t\t}\n\t\t}\n\n\t\t// Defer statements are executed in the reverse order that they were declared:\n\t\t{\n\t\t\tdefer fmt.println(\"1\");\n\t\t\tdefer fmt.println(\"2\");\n\t\t\tdefer fmt.println(\"3\");\n\t\t}\n\t\t// Will print 3, 2, and then 1.\n\n\t\tif false {\n\t\t\tf, err := os.open(\"my_file.txt\");\n\t\t\tif err != 0 {\n\t\t\t\t// handle error\n\t\t\t}\n\t\t\tdefer os.close(f);\n\t\t\t// rest of code\n\t\t}\n\t}\n\n\t{ // When statement\n\t\t/*\n\t\t\tThe when statement is almost identical to the if statement but with some differences:\n\n\t\t\t* Each condition must be a constant expression as a when\n\t\t\t statement is evaluated at compile time.\n\t\t\t* The statements within a branch do not create a new scope\n\t\t\t* The compiler checks the semantics and code only for statements\n\t\t\t that belong to the first condition that is true\n\t\t\t* An initial statement is not allowed in a when statement\n\t\t\t* when statements are allowed at file scope\n\t\t*/\n\n\t\t// Example\n\t\twhen ODIN_ARCH == \"386\" {\n\t\t\tfmt.println(\"32 bit\");\n\t\t} else when ODIN_ARCH == \"amd64\" {\n\t\t\tfmt.println(\"64 bit\");\n\t\t} else {\n\t\t\tfmt.println(\"Unsupported architecture\");\n\t\t}\n\t\t// The when statement is very useful for writing platform specific code.\n\t\t// This is akin to the #if construct in C’s preprocessor however, in Odin,\n\t\t// it is type checked.\n\t}\n\n\t{ // Branch statements\n\t\tcond, cond1, cond2 := false, false, false;\n\t\tone_step :: proc() { fmt.println(\"one_step\"); }\n\t\tbeyond :: proc() { fmt.println(\"beyond\"); }\n\n\t\t// Break statement\n\t\tfor cond {\n\t\t\tswitch {\n\t\t\tcase:\n\t\t\t\tif cond {\n\t\t\t\t\tbreak; // break out of the `switch` statement\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbreak; // break out of the `for` statement\n\t\t}\n\n\t\tloop: for cond1 {\n\t\t\tfor cond2 {\n\t\t\t\tbreak loop; // leaves both loops\n\t\t\t}\n\t\t}\n\n\t\t// Continue statement\n\t\tfor cond {\n\t\t\tif cond2 {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfmt.println(\"Hellope\");\n\t\t}\n\n\t\t// Fallthrough statement\n\n\t\t// Odin’s switch is like one in C or C++, except that Odin only runs the selected\n\t\t// case. This means that a break statement is not needed at the end of each case.\n\t\t// Another important difference is that the case values need not be integers nor\n\t\t// constants.\n\n\t\t// fallthrough can be used to explicitly fall through into the next case block:\n\n\t\tswitch i := 0; i {\n\t\tcase 0:\n\t\t\tone_step();\n\t\t\tfallthrough;\n\t\tcase 1:\n\t\t\tbeyond();\n\t\t}\n\t}\n}\n" }, { "path": "tests/inputs/dev.exs", "content": "/*\n https://github.com/qhwa/bonfire/blob/master/config/dev.exs\n*/\nuse Mix.Config\n\nconfig :bonfire, Bonfire.EventStore,\n serializer: Commanded.Serialization.JsonSerializer,\n username: \"postgres\",\n password: \"postgres\",\n database: \"bonfire_eventstore_dev\",\n hostname: \"localhost\",\n pool_size: 10\n\n# Configure your database\nconfig :bonfire, Bonfire.Repo,\n username: \"postgres\",\n password: \"postgres\",\n database: \"bonfire_dev\",\n hostname: \"localhost\",\n pool_size: 10\n\n# For development, we disable any cache and enable\n# debugging and code reloading.\n#\n# The watchers configuration can be used to run external\n# watchers to your application. For example, we use it\n# with webpack to recompile .js and .css sources.\nconfig :bonfire, BonfireWeb.Endpoint,\n http: [port: 4000],\n debug_errors: true,\n code_reloader: true,\n check_origin: false,\n watchers: [\n node: [\n \"node_modules/webpack/bin/webpack.js\",\n \"--mode\",\n \"development\",\n \"--watch-stdin\",\n cd: Path.expand(\"../assets\", __DIR__)\n ]\n ]\n\n# ## SSL Support\n#\n# In order to use HTTPS in development, a self-signed\n# certificate can be generated by running the following\n# Mix task:\n#\n# mix phx.gen.cert\n#\n# Note that this task requires Erlang/OTP 20 or later.\n# Run `mix help phx.gen.cert` for more information.\n#\n# The `http:` config above can be replaced with:\n#\n# https: [\n# port: 4001,\n# cipher_suite: :strong,\n# keyfile: \"priv/cert/selfsigned_key.pem\",\n# certfile: \"priv/cert/selfsigned.pem\"\n# ],\n#\n# If desired, both `http:` and `https:` keys can be\n# configured to run both http and https servers on\n# different ports.\n\n# Watch static and templates for browser reloading.\nconfig :bonfire, BonfireWeb.Endpoint,\n live_reload: [\n patterns: [\n ~r\"priv/static/.*(js|css|png|jpeg|jpg|gif|svg)$\",\n ~r\"priv/gettext/.*(po)$\",\n ~r\"lib/bonfire_web/(live|views)/.*(ex)$\",\n ~r\"lib/bonfire_web/templates/.*(eex)$\"\n ]\n ]\n\n# Do not include metadata nor timestamps in development logs\nconfig :logger, :console, format: \"[$level] $message\\n\"\n\n# Set a higher stacktrace during development. Avoid configuring such\n# in production as building large stacktraces may be expensive.\nconfig :phoenix, :stacktrace_depth, 20\n\n# Initialize plugs at runtime for faster development compilation\nconfig :phoenix, :plug_init_mode, :runtime\n" }, { "path": "tests/inputs/diff/A/d1/hello.f90", "content": "! Hello World\nprogram hello\n implicit none\n print '(\"Hello, World!\")'\n print '(\"line 2\")'\nend program hello\n!hpf$ not a comment\n!omp$ not a comment either\n" }, { "path": "tests/inputs/diff/A/d2/hello.java", "content": "/* hello.java */\nimport java.io.*;\nclass Hi {\n static public void main( String args[] ) {\n System.out.println( \"another line\" );\n System.out.println( \"Hello World!\" ); /*\n insert comment here\n */\n }\n /* inline */\n}\n" }, { "path": "tests/inputs/diff/A/d2/hi.py", "content": "#/usr/bin/env python\n\n# pound comment\n\nimport time\nprint('Hello. The time is %f Unix epoch.' % (time.time())) # inline comment\nprint(f'f-string')\n\n\"\"\"\nDocstring,\n also counted as comment.\n\"\"\"\n\n'''\nSingle\n Quoted\n Docstring'''\n" }, { "path": "tests/inputs/diff/A/hello.C", "content": "// hello.C\n#include \nint main ()\n{\n std::cout << \"hello\" << std::endl; // comment 1\n std::cout << \"again\" << std::endl; /* comment\n 2 */\n}\n" }, { "path": "tests/inputs/diff/B/d1/hello.f90", "content": "! Hello World\nprogram hello\n implicit none\n print '(\"Hello, World!\")'\nend program hello\n!hpf$ not a comment\n!omp$ not a comment either\nc old style comment\n" }, { "path": "tests/inputs/diff/B/d2/hi.py", "content": "#/usr/bin/env python\n\n# pound comment\n\nimport time\nprint('Hello. The time is %f Unix epoch.' % (time.time())) # inline comment\nprint(f'f-string')\n\n\"\"\"\nDocstring,\n also counted as comment.\n\"\"\"\n\n'''\nSingle\n Quoted\n Docstring'''\n" }, { "path": "tests/inputs/diff/B/extra_file.pl", "content": "#!/usr/bin/perl\nprint \"extra\\n\";\n" }, { "path": "tests/inputs/diff/B/hello.C", "content": "// hello.C -- stuff\n#include \nint main ()\n{\n std::cout << \"hello\" << std::endl; // comment 1\n std::cout << \"again\" << std::endl; /* comment\n 2 */\n}\n" }, { "path": "tests/inputs/dlist.lean", "content": "-- https://github.com/leanprover/lean/raw/master/library/data/dlist.lean\n/-\nCopyright (c) 2017 Microsoft Corporation. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\nAuthor: Leonardo de Moura\n-/\nuniverses u\n/--\nA difference list is a function that, given a list, returns the original\ncontents of the difference list prepended to the given list.\n\nThis structure supports `O(1)` `append` and `concat` operations on lists, making it\nuseful for append-heavy uses such as logging and pretty printing.\n-/\nstructure dlist (α : Type u) :=\n(apply : list α → list α)\n(invariant : ∀ l, apply l = apply [] ++ l)\n\nnamespace dlist\nopen function\nvariables {α : Type u}\n\nlocal notation `♯`:max := by abstract {intros, rsimp}\n\n/-- Convert a list to a dlist -/\ndef of_list (l : list α) : dlist α :=\n⟨append l, ♯⟩\n\n/-- Convert a lazily-evaluated list to a dlist -/\ndef lazy_of_list (l : thunk (list α)) : dlist α :=\n⟨λ xs, l () ++ xs, ♯⟩\n\n/-- Convert a dlist to a list -/\ndef to_list : dlist α → list α\n| ⟨xs, _⟩ := xs []\n\n/-- Create a dlist containing no elements -/\ndef empty : dlist α :=\n⟨id, ♯⟩\n\nlocal notation a `::_`:max := list.cons a\n\n/-- Create dlist with a single element -/\ndef singleton (x : α) : dlist α :=\n⟨x::_, ♯⟩\n\nlocal attribute [simp] function.comp\n\n/-- `O(1)` Prepend a single element to a dlist -/\ndef cons (x : α) : dlist α → dlist α\n| ⟨xs, h⟩ := ⟨x::_ ∘ xs, ♯⟩\n\n/-- `O(1)` Append a single element to a dlist -/\ndef concat (x : α) : dlist α → dlist α\n| ⟨xs, h⟩ := ⟨xs ∘ x::_, ♯⟩\n\n/-- `O(1)` Append dlists -/\nprotected def append : dlist α → dlist α → dlist α\n| ⟨xs, h₁⟩ ⟨ys, h₂⟩ := ⟨xs ∘ ys, ♯⟩\n\ninstance : has_append (dlist α) :=\n⟨dlist.append⟩\n\nlocal attribute [simp] of_list to_list empty singleton cons concat dlist.append\n\nlemma to_list_of_list (l : list α) : to_list (of_list l) = l :=\nby cases l; simp\n\nlemma of_list_to_list (l : dlist α) : of_list (to_list l) = l :=\nbegin\n cases l with xs,\n have h : append (xs []) = xs,\n { intros, funext x, simp [l_invariant x] },\n simp [h]\nend\n\nlemma to_list_empty : to_list (@empty α) = [] :=\nby simp\n\nlemma to_list_singleton (x : α) : to_list (singleton x) = [x] :=\nby simp\n\nlemma to_list_append (l₁ l₂ : dlist α) : to_list (l₁ ++ l₂) = to_list l₁ ++ to_list l₂ :=\nshow to_list (dlist.append l₁ l₂) = to_list l₁ ++ to_list l₂, from\nby cases l₁; cases l₂; simp; rsimp\n\nlemma to_list_cons (x : α) (l : dlist α) : to_list (cons x l) = x :: to_list l :=\nby cases l; rsimp\n\nlemma to_list_concat (x : α) (l : dlist α) : to_list (concat x l) = to_list l ++ [x] :=\nby cases l; simp; rsimp\n\nsection transfer\n\nprotected def rel_dlist_list (d : dlist α) (l : list α) : Prop :=\nto_list d = l\n\ninstance bi_total_rel_dlist_list : @relator.bi_total (dlist α) (list α) dlist.rel_dlist_list :=\n⟨assume d, ⟨to_list d, rfl⟩, assume l, ⟨of_list l, to_list_of_list l⟩⟩\n\nprotected lemma rel_eq :\n (dlist.rel_dlist_list ⇒ dlist.rel_dlist_list ⇒ iff) (@eq (dlist α)) eq\n| l₁ ._ rfl l₂ ._ rfl := ⟨congr_arg to_list,\n assume : to_list l₁ = to_list l₂,\n have of_list (to_list l₁) = of_list (to_list l₂), from congr_arg of_list this,\n by simp [of_list_to_list] at this; assumption⟩\n\nprotected lemma rel_empty : dlist.rel_dlist_list (@empty α) [] :=\nto_list_empty\n\nprotected lemma rel_singleton : (@eq α ⇒ dlist.rel_dlist_list) (λx, singleton x) (λx, [x])\n| ._ x rfl := to_list_singleton x\n\nprotected lemma rel_append :\n (dlist.rel_dlist_list ⇒ dlist.rel_dlist_list ⇒ dlist.rel_dlist_list) (λ(x y : dlist α), x ++ y) (λx y, x ++ y)\n| l₁ ._ rfl l₂ ._ rfl := to_list_append l₁ l₂\n\nprotected lemma rel_cons :\n (@eq α ⇒ dlist.rel_dlist_list ⇒ dlist.rel_dlist_list) cons (λx y, x :: y)\n| x ._ rfl l ._ rfl := to_list_cons x l\n\nprotected lemma rel_concat :\n (@eq α ⇒ dlist.rel_dlist_list ⇒ dlist.rel_dlist_list) concat (λx y, y ++ [x])\n| x ._ rfl l ._ rfl := to_list_concat x l\n\nprotected meta def transfer : tactic unit := do\n _root_.transfer.transfer [`relator.rel_forall_of_total, `dlist.rel_eq, `dlist.rel_empty,\n `dlist.rel_singleton, `dlist.rel_append, `dlist.rel_cons, `dlist.rel_concat]\n\nexample : ∀(a b c : dlist α), a ++ (b ++ c) = (a ++ b) ++ c :=\nbegin\n dlist.transfer,\n intros,\n simp\nend\n\nexample : ∀(a : α), singleton a ++ empty = singleton a :=\nbegin\n dlist.transfer,\n intros,\n simp\nend\n\nend transfer\n\nend dlist\n" }, { "path": "tests/inputs/door.tres", "content": "; https://github.com/godotengine/tps-demo/raw/master/door/model/door.tres\n[gd_resource type=\"SpatialMaterial\" load_steps=5 format=2]\n\n[ext_resource path=\"res://door/textures/door_orm.png\" type=\"Texture\" id=1]\n[ext_resource path=\"res://door/textures/door_emission.png\" type=\"Texture\" id=2]\n[ext_resource path=\"res://door/textures/door_normal.png\" type=\"Texture\" id=3]\n[ext_resource path=\"res://door/textures/door_albedo.png\" type=\"Texture\" id=4]\n\n[resource]\nresource_name = \"door\"\nalbedo_texture = ExtResource( 4 )\n ; metallic = 1.0\n ; metallic_texture = ExtResource( 1 )\n ; metallic_texture_channel = 2\n ; roughness_texture = ExtResource( 1 )\n ; roughness_texture_channel = 1\n ; emission_enabled = true\n ; emission = Color( 0, 0, 0, 1 )\nemission_energy = 3.0\nemission_operator = 0\nemission_on_uv2 = false\nemission_texture = ExtResource( 2 )\nnormal_enabled = true\nnormal_scale = 1.0\nnormal_texture = ExtResource( 3 )\nao_enabled = true\nao_light_affect = 0.0\nao_texture = ExtResource( 1 )\nao_on_uv2 = false\nao_texture_channel = 0\n" }, { "path": "tests/inputs/dotNET_intermediate.il", "content": "// This is .NET Intermediate Language\n// Licensed to the .NET Foundation under one or more agreements.\n// The .NET Foundation licenses this file to you under the MIT license.\n\n.assembly extern System.Console\n{\n .publickeytoken = (B0 3F 5F 7F 11 D5 0A 3A )\n .ver 4:0:0:0\n}\n.assembly extern mscorlib { }\n.assembly 'devdiv_815942_' {}\n.assembly extern xunit.core {}\n\n.class public Repro\n{\n .method public static int32 Main() cil managed\n {\n .custom instance void [xunit.core]Xunit.FactAttribute::.ctor() = (\n 01 00 00 00\n )\n // This testcase ensures that we correctly compare a double local\n // against a float const by converting the float const to double\n // instead of converting the local to float and losing precision\n \n .entrypoint\n .locals init (float64 V_1)\n ldc.i4.1\n conv.i8\n call float64 [mscorlib]System.BitConverter::Int64BitsToDouble(int64)\n conv.r8\n stloc.0\n ldloc.0\n ldc.r4 0.0\n bne.un.s PASS\n ldstr \"FAIL!\"\n call void [System.Console]System.Console::WriteLine(string)\n ldloc.0\n call void [System.Console]System.Console::WriteLine(float64)\n ldc.i4.s 101\n ret\nPASS:\n ldstr \"PASS!\"\n call void [System.Console]System.Console::WriteLine(string)\n ldc.i4.s 100\n ret\n }\n}\n" }, { "path": "tests/inputs/double_doors.dsc", "content": "doubledoors_world:\r\n type: world\r\n debug: false\r\n events:\r\n # Use monitor to allow the event to be cancelled by any other scripts or plugins\r\n # But use 'on' to make the door move as immediately as possible\r\n on player right clicks *_door bukkit_priority:monitor:\r\n # Iron doors aren't opened on click\r\n - if == iron_door:\r\n - stop\r\n - define face \r\n # A door faces outward, rotate the outward face opposite the direction of the hinge to get the other door\r\n - if == left:\r\n # Note: pi/2 is radian equivalent of 90 degrees.\r\n - define face <[face].rotate_around_y[-]>\r\n - else:\r\n - define face <[face].rotate_around_y[]>\r\n - define door2 ]>\r\n # Check that the double door *exists*\r\n - if <[door2].material.name> == :\r\n - switch <[door2]>" }, { "path": "tests/inputs/drools.drl", "content": "// https://github.com/AlDanial/cloc/issues/172\n\n/*\n * Copyright 2010 Red Hat, Inc. and/or its affiliates.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.drools.examples.fibonacci\n\nimport org.drools.examples.fibonacci.FibonacciExample.Fibonacci;\n\ndialect \"mvel\"\n\nrule Recurse\n salience 10\n when\n f : Fibonacci ( value == -1 )\n not ( Fibonacci ( sequence == 1 ) ) \n then\n insert( new Fibonacci( f.sequence - 1 ) );\n System.out.println( \"recurse for \" + f.sequence );\nend\n\nrule Bootstrap\n when\n f : Fibonacci( sequence == 1 || == 2, value == -1 ) // this is a multi-restriction || on a single field\n then \n modify ( f ){ value = 1 };\n System.out.println( f.sequence + \" == \" + f.value );\nend\n\nrule Calculate\n when\n f1 : Fibonacci( s1 : sequence, value != -1 ) // here we bind sequence\n f2 : Fibonacci( sequence == (s1 + 1 ), value != -1 ) // here we don't, just to demonstrate the different way bindings can be used\n f3 : Fibonacci( s3 : sequence == (f2.sequence + 1 ), value == -1 ) \n then \n modify ( f3 ) { value = f1.value + f2.value };\n System.out.println( s3 + \" == \" + f3.value ); // see how you can access pattern and field bindings\nend\n" }, { "path": "tests/inputs/drupal.mxml", "content": "\n\n \n import mx.controls.*;\n import mx.rpc.events.*;\n import mx.utils.ArrayUtil;\n\n [Bindable]\n public var recipes:Array;\n\n public function init():void\n {\n getRecipes();\n }\n /*\n this is a C Comment\n */\n\n public function onFault(event:FaultEvent):void\n {\n Alert.show(event.fault.faultString, \"Error\");\n }\n\n public function onViewsResult(event:ResultEvent):void\n {\n recipes = ArrayUtil.toArray(event.result);\n }\n\n public function getRecipes():void\n {\n views.getView(\"recipes_all\", ['nid','title','body','changed']);\n }\n\n public function saveRecipe():void\n {\n var edit:Object;\n if (recipes_select.selectedItem) {\n edit = recipes_select.selectedItem;\n }\n else {\n edit = new Object;\n }\n\n edit.type = \"recipe\";\n\n edit.title = dish.text;\n edit.body = recipe.text;\n\n if (edit.title == \"\" || edit.body == \"\") {\n Alert.show(\"Enter some content\", \"Error\");\n }\n\n node.save(edit);\n getRecipes();\n }\n\n public function onSaved(event:ResultEvent):void\n {\n Alert.show(\"Recipe was saved\", \"Saved\");\n }\n\n public function newRecipe():void\n {\n recipes_select.selectedItem = undefined;\n\n dish.text = \"\";\n recipe.text = \"\";\n }\n \n\n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n\n \n\n \n \n\n \n\n \n\n \n\n \n\n \n\n" }, { "path": "tests/inputs/eddsa.circom", "content": "// https://raw.githubusercontent.com/iden3/circomlib/master/circuits/eddsa.circom\n/*\n Copyright 2018 0KIMS association.\n\n This file is part of circom (Zero Knowledge Circuit Compiler).\n\n circom is a free software: you can redistribute it and/or modify it\n under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n circom is distributed in the hope that it will be useful, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY\n or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public\n License for more details.\n\n You should have received a copy of the GNU General Public License\n along with circom. If not, see .\n*/\npragma circom 2.0.0;\n\ninclude \"compconstant.circom\";\ninclude \"pointbits.circom\";\ninclude \"pedersen.circom\";\ninclude \"escalarmulany.circom\";\ninclude \"escalarmulfix.circom\";\n\ntemplate EdDSAVerifier(n) {\n signal input msg[n];\n\n signal input A[256];\n signal input R8[256];\n signal input S[256];\n\n signal Ax;\n signal Ay;\n\n signal R8x;\n signal R8y;\n\n var i;\n\n// Ensure S compConstant.in[i];\n }\n compConstant.out === 0;\n S[254] === 0;\n S[255] === 0;\n\n// Convert A to Field elements (And verify A)\n\n component bits2pointA = Bits2Point_Strict();\n\n for (i=0; i<256; i++) {\n bits2pointA.in[i] <== A[i];\n }\n Ax <== bits2pointA.out[0];\n Ay <== bits2pointA.out[1];\n\n// Convert R8 to Field elements (And verify R8)\n\n component bits2pointR8 = Bits2Point_Strict();\n\n for (i=0; i<256; i++) {\n bits2pointR8.in[i] <== R8[i];\n }\n R8x <== bits2pointR8.out[0];\n R8y <== bits2pointR8.out[1];\n\n// Calculate the h = H(R,A, msg)\n\n component hash = Pedersen(512+n);\n\n for (i=0; i<256; i++) {\n hash.in[i] <== R8[i];\n hash.in[256+i] <== A[i];\n }\n for (i=0; i, 2013-2014\n# Michael Findlay , 2016\nmsgid \"\"\nmsgstr \"\"\n\"Project-Id-Version: Xfce Apps\\n\"\n\"Report-Msgid-Bugs-To: \\n\"\n\"POT-Creation-Date: 2016-06-19 06:31+0200\\n\"\n\"PO-Revision-Date: 2016-06-21 08:54+0000\\n\"\n\"Last-Translator: Michael Findlay \\n\"\n\"Language-Team: English (Australia) (http://www.transifex.com/xfce/xfce-apps/language/en_AU/)\\n\"\n\"MIME-Version: 1.0\\n\"\n\"Content-Type: text/plain; charset=UTF-8\\n\"\n\"Content-Transfer-Encoding: 8bit\\n\"\n\"Language: en_AU\\n\"\n\"Plural-Forms: nplurals=2; plural=(n != 1);\\n\"\n\n#: ../colorschemes/black-on-white.theme.in.h:1\nmsgid \"Black on White\"\nmsgstr \"Black on White\"\n\n#: ../colorschemes/dark-pastels.theme.in.h:1\nmsgid \"Dark Pastels\"\nmsgstr \"Dark Pastels\"\n\n#: ../colorschemes/green-on-black.theme.in.h:1\nmsgid \"Green on Black\"\nmsgstr \"Green on Black\"\n\n#: ../terminal/main.c:147\n#, c-format\nmsgid \"See the %s man page for full explanation of the options above.\"\nmsgstr \"See the %s man page for full explanation of the options above.\"\n\n#: ../terminal/main.c:180 ../xfce4-terminal.desktop.in.h:1\nmsgid \"Xfce Terminal\"\nmsgstr \"Xfce Terminal\"\n\n#: ../terminal/main.c:196\nmsgid \"The Xfce development team. All rights reserved.\"\nmsgstr \"The Xfce development team. All rights reserved.\"\n\n#: ../terminal/main.c:197\nmsgid \"Written by Benedikt Meurer \"\nmsgstr \"Written by Benedikt Meurer \"\n\n#: ../terminal/main.c:198\nmsgid \"and Nick Schermer .\"\nmsgstr \"and Nick Schermer .\"\n\n#: ../terminal/main.c:199\n#, c-format\nmsgid \"Please report bugs to <%s>.\"\nmsgstr \"Please report bugs to <%s>.\"\n" }, { "path": "tests/inputs/example_2d.gdshader", "content": "// https://github.com/AlDanial/cloc/issues/641\nshader_type canvas_item;\n\nuniform float blue = 1.0; // you can assign a default value to uniforms\n\nvoid vertex() {\n // Animate Sprite moving in big circle around its location\n VERTEX += vec2(cos(TIME)*100.0, sin(TIME)*100.0);\n}\n\nvoid fragment(){\n // this shader will result in an more bluish sprite\n COLOR = texture(TEXTURE, UV); //read from texture\n COLOR.b = blue; //set blue channel to \n}\n" }, { "path": "tests/inputs/fib.dfy", "content": "/*\nhttps://dafny.org/latest/OnlineTutorial/guide\n*/\nfunction fib(n: nat): nat\n{\n if n == 0 then 0\n else if n == 1 then 1\n else fib(n - 1) + fib(n - 2)\n}\nmethod ComputeFib(n: nat) returns (b: nat)\n ensures b == fib(n) // Do not change this postcondition\n{\n // Change the method body to instead use c as described.\n // You will need to change both the initialization and the loop.\n if n == 0 { return 0; }\n var i: int := 1;\n var a := 0;\n b := 1;\n while i < n\n invariant 0 < i <= n\n invariant a == fib(i - 1)\n invariant b == fib(i)\n {\n a, b := b, a + b;\n i := i + 1;\n }\n}\n" }, { "path": "tests/inputs/fib_class.pkl", "content": "/* \n\nhttps://raw.githubusercontent.com/apple/pkl/refs/heads/main/bench/src/jmh/resources/org/pkl/core/fib_class.pkl\n*/ \n\n//===----------------------------------------------------------------------===//\n// Copyright © 2024 Apple Inc. and the Pkl project authors. All rights reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// https://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//===----------------------------------------------------------------------===//\n\nclass Fibonacci {\n function fib(n) = if (n < 2) n else fib(n - 1) + fib(n - 2)\n}\nresult = new Fibonacci {}.fib(35)\n" }, { "path": "tests/inputs/fibonacci.ncl", "content": "# https://raw.githubusercontent.com/tweag/nickel/master/examples/fibonacci/fibonacci.ncl\n# test = 'pass'\n\n# This is the naive, exponential version of fibonacci: don't call it on a big\n# value!\nlet rec fibonacci = fun n =>\n if n == 0 then\n 0\n else if n == 1 then\n 1\n else\n fibonacci (n - 1) + fibonacci (n - 2)\nin\nfibonacci 10\n" }, { "path": "tests/inputs/find.plm", "content": "/*\n https://en.wikipedia.org/wiki/PL/M\n*/\n FIND: PROCEDURE(PA,PB) BYTE;\n DECLARE (PA,PB) BYTE;\n /* FIND THE STRING IN SCRATCH STARTING AT PA AND ENDING AT PB */\n DECLARE J ADDRESS,\n (K, MATCH) BYTE;\n J = BACK ;\n MATCH = FALSE;\n DO WHILE NOT MATCH AND (MAXM > J);\n LAST,J = J + 1; /* START SCAN AT J */\n K = PA ; /* ATTEMPT STRING MATCH AT K */\n DO WHILE SCRATCH(K) = MEMORY(LAST) AND\n NOT (MATCH := K = PB);\n /* MATCHED ONE MORE CHARACTER */\n K = K + 1; LAST = LAST + 1;\n END;\n END;\n IF MATCH THEN /* MOVE STORAGE */\n DO; LAST = LAST - 1; CALL MOVER;\n END;\n RETURN MATCH;\n END FIND;\n\n" }, { "path": "tests/inputs/flatbuffers.fbs", "content": "\n/* Comment 1 */\ntable TestTable {\n\t// Comment 2\n Item: int32;\n}" }, { "path": "tests/inputs/fmt.ha", "content": "// License: MPL-2.0\n// (c) 2022 Alexey Yerin \n// (c) 2021 Andri Yngvason \n// (c) 2021-2022 Bor Grošelj Simić \n// (c) 2021 Byron Torres \n// (c) 2021 Drew DeVault \n// (c) 2021 Ember Sawady \nuse ascii;\nuse bufio;\nuse encoding::utf8;\nuse io;\n// https://git.sr.ht/~sircmpwn/hare/tree/master/item/fmt/fmt.ha\nuse math;\nuse os;\nuse strconv;\nuse strings;\nuse types;\n\n// Tagged union of the [[formattable]] types and [[modifiers]]. Used for\n// functions which accept format strings.\nexport type field = (...formattable | *modifiers);\n\n// Tagged union of all types which are formattable.\nexport type formattable = (...types::numeric | uintptr | str | rune | bool |\n\tnullable *void | void);\n\n// Formats text for printing and writes it to [[os::stdout]].\nexport fn printf(fmt: str, args: field...) (io::error | size) =\n\tfprintf(os::stdout, fmt, args...);\n\n// Formats text for printing and writes it to [[os::stdout]], followed by a line\n// feed.\nexport fn printfln(fmt: str, args: field...) (io::error | size) =\n\tfprintfln(os::stdout, fmt, args...);\n" }, { "path": "tests/inputs/foo_bar/bar/foo/momo/tbfm.sh", "content": "echo hello\n" }, { "path": "tests/inputs/foo_bar/foo/bar/lala/tfbl.sh", "content": "echo hi\n" }, { "path": "tests/inputs/fortran.inc", "content": "C https://en.wikibooks.org/wiki/Fortran/Fortran_examples\n! sum.f90\n! Performs summations using in a loop using EXIT statement\n! Saves input information and the summation in a data file\n\nprogram summation\n implicit none\n integer :: sum, a\n\n print *, \"This program performs summations. Enter 0 to stop.\"\n open (unit=10, file=\"SumData.DAT\")\n sum = 0\n do\n print *, \"Add:\"\n read *, a\n if (a == 0) then\n exit\n else\n sum = sum + a\n end if\n write (10,*) a\n end do\n\n print *, \"Summation =\", sum\n write (10,*) \"Summation =\", sum\n close(10)\nend\n\n" }, { "path": "tests/inputs/fractal.um", "content": "/*\n https://github.com/vtereshkov/umka-lang/raw/master/examples/fractal/fractal.um\n*/\n// Fractal demo in Umka (adapted from a Wren version by Robert Nystrom)\n\nfn main() {\n const (\n yMin = -0.2\n yMax = 0.1\n xMin = -1.5\n xMax = -1.1\n )\n\n for yPixel := 0; yPixel < 40; yPixel++ {\n y0 := (yPixel / 40.0) * (yMax - yMin) + yMin\n \n for xPixel := 0; xPixel < 79; xPixel++ {\n x0 := (xPixel / 78.0) * (xMax - xMin) + xMin\n x, y := x0, y0\n pixel := ' ' \n \n for iter := 0; iter < 80; iter++ {\n x, y = x * x - y * y + x0, 2 * x * y + y0\n\n // Stop if the point escaped\n if x * x + y * y > 4 {\n const pixels = \" .:;+=xX$&\"\n pixel = pixels[iter / 8]\n break\n }\n }\n\n printf(\"%c\", pixel)\n }\n\n printf(\"\\n\")\n }\n}\n" }, { "path": "tests/inputs/fsharp.fs", "content": "(* http://en.wikipedia.org/wiki/F_Sharp_%28programming_language%29 \n *)\n/// A very naive prime number detector\nlet isPrime (n:int) =\n let bound = int (sqrt (float n))\n seq {2 .. bound} |> Seq.forall (fun x -> n % x <> 0)\n \n// We are using async workflows\nlet primeAsync n =\n async { return (n, isPrime n) }\n \n/// Return primes between m and n using multiple threads\nlet primes m n =\n seq {m .. n}\n |> Seq.map primeAsync\n |> Async.Parallel\n |> Async.RunSynchronously\n |> Array.filter snd\n |> Array.map fst\n \n// Run a test\nprimes 1000000 1002000\n |> Array.iter (printfn \"%d\")\n" }, { "path": "tests/inputs/fsharp_script.fsx", "content": "// https://blogs.msdn.microsoft.com/chrsmith/2008/09/12/scripting-in-f/\n// Launches all .fs and .fsi files under the current folder in Notepad\nopen System\n\nallFilesUnder Environment.CurrentDirectory\n|> Seq.filter (function \n | EndsWith \".fs\" _\n | EndsWith \".fsi\" _\n -> true\n | _ -> false)\n|> Seq.iter (shellExecute \"Notepad.exe\")\n" }, { "path": "tests/inputs/functional.cj", "content": "/*\nhttps://github.com/Zxilly/playground-cj/blob/master/src/examples/functional.cj\n*/\npackage playground\n\n// 用给定的分隔符拆分字符串，支持多分隔符\nimport std.collection.*\n\n// 常规实现\nfunc split_normal(text: String, sep: String): ArrayList {\n let indices = ArrayList()\n var last = true\n for (i in 0..text.size) {\n let current = sep.indexOf(text[i]).isSome()\n if (last != current) {\n indices.add(i)\n }\n last = current\n }\n if (!last) {\n indices.add(text.size)\n }\n\n let result = ArrayList()\n for (i in 0..indices.size : 2) {\n result.add(text[indices[i]..indices[i + 1]])\n }\n return result\n}\n\n// 函数式编程实现\nfunc split(text: String, sep: String): ArrayList {\n let indices = ArrayList()\n text |> enumerate |>\n fold(false) {\n state, e =>\n let current = sep.indexOf(e[1]).isNone()\n if (state != current) {\n indices.add(e[0])\n }\n current\n } |> {\n valid: Bool => if (valid) {\n indices.add(text.size)\n }\n }\n\n let result = ArrayList()\n for (i in 0..indices.size : 2) {\n result.add(text[indices[i]..indices[i + 1]])\n }\n return result\n}\n\nmain() {\n let text = \"123, 456 7&89, , 96^3, 567\"\n let separator = \"&^, \"\n println(split_normal(text, separator))\n println(split(text, separator))\n}\n" }, { "path": "tests/inputs/futhark.fut", "content": "-- ISC License\n--\n-- Copyright (c) 2013-2018. DIKU, University of Copenhagen\n--\n-- Permission to use, copy, modify, and/or distribute this software for\n-- any purpose with or without fee is hereby granted, provided that the\n-- above copyright notice and this permission notice appear in all\n-- copies.\n--\n-- THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL\n-- WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED\n-- WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE\n-- AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\n-- DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\n-- PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n-- TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\n-- PERFORMANCE OF THIS SOFTWARE.\n--\n-- | The default prelude that is implicitly available in all Futhark\n-- files.\n\nopen import \"soacs\"\nopen import \"array\"\nopen import \"math\"\nopen import \"functional\"\nopen import \"ad\"\n\n-- | Create single-precision float from integer.\ndef r32 (x: i32): f32 = f32.i32 x\n-- | Create integer from single-precision float.\ndef t32 (x: f32): i32 = i32.f32 x\n\n-- | Create double-precision float from integer.\ndef r64 (x: i32): f64 = f64.i32 x\n-- | Create integer from double-precision float.\ndef t64 (x: f64): i32 = i32.f64 x\n\n-- | Negate a boolean. `not x` is the same as `!x`. This function is\n-- mostly useful for passing to `map`.\ndef not (x: bool): bool = !x\n\n-- | Semantically just identity, but serves as an optimisation\n-- inhibitor. The compiler will treat this function as a black box.\n-- You can use this to work around optimisation deficiencies (or\n-- bugs), although it should hopefully rarely be necessary.\n-- Deprecated: use `#[opaque]` attribute instead.\ndef opaque 't (x: t): t =\n #[opaque] x\n\n-- | Semantically just identity, but at runtime, the argument value\n-- will be printed. Deprecated: use `#[trace]` attribute instead.\ndef trace 't (x: t): t =\n #[trace(trace)] x\n\n-- | Semantically just identity, but acts as a break point in\n-- `futhark repl`. Deprecated: use `#[break]` attribute instead.\ndef break 't (x: t): t =\n #[break] x\n" }, { "path": "tests/inputs/generate.fnl", "content": "; https://github.com/bakpakin/Fennel/raw/master/generate.fnl\n\n;; A general-purpose function for generating random values.\n\n(var generate nil)\n\n(local random-char\n (fn []\n (if (> (math.random) 0.9)\n (string.char (+ 48 (math.random 10)))\n (> (math.random) 0.5) ; an in-line comment\n (string.char (+ 97 (math.random 26)))\n (> (math.random) 0.5)\n (string.char (+ 65 (math.random 26)))\n (> (math.random) 0.5)\n (string.char (+ 32 (math.random 11)))\n (> (math.random) 0.5)\n (string.char (+ 45 (math.random 2)))\n :else\n (string.char (+ 58 (math.random 5))))))\n\n(local generators {:number (fn [] ; weighted towards mid-range integers\n (if (> (math.random) 0.9)\n (let [x (math.random 2147483647)]\n (math.floor (- x (/ x 2))))\n (> (math.random) 0.2)\n (math.floor (math.random 2048))\n :else (math.random)))\n :string (fn []\n (var s \"\")\n (for [_ 1 (math.random 16)]\n (set s (.. s (random-char))))\n s)\n :table (fn [table-chance]\n (let [t {}]\n (var k nil)\n (for [_ 1 (math.random 16)]\n ;; no nans plz\n (set k (generate 0.9))\n (while (~= k k) (set k (generate 0.9)))\n (tset t k (generate (* table-chance 1.5))))\n t))\n :boolean (fn [] (> (math.random) 0.5))})\n\n(set generate\n (fn [table-chance]\n (local table-chance (or table-chance 0.5))\n (if (> (math.random) 0.5) (generators.number)\n (> (math.random) 0.5) (generators.string)\n (> (math.random) table-chance) (generators.table table-chance)\n :else (generators.boolean))))\n\ngenerate\n" }, { "path": "tests/inputs/git_helpers.fish", "content": "# https://raw.githubusercontent.com/Konstruktionist/fish/master/conf.d/git_helpers.fish\n# Building Gary Bernhardt's githelpers bash script in fish\n# ========================================================\n#\n# Log output:\n#\n# * 51c333e (12 days) add vim-eunuch\n#\n# Branch output:\n#\n# * release/v1.1 (13 days) add pretty_git_branch\n#\n# The time massaging regexes start with ^[^<]* because that ensures that they\n# only operate before the first \"<\". That \"<\" will be the beginning of the\n# author name, ensuring that we don't destroy anything in the commit message\n# that looks like time.\n#\n# The log format uses ∬ characters between each field, and `column` is later\n# used to split on them. A ∬ in the commit subject or any other field will\n# break this. (GB used originally the } character, I think that may\n# occasionally show up in a commit message)\n# -----------------------------------------\n\nset -l ycolor (set_color bryellow)\nset -l ncolor (set_color normal)\nset -l gcolor (set_color brgreen)\nset -l bcolor (set_color blue)\nset -l rcolor (set_color brred)\n\nset -l log_hash \"$ycolor%h\"\nset -l log_relative_time \"$gcolor(%ar)\"\nset -l log_author \"$bcolor<%an>\"\nset -l log_refs \"$rcolor%d$ncolor\"\nset -l log_subject \"%s\"\n\n# Use a special character to separate our fields so strings with spaces in\n# them (like names & subjects) will not split on them.\n# Character used is ∬ = U+222C (DOUBLE INTEGRAL). I'm fairly sure nobody uses\n# that in commit messages.\n# DO NOT use it between log_refs and log_subject to prevent hideous whitespace\n# problems.\n\nset log_format \"$log_hash∬$log_relative_time∬$log_author∬$log_refs $log_subject\"\n\nset -l branch_prefix \"%(HEAD)\"\nset -l branch_ref \"$rcolor%(refname:short)\"\nset -l branch_hash \"$ycolor%(objectname:short)\"\nset -l branch_date \"$gcolor(%(committerdate:relative))\"\nset -l branch_author \"$bcolor<%(authorname)>$ncolor\"\nset -l branch_contents \"%(contents:subject)\"\n\nset branch_format \"$branch_prefix∬$branch_ref∬$branch_hash∬$branch_date∬$branch_author∬$branch_contents\"\n\n# Logs\nfunction gitl -d 'l = all commits, only current branch'\n # 1st string replace: remove all ' ago' only in date column\n # 2nd string replace: replace (2 years, 5 months) with (2 years)\n # 3rd - 5th string replace: print Merge commit messages in cyan\n # NOTE: to get the merge commit messages printed cyan we can not use the above\n # declared variables rcolor & ncolor. If we do we get an error stating:\n # 'Variables may not be used as commands' or 'string replace: Expected\n # argument\"\n git log --graph --pretty=\"tformat:$log_format\" $argv |\\\n string replace -r '(^[^<]*)\\sago\\)' '$1)' |\\\n string replace -r ',\\s\\d+?\\s\\w+\\s?' '' |\\\n string replace -r 'Merge branch\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n string replace -r 'Merge pull request\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n string replace -r 'Merge remote-tracking branch\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n # TODO: Ideally these last 3 would be replaced by\n #\n # string replace -r ([\\s]{3}Merge.*) (set_color cyan)'$1'(set_color normal)\n #\n # but somehow fish doesn't understand this and ignores it. There are no\n # error messages, it just ignores the set_color commands & prints the\n # commit message in normal color. It works in RegExR & online regex\n # testers.\n # Needs further investigation.\n column -t -s '∬' |\\\n less -FXRS\nend\n\nfunction gitla -d 'la = all commits, all reachable refs'\n gitl --all\nend\n\nfunction gitr -d 'r = recent commits, only current branch'\n gitl -30\nend\n\nfunction gitra -d 'ra = recent commits, all reachable refs'\n gitr --all\nend\n\nfunction gith -d 'h = head'\n gitl -1\nend\n\nfunction githp -d 'hp = head with patch'\n gitl -1\n git show -p --pretty=\"tformat:\"\nend\n\n# Branches\n# This follows the same logic as in the Logs section\nfunction gitb -d 'b = all branches'\n git branch -v --format=$branch_format $argv |\\\n string replace -r '(^[^<]*)\\sago\\)' '$1)' |\\\n string replace -r ',\\s\\d+?\\s\\w+\\s?' '' |\\\n string replace -r 'Merge branch\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n string replace -r 'Merge pull request\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n string replace -r 'Merge remote-tracking branch\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n column -t -s '∬' | less -FXRS\nend\n\nfunction gitbs -d 'bs = all branches, sorted by last commit date'\n git branch -v --format=$branch_format --sort=-committerdate $argv |\\\n string replace -r '(^[^<]*)\\sago\\)' '$1)' |\\\n string replace -r ',\\s\\d+?\\s\\w+\\s?' '' |\\\n string replace -r 'Merge branch\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n string replace -r 'Merge pull request\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n string replace -r 'Merge remote-tracking branch\\s.*' (set_color cyan)'$0'(set_color normal) |\\\n column -t -s '∬' | less -FXRS\nend\n" }, { "path": "tests/inputs/github_user.aria", "content": "# https://egranata.github.io/aria/\n\n# github_user.aria\nimport Request from aria.network.request;\nimport JsonValue from aria.json.parser;\n\nval whoami = \"egranata\";\n\nfunc main() {\n val request = Request.new(\"https://api.github.com/users/{0}\".format(whoami));\n request.headers[\"User-Agent\"] = \"AriaLang/1.0\";\n val response = request.get();\n\n if response.status_code == 200 {\n val user_data = JsonValue.parse(response.content).flatten();\n println(\"User {1} has {0} public repositories.\".format(user_data[\"public_repos\"], whoami));\n } else {\n println(\"Failed to fetch user data. Status: {0}\".format(response.status_code));\n }\n}\n" }, { "path": "tests/inputs/glade-search-popover.ui", "content": "\n\n\n\n \n \n\n" }, { "path": "tests/inputs/glossary.json", "content": "{\n \"glossary\": {\n \"title\": \"example glossary\",\n \"GlossDiv\": {\n \"title\": \"S\",\n \"GlossList\": {\n \"GlossEntry\": {\n \"ID\": \"SGML\",\n \"SortAs\": \"SGML\",\n \"GlossTerm\": \"Standard Generalized Markup Language\",\n \"Acronym\": \"SGML\",\n \"Abbrev\": \"ISO 8879:1986\",\n \"GlossDef\": {\n \"para\": \"A meta-markup language, used to create markup languages such as DocBook.\",\n \"GlossSeeAlso\": [\"GML\", \"XML\"]\n },\n \"GlossSee\": \"markup\"\n }\n }\n }\n }\n}\n" }, { "path": "tests/inputs/glossary.json5", "content": "// comments supported\n{\n \"glossary\": {\n \"title\": \"example glossary\",\n \"GlossDiv\": {\n \"title\": \"S\",\n \"GlossList\": {\n \"GlossEntry\": {\n \"ID\": \"SGML\",\n \"SortAs\": \"SGML\",\n \"GlossTerm\": \"Standard Generalized Markup Language\",\n \"Acronym\": \"SGML\",\n \"Abbrev\": \"ISO 8879:1986\",\n \"GlossDef\": {\n \"para\": \"A meta-markup language, used to create markup languages such as DocBook.\",\n \"GlossSeeAlso\": [\"GML\", \"XML\"]\n },\n \"GlossSee\": \"markup\"\n }\n }\n /*\n * more comments\n */\n }\n }\n}\n" }, { "path": "tests/inputs/gnureadline.vala", "content": "// https://wiki.gnome.org/Projects/Vala/InputSamples?highlight=%28%5CbVala%2FExamples%5Cb%29\nvoid main () {\n while (true) {\n var name = Readline.readline (\"Please enter your name: \");\n if (name != null && name != \"\") {\n/*\n stdout.printf (\"Hello, %s\\n\", name);\n Readline.History.add (name);\n*/\n } else {\n break;\n }\n }\n}\n" }, { "path": "tests/inputs/graphql.gql", "content": "# https://www.npmjs.com/package/graphql-example\nmutation { # create new user\n createUser(name: \"\") {\n id\n name\n errors {\n\n path\n errors {\n \tvalidator\n \tmessage\n \tcode\n # comment 2\n }\n }\n }\n}\n" }, { "path": "tests/inputs/greeter.tsx", "content": "/*\nhttps://raw.githubusercontent.com/Microsoft/TypeScriptSamples/master/greeter/greeter.ts\nrenamed to greeter.tsx to test .tsx association\n*/\nclass Greeter {\n constructor(public greeting: string) { }\n greet() {\n return \"

\" + this.greeting + \"

\";\n }\n};\n\nvar greeter = new Greeter(\"Hello, world!\");\n \n// document.body.innerHTML = greeter.greet();\n" }, { "path": "tests/inputs/groovy_triple.gvy", "content": "print(\n\"\"\" /*\n\"\"\")\nprint(\n\"\"\" */\n\"\"\")\n" }, { "path": "tests/inputs/guard_talking.yarn", "content": "// https://docs.yarnspinner.dev/write-yarn-scripts/scripting-fundamentals/detour\ntitle: Guard\n---\nGuard: Have I told you my backstory?\n-> Yes.\n\tGuard: Oh. Well, then.\n-> No?\n\t<>\nGuard: Anyway, you can't come in.\n===\n\ntitle: Guard_Backstory\n---\nGuard: Do you want the detailed version or the short version?\n -> Detailed.\n <>\n Guard: I hope you enjoyed learning all that.. Anyway...\n -> Short.\n Guard: Right, well, I was a recruit, then I wasn't.\n===\n\ntitle: Guard_Detailed_Backstory\n---\nGuard: It all started when I was a mere recruit.\n// (five minutes of exposition omitted)\n// (other stuff happens)\nGuard: Want to hear more?\n -> Yes.\n -> No.\n <>\nGuard: (speaks more garbage)\n===\n" }, { "path": "tests/inputs/guestbook.tpl", "content": "{* Smarty https://www.smarty.net/sampleapp4 *}\n\n\n \n \n \n {foreach from=$data item=\"entry\"}\n \n \n \n \n \n \n \n {foreachelse}\n \n \n \n {/foreach}\n
\n Guestbook Entries (add)
{$entry.Name|escape}\n {$entry.EntryDate|date_format:\"%e %b, %Y %H:%M:%S\"}
\n {$entry.Comment|escape}
No records
\n" }, { "path": "tests/inputs/hanoi.inc", "content": "// https://github.com/compuphase/pawn/tree/main/examples/hanoi.p\n\n/* The Towers of Hanoi, a game solved through recursion */\n\n@start()\n {\n print \"How many disks: \"\n var disks = getvalue()\n move 1, 3, 2, disks\n }\n\nmove(from, to, spare, numdisks)\n {\n if (numdisks > 1)\n move from, spare, to, numdisks-1\n printf \"Move disk from pillar %d to pillar %d\\n\", from, to\n if (numdisks > 1)\n move spare, to, from, numdisks-1\n }\n" }, { "path": "tests/inputs/harbour_xbase.prg", "content": "// This is a comment\n/* This is a comment */\n/* This is\na comment */\n* This is a comment\n&& This is a comment\nNOTE This is a comment\nnote This is a comment\na = 1\nNOTE\n" }, { "path": "tests/inputs/hello.C", "content": "// hello.C\n#include \nint main ()\n{\n std::cout << \"hello\" << std::endl; // comment 1\n std::cout << \"again\" << std::endl; /* comment\n 2 */\n}\n" }, { "path": "tests/inputs/hello.bf", "content": "[ This program prints \"Hello World!\" and a newline to the screen, its\n length is 106 active command characters. [It is not the shortest.]\n\n This loop is a \"comment loop\", a simple way of adding a comment\n to a BF program such that you don't have to worry about any command\n characters. Any \".\", \",\", \"+\", \"-\", \"<\" and \">\" characters are simply\n ignored, the \"[\" and \"]\" characters just have to be balanced. This\n loop and the commands it contains are ignored because the current cell\n defaults to a value of 0; the 0 value causes this loop to be skipped.\n]\n++++++++ Set Cell #0 to 8\n[\n >++++ Add 4 to Cell #1; this will always set Cell #1 to 4\n [ as the cell will be cleared by the loop\n >++ Add 2 to Cell #2\n >+++ Add 3 to Cell #3\n >+++ Add 3 to Cell #4\n >+ Add 1 to Cell #5\n <<<<- Decrement the loop counter in Cell #1\n ] Loop till Cell #1 is zero; number of iterations is 4\n >+ Add 1 to Cell #2\n >+ Add 1 to Cell #3\n >- Subtract 1 from Cell #4\n >>+ Add 1 to Cell #6\n [<] Move back to the first zero cell you find; this will\n be Cell #1 which was cleared by the previous loop\n <- Decrement the loop Counter in Cell #0\n] Loop till Cell #0 is zero; number of iterations is 8\n" }, { "path": "tests/inputs/hello.f", "content": "c Hello World\n* Hello World\n! Hello World\n program hello\n implicit none\n print '(\"Hello, World!\")'\n end\n ! a fancy comment\n!hpf$ not a comment\n!omp$ not a comment either\n" }, { "path": "tests/inputs/hello.f90", "content": "! Hello World\nprogram hello\n implicit none\n print '(\"Hello, World!\")'\nend program hello\n!hpf$ not a comment\n!omp$ not a comment either\n" }, { "path": "tests/inputs/hello.java", "content": "/* hello.java */\nimport java.io.*;\nclass Hi {\n static public void main( String args[] ) {\n System.out.println( \"Hello World!\" ); /*\n insert comment here\n */\n }\n}\n" }, { "path": "tests/inputs/hello.kt", "content": "/* http://confluence.jetbrains.com/display/Kotlin/Hello%2C+world! \n*/\nfun main(args : Array) { \n val language = if (args.size == 0) \"EN\" else args[0] \n println(when (language) { \n \"EN\" -> \"Hello!\" \n \"ES\" -> \"¡Hola!\" \n // will this render?\n \"RU\" -> \"Привет!\" \n else -> \"Sorry, I can't greet you in $language yet\" \n }) \n}\n" }, { "path": "tests/inputs/hello.lua", "content": "-- single line comment\n\n--[[\nmulti \nline \ncomment\n]]\n\n--[[\nalso a comment\n--]]\n\nprint(\"hello, world\")\nprint([[not a comment]])\n" }, { "path": "tests/inputs/hello.pas", "content": "{ Hello World in Pascal, for testing SLOCCount.\n This is multi-line, testing curly braces. }\n(* This is another multi-line comment.\n Here's another line. *)\nprogram Hello;\nbegin (* Main *)\n writeln ('Hello, world.')\nend. (* Main *)\n\n" }, { "path": "tests/inputs/hello.pl1", "content": "/*\n * Compile:\n * gcc hello.c -o hello\n *\n * Run:\n * hello\n */\nmain (int argc, char *argv[])\n{\n printf(\"Hello.\\n\");\n~ printf(\"tilde line.\\n\");\n}\n" }, { "path": "tests/inputs/hello.sp", "content": "#!/usr/local/bin/spar\n-- http://www.sparforte.com/sparforte21/examples/hello.html\n\n-- Hello world in a quick and scripty way\n? \"Hello world!\";\n\n-- Hello world in a do it again way\n?%;\n\n-- Hello world in a Bourne shell way\necho Hello world!;\n\n-- Hello world in an AdaScript parameter shell way\necho( \"Hello world!\" );\n\n-- Hello world in a ISO standard, scalable, structured way\nput_line( \"Hello world!\" );\n\n-- Hello world in a PostgreSQL database way\ndb.connect( \"ken\" );\nselect 'Hello world!';\ndb.disconnect;\n" }, { "path": "tests/inputs/hello1.pas", "content": "{ Hello World in Pascal, for testing SLOCCount.\n This is multi-line, testing curly braces. }\n(* This is another multi-line comment.\n Here's another line. *)\n(* This is { another } test. **)\nprogram Hello;\nbegin (* Main *)\n writeln ('Hello, world.');\n writeln ('It''s a test!');\n writeln ('Show that newlines are detected')\nend. (* Main *)\n\n" }, { "path": "tests/inputs/hello_1.0.bb", "content": "# Hello world from meta-skeleton\nDESCRIPTION = \"Simple helloworld application\"\nSECTION = \"examples\"\nLICENSE = \"MIT\"\nLIC_FILES_CHKSUM = \"file://${COMMON_LICENSE_DIR}/MIT;md5=0835ade698e0bcf8506ecda2f7b4f302\"\n\nSRC_URI = \"file://helloworld.c\"\n\nS = \"${WORKDIR}\"\n\ndo_compile() {\n\t${CC} ${LDFLAGS} helloworld.c -o helloworld\n}\n\ndo_install() {\n\tinstall -d ${D}${bindir}\n\tinstall -m 0755 helloworld ${D}${bindir}\n}\n" }, { "path": "tests/inputs/hello_app.go", "content": "// https://raw.githubusercontent.com/golang/example/master/appengine-hello/app.go\n// Copyright 2015 Google Inc.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// Package hello is a simple App Engine application that replies to requests\n// on /hello with a welcoming message.\npackage hello\n\nimport (\n\t\"fmt\"\n\t\"net/http\"\n)\n\n// init is run before the application starts serving.\nfunc init() {\n\t// Handle all requests with path /hello with the helloHandler function.\n\thttp.HandleFunc(\"/hello\", helloHandler)\n}\n\nfunc helloHandler(w http.ResponseWriter, r *http.Request) {\n\tfmt.Fprintln(w, \"Hello from the Go app\")\n}\n\n" }, { "path": "tests/inputs/hello_app.ʕ◔ϖ◔ʔ", "content": "// https://raw.githubusercontent.com/golang/example/master/appengine-hello/app.go\n// Copyright 2015 Google Inc.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// Package hello is a simple App Engine application that replies to requests\n// on /hello with a welcoming message.\npackage hello\n\nimport (\n\t\"fmt\"\n\t\"net/http\"\n)\n\n// init is run before the application starts serving.\nfunc init() {\n\t// Handle all requests with path /hello with the helloHandler function.\n\thttp.HandleFunc(\"/hello\", helloHandler)\n}\n\nfunc helloHandler(w http.ResponseWriter, r *http.Request) {\n\tfmt.Fprintln(w, \"Hello from the Go app\")\n}\n\n" }, { "path": "tests/inputs/hello_app_autogen.go", "content": "// Code generated by manual copy DO NOT EDIT.\n// https://raw.githubusercontent.com/golang/example/master/appengine-hello/app.go\n// Copyright 2015 Google Inc.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// Package hello is a simple App Engine application that replies to requests\n// on /hello with a welcoming message.\npackage hello\n\nimport (\n\t\"fmt\"\n\t\"net/http\"\n)\n\n// init is run before the application starts serving.\nfunc init() {\n\t// Handle all requests with path /hello with the helloHandler function.\n\thttp.HandleFunc(\"/hello\", helloHandler)\n}\n\nfunc helloHandler(w http.ResponseWriter, r *http.Request) {\n\tfmt.Fprintln(w, \"Hello from the Go app\")\n}\n\n" }, { "path": "tests/inputs/hello_app_autogen.ʕ◔ϖ◔ʔ", "content": "// Code generated by manual copy DO NOT EDIT.\n// https://raw.githubusercontent.com/golang/example/master/appengine-hello/app.go\n// Copyright 2015 Google Inc.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// Package hello is a simple App Engine application that replies to requests\n// on /hello with a welcoming message.\npackage hello\n\nimport (\n\t\"fmt\"\n\t\"net/http\"\n)\n\n// init is run before the application starts serving.\nfunc init() {\n\t// Handle all requests with path /hello with the helloHandler function.\n\thttp.HandleFunc(\"/hello\", helloHandler)\n}\n\nfunc helloHandler(w http.ResponseWriter, r *http.Request) {\n\tfmt.Fprintln(w, \"Hello from the Go app\")\n}\n\n" }, { "path": "tests/inputs/helloworld.raml", "content": "# https://raw.githubusercontent.com/raml2html/raml2html/master/examples/helloworld.raml\n#\n#%RAML 1.0\ntitle: Hello world # required title\nversion: 1\nbaseUri: http://example.com/{version}\ndocumentation:\n - title: Welcome\n content: |\n Welcome to the Example Documentation. The Example API allows you\n to do stuff. See also [example.com](https://www.example.com).\n - title: Chapter two\n content: |\n More content here. Including **bold** text!\n\n/helloworld: # optional resource\n description: This is the top level description for /helloworld.\n\n get: # HTTP method declaration\n responses: # declare a response\n 200: # HTTP status code\n body: # declare content of response\n application/json: # media type\n type: | # structural definition of a response (schema or type)\n {\n \"title\": \"Hello world Response\",\n \"type\": \"object\",\n \"properties\": {\n \"message\": {\n \"type\": \"string\"\n }\n }\n }\n example: # example how a response looks like\n {\n \"message\": \"Hello world\"\n }\n /test:\n displayName: TEST\n get:\n description: a sub resource\n\n /{id}:\n uriParameters:\n id:\n type: string\n description: account identifier\n minLength: 1\n maxLength: 10\n\n get:\n headers:\n Authorization:\n type: string\n description: Basic authentication header\n example: |\n Authorization: Basic QWxhZGRpbjpvcGVuIHNlc2FtZQ==\n\n put:\n body:\n application/x-www-form-urlencoded:\n properties:\n name:\n description: name on account\n type: string\n examples:\n example1: Naruto Uzumaki\n example2: Kevin Renskers\n gender:\n enum: [\"male\", \"female\"]\n" }, { "path": "tests/inputs/hi.mojo", "content": "#mojo\n# Works with Mojo.\n\n# pound comment\n\ndef main():\n from time import now\n print(\"Hello, the monotonic time is:\", now()) # inline comment\n\n\"\"\"\nDocstring,\n also counted as comment.\n\"\"\"\n\n'''\nSingle\n Quoted\n Docstring'''" }, { "path": "tests/inputs/hi.py", "content": "#/usr/bin/env python\n# Works with both 2.x and 3.x versions of Python.\n\n# pound comment\n\nimport time\nprint('Hello. The time is %f Unix epoch.' % (time.time())) # inline comment\n\n\"\"\"\nDocstring,\n also counted as comment.\n\"\"\"\n\n'''\nSingle\n Quoted\n Docstring'''" }, { "path": "tests/inputs/htlc.teal", "content": "// https://developer.algorand.org/docs/get-details/dapps/avm/teal/#looping-and-subroutines\n// Are used to comment in TEAL\n// htlc.teal\n// Push the CloseRemainderTo property of the current transaction onto the stack\ntxn CloseRemainderTo\n\n// Push addr2 onto the stack as the intended recipient\naddr SOEI4UA72A7ZL5P25GNISSVWW724YABSGZ7GHW5ERV4QKK2XSXLXGXPG5Y\n\n// The == operator is used to verify that both of these are the same\n// This pops the two values off the stack and pushes the result 0 or 1\n==\n\n// Push the current transaction’s Receiver property onto the stack\n// In this example it should be addr2\ntxn Receiver\n\n// Push addr2 on the stack using the addr constant\naddr SOEI4UA72A7ZL5P25GNISSVWW724YABSGZ7GHW5ERV4QKK2XSXLXGXPG5Y\n\n// Use the == to verify that these are equal which pops off the top two values of the stack\n// and returns 0 or 1\n==\n\n// The stack should currently have two values from the two top conditions\n// These will be either 0s or 1s\n// Push the && operator which will AND the two previous conditions and return\n// either 0 or 1, which leaves one value on the stack either a 0 or a 1\n&&\n\n// Push the first argument to the transaction onto the stack\narg 0\n\n// The len operator pops the arg off the stack and \n// pushes the length of the argument onto the stack\nlen\n\n// Push a constant int of value 46 onto the stack\nint 46\n\n// The == operator verifies that the length of the argument\n// is equal to 46. This pops the two values and returns a 0 or 1\n// The stack now contains two values with a value of 0 or 1\n==\n\n// The && operator will AND the two values in the stack\n// which pops both values off the stack and returns a 0 or 1\n// The stack should now only have one value on the stack, 0 or 1\n&&\n\n// arg 0 is pushed back onto the stack\n// This represents the hashed passcode\narg 0\n\n// The sha256 operator pops the arg 0 off the stack\n// and pushes the hash value of the argument onto the stack\nsha256\n\n// The constant byte array of the base64 version of our secret is pushed onto the stack\nbyte base64 QzYhq9JlYbn2QdOMrhyxVlNtNjeyvyJc/I8d8VAGfGc=\n\n// The == operator pops the two values and pushes 0 or 1 onto the stack\n// If arg0 is equal to the secret this value will be 1 and if not it will be 0\n==\n\n// Two values are now on the stack. The && operator is used \n// to pop the last two values and push either 0 or 1\n// This will AND all previous conditions to this one.\n// The stack should only have a 0 or 1 value now\n&&\n" }, { "path": "tests/inputs/html_heex_example.heex", "content": "<%= for entry <- entries do %>\n
\n <% # this is a nice comment about progress %>\n <%= entry.progress %>% \n<%!-- a\nmultiline\n comment --%>\n
\n<% end %>\n\n" }, { "path": "tests/inputs/i18n_de.ts", "content": "\n\n\n MainWindow\n \n View\n Ansicht\n \n \n &File\n &Datei\n \n \n E&xit\n Be&enden\n \n\n \n First\n Erstens\n \n \n Third\n Drittens\n \n \n English\n Deutsch\n \n \n Language: %1\n Sprache: %1\n \n \n Oblique\n Schief\n \n \n Second\n Zweitens\n \n \n Isometric\n Isometrisch\n \n \n Perspective\n Perspektivisch\n \n \n Internationalization Example\n Internationalisierungsbeispiel\n \n \n LTR\n LTR\n \n\n\n" }, { "path": "tests/inputs/iclean.icl", "content": "// https://github.com/camilstaps/iClean/raw/master/iclean.icl\n/**\n * Interactive Clean\n *\n * Clean program to easily compile and run one-line Clean expressions\n *\n * The MIT License (MIT)\n * \n * Copyright (c) 2015 Camil Staps \n * \n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\nmodule iclean\n\nimport StdEnv\nimport ReadLine\n\n// SETTINGS\ntemp_path :== \"/tmp/\"\ntemp_module :== \"iclean\"\nreadline_history :== \".iclean_history\"\n// END SETTINGS\n\ntemp_file :== temp_path +++ temp_module +++ \".icl\"\n\nStart :: *World -> *World\nStart w\n# w = setReadLineName \"iClean\" w\n# w = usingHistory w\n# w = checkedWorldFunc readHistory \"Couldn't read history file\\n\" readline_history w\n# w = loop w\n# w = checkedWorldFunc writeHistory \"Couldn't write history file\\n\" readline_history w\n= w\nwhere\n loop :: !*World -> *World\n loop w\n # (s,w) = readLine \"λ. \" False w\n | isNothing s = print \"\\n\" w\n # s = fromJust s\n | s == \"\" = loop (print \"Use Ctrl-D to exit\\n\" w)\n # w = addHistory s w\n # w = writemodule s w\n # (r,w) = compile temp_path temp_module w\n | r <> 0 = loop w\n # w = run (temp_path +++ temp_module) w\n = loop w\n\ncheckedWorldFunc :: (a *World -> (Bool, *World)) !String !a !*World -> *World\ncheckedWorldFunc f err s w\n# (ok, w) = f s w\n| not ok = print err w\n| otherwise = w\n\nprint :: String *World -> *World\nprint s w\n# (io,w) = stdio w\n# io = fwrites s io\n# (ok,w) = fclose io w\n| not ok = abort \"Couldn't close stdio\\n\"\n| otherwise = w\n\nwritemodule :: String *World -> *World\nwritemodule s w\n# (ok,f,w) = fopen temp_file FWriteText w\n| not ok = abort (\"Couldn't open \" +++ temp_file +++ \" for writing.\\n\")\n# f = fwrites (\"module \" +++ temp_module +++ \"\\n\") f\n# f = fwrites \"import StdEnv\\n\" f\n# f = fwrites (\"Start = \" +++ s +++ \"\\n\") f\n# (ok,w) = fclose f w\n| not ok = abort (\"Couldn't close \" +++ temp_file +++ \"\\n\")\n| otherwise = w\n\ncompile :: !String !String !*World -> *(!Int,*World)\ncompile _ _ _ = code {\n ccall compile \"SS:p:p\"\n}\n\nrun :: !String *World -> *World\nrun _ _ = code {\n ccall run \"S:V:p\"\n}\n\n" }, { "path": "tests/inputs/idris_block_comments.idr", "content": "--\n-- A module about shapes\n--\n\n||| a Shape\ndata Shape =\n ||| Triangle with base and heigth\n Triangle Double Double |\n ||| Circle with radius\n Circle Double\n\n||| computes the area of a shape\narea : Shape -> Double\narea (Triangle x y) = 0.5 * x * y\narea (Circle x) = pi * x * x\n -- pi is known by idris\n\n{-\ncommented out code\n-}\n" }, { "path": "tests/inputs/igorpro.ipf", "content": "// Taken from https://github.com/t-b/igor-unit-testing-framework/blob/master/procedures/unit-testing-comparators.ipf\n// licensed under BSD\n\n/// @class NEQ_VAR_DOCU\n/// Tests two variables for inequality\n/// @param var1 first variable\n/// @param var2 second variable\nstatic Function NEQ_VAR_WRAPPER(var1, var2, flags)\n\tvariable var1, var2\n\tvariable flags\n\n\tincrAssert()\n\n\tif(shouldDoAbort())\n\t\treturn NaN\n\tendif\n\n\tif(EQUAL_VAR(var1, var2)) // do some stuff\n\t\tif(flags & OUTPUT_MESSAGE)\n\t\t\tprintFailInfo()\n\t\tendif\n\t\tif(flags & INCREASE_ERROR)\n\t\t\tincrError()\n\t\tendif\n\t\tif(flags & ABORT_FUNCTION)\n\t\t\tabortNow()\n\t\tendif\n\tendif\nEnd\n" }, { "path": "tests/inputs/includes_demo.mustache", "content": "{{! https://github.com/mustache/mustache.github.com/archive/master.zip }}\n{% raw %}\n

{{header}}

\n{{#bug}}\n{{/bug}}\n\n{{#items}}\n {{#first}}\n
  • {{name}}
    • \n {{/first}}\n {{#link}}\n
  • {{name}}
    • \n {{/link}}\n{{/items}} {{!\nstuff\n }}\n{{#empty}}\n

    The list is empty.

    \n{{/empty}}\n{% endraw %}\n" }, { "path": "tests/inputs/inner_ref.jsonnet", "content": "// https://jsonnet.org/learning/tutorial.html\n{\n Martini: {\n local drink = self,\n ingredients: [\n { kind: \"Farmer's Gin\", qty: 1 },\n {\n kind: 'Dry White Vermouth',\n qty: drink.ingredients[0].qty,\n /* note ability to add\n trailing commas */\n },\n ],\n garnish: 'Olive',\n served: 'Straight Up',\n # The `self` keyword refers to the current\n # object, which is the Martini in this case.\n },\n}\n" }, { "path": "tests/inputs/input.gts", "content": "{{! partial of\n https://raw.githubusercontent.com/josemarluedke/frontile/a9680f2681a8b1193feba0fdc27871566bcde120/packages/forms/src/components/input.gts\n}}\nimport Component from '@glimmer/component';\nimport { tracked } from '@glimmer/tracking';\nimport { action } from '@ember/object';\nimport { on } from '@ember/modifier';\nimport {\n useStyles,\n type InputSlots,\n type InputVariants,\n type SlotsToClasses\n} from '@frontile/theme';\nimport { FormControl, type FormControlSharedArgs } from './form-control';\nimport { triggerFormInputEvent } from '../utils';\nimport { ref } from '@frontile/utilities';\nimport { CloseButton } from '@frontile/buttons';\n\ninterface Args extends FormControlSharedArgs {\n type?: string;\n value?: string;\n name?: string;\n size?: InputVariants['size'];\n classes?: SlotsToClasses;\n\n /**\n * Whether to include a clear button\n */\n isClearable?: boolean;\n\n /**\n * Controls pointer-events property of startContent.\n * If you want to pass the click event to the input, set it to `none`.\n *\n * @defaultValue 'auto'\n */\n startContentPointerEvents?: 'none' | 'auto';\n\n /**\n * Controls pointer-events property of endContent.\n * If you want to pass the click event to the input, set it to `none`.\n *\n * @defaultValue 'auto'\n */\n endContentPointerEvents?: 'none' | 'auto';\n\n /**\n * Callback when oninput is triggered\n */\n onInput?: (value: string, event?: InputEvent) => void;\n\n /**\n * Callback when onchange is triggered\n */\n onChange?: (value: string, event?: InputEvent) => void;\n}\n\ninterface InputSignature {\n Args: Args;\n Blocks: {\n startContent: [];\n endContent: [];\n };\n Element: HTMLInputElement;\n}\n\nfunction or(arg1: unknown, arg2: unknown): boolean {\n return !!(arg1 || arg2);\n}\n\nclass Input extends Component {\n @tracked uncontrolledValue: string = '';\n\n inputRef = ref();\n\n if (this.isControlled) {\n this.args.onInput?.(value, event as InputEvent);\n } else {\n this.uncontrolledValue = value;\n }\n }\n\n @action handleOnChange(event: Event): void {\n const value = (event.target as HTMLInputElement).value;\n\n if (this.isControlled) {\n this.args.onChange?.(value, event as InputEvent);\n } else {\n this.uncontrolledValue = value;\n }\n }\n\n this.inputRef.element?.focus();\n triggerFormInputEvent(this.inputRef.element);\n }\n\n \n}\n\nexport { Input, type InputSignature };\nexport default Input;\n" }, { "path": "tests/inputs/insertJournalEntry.ipl", "content": "/*\nhttps://www.ibm.com/developerworks/community/wikis/home?lang=en#!/wiki/Tivoli+Netcool+Impact/page/Policy+Language+Code+Library\n */\n//--------------------------------------------------------------------\n//\n// insertJournalEntry- this IPL function will create a journal entry\n// of 'text' for event with serial# 'serial' in\n// data source 'datasource'.\n//\n// The OOB function for creating journal entries\n// does not support 2+ entries for same serial\n// in same second.\n//\n//--------------------------------------------------------------------\n\nFunction insertJournalEntry ( datasource, serial, text )\n{\n\n UID = 16; // user impact\n Chrono = GetDate();\n randNum = Random(100000); // this is added to support 2+ entries made for same serial# in same second\n KeyField = serial + \":\" + UID + \":\" + Chrono + \":\" + randNum;\n\n // journal entry text (jet) array - 16 \"text fields\" each varchar(255)\n jet = { \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\" };\n\n index = 0;\n while( (Length(text)>0) and (index255)\n {\n text = Substring(text, 256, Length(text));\n }\n else\n {\n text=\"\";\n }\n index = index + 1;\n }\n\n insertStmt = \"insert into alerts.journal ( KeyField,Serial,UID,Chrono,Text1,Text2,Text3,Text4,Text5,Text6,Text7,Text8,Text9,T\next10,Text11,Text12,Text13,Text14,Text15,Text16)\";\n insertStmt = insertStmt + \" values ( '\" + KeyField + \"', \" + serial + \", \" + UID + \", \" + Chrono;\n index=0;\n while(index= @1970-01-16\nderive {\n transaction_fees = 0.8,\n income = total - transaction_fees\n}\n\nfilter income > 1\n\ngroup customer_id (\n aggregate {\n average total,\n sum_income = sum income,\n ct = count total,\n }\n)\n" }, { "path": "tests/inputs/io.c3", "content": "// https://github.com/c3lang/c3c/blob/master/lib/std/io/io.c3 (partial saved here)\n// Copyright (c) 2021-2025 Christoffer Lerno. All rights reserved.\n// Use of this source code is governed by the MIT license\n// a copy of which can be found in the LICENSE_STDLIB file.\nmodule std::io;\nimport libc;\n\nenum Seek\n{\n\tSET,\n\tCURSOR,\n\tEND\n}\n\nfaultdef\n\tALREADY_EXISTS,\n\tBUSY,\n\tCANNOT_READ_DIR,\n\tDIR_NOT_EMPTY,\n\tPARENT_DIR_MISSING,\n\tEOF,\n\tFILE_CANNOT_DELETE,\n\tFILE_IS_DIR,\n\tFILE_IS_PIPE,\n\tFILE_NOT_DIR,\n\tFILE_NOT_FOUND,\n\tFILE_NOT_VALID,\n\tGENERAL_ERROR,\n\tILLEGAL_ARGUMENT,\n\tINCOMPLETE_WRITE,\n\tINTERRUPTED,\n\tINVALID_POSITION,\n\tINVALID_PUSHBACK,\n\tNAME_TOO_LONG,\n\tNOT_SEEKABLE,\n\tNO_PERMISSION,\n\tOUT_OF_SPACE,\n\tOVERFLOW,\n\tPATH_COULD_NOT_BE_FOUND,\n\tREAD_ONLY,\n\tSYMLINK_FAILED,\n\tTOO_MANY_DESCRIPTORS,\n\tUNEXPECTED_EOF,\n\tUNKNOWN_ERROR,\n\tUNSUPPORTED_OPERATION,\n\tWOULD_BLOCK;\n\n\n<*\n Read from a stream (default is stdin) to the next \"\\n\"\n or to the end of the stream, whatever comes first.\n \"\\r\" will be filtered from the String.\n\n @param [&inout] allocator : \"The allocator used to allocate the read string.\"\n @param stream : `The stream to read from.`\n @param limit : `Optionally limits the amount of bytes to read in a single line. Will NOT discard the remaining line data.`\n @require @is_not_instream_if_ptr(stream) : \"The value for 'stream' should have been passed as a pointer and not as a value, please add '&'.\"\n @require @is_instream(stream) : `Make sure that the stream is actually an InStream.`\n @param [inout] allocator : `the allocator to use.`\n @return `The string containing the data read.`\n*>\nmacro String? readline(Allocator allocator, stream = io::stdin(), usz limit = 0)\n{\n\treturn readline_impl{$typeof(stream)}(allocator, stream, limit);\n}\n\n<*\n Reads a string, see `readline`, except the it is allocated\n on the temporary allocator and does not need to be freed.\n\n @param stream : `The stream to read from.`\n @param limit : `Optionally limits the amount of bytes to read in a single line. Will NOT discard the remaining line data.`\n @require @is_not_instream_if_ptr(stream) : \"The value for 'stream' should have been passed as a pointer and not as a value, please add '&'.\"\n @require @is_instream(stream) : `The stream must implement InStream.`\n @return `The temporary string containing the data read.`\n*>\nmacro String? treadline(stream = io::stdin(), usz limit = 0)\n{\n\treturn readline(tmem, stream, limit) @inline;\n}\n\nfn String? readline_impl(Allocator allocator, Stream stream, usz limit) @private\n{\n\tif (allocator == tmem)\n\t{\n\t\tDString str = dstring::temp_with_capacity(256);\n\t\treadline_to_stream(&str, stream, limit)!;\n\t\treturn str.str_view();\n\t}\n\t@pool()\n\t{\n\t\tDString str = dstring::temp_with_capacity(256);\n\t\treadline_to_stream(&str, stream, limit)!;\n\t\treturn str.copy_str(allocator);\n\t};\n}\n\n<*\n Reads a string, see `readline`, the data is passed to an outstream\n\n @param out_stream : `The stream to write to`\n @param in_stream : `The stream to read from.`\n @param limit : `Optionally limits the byte-length of the allocated output string.`\n @require @is_not_instream_if_ptr(in_stream) : \"The value for 'in_stream' should have been passed as a pointer and not as a value, please add '&'.\"\n @require @is_not_outstream_if_ptr(out_stream) : \"The value for 'out_stream' should have been passed as a pointer and not as a value, please add '&'.\"\n @require @is_instream(in_stream) : `The in_stream must implement InStream.`\n @require @is_outstream(out_stream) : `The out_stream must implement OutStream.`\n @return `The number of bytes written. When a 'limit' is provided and the return value is equal to it, there may be more to read on the current line.`\n*>\nmacro usz? readline_to_stream(out_stream, in_stream = io::stdin(), usz limit = 0)\n{\n\treturn readline_to_stream_impl{$typeof(in_stream), $typeof(out_stream)}(out_stream, in_stream, limit);\n}\n\nfn usz? readline_to_stream_impl(OStream out_stream, IStream in_stream, usz limit) @private\n{\n\tbool $is_stream = IStream == InStream;\n\t$if $is_stream:\n\t\tvar func @safeinfer = &in_stream.read_byte;\n\t\tchar val = func((void*)in_stream)!;\n\t$else\n\t\tchar val = in_stream.read_byte()!;\n\t$endif\n\tbool $is_out_stream = OStream == OutStream;\n\t$if $is_out_stream:\n\t\tvar out_func @safeinfer = &out_stream.write_byte;\n\t$endif\n\n\tif (val == '\\n') return 0;\n\tusz len;\n\tif (val != '\\r')\n\t{\n\t\t$if $is_out_stream:\n\t\t\tout_func((void*)out_stream.ptr, val)!;\n\t\t$else\n\t\t\tout_stream.write_byte(val)!;\n\t\t$endif\n\t\tlen++;\n\t}\n\twhile (!limit || len < limit)\n\t{\n\t\t$if $is_stream:\n\t\t\tchar? c = func((void*)in_stream);\n\t\t$else\n\t\t\tchar? c = in_stream.read_byte();\n\t\t$endif\n\t\tif (catch err = c)\n\t\t{\n\t\t\tif (err == io::EOF) break;\n\t\t\treturn err~;\n\t\t}\n\t\tif (c == '\\r') continue;\n\t\tif (c == '\\n') break;\n\t\t$if $is_out_stream:\n\t\t\tout_func((void*)out_stream.ptr, c)!;\n\t\t$else\n\t\t\tout_stream.write_byte(c)!;\n\t\t$endif\n\t\tlen++;\n\t}\n\treturn len;\n}\n\n" }, { "path": "tests/inputs/issue_875.bdy", "content": "/*\n * bubble sort\n */\nDECLARE\n TYPE number_array IS VARRAY(100) OF NUMBER;\n arr number_array := number_array(64, 34, 25, 12, 22, 11, 90);\n n NUMBER := arr.COUNT;\n i NUMBER := 0;\n j NUMBER := 0;\n temp NUMBER;\nBEGIN\n FOR i IN 1 .. (n - 1) LOOP -- outer\n FOR j IN 1 .. (n - i - 1) LOOP -- inner\n IF arr(j) > arr(j + 1) THEN\n temp := arr(j);\n arr(j) := arr(j + 1);\n arr(j + 1) := temp;\n END IF;\n END LOOP;\n END LOOP;\n -- print\n FOR i IN 1 .. n LOOP\n DBMS_OUTPUT.PUT_LINE(arr(i));\n END LOOP;\nEND;\n/\n" }, { "path": "tests/inputs/issue_876.vue", "content": "\n\n\n" }, { "path": "tests/inputs/issues/114/bar/bee/inner_most.js", "content": "js 1\n" }, { "path": "tests/inputs/issues/114/bar/under_Bar.js", "content": "js 2\n" }, { "path": "tests/inputs/issues/114/foo/under_foo.js", "content": "js 3\n" }, { "path": "tests/inputs/issues/131/README", "content": "This directory contains inputs for tests 21 through 24 in cloc/Unix/t/01_opts.t \nThe tests exercise cloc's ability to work with git submodules (specifically, \nto ignore code in these). If you're working with a git repo clone you will \nneed to update the submodule via\n git submodule init\n git submodule update\nissued within your cloc working directory to get the tests to pass.\n" }, { "path": "tests/inputs/issues/131/hi.py", "content": "#/usr/bin/env python\n# Works with both 2.x and 3.x versions of Python.\n\n# pound comment\n\nimport time\nprint('Hello. The time is %f Unix epoch.' % (time.time())) # inline comment\n\n\"\"\"\nDocstring,\n also counted as comment.\n\"\"\"\n" }, { "path": "tests/inputs/issues/132/.gitignore", "content": "ignore_git/*\n" }, { "path": "tests/inputs/issues/132/C-Ansi.c", "content": "/* Hello World in C, Ansi-style */\n/* from http://www.roesler-ac.de/wolfram/hello.htm */\n\n#include \n#include \n\nint main(void)\n{\n puts(\"Hello World!\");\n return EXIT_SUCCESS;\n}\n" }, { "path": "tests/inputs/issues/132/README", "content": "Issue #132 (https://github.com/AlDanial/cloc/issues/132) needs\na non-git controlled subdirectory called 'ignore_git' created \nhere. Copy into this new directory the file hi.py from the \ntest inputs directory.\n\n # if cwd is cloc/tests/inputs/issues/132/ then:\n mkdir ignore_git\n cp ../../hi.py ignore_git/\n\n # if cwd is cloc/ then:\n mkdir tests/inputs/issues/132/ignore_git\n cp tests/inputs/hi.py tests/inputs/issues/132/ignore_git/\n\n # if cwd is cloc/Unix then:\n mkdir ../tests/inputs/issues/132/ignore_git\n cp ../tests/inputs/hi.py ../tests/inputs/issues/132/ignore_git/\n\nNote: The actions above are done automatically when running \n'make test' in the cloc/Unix directory.\n \n" }, { "path": "tests/inputs/issues/132/ignore_dir/Fortran77.f", "content": "C from http://www.roesler-ac.de/wolfram/hello.htm\nC Hello World in Fortran 77\n\n PROGRAM HELLO\n PRINT*, 'Hello World!'\n END\n" }, { "path": "tests/inputs/issues/166/X", "content": "Isabelle\n filter remove_between_general (* *)\n extension thy\n 3rd_gen_scale 3.00\n" }, { "path": "tests/inputs/issues/166/fake.thy", "content": "This is (* not an\nIsabelle file\n*)\n\nInstead, just some text lines.\n" }, { "path": "tests/inputs/issues/183/eval1957.SACunidir.fr", "content": " ( https://github.com/rsennrich/Bleualign/eval/eval1957.SACunidir.fr ) \nchronique himalayenne 1956 \navec notes complémentaires sur les années précédentes par g. o. dyhrenfurth \navec 3 illustrations \ndans la dernière époque sont les cotes de la grande himalaya-berge , ce qui a regrettables confusions . \ncomme est une pareille incertitude , même dans les plus célèbres , depuis 100 ans et mesurées expliquer ? \nce sont surtout les trois fehlerquellen aujourd' hui en être autrement qu' autrefois : \nla grandeur de la b ) jahres- et de la masse de l' himalaya et ;c ) les réductions au géoïde . \nil serait donc fait attendre que les depuis 1952 , qui étaient faites et neuberechnung très forte en face des écarts le vieux fournissent rouges , mais heureusement les plus tôt gemachten erreurs surtout kompensiert . \npour chomo-lungma ( mont everest ) d' assez six calculs aus den jahren 1849 et 1850 une valeur moyenne de 8839,8 m , six calculs de les années 1881-1902 lieferten un moyen de 8882,2 m. ce nombre a été encore trop bas que l' , et les ( 1513 ) sens pas montés jusqu' à plus de 8900 m hinaus . \nla nouvelle cote officielle publiée en 1955 ramène , de 8900 m. c' est donc le nombre , à la ronds . \npour le kangchenjunga , n' a connu que l' ancienne cote de 8579 m d' environ 60 ft . \n= 18,29 m augmenté doit être , la troisieme montagne de la terre , à environ 8597 m. est acheminés . \nla nouvelle cote officielle de ma connaissance n' est pas encore été publiée . \nquoi qu' il en soit , l' altitude de 8603 m qui figure sur la carte de marcel kurz , qui fut très bien . \nle lhotsé mesure toujours 8501 m , mais probablement demnächst , à environ 8510 m heraufgesetzt doivent être - conformément à ses voisins , l' everest et le makalu . \ncar la depuis un siècle , 8470 , maintenant , abandonnée . \nle nouveau chiffre officiel est 8481 m. \nle plus , c' est au cho oyu , pour le depuis quelque temps deux cotes - 2 les alpes - 1957 - die alpen 17 , 8153 m et 8189 m - dans « standen . \nune neuberechnung est probablement pas encore été terminés . \nle dhaulagiri , le mont blanc » de l' himalaya , le plus haut sommet de la terre , était coté jusqu' ici 8172 ou 8167 m . \nla nouvelle cote lui donne 8222 m. \nau-dessus de manaslu ( 8125 m ) , du nanga parbat ( 8125 m ) , l' annapurna i ( 8078 ou 8074 m ) , le shisha pangma ( 8013 m ) et les quatre « 8000 » pakistanais k2 ( 8611 m ) , le hidden peak ( 8068 m ) , le broad peak ( 8047 m ) et le gasherbrum ii ( 8035 m ) est pour rien de nouveau je garde pour ma part du passage . \nen tenant compte de tous les neuberechnung aujourd' hui physiques connu facteurs assez exige beaucoup de temps . \nles kaschmirfrage avec la frontière entre l' inde et le pakistan , dont encore . \nnous devons donc patienter encore , jusqu' à ce que les nouvelles altitudes pour tous les grands sommets de l' himalaya et du karakorum définitivement - c' est au moins pour quelques décennies - . \ndans notre revue des principales récentes expéditions le passé récent , nous commençons de nouveau avec ä l' himalaya : \n1. du kangchenjunga , les grimpeurs n' est pas beaucoup de nouveau à signaler au . \nla splendide ascension fut déjà dans notre « chronique himalayenne 1955 » traités ( voir les alpes 1956 , n° 4 ) . \nmais , du point de vue géologique , l' a méthodiquement par le dr toni hagen notre connaissance du kangchendzönga-massivs très nettement merveilleuse . \n« les alpes » 1956 , s.298-303 ( novembre ) bringen dans le texte , profils et un premier esquisses cartographiques ) . \n2. à la montagne de la terre , les arthaud ) . \nle livre de jean franco ( « makalu » , l' an dernier . \nb.arthaud ) , maintenant , même en allemand autant ( zürich : \norell füssli 1956 ) , après les amène gehaltvollen originalberichten et en face de notre annee « chronique himalayenne » en principe pas beaucoup de nouveau . \nmais les ascensions du makalu-gebietes par le dr toni hagen en hiver 1954/55 et en automne 1955 , dont les résultats de ce n' est que tout récemment fut quelque peu connue ( voir les alpes 1956 , p. 295-298 ) , étaient scientifiques de grösster bedeutung et lieferten bildlich aussi une splendide . \nla tectonique du peu à peu dévoilée et s' avère est aussi grandiose , comme on - nos anticipations le prévoyaient . \n3. , à l' est de la , le fleuve arun s' arim-fluss jusqu' à 1200 m , un des plus formidables qui , il y a sur la terre . \ndéjà en 1930 , j' en ai écrit : \n« de l' himalaya proprement dite , n' est pas malgré son altitude de partage des eaux ; \ncelle-ci est de plus au nord , , constituée par des chaînes . \ndes fleuves , comme par exemple le financé ( entre makalu- et kangchendzönga-gruppe ) ou la tista ( à l' est du kangchendzönga ) plus au sud jaillissent , sur le versant nord de l' himalaya et haben sich in terribles gorges vers le sud , par le gebirgswall durchgefressen . \npareille formidables par rückschreitende seulement à l' érosion , n' est pas possible . \napparemment filiusion ces cours d' eau issus déjà à l' océan indien , comme il n' a pas encore himmelstürmende great de l' himalaya , et ils tenaient avec la gebirgsaufwölbung pas . \nles hebung une zone situé au sud de la chaîne , donc peu à peu , ainsi que les rivières se dans la même rythme einschneiden et de leurs anciens cours dans la section essentiels . \nces fleuves sont plus vieux que l' himalaya . \n» le arun-tal est aussi et de pflanzengeographisch très intéressante . \nim auftrage du british museum j.d.a.stainton y a travaillé en été 1956 . \nil était accompagné du sherpa da temba ( himalayan club : \ndeux nr.212 ) . \n4. la grande expédition suisse de 1956 , de la ssaf soigneusement préparé et organisée , d' albert eggler mustergültig conduite et par les alpinistes bernois en vivent en parfaite harmonie camaraderie italienne - fut une des les entreprises dans l' histoire de l' himalaya . \nelle culmine dans la première ascension du lhotse ( 8501 m , resp. environ 8510 m ) , le 18 mai 1956 par ernst reiss et fritz luchsinger , la deuxième ascension du mount everest ( 8848 m ) , le 23 mai par jiirg marmet et ernst schmied et de la troisième ascension , le 24 mai par adolf reist et hansrudolf von gunten . \npour ne pas répéter ce qui est connu , il suffira ici , à quelques des principaux publications : \nréférences : \na ) les articles originaux dans « de la confédération » et « neue zürcher zeitung » de mai à octobre 1956 . \n- « les alpes 1956 , 132/133 , 147-151 , 175-177 et le fascicule de mars 1957 . \n- alberteggler : \nsommet par les nuages . \nberne : \nhallwag . \n- « berge der welt » , bd.xi ( 1956/57 ) , p. 161-177 . \noutre les succès bergsteigerischen réalisations , nous voulons l' exploration scientifique des everest-gebietes n' oublions pas : \n1952 augustin lombard , albert zimmermann , ;1952/53 1952 et 1953 l. g. c.pugh physiologisch , 1954 l'«aide heuberger géographique , 1954 et en 1955 pierre bordet et michel latreille , ainsi que les français - indépendant de tout -toni hagen , du point de vue géologique , 1955 , erwin schneider , but de 1956 , fritz müller et arthur durst glaziologisch et meteorologisch . \nles chomo-lungma-gruppe au bestbekannten devient peu à peu la région de l' himalaya . \n5. pour l' hiver 1956/57 est une expédition australienne , sous la conduite de peter c. bryne a annoncé , en solo khumbu ( wieder einmal ) sur la yeti-suche begeben will , c' est sur les « photographique schneemenschen»-jagd ( voir aussi 12 de cette chronique ) . \nn' est pas davantage encore connus . \n6. au-dessus de l' expédition féminine schottische , les au printemps 1955 au ne de kathmandu dans le jugal himal , qui était déjà dans l' intervention chronique ( voir les alpes 1956 , p. 81 ) peu . \nentre-temps , le livre a : \nmonica jackson et elizabeth stark , tents in the clouds ( london : \nil en 1956 ) , joliment illustré écrit allègrement et , quand nous nous aussi - h. w.tilman beistimmend - , nous aimerions rappeler que « human interest » , il ne devrait être et que les montagnes sont en général que les sur eux herumkriechenden hommes . \n7 sur le puissant manaslu ( 8125 m ) , les japonais 1952 une reconnaissance et de 1953 , une tentative sérieuse , bei dem sie jusqu' à 7750 m . \nen 1954 déjà , il n' y eut la marche d' approche par la vallée de la grande difficulté , avec de la population , qui se vers cette heureuse belästigung la gottheit au barrage . \nl' expédition dut faire demi-tour . \nen 1955 , le calme de la montagne , mais l' inévitable préparation diplomatique . \n1956 apporta la décision : \nsous la conduite du montagnard expérimenté qu' de yuko maki , le 1921 , avec les guides de grindelwald , fritz amatter , fritz steuri et samuel brawand , la première ascension par l' arête de la mittellegi de l' eiger avait réussi , cette fois-ci , a tenté une voie nouvelle . \njusqu' ici , on avait sur le versant se du massif gehalten : \nle village de sama ausgehend , par le manaslu-gletscher , naike-col ( 5600 m ) et le col nord ( 7100 m ) au un plateau glaciaire , un pas plus difficile , mais très long chemin , la neuf camp avait exige . \nmais , maintenant , se fit de la dernière montée par le sud , et l' on s' en tira avec six camps seulement . \nquatre membres de l' équipe des grimpeurs ont atteint le sommet -am 9.mai imanishi avec le sherpa gyalzen ( himalayan club : \ndeux jours ) et le 11 mai kato et higeta. par les quatre pointes , qui forment le sommet le plus élevé , est si étroit qu' un seul homme ; \nd' après les dernières mesures , le manaslu a exactement la même altitude que le nanga parbat ( 8125 m ) ; \ntous deux se trouvent à la 8 et 9 endroit de la rangliste . \nle récit de cette montagne ténacité la traduction exacte et les photos de leur expédition victorieuse de 1956 , on attend avec impatience . \n8. par les encore à gravir est reprise , le plus haut , le dhaulagiri ( d' après les nouveaux calculs 8222m ) , pour les depuis quatre ans gerungen devient dure ; \nen 1953 , et l' expédition de l' aacz , 1954 , la première expédition argentine , les jusqu' à 7950 m , et qu' il fit par un enfer pour le gipfelsieg gebracht fut , en 1955 , le schweizerisch-deutsche « vegetarische himalaya-expedition » et de 1956 , la seconde expédition argentine . \nde cette entreprise , dirigée par le colonel e.huerta , on n' a pas grand' deux , le 15 et 25 mai , échouèrent . \nsi les pressemeldungen des voix , fut une altitude d' environ 7200 m atteint . \npour 1957 , on dit qu' une expédition franco-suisse est en préparation , et si cette de la victoire , les argentins pourraient revenir en 1958 pour la troisième fois . \nle dhaulagiri est une montagne difficile et dangereux , lui aussi , l' heure de taille ... peut-être même bientôt . \ndu dhaulagiri himal , couronnée de six dépassant les 7000 m ( voir les alpes 1956 , p. 82 ) , rien de nouveau à signaler au . \ndans west-nepal depuis l' automne 1956 , le dr toni hagen . \n9. dans le garhwal , le trisul ( 7120 m ) , gravi deux fois , et cela par k.bunshah de bombay , avec deux sherpas et de deux allemands , f. et a. hieber . \nle trisul , la première fois déjà en 1907 par t. g. longstaff avec a. et h. bracherei et kharbir gravi , est un beau , mais unschwieriger montagne au sudouest de la nanda devi , est considéré comme « billiger sept mille » , et fut plusieurs fois déjà visité 10. dans la chronique himalayenne 1955 , déjà mentionné que peter aufscknaiter et george hampson une excursion dans les ronti-gruppe au sud de la rishi ganga-schlucht ( nanda devi-gebiet ) ont fait . \naprès coup est connu que dabei ( 1955 ) , la première ascension du ronti ) a réussi à 11 m.11. les expéditions féminines semblent venir à la mode . \nen mai et juin 1956 était l' expédition abinger » , sous la conduite de mrs.joyce dunsheath . \nc' étaient quatre membres du ladies alpine club , londres , les de manali , par le hampta-pass dans la vallée , est le bara shigri est leur camp de base , et , de là , de six sommets entre 5800 et de 6100 m erstiegen . \nils furent qui collaborent par le très ancien homme ang tsering uj ( « pansy » , h.c. n° 51 ) et trois autres sherpas . \n12. dans la vallée dont les eaux se déversent dans le même le dans le sud , au kulti-gletscherbecken , où , en 1955 , une expédition de la royal air force mountaineering association , dirigée par le capitaine a.j.m.smyth , travailla ( voir les alpes 1956 , s.85 haut ) . \nrécemment une très intéressante récit d' escadrille l. ( « alpine journal n° . \nalpine journal n° 293 , nov . \nen 1956 , p. 340-343 ) . \nje finis réparties - en traduction - quelques extraits : \n« ... nous rencontrâmes trois grands empreintes de pas sur l' arête , un peu au milieu du grand torrent glaciaire à notre droite . \nc' était indubitablement un animal aus dem glacées , vite , l' eau coulant sur l' îlot . \nnous voulions traverser volontiers la rivière , mais il était trop profonde et terriblement froid . \nc' est pourquoi nous nous vîmes maintenant bien pour , où la bête était hineingegangen dans l' eau . \nbientôt l' endroit était trouvée : \nune centaine de pas . \nde là , nous suivons la trace de toucher , donc sur le flanc ouest de la vallée et dans la direction , d' où la bête était venue . \nnous marchions parallèlement à l' itinéraire , sans elles , à environ croisent . \nl' animal était debout cheminant dans la fall-linie heruntergekommen ; \nen revanche , où il fut trop raide , il était sur son derrière heruntergerutscht . \naprès examen judicieuse , montre qu' il a cette descente suivants les mains avait utilisé , parfois au freiner , parfois pour nachzuhelfen . \nla distance entre de gauche et de droite handspuren était quelque trois pas . \naprès nous avoir la grande des traces premièrement aperçues , de la rivière jusqu' à un pont de neige , puis sur l' autre rive de nouveau revenir en arrière jusqu' à l' endroit où nous avions découvert d' abord les environs . \nc' est ici que l' eau environ 1 y2 m de profondeur , le courant avait le uferrand unterhöhlt - malgré tout , nous avons pu nous ne pûmes découvrir aucune empreinte de mains ou . \nquoi qu' il en soit créature qui avait passé là , extrêmement gross gewesen sein , car il était sortir de l' eau profonde simplement sur le bord de l' îlot . \ncomme ses camarades ladakhis , sur les précautions vers nos sherpas . \nmais cette attitude totalement . \n« zarur sahib , s' exclama , y eh bah nay hai » , cria-t-il . \n( ce n' est certainement pas un ours ) . \nla veille , il m' avait lors de mes caméras , 300 m en amont . \nnous pûmes constater que nos propres empreintes ne s' étaient élargies d' environ 3 sur leur . \nl' hypothèse que les prétendues empreintes par la fonte devait ) de bärenpfoten sont , dans le cas . \nen outre , nous avions de cette région , le bien jours à heures environ . \nnous savions que , depuis ce geschöpf , entre le 11 juin 1955 , de l' apres , et le 12 juin , tôt , la vallée de avait traversé . \nl' examen attentif des empreintes de pas sur le fil de l' île qu' elle ' de la rivière était durcie , quand la neige gelée , était donc dans la nuit ou très tôt le matin . \nsur des six voyages que j' ai faits souvent je ours noirs ou rouges et observé leurs traces , mais ici , dans ces empreintes de kulti étaient très différentes . \nchacun de large et les orteils , ( 203 mm . \nle certains avait une longueur de bien 30 cm et une largeur de 20 cm et était à certains endroits , environ 28 cm de profondeur , où j' ai même à peine 4 cm . \ndabei berceau je 89 kg , et je machte mes observations dans le soleil de midi . \ncette profondeur soit dans la neige dure , prouve que l' animal très lourd . \npendant des heures , nous suivons les traces , ce qui , à travers les se prolongeaient sur près d' un kilomètre et des torrents glaciaires , fut très difficile . \nelle avait ' d' au moins cinq de ces chenals , et sur le flanc est de la vallée rocheuse avant que ses traces aillent se perdre . \nil avait nulle part à quatre pattes . \nla distance de ses pas était presque le double des miens . \nfinalement nous abandonnâmes la chasse sur et retournèrent au camp de base . \nnos sherpas étaient très persuadés qu' il s' agissait d' un ,yéti ' . \nswami pranavananda a intéressantes récemment un article écrit ( ,the abominable snowman ' dans ,the alpine journal , n° 292 , mai 1956 , p. 110-117 ) , dans l' intention de montrer , le ,yeti-legende ' la force à faire . \nmalheureusement , il ne peut prétendre avoir jamais lui-même et il examine zu haben . \nil parle seulement de seconde main plusieurs tibétains ont confirme que des traces d' abord , puis , comme fährten d' un rouge ( nous installerions le dire : \nherausgestellt ours bruns ) . \nc' est , bien sûr , qu' un scheinargument . \nil est pourtant très bedeutsam : \nquand toujours d' une nouvelle espèce de conta - étaient toujours de nombreux sachverständige trop prêt , à une attester que si quelque chose ne pouvait exister . \nil y a cent ans , exactement franco-américain paul belloni du chaillu tira le premier gorille , le d' un blanc . \nplus de 2000 ans , l' europe avait tenu le gorille pour une pure légende , comme le serpent de mer ou les ,dragons ' du moyen âge . \nlorsque chaillu sa description de ce retour en europe , rires . \nil fallut encore si l' europe admette l' existence du gorille . \nil en fut de même plus tard , par exemple , avec le , du coelacanthus et l' okapi , la girafe des forêts primitives . \nles spécialistes de cet inconnu êtres vivants de l' existence de ces animaux . \nsceptiques demanderont pourquoi les rencontres avec le ,yéti ' ont été si rares , et il n' est que les indigènes , le visage . \non pourrait leur répondre par une contre-question : \ncomme beaucoup d' hommes , dans cette île la grande-bretagne ( ou en suisse ! ) ont déjà un dachs ( en liberté ) gesehen ? \ndans les vastes solitudes inexplorées de l' hima , les d' observer sans être . \nbien que la plupart des yeti-berichte par les indigènes , y est sans doute , que cette là de vie et de plus de possibilités , ont un yeti réprouvés , comme la main de européens , avec les buts record , le plus souvent en outre dans la saison chaude , si au-dessus de la limite des neiges , et , quand il y a beaucoup de ravitaillement . \nde ce côté , c' est très remarquable , que la limite des neiges , en 1955 , au loin , exceptionnellement ancestrale place . \nnous devons même notre d' origine le forschungsgebiet , la ligne de partage des eaux du shigri glacier , et nous nous abandonner avec le ( est ) kulti himal . \nwladimir tschernezky , le peut-être que la notion de ,yeti ' scientifiques , a été étudiée , verglich cette mystérieuse vivants avec le maintenant ausgestorbenen gigantopithecus . \nc' est peut-être un homme pense plutôt comme un ,yéti ' . \nles , qui les indigènes , surtout les sherpas , en face du yeti ressentons est due à ses instincts pillards et à son intelligence . \ntschernezky a confirmé , de même que nos kulti-spuren une très grande ressemblance avec les années précédentes , authentischen récits de photos et d' ascensions ... \n» le l.w.davies , le fliegeroffizier courageuses , le « juron s' échappait de la lächerlichkeit » n' a pas . \ndeux bonnes , très significatives . \npersonnellement , je suis après comme avant l' avis que , avec le cri « ours ! \n» et , avec quelques remarques ironiques le « schneemenschen-problem » ne sera pas résolue . \nvoir aussi ralph izzard : \nthe abominable snowman adventure , london : \n& hodder and stoughton 1955 ) . \n13. l' année 1955 , est aussi les « ) , sous la hamish mcarthur dans . \ncomme le rapport ( « the alpine journal , n° 293 , p. 279-295 ) montre , ne fut pas seulement les grimpeurs , mais aussi un . \n... magnifiquement panoramas , jolie photos , une très granitiques kammverlauf-karte et une bibliographie de 55 numéros portent très nettement à la connaissance de ce jusqu' à un peu stiefmütterlich traitaient la région . \nl' altitude des montagnes se tiennent entre 5800 et 6300 m. ce sont donc pour himalaya-verhältnisse assez modeste des montagnes , pas überalpin , mais simplement alpin , mais paysage attrayant et , en partie , encore peu connu - un bon champ d' activité pour klein-expeditionen , les pas beaucoup de temps et d' argent . \n14. appliquer à la géologiques , particulièrement intéressante région voisine du spiti , les « par l' expédition de cambridge fossiles . \nau-dessus , le rapporte trevor braham ( « the alpine journal , n° 293 , . \n296-309 ) . \nle résultat de deux petits six mille de et de nombreuses traversées de cols . \n15 15. du karakorum le groupe du sasir kangri ( 7672 m ) , dans la grande boucle du fleuve shayok , constitue l' aile sud-est . \nce massif d' la première expédition du couple visser-hooft en 1922 . \naprès une longue pause - 1946 - , une expédition britannique conduite par j. o. m. roberts leur chance , mais si peu de succès , bien que tous les candidats au karakorum se désistèrent . \ncomme le sasir kangri se trouve dans la partie indienne du cachemire , il était pour le « himalayan mountaineering institute de darjiling un intérêt particulier . \nsous la conduite du montagnard expérimenté qu' n.d. major jayal aurait une nouvelle tentative fut faite en 1956 , mais cette fois , c' est en vain . \nles détails ne sont pas encore connu ; \nquoi qu' il en soit , mais fut annoncé que jayal aurait déclaré cette montagne . \nbien qu' encore pas un huit mille , c' est certainement un dur morceau . \n16. un des sommets les plus hardis du karakorum est la baltoro-gletschers située sur le versant nord de la tour de muztagh ( 7273 m ) . \npour la plupart , de la célèbre photo rapportée par vittorio sella en 1909 , il s' agissait cette presque als symbole , comme verkörperung du marche . \nmais j' ai déjà 1939 dans mon « baltoro ( bâle : \nbenno schwabe , basel ) sur s.66/67 écrit : \n« quand on la regarde du glacier supérieur de baltoro , il est presque , mesurés à une ascension auch nur songer . \nbei à la considérer de plus près , mais se montre , à mon avis , une chance : \nles parois , il est vrai , sans espoir . \nl' arête se , qui porte le ,blacktooth ' , n' est pas encourageante . \nmais le west- ou , plus exactement w.nw - est peut-être possible . \nle col au pied de l' arête w du chagaran-gletscher il faudrait chercher à atteindre . \n» exactement sur cette route , j' ai jadis , fut proposé de la tour de muztagh maintenant par une expédition britannique , sous la conduite de j.hartog submerge , et même de deux cordées les 6 et 7 juillet 1956 . \nles erfolgreichen bergsteiger étaient : \nhartog , j. brown et i. mcnaugh-davis . \ndu dernier camp ( 6400 m ) , ils ont atteint le sommet par l' arête ouest ; \nles deux cordées durent bivouaquer à la descente , ce qui valut à hartog de graves gelures . \n17. si incroyable que cela sonne , quelques jours plus tard , la tour de muztagh fut de nouveau gravi , et par le plus difficile encore l' arête sud-est par une expédition française . \nle chef en était guido magnone , dont le nom de avec la paroi ouest des drus , le cerro fitz roy , le makalu et de nombreux autres de la plus grande et plus difficiles ascensions verknüpft est . \nles autres participants étaient : \nandré contamine , paul keller , robert paragot et le médecin françois florence , comme officier de liaison pakistanais cwpt.ali .usman . \nle 31 mai , on était dans d' askole , le 2 juin , il aurait à bardumal ( « bagdomal » ) , presque une catastrophe , comme une puissante appels tout le camp de la terre , le 5 juin fut atteint à urdokas . \nc' est là que magnone apprit que l' expédition britannique , la meilleure équipe qu' on pût mettre sur nos jambes , se trouvait dans la tour de muztagh terminés , et déjà , avait une avance considérable . \ndepuis deux semaines , les anglais , les au-dessus de mustagh- et chagaran-gletscher étaient montés en tentative à l' arête ouest , et ils étaient déjà très haut sur la montagne . \npour les français une délicate situation : \nla voie des anglais suivre , n' entrait en ligne de compte . \non voulait , les en ces si loin en avant , dass sie que de toutes façons , sur le sommet . \nles français ne pas cher un autre but bergsteigerisches au glacier supérieur de baltoro ? \nmais on ne daraufwar préparé , et les porteurs avaient aussi , en revanche , pas assez de vivres . \nfinalement , on était oui , cette fois-ci dazu ausgezogen , techniquement difficile de problèmes . \nil fut donc décidé , les autres faces de la tour , aller s' il sur l' arête nord , ou peut-être , sur le versant sud , une voie possible . \nle mauvais temps et une grève des porteurs - combien d' expéditions ont eu de graves ennuis avec les baltis ! \n- retardèrent l' expédition de quelques jours . \nce n' est que le 12 juin , le camp de base fut installé à 4500 m environ , sur le moyen younghusband-gletscher ( aussi biange-gletscher genannt ) , où se trouve la branche orientale et le occidental réunissent , donc au pied de l' arête sud-est du « noires dent » ( 6719 m ) . \nnun commencèrent les reconnaissances : \nla première excursion les conduisit par la branche orientale au point le plus bas ( 5600 m environ ) , entre le mont steste et la tour de muztagh , donc au pied de sa prétendue » . \nquelle déception ! \nil n' y a pas d' arête , n' est qu' une au moins 1600 m de hauteur , effroyablement raide , balayée par les avalanches , la plus pure . \nretour donc au camp de base . \nle 17 juin , on réussit à travers les 900 m de la chute de seracs du glacier ouest , donc sur le versant sud du black tooth » , de trouver un passage , et fut commencé immédiatement , le câble de 300 m , dans la partie inférieure de la séraczone zu tendons et une il sur un nez rocheux au-dessus du glacier , que là ... il neigeait pendant dix jours . \nle seul ce qu' on put , était une visite à la « concurrence » sur l' autre versant de la montagne , pour la verstimmung par une large de prononciations se . \nanglais et français se séparèrent en bons camarades . \nenfin , le ciel s' éclaircit , avec toutes les forces , on fit à l' œuvre , aussi les hunza-träger taten leur splendide , et à la fin de juin le camp 1 ( 5100 m ) , le 2 juillet le camp 2 ( 5400 m ) . \nle camp 3 ( 6000 m ) dut sur l' éperon rocheux , la du black tooth » . \ncette distance entre le camp 2 et 3 était un böses morceau , à droite , malgré 400 m de cordes fixes , environ si difficile que la face nord des courtes , sur la rive gauche de la menace des . \nle allerschlimmste mais était la « grande pyramide au-dessus du camp 3 , un ressaut rocheux vertical , une épaisse couche de glace de 200 m auflag , et cette paroi a barré la voie d' accès au sommet dans toute sa largeur . \nil y avait là qu' une seule possibilité de durchkommens , tout à droite , et la descente est faite d' une terriblement raide hohlkehle . \nplusieurs jours de besogne acharnée et 300 m de cordes fixes . \nce n' est qu' au matin du 6 juillet , c' était si loin : \nils se dressaient , au-dessus de la paroi de glace , sur un petit glacier suspendu . \nle dr florence , le bergtüchtige médecin de l' expédition , et les deux meilleurs hunzas , aminula et gerikhan , les jusqu' ici des nôtres waren und wacker est hatten , demi-tour , et en arrière , ne restèrent que les quatre alpinistes de la cordée . \ndans brütender chaleur , ils battîmes avec neige farineuse où la neige profonde , de la place pour le camp 4 ( 6300 m ) . \nau-dessus d' eux se dressait la tour encore de 1000 mètres de haut , dans une raideur telle qu' elle fait hocher la tête . \nla seule voie , était l' arête sud-est . \nle 7 juillet , robert paragot tout à coup deux petits , qui se là-haut vers le ciel abzeichneten : \nles britanniques arrivaient au sommet . \nles français et ne se laissèrent pas décourager . \nen avant ! \nle fil de l' arête sud-est , est extrêmement difficile . \nles deux premières longueurs de corde au-dessus de la rimaye - le 7 juillet - hatten heures d' efforts , 250 mètres de dénivellation , requirent deux jours . \nsix heures de cramponnage à la limite de l' équilibre , des dalles verglacées surmontées à l' , ils purent enfin dans une brèche de l' arête . \nce fut certainement une des plus dures escalades qu' on ait faites jusqu' ici dans l' himalaya et à cette altitude . \na midi , le soleil disparaissait derrière nuages épais . \nsur l' arête , suivit une brèche profonde de l' autre , il fit aussi lentement , dass sie , à 16 heures , ce n' est que cent mètres dans le hori- zontale avaient pu , maintenant , il commence à neiger encore , donc ... retour au camp 4 ! \ntout ce qui leur encore de cordes , était resté , fut pour la descente dans la paroi . \ndeux jours , ils durent attendre maintenant dans la tente . \nle soir du 10 juillet , le ciel s' éclaircit , et le 11 juillet , le matin , ils commencèrent à l' attaque . \ngrâce aux cordes ging es jusqu' à la brèche de l' arête très flott , mais quand ils nouvelles traces , ils durent enfoncions jusqu' au milieu des cuisses un . \ndes tours sperrten verticale , le chemin . \nà gauche , des dalles , à droite , la neige et corniches au-dessus de la younghusband-gletscher . \na 16 heures , ils étaient au pied de la troisième et dernière grande tour , et derrière lui parut - il semble à portée de main , le sommet , mais , en vérité , ils n' avaient pas encore de la 6900-m-linie traversé . \nil était temps , une place de bivouac , deux étroites banquettes , où il . \nla vue du k2 par le broad peak , les gasherbrums et hidden peak , jusqu' à l' arrogant masherbrum , mais il fut , en passant nuit . \nle 12 juillet - c' est dans un ciel où rampent des , il faut se hâter . \nmais derrière le grand gendarme , la neige mou , aucun de toute la cordée a relais sûr , la trace devient un fossé profond , l' homme à la pointe se furette 30 , ou tout au plus de 40 mètres de montée , puis , sans dire un mot , et , à côté de nous , le lendemain pour faire place à . \nenfin , à 13 heures ... le sommet , si étroit qu' on peut à peine , et , après quelques instants croisements , la descente , car , depuis une demi-heure , il a déjà ! \nla descente est une course contre la nuit , mais en vain : \nquand ils sont dans la brèche , il est déjà complètement nuit . \nils se un rappel de 50 m pour atteindre les cordes fixes . \na tâtons , sous des rafales de neige épaisse , ils se travaux . \nils sont maintenant sous la rimaye , le dr florence . \nenfin , . . . \nle camp 4 ! \nlorsque , le 19 juillet sur les baltoro-gletscher , ils furent par le dr patey , le médecin de l' expédition anglaise , salue , le l' aide de son collègue français , à la manière de hartog demanda . \nles gelures aux pieds du chef de l' expédition britannique les anglais attendaient depuis quelques jours à urdokas . \nde cette magnifique emplacement , déjà pour autant de baltoro-unternehmungen a joué un grand rôle , maintenant assis , les membres des deux « konkurrenz»-expeditionen dans toute l' amitié à un festlichen repas et s' etaient du double succès obtenu sur l' un des plus beaux et des plus difficiles himalaya-berge . \nréférences : \nguido magnone : \nla tour de mustagh . \n« la montagne » , octobre 1956 , p. 261-270 . ) \n18. dans mon livre baltoro ( 1939 , j' avais une tentative du gasherbrum ii ( 8035 m ) chaudement recommandé . \ndans le « der dritte pol » ( 1952 ) : \n« le gasherbrum ii n' est pas facile , mais probablement possible et relativement sûr . \nje n' aurais sur l' expédition internationale de 1934 avait eu de bons porteurs d' altitude ; \npuis j' aurais sérieusement . \n» le prenait la österreichische himalaya-gesellschaft » à vienne à cœur et en 1956 , une baltoro-expedition avec ce but . \nl' équipe de six alpinistes et deux deux : \nfritz sepp larch , hans ratay ( photographe ) , richard reìnagl , heinrich roiss et hans willenpart .comme médecin le dr georg weiler , le dr erich traugott gattinger comme géologue . \nsur la base des expériences faites dans un camp d' entraînement , on choisit reform-ernährung , ce qui le poids des bagages . \nla prise dans le pakistan était très simples , mais malgré tous de solidarité des autorités , les autrichiens durent attendre neuf jours à rawalpindi , jusqu' à ce que le temps de leur vol avec le ge^ leurs bagages de skardu gestattete ; \ncar ce paysage unique vol juste au nanga parbat et par l' étroite industal est considéré comme l' une des plus dangereux luftrouten überhaupt et ne peut qu' à une proprete vue hasardeuse . \nc' est pourquoi skardu , la capitale du baltistan , ce n' est que le 27 avril . \nquain ali shah , les charges sur 27 kg . \nles tarifs des porteurs ont fortement augmenté aussi au pakistan . \ndans les régions habitées , reçoit un « 3 roupies ( 2 fr .70 ) par jour et de pourvoir lui-même à son entretien . \nau-dessus d' askole ( 3050 m ) , le salaire journalier monte à 4 roupies ( 3 fr .60 ) , et la nourriture des charges à l' expédition . \nde skardu à askolé les autrichiens utilisèrent 168 coulies et , de là , à cause des vivres 263 hommes . \na païju , la dernière oasis avant le baltoro-gletscher , les porteurs réussirent , les souliers que le règlement . \non avait 250 paires , mais malheureusement la voie normale , d. h. européenne forme . \nj' ai déjà souvent , signalons que pour les porteurs himalayens il faut principalement des pointures 42-44 ( que quelques numéros 41 et 45 ) , mais très larges ! \nle est malheureusement toujours , ce qui conduit de grands désagréments . \nle oberleder ( les steifkappe ) dut être aufgeschlitzt , afin que les pauvres types puissent y introduire leurs pieds ( non défigurés par des chaussures européennes , large de ! ) . \nbien sûr , il y eut de pieds blessés , et le médecin de l' expédition passait des heures à panser les écorchures blut- et les ampoules . \nà urdokas ( 4057 m ) , il y eut la grève habituelle , de l' baltoro-expedition n' a pas encore est resté , mais par le energische intervention de l' officier de liaison , bientôt de nouveau les choses en ordre . \ntoutefois 68 charges durent sous la garde du second assistant pakistanais , l' étudiant hayat ali shah , d' abord à urdokas . \nle gros de la troupe monta en trois étapes à la célèbre concordia-platz concorde , dans une tempête de neige . \nmaintenant , la plupart des « il ne tiennent plus , et la plupart abandonnèrent pour rentrer dans leur village . \n68 hommes , après de longues tractations prêts , les colis du dépôt d' urdokas à concordia . \nentre-temps , les autrichiens , pendelten avec onze balti-hochträgern ( « balti-tiger » ) à leurs charges plus à la place , où mes « i. h. e. » ( expedition internationale ä l' hi ) 1934 leur camp de base ( camp 4 ) avait eu , donc au pied du versant sud du gasherbrum vi ( 7190 m ) , à la talecke , où la « abruzzi glacier » au baltoro proprement dit . \npour les autrichiens , c' était un seul camp intermédiaire , parce qu' elle leur base oui à l' influence du « glacier sud » dans les « abruzzi-gletscher » , il fallut établissons , environ là où , en 1934 , le camp 5a ( 5250 m ) , la i.h.e , sur la moraine , avait posé . \nle 25 mai , les premiers grimpeurs et porteurs là un . \naprès une akklimatisierungsperiode seulement , un chemin à travers les très zerrissenen « gasherbrum-gletscher »zum pied sud du gasherbrum ii reconnue . \ndans la partie supérieure de la traction de deux gratrippen par le steilwandgürtel à la grande terrasse du gasherbrum ii . \nj' avais l' éperon se rocheuse , à droite , en recommandé , parce qu' il est tout à fait à l' abri des avalanches . \nles autrichiens cependant se décidèrent pour l' éperon sudouest probablement un peu plus facile , et à son pied , à environ 6000 m de leur camp i. , le 11 juin , les premières charges hingeschafft , le 13 , 15 et 17 juin était le pendelverkehr en pleine mue . \npuis , retint , avec de fortes chutes de neige , les alpinistes au camp de base . \nce n' est que le 30 juin , ils purent de nouveau au camp i et constatèrent , à leur extrême consternation que , entre-temps , une énorme avalanche presque tous les matériel déposé là . \nils avaient le place pour cru : \nebener glacier - et les pentes darüber étaient en terrasses . \nmais la grande himalaya-lawinen courir eben de vastes étendues même sur un terrain plat . \nil suffit de rappeler ici la catastrophe de 1937 au nanga parbat , les 16 morts . \ncette fois , il avait heureusement - car le camp n' était occupé -keine coûté tant de personnes , mais une grande partie des principaux d' équipement et de vivres , lag cinq à dix mètres de profondeur , sous une avalanche . \ndeux jours durant , tranchées et des puits ausgehoben , pour un peu moins par les unersetzlichen tentes , de cordes , de la « ferraille » , vivres , etc. montagnes , mais toutes les peines , c' est en vain . \nque faire ? \nsi l' on ne voulait pas s' avouer battu , on dut tout le programme et accepter les risques d' une campagne-éclair : \nratay et roiss , le 2 juillet la tranche entre le camp i ( 6000 m ) et le camp ii ( 6700 m ) , et beaucoup stufenarbeit praticable à était et de cordes fixes . \nle 3 juillet , larch et reìnagl vers le camp ii et le 4 juillet une trace de la haute montagne , jusqu' à une épaule , la place pour le camp iii ( 7150 m ) . \ncette ascension était pour les quatre porteurs d' altitude , les le 6 juillet supplémentaires furent ici , une rude travail , mais les balti-tiger se tenaient très courageuse et - transportées par leurs sahibs bien assuré - leurs lourdes charges jusqu' à l' épaule . \nmais ils étaient alors très abattus . \nla pente suivante , très raide et avait une édition de neige poudreuse . \nici aussi , pour utiliser les porteurs , si la pente dans vieltägiger soigneusement rangée de travail , et , en revanche , pas le temps . \nles grimpeurs durent donc ici , de leurs charges nous-mêmes porter , ce qui fut à l' origine , la suppression du camp iv à renoncer et d' un bivouac élevé à l' assaut de la voiture . \nle 6 juillet , tandis que reinagl assurait la descente des porteurs , morawec , chef de l' expédition , larch et willenpart avec de lourdes , entamaient la montée . \nla couche de neige sur la glace rendait tout assurage illusoire ; \nc' est pourquoi ils passèrent seilfrei , pour se gêner réciproquement . \na 20 h. 30 ils étaient à 7500 m environ , au pied de la pyramide sommitale et se installâmes sous un bloc de rocher pour la nuit . \nchacun se glissa dans son dralon-schlafsack facile ; \nils disposaient en outre d' un . \nce fut une nuit froide féroce , si bien qu' il trop léger de gelures , larch , sur les orteils , morawec au mains . \nenfin , il fut clair . \ndu lait chaud et un peu de weizenkeimbrot mussten que de vivres pour toute la journée . \nune traversée en écharpe sous la paroi sud-est du gasherbrum ii beaucoup de peine . \nce n' est que peu avant 9 heures quand ils atteignirent une petite brèche ( 7700 m environ . \nc' est la chaîne entre le baltoro et le shaksgam , et la ligne de partage des eaux entre l' indus et le tarim , l' océan indien et les de l' asie centrale . \nencore 335 m jusqu' au sommet . \ndans la paroi de glace très raide , la neige était par les rayons du soleil matinal , déjà ramolli la trace un terrible strapaze . \ntous les quelques pas , ils durent se reposer , et après l' air de lutte . \ninferieurs , ils luttaient s' , mètre par mètre . \nle dernier obstacle fut un ressaut rocheux et - le 7 juillet , à 13 h. 30 , ils foulèrent le sommet du gasherbrum ii ( 8035 m ) , un petit une , le de deux à peine mannshohen est couronné de pointes . \nils s' affalèrent épuisés dans la neige . \nce n' est qu' après un certain temps , ils furent en les rites obligés du culte des sommets : \npiolet avec le österreichischen et le pakistanais , des banderoles , la construction d' un steinmanns , ersteigungsdaten dans une cartouche de vides , muttergottes-medaillon , etc. c' était si chaud , qu' ils purent même l' anorak ôter et , une heure au sommet . \nle temps était radieux beau , la vue claire jusque dans le lointain . \nla descente s' est déroulée lisse , et bien qu' il se mit à neiger de nouveau le soir , ils étaient a 19.30 h. dans le camp iii ( 7150 m ) . \nle jour suivant , au camp ii , ils furent par le porteur salue avec enthousiasme et de la tempete . \nil est très réjouissant , dass es maintenant - sauf le fameux sherpas et de la partie raison bons hunzas - aussi sous les baltis , les hommes se développer authentique alpinistes et « krischauff à une promesse . \nle gasherbrum ii est le troisième huit mille , les autrichiens inscrivent à leur tableau : \nmassif du nanga parbat , cho oyu , gasherbrum . \ncette bewunderungswürdige succès console la österreichische himalaya-gesellschaft » à vienne on espère qu' un peu au-dessus d' une amère déception : \ndouze jours après l' escalade du gasherbrum n , donc le 19 juillet 1956 , trois membres de la « expédition autrichienne himalaya-karakorum 1956 » - hans ratay , heinrich roiss et le dr georg weiler - la deuxième ascension du sia-kangri-westgipfels ( ca.7315 m ) . \nla première ascension fut le 3 août 1934 quatre membres de la « internationale himalaya-expedition 1934 » ont réussi à - hans erti , albert höcht , mme hettie dyhrenfurth et g.o.dyhrenfurth . \nc' était la connaissances , en deux livres ( voir en bas ) et dans la littérature alpine , souvent besprochene course sur la un « record féminin d' altitude » . \nje nos nachfolgern - après 22 ans - volontiers leur succès nous féliciter cordialement , mais ... ils ont malheureusement cru , la première ascension d' un encore tout à fait inconnu et de 7729 m de la montagne , ils ont ce sommet « austria-peak » et dans la « österreichischen touristenzeitung » de janvier 1957 aussi toutes sortes d' erreurs , sinon publiées , dont sachliche rectification inévitable est : \n( 1 ) comme est la cote exactement les traînées qui troublaient échange de 7729 m ? \npar une ( d' ailleurs pas tout à fait korrekte ) umrechnung de 25 350 pieds . \nla cote , les depuis 1917 sur tous les karakorum-karten steht , mais est 24 350 ft . \n= 7422 m , et c' est justement la cote chiffre officiel du « queen mary peak » qui , depuis 1938 officiellement sia kangri . \n( 2 ) la cote 7422 m sur les trigonométriquement par le topographe c. grant peterkin ( expédition bullock-workman 1912 ) et se probablement sur le sommet principal du rapporte . \nles « expédition internationale de 1934 » a pour tous les quatre . \nle sommet ouest est bien 100 m plus bas que le sommet principal , soit 7315 m. c' est le point culminant , que les autrichiens ont atteint lors de leur deuxième ascension . \n( 3 ) une depuis des décennies , se bestiegener et de la « karakoram conference » officiellement sia kangri benannter montagne , naturellement , ne doit pas sans raison umgetauft soudain . \nle nom de « austria-peak » est donc de nouveau tout d' assu sec - même si staatspräsident iskander mirza , à raison de ces conditions tout irriger fêtait genehmigt a ( 4 ) la large selle entre le baltoro kangri ( auparavant « golden throne » , 7312 m ) et le sia kangri est le depuis une demi-heure de siècle bien conway saddle ( 6300 m ) , le de l' expédition composée italien ( duc de spoleto , le professeur desio ) 1929 visité à plusieurs reprises et ont été mesurés , c' est la « expédition internationale de 1934 » avait en conway-sattel même pendant leur oberes camp , et elle a oui , de là , tous les sommets du sia kangri et l' arête sud-est du baltoro kangri . \nc' est vraiment cela me rappelle quelque chose , si maintenant de 1956 , trois touristes qui , de tout le n' a aucune idée de descendre , comme première , ce col foulé zu haben . \nau surplus , naturellement , est le ! \nd' ailleurs , c' est le conway-sattel pas entre le baltoro et le siachen , mais entre le baltoro et kondus-gletscher . \nc' est le fleuve de glace , sur les on par le col . \nla siachen-gletscher est situé plus à l' est , comme il est . \nnouvelle est seulement que les autrichiens pas les de la « expédition internationale de 1934 » répété répétée et relativement sûre « mittelrippe » utilisée haben , mais probablement à gauche de notre route à travers la paroi abrupte et sur plusieurs de la haute montagne sommes montés , donc une nouvelle , dangereuse variante sur les sia-kangri-westgipfel ont fait . \nbei aller reconnaissance de cette performance reste complète de la valeur de l' ignorance de littérature correspondante . \nréférences : \ng.o.dyhrenfurth : \ndémon de l' himalaya » ( bâle : \nbenno schwabe , basel 1935 ) . \n- g.o.dyhrenfurth : \nbaltoro ( ibidem 1939 ) . \n- heinrich roiss : \n- première ascension des austria peak m ) 7729 m. oesterr. touristenzeitung , 70. année , folge 1 , vienne , dans jänner 1957 ) . \n19. le rakaposhi ( = « drachenschwanz » ) ( 7788 m ) , situé non loin de gilgit , le un aérodrome a de bonnes verkehrslage , c' est tout ce que la splendide montagne à la limite du hunzalandes déjà attaqué fut si souvent , qu' aucun autre 7000 m , mais toujours jusqu' en vain . \nen 1956 , une expédition anglo-américaine sous la conduite du capt . \nm.e.b.banks de nouveau , mais seulement jusqu' à environ 7000 m. le rakaposhi n' est pas facile , et le temps semble tout particulièrement mauvais . \n20. le mustagh ata ( = « père » ) ( 7433 m ) est une coupole en chinoise du pamir . \naprès les stériles tentatives de sven hedin - qui n' était - en 1894 , on hess de ces facile « 7000 » fut laissé longtemps en repos . \nce n' est qu' en 1947 , se tournèrent vers e.e.shipton et h. w.tilman sur la gipfel-kalotte , mais pas jusqu' au , encore très éloigné horizontalement -höchsten point . \nle , le 26 juillet 1956 par une grande expédition sino-soviétique sous la direction de m.beletski .cinq camps furent installés , le dernier à 7200 m. \n21. au nord du mustagh ata , aussi , le ostrande du pamir , se trouve le kongur debe ( 7681 m ) , de loin et large de la plus haute montagne qui , fortement massif aires de himalaya-charakter , se prolonge beaucoup plus difficile que son débonnaire voisin . \nle 19 août 1956 , il fut de six russes et deux chinois , les moyens techniques de l' alpinisme moderne - aussi à l' oxygène . \npas encore de récit circonstancié . \n22. nous les domaines de l' himalaya et du karakorum avons déjà quitté , de toute façon , nous jetons encore un coup d' oeil sur les plus hautes montagnes de l' urss : \npic de pics lénine ( autrefois pic kaufmann ) , 7134 m , première ascension en 1928 par e. schneider et k.wien ;souvent visités depuis par les alpinistes soviétiques . \nkhan tengri ( prince des esprits ) , 6995 m , d' après la , faites donc un sept mille , de plus en tien-schan ( montscélestes ) . \npremière ascension 1931 par m.t.pogre-bezki , f. sauberer et b.tjurin depuis , si en 1936 par le bâlois lorenz saladin . \npik stalin ( ancien garmo ) , 7495 m , dans l' alaï pamir . \npremière ascension en 1933 par e. m. abalakow . \nabalakow depuis visiteurs . \nsouvent visité depuis .pik korzhenewskaya , 7105 m , dans l' alaï pamir , à 15 km du pik stalin , a été gravi qu' en 1953 . \nle point culminant du tien-schan et apparemment la deuxième montagne de l' urss est pik pobjeda ( ) , 7439 m , découvert et mesuré en 1943 seulement . \ncette pour nous occidentaux quelque peu mystérieuse , est encore intacte ; \nles premières grand' n' ont jusqu' à une altitude de 7000 m. environ . \nréférences : ? \n, . \nbibliographie : \nmountaineeringintheü.s.s.r.«the alpine journal , n° 293 ( nov . \nen 1956 , p. 310-329 ) . \nconsidérons encore une fois la liste et l' état actuel des « 8000 » . \nont été gravis jusqu' à ce jour : \n1. 1950 : \nl' annapurna i , 8078 m. chef d' expédition m.herzog ;équipe du sommet m.herzog et l.lachenal . \n2. 1953 : \nmount everest , 8848 m , chef j. hunt ;équipe du sommet e. p. hillary et tensing norkay . \n3. nanga parbat , 8125 m. chef k.herrligkoffer ;h.buhl a atteint le sommet en solitaire . \n4. 1954 : \nk2 , 8611 m , chef a. desio ;équipe du sommet a.compagnoni et l.lacedelli . \n5. cho oyu , 8189 m ( ? ) , chef h.tichy , un sommet h.tichy , s.jöchler et pasang dawa lama . \n6. 1955 : \nmakalu , 8481 m. chef j. franco , cordées du sommet l.terray-j.couzy , j.franco- g. magnone-gyalzen norbu , j.bouvier-s.coupé-p.leroux-a . \nvialatte . \n7. kangchenjunga , environ 8597 m. chef ch . \nevans , g. band-j cordées du sommet . \nbrown , n. hardie-t . \nstreather . \n8. 1956 : \nle lhotse , environ 8510 m. chef a.eggler ;équipe du sommet e. reiss-f . \nluchsinger , ensuite le mont everest , j. marmet-e cordées du sommet . \nschmied , h.von gunten-a . \nreist . \n9. manaslu , 8125 m. chef y. maki , cordées du sommet imanishi-gyalzen , kato-higeta . \n10. gasherbrum ii , 8035 m. chef f.morawec ;équipe du sommet h. larch-f . \n« da waren's encore quatre » de huit mille encore vierges , c' est le dhaulagiri ( 8222 m ) , dans le népal , shisha pangma ou gosainthan ( 8013 m ) , dans le tibet , hidden peak ( 8068 m ) et broadpeak ( 8047 m ) dans le karakorum pakistanais ( baltoro-gebiet ) . \nshisha pangma se dresse derrière le « outre « rideau de fer » , et elle doit donc encore quelques temps de rester vierge , mais sur les trois autres a depuis longtemps déjà , un énorme assaut dans le domaine de la politique - c' est pour obtenir une autorisation pour 1957 , schlimmstenfalls pour 1958 . \n« je de cœur , que cette « marché des huit mille » baldigst terminée sein möge , damit nationale et persönlicher ambition abklingen peu à peu , pour le bien-être authentique bergsteigertums et calme de travail scientifique ! \n« un politique - vilaine chanson ! \n- fi donc ! \nune chanson politique ! \n» les nouvelles prescriptions du gouvernement népalais pour les expéditions étrangères - de kathmandou - scrupuleusement traduites , disent ceci : \n1. les expéditions ont un officier de liaison népalais , qui leur sera attribué par le gouvernement du népal . \n2. l' officier de l' expédition payera roupies ( = 180 francs suisses ) . \nen outre , il est assurera et avec nos sacs de couchage et de tous les autres tout l' équipe pendant la expeditionsdauer . \n3. l' expédition a tous les frais de voyage de l' officier de liaison , à partir de kathmandou et . \n4. l' expédition a leur activité exclusivement sur la montagne ou à la région , pour les ils l' autorisation par le gouvernement du népal . \n5. le gouvernement népalais peut en retirer , si elle se croit que le comportement ou de l' activité de l' expédition sont indésirables . \n6. a son retour , l' expédition le gouvernement du népal un rapport exact sur son activité . \n7. l' expédition a un plan précis , à unterbreiten qui , à l' intérieur de la voie du népal , doit être parcourue . \nces elle s' en tiendra strictement , lors de la marche d' approche et de tenir . \n8 expéditions d' emporter des appareils de transmission , armes , munitions , il est interdit , que le gouvernement du népal pour but une des . \n9. l' expédition doit , ce qui ne rien faire ou permettre aux sentiments religieux et les mœurs et usages des populations autochtones pourrait blesser . \n10. en cas d' accident , l' expédition au blessé ou de la famille du défunt une indemnité proportionnelle aux circonstances comme les conditions sont . \nles isotopes d' une lebensversicherung est en préparation . \nentre-temps , diene que norm que , pour un officier de 5000.- , pour un porteur roupies népalaises . \n11. tout ce qui , au cours de l' expédition fut recueilli , est le gouvernement du népal , doit avant que l' expédition soit autorisée à quitter le pays . \ncopies de toutes les photographies prises au cours de l' expédition doivent être soumises au gouvernement , avant que quelque chose ne soit . \n12. autorisation pour une expédition au gouvernement , une abgabe de 500 à 3000 roupies indiennes ( soit jusqu' à 2700 francs suisses ) . \n13 les nouvelles sur l' activité de l' expédition ( par exemple succès , échecs , accidents , etc. ) ne peuvent bénéficier du copyright . \nseuls sont libres les renseignements personnels . \ntout est le gouvernement du népal , doit quelque part , avant qu' il ne soit . \n14. toutes les demandes d' autorisation pour une expédition dans l' himalaya népalais sont , par le gouvernement du antragstellers confirmer et le gouvernement du népal . \nces nouvelles prescriptions sont déjà en vigueur . \nil fut même annoncé qu' une zone de 50 milles ( 76 km ) , le long de la frontière tibéto-népalaise , sur le versant népalais devait être fermée . \ncette « zone interdite » inclurait presque le népalaises et pratiquement chaque du népal ausgehende himalaya-expedition sinnlos machen . \ncette nouvelle alarmierende n' est pourtant pas encore confirmée et probablement pas très zutreffend , car le gouvernement du népal est à la « fremden-industrie » , ce qui nous intéresse et ne sait très exactement que chaque himalaya-expedition une masse de l' argent et sachwerte dans le pays . \ntoujours est-il que les nouvelles conditions , qui ont été attestées à plusieurs reprises , très dures . \nles articles 11 et 13 articles se révèle être un lourd sabot . \nle chef de l' expédition , peut-être pleinement responsables des milliers de vu de photographies ( schwarzweiss et en couleurs ) et de nombreux filmrollen ( illustration et de ton ) , de kathmandu , et plus par les autorités , zensurieren jusqu' à sa ausreise du népal gnädigst l' ? \nil n' est pas jedermanns sache , irréalisable en fait à signer . \n« corde trop tendue casse . \n» après la première ascension du dhaulagiri , du dernier achttausenders népalais , le karakorum fortement dans le dos , et le gouvernement de rotchinesischen - et aussi par des indiens sei - n' a pas si bien expédition dans les dernières années , de compréhension et de solidarité . \n" }, { "path": "tests/inputs/issues/183/file.fth", "content": "\\ https://github.com/philburk/pforth/fth/file.fth\n\\ READ-LINE and WRITE-LINE\n\\\n\\ This code is part of pForth.\n\\\n\\ The pForth software code is dedicated to the public domain,\n\\ and any third party may reproduce, distribute and modify\n\\ the pForth software code or any derivative works thereof\n\\ without any compensation or license. The pForth software\n\\ code is provided on an \"as is\" basis without any warranty\n\\ of any kind, including, without limitation, the implied\n\\ warranties of merchantability and fitness for a particular\n\\ purpose and their equivalents under the laws of any jurisdiction.\n\nprivate{\n\n10 constant \\N\n13 constant \\R\n\n\\ Unread one char from file FILEID.\n: UNREAD { fileid -- ior }\n fileid file-position ( ud ior )\n ?dup\n IF nip nip \\ IO error\n ELSE 1 s>d d- fileid reposition-file\n THEN\n;\n\n\\ Read the next available char from file FILEID and if it is a \\n then\n\\ skip it; otherwise unread it. IOR is non-zero if an error occured.\n\\ C-ADDR is a buffer that can hold at least one char.\n: SKIP-\\N { c-addr fileid -- ior }\n c-addr 1 fileid read-file ( u ior )\n ?dup\n IF \\ Read error?\n nip\n ELSE ( u )\n 0=\n IF \\ End of file?\n 0\n ELSE\n c-addr c@ \\n = ( is-it-a-\\n? )\n IF 0\n ELSE fileid unread\n THEN\n THEN\n THEN\n;\n\n\\ This is just s\\\" \\n\" but s\\\" isn't yet available.\ncreate (LINE-TERMINATOR) \\n c,\n: LINE-TERMINATOR ( -- c-addr u ) (line-terminator) 1 ;\n\n\\ Standard throw code\n\\ See: http://lars.nocrew.org/forth2012/exception.html#table:throw\n-72 constant THROW_RENAME_FILE\n\n\\ Copy the string C-ADDR/U1 to C-ADDR2 and append a NUL.\n: PLACE-CSTR ( c-addr1 u1 c-addr2 -- )\n 2dup 2>r ( c-addr1 u1 c-addr2 ) ( r: u1 c-addr2 )\n swap cmove ( ) ( r: u1 c-addr2 )\n 0 2r> + c! ( )\n;\n\n: MULTI-LINE-COMMENT ( \"comment\" -- )\n BEGIN\n >in @ ')' parse ( >in c-addr len )\n nip + >in @ = ( delimiter-not-found? )\n WHILE ( )\n refill 0= IF EXIT THEN ( )\n REPEAT\n;\n\n}private\n\n\\ This treats \\n, \\r\\n, and \\r as line terminator. Reading is done\n\\ one char at a time with READ-FILE hence READ-FILE should probably do\n\\ some form of buffering for good efficiency.\n: READ-LINE ( c-addr u1 fileid -- u2 flag ior )\n { a u f }\n u 0 ?DO\n a i chars + 1 f read-file ( u ior' )\n ?dup IF nip i false rot UNLOOP EXIT THEN \\ Read error? ( u )\n 0= IF i i 0<> 0 UNLOOP EXIT THEN \\ End of file? ( )\n a i chars + c@\n CASE\n \\n OF i true 0 UNLOOP EXIT ENDOF\n \\r OF\n \\ Detect \\r\\n\n a i chars + f skip-\\n ( ior )\n ?dup IF i false rot UNLOOP EXIT THEN \\ IO Error? ( )\n i true 0 UNLOOP EXIT\n\t ENDOF\n ENDCASE\n LOOP\n \\ Line doesn't fit in buffer\n u true 0\n;\n\n: WRITE-LINE ( c-addr u fileid -- ior )\n { f }\n f write-file ( ior )\n ?dup\n IF \\ IO error\n ELSE line-terminator f write-file\n THEN\n;\n\n: RENAME-FILE ( c-addr1 u1 c-addr2 u2 -- ior )\n { a1 u1 a2 u2 | new }\n \\ Convert the file-names to C-strings by copying them after HERE.\n a1 u1 here place-cstr\n here u1 1+ chars + to new\n a2 u2 new place-cstr\n here new (rename-file) 0=\n IF 0\n ELSE throw_rename_file\n THEN\n;\n\n\\ A limit used to perform a sanity check on the size argument for\n\\ RESIZE-FILE.\n2variable RESIZE-FILE-LIMIT\n10000000 0 resize-file-limit 2! \\ 10MB is somewhat arbitrarily chosen\n\n: RESIZE-FILE ( ud fileid -- ior )\n -rot 2dup resize-file-limit 2@ d> ( fileid ud big? )\n IF\n .\" Argument (\" 0 d.r .\" ) is larger then RESIZE-FILE-LIMIT.\" cr\n .\" (You can increase RESIZE-FILE-LIMIT with 2!)\" cr\n abort\n ELSE\n rot (resize-file)\n THEN\n;\n\n: ( ( \"comment\" -- )\n source-id\n CASE\n -1 OF postpone ( ENDOF\n 0 OF postpone ( ENDOF\n \\ for input from files\n multi-line-comment\n ENDCASE\n; immediate\n\n\\ We basically try to open the file in read-only mode. That seems to\n\\ be the best that we can do with ANSI C. If we ever want to do\n\\ something more sophisticated, like calling access(2), we must create\n\\ a proper primitive. (OTOH, portable programs can't assume much\n\\ about FILE-STATUS and non-portable programs could create a custom\n\\ function for access(2).)\n: FILE-STATUS ( c-addr u -- 0 ior )\n r/o bin open-file ( fileid ior1 )\n ?dup\n IF nip 0 swap ( 0 ior1 )\n ELSE close-file 0 swap ( 0 ior2 )\n THEN\n;\n\nprivatize\n" }, { "path": "tests/inputs/issues/245/complex_regular_subexpression.scala", "content": "portion of finagle-base-http/src/test/scala/com/twitter/finagle/http/codec/HttpDtabTest.scala\nfrom finagle-finagle-17.11.0.tar.gz used to trigger \nComplex regular subexpression recursion limit (32766) exceeded\n\npackage com.twitter.finagle.http.codec\n\nimport com.google.common.io.BaseEncoding\nimport com.twitter.finagle.http.{Message, Method, Request, Version}\nimport com.twitter.finagle.{Dentry, Dtab, Failure, NameTree}\nimport java.nio.charset.Charset\nimport org.scalatest.FunSuite\nimport org.scalatest.junit.AssertionsForJUnit\n\nclass HttpDtabTest extends FunSuite with AssertionsForJUnit {\n val okDests = Vector(\"/$/inet/10.0.0.1/9000\", \"/foo/bar\", \"/\")\n val okPrefixes = Vector(\"/foo\", \"/\", \"/foo/*/bar\")\n val okDentries = for {\n prefix <- okPrefixes\n dest <- okDests\n } yield Dentry(Dentry.Prefix.read(prefix), NameTree.read(dest))\n\n val Utf8 = Charset.forName(\"UTF-8\")\n val Base64 = BaseEncoding.base64()\n private def b64Encode(v: String): String =\n Base64.encode(v.getBytes(Utf8))\n\n val okDtabs =\n Dtab.empty +: (okDentries.permutations map (ds => Dtab(ds))).toIndexedSeq\n\n def newMsg(): Message = Request(Version.Http11, Method.Get, \"/\")\n\n// test(\"write(dtab, msg); read(msg) == dtab\") {\n// for (dtab <- okDtabs) {\n// val m = newMsg()\n// HttpDtab.write(dtab, m)\n// val dtab1 = HttpDtab.read(m).get()\n// assert(Equiv[Dtab].equiv(dtab, dtab1))\n// }\n// }\n\n}\n" }, { "path": "tests/inputs/issues/280/L/hello_1.c", "content": "/* Hello World in C, Ansi-style */\n\n#include \n#include \n\nint main(void)\n{\n puts(\"Hello World!\");\n}\n" }, { "path": "tests/inputs/issues/280/R/hello_2.c", "content": "/* Hello World in C, Ansi-style */\n/* from http://www.roesler-ac.de/wolfram/hello.htm */\n\n#include \n#include \n\nint main(void)\n{\n puts(\"Hello World!\");\n return EXIT_SUCCESS;\n}\n" }, { "path": "tests/inputs/issues/286/project/ignore_subdir/test.py", "content": "print \"hello\"\n" }, { "path": "tests/inputs/issues/286/project/read_subdir/hi.c", "content": "/*\n */\nint main() { int x = 1;\n return 0; }\n" }, { "path": "tests/inputs/issues/296/Lanczos.m", "content": "function [phiKM, AscendingLambda] = Lanczos(K, M, sigma, Jmax)\n[rows,cols] = size(K); \nif (rows ~= cols) \n fprintf('Lanczos needs square matrices'); \nend \nZ = K - sigma*M; % initialize some\nQ = zeros(rows,Jmax+1); % variables\nT = zeros(Jmax,Jmax); %\nrRand = randn(rows,1); %\nrOld = rRand;\nbetaOld = sqrt(rOld'*M*rOld); %\nfor j = 1:Jmax, %\n Q(:,j+1) = rOld/betaOld; %\n u = Z \\ (M*Q(:,j+1) - Z*Q(:,j)*betaOld); % D.S.Scott's formulation\n alpha = Q(:,j+1)'*M*u; % of the recurrence\n r = u - alpha*Q(:,j+1); %\n for i=1:3, %\n sum = zeros(rows,1); % repeat a full orhto-\n for k=2:j+1, % gonalization three\n sum = sum + (Q(:,k)'*M*r)*Q(:,k); % times to ensure\n end; % high quality\n r = r - sum; % solutions\n end; %\n beta = sqrt(r'*M*r); %\n T(j,j) = alpha; %\n if (j ~= Jmax) % augment [T] with new\n T(j+1,j) = beta; % alpha_i, beta_i+1\n T(j,j+1) = beta; %\n end; %\n Jactual = j; %\n if (abs(beta) < 1.0e-12) % singular beta; going\n break % any more will introduce\n end % spurious modes\n betaOld = beta; %\n rOld = r; %\nend %\n[phiT,lambdaT] = eig(T(1:Jactual,1:Jactual)); % solve [T]{y} = L{y}\nlambdaKM = zeros(Jactual,1); %\nfor j = 1:Jactual, % invert and shift the\n lambdaKM(j) = sigma + 1/lambdaT(j,j); % eigenvalues to the\nend % user's domain\n[AscendingLambda, ordering] = sort(lambdaKM); %\nphiKM = zeros(rows,Jactual); % sort the eigenvalues\nUnOrdphiKM = zeros(rows,Jactual); % in ascending order\nUnOrdphiKM = Q(:,2:Jactual+1)*phiT; %\nfor j = 1:Jactual, % resequence the e-vectors\n phiKM(:,j) = UnOrdphiKM(:,ordering(j)); % to correspond to the\nend % e-values\n" }, { "path": "tests/inputs/issues/296/Mathematica_1.m", "content": "(* http://spot.colorado.edu/~sitelic/samplecode/mathematica/imagesfile.html\n *)\n\nimage = Import[\"denise.png\",\"PNG\"] (* or *)\n\nimage = Import[\"denise.gif\",\"GIF\"]\n\nA = image[[1,1]]/255.;\nListDensityPlot[A,Mesh->False, AspectRatio->Automatic]\n\n(*\n -- or -- \n *)\n\nShow[Graphics[Raster[A]], AspectRatio->Automatic]\n\n\nblurA = ListConvolve[Table[1/25,{5},{5}],A];\n\nShow[Graphics[Raster[blurA]], AspectRatio->Automatic]\nB = Fourier[A];\n\n(*\n delete\n higher frequencies *)\n\nB[[Range[30,278],All]]=0;\n\nB[[All,Range[30,202]]]=0;\n\nShow[Graphics[Raster[ Re[InverseFourier[B]] ]], AspectRatio->Automatic]\n" }, { "path": "tests/inputs/issues/296/Octave.m", "content": "% from http://www.roesler-ac.de/wolfram/hello.htm\r\n#Hello World in Octave (http://www.octave.org/)\r\nprintf(\"Hello World\\n\");\r\n" }, { "path": "tests/inputs/issues/296/hello.lua", "content": "-- single line comment\n\n--[[\nmulti \nline \ncomment\n]]\n\n--[[\nalso a comment\n--]]\n\nprint(\"hello, world\")\nprint([[not a comment]])\n" }, { "path": "tests/inputs/issues/296/nested.lua", "content": "-- single line comment issue #371\n\n--[[\nmulti \nline \ncomment\n]]\n\n--[[\nalso a comment\n--]]\n\nprint(\"hello, world\")\nprint([[not a comment]])\n\n--[===[\nmulti \nline \ncomment\n--[==[\nstill comment\n--[=[\nstill comment\n--[[\nstill comment\n--]]\n--]=]\n--]==]\n--]===]\n" }, { "path": "tests/inputs/issues/296/qsort_demo.m", "content": "#include \n#include \n\n/*\n Al Danial April 25 2000\n*/\n\n#define ELEMENTS 1000\n\nstatic int compar_string(const void *a, const void *b){\n return (strcmp( (char *)a, (char *)b));\n}\n\nint comp(const void *a, const void *b ) {\n return *(int *)a - * (int *)b;\n}\n\nmain(){\n\n int x, i;\n char *string;\n struct sort_test_t {\n int s;\n } ;\n\n struct sort_test_t sort_test[ELEMENTS];\n\n /* inititalize the array */\n for (i=0;i