[ { "path": ".dockerignore", "content": "# IDE\n.vscode/\n.idea/\n\n.DS_Store\n\n/bin\n/cmake*/\n" }, { "path": ".editorconfig", "content": "# EditorConfig is awesome: https://EditorConfig.org\n\nroot = true\n\n[*]\ncharset = utf-8\nend_of_line = lf\ntrim_trailing_whitespace = true\ninsert_final_newline = true\nindent_style = space\nindent_size = 4\n" }, { "path": ".gitignore", "content": ".vs/\n.idea/\n.vscode/\n\n/cmake-build*\n\n# Prerequisites\n*.d\n\n# Compiled Object files\n*.slo\n*.lo\n*.o\n*.obj\n\n# Precompiled Headers\n*.gch\n*.pch\n\n# Compiled Dynamic libraries\n*.so\n*.dylib\n*.dll\n\n# Fortran module files\n*.mod\n*.smod\n\n# Compiled Static libraries\n*.lai\n*.la\n*.a\n*.lib\n\n# Executables\n*.exe\n*.out\n*.app\n" }, { "path": "3rd/benchmark-1.8.2/.clang-format", "content": "---\nLanguage: Cpp\nBasedOnStyle: Google\nPointerAlignment: Left\n...\n" }, { "path": "3rd/benchmark-1.8.2/.clang-tidy", "content": "---\nChecks: 'clang-analyzer-*,readability-redundant-*,performance-*'\nWarningsAsErrors: 'clang-analyzer-*,readability-redundant-*,performance-*'\nHeaderFilterRegex: '.*'\nAnalyzeTemporaryDtors: false\nFormatStyle: none\nUser: user\n" }, { "path": "3rd/benchmark-1.8.2/.github/ISSUE_TEMPLATE/bug_report.md", "content": "---\nname: Bug report\nabout: Create a report to help us improve\ntitle: \"[BUG]\"\nlabels: ''\nassignees: ''\n\n---\n\n**Describe the bug**\nA clear and concise description of what the bug is.\n\n**System**\nWhich OS, compiler, and compiler version are you using:\n - OS: \n - Compiler and version: \n\n**To reproduce**\nSteps to reproduce the behavior:\n1. sync to commit ...\n2. cmake/bazel...\n3. make ...\n4. See error\n\n**Expected behavior**\nA clear and concise description of what you expected to happen.\n\n**Screenshots**\nIf applicable, add screenshots to help explain your problem.\n\n**Additional context**\nAdd any other context about the problem here.\n" }, { "path": "3rd/benchmark-1.8.2/.github/ISSUE_TEMPLATE/feature_request.md", "content": "---\nname: Feature request\nabout: Suggest an idea for this project\ntitle: \"[FR]\"\nlabels: ''\nassignees: ''\n\n---\n\n**Is your feature request related to a problem? Please describe.**\nA clear and concise description of what the problem is. Ex. I'm always frustrated when [...]\n\n**Describe the solution you'd like**\nA clear and concise description of what you want to happen.\n\n**Describe alternatives you've considered**\nA clear and concise description of any alternative solutions or features you've considered.\n\n**Additional context**\nAdd any other context or screenshots about the feature request here.\n" }, { "path": "3rd/benchmark-1.8.2/.github/install_bazel.sh", "content": "if ! bazel version; then\n arch=$(uname -m)\n if [ \"$arch\" == \"aarch64\" ]; then\n arch=\"arm64\"\n fi\n echo \"Installing wget and downloading $arch Bazel binary from GitHub releases.\"\n yum install -y wget\n wget \"https://github.com/bazelbuild/bazel/releases/download/6.0.0/bazel-6.0.0-linux-$arch\" -O /usr/local/bin/bazel\n chmod +x /usr/local/bin/bazel\nelse\n # bazel is installed for the correct architecture\n exit 0\nfi\n" }, { "path": "3rd/benchmark-1.8.2/.github/libcxx-setup.sh", "content": "#!/usr/bin/env bash\n\nset -e\n\n# Checkout LLVM sources\ngit clone --depth=1 https://github.com/llvm/llvm-project.git llvm-project\n\n## Setup libc++ options\nif [ -z \"$BUILD_32_BITS\" ]; then\n export BUILD_32_BITS=OFF && echo disabling 32 bit build\nfi\n\n## Build and install libc++ (Use unstable ABI for better sanitizer coverage)\nmkdir llvm-build && cd llvm-build\ncmake -DCMAKE_C_COMPILER=${CC} \\\n -DCMAKE_CXX_COMPILER=${CXX} \\\n -DCMAKE_BUILD_TYPE=RelWithDebInfo \\\n -DCMAKE_INSTALL_PREFIX=/usr \\\n -DLIBCXX_ABI_UNSTABLE=OFF \\\n -DLLVM_USE_SANITIZER=${LIBCXX_SANITIZER} \\\n -DLLVM_BUILD_32_BITS=${BUILD_32_BITS} \\\n -DLLVM_ENABLE_RUNTIMES='libcxx;libcxxabi;libunwind' \\\n -G \"Unix Makefiles\" \\\n ../llvm-project/runtimes/\nmake -j cxx cxxabi unwind\ncd ..\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/bazel.yml", "content": "name: bazel\n\non:\n push: {}\n pull_request: {}\n\njobs:\n build_and_test_default:\n name: bazel.${{ matrix.os }}.${{ matrix.bzlmod && 'bzlmod' || 'no_bzlmod' }}\n runs-on: ${{ matrix.os }}\n strategy:\n fail-fast: false\n matrix:\n os: [ubuntu-latest, macos-latest, windows-2022]\n bzlmod: [false, true]\n steps:\n - uses: actions/checkout@v3\n\n - name: mount bazel cache\n uses: actions/cache@v3\n env:\n cache-name: bazel-cache\n with:\n path: \"~/.cache/bazel\"\n key: ${{ env.cache-name }}-${{ matrix.os }}-${{ github.ref }}\n restore-keys: |\n ${{ env.cache-name }}-${{ matrix.os }}-main\n\n - name: build\n run: |\n bazel build ${{ matrix.bzlmod && '--enable_bzlmod' || '--noenable_bzlmod' }} //:benchmark //:benchmark_main //test/...\n\n - name: test\n run: |\n bazel test ${{ matrix.bzlmod && '--enable_bzlmod' || '--noenable_bzlmod' }} --test_output=all //test/...\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/build-and-test-min-cmake.yml", "content": "name: build-and-test-min-cmake\n\non:\n push:\n branches: [ main ]\n pull_request:\n branches: [ main ]\n\njobs:\n job:\n name: ${{ matrix.os }}.min-cmake\n runs-on: ${{ matrix.os }}\n strategy:\n fail-fast: false\n matrix:\n os: [ubuntu-latest, macos-latest]\n\n steps:\n - uses: actions/checkout@v3\n\n - uses: lukka/get-cmake@latest\n with:\n cmakeVersion: 3.10.0\n\n - name: create build environment\n run: cmake -E make_directory ${{ runner.workspace }}/_build\n\n - name: setup cmake initial cache\n run: touch compiler-cache.cmake\n\n - name: configure cmake\n env:\n CXX: ${{ matrix.compiler }}\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: >\n cmake -C ${{ github.workspace }}/compiler-cache.cmake\n $GITHUB_WORKSPACE\n -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON\n -DCMAKE_CXX_VISIBILITY_PRESET=hidden\n -DCMAKE_VISIBILITY_INLINES_HIDDEN=ON\n\n - name: build\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: cmake --build .\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/build-and-test-perfcounters.yml", "content": "name: build-and-test-perfcounters\n\non:\n push:\n branches: [ main ]\n pull_request:\n branches: [ main ]\n\njobs:\n job:\n # TODO(dominic): Extend this to include compiler and set through env: CC/CXX.\n name: ${{ matrix.os }}.${{ matrix.build_type }}\n runs-on: ${{ matrix.os }}\n strategy:\n fail-fast: false\n matrix:\n os: [ubuntu-22.04, ubuntu-20.04]\n build_type: ['Release', 'Debug']\n steps:\n - uses: actions/checkout@v3\n\n - name: install libpfm\n run: |\n sudo apt update\n sudo apt -y install libpfm4-dev\n\n - name: create build environment\n run: cmake -E make_directory ${{ runner.workspace }}/_build\n\n - name: configure cmake\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: >\n cmake $GITHUB_WORKSPACE\n -DBENCHMARK_ENABLE_LIBPFM=1\n -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON\n -DCMAKE_BUILD_TYPE=${{ matrix.build_type }}\n\n - name: build\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: cmake --build . --config ${{ matrix.build_type }}\n\n # Skip testing, for now. It seems perf_event_open does not succeed on the\n # hosting machine, very likely a permissions issue.\n # TODO(mtrofin): Enable test.\n # - name: test\n # shell: bash\n # working-directory: ${{ runner.workspace }}/_build\n # run: ctest -C ${{ matrix.build_type }} --rerun-failed --output-on-failure\n\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/build-and-test.yml", "content": "name: build-and-test\n\non:\n push:\n branches: [ main ]\n pull_request:\n branches: [ main ]\n\njobs:\n # TODO: add 32-bit builds (g++ and clang++) for ubuntu\n # (requires g++-multilib and libc6:i386)\n # TODO: add coverage build (requires lcov)\n # TODO: add clang + libc++ builds for ubuntu\n job:\n name: ${{ matrix.os }}.${{ matrix.build_type }}.${{ matrix.lib }}.${{ matrix.compiler }}\n runs-on: ${{ matrix.os }}\n strategy:\n fail-fast: false\n matrix:\n os: [ubuntu-22.04, ubuntu-20.04, macos-latest]\n build_type: ['Release', 'Debug']\n compiler: ['g++', 'clang++']\n lib: ['shared', 'static']\n\n steps:\n - uses: actions/checkout@v3\n\n - uses: lukka/get-cmake@latest\n\n - name: create build environment\n run: cmake -E make_directory ${{ runner.workspace }}/_build\n\n - name: setup cmake initial cache\n run: touch compiler-cache.cmake\n\n - name: configure cmake\n env:\n CXX: ${{ matrix.compiler }}\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: >\n cmake -C ${{ github.workspace }}/compiler-cache.cmake\n $GITHUB_WORKSPACE\n -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON\n -DBUILD_SHARED_LIBS=${{ matrix.lib == 'shared' }}\n -DCMAKE_BUILD_TYPE=${{ matrix.build_type }}\n -DCMAKE_CXX_COMPILER=${{ env.CXX }}\n -DCMAKE_CXX_VISIBILITY_PRESET=hidden\n -DCMAKE_VISIBILITY_INLINES_HIDDEN=ON\n\n - name: build\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: cmake --build . --config ${{ matrix.build_type }}\n\n - name: test\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: ctest -C ${{ matrix.build_type }} -VV\n\n msvc:\n name: ${{ matrix.os }}.${{ matrix.build_type }}.${{ matrix.lib }}.${{ matrix.msvc }}\n runs-on: ${{ matrix.os }}\n defaults:\n run:\n shell: powershell\n strategy:\n fail-fast: false\n matrix:\n msvc:\n - VS-16-2019\n - VS-17-2022\n arch:\n - x64\n build_type:\n - Debug\n - Release\n lib:\n - shared\n - static\n include:\n - msvc: VS-16-2019\n os: windows-2019\n generator: 'Visual Studio 16 2019'\n - msvc: VS-17-2022\n os: windows-2022\n generator: 'Visual Studio 17 2022'\n\n steps:\n - uses: actions/checkout@v2\n\n - uses: lukka/get-cmake@latest\n\n - name: configure cmake\n run: >\n cmake -S . -B _build/\n -A ${{ matrix.arch }}\n -G \"${{ matrix.generator }}\"\n -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON\n -DBUILD_SHARED_LIBS=${{ matrix.lib == 'shared' }}\n\n - name: build\n run: cmake --build _build/ --config ${{ matrix.build_type }}\n\n - name: setup test environment\n # Make sure gmock and benchmark DLLs can be found\n run: >\n echo \"$((Get-Item .).FullName)/_build/bin/${{ matrix.build_type }}\" | Out-File -FilePath $env:GITHUB_PATH -Encoding utf8 -Append;\n echo \"$((Get-Item .).FullName)/_build/src/${{ matrix.build_type }}\" | Out-File -FilePath $env:GITHUB_PATH -Encoding utf8 -Append;\n\n - name: test\n run: ctest --test-dir _build/ -C ${{ matrix.build_type }} -VV\n\n\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/clang-format-lint.yml", "content": "name: clang-format-lint\non:\n push: {}\n pull_request: {}\n\njobs:\n build:\n runs-on: ubuntu-latest\n\n steps:\n - uses: actions/checkout@v3\n - uses: DoozyX/clang-format-lint-action@v0.13\n with:\n source: './include/benchmark ./src ./test'\n extensions: 'h,cc'\n clangFormatVersion: 12\n style: Google\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/clang-tidy.yml", "content": "name: clang-tidy\n\non:\n push: {}\n pull_request: {}\n\njobs:\n job:\n name: run-clang-tidy\n runs-on: ubuntu-latest\n strategy:\n fail-fast: false\n steps:\n - uses: actions/checkout@v3\n\n - name: install clang-tidy\n run: sudo apt update && sudo apt -y install clang-tidy\n\n - name: create build environment\n run: cmake -E make_directory ${{ runner.workspace }}/_build\n\n - name: configure cmake\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: >\n cmake $GITHUB_WORKSPACE\n -DBENCHMARK_ENABLE_ASSEMBLY_TESTS=OFF\n -DBENCHMARK_ENABLE_LIBPFM=OFF\n -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON\n -DCMAKE_C_COMPILER=clang\n -DCMAKE_CXX_COMPILER=clang++\n -DCMAKE_EXPORT_COMPILE_COMMANDS=ON\n -DGTEST_COMPILE_COMMANDS=OFF\n\n - name: run\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: run-clang-tidy\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/doxygen.yml", "content": "name: doxygen\n\non:\n push:\n branches: [main]\n pull_request:\n branches: [main]\n\njobs:\n build-and-deploy:\n name: Build HTML documentation\n runs-on: ubuntu-latest\n steps:\n - name: Fetching sources\n uses: actions/checkout@v3\n\n - name: Installing build dependencies\n run: |\n sudo apt update\n sudo apt install doxygen gcc git\n\n - name: Creating build directory\n run: mkdir build\n\n - name: Building HTML documentation with Doxygen\n run: |\n cmake -S . -B build -DBENCHMARK_ENABLE_TESTING:BOOL=OFF -DBENCHMARK_ENABLE_DOXYGEN:BOOL=ON -DBENCHMARK_INSTALL_DOCS:BOOL=ON\n cmake --build build --target benchmark_doxygen\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/pylint.yml", "content": "name: pylint\n\non:\n push:\n branches: [ main ]\n pull_request:\n branches: [ main ]\n\njobs:\n pylint:\n\n runs-on: ubuntu-latest\n\n steps:\n - uses: actions/checkout@v3\n - name: Set up Python 3.8\n uses: actions/setup-python@v1\n with:\n python-version: 3.8\n\n - name: Install dependencies\n run: |\n python -m pip install --upgrade pip\n pip install pylint pylint-exit conan\n\n - name: Run pylint\n run: |\n pylint `find . -name '*.py'|xargs` || pylint-exit $?\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/sanitizer.yml", "content": "name: sanitizer\n\non:\n push: {}\n pull_request: {}\n\nenv:\n UBSAN_OPTIONS: \"print_stacktrace=1\"\n\njobs:\n job:\n name: ${{ matrix.sanitizer }}.${{ matrix.build_type }}\n runs-on: ubuntu-latest\n strategy:\n fail-fast: false\n matrix:\n build_type: ['Debug', 'RelWithDebInfo']\n sanitizer: ['asan', 'ubsan', 'tsan', 'msan']\n\n steps:\n - uses: actions/checkout@v3\n\n - name: configure msan env\n if: matrix.sanitizer == 'msan'\n run: |\n echo \"EXTRA_FLAGS=-g -O2 -fno-omit-frame-pointer -fsanitize=memory -fsanitize-memory-track-origins\" >> $GITHUB_ENV\n echo \"LIBCXX_SANITIZER=MemoryWithOrigins\" >> $GITHUB_ENV\n\n - name: configure ubsan env\n if: matrix.sanitizer == 'ubsan'\n run: |\n echo \"EXTRA_FLAGS=-g -O2 -fno-omit-frame-pointer -fsanitize=undefined -fno-sanitize-recover=all\" >> $GITHUB_ENV\n echo \"LIBCXX_SANITIZER=Undefined\" >> $GITHUB_ENV\n\n - name: configure asan env\n if: matrix.sanitizer == 'asan'\n run: |\n echo \"EXTRA_FLAGS=-g -O2 -fno-omit-frame-pointer -fsanitize=address -fno-sanitize-recover=all\" >> $GITHUB_ENV\n echo \"LIBCXX_SANITIZER=Address\" >> $GITHUB_ENV\n\n - name: configure tsan env\n if: matrix.sanitizer == 'tsan'\n run: |\n echo \"EXTRA_FLAGS=-g -O2 -fno-omit-frame-pointer -fsanitize=thread -fno-sanitize-recover=all\" >> $GITHUB_ENV\n echo \"LIBCXX_SANITIZER=Thread\" >> $GITHUB_ENV\n\n - name: fine-tune asan options\n # in asan we get an error from std::regex. ignore it.\n if: matrix.sanitizer == 'asan'\n run: |\n echo \"ASAN_OPTIONS=alloc_dealloc_mismatch=0\" >> $GITHUB_ENV\n\n - name: setup clang\n uses: egor-tensin/setup-clang@v1\n with:\n version: latest\n platform: x64\n\n - name: configure clang\n run: |\n echo \"CC=cc\" >> $GITHUB_ENV\n echo \"CXX=c++\" >> $GITHUB_ENV\n\n - name: build libc++ (non-asan)\n if: matrix.sanitizer != 'asan'\n run: |\n \"${GITHUB_WORKSPACE}/.github/libcxx-setup.sh\"\n echo \"EXTRA_CXX_FLAGS=-stdlib=libc++ -L ${GITHUB_WORKSPACE}/llvm-build/lib -lc++abi -Isystem${GITHUB_WORKSPACE}/llvm-build/include -Isystem${GITHUB_WORKSPACE}/llvm-build/include/c++/v1 -Wl,-rpath,${GITHUB_WORKSPACE}/llvm-build/lib\" >> $GITHUB_ENV\n\n - name: create build environment\n run: cmake -E make_directory ${{ runner.workspace }}/_build\n\n - name: configure cmake\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: >\n VERBOSE=1\n cmake $GITHUB_WORKSPACE\n -DBENCHMARK_ENABLE_ASSEMBLY_TESTS=OFF\n -DBENCHMARK_ENABLE_LIBPFM=OFF\n -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON\n -DCMAKE_C_COMPILER=${{ env.CC }}\n -DCMAKE_CXX_COMPILER=${{ env.CXX }}\n -DCMAKE_C_FLAGS=\"${{ env.EXTRA_FLAGS }}\"\n -DCMAKE_CXX_FLAGS=\"${{ env.EXTRA_FLAGS }} ${{ env.EXTRA_CXX_FLAGS }}\"\n -DCMAKE_BUILD_TYPE=${{ matrix.build_type }}\n\n - name: build\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: cmake --build . --config ${{ matrix.build_type }}\n\n - name: test\n shell: bash\n working-directory: ${{ runner.workspace }}/_build\n run: ctest -C ${{ matrix.build_type }} -VV\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/test_bindings.yml", "content": "name: test-bindings\n\non:\n push:\n branches: [main]\n pull_request:\n branches: [main]\n\njobs:\n python_bindings:\n name: Test GBM Python bindings on ${{ matrix.os }}\n runs-on: ${{ matrix.os }}\n strategy:\n fail-fast: false\n matrix:\n os: [ ubuntu-latest, macos-latest, windows-latest ]\n\n steps:\n - uses: actions/checkout@v3\n - name: Set up Python\n uses: actions/setup-python@v4\n with:\n python-version: 3.11\n - name: Install GBM Python bindings on ${{ matrix.os}}\n run:\n python -m pip install wheel .\n - name: Run bindings example on ${{ matrix.os }}\n run:\n python bindings/python/google_benchmark/example.py\n" }, { "path": "3rd/benchmark-1.8.2/.github/workflows/wheels.yml", "content": "name: Build and upload Python wheels\n\non:\n workflow_dispatch:\n release:\n types:\n - published\n\njobs:\n build_sdist:\n name: Build source distribution\n runs-on: ubuntu-latest\n steps:\n - name: Check out repo\n uses: actions/checkout@v3\n\n - name: Install Python 3.11\n uses: actions/setup-python@v4\n with:\n python-version: 3.11\n\n - name: Build and check sdist\n run: |\n python setup.py sdist\n - name: Upload sdist\n uses: actions/upload-artifact@v3\n with:\n name: dist\n path: dist/*.tar.gz\n\n build_wheels:\n name: Build Google Benchmark wheels on ${{ matrix.os }}\n runs-on: ${{ matrix.os }}\n strategy:\n matrix:\n os: [ubuntu-latest, macos-latest, windows-latest]\n\n steps:\n - name: Check out Google Benchmark\n uses: actions/checkout@v3\n\n - name: Set up QEMU\n if: runner.os == 'Linux'\n uses: docker/setup-qemu-action@v2\n with:\n platforms: all\n\n - name: Build wheels on ${{ matrix.os }} using cibuildwheel\n uses: pypa/cibuildwheel@v2.12.0\n env:\n CIBW_BUILD: 'cp38-* cp39-* cp310-* cp311-*'\n CIBW_SKIP: \"*-musllinux_*\"\n CIBW_TEST_SKIP: \"*-macosx_arm64\"\n CIBW_ARCHS_LINUX: x86_64 aarch64\n CIBW_ARCHS_MACOS: x86_64 arm64\n CIBW_ARCHS_WINDOWS: AMD64\n CIBW_BEFORE_ALL_LINUX: bash .github/install_bazel.sh\n CIBW_TEST_COMMAND: python {project}/bindings/python/google_benchmark/example.py\n\n - name: Upload Google Benchmark ${{ matrix.os }} wheels\n uses: actions/upload-artifact@v3\n with:\n name: dist\n path: ./wheelhouse/*.whl\n\n pypi_upload:\n name: Publish google-benchmark wheels to PyPI\n needs: [build_sdist, build_wheels]\n runs-on: ubuntu-latest\n steps:\n - uses: actions/download-artifact@v3\n with:\n name: dist\n path: dist\n\n - uses: pypa/gh-action-pypi-publish@v1.6.4\n with:\n user: __token__\n password: ${{ secrets.PYPI_PASSWORD }}\n" }, { "path": "3rd/benchmark-1.8.2/.gitignore", "content": "*.a\n*.so\n*.so.?*\n*.dll\n*.exe\n*.dylib\n*.cmake\n!/cmake/*.cmake\n!/test/AssemblyTests.cmake\n*~\n*.swp\n*.pyc\n__pycache__\n.DS_Store\n\n# lcov\n*.lcov\n/lcov\n\n# cmake files.\n/Testing\nCMakeCache.txt\nCMakeFiles/\ncmake_install.cmake\n\n# makefiles.\nMakefile\n\n# in-source build.\nbin/\nlib/\n/test/*_test\n\n# exuberant ctags.\ntags\n\n# YouCompleteMe configuration.\n.ycm_extra_conf.pyc\n\n# ninja generated files.\n.ninja_deps\n.ninja_log\nbuild.ninja\ninstall_manifest.txt\nrules.ninja\n\n# bazel output symlinks.\nbazel-*\n\n# out-of-source build top-level folders.\nbuild/\n_build/\nbuild*/\n\n# in-source dependencies\n/googletest/\n\n# Visual Studio 2015/2017 cache/options directory\n.vs/\nCMakeSettings.json\n\n# Visual Studio Code cache/options directory\n.vscode/\n\n# Python build stuff\ndist/\n*.egg-info*\n" }, { "path": "3rd/benchmark-1.8.2/.travis.yml", "content": "sudo: required\ndist: trusty\nlanguage: cpp\n\nmatrix:\n include:\n - compiler: gcc\n addons:\n apt:\n packages:\n - lcov\n env: COMPILER=g++ C_COMPILER=gcc BUILD_TYPE=Coverage\n - compiler: gcc\n addons:\n apt:\n packages:\n - g++-multilib\n - libc6:i386\n env:\n - COMPILER=g++\n - C_COMPILER=gcc\n - BUILD_TYPE=Debug\n - BUILD_32_BITS=ON\n - EXTRA_FLAGS=\"-m32\"\n - compiler: gcc\n addons:\n apt:\n packages:\n - g++-multilib\n - libc6:i386\n env:\n - COMPILER=g++\n - C_COMPILER=gcc\n - BUILD_TYPE=Release\n - BUILD_32_BITS=ON\n - EXTRA_FLAGS=\"-m32\"\n - compiler: gcc\n env:\n - INSTALL_GCC6_FROM_PPA=1\n - COMPILER=g++-6 C_COMPILER=gcc-6 BUILD_TYPE=Debug\n - ENABLE_SANITIZER=1\n - EXTRA_FLAGS=\"-fno-omit-frame-pointer -g -O2 -fsanitize=undefined,address -fuse-ld=gold\"\n # Clang w/ libc++\n - compiler: clang\n dist: xenial\n addons:\n apt:\n packages:\n clang-3.8\n env:\n - INSTALL_GCC6_FROM_PPA=1\n - COMPILER=clang++-3.8 C_COMPILER=clang-3.8 BUILD_TYPE=Debug\n - LIBCXX_BUILD=1\n - EXTRA_CXX_FLAGS=\"-stdlib=libc++\"\n - compiler: clang\n dist: xenial\n addons:\n apt:\n packages:\n clang-3.8\n env:\n - INSTALL_GCC6_FROM_PPA=1\n - COMPILER=clang++-3.8 C_COMPILER=clang-3.8 BUILD_TYPE=Release\n - LIBCXX_BUILD=1\n - EXTRA_CXX_FLAGS=\"-stdlib=libc++\"\n # Clang w/ 32bit libc++\n - compiler: clang\n dist: xenial\n addons:\n apt:\n packages:\n - clang-3.8\n - g++-multilib\n - libc6:i386\n env:\n - INSTALL_GCC6_FROM_PPA=1\n - COMPILER=clang++-3.8 C_COMPILER=clang-3.8 BUILD_TYPE=Debug\n - LIBCXX_BUILD=1\n - BUILD_32_BITS=ON\n - EXTRA_FLAGS=\"-m32\"\n - EXTRA_CXX_FLAGS=\"-stdlib=libc++\"\n # Clang w/ 32bit libc++\n - compiler: clang\n dist: xenial\n addons:\n apt:\n packages:\n - clang-3.8\n - g++-multilib\n - libc6:i386\n env:\n - INSTALL_GCC6_FROM_PPA=1\n - COMPILER=clang++-3.8 C_COMPILER=clang-3.8 BUILD_TYPE=Release\n - LIBCXX_BUILD=1\n - BUILD_32_BITS=ON\n - EXTRA_FLAGS=\"-m32\"\n - EXTRA_CXX_FLAGS=\"-stdlib=libc++\"\n # Clang w/ libc++, ASAN, UBSAN\n - compiler: clang\n dist: xenial\n addons:\n apt:\n packages:\n clang-3.8\n env:\n - INSTALL_GCC6_FROM_PPA=1\n - COMPILER=clang++-3.8 C_COMPILER=clang-3.8 BUILD_TYPE=Debug\n - LIBCXX_BUILD=1 LIBCXX_SANITIZER=\"Undefined;Address\"\n - ENABLE_SANITIZER=1\n - EXTRA_FLAGS=\"-g -O2 -fno-omit-frame-pointer -fsanitize=undefined,address -fno-sanitize-recover=all\"\n - EXTRA_CXX_FLAGS=\"-stdlib=libc++\"\n - UBSAN_OPTIONS=print_stacktrace=1\n # Clang w/ libc++ and MSAN\n - compiler: clang\n dist: xenial\n addons:\n apt:\n packages:\n clang-3.8\n env:\n - INSTALL_GCC6_FROM_PPA=1\n - COMPILER=clang++-3.8 C_COMPILER=clang-3.8 BUILD_TYPE=Debug\n - LIBCXX_BUILD=1 LIBCXX_SANITIZER=MemoryWithOrigins\n - ENABLE_SANITIZER=1\n - EXTRA_FLAGS=\"-g -O2 -fno-omit-frame-pointer -fsanitize=memory -fsanitize-memory-track-origins\"\n - EXTRA_CXX_FLAGS=\"-stdlib=libc++\"\n # Clang w/ libc++ and MSAN\n - compiler: clang\n dist: xenial\n addons:\n apt:\n packages:\n clang-3.8\n env:\n - INSTALL_GCC6_FROM_PPA=1\n - COMPILER=clang++-3.8 C_COMPILER=clang-3.8 BUILD_TYPE=RelWithDebInfo\n - LIBCXX_BUILD=1 LIBCXX_SANITIZER=Thread\n - ENABLE_SANITIZER=1\n - EXTRA_FLAGS=\"-g -O2 -fno-omit-frame-pointer -fsanitize=thread -fno-sanitize-recover=all\"\n - EXTRA_CXX_FLAGS=\"-stdlib=libc++\"\n - os: osx\n osx_image: xcode8.3\n compiler: clang\n env:\n - COMPILER=clang++\n - BUILD_TYPE=Release\n - BUILD_32_BITS=ON\n - EXTRA_FLAGS=\"-m32\"\n\nbefore_script:\n - if [ -n \"${LIBCXX_BUILD}\" ]; then\n source .libcxx-setup.sh;\n fi\n - if [ -n \"${ENABLE_SANITIZER}\" ]; then\n export EXTRA_OPTIONS=\"-DBENCHMARK_ENABLE_ASSEMBLY_TESTS=OFF\";\n else\n export EXTRA_OPTIONS=\"\";\n fi\n - mkdir -p build && cd build\n\nbefore_install:\n - if [ -z \"$BUILD_32_BITS\" ]; then\n export BUILD_32_BITS=OFF && echo disabling 32 bit build;\n fi\n - if [ -n \"${INSTALL_GCC6_FROM_PPA}\" ]; then\n sudo add-apt-repository -y \"ppa:ubuntu-toolchain-r/test\";\n sudo apt-get update --option Acquire::Retries=100 --option Acquire::http::Timeout=\"60\";\n fi\n\ninstall:\n - if [ -n \"${INSTALL_GCC6_FROM_PPA}\" ]; then\n travis_wait sudo -E apt-get -yq --no-install-suggests --no-install-recommends install g++-6;\n fi\n - if [ \"${TRAVIS_OS_NAME}\" == \"linux\" -a \"${BUILD_32_BITS}\" == \"OFF\" ]; then\n travis_wait sudo -E apt-get -y --no-install-suggests --no-install-recommends install llvm-3.9-tools;\n sudo cp /usr/lib/llvm-3.9/bin/FileCheck /usr/local/bin/;\n fi\n - if [ \"${BUILD_TYPE}\" == \"Coverage\" -a \"${TRAVIS_OS_NAME}\" == \"linux\" ]; then\n PATH=~/.local/bin:${PATH};\n pip install --user --upgrade pip;\n travis_wait pip install --user cpp-coveralls;\n fi\n - if [ \"${C_COMPILER}\" == \"gcc-7\" -a \"${TRAVIS_OS_NAME}\" == \"osx\" ]; then\n rm -f /usr/local/include/c++;\n brew update;\n travis_wait brew install gcc@7;\n fi\n - if [ \"${TRAVIS_OS_NAME}\" == \"linux\" ]; then\n sudo apt-get update -qq;\n sudo apt-get install -qq unzip cmake3;\n wget https://github.com/bazelbuild/bazel/releases/download/3.2.0/bazel-3.2.0-installer-linux-x86_64.sh --output-document bazel-installer.sh;\n travis_wait sudo bash bazel-installer.sh;\n fi\n - if [ \"${TRAVIS_OS_NAME}\" == \"osx\" ]; then\n curl -L -o bazel-installer.sh https://github.com/bazelbuild/bazel/releases/download/3.2.0/bazel-3.2.0-installer-darwin-x86_64.sh;\n travis_wait sudo bash bazel-installer.sh;\n fi\n\nscript:\n - cmake -DCMAKE_C_COMPILER=${C_COMPILER} -DCMAKE_CXX_COMPILER=${COMPILER} -DCMAKE_BUILD_TYPE=${BUILD_TYPE} -DCMAKE_C_FLAGS=\"${EXTRA_FLAGS}\" -DCMAKE_CXX_FLAGS=\"${EXTRA_FLAGS} ${EXTRA_CXX_FLAGS}\" -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON -DBENCHMARK_BUILD_32_BITS=${BUILD_32_BITS} ${EXTRA_OPTIONS} ..\n - make\n - ctest -C ${BUILD_TYPE} --output-on-failure\n - bazel test -c dbg --define google_benchmark.have_regex=posix --announce_rc --verbose_failures --test_output=errors --keep_going //test/...\n\nafter_success:\n - if [ \"${BUILD_TYPE}\" == \"Coverage\" -a \"${TRAVIS_OS_NAME}\" == \"linux\" ]; then\n coveralls --include src --include include --gcov-options '\\-lp' --root .. --build-root .;\n fi\n" }, { "path": "3rd/benchmark-1.8.2/.ycm_extra_conf.py", "content": "import os\nimport ycm_core\n\n# These are the compilation flags that will be used in case there's no\n# compilation database set (by default, one is not set).\n# CHANGE THIS LIST OF FLAGS. YES, THIS IS THE DROID YOU HAVE BEEN LOOKING FOR.\nflags = [\n'-Wall',\n'-Werror',\n'-pedantic-errors',\n'-std=c++0x',\n'-fno-strict-aliasing',\n'-O3',\n'-DNDEBUG',\n# ...and the same thing goes for the magic -x option which specifies the\n# language that the files to be compiled are written in. This is mostly\n# relevant for c++ headers.\n# For a C project, you would set this to 'c' instead of 'c++'.\n'-x', 'c++',\n'-I', 'include',\n'-isystem', '/usr/include',\n'-isystem', '/usr/local/include',\n]\n\n\n# Set this to the absolute path to the folder (NOT the file!) containing the\n# compile_commands.json file to use that instead of 'flags'. See here for\n# more details: http://clang.llvm.org/docs/JSONCompilationDatabase.html\n#\n# Most projects will NOT need to set this to anything; you can just change the\n# 'flags' list of compilation flags. Notice that YCM itself uses that approach.\ncompilation_database_folder = ''\n\nif os.path.exists( compilation_database_folder ):\n database = ycm_core.CompilationDatabase( compilation_database_folder )\nelse:\n database = None\n\nSOURCE_EXTENSIONS = [ '.cc' ]\n\ndef DirectoryOfThisScript():\n return os.path.dirname( os.path.abspath( __file__ ) )\n\n\ndef MakeRelativePathsInFlagsAbsolute( flags, working_directory ):\n if not working_directory:\n return list( flags )\n new_flags = []\n make_next_absolute = False\n path_flags = [ '-isystem', '-I', '-iquote', '--sysroot=' ]\n for flag in flags:\n new_flag = flag\n\n if make_next_absolute:\n make_next_absolute = False\n if not flag.startswith( '/' ):\n new_flag = os.path.join( working_directory, flag )\n\n for path_flag in path_flags:\n if flag == path_flag:\n make_next_absolute = True\n break\n\n if flag.startswith( path_flag ):\n path = flag[ len( path_flag ): ]\n new_flag = path_flag + os.path.join( working_directory, path )\n break\n\n if new_flag:\n new_flags.append( new_flag )\n return new_flags\n\n\ndef IsHeaderFile( filename ):\n extension = os.path.splitext( filename )[ 1 ]\n return extension in [ '.h', '.hxx', '.hpp', '.hh' ]\n\n\ndef GetCompilationInfoForFile( filename ):\n # The compilation_commands.json file generated by CMake does not have entries\n # for header files. So we do our best by asking the db for flags for a\n # corresponding source file, if any. If one exists, the flags for that file\n # should be good enough.\n if IsHeaderFile( filename ):\n basename = os.path.splitext( filename )[ 0 ]\n for extension in SOURCE_EXTENSIONS:\n replacement_file = basename + extension\n if os.path.exists( replacement_file ):\n compilation_info = database.GetCompilationInfoForFile(\n replacement_file )\n if compilation_info.compiler_flags_:\n return compilation_info\n return None\n return database.GetCompilationInfoForFile( filename )\n\n\ndef FlagsForFile( filename, **kwargs ):\n if database:\n # Bear in mind that compilation_info.compiler_flags_ does NOT return a\n # python list, but a \"list-like\" StringVec object\n compilation_info = GetCompilationInfoForFile( filename )\n if not compilation_info:\n return None\n\n final_flags = MakeRelativePathsInFlagsAbsolute(\n compilation_info.compiler_flags_,\n compilation_info.compiler_working_dir_ )\n else:\n relative_to = DirectoryOfThisScript()\n final_flags = MakeRelativePathsInFlagsAbsolute( flags, relative_to )\n\n return {\n 'flags': final_flags,\n 'do_cache': True\n }\n" }, { "path": "3rd/benchmark-1.8.2/AUTHORS", "content": "# This is the official list of benchmark authors for copyright purposes.\n# This file is distinct from the CONTRIBUTORS files.\n# See the latter for an explanation.\n#\n# Names should be added to this file as:\n#\tName or Organization \n# The email address is not required for organizations.\n#\n# Please keep the list sorted.\n\nAlbert Pretorius \nAlex Steele \nAndriy Berestovskyy \nArne Beer \nCarto\nCezary Skrzyński \nChristian Wassermann \nChristopher Seymour \nColin Braley \nDaniel Harvey \nDavid Coeurjolly \nDeniz Evrenci \nDirac Research \nDominik Czarnota \nDominik Korman \nDonald Aingworth \nEric Backus \nEric Fiselier \nEugene Zhuk \nEvgeny Safronov \nFederico Ficarelli \nFelix Homann \nGergő Szitár \nGoogle Inc.\nHenrique Bucher \nInternational Business Machines Corporation\nIsmael Jimenez Martinez \nJern-Kuan Leong \nJianXiong Zhou \nJoao Paulo Magalhaes \nJordan Williams \nJussi Knuuttila \nKaito Udagawa \nKishan Kumar \nLei Xu \nMarcel Jacobse \nMatt Clarkson \nMaxim Vafin \nMike Apodaca \nMongoDB Inc.\nNick Hutchinson \nNorman Heino \nOleksandr Sochka \nOri Livneh \nPaul Redmond \nRaghu Raja \nRadoslav Yovchev \nRainer Orth \nRoman Lebedev \nSayan Bhattacharjee \nShapr3D \nShuo Chen \nStaffan Tjernstrom \nSteinar H. Gunderson \nStripe, Inc.\nTobias Schmidt \nYixuan Qiu \nYusuke Suzuki \nZbigniew Skowron \nMin-Yih Hsu \n" }, { "path": "3rd/benchmark-1.8.2/BUILD.bazel", "content": "licenses([\"notice\"])\n\nconfig_setting(\n name = \"qnx\",\n constraint_values = [\"@platforms//os:qnx\"],\n values = {\n \"cpu\": \"x64_qnx\",\n },\n visibility = [\":__subpackages__\"],\n)\n\nconfig_setting(\n name = \"windows\",\n constraint_values = [\"@platforms//os:windows\"],\n values = {\n \"cpu\": \"x64_windows\",\n },\n visibility = [\":__subpackages__\"],\n)\n\nconfig_setting(\n name = \"macos\",\n constraint_values = [\"@platforms//os:macos\"],\n visibility = [\"//visibility:public\"],\n)\n\nconfig_setting(\n name = \"perfcounters\",\n define_values = {\n \"pfm\": \"1\",\n },\n visibility = [\":__subpackages__\"],\n)\n\ncc_library(\n name = \"benchmark\",\n srcs = glob(\n [\n \"src/*.cc\",\n \"src/*.h\",\n ],\n exclude = [\"src/benchmark_main.cc\"],\n ),\n hdrs = [\n \"include/benchmark/benchmark.h\",\n \"include/benchmark/export.h\",\n ],\n linkopts = select({\n \":windows\": [\"-DEFAULTLIB:shlwapi.lib\"],\n \"//conditions:default\": [\"-pthread\"],\n }),\n copts = select({\n \":windows\": [],\n \"//conditions:default\": [\"-Werror=old-style-cast\"],\n }),\n strip_include_prefix = \"include\",\n visibility = [\"//visibility:public\"],\n # Only static linking is allowed; no .so will be produced.\n # Using `defines` (i.e. not `local_defines`) means that no\n # dependent rules need to bother about defining the macro.\n linkstatic = True,\n defines = [\n \"BENCHMARK_STATIC_DEFINE\",\n ] + select({\n \":perfcounters\": [\"HAVE_LIBPFM\"],\n \"//conditions:default\": [],\n }),\n deps = select({\n \":perfcounters\": [\"@libpfm//:libpfm\"],\n \"//conditions:default\": [],\n }),\n)\n\ncc_library(\n name = \"benchmark_main\",\n srcs = [\"src/benchmark_main.cc\"],\n hdrs = [\"include/benchmark/benchmark.h\", \"include/benchmark/export.h\"],\n strip_include_prefix = \"include\",\n visibility = [\"//visibility:public\"],\n deps = [\":benchmark\"],\n)\n\ncc_library(\n name = \"benchmark_internal_headers\",\n hdrs = glob([\"src/*.h\"]),\n visibility = [\"//test:__pkg__\"],\n)\n" }, { "path": "3rd/benchmark-1.8.2/CMakeLists.txt", "content": "# Require CMake 3.10. If available, use the policies up to CMake 3.22.\ncmake_minimum_required (VERSION 3.10...3.22)\n\nproject (benchmark VERSION 1.8.2 LANGUAGES CXX)\n\noption(BENCHMARK_ENABLE_TESTING \"Enable testing of the benchmark library.\" OFF)\noption(BENCHMARK_ENABLE_EXCEPTIONS \"Enable the use of exceptions in the benchmark library.\" ON)\noption(BENCHMARK_ENABLE_LTO \"Enable link time optimisation of the benchmark library.\" OFF)\noption(BENCHMARK_USE_LIBCXX \"Build and test using libc++ as the standard library.\" OFF)\noption(BENCHMARK_ENABLE_WERROR \"Build Release candidates with -Werror.\" ON)\noption(BENCHMARK_FORCE_WERROR \"Build Release candidates with -Werror regardless of compiler issues.\" OFF)\n\nif(\"${CMAKE_CXX_COMPILER_ID}\" STREQUAL \"PGI\")\n # PGC++ maybe reporting false positives.\n set(BENCHMARK_ENABLE_WERROR OFF)\nendif()\nif(\"${CMAKE_CXX_COMPILER_ID}\" STREQUAL \"NVHPC\")\n set(BENCHMARK_ENABLE_WERROR OFF)\nendif()\nif(BENCHMARK_FORCE_WERROR)\n set(BENCHMARK_ENABLE_WERROR ON)\nendif(BENCHMARK_FORCE_WERROR)\n\nif(NOT MSVC)\n option(BENCHMARK_BUILD_32_BITS \"Build a 32 bit version of the library.\" OFF)\nelse()\n set(BENCHMARK_BUILD_32_BITS OFF CACHE BOOL \"Build a 32 bit version of the library - unsupported when using MSVC)\" FORCE)\nendif()\noption(BENCHMARK_ENABLE_INSTALL \"Enable installation of benchmark. (Projects embedding benchmark may want to turn this OFF.)\" ON)\noption(BENCHMARK_ENABLE_DOXYGEN \"Build documentation with Doxygen.\" OFF)\noption(BENCHMARK_INSTALL_DOCS \"Enable installation of documentation.\" ON)\n\n# Allow unmet dependencies to be met using CMake's ExternalProject mechanics, which\n# may require downloading the source code.\noption(BENCHMARK_DOWNLOAD_DEPENDENCIES \"Allow the downloading and in-tree building of unmet dependencies\" OFF)\n\n# This option can be used to disable building and running unit tests which depend on gtest\n# in cases where it is not possible to build or find a valid version of gtest.\noption(BENCHMARK_ENABLE_GTEST_TESTS \"Enable building the unit tests which depend on gtest\" OFF)\noption(BENCHMARK_USE_BUNDLED_GTEST \"Use bundled GoogleTest. If disabled, the find_package(GTest) will be used.\" OFF)\n\noption(BENCHMARK_ENABLE_LIBPFM \"Enable performance counters provided by libpfm\" OFF)\n\n# Export only public symbols\nset(CMAKE_CXX_VISIBILITY_PRESET hidden)\nset(CMAKE_VISIBILITY_INLINES_HIDDEN ON)\n\nif(MSVC)\n # As of CMake 3.18, CMAKE_SYSTEM_PROCESSOR is not set properly for MSVC and\n # cross-compilation (e.g. Host=x86_64, target=aarch64) requires using the\n # undocumented, but working variable.\n # See https://gitlab.kitware.com/cmake/cmake/-/issues/15170\n set(CMAKE_SYSTEM_PROCESSOR ${MSVC_CXX_ARCHITECTURE_ID})\n if(${CMAKE_SYSTEM_PROCESSOR} MATCHES \"ARM\")\n set(CMAKE_CROSSCOMPILING TRUE)\n endif()\nendif()\n\nset(ENABLE_ASSEMBLY_TESTS_DEFAULT OFF)\nfunction(should_enable_assembly_tests)\n if(CMAKE_BUILD_TYPE)\n string(TOLOWER ${CMAKE_BUILD_TYPE} CMAKE_BUILD_TYPE_LOWER)\n if (${CMAKE_BUILD_TYPE_LOWER} MATCHES \"coverage\")\n # FIXME: The --coverage flag needs to be removed when building assembly\n # tests for this to work.\n return()\n endif()\n endif()\n if (MSVC)\n return()\n elseif(NOT CMAKE_SYSTEM_PROCESSOR MATCHES \"x86_64\")\n return()\n elseif(NOT CMAKE_SIZEOF_VOID_P EQUAL 8)\n # FIXME: Make these work on 32 bit builds\n return()\n elseif(BENCHMARK_BUILD_32_BITS)\n # FIXME: Make these work on 32 bit builds\n return()\n endif()\n find_program(LLVM_FILECHECK_EXE FileCheck)\n if (LLVM_FILECHECK_EXE)\n set(LLVM_FILECHECK_EXE \"${LLVM_FILECHECK_EXE}\" CACHE PATH \"llvm filecheck\" FORCE)\n message(STATUS \"LLVM FileCheck Found: ${LLVM_FILECHECK_EXE}\")\n else()\n message(STATUS \"Failed to find LLVM FileCheck\")\n return()\n endif()\n set(ENABLE_ASSEMBLY_TESTS_DEFAULT ON PARENT_SCOPE)\nendfunction()\nshould_enable_assembly_tests()\n\n# This option disables the building and running of the assembly verification tests\noption(BENCHMARK_ENABLE_ASSEMBLY_TESTS \"Enable building and running the assembly tests\"\n ${ENABLE_ASSEMBLY_TESTS_DEFAULT})\n\n# Make sure we can import out CMake functions\nlist(APPEND CMAKE_MODULE_PATH \"${CMAKE_CURRENT_SOURCE_DIR}/cmake/Modules\")\nlist(APPEND CMAKE_MODULE_PATH \"${CMAKE_CURRENT_SOURCE_DIR}/cmake\")\n\n\n# Read the git tags to determine the project version\ninclude(GetGitVersion)\nget_git_version(GIT_VERSION)\n\n# If no git version can be determined, use the version\n# from the project() command\nif (\"${GIT_VERSION}\" STREQUAL \"0.0.0\")\n set(VERSION \"${benchmark_VERSION}\")\nelse()\n set(VERSION \"${GIT_VERSION}\")\nendif()\n# Tell the user what versions we are using\nmessage(STATUS \"Google Benchmark version: ${VERSION}\")\n\n# The version of the libraries\nset(GENERIC_LIB_VERSION ${VERSION})\nstring(SUBSTRING ${VERSION} 0 1 GENERIC_LIB_SOVERSION)\n\n# Import our CMake modules\ninclude(AddCXXCompilerFlag)\ninclude(CheckCXXCompilerFlag)\ninclude(CheckLibraryExists)\ninclude(CXXFeatureCheck)\n\ncheck_library_exists(rt shm_open \"\" HAVE_LIB_RT)\n\nif (BENCHMARK_BUILD_32_BITS)\n add_required_cxx_compiler_flag(-m32)\nendif()\n\nif (MSVC)\n set(BENCHMARK_CXX_STANDARD 14)\nelse()\n set(BENCHMARK_CXX_STANDARD 11)\nendif()\n\nset(CMAKE_CXX_STANDARD ${BENCHMARK_CXX_STANDARD})\nset(CMAKE_CXX_STANDARD_REQUIRED YES)\nset(CMAKE_CXX_EXTENSIONS OFF)\n\nif (MSVC)\n # Turn compiler warnings up to 11\n string(REGEX REPLACE \"[-/]W[1-4]\" \"\" CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS}\")\n set(CMAKE_CXX_FLAGS \"${CMAKE_CXX_FLAGS} /W4\")\n add_definitions(-D_CRT_SECURE_NO_WARNINGS)\n\n if (NOT BENCHMARK_ENABLE_EXCEPTIONS)\n add_cxx_compiler_flag(-EHs-)\n add_cxx_compiler_flag(-EHa-)\n add_definitions(-D_HAS_EXCEPTIONS=0)\n endif()\n # Link time optimisation\n if (BENCHMARK_ENABLE_LTO)\n set(CMAKE_CXX_FLAGS_RELEASE \"${CMAKE_CXX_FLAGS_RELEASE} /GL\")\n set(CMAKE_STATIC_LINKER_FLAGS_RELEASE \"${CMAKE_STATIC_LINKER_FLAGS_RELEASE} /LTCG\")\n set(CMAKE_SHARED_LINKER_FLAGS_RELEASE \"${CMAKE_SHARED_LINKER_FLAGS_RELEASE} /LTCG\")\n set(CMAKE_EXE_LINKER_FLAGS_RELEASE \"${CMAKE_EXE_LINKER_FLAGS_RELEASE} /LTCG\")\n\n set(CMAKE_CXX_FLAGS_RELWITHDEBINFO \"${CMAKE_CXX_FLAGS_RELWITHDEBINFO} /GL\")\n string(REGEX REPLACE \"[-/]INCREMENTAL\" \"/INCREMENTAL:NO\" CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO \"${CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO}\")\n set(CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO \"${CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO} /LTCG\")\n string(REGEX REPLACE \"[-/]INCREMENTAL\" \"/INCREMENTAL:NO\" CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO \"${CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO}\")\n set(CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO \"${CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO} /LTCG\")\n string(REGEX REPLACE \"[-/]INCREMENTAL\" \"/INCREMENTAL:NO\" CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO \"${CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO}\")\n set(CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO \"${CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO} /LTCG\")\n\n set(CMAKE_CXX_FLAGS_MINSIZEREL \"${CMAKE_CXX_FLAGS_MINSIZEREL} /GL\")\n set(CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL \"${CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL} /LTCG\")\n set(CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL \"${CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL} /LTCG\")\n set(CMAKE_EXE_LINKER_FLAGS_MINSIZEREL \"${CMAKE_EXE_LINKER_FLAGS_MINSIZEREL} /LTCG\")\n endif()\nelse()\n # Turn compiler warnings up to 11\n add_cxx_compiler_flag(-Wall)\n add_cxx_compiler_flag(-Wextra)\n add_cxx_compiler_flag(-Wshadow)\n add_cxx_compiler_flag(-Wfloat-equal)\n add_cxx_compiler_flag(-Wold-style-cast)\n if(BENCHMARK_ENABLE_WERROR)\n add_cxx_compiler_flag(-Werror)\n endif()\n if (NOT BENCHMARK_ENABLE_TESTING)\n # Disable warning when compiling tests as gtest does not use 'override'.\n add_cxx_compiler_flag(-Wsuggest-override)\n endif()\n add_cxx_compiler_flag(-pedantic)\n add_cxx_compiler_flag(-pedantic-errors)\n add_cxx_compiler_flag(-Wshorten-64-to-32)\n add_cxx_compiler_flag(-fstrict-aliasing)\n # Disable warnings regarding deprecated parts of the library while building\n # and testing those parts of the library.\n add_cxx_compiler_flag(-Wno-deprecated-declarations)\n if (CMAKE_CXX_COMPILER_ID STREQUAL \"Intel\")\n # Intel silently ignores '-Wno-deprecated-declarations',\n # warning no. 1786 must be explicitly disabled.\n # See #631 for rationale.\n add_cxx_compiler_flag(-wd1786)\n endif()\n # Disable deprecation warnings for release builds (when -Werror is enabled).\n if(BENCHMARK_ENABLE_WERROR)\n add_cxx_compiler_flag(-Wno-deprecated)\n endif()\n if (NOT BENCHMARK_ENABLE_EXCEPTIONS)\n add_cxx_compiler_flag(-fno-exceptions)\n endif()\n\n if (HAVE_CXX_FLAG_FSTRICT_ALIASING)\n if (NOT CMAKE_CXX_COMPILER_ID STREQUAL \"Intel\") #ICC17u2: Many false positives for Wstrict-aliasing\n add_cxx_compiler_flag(-Wstrict-aliasing)\n endif()\n endif()\n # ICC17u2: overloaded virtual function \"benchmark::Fixture::SetUp\" is only partially overridden\n # (because of deprecated overload)\n add_cxx_compiler_flag(-wd654)\n add_cxx_compiler_flag(-Wthread-safety)\n if (HAVE_CXX_FLAG_WTHREAD_SAFETY)\n cxx_feature_check(THREAD_SAFETY_ATTRIBUTES \"-DINCLUDE_DIRECTORIES=${PROJECT_SOURCE_DIR}/include\")\n endif()\n\n # On most UNIX like platforms g++ and clang++ define _GNU_SOURCE as a\n # predefined macro, which turns on all of the wonderful libc extensions.\n # However g++ doesn't do this in Cygwin so we have to define it ourselves\n # since we depend on GNU/POSIX/BSD extensions.\n if (CYGWIN)\n add_definitions(-D_GNU_SOURCE=1)\n endif()\n\n if (QNXNTO)\n add_definitions(-D_QNX_SOURCE)\n endif()\n\n # Link time optimisation\n if (BENCHMARK_ENABLE_LTO)\n add_cxx_compiler_flag(-flto)\n add_cxx_compiler_flag(-Wno-lto-type-mismatch)\n if (\"${CMAKE_CXX_COMPILER_ID}\" STREQUAL \"GNU\")\n find_program(GCC_AR gcc-ar)\n if (GCC_AR)\n set(CMAKE_AR ${GCC_AR})\n endif()\n find_program(GCC_RANLIB gcc-ranlib)\n if (GCC_RANLIB)\n set(CMAKE_RANLIB ${GCC_RANLIB})\n endif()\n elseif(\"${CMAKE_CXX_COMPILER_ID}\" MATCHES \"Clang\")\n include(llvm-toolchain)\n endif()\n endif()\n\n # Coverage build type\n set(BENCHMARK_CXX_FLAGS_COVERAGE \"${CMAKE_CXX_FLAGS_DEBUG}\"\n CACHE STRING \"Flags used by the C++ compiler during coverage builds.\"\n FORCE)\n set(BENCHMARK_EXE_LINKER_FLAGS_COVERAGE \"${CMAKE_EXE_LINKER_FLAGS_DEBUG}\"\n CACHE STRING \"Flags used for linking binaries during coverage builds.\"\n FORCE)\n set(BENCHMARK_SHARED_LINKER_FLAGS_COVERAGE \"${CMAKE_SHARED_LINKER_FLAGS_DEBUG}\"\n CACHE STRING \"Flags used by the shared libraries linker during coverage builds.\"\n FORCE)\n mark_as_advanced(\n BENCHMARK_CXX_FLAGS_COVERAGE\n BENCHMARK_EXE_LINKER_FLAGS_COVERAGE\n BENCHMARK_SHARED_LINKER_FLAGS_COVERAGE)\n set(CMAKE_BUILD_TYPE \"${CMAKE_BUILD_TYPE}\" CACHE STRING\n \"Choose the type of build, options are: None Debug Release RelWithDebInfo MinSizeRel Coverage.\")\n add_cxx_compiler_flag(--coverage COVERAGE)\nendif()\n\nif (BENCHMARK_USE_LIBCXX)\n if (\"${CMAKE_CXX_COMPILER_ID}\" MATCHES \"Clang\")\n add_cxx_compiler_flag(-stdlib=libc++)\n elseif (\"${CMAKE_CXX_COMPILER_ID}\" STREQUAL \"GNU\" OR\n \"${CMAKE_CXX_COMPILER_ID}\" STREQUAL \"Intel\")\n add_cxx_compiler_flag(-nostdinc++)\n message(WARNING \"libc++ header path must be manually specified using CMAKE_CXX_FLAGS\")\n # Adding -nodefaultlibs directly to CMAKE__LINKER_FLAGS will break\n # configuration checks such as 'find_package(Threads)'\n list(APPEND BENCHMARK_CXX_LINKER_FLAGS -nodefaultlibs)\n # -lc++ cannot be added directly to CMAKE__LINKER_FLAGS because\n # linker flags appear before all linker inputs and -lc++ must appear after.\n list(APPEND BENCHMARK_CXX_LIBRARIES c++)\n else()\n message(FATAL_ERROR \"-DBENCHMARK_USE_LIBCXX:BOOL=ON is not supported for compiler\")\n endif()\nendif(BENCHMARK_USE_LIBCXX)\n\nset(EXTRA_CXX_FLAGS \"\")\nif (WIN32 AND \"${CMAKE_CXX_COMPILER_ID}\" MATCHES \"Clang\")\n # Clang on Windows fails to compile the regex feature check under C++11\n set(EXTRA_CXX_FLAGS \"-DCMAKE_CXX_STANDARD=14\")\nendif()\n\n# C++ feature checks\n# Determine the correct regular expression engine to use\ncxx_feature_check(STD_REGEX ${EXTRA_CXX_FLAGS})\ncxx_feature_check(GNU_POSIX_REGEX ${EXTRA_CXX_FLAGS})\ncxx_feature_check(POSIX_REGEX ${EXTRA_CXX_FLAGS})\nif(NOT HAVE_STD_REGEX AND NOT HAVE_GNU_POSIX_REGEX AND NOT HAVE_POSIX_REGEX)\n message(FATAL_ERROR \"Failed to determine the source files for the regular expression backend\")\nendif()\nif (NOT BENCHMARK_ENABLE_EXCEPTIONS AND HAVE_STD_REGEX\n AND NOT HAVE_GNU_POSIX_REGEX AND NOT HAVE_POSIX_REGEX)\n message(WARNING \"Using std::regex with exceptions disabled is not fully supported\")\nendif()\n\ncxx_feature_check(STEADY_CLOCK)\n# Ensure we have pthreads\nset(THREADS_PREFER_PTHREAD_FLAG ON)\nfind_package(Threads REQUIRED)\ncxx_feature_check(PTHREAD_AFFINITY)\n\nif (BENCHMARK_ENABLE_LIBPFM)\n find_package(PFM)\nendif()\n\n# Set up directories\ninclude_directories(${PROJECT_SOURCE_DIR}/include)\n\n# Build the targets\nadd_subdirectory(src)\n\nif (BENCHMARK_ENABLE_TESTING)\n enable_testing()\n if (BENCHMARK_ENABLE_GTEST_TESTS AND\n NOT (TARGET gtest AND TARGET gtest_main AND\n TARGET gmock AND TARGET gmock_main))\n if (BENCHMARK_USE_BUNDLED_GTEST)\n include(GoogleTest)\n else()\n find_package(GTest CONFIG REQUIRED)\n add_library(gtest ALIAS GTest::gtest)\n add_library(gtest_main ALIAS GTest::gtest_main)\n add_library(gmock ALIAS GTest::gmock)\n add_library(gmock_main ALIAS GTest::gmock_main)\n endif()\n endif()\n add_subdirectory(test)\nendif()\n" }, { "path": "3rd/benchmark-1.8.2/CONTRIBUTING.md", "content": "# How to contribute #\n\nWe'd love to accept your patches and contributions to this project. There are\na just a few small guidelines you need to follow.\n\n\n## Contributor License Agreement ##\n\nContributions to any Google project must be accompanied by a Contributor\nLicense Agreement. This is not a copyright **assignment**, it simply gives\nGoogle permission to use and redistribute your contributions as part of the\nproject.\n\n * If you are an individual writing original source code and you're sure you\n own the intellectual property, then you'll need to sign an [individual\n CLA][].\n\n * If you work for a company that wants to allow you to contribute your work,\n then you'll need to sign a [corporate CLA][].\n\nYou generally only need to submit a CLA once, so if you've already submitted\none (even if it was for a different project), you probably don't need to do it\nagain.\n\n[individual CLA]: https://developers.google.com/open-source/cla/individual\n[corporate CLA]: https://developers.google.com/open-source/cla/corporate\n\nOnce your CLA is submitted (or if you already submitted one for\nanother Google project), make a commit adding yourself to the\n[AUTHORS][] and [CONTRIBUTORS][] files. This commit can be part\nof your first [pull request][].\n\n[AUTHORS]: AUTHORS\n[CONTRIBUTORS]: CONTRIBUTORS\n\n\n## Submitting a patch ##\n\n 1. It's generally best to start by opening a new issue describing the bug or\n feature you're intending to fix. Even if you think it's relatively minor,\n it's helpful to know what people are working on. Mention in the initial\n issue that you are planning to work on that bug or feature so that it can\n be assigned to you.\n\n 1. Follow the normal process of [forking][] the project, and setup a new\n branch to work in. It's important that each group of changes be done in\n separate branches in order to ensure that a pull request only includes the\n commits related to that bug or feature.\n\n 1. Do your best to have [well-formed commit messages][] for each change.\n This provides consistency throughout the project, and ensures that commit\n messages are able to be formatted properly by various git tools.\n\n 1. Finally, push the commits to your fork and submit a [pull request][].\n\n[forking]: https://help.github.com/articles/fork-a-repo\n[well-formed commit messages]: http://tbaggery.com/2008/04/19/a-note-about-git-commit-messages.html\n[pull request]: https://help.github.com/articles/creating-a-pull-request\n" }, { "path": "3rd/benchmark-1.8.2/CONTRIBUTORS", "content": "# People who have agreed to one of the CLAs and can contribute patches.\n# The AUTHORS file lists the copyright holders; this file\n# lists people. For example, Google employees are listed here\n# but not in AUTHORS, because Google holds the copyright.\n#\n# Names should be added to this file only after verifying that\n# the individual or the individual's organization has agreed to\n# the appropriate Contributor License Agreement, found here:\n#\n# https://developers.google.com/open-source/cla/individual\n# https://developers.google.com/open-source/cla/corporate\n#\n# The agreement for individuals can be filled out on the web.\n#\n# When adding J Random Contributor's name to this file,\n# either J's name or J's organization's name should be\n# added to the AUTHORS file, depending on whether the\n# individual or corporate CLA was used.\n#\n# Names should be added to this file as:\n# Name \n#\n# Please keep the list sorted.\n\nAbhina Sreeskantharajan \nAlbert Pretorius \nAlex Steele \nAndriy Berestovskyy \nArne Beer \nBátor Tallér \nBilly Robert O'Neal III \nCezary Skrzyński \nChris Kennelly \nChristian Wassermann \nChristopher Seymour \nColin Braley \nCyrille Faucheux \nDaniel Harvey \nDavid Coeurjolly \nDeniz Evrenci \nDominic Hamon \nDominik Czarnota \nDominik Korman \nDonald Aingworth \nEric Backus \nEric Fiselier \nEugene Zhuk \nEvgeny Safronov \nFanbo Meng \nFederico Ficarelli \nFelix Homann \nGeoffrey Martin-Noble \nGergő Szitár \nHannes Hauswedell \nHenrique Bucher \nIsmael Jimenez Martinez \nJern-Kuan Leong \nJianXiong Zhou \nJoao Paulo Magalhaes \nJohn Millikin \nJordan Williams \nJussi Knuuttila \nKai Wolf \nKaito Udagawa \nKishan Kumar \nLei Xu \nMarcel Jacobse \nMatt Clarkson \nMaxim Vafin \nMike Apodaca \nNick Hutchinson \nNorman Heino \nOleksandr Sochka \nOri Livneh \nPascal Leroy \nPaul Redmond \nPierre Phaneuf \nRadoslav Yovchev \nRainer Orth \nRaghu Raja \nRaul Marin \nRay Glover \nRobert Guo \nRoman Lebedev \nSayan Bhattacharjee \nShuo Chen \nSteven Wan \nTobias Schmidt \nTobias Ulvgård \nTom Madams \nYixuan Qiu \nYusuke Suzuki \nZbigniew Skowron \nMin-Yih Hsu \n" }, { "path": "3rd/benchmark-1.8.2/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright [yyyy] [name of copyright owner]\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" }, { "path": "3rd/benchmark-1.8.2/MODULE.bazel", "content": "module(name = \"com_github_google_benchmark\", version=\"1.8.2\")\n\nbazel_dep(name = \"bazel_skylib\", version = \"1.4.1\")\nbazel_dep(name = \"platforms\", version = \"0.0.6\")\nbazel_dep(name = \"rules_foreign_cc\", version = \"0.9.0\")\nbazel_dep(name = \"rules_cc\", version = \"0.0.6\")\nbazel_dep(name = \"rules_python\", version = \"0.23.1\")\nbazel_dep(name = \"googletest\", version = \"1.12.1\", repo_name = \"com_google_googletest\")\nbazel_dep(name = \"libpfm\", version = \"4.11.0\")\n\n# Register a toolchain for Python 3.9 to be able to build numpy. Python\n# versions >=3.10 are problematic.\n# A second reason for this is to be able to build Python hermetically instead\n# of relying on the changing default version from rules_python.\n\npython = use_extension(\"@rules_python//python/extensions:python.bzl\", \"python\")\npython.toolchain(python_version = \"3.9\")\n\n# Extract the interpreter from the hermetic toolchain above, so we can use that\n# instead of the system interpreter for the pip compiplation step below.\ninterpreter = use_extension(\"@rules_python//python/extensions:interpreter.bzl\", \"interpreter\")\ninterpreter.install(\n name = \"interpreter\",\n python_name = \"python_3_9\",\n)\nuse_repo(interpreter, \"interpreter\")\n\npip = use_extension(\"@rules_python//python/extensions:pip.bzl\", \"pip\")\npip.parse(\n name=\"tools_pip_deps\",\n incompatible_generate_aliases = True,\n python_interpreter_target=\"@interpreter//:python\",\n requirements_lock=\"//tools:requirements.txt\")\nuse_repo(pip, \"tools_pip_deps\")\n" }, { "path": "3rd/benchmark-1.8.2/README.md", "content": "# Benchmark\n\n[![build-and-test](https://github.com/google/benchmark/workflows/build-and-test/badge.svg)](https://github.com/google/benchmark/actions?query=workflow%3Abuild-and-test)\n[![bazel](https://github.com/google/benchmark/actions/workflows/bazel.yml/badge.svg)](https://github.com/google/benchmark/actions/workflows/bazel.yml)\n[![pylint](https://github.com/google/benchmark/workflows/pylint/badge.svg)](https://github.com/google/benchmark/actions?query=workflow%3Apylint)\n[![test-bindings](https://github.com/google/benchmark/workflows/test-bindings/badge.svg)](https://github.com/google/benchmark/actions?query=workflow%3Atest-bindings)\n[![Coverage Status](https://coveralls.io/repos/google/benchmark/badge.svg)](https://coveralls.io/r/google/benchmark)\n\n[![Discord](https://discordapp.com/api/guilds/1125694995928719494/widget.png?style=shield)](https://discord.gg/cz7UX7wKC2)\n\nA library to benchmark code snippets, similar to unit tests. Example:\n\n```c++\n#include \n\nstatic void BM_SomeFunction(benchmark::State& state) {\n // Perform setup here\n for (auto _ : state) {\n // This code gets timed\n SomeFunction();\n }\n}\n// Register the function as a benchmark\nBENCHMARK(BM_SomeFunction);\n// Run the benchmark\nBENCHMARK_MAIN();\n```\n\n## Getting Started\n\nTo get started, see [Requirements](#requirements) and\n[Installation](#installation). See [Usage](#usage) for a full example and the\n[User Guide](docs/user_guide.md) for a more comprehensive feature overview.\n\nIt may also help to read the [Google Test documentation](https://github.com/google/googletest/blob/main/docs/primer.md)\nas some of the structural aspects of the APIs are similar.\n\n## Resources\n\n[Discussion group](https://groups.google.com/d/forum/benchmark-discuss)\n\nIRC channels:\n* [libera](https://libera.chat) #benchmark\n\n[Additional Tooling Documentation](docs/tools.md)\n\n[Assembly Testing Documentation](docs/AssemblyTests.md)\n\n[Building and installing Python bindings](docs/python_bindings.md)\n\n## Requirements\n\nThe library can be used with C++03. However, it requires C++11 to build,\nincluding compiler and standard library support.\n\nThe following minimum versions are required to build the library:\n\n* GCC 4.8\n* Clang 3.4\n* Visual Studio 14 2015\n* Intel 2015 Update 1\n\nSee [Platform-Specific Build Instructions](docs/platform_specific_build_instructions.md).\n\n## Installation\n\nThis describes the installation process using cmake. As pre-requisites, you'll\nneed git and cmake installed.\n\n_See [dependencies.md](docs/dependencies.md) for more details regarding supported\nversions of build tools._\n\n```bash\n# Check out the library.\n$ git clone https://github.com/google/benchmark.git\n# Go to the library root directory\n$ cd benchmark\n# Make a build directory to place the build output.\n$ cmake -E make_directory \"build\"\n# Generate build system files with cmake, and download any dependencies.\n$ cmake -E chdir \"build\" cmake -DBENCHMARK_DOWNLOAD_DEPENDENCIES=on -DCMAKE_BUILD_TYPE=Release ../\n# or, starting with CMake 3.13, use a simpler form:\n# cmake -DCMAKE_BUILD_TYPE=Release -S . -B \"build\"\n# Build the library.\n$ cmake --build \"build\" --config Release\n```\nThis builds the `benchmark` and `benchmark_main` libraries and tests.\nOn a unix system, the build directory should now look something like this:\n\n```\n/benchmark\n /build\n /src\n /libbenchmark.a\n /libbenchmark_main.a\n /test\n ...\n```\n\nNext, you can run the tests to check the build.\n\n```bash\n$ cmake -E chdir \"build\" ctest --build-config Release\n```\n\nIf you want to install the library globally, also run:\n\n```\nsudo cmake --build \"build\" --config Release --target install\n```\n\nNote that Google Benchmark requires Google Test to build and run the tests. This\ndependency can be provided two ways:\n\n* Checkout the Google Test sources into `benchmark/googletest`.\n* Otherwise, if `-DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON` is specified during\n configuration as above, the library will automatically download and build\n any required dependencies.\n\nIf you do not wish to build and run the tests, add `-DBENCHMARK_ENABLE_GTEST_TESTS=OFF`\nto `CMAKE_ARGS`.\n\n### Debug vs Release\n\nBy default, benchmark builds as a debug library. You will see a warning in the\noutput when this is the case. To build it as a release library instead, add\n`-DCMAKE_BUILD_TYPE=Release` when generating the build system files, as shown\nabove. The use of `--config Release` in build commands is needed to properly\nsupport multi-configuration tools (like Visual Studio for example) and can be\nskipped for other build systems (like Makefile).\n\nTo enable link-time optimisation, also add `-DBENCHMARK_ENABLE_LTO=true` when\ngenerating the build system files.\n\nIf you are using gcc, you might need to set `GCC_AR` and `GCC_RANLIB` cmake\ncache variables, if autodetection fails.\n\nIf you are using clang, you may need to set `LLVMAR_EXECUTABLE`,\n`LLVMNM_EXECUTABLE` and `LLVMRANLIB_EXECUTABLE` cmake cache variables.\n\nTo enable sanitizer checks (eg., `asan` and `tsan`), add:\n```\n -DCMAKE_C_FLAGS=\"-g -O2 -fno-omit-frame-pointer -fsanitize=address -fsanitize=thread -fno-sanitize-recover=all\"\n -DCMAKE_CXX_FLAGS=\"-g -O2 -fno-omit-frame-pointer -fsanitize=address -fsanitize=thread -fno-sanitize-recover=all \" \n```\n\n### Stable and Experimental Library Versions\n\nThe main branch contains the latest stable version of the benchmarking library;\nthe API of which can be considered largely stable, with source breaking changes\nbeing made only upon the release of a new major version.\n\nNewer, experimental, features are implemented and tested on the\n[`v2` branch](https://github.com/google/benchmark/tree/v2). Users who wish\nto use, test, and provide feedback on the new features are encouraged to try\nthis branch. However, this branch provides no stability guarantees and reserves\nthe right to change and break the API at any time.\n\n## Usage\n\n### Basic usage\n\nDefine a function that executes the code to measure, register it as a benchmark\nfunction using the `BENCHMARK` macro, and ensure an appropriate `main` function\nis available:\n\n```c++\n#include \n\nstatic void BM_StringCreation(benchmark::State& state) {\n for (auto _ : state)\n std::string empty_string;\n}\n// Register the function as a benchmark\nBENCHMARK(BM_StringCreation);\n\n// Define another benchmark\nstatic void BM_StringCopy(benchmark::State& state) {\n std::string x = \"hello\";\n for (auto _ : state)\n std::string copy(x);\n}\nBENCHMARK(BM_StringCopy);\n\nBENCHMARK_MAIN();\n```\n\nTo run the benchmark, compile and link against the `benchmark` library\n(libbenchmark.a/.so). If you followed the build steps above, this library will \nbe under the build directory you created.\n\n```bash\n# Example on linux after running the build steps above. Assumes the\n# `benchmark` and `build` directories are under the current directory.\n$ g++ mybenchmark.cc -std=c++11 -isystem benchmark/include \\\n -Lbenchmark/build/src -lbenchmark -lpthread -o mybenchmark\n```\n\nAlternatively, link against the `benchmark_main` library and remove\n`BENCHMARK_MAIN();` above to get the same behavior.\n\nThe compiled executable will run all benchmarks by default. Pass the `--help`\nflag for option information or see the [User Guide](docs/user_guide.md).\n\n### Usage with CMake\n\nIf using CMake, it is recommended to link against the project-provided\n`benchmark::benchmark` and `benchmark::benchmark_main` targets using\n`target_link_libraries`.\nIt is possible to use ```find_package``` to import an installed version of the\nlibrary.\n```cmake\nfind_package(benchmark REQUIRED)\n```\nAlternatively, ```add_subdirectory``` will incorporate the library directly in\nto one's CMake project.\n```cmake\nadd_subdirectory(benchmark)\n```\nEither way, link to the library as follows.\n```cmake\ntarget_link_libraries(MyTarget benchmark::benchmark)\n```\n" }, { "path": "3rd/benchmark-1.8.2/WORKSPACE", "content": "workspace(name = \"com_github_google_benchmark\")\n\nload(\"//:bazel/benchmark_deps.bzl\", \"benchmark_deps\")\n\nbenchmark_deps()\n\nload(\"@rules_foreign_cc//foreign_cc:repositories.bzl\", \"rules_foreign_cc_dependencies\")\n\nrules_foreign_cc_dependencies()\n\nload(\"@rules_python//python:pip.bzl\", pip3_install=\"pip_install\")\n\npip3_install(\n name = \"tools_pip_deps\",\n requirements = \"//tools:requirements.txt\",\n)\n\nnew_local_repository(\n name = \"python_headers\",\n build_file = \"@//bindings/python:python_headers.BUILD\",\n path = \"\", # May be overwritten by setup.py.\n)\n" }, { "path": "3rd/benchmark-1.8.2/WORKSPACE.bzlmod", "content": "# This file marks the root of the Bazel workspace.\n# See MODULE.bazel for dependencies and setup.\n" }, { "path": "3rd/benchmark-1.8.2/_config.yml", "content": "theme: jekyll-theme-midnight\nmarkdown: GFM\n" }, { "path": "3rd/benchmark-1.8.2/appveyor.yml", "content": "version: '{build}'\n\nimage: Visual Studio 2017\n\nconfiguration:\n - Debug\n - Release\n\nenvironment:\n matrix:\n - compiler: msvc-15-seh\n generator: \"Visual Studio 15 2017\"\n\n - compiler: msvc-15-seh\n generator: \"Visual Studio 15 2017 Win64\"\n\n - compiler: msvc-14-seh\n generator: \"Visual Studio 14 2015\"\n\n - compiler: msvc-14-seh\n generator: \"Visual Studio 14 2015 Win64\"\n\n - compiler: gcc-5.3.0-posix\n generator: \"MinGW Makefiles\"\n cxx_path: 'C:\\mingw-w64\\i686-5.3.0-posix-dwarf-rt_v4-rev0\\mingw32\\bin'\n APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015\n\nmatrix:\n fast_finish: true\n\ninstall:\n # git bash conflicts with MinGW makefiles\n - if \"%generator%\"==\"MinGW Makefiles\" (set \"PATH=%PATH:C:\\Program Files\\Git\\usr\\bin;=%\")\n - if not \"%cxx_path%\"==\"\" (set \"PATH=%PATH%;%cxx_path%\")\n\nbuild_script:\n - md _build -Force\n - cd _build\n - echo %configuration%\n - cmake -G \"%generator%\" \"-DCMAKE_BUILD_TYPE=%configuration%\" -DBENCHMARK_DOWNLOAD_DEPENDENCIES=ON ..\n - cmake --build . --config %configuration%\n\ntest_script:\n - ctest --build-config %configuration% --timeout 300 --output-on-failure\n\nartifacts:\n - path: '_build/CMakeFiles/*.log'\n name: logs\n - path: '_build/Testing/**/*.xml'\n name: test_results\n" }, { "path": "3rd/benchmark-1.8.2/bazel/benchmark_deps.bzl", "content": "load(\"@bazel_tools//tools/build_defs/repo:http.bzl\", \"http_archive\")\nload(\"@bazel_tools//tools/build_defs/repo:git.bzl\", \"new_git_repository\")\n\ndef benchmark_deps():\n \"\"\"Loads dependencies required to build Google Benchmark.\"\"\"\n\n if \"bazel_skylib\" not in native.existing_rules():\n http_archive(\n name = \"bazel_skylib\",\n sha256 = \"f7be3474d42aae265405a592bb7da8e171919d74c16f082a5457840f06054728\",\n urls = [\n \"https://mirror.bazel.build/github.com/bazelbuild/bazel-skylib/releases/download/1.2.1/bazel-skylib-1.2.1.tar.gz\",\n \"https://github.com/bazelbuild/bazel-skylib/releases/download/1.2.1/bazel-skylib-1.2.1.tar.gz\",\n ],\n )\n\n if \"rules_foreign_cc\" not in native.existing_rules():\n http_archive(\n name = \"rules_foreign_cc\",\n sha256 = \"bcd0c5f46a49b85b384906daae41d277b3dc0ff27c7c752cc51e43048a58ec83\",\n strip_prefix = \"rules_foreign_cc-0.7.1\",\n url = \"https://github.com/bazelbuild/rules_foreign_cc/archive/0.7.1.tar.gz\",\n )\n\n if \"rules_python\" not in native.existing_rules():\n http_archive(\n name = \"rules_python\",\n url = \"https://github.com/bazelbuild/rules_python/releases/download/0.1.0/rules_python-0.1.0.tar.gz\",\n sha256 = \"b6d46438523a3ec0f3cead544190ee13223a52f6a6765a29eae7b7cc24cc83a0\",\n )\n\n if \"com_google_absl\" not in native.existing_rules():\n http_archive(\n name = \"com_google_absl\",\n sha256 = \"f41868f7a938605c92936230081175d1eae87f6ea2c248f41077c8f88316f111\",\n strip_prefix = \"abseil-cpp-20200225.2\",\n urls = [\"https://github.com/abseil/abseil-cpp/archive/20200225.2.tar.gz\"],\n )\n\n if \"com_google_googletest\" not in native.existing_rules():\n new_git_repository(\n name = \"com_google_googletest\",\n remote = \"https://github.com/google/googletest.git\",\n tag = \"release-1.11.0\",\n )\n\n if \"nanobind\" not in native.existing_rules():\n new_git_repository(\n name = \"nanobind\",\n remote = \"https://github.com/wjakob/nanobind.git\",\n commit = \"1ffbfe836c9dac599496a170274ee0075094a607\", # v0.2.0\n shallow_since = \"1677873085 +0100\",\n build_file = \"@//bindings/python:nanobind.BUILD\",\n recursive_init_submodules = True,\n )\n\n if \"libpfm\" not in native.existing_rules():\n # Downloaded from v4.9.0 tag at https://sourceforge.net/p/perfmon2/libpfm4/ref/master/tags/\n http_archive(\n name = \"libpfm\",\n build_file = str(Label(\"//tools:libpfm.BUILD.bazel\")),\n sha256 = \"5da5f8872bde14b3634c9688d980f68bda28b510268723cc12973eedbab9fecc\",\n type = \"tar.gz\",\n strip_prefix = \"libpfm-4.11.0\",\n urls = [\"https://sourceforge.net/projects/perfmon2/files/libpfm4/libpfm-4.11.0.tar.gz/download\"],\n )\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/BUILD", "content": "exports_files(glob([\"*.BUILD\"]))\nexports_files([\"build_defs.bzl\"])\n\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/build_defs.bzl", "content": "_SHARED_LIB_SUFFIX = {\n \"//conditions:default\": \".so\",\n \"//:windows\": \".dll\",\n}\n\ndef py_extension(name, srcs, hdrs = [], copts = [], features = [], deps = []):\n for shared_lib_suffix in _SHARED_LIB_SUFFIX.values():\n shared_lib_name = name + shared_lib_suffix\n native.cc_binary(\n name = shared_lib_name,\n linkshared = True,\n linkstatic = True,\n srcs = srcs + hdrs,\n copts = copts,\n features = features,\n deps = deps,\n )\n\n return native.py_library(\n name = name,\n data = select({\n platform: [name + shared_lib_suffix]\n for platform, shared_lib_suffix in _SHARED_LIB_SUFFIX.items()\n }),\n )\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/google_benchmark/BUILD", "content": "load(\"//bindings/python:build_defs.bzl\", \"py_extension\")\n\npy_library(\n name = \"google_benchmark\",\n srcs = [\"__init__.py\"],\n visibility = [\"//visibility:public\"],\n deps = [\n \":_benchmark\",\n ],\n)\n\npy_extension(\n name = \"_benchmark\",\n srcs = [\"benchmark.cc\"],\n copts = [\n \"-fexceptions\",\n \"-fno-strict-aliasing\",\n ],\n features = [\n \"-use_header_modules\",\n \"-parse_headers\",\n ],\n deps = [\n \"//:benchmark\",\n \"@nanobind\",\n \"@python_headers\",\n ],\n)\n\npy_test(\n name = \"example\",\n srcs = [\"example.py\"],\n python_version = \"PY3\",\n srcs_version = \"PY3\",\n visibility = [\"//visibility:public\"],\n deps = [\n \":google_benchmark\",\n ],\n)\n\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/google_benchmark/__init__.py", "content": "# Copyright 2020 Google Inc. 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# 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\"\"\"Python benchmarking utilities.\n\nExample usage:\n import google_benchmark as benchmark\n\n @benchmark.register\n def my_benchmark(state):\n ... # Code executed outside `while` loop is not timed.\n\n while state:\n ... # Code executed within `while` loop is timed.\n\n if __name__ == '__main__':\n benchmark.main()\n\"\"\"\nimport atexit\n\nfrom absl import app\nfrom google_benchmark import _benchmark\nfrom google_benchmark._benchmark import (\n Counter,\n kNanosecond,\n kMicrosecond,\n kMillisecond,\n kSecond,\n oNone,\n o1,\n oN,\n oNSquared,\n oNCubed,\n oLogN,\n oNLogN,\n oAuto,\n oLambda,\n State,\n)\n\n\n__all__ = [\n \"register\",\n \"main\",\n \"Counter\",\n \"kNanosecond\",\n \"kMicrosecond\",\n \"kMillisecond\",\n \"kSecond\",\n \"oNone\",\n \"o1\",\n \"oN\",\n \"oNSquared\",\n \"oNCubed\",\n \"oLogN\",\n \"oNLogN\",\n \"oAuto\",\n \"oLambda\",\n \"State\",\n]\n\n__version__ = \"1.8.2\"\n\n\nclass __OptionMaker:\n \"\"\"A stateless class to collect benchmark options.\n\n Collect all decorator calls like @option.range(start=0, limit=1<<5).\n \"\"\"\n\n class Options:\n \"\"\"Pure data class to store options calls, along with the benchmarked function.\"\"\"\n\n def __init__(self, func):\n self.func = func\n self.builder_calls = []\n\n @classmethod\n def make(cls, func_or_options):\n \"\"\"Make Options from Options or the benchmarked function.\"\"\"\n if isinstance(func_or_options, cls.Options):\n return func_or_options\n return cls.Options(func_or_options)\n\n def __getattr__(self, builder_name):\n \"\"\"Append option call in the Options.\"\"\"\n\n # The function that get returned on @option.range(start=0, limit=1<<5).\n def __builder_method(*args, **kwargs):\n\n # The decorator that get called, either with the benchmared function\n # or the previous Options\n def __decorator(func_or_options):\n options = self.make(func_or_options)\n options.builder_calls.append((builder_name, args, kwargs))\n # The decorator returns Options so it is not technically a decorator\n # and needs a final call to @register\n return options\n\n return __decorator\n\n return __builder_method\n\n\n# Alias for nicer API.\n# We have to instantiate an object, even if stateless, to be able to use __getattr__\n# on option.range\noption = __OptionMaker()\n\n\ndef register(undefined=None, *, name=None):\n \"\"\"Register function for benchmarking.\"\"\"\n if undefined is None:\n # Decorator is called without parenthesis so we return a decorator\n return lambda f: register(f, name=name)\n\n # We have either the function to benchmark (simple case) or an instance of Options\n # (@option._ case).\n options = __OptionMaker.make(undefined)\n\n if name is None:\n name = options.func.__name__\n\n # We register the benchmark and reproduce all the @option._ calls onto the\n # benchmark builder pattern\n benchmark = _benchmark.RegisterBenchmark(name, options.func)\n for name, args, kwargs in options.builder_calls[::-1]:\n getattr(benchmark, name)(*args, **kwargs)\n\n # return the benchmarked function because the decorator does not modify it\n return options.func\n\n\ndef _flags_parser(argv):\n argv = _benchmark.Initialize(argv)\n return app.parse_flags_with_usage(argv)\n\n\ndef _run_benchmarks(argv):\n if len(argv) > 1:\n raise app.UsageError(\"Too many command-line arguments.\")\n return _benchmark.RunSpecifiedBenchmarks()\n\n\ndef main(argv=None):\n return app.run(_run_benchmarks, argv=argv, flags_parser=_flags_parser)\n\n\n# Methods for use with custom main function.\ninitialize = _benchmark.Initialize\nrun_benchmarks = _benchmark.RunSpecifiedBenchmarks\natexit.register(_benchmark.ClearRegisteredBenchmarks)\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/google_benchmark/benchmark.cc", "content": "// Benchmark for Python.\n\n#include \"benchmark/benchmark.h\"\n\n#include \"nanobind/nanobind.h\"\n#include \"nanobind/operators.h\"\n#include \"nanobind/stl/bind_map.h\"\n#include \"nanobind/stl/string.h\"\n#include \"nanobind/stl/vector.h\"\n\nNB_MAKE_OPAQUE(benchmark::UserCounters);\n\nnamespace {\nnamespace nb = nanobind;\n\nstd::vector Initialize(const std::vector& argv) {\n // The `argv` pointers here become invalid when this function returns, but\n // benchmark holds the pointer to `argv[0]`. We create a static copy of it\n // so it persists, and replace the pointer below.\n static std::string executable_name(argv[0]);\n std::vector ptrs;\n ptrs.reserve(argv.size());\n for (auto& arg : argv) {\n ptrs.push_back(const_cast(arg.c_str()));\n }\n ptrs[0] = const_cast(executable_name.c_str());\n int argc = static_cast(argv.size());\n benchmark::Initialize(&argc, ptrs.data());\n std::vector remaining_argv;\n remaining_argv.reserve(argc);\n for (int i = 0; i < argc; ++i) {\n remaining_argv.emplace_back(ptrs[i]);\n }\n return remaining_argv;\n}\n\nbenchmark::internal::Benchmark* RegisterBenchmark(const std::string& name,\n nb::callable f) {\n return benchmark::RegisterBenchmark(\n name, [f](benchmark::State& state) { f(&state); });\n}\n\nNB_MODULE(_benchmark, m) {\n\n using benchmark::TimeUnit;\n nb::enum_(m, \"TimeUnit\")\n .value(\"kNanosecond\", TimeUnit::kNanosecond)\n .value(\"kMicrosecond\", TimeUnit::kMicrosecond)\n .value(\"kMillisecond\", TimeUnit::kMillisecond)\n .value(\"kSecond\", TimeUnit::kSecond)\n .export_values();\n\n using benchmark::BigO;\n nb::enum_(m, \"BigO\")\n .value(\"oNone\", BigO::oNone)\n .value(\"o1\", BigO::o1)\n .value(\"oN\", BigO::oN)\n .value(\"oNSquared\", BigO::oNSquared)\n .value(\"oNCubed\", BigO::oNCubed)\n .value(\"oLogN\", BigO::oLogN)\n .value(\"oNLogN\", BigO::oNLogN)\n .value(\"oAuto\", BigO::oAuto)\n .value(\"oLambda\", BigO::oLambda)\n .export_values();\n\n using benchmark::internal::Benchmark;\n nb::class_(m, \"Benchmark\")\n // For methods returning a pointer to the current object, reference\n // return policy is used to ask nanobind not to take ownership of the\n // returned object and avoid calling delete on it.\n // https://pybind11.readthedocs.io/en/stable/advanced/functions.html#return-value-policies\n //\n // For methods taking a const std::vector<...>&, a copy is created\n // because a it is bound to a Python list.\n // https://pybind11.readthedocs.io/en/stable/advanced/cast/stl.html\n .def(\"unit\", &Benchmark::Unit, nb::rv_policy::reference)\n .def(\"arg\", &Benchmark::Arg, nb::rv_policy::reference)\n .def(\"args\", &Benchmark::Args, nb::rv_policy::reference)\n .def(\"range\", &Benchmark::Range, nb::rv_policy::reference,\n nb::arg(\"start\"), nb::arg(\"limit\"))\n .def(\"dense_range\", &Benchmark::DenseRange,\n nb::rv_policy::reference, nb::arg(\"start\"),\n nb::arg(\"limit\"), nb::arg(\"step\") = 1)\n .def(\"ranges\", &Benchmark::Ranges, nb::rv_policy::reference)\n .def(\"args_product\", &Benchmark::ArgsProduct,\n nb::rv_policy::reference)\n .def(\"arg_name\", &Benchmark::ArgName, nb::rv_policy::reference)\n .def(\"arg_names\", &Benchmark::ArgNames,\n nb::rv_policy::reference)\n .def(\"range_pair\", &Benchmark::RangePair,\n nb::rv_policy::reference, nb::arg(\"lo1\"), nb::arg(\"hi1\"),\n nb::arg(\"lo2\"), nb::arg(\"hi2\"))\n .def(\"range_multiplier\", &Benchmark::RangeMultiplier,\n nb::rv_policy::reference)\n .def(\"min_time\", &Benchmark::MinTime, nb::rv_policy::reference)\n .def(\"min_warmup_time\", &Benchmark::MinWarmUpTime,\n nb::rv_policy::reference)\n .def(\"iterations\", &Benchmark::Iterations,\n nb::rv_policy::reference)\n .def(\"repetitions\", &Benchmark::Repetitions,\n nb::rv_policy::reference)\n .def(\"report_aggregates_only\", &Benchmark::ReportAggregatesOnly,\n nb::rv_policy::reference, nb::arg(\"value\") = true)\n .def(\"display_aggregates_only\", &Benchmark::DisplayAggregatesOnly,\n nb::rv_policy::reference, nb::arg(\"value\") = true)\n .def(\"measure_process_cpu_time\", &Benchmark::MeasureProcessCPUTime,\n nb::rv_policy::reference)\n .def(\"use_real_time\", &Benchmark::UseRealTime,\n nb::rv_policy::reference)\n .def(\"use_manual_time\", &Benchmark::UseManualTime,\n nb::rv_policy::reference)\n .def(\n \"complexity\",\n (Benchmark * (Benchmark::*)(benchmark::BigO)) & Benchmark::Complexity,\n nb::rv_policy::reference,\n nb::arg(\"complexity\") = benchmark::oAuto);\n\n using benchmark::Counter;\n nb::class_ py_counter(m, \"Counter\");\n\n nb::enum_(py_counter, \"Flags\")\n .value(\"kDefaults\", Counter::Flags::kDefaults)\n .value(\"kIsRate\", Counter::Flags::kIsRate)\n .value(\"kAvgThreads\", Counter::Flags::kAvgThreads)\n .value(\"kAvgThreadsRate\", Counter::Flags::kAvgThreadsRate)\n .value(\"kIsIterationInvariant\", Counter::Flags::kIsIterationInvariant)\n .value(\"kIsIterationInvariantRate\",\n Counter::Flags::kIsIterationInvariantRate)\n .value(\"kAvgIterations\", Counter::Flags::kAvgIterations)\n .value(\"kAvgIterationsRate\", Counter::Flags::kAvgIterationsRate)\n .value(\"kInvert\", Counter::Flags::kInvert)\n .export_values()\n .def(nb::self | nb::self);\n\n nb::enum_(py_counter, \"OneK\")\n .value(\"kIs1000\", Counter::OneK::kIs1000)\n .value(\"kIs1024\", Counter::OneK::kIs1024)\n .export_values();\n\n py_counter\n .def(nb::init(),\n nb::arg(\"value\") = 0., nb::arg(\"flags\") = Counter::kDefaults,\n nb::arg(\"k\") = Counter::kIs1000)\n .def(\"__init__\", ([](Counter *c, double value) { new (c) Counter(value); }))\n .def_rw(\"value\", &Counter::value)\n .def_rw(\"flags\", &Counter::flags)\n .def_rw(\"oneK\", &Counter::oneK)\n .def(nb::init_implicit());\n\n nb::implicitly_convertible();\n\n nb::bind_map(m, \"UserCounters\");\n\n using benchmark::State;\n nb::class_(m, \"State\")\n .def(\"__bool__\", &State::KeepRunning)\n .def_prop_ro(\"keep_running\", &State::KeepRunning)\n .def(\"pause_timing\", &State::PauseTiming)\n .def(\"resume_timing\", &State::ResumeTiming)\n .def(\"skip_with_error\", &State::SkipWithError)\n .def_prop_ro(\"error_occurred\", &State::error_occurred)\n .def(\"set_iteration_time\", &State::SetIterationTime)\n .def_prop_rw(\"bytes_processed\", &State::bytes_processed,\n &State::SetBytesProcessed)\n .def_prop_rw(\"complexity_n\", &State::complexity_length_n,\n &State::SetComplexityN)\n .def_prop_rw(\"items_processed\", &State::items_processed,\n &State::SetItemsProcessed)\n .def(\"set_label\", &State::SetLabel)\n .def(\"range\", &State::range, nb::arg(\"pos\") = 0)\n .def_prop_ro(\"iterations\", &State::iterations)\n .def_prop_ro(\"name\", &State::name)\n .def_rw(\"counters\", &State::counters)\n .def_prop_ro(\"thread_index\", &State::thread_index)\n .def_prop_ro(\"threads\", &State::threads);\n\n m.def(\"Initialize\", Initialize);\n m.def(\"RegisterBenchmark\", RegisterBenchmark,\n nb::rv_policy::reference);\n m.def(\"RunSpecifiedBenchmarks\",\n []() { benchmark::RunSpecifiedBenchmarks(); });\n m.def(\"ClearRegisteredBenchmarks\", benchmark::ClearRegisteredBenchmarks);\n};\n} // namespace\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/google_benchmark/example.py", "content": "# Copyright 2020 Google Inc. 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# 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\"\"\"Example of Python using C++ benchmark framework.\n\nTo run this example, you must first install the `google_benchmark` Python package.\n\nTo install using `setup.py`, download and extract the `google_benchmark` source.\nIn the extracted directory, execute:\n python setup.py install\n\"\"\"\n\nimport random\nimport time\n\nimport google_benchmark as benchmark\nfrom google_benchmark import Counter\n\n\n@benchmark.register\ndef empty(state):\n while state:\n pass\n\n\n@benchmark.register\ndef sum_million(state):\n while state:\n sum(range(1_000_000))\n\n@benchmark.register\ndef pause_timing(state):\n \"\"\"Pause timing every iteration.\"\"\"\n while state:\n # Construct a list of random ints every iteration without timing it\n state.pause_timing()\n random_list = [random.randint(0, 100) for _ in range(100)]\n state.resume_timing()\n # Time the in place sorting algorithm\n random_list.sort()\n\n\n@benchmark.register\ndef skipped(state):\n if True: # Test some predicate here.\n state.skip_with_error(\"some error\")\n return # NOTE: You must explicitly return, or benchmark will continue.\n\n ... # Benchmark code would be here.\n\n\n@benchmark.register\ndef manual_timing(state):\n while state:\n # Manually count Python CPU time\n start = time.perf_counter() # perf_counter_ns() in Python 3.7+\n # Something to benchmark\n time.sleep(0.01)\n end = time.perf_counter()\n state.set_iteration_time(end - start)\n\n\n@benchmark.register\ndef custom_counters(state):\n \"\"\"Collect custom metric using benchmark.Counter.\"\"\"\n num_foo = 0.0\n while state:\n # Benchmark some code here\n pass\n # Collect some custom metric named foo\n num_foo += 0.13\n\n # Automatic Counter from numbers.\n state.counters[\"foo\"] = num_foo\n # Set a counter as a rate.\n state.counters[\"foo_rate\"] = Counter(num_foo, Counter.kIsRate)\n # Set a counter as an inverse of rate.\n state.counters[\"foo_inv_rate\"] = Counter(num_foo, Counter.kIsRate | Counter.kInvert)\n # Set a counter as a thread-average quantity.\n state.counters[\"foo_avg\"] = Counter(num_foo, Counter.kAvgThreads)\n # There's also a combined flag:\n state.counters[\"foo_avg_rate\"] = Counter(num_foo, Counter.kAvgThreadsRate)\n\n\n@benchmark.register\n@benchmark.option.measure_process_cpu_time()\n@benchmark.option.use_real_time()\ndef with_options(state):\n while state:\n sum(range(1_000_000))\n\n\n@benchmark.register(name=\"sum_million_microseconds\")\n@benchmark.option.unit(benchmark.kMicrosecond)\ndef with_options2(state):\n while state:\n sum(range(1_000_000))\n\n\n@benchmark.register\n@benchmark.option.arg(100)\n@benchmark.option.arg(1000)\ndef passing_argument(state):\n while state:\n sum(range(state.range(0)))\n\n\n@benchmark.register\n@benchmark.option.range(8, limit=8 << 10)\ndef using_range(state):\n while state:\n sum(range(state.range(0)))\n\n\n@benchmark.register\n@benchmark.option.range_multiplier(2)\n@benchmark.option.range(1 << 10, 1 << 18)\n@benchmark.option.complexity(benchmark.oN)\ndef computing_complexity(state):\n while state:\n sum(range(state.range(0)))\n state.complexity_n = state.range(0)\n\n\nif __name__ == \"__main__\":\n benchmark.main()\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/nanobind.BUILD", "content": "\nconfig_setting(\n name = \"msvc_compiler\",\n flag_values = {\"@bazel_tools//tools/cpp:compiler\": \"msvc-cl\"},\n)\n\ncc_library(\n name = \"nanobind\",\n hdrs = glob(\n include = [\n \"include/nanobind/*.h\",\n \"include/nanobind/stl/*.h\",\n \"include/nanobind/detail/*.h\",\n ],\n exclude = [],\n ),\n srcs = [\n \"include/nanobind/stl/detail/nb_dict.h\",\n \"include/nanobind/stl/detail/nb_list.h\",\n \"include/nanobind/stl/detail/traits.h\",\n \"ext/robin_map/include/tsl/robin_map.h\",\n \"ext/robin_map/include/tsl/robin_hash.h\",\n \"ext/robin_map/include/tsl/robin_growth_policy.h\",\n \"ext/robin_map/include/tsl/robin_set.h\",\n \"src/buffer.h\",\n \"src/common.cpp\",\n \"src/error.cpp\",\n \"src/implicit.cpp\",\n \"src/nb_enum.cpp\",\n \"src/nb_func.cpp\",\n \"src/nb_internals.cpp\",\n \"src/nb_internals.h\",\n \"src/nb_ndarray.cpp\",\n \"src/nb_type.cpp\",\n \"src/trampoline.cpp\",\n ],\n copts = select({\n \":msvc_compiler\": [],\n \"//conditions:default\": [\n \"-fexceptions\",\n \"-Os\", # size optimization\n \"-flto\", # enable LTO\n ],\n }),\n linkopts = select({\n \"@com_github_google_benchmark//:macos\": [\n \"-undefined dynamic_lookup\",\n \"-Wl,-no_fixup_chains\",\n \"-Wl,-dead_strip\",\n ],\n \"//conditions:default\": [],\n }),\n includes = [\"include\", \"ext/robin_map/include\"],\n deps = [\"@python_headers\"],\n visibility = [\"//visibility:public\"],\n)\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/python_headers.BUILD", "content": "cc_library(\n name = \"python_headers\",\n hdrs = glob([\"**/*.h\"]),\n includes = [\".\"],\n visibility = [\"//visibility:public\"],\n)\n" }, { "path": "3rd/benchmark-1.8.2/bindings/python/requirements.txt", "content": "absl-py>=0.7.1\n\n" }, { "path": "3rd/benchmark-1.8.2/cmake/Config.cmake.in", "content": "@PACKAGE_INIT@\n\ninclude (CMakeFindDependencyMacro)\n\nfind_dependency (Threads)\n\ninclude(\"${CMAKE_CURRENT_LIST_DIR}/@targets_export_name@.cmake\")\n" }, { "path": "3rd/benchmark-1.8.2/cmake/GoogleTest.cmake.in", "content": "cmake_minimum_required(VERSION 2.8.12)\n\nproject(googletest-download NONE)\n\n# Enable ExternalProject CMake module\ninclude(ExternalProject)\n\noption(ALLOW_DOWNLOADING_GOOGLETEST \"If googletest src tree is not found in location specified by GOOGLETEST_PATH, do fetch the archive from internet\" OFF)\nset(GOOGLETEST_PATH \"/usr/src/googletest\" CACHE PATH\n \"Path to the googletest root tree. Should contain googletest and googlemock subdirs. And CMakeLists.txt in root, and in both of these subdirs\")\n\n# Download and install GoogleTest\n\nmessage(STATUS \"Looking for Google Test sources\")\nmessage(STATUS \"Looking for Google Test sources in ${GOOGLETEST_PATH}\")\nif(EXISTS \"${GOOGLETEST_PATH}\" AND IS_DIRECTORY \"${GOOGLETEST_PATH}\" AND EXISTS \"${GOOGLETEST_PATH}/CMakeLists.txt\" AND\n EXISTS \"${GOOGLETEST_PATH}/googletest\" AND IS_DIRECTORY \"${GOOGLETEST_PATH}/googletest\" AND EXISTS \"${GOOGLETEST_PATH}/googletest/CMakeLists.txt\" AND\n EXISTS \"${GOOGLETEST_PATH}/googlemock\" AND IS_DIRECTORY \"${GOOGLETEST_PATH}/googlemock\" AND EXISTS \"${GOOGLETEST_PATH}/googlemock/CMakeLists.txt\")\n message(STATUS \"Found Google Test in ${GOOGLETEST_PATH}\")\n\n ExternalProject_Add(\n googletest\n PREFIX \"${CMAKE_BINARY_DIR}\"\n DOWNLOAD_DIR \"${CMAKE_BINARY_DIR}/download\"\n SOURCE_DIR \"${GOOGLETEST_PATH}\" # use existing src dir.\n BINARY_DIR \"${CMAKE_BINARY_DIR}/build\"\n CONFIGURE_COMMAND \"\"\n BUILD_COMMAND \"\"\n INSTALL_COMMAND \"\"\n TEST_COMMAND \"\"\n )\nelse()\n if(NOT ALLOW_DOWNLOADING_GOOGLETEST)\n message(SEND_ERROR \"Did not find Google Test sources! Either pass correct path in GOOGLETEST_PATH, or enable BENCHMARK_DOWNLOAD_DEPENDENCIES, or disable BENCHMARK_USE_BUNDLED_GTEST, or disable BENCHMARK_ENABLE_GTEST_TESTS / BENCHMARK_ENABLE_TESTING.\")\n return()\n else()\n message(WARNING \"Did not find Google Test sources! Fetching from web...\")\n ExternalProject_Add(\n googletest\n GIT_REPOSITORY https://github.com/google/googletest.git\n GIT_TAG \"release-1.11.0\"\n PREFIX \"${CMAKE_BINARY_DIR}\"\n STAMP_DIR \"${CMAKE_BINARY_DIR}/stamp\"\n DOWNLOAD_DIR \"${CMAKE_BINARY_DIR}/download\"\n SOURCE_DIR \"${CMAKE_BINARY_DIR}/src\"\n BINARY_DIR \"${CMAKE_BINARY_DIR}/build\"\n CONFIGURE_COMMAND \"\"\n BUILD_COMMAND \"\"\n INSTALL_COMMAND \"\"\n TEST_COMMAND \"\"\n )\n endif()\nendif()\n\nExternalProject_Get_Property(googletest SOURCE_DIR BINARY_DIR)\nfile(WRITE googletest-paths.cmake\n\"set(GOOGLETEST_SOURCE_DIR \\\"${SOURCE_DIR}\\\")\nset(GOOGLETEST_BINARY_DIR \\\"${BINARY_DIR}\\\")\n\")\n" }, { "path": "3rd/benchmark-1.8.2/cmake/benchmark.pc.in", "content": "prefix=@CMAKE_INSTALL_PREFIX@\nexec_prefix=${prefix}\nlibdir=@CMAKE_INSTALL_FULL_LIBDIR@\nincludedir=@CMAKE_INSTALL_FULL_INCLUDEDIR@\n\nName: @PROJECT_NAME@\nDescription: Google microbenchmark framework\nVersion: @VERSION@\n\nLibs: -L${libdir} -lbenchmark\nLibs.private: -lpthread\nCflags: -I${includedir}\n" }, { "path": "3rd/benchmark-1.8.2/cmake/gnu_posix_regex.cpp", "content": "#include \n#include \nint main() {\n std::string str = \"test0159\";\n regex_t re;\n int ec = regcomp(&re, \"^[a-z]+[0-9]+$\", REG_EXTENDED | REG_NOSUB);\n if (ec != 0) {\n return ec;\n }\n return regexec(&re, str.c_str(), 0, nullptr, 0) ? -1 : 0;\n}\n\n" }, { "path": "3rd/benchmark-1.8.2/cmake/posix_regex.cpp", "content": "#include \n#include \nint main() {\n std::string str = \"test0159\";\n regex_t re;\n int ec = regcomp(&re, \"^[a-z]+[0-9]+$\", REG_EXTENDED | REG_NOSUB);\n if (ec != 0) {\n return ec;\n }\n int ret = regexec(&re, str.c_str(), 0, nullptr, 0) ? -1 : 0;\n regfree(&re);\n return ret;\n}\n\n" }, { "path": "3rd/benchmark-1.8.2/cmake/pthread_affinity.cpp", "content": "#include \nint main() {\n cpu_set_t set;\n CPU_ZERO(&set);\n for (int i = 0; i < CPU_SETSIZE; ++i) {\n CPU_SET(i, &set);\n CPU_CLR(i, &set);\n }\n pthread_t self = pthread_self();\n int ret;\n ret = pthread_getaffinity_np(self, sizeof(set), &set);\n if (ret != 0) return ret;\n ret = pthread_setaffinity_np(self, sizeof(set), &set);\n if (ret != 0) return ret;\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/cmake/std_regex.cpp", "content": "#include \n#include \nint main() {\n const std::string str = \"test0159\";\n std::regex re;\n re = std::regex(\"^[a-z]+[0-9]+$\",\n std::regex_constants::extended | std::regex_constants::nosubs);\n return std::regex_search(str, re) ? 0 : -1;\n}\n\n" }, { "path": "3rd/benchmark-1.8.2/cmake/steady_clock.cpp", "content": "#include \n\nint main() {\n typedef std::chrono::steady_clock Clock;\n Clock::time_point tp = Clock::now();\n ((void)tp);\n}\n" }, { "path": "3rd/benchmark-1.8.2/cmake/thread_safety_attributes.cpp", "content": "#define HAVE_THREAD_SAFETY_ATTRIBUTES\n#include \"../src/mutex.h\"\n\nint main() {}\n" }, { "path": "3rd/benchmark-1.8.2/docs/AssemblyTests.md", "content": "# Assembly Tests\n\nThe Benchmark library provides a number of functions whose primary\npurpose in to affect assembly generation, including `DoNotOptimize`\nand `ClobberMemory`. In addition there are other functions,\nsuch as `KeepRunning`, for which generating good assembly is paramount.\n\nFor these functions it's important to have tests that verify the\ncorrectness and quality of the implementation. This requires testing\nthe code generated by the compiler.\n\nThis document describes how the Benchmark library tests compiler output,\nas well as how to properly write new tests.\n\n\n## Anatomy of a Test\n\nWriting a test has two steps:\n\n* Write the code you want to generate assembly for.\n* Add `// CHECK` lines to match against the verified assembly.\n\nExample:\n```c++\n\n// CHECK-LABEL: test_add:\nextern \"C\" int test_add() {\n extern int ExternInt;\n return ExternInt + 1;\n\n // CHECK: movl ExternInt(%rip), %eax\n // CHECK: addl %eax\n // CHECK: ret\n}\n\n```\n\n#### LLVM Filecheck\n\n[LLVM's Filecheck](https://llvm.org/docs/CommandGuide/FileCheck.html)\nis used to test the generated assembly against the `// CHECK` lines\nspecified in the tests source file. Please see the documentation\nlinked above for information on how to write `CHECK` directives.\n\n#### Tips and Tricks:\n\n* Tests should match the minimal amount of output required to establish\ncorrectness. `CHECK` directives don't have to match on the exact next line\nafter the previous match, so tests should omit checks for unimportant\nbits of assembly. ([`CHECK-NEXT`](https://llvm.org/docs/CommandGuide/FileCheck.html#the-check-next-directive)\ncan be used to ensure a match occurs exactly after the previous match).\n\n* The tests are compiled with `-O3 -g0`. So we're only testing the\noptimized output.\n\n* The assembly output is further cleaned up using `tools/strip_asm.py`.\nThis removes comments, assembler directives, and unused labels before\nthe test is run.\n\n* The generated and stripped assembly file for a test is output under\n`/test/.s`\n\n* Filecheck supports using [`CHECK` prefixes](https://llvm.org/docs/CommandGuide/FileCheck.html#cmdoption-check-prefixes)\nto specify lines that should only match in certain situations.\nThe Benchmark tests use `CHECK-CLANG` and `CHECK-GNU` for lines that\nare only expected to match Clang or GCC's output respectively. Normal\n`CHECK` lines match against all compilers. (Note: `CHECK-NOT` and\n`CHECK-LABEL` are NOT prefixes. They are versions of non-prefixed\n`CHECK` lines)\n\n* Use `extern \"C\"` to disable name mangling for specific functions. This\nmakes them easier to name in the `CHECK` lines.\n\n\n## Problems Writing Portable Tests\n\nWriting tests which check the code generated by a compiler are\ninherently non-portable. Different compilers and even different compiler\nversions may generate entirely different code. The Benchmark tests\nmust tolerate this.\n\nLLVM Filecheck provides a number of mechanisms to help write\n\"more portable\" tests; including [matching using regular expressions](https://llvm.org/docs/CommandGuide/FileCheck.html#filecheck-pattern-matching-syntax),\nallowing the creation of [named variables](https://llvm.org/docs/CommandGuide/FileCheck.html#filecheck-variables)\nfor later matching, and [checking non-sequential matches](https://llvm.org/docs/CommandGuide/FileCheck.html#the-check-dag-directive).\n\n#### Capturing Variables\n\nFor example, say GCC stores a variable in a register but Clang stores\nit in memory. To write a test that tolerates both cases we \"capture\"\nthe destination of the store, and then use the captured expression\nto write the remainder of the test.\n\n```c++\n// CHECK-LABEL: test_div_no_op_into_shr:\nextern \"C\" void test_div_no_op_into_shr(int value) {\n int divisor = 2;\n benchmark::DoNotOptimize(divisor); // hide the value from the optimizer\n return value / divisor;\n\n // CHECK: movl $2, [[DEST:.*]]\n // CHECK: idivl [[DEST]]\n // CHECK: ret\n}\n```\n\n#### Using Regular Expressions to Match Differing Output\n\nOften tests require testing assembly lines which may subtly differ\nbetween compilers or compiler versions. A common example of this\nis matching stack frame addresses. In this case regular expressions\ncan be used to match the differing bits of output. For example:\n\n\n```c++\nint ExternInt;\nstruct Point { int x, y, z; };\n\n// CHECK-LABEL: test_store_point:\nextern \"C\" void test_store_point() {\n Point p{ExternInt, ExternInt, ExternInt};\n benchmark::DoNotOptimize(p);\n\n // CHECK: movl ExternInt(%rip), %eax\n // CHECK: movl %eax, -{{[0-9]+}}(%rsp)\n // CHECK: movl %eax, -{{[0-9]+}}(%rsp)\n // CHECK: movl %eax, -{{[0-9]+}}(%rsp)\n // CHECK: ret\n}\n```\n\n\n## Current Requirements and Limitations\n\nThe tests require Filecheck to be installed along the `PATH` of the\nbuild machine. Otherwise the tests will be disabled.\n\nAdditionally, as mentioned in the previous section, codegen tests are\ninherently non-portable. Currently the tests are limited to:\n\n* x86_64 targets.\n* Compiled with GCC or Clang\n\nFurther work could be done, at least on a limited basis, to extend the\ntests to other architectures and compilers (using `CHECK` prefixes).\n\nFurthermore, the tests fail for builds which specify additional flags\nthat modify code generation, including `--coverage` or `-fsanitize=`.\n\n" }, { "path": "3rd/benchmark-1.8.2/docs/_config.yml", "content": "theme: jekyll-theme-minimal\n" }, { "path": "3rd/benchmark-1.8.2/docs/dependencies.md", "content": "# Build tool dependency policy\n\nWe follow the [Foundational C++ support policy](https://opensource.google/documentation/policies/cplusplus-support) for our build tools. In\nparticular the [\"Build Systems\" section](https://opensource.google/documentation/policies/cplusplus-support#build-systems).\n\n## CMake\n\nThe current supported version is CMake 3.10 as of 2023-08-10. Most modern\ndistributions include newer versions, for example:\n\n* Ubuntu 20.04 provides CMake 3.16.3\n* Debian 11.4 provides CMake 3.18.4\n* Ubuntu 22.04 provides CMake 3.22.1\n" }, { "path": "3rd/benchmark-1.8.2/docs/index.md", "content": "# Benchmark\n\n* [Assembly Tests](AssemblyTests.md)\n* [Dependencies](dependencies.md)\n* [Perf Counters](perf_counters.md)\n* [Platform Specific Build Instructions](platform_specific_build_instructions.md)\n* [Python Bindings](python_bindings.md)\n* [Random Interleaving](random_interleaving.md)\n* [Reducing Variance](reducing_variance.md)\n* [Releasing](releasing.md)\n* [Tools](tools.md)\n* [User Guide](user_guide.md)\n" }, { "path": "3rd/benchmark-1.8.2/docs/perf_counters.md", "content": "\n\n# User-Requested Performance Counters\n\nWhen running benchmarks, the user may choose to request collection of\nperformance counters. This may be useful in investigation scenarios - narrowing\ndown the cause of a regression; or verifying that the underlying cause of a\nperformance improvement matches expectations.\n\nThis feature is available if:\n\n* The benchmark is run on an architecture featuring a Performance Monitoring\n Unit (PMU),\n* The benchmark is compiled with support for collecting counters. Currently,\n this requires [libpfm](http://perfmon2.sourceforge.net/), which is built as a\n dependency via Bazel.\n\nThe feature does not require modifying benchmark code. Counter collection is\nhandled at the boundaries where timer collection is also handled. \n\nTo opt-in:\n* If using a Bazel build, add `--define pfm=1` to your build flags\n* If using CMake:\n * Install `libpfm4-dev`, e.g. `apt-get install libpfm4-dev`.\n * Enable the CMake flag `BENCHMARK_ENABLE_LIBPFM` in `CMakeLists.txt`.\n\nTo use, pass a comma-separated list of counter names through the\n`--benchmark_perf_counters` flag. The names are decoded through libpfm - meaning,\nthey are platform specific, but some (e.g. `CYCLES` or `INSTRUCTIONS`) are\nmapped by libpfm to platform-specifics - see libpfm\n[documentation](http://perfmon2.sourceforge.net/docs.html) for more details.\n\nThe counter values are reported back through the [User Counters](../README.md#custom-counters)\nmechanism, meaning, they are available in all the formats (e.g. JSON) supported\nby User Counters.\n" }, { "path": "3rd/benchmark-1.8.2/docs/platform_specific_build_instructions.md", "content": "# Platform Specific Build Instructions\n\n## Building with GCC\n\nWhen the library is built using GCC it is necessary to link with the pthread\nlibrary due to how GCC implements `std::thread`. Failing to link to pthread will\nlead to runtime exceptions (unless you're using libc++), not linker errors. See\n[issue #67](https://github.com/google/benchmark/issues/67) for more details. You\ncan link to pthread by adding `-pthread` to your linker command. Note, you can\nalso use `-lpthread`, but there are potential issues with ordering of command\nline parameters if you use that.\n\nOn QNX, the pthread library is part of libc and usually included automatically\n(see\n[`pthread_create()`](https://www.qnx.com/developers/docs/7.1/index.html#com.qnx.doc.neutrino.lib_ref/topic/p/pthread_create.html)).\nThere's no separate pthread library to link.\n\n## Building with Visual Studio 2015 or 2017\n\nThe `shlwapi` library (`-lshlwapi`) is required to support a call to `CPUInfo` which reads the registry. Either add `shlwapi.lib` under `[ Configuration Properties > Linker > Input ]`, or use the following:\n\n```\n// Alternatively, can add libraries using linker options.\n#ifdef _WIN32\n#pragma comment ( lib, \"Shlwapi.lib\" )\n#ifdef _DEBUG\n#pragma comment ( lib, \"benchmarkd.lib\" )\n#else\n#pragma comment ( lib, \"benchmark.lib\" )\n#endif\n#endif\n```\n\nCan also use the graphical version of CMake:\n* Open `CMake GUI`.\n* Under `Where to build the binaries`, same path as source plus `build`.\n* Under `CMAKE_INSTALL_PREFIX`, same path as source plus `install`.\n* Click `Configure`, `Generate`, `Open Project`.\n* If build fails, try deleting entire directory and starting again, or unticking options to build less.\n\n## Building with Intel 2015 Update 1 or Intel System Studio Update 4\n\nSee instructions for building with Visual Studio. Once built, right click on the solution and change the build to Intel.\n\n## Building on Solaris\n\nIf you're running benchmarks on solaris, you'll want the kstat library linked in\ntoo (`-lkstat`)." }, { "path": "3rd/benchmark-1.8.2/docs/python_bindings.md", "content": "# Building and installing Python bindings\n\nPython bindings are available as wheels on [PyPI](https://pypi.org/project/google-benchmark/) for importing and \nusing Google Benchmark directly in Python. \nCurrently, pre-built wheels exist for macOS (both ARM64 and Intel x86), Linux x86-64 and 64-bit Windows.\nSupported Python versions are Python 3.7 - 3.10.\n\nTo install Google Benchmark's Python bindings, run:\n\n```bash\npython -m pip install --upgrade pip # for manylinux2014 support\npython -m pip install google-benchmark\n```\n\nIn order to keep your system Python interpreter clean, it is advisable to run these commands in a virtual\nenvironment. See the [official Python documentation](https://docs.python.org/3/library/venv.html) \non how to create virtual environments.\n\nTo build a wheel directly from source, you can follow these steps:\n```bash\ngit clone https://github.com/google/benchmark.git\ncd benchmark\n# create a virtual environment and activate it\npython3 -m venv venv --system-site-packages\nsource venv/bin/activate # .\\venv\\Scripts\\Activate.ps1 on Windows\n\n# upgrade Python's system-wide packages\npython -m pip install --upgrade pip setuptools wheel\n# builds the wheel and stores it in the directory \"wheelhouse\".\npython -m pip wheel . -w wheelhouse\n```\n\nNB: Building wheels from source requires Bazel. For platform-specific instructions on how to install Bazel,\nrefer to the [Bazel installation docs](https://bazel.build/install).\n" }, { "path": "3rd/benchmark-1.8.2/docs/random_interleaving.md", "content": "\n\n# Random Interleaving\n\n[Random Interleaving](https://github.com/google/benchmark/issues/1051) is a\ntechnique to lower run-to-run variance. It randomly interleaves repetitions of a\nmicrobenchmark with repetitions from other microbenchmarks in the same benchmark\ntest. Data shows it is able to lower run-to-run variance by\n[40%](https://github.com/google/benchmark/issues/1051) on average.\n\nTo use, you mainly need to set `--benchmark_enable_random_interleaving=true`,\nand optionally specify non-zero repetition count `--benchmark_repetitions=9`\nand optionally decrease the per-repetition time `--benchmark_min_time=0.1`.\n" }, { "path": "3rd/benchmark-1.8.2/docs/reducing_variance.md", "content": "# Reducing Variance\n\n\n\n## Disabling CPU Frequency Scaling\n\nIf you see this error:\n\n```\n***WARNING*** CPU scaling is enabled, the benchmark real time measurements may be noisy and will incur extra overhead.\n```\n\nyou might want to disable the CPU frequency scaling while running the\nbenchmark, as well as consider other ways to stabilize the performance of\nyour system while benchmarking.\n\nSee [Reducing Variance](reducing_variance.md) for more information.\n\nExactly how to do this depends on the Linux distribution,\ndesktop environment, and installed programs. Specific details are a moving\ntarget, so we will not attempt to exhaustively document them here.\n\nOne simple option is to use the `cpupower` program to change the\nperformance governor to \"performance\". This tool is maintained along with\nthe Linux kernel and provided by your distribution.\n\nIt must be run as root, like this:\n\n```bash\nsudo cpupower frequency-set --governor performance\n```\n\nAfter this you can verify that all CPUs are using the performance governor\nby running this command:\n\n```bash\ncpupower frequency-info -o proc\n```\n\nThe benchmarks you subsequently run will have less variance.\n\n\n\n## Reducing Variance in Benchmarks\n\nThe Linux CPU frequency governor [discussed\nabove](user_guide#disabling-cpu-frequency-scaling) is not the only source\nof noise in benchmarks. Some, but not all, of the sources of variance\ninclude:\n\n1. On multi-core machines not all CPUs/CPU cores/CPU threads run the same\n speed, so running a benchmark one time and then again may give a\n different result depending on which CPU it ran on.\n2. CPU scaling features that run on the CPU, like Intel's Turbo Boost and\n AMD Turbo Core and Precision Boost, can temporarily change the CPU\n frequency even when the using the \"performance\" governor on Linux.\n3. Context switching between CPUs, or scheduling competition on the CPU the\n benchmark is running on.\n4. Intel Hyperthreading or AMD SMT causing the same issue as above.\n5. Cache effects caused by code running on other CPUs.\n6. Non-uniform memory architectures (NUMA).\n\nThese can cause variance in benchmarks results within a single run\n(`--benchmark_repetitions=N`) or across multiple runs of the benchmark\nprogram.\n\nReducing sources of variance is OS and architecture dependent, which is one\nreason some companies maintain machines dedicated to performance testing.\n\nSome of the easier and and effective ways of reducing variance on a typical\nLinux workstation are:\n\n1. Use the performance governor as [discussed\nabove](user_guide#disabling-cpu-frequency-scaling).\n1. Disable processor boosting by:\n ```sh\n echo 0 | sudo tee /sys/devices/system/cpu/cpufreq/boost\n ```\n See the Linux kernel's\n [boost.txt](https://www.kernel.org/doc/Documentation/cpu-freq/boost.txt)\n for more information.\n2. Set the benchmark program's task affinity to a fixed cpu. For example:\n ```sh\n taskset -c 0 ./mybenchmark\n ```\n3. Disabling Hyperthreading/SMT. This can be done in the Bios or using the\n `/sys` file system (see the LLVM project's [Benchmarking\n tips](https://llvm.org/docs/Benchmarking.html)).\n4. Close other programs that do non-trivial things based on timers, such as\n your web browser, desktop environment, etc.\n5. Reduce the working set of your benchmark to fit within the L1 cache, but\n do be aware that this may lead you to optimize for an unrelistic\n situation.\n\nFurther resources on this topic:\n\n1. The LLVM project's [Benchmarking\n tips](https://llvm.org/docs/Benchmarking.html).\n1. The Arch Wiki [Cpu frequency\nscaling](https://wiki.archlinux.org/title/CPU_frequency_scaling) page.\n" }, { "path": "3rd/benchmark-1.8.2/docs/releasing.md", "content": "# How to release\n\n* Make sure you're on main and synced to HEAD\n* Ensure the project builds and tests run\n * `parallel -j0 exec ::: test/*_test` can help ensure everything at least\n passes\n* Prepare release notes\n * `git log $(git describe --abbrev=0 --tags)..HEAD` gives you the list of\n commits between the last annotated tag and HEAD\n * Pick the most interesting.\n* Create one last commit that updates the version saved in `CMakeLists.txt`, `MODULE.bazel`\n and the `__version__` variable in `bindings/python/google_benchmark/__init__.py`to the\n release version you're creating. (This version will be used if benchmark is installed\n from the archive you'll be creating in the next step.)\n\n```\nproject (benchmark VERSION 1.8.0 LANGUAGES CXX)\n```\n\n```\nmodule(name = \"com_github_google_benchmark\", version=\"1.8.0\")\n```\n\n```python\n# bindings/python/google_benchmark/__init__.py\n\n# ...\n\n__version__ = \"1.8.0\" # <-- change this to the release version you are creating\n\n# ...\n```\n\n* Create a release through github's interface\n * Note this will create a lightweight tag.\n * Update this to an annotated tag:\n * `git pull --tags`\n * `git tag -a -f `\n * `git push --force --tags origin`\n* Confirm that the \"Build and upload Python wheels\" action runs to completion\n * run it manually if it hasn't run\n" }, { "path": "3rd/benchmark-1.8.2/docs/tools.md", "content": "# Benchmark Tools\n\n## compare.py\n\nThe `compare.py` can be used to compare the result of benchmarks.\n\n### Dependencies\nThe utility relies on the [scipy](https://www.scipy.org) package which can be installed using pip:\n```bash\npip3 install -r requirements.txt\n```\n\n### Displaying aggregates only\n\nThe switch `-a` / `--display_aggregates_only` can be used to control the\ndisplayment of the normal iterations vs the aggregates. When passed, it will\nbe passthrough to the benchmark binaries to be run, and will be accounted for\nin the tool itself; only the aggregates will be displayed, but not normal runs.\nIt only affects the display, the separate runs will still be used to calculate\nthe U test.\n\n### Modes of operation\n\nThere are three modes of operation:\n\n1. Just compare two benchmarks\nThe program is invoked like:\n\n``` bash\n$ compare.py benchmarks [benchmark options]...\n```\nWhere `` and `` either specify a benchmark executable file, or a JSON output file. The type of the input file is automatically detected. If a benchmark executable is specified then the benchmark is run to obtain the results. Otherwise the results are simply loaded from the output file.\n\n`[benchmark options]` will be passed to the benchmarks invocations. They can be anything that binary accepts, be it either normal `--benchmark_*` parameters, or some custom parameters your binary takes.\n\nExample output:\n```\n$ ./compare.py benchmarks ./a.out ./a.out\nRUNNING: ./a.out --benchmark_out=/tmp/tmprBT5nW\nRun on (8 X 4000 MHz CPU s)\n2017-11-07 21:16:44\n------------------------------------------------------\nBenchmark Time CPU Iterations\n------------------------------------------------------\nBM_memcpy/8 36 ns 36 ns 19101577 211.669MB/s\nBM_memcpy/64 76 ns 76 ns 9412571 800.199MB/s\nBM_memcpy/512 84 ns 84 ns 8249070 5.64771GB/s\nBM_memcpy/1024 116 ns 116 ns 6181763 8.19505GB/s\nBM_memcpy/8192 643 ns 643 ns 1062855 11.8636GB/s\nBM_copy/8 222 ns 222 ns 3137987 34.3772MB/s\nBM_copy/64 1608 ns 1608 ns 432758 37.9501MB/s\nBM_copy/512 12589 ns 12589 ns 54806 38.7867MB/s\nBM_copy/1024 25169 ns 25169 ns 27713 38.8003MB/s\nBM_copy/8192 201165 ns 201112 ns 3486 38.8466MB/s\nRUNNING: ./a.out --benchmark_out=/tmp/tmpt1wwG_\nRun on (8 X 4000 MHz CPU s)\n2017-11-07 21:16:53\n------------------------------------------------------\nBenchmark Time CPU Iterations\n------------------------------------------------------\nBM_memcpy/8 36 ns 36 ns 19397903 211.255MB/s\nBM_memcpy/64 73 ns 73 ns 9691174 839.635MB/s\nBM_memcpy/512 85 ns 85 ns 8312329 5.60101GB/s\nBM_memcpy/1024 118 ns 118 ns 6438774 8.11608GB/s\nBM_memcpy/8192 656 ns 656 ns 1068644 11.6277GB/s\nBM_copy/8 223 ns 223 ns 3146977 34.2338MB/s\nBM_copy/64 1611 ns 1611 ns 435340 37.8751MB/s\nBM_copy/512 12622 ns 12622 ns 54818 38.6844MB/s\nBM_copy/1024 25257 ns 25239 ns 27779 38.6927MB/s\nBM_copy/8192 205013 ns 205010 ns 3479 38.108MB/s\nComparing ./a.out to ./a.out\nBenchmark Time CPU Time Old Time New CPU Old CPU New\n------------------------------------------------------------------------------------------------------\nBM_memcpy/8 +0.0020 +0.0020 36 36 36 36\nBM_memcpy/64 -0.0468 -0.0470 76 73 76 73\nBM_memcpy/512 +0.0081 +0.0083 84 85 84 85\nBM_memcpy/1024 +0.0098 +0.0097 116 118 116 118\nBM_memcpy/8192 +0.0200 +0.0203 643 656 643 656\nBM_copy/8 +0.0046 +0.0042 222 223 222 223\nBM_copy/64 +0.0020 +0.0020 1608 1611 1608 1611\nBM_copy/512 +0.0027 +0.0026 12589 12622 12589 12622\nBM_copy/1024 +0.0035 +0.0028 25169 25257 25169 25239\nBM_copy/8192 +0.0191 +0.0194 201165 205013 201112 205010\n```\n\nWhat it does is for the every benchmark from the first run it looks for the benchmark with exactly the same name in the second run, and then compares the results. If the names differ, the benchmark is omitted from the diff.\nAs you can note, the values in `Time` and `CPU` columns are calculated as `(new - old) / |old|`.\n\n2. Compare two different filters of one benchmark\nThe program is invoked like:\n\n``` bash\n$ compare.py filters [benchmark options]...\n```\nWhere `` either specify a benchmark executable file, or a JSON output file. The type of the input file is automatically detected. If a benchmark executable is specified then the benchmark is run to obtain the results. Otherwise the results are simply loaded from the output file.\n\nWhere `` and `` are the same regex filters that you would pass to the `[--benchmark_filter=]` parameter of the benchmark binary.\n\n`[benchmark options]` will be passed to the benchmarks invocations. They can be anything that binary accepts, be it either normal `--benchmark_*` parameters, or some custom parameters your binary takes.\n\nExample output:\n```\n$ ./compare.py filters ./a.out BM_memcpy BM_copy\nRUNNING: ./a.out --benchmark_filter=BM_memcpy --benchmark_out=/tmp/tmpBWKk0k\nRun on (8 X 4000 MHz CPU s)\n2017-11-07 21:37:28\n------------------------------------------------------\nBenchmark Time CPU Iterations\n------------------------------------------------------\nBM_memcpy/8 36 ns 36 ns 17891491 211.215MB/s\nBM_memcpy/64 74 ns 74 ns 9400999 825.646MB/s\nBM_memcpy/512 87 ns 87 ns 8027453 5.46126GB/s\nBM_memcpy/1024 111 ns 111 ns 6116853 8.5648GB/s\nBM_memcpy/8192 657 ns 656 ns 1064679 11.6247GB/s\nRUNNING: ./a.out --benchmark_filter=BM_copy --benchmark_out=/tmp/tmpAvWcOM\nRun on (8 X 4000 MHz CPU s)\n2017-11-07 21:37:33\n----------------------------------------------------\nBenchmark Time CPU Iterations\n----------------------------------------------------\nBM_copy/8 227 ns 227 ns 3038700 33.6264MB/s\nBM_copy/64 1640 ns 1640 ns 426893 37.2154MB/s\nBM_copy/512 12804 ns 12801 ns 55417 38.1444MB/s\nBM_copy/1024 25409 ns 25407 ns 27516 38.4365MB/s\nBM_copy/8192 202986 ns 202990 ns 3454 38.4871MB/s\nComparing BM_memcpy to BM_copy (from ./a.out)\nBenchmark Time CPU Time Old Time New CPU Old CPU New\n--------------------------------------------------------------------------------------------------------------------\n[BM_memcpy vs. BM_copy]/8 +5.2829 +5.2812 36 227 36 227\n[BM_memcpy vs. BM_copy]/64 +21.1719 +21.1856 74 1640 74 1640\n[BM_memcpy vs. BM_copy]/512 +145.6487 +145.6097 87 12804 87 12801\n[BM_memcpy vs. BM_copy]/1024 +227.1860 +227.1776 111 25409 111 25407\n[BM_memcpy vs. BM_copy]/8192 +308.1664 +308.2898 657 202986 656 202990\n```\n\nAs you can see, it applies filter to the benchmarks, both when running the benchmark, and before doing the diff. And to make the diff work, the matches are replaced with some common string. Thus, you can compare two different benchmark families within one benchmark binary.\nAs you can note, the values in `Time` and `CPU` columns are calculated as `(new - old) / |old|`.\n\n3. Compare filter one from benchmark one to filter two from benchmark two:\nThe program is invoked like:\n\n``` bash\n$ compare.py filters [benchmark options]...\n```\n\nWhere `` and `` either specify a benchmark executable file, or a JSON output file. The type of the input file is automatically detected. If a benchmark executable is specified then the benchmark is run to obtain the results. Otherwise the results are simply loaded from the output file.\n\nWhere `` and `` are the same regex filters that you would pass to the `[--benchmark_filter=]` parameter of the benchmark binary.\n\n`[benchmark options]` will be passed to the benchmarks invocations. They can be anything that binary accepts, be it either normal `--benchmark_*` parameters, or some custom parameters your binary takes.\n\nExample output:\n```\n$ ./compare.py benchmarksfiltered ./a.out BM_memcpy ./a.out BM_copy\nRUNNING: ./a.out --benchmark_filter=BM_memcpy --benchmark_out=/tmp/tmp_FvbYg\nRun on (8 X 4000 MHz CPU s)\n2017-11-07 21:38:27\n------------------------------------------------------\nBenchmark Time CPU Iterations\n------------------------------------------------------\nBM_memcpy/8 37 ns 37 ns 18953482 204.118MB/s\nBM_memcpy/64 74 ns 74 ns 9206578 828.245MB/s\nBM_memcpy/512 91 ns 91 ns 8086195 5.25476GB/s\nBM_memcpy/1024 120 ns 120 ns 5804513 7.95662GB/s\nBM_memcpy/8192 664 ns 664 ns 1028363 11.4948GB/s\nRUNNING: ./a.out --benchmark_filter=BM_copy --benchmark_out=/tmp/tmpDfL5iE\nRun on (8 X 4000 MHz CPU s)\n2017-11-07 21:38:32\n----------------------------------------------------\nBenchmark Time CPU Iterations\n----------------------------------------------------\nBM_copy/8 230 ns 230 ns 2985909 33.1161MB/s\nBM_copy/64 1654 ns 1653 ns 419408 36.9137MB/s\nBM_copy/512 13122 ns 13120 ns 53403 37.2156MB/s\nBM_copy/1024 26679 ns 26666 ns 26575 36.6218MB/s\nBM_copy/8192 215068 ns 215053 ns 3221 36.3283MB/s\nComparing BM_memcpy (from ./a.out) to BM_copy (from ./a.out)\nBenchmark Time CPU Time Old Time New CPU Old CPU New\n--------------------------------------------------------------------------------------------------------------------\n[BM_memcpy vs. BM_copy]/8 +5.1649 +5.1637 37 230 37 230\n[BM_memcpy vs. BM_copy]/64 +21.4352 +21.4374 74 1654 74 1653\n[BM_memcpy vs. BM_copy]/512 +143.6022 +143.5865 91 13122 91 13120\n[BM_memcpy vs. BM_copy]/1024 +221.5903 +221.4790 120 26679 120 26666\n[BM_memcpy vs. BM_copy]/8192 +322.9059 +323.0096 664 215068 664 215053\n```\nThis is a mix of the previous two modes, two (potentially different) benchmark binaries are run, and a different filter is applied to each one.\nAs you can note, the values in `Time` and `CPU` columns are calculated as `(new - old) / |old|`.\n\n### U test\n\nIf there is a sufficient repetition count of the benchmarks, the tool can do\na [U Test](https://en.wikipedia.org/wiki/Mann%E2%80%93Whitney_U_test), of the\nnull hypothesis that it is equally likely that a randomly selected value from\none sample will be less than or greater than a randomly selected value from a\nsecond sample.\n\nIf the calculated p-value is below this value is lower than the significance\nlevel alpha, then the result is said to be statistically significant and the\nnull hypothesis is rejected. Which in other words means that the two benchmarks\naren't identical.\n\n**WARNING**: requires **LARGE** (no less than 9) number of repetitions to be\nmeaningful!\n" }, { "path": "3rd/benchmark-1.8.2/docs/user_guide.md", "content": "# User Guide\n\n## Command Line\n\n[Output Formats](#output-formats)\n\n[Output Files](#output-files)\n\n[Running Benchmarks](#running-benchmarks)\n\n[Running a Subset of Benchmarks](#running-a-subset-of-benchmarks)\n\n[Result Comparison](#result-comparison)\n\n[Extra Context](#extra-context)\n\n## Library\n\n[Runtime and Reporting Considerations](#runtime-and-reporting-considerations)\n\n[Setup/Teardown](#setupteardown)\n\n[Passing Arguments](#passing-arguments)\n\n[Custom Benchmark Name](#custom-benchmark-name)\n\n[Calculating Asymptotic Complexity](#asymptotic-complexity)\n\n[Templated Benchmarks](#templated-benchmarks)\n\n[Fixtures](#fixtures)\n\n[Custom Counters](#custom-counters)\n\n[Multithreaded Benchmarks](#multithreaded-benchmarks)\n\n[CPU Timers](#cpu-timers)\n\n[Manual Timing](#manual-timing)\n\n[Setting the Time Unit](#setting-the-time-unit)\n\n[Random Interleaving](random_interleaving.md)\n\n[User-Requested Performance Counters](perf_counters.md)\n\n[Preventing Optimization](#preventing-optimization)\n\n[Reporting Statistics](#reporting-statistics)\n\n[Custom Statistics](#custom-statistics)\n\n[Memory Usage](#memory-usage)\n\n[Using RegisterBenchmark](#using-register-benchmark)\n\n[Exiting with an Error](#exiting-with-an-error)\n\n[A Faster `KeepRunning` Loop](#a-faster-keep-running-loop)\n\n## Benchmarking Tips\n\n[Disabling CPU Frequency Scaling](#disabling-cpu-frequency-scaling)\n\n[Reducing Variance in Benchmarks](reducing_variance.md)\n\n\n\n## Output Formats\n\nThe library supports multiple output formats. Use the\n`--benchmark_format=` flag (or set the\n`BENCHMARK_FORMAT=` environment variable) to set\nthe format type. `console` is the default format.\n\nThe Console format is intended to be a human readable format. By default\nthe format generates color output. Context is output on stderr and the\ntabular data on stdout. Example tabular output looks like:\n\n```\nBenchmark Time(ns) CPU(ns) Iterations\n----------------------------------------------------------------------\nBM_SetInsert/1024/1 28928 29349 23853 133.097kB/s 33.2742k items/s\nBM_SetInsert/1024/8 32065 32913 21375 949.487kB/s 237.372k items/s\nBM_SetInsert/1024/10 33157 33648 21431 1.13369MB/s 290.225k items/s\n```\n\nThe JSON format outputs human readable json split into two top level attributes.\nThe `context` attribute contains information about the run in general, including\ninformation about the CPU and the date.\nThe `benchmarks` attribute contains a list of every benchmark run. Example json\noutput looks like:\n\n```json\n{\n \"context\": {\n \"date\": \"2015/03/17-18:40:25\",\n \"num_cpus\": 40,\n \"mhz_per_cpu\": 2801,\n \"cpu_scaling_enabled\": false,\n \"build_type\": \"debug\"\n },\n \"benchmarks\": [\n {\n \"name\": \"BM_SetInsert/1024/1\",\n \"iterations\": 94877,\n \"real_time\": 29275,\n \"cpu_time\": 29836,\n \"bytes_per_second\": 134066,\n \"items_per_second\": 33516\n },\n {\n \"name\": \"BM_SetInsert/1024/8\",\n \"iterations\": 21609,\n \"real_time\": 32317,\n \"cpu_time\": 32429,\n \"bytes_per_second\": 986770,\n \"items_per_second\": 246693\n },\n {\n \"name\": \"BM_SetInsert/1024/10\",\n \"iterations\": 21393,\n \"real_time\": 32724,\n \"cpu_time\": 33355,\n \"bytes_per_second\": 1199226,\n \"items_per_second\": 299807\n }\n ]\n}\n```\n\nThe CSV format outputs comma-separated values. The `context` is output on stderr\nand the CSV itself on stdout. Example CSV output looks like:\n\n```\nname,iterations,real_time,cpu_time,bytes_per_second,items_per_second,label\n\"BM_SetInsert/1024/1\",65465,17890.7,8407.45,475768,118942,\n\"BM_SetInsert/1024/8\",116606,18810.1,9766.64,3.27646e+06,819115,\n\"BM_SetInsert/1024/10\",106365,17238.4,8421.53,4.74973e+06,1.18743e+06,\n```\n\n\n\n## Output Files\n\nWrite benchmark results to a file with the `--benchmark_out=` option\n(or set `BENCHMARK_OUT`). Specify the output format with\n`--benchmark_out_format={json|console|csv}` (or set\n`BENCHMARK_OUT_FORMAT={json|console|csv}`). Note that the 'csv' reporter is\ndeprecated and the saved `.csv` file\n[is not parsable](https://github.com/google/benchmark/issues/794) by csv\nparsers.\n\nSpecifying `--benchmark_out` does not suppress the console output.\n\n\n\n## Running Benchmarks\n\nBenchmarks are executed by running the produced binaries. Benchmarks binaries,\nby default, accept options that may be specified either through their command\nline interface or by setting environment variables before execution. For every\n`--option_flag=` CLI switch, a corresponding environment variable\n`OPTION_FLAG=` exist and is used as default if set (CLI switches always\n prevails). A complete list of CLI options is available running benchmarks\n with the `--help` switch.\n\n\n\n## Running a Subset of Benchmarks\n\nThe `--benchmark_filter=` option (or `BENCHMARK_FILTER=`\nenvironment variable) can be used to only run the benchmarks that match\nthe specified ``. For example:\n\n```bash\n$ ./run_benchmarks.x --benchmark_filter=BM_memcpy/32\nRun on (1 X 2300 MHz CPU )\n2016-06-25 19:34:24\nBenchmark Time CPU Iterations\n----------------------------------------------------\nBM_memcpy/32 11 ns 11 ns 79545455\nBM_memcpy/32k 2181 ns 2185 ns 324074\nBM_memcpy/32 12 ns 12 ns 54687500\nBM_memcpy/32k 1834 ns 1837 ns 357143\n```\n\n## Disabling Benchmarks\n\nIt is possible to temporarily disable benchmarks by renaming the benchmark\nfunction to have the prefix \"DISABLED_\". This will cause the benchmark to\nbe skipped at runtime.\n\n\n\n## Result comparison\n\nIt is possible to compare the benchmarking results.\nSee [Additional Tooling Documentation](tools.md)\n\n\n\n## Extra Context\n\nSometimes it's useful to add extra context to the content printed before the\nresults. By default this section includes information about the CPU on which\nthe benchmarks are running. If you do want to add more context, you can use\nthe `benchmark_context` command line flag:\n\n```bash\n$ ./run_benchmarks --benchmark_context=pwd=`pwd`\nRun on (1 x 2300 MHz CPU)\npwd: /home/user/benchmark/\nBenchmark Time CPU Iterations\n----------------------------------------------------\nBM_memcpy/32 11 ns 11 ns 79545455\nBM_memcpy/32k 2181 ns 2185 ns 324074\n```\n\nYou can get the same effect with the API:\n\n```c++\n benchmark::AddCustomContext(\"foo\", \"bar\");\n```\n\nNote that attempts to add a second value with the same key will fail with an\nerror message.\n\n\n\n## Runtime and Reporting Considerations\n\nWhen the benchmark binary is executed, each benchmark function is run serially.\nThe number of iterations to run is determined dynamically by running the\nbenchmark a few times and measuring the time taken and ensuring that the\nultimate result will be statistically stable. As such, faster benchmark\nfunctions will be run for more iterations than slower benchmark functions, and\nthe number of iterations is thus reported.\n\nIn all cases, the number of iterations for which the benchmark is run is\ngoverned by the amount of time the benchmark takes. Concretely, the number of\niterations is at least one, not more than 1e9, until CPU time is greater than\nthe minimum time, or the wallclock time is 5x minimum time. The minimum time is\nset per benchmark by calling `MinTime` on the registered benchmark object.\n\nFurthermore warming up a benchmark might be necessary in order to get\nstable results because of e.g caching effects of the code under benchmark.\nWarming up means running the benchmark a given amount of time, before\nresults are actually taken into account. The amount of time for which\nthe warmup should be run can be set per benchmark by calling\n`MinWarmUpTime` on the registered benchmark object or for all benchmarks\nusing the `--benchmark_min_warmup_time` command-line option. Note that\n`MinWarmUpTime` will overwrite the value of `--benchmark_min_warmup_time`\nfor the single benchmark. How many iterations the warmup run of each\nbenchmark takes is determined the same way as described in the paragraph\nabove. Per default the warmup phase is set to 0 seconds and is therefore\ndisabled.\n\nAverage timings are then reported over the iterations run. If multiple\nrepetitions are requested using the `--benchmark_repetitions` command-line\noption, or at registration time, the benchmark function will be run several\ntimes and statistical results across these repetitions will also be reported.\n\nAs well as the per-benchmark entries, a preamble in the report will include\ninformation about the machine on which the benchmarks are run.\n\n\n\n## Setup/Teardown\n\nGlobal setup/teardown specific to each benchmark can be done by\npassing a callback to Setup/Teardown:\n\nThe setup/teardown callbacks will be invoked once for each benchmark. If the\nbenchmark is multi-threaded (will run in k threads), they will be invoked\nexactly once before each run with k threads.\n\nIf the benchmark uses different size groups of threads, the above will be true\nfor each size group.\n\nEg.,\n\n```c++\nstatic void DoSetup(const benchmark::State& state) {\n}\n\nstatic void DoTeardown(const benchmark::State& state) {\n}\n\nstatic void BM_func(benchmark::State& state) {...}\n\nBENCHMARK(BM_func)->Arg(1)->Arg(3)->Threads(16)->Threads(32)->Setup(DoSetup)->Teardown(DoTeardown);\n\n```\n\nIn this example, `DoSetup` and `DoTearDown` will be invoked 4 times each,\nspecifically, once for each of this family:\n - BM_func_Arg_1_Threads_16, BM_func_Arg_1_Threads_32\n - BM_func_Arg_3_Threads_16, BM_func_Arg_3_Threads_32\n\n\n\n## Passing Arguments\n\nSometimes a family of benchmarks can be implemented with just one routine that\ntakes an extra argument to specify which one of the family of benchmarks to\nrun. For example, the following code defines a family of benchmarks for\nmeasuring the speed of `memcpy()` calls of different lengths:\n\n```c++\nstatic void BM_memcpy(benchmark::State& state) {\n char* src = new char[state.range(0)];\n char* dst = new char[state.range(0)];\n memset(src, 'x', state.range(0));\n for (auto _ : state)\n memcpy(dst, src, state.range(0));\n state.SetBytesProcessed(int64_t(state.iterations()) *\n int64_t(state.range(0)));\n delete[] src;\n delete[] dst;\n}\nBENCHMARK(BM_memcpy)->Arg(8)->Arg(64)->Arg(512)->Arg(4<<10)->Arg(8<<10);\n```\n\nThe preceding code is quite repetitive, and can be replaced with the following\nshort-hand. The following invocation will pick a few appropriate arguments in\nthe specified range and will generate a benchmark for each such argument.\n\n```c++\nBENCHMARK(BM_memcpy)->Range(8, 8<<10);\n```\n\nBy default the arguments in the range are generated in multiples of eight and\nthe command above selects [ 8, 64, 512, 4k, 8k ]. In the following code the\nrange multiplier is changed to multiples of two.\n\n```c++\nBENCHMARK(BM_memcpy)->RangeMultiplier(2)->Range(8, 8<<10);\n```\n\nNow arguments generated are [ 8, 16, 32, 64, 128, 256, 512, 1024, 2k, 4k, 8k ].\n\nThe preceding code shows a method of defining a sparse range. The following\nexample shows a method of defining a dense range. It is then used to benchmark\nthe performance of `std::vector` initialization for uniformly increasing sizes.\n\n```c++\nstatic void BM_DenseRange(benchmark::State& state) {\n for(auto _ : state) {\n std::vector v(state.range(0), state.range(0));\n auto data = v.data();\n benchmark::DoNotOptimize(data);\n benchmark::ClobberMemory();\n }\n}\nBENCHMARK(BM_DenseRange)->DenseRange(0, 1024, 128);\n```\n\nNow arguments generated are [ 0, 128, 256, 384, 512, 640, 768, 896, 1024 ].\n\nYou might have a benchmark that depends on two or more inputs. For example, the\nfollowing code defines a family of benchmarks for measuring the speed of set\ninsertion.\n\n```c++\nstatic void BM_SetInsert(benchmark::State& state) {\n std::set data;\n for (auto _ : state) {\n state.PauseTiming();\n data = ConstructRandomSet(state.range(0));\n state.ResumeTiming();\n for (int j = 0; j < state.range(1); ++j)\n data.insert(RandomNumber());\n }\n}\nBENCHMARK(BM_SetInsert)\n ->Args({1<<10, 128})\n ->Args({2<<10, 128})\n ->Args({4<<10, 128})\n ->Args({8<<10, 128})\n ->Args({1<<10, 512})\n ->Args({2<<10, 512})\n ->Args({4<<10, 512})\n ->Args({8<<10, 512});\n```\n\nThe preceding code is quite repetitive, and can be replaced with the following\nshort-hand. The following macro will pick a few appropriate arguments in the\nproduct of the two specified ranges and will generate a benchmark for each such\npair.\n\n\n```c++\nBENCHMARK(BM_SetInsert)->Ranges({{1<<10, 8<<10}, {128, 512}});\n```\n\n\nSome benchmarks may require specific argument values that cannot be expressed\nwith `Ranges`. In this case, `ArgsProduct` offers the ability to generate a\nbenchmark input for each combination in the product of the supplied vectors.\n\n\n```c++\nBENCHMARK(BM_SetInsert)\n ->ArgsProduct({{1<<10, 3<<10, 8<<10}, {20, 40, 60, 80}})\n// would generate the same benchmark arguments as\nBENCHMARK(BM_SetInsert)\n ->Args({1<<10, 20})\n ->Args({3<<10, 20})\n ->Args({8<<10, 20})\n ->Args({3<<10, 40})\n ->Args({8<<10, 40})\n ->Args({1<<10, 40})\n ->Args({1<<10, 60})\n ->Args({3<<10, 60})\n ->Args({8<<10, 60})\n ->Args({1<<10, 80})\n ->Args({3<<10, 80})\n ->Args({8<<10, 80});\n```\n\n\nFor the most common scenarios, helper methods for creating a list of\nintegers for a given sparse or dense range are provided.\n\n```c++\nBENCHMARK(BM_SetInsert)\n ->ArgsProduct({\n benchmark::CreateRange(8, 128, /*multi=*/2),\n benchmark::CreateDenseRange(1, 4, /*step=*/1)\n })\n// would generate the same benchmark arguments as\nBENCHMARK(BM_SetInsert)\n ->ArgsProduct({\n {8, 16, 32, 64, 128},\n {1, 2, 3, 4}\n });\n```\n\nFor more complex patterns of inputs, passing a custom function to `Apply` allows\nprogrammatic specification of an arbitrary set of arguments on which to run the\nbenchmark. The following example enumerates a dense range on one parameter,\nand a sparse range on the second.\n\n```c++\nstatic void CustomArguments(benchmark::internal::Benchmark* b) {\n for (int i = 0; i <= 10; ++i)\n for (int j = 32; j <= 1024*1024; j *= 8)\n b->Args({i, j});\n}\nBENCHMARK(BM_SetInsert)->Apply(CustomArguments);\n```\n\n### Passing Arbitrary Arguments to a Benchmark\n\nIn C++11 it is possible to define a benchmark that takes an arbitrary number\nof extra arguments. The `BENCHMARK_CAPTURE(func, test_case_name, ...args)`\nmacro creates a benchmark that invokes `func` with the `benchmark::State` as\nthe first argument followed by the specified `args...`.\nThe `test_case_name` is appended to the name of the benchmark and\nshould describe the values passed.\n\n```c++\ntemplate \nvoid BM_takes_args(benchmark::State& state, Args&&... args) {\n auto args_tuple = std::make_tuple(std::move(args)...);\n for (auto _ : state) {\n std::cout << std::get<0>(args_tuple) << \": \" << std::get<1>(args_tuple)\n << '\\n';\n [...]\n }\n}\n// Registers a benchmark named \"BM_takes_args/int_string_test\" that passes\n// the specified values to `args`.\nBENCHMARK_CAPTURE(BM_takes_args, int_string_test, 42, std::string(\"abc\"));\n\n// Registers the same benchmark \"BM_takes_args/int_test\" that passes\n// the specified values to `args`.\nBENCHMARK_CAPTURE(BM_takes_args, int_test, 42, 43);\n```\n\nNote that elements of `...args` may refer to global variables. Users should\navoid modifying global state inside of a benchmark.\n\n\n\n## Calculating Asymptotic Complexity (Big O)\n\nAsymptotic complexity might be calculated for a family of benchmarks. The\nfollowing code will calculate the coefficient for the high-order term in the\nrunning time and the normalized root-mean square error of string comparison.\n\n```c++\nstatic void BM_StringCompare(benchmark::State& state) {\n std::string s1(state.range(0), '-');\n std::string s2(state.range(0), '-');\n for (auto _ : state) {\n auto comparison_result = s1.compare(s2);\n benchmark::DoNotOptimize(comparison_result);\n }\n state.SetComplexityN(state.range(0));\n}\nBENCHMARK(BM_StringCompare)\n ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity(benchmark::oN);\n```\n\nAs shown in the following invocation, asymptotic complexity might also be\ncalculated automatically.\n\n```c++\nBENCHMARK(BM_StringCompare)\n ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity();\n```\n\nThe following code will specify asymptotic complexity with a lambda function,\nthat might be used to customize high-order term calculation.\n\n```c++\nBENCHMARK(BM_StringCompare)->RangeMultiplier(2)\n ->Range(1<<10, 1<<18)->Complexity([](benchmark::IterationCount n)->double{return n; });\n```\n\n\n\n## Custom Benchmark Name\n\nYou can change the benchmark's name as follows:\n\n```c++\nBENCHMARK(BM_memcpy)->Name(\"memcpy\")->RangeMultiplier(2)->Range(8, 8<<10);\n```\n\nThe invocation will execute the benchmark as before using `BM_memcpy` but changes\nthe prefix in the report to `memcpy`.\n\n\n\n## Templated Benchmarks\n\nThis example produces and consumes messages of size `sizeof(v)` `range_x`\ntimes. It also outputs throughput in the absence of multiprogramming.\n\n```c++\ntemplate void BM_Sequential(benchmark::State& state) {\n Q q;\n typename Q::value_type v;\n for (auto _ : state) {\n for (int i = state.range(0); i--; )\n q.push(v);\n for (int e = state.range(0); e--; )\n q.Wait(&v);\n }\n // actually messages, not bytes:\n state.SetBytesProcessed(\n static_cast(state.iterations())*state.range(0));\n}\n// C++03\nBENCHMARK_TEMPLATE(BM_Sequential, WaitQueue)->Range(1<<0, 1<<10);\n\n// C++11 or newer, you can use the BENCHMARK macro with template parameters:\nBENCHMARK(BM_Sequential>)->Range(1<<0, 1<<10);\n\n```\n\nThree macros are provided for adding benchmark templates.\n\n```c++\n#ifdef BENCHMARK_HAS_CXX11\n#define BENCHMARK(func<...>) // Takes any number of parameters.\n#else // C++ < C++11\n#define BENCHMARK_TEMPLATE(func, arg1)\n#endif\n#define BENCHMARK_TEMPLATE1(func, arg1)\n#define BENCHMARK_TEMPLATE2(func, arg1, arg2)\n```\n\n\n\n## Fixtures\n\nFixture tests are created by first defining a type that derives from\n`::benchmark::Fixture` and then creating/registering the tests using the\nfollowing macros:\n\n* `BENCHMARK_F(ClassName, Method)`\n* `BENCHMARK_DEFINE_F(ClassName, Method)`\n* `BENCHMARK_REGISTER_F(ClassName, Method)`\n\nFor Example:\n\n```c++\nclass MyFixture : public benchmark::Fixture {\npublic:\n void SetUp(const ::benchmark::State& state) {\n }\n\n void TearDown(const ::benchmark::State& state) {\n }\n};\n\nBENCHMARK_F(MyFixture, FooTest)(benchmark::State& st) {\n for (auto _ : st) {\n ...\n }\n}\n\nBENCHMARK_DEFINE_F(MyFixture, BarTest)(benchmark::State& st) {\n for (auto _ : st) {\n ...\n }\n}\n/* BarTest is NOT registered */\nBENCHMARK_REGISTER_F(MyFixture, BarTest)->Threads(2);\n/* BarTest is now registered */\n```\n\n### Templated Fixtures\n\nAlso you can create templated fixture by using the following macros:\n\n* `BENCHMARK_TEMPLATE_F(ClassName, Method, ...)`\n* `BENCHMARK_TEMPLATE_DEFINE_F(ClassName, Method, ...)`\n\nFor example:\n\n```c++\ntemplate\nclass MyFixture : public benchmark::Fixture {};\n\nBENCHMARK_TEMPLATE_F(MyFixture, IntTest, int)(benchmark::State& st) {\n for (auto _ : st) {\n ...\n }\n}\n\nBENCHMARK_TEMPLATE_DEFINE_F(MyFixture, DoubleTest, double)(benchmark::State& st) {\n for (auto _ : st) {\n ...\n }\n}\n\nBENCHMARK_REGISTER_F(MyFixture, DoubleTest)->Threads(2);\n```\n\n\n\n## Custom Counters\n\nYou can add your own counters with user-defined names. The example below\nwill add columns \"Foo\", \"Bar\" and \"Baz\" in its output:\n\n```c++\nstatic void UserCountersExample1(benchmark::State& state) {\n double numFoos = 0, numBars = 0, numBazs = 0;\n for (auto _ : state) {\n // ... count Foo,Bar,Baz events\n }\n state.counters[\"Foo\"] = numFoos;\n state.counters[\"Bar\"] = numBars;\n state.counters[\"Baz\"] = numBazs;\n}\n```\n\nThe `state.counters` object is a `std::map` with `std::string` keys\nand `Counter` values. The latter is a `double`-like class, via an implicit\nconversion to `double&`. Thus you can use all of the standard arithmetic\nassignment operators (`=,+=,-=,*=,/=`) to change the value of each counter.\n\nIn multithreaded benchmarks, each counter is set on the calling thread only.\nWhen the benchmark finishes, the counters from each thread will be summed;\nthe resulting sum is the value which will be shown for the benchmark.\n\nThe `Counter` constructor accepts three parameters: the value as a `double`\n; a bit flag which allows you to show counters as rates, and/or as per-thread\niteration, and/or as per-thread averages, and/or iteration invariants,\nand/or finally inverting the result; and a flag specifying the 'unit' - i.e.\nis 1k a 1000 (default, `benchmark::Counter::OneK::kIs1000`), or 1024\n(`benchmark::Counter::OneK::kIs1024`)?\n\n```c++\n // sets a simple counter\n state.counters[\"Foo\"] = numFoos;\n\n // Set the counter as a rate. It will be presented divided\n // by the duration of the benchmark.\n // Meaning: per one second, how many 'foo's are processed?\n state.counters[\"FooRate\"] = Counter(numFoos, benchmark::Counter::kIsRate);\n\n // Set the counter as a rate. It will be presented divided\n // by the duration of the benchmark, and the result inverted.\n // Meaning: how many seconds it takes to process one 'foo'?\n state.counters[\"FooInvRate\"] = Counter(numFoos, benchmark::Counter::kIsRate | benchmark::Counter::kInvert);\n\n // Set the counter as a thread-average quantity. It will\n // be presented divided by the number of threads.\n state.counters[\"FooAvg\"] = Counter(numFoos, benchmark::Counter::kAvgThreads);\n\n // There's also a combined flag:\n state.counters[\"FooAvgRate\"] = Counter(numFoos,benchmark::Counter::kAvgThreadsRate);\n\n // This says that we process with the rate of state.range(0) bytes every iteration:\n state.counters[\"BytesProcessed\"] = Counter(state.range(0), benchmark::Counter::kIsIterationInvariantRate, benchmark::Counter::OneK::kIs1024);\n```\n\nWhen you're compiling in C++11 mode or later you can use `insert()` with\n`std::initializer_list`:\n\n\n```c++\n // With C++11, this can be done:\n state.counters.insert({{\"Foo\", numFoos}, {\"Bar\", numBars}, {\"Baz\", numBazs}});\n // ... instead of:\n state.counters[\"Foo\"] = numFoos;\n state.counters[\"Bar\"] = numBars;\n state.counters[\"Baz\"] = numBazs;\n```\n\n\n### Counter Reporting\n\nWhen using the console reporter, by default, user counters are printed at\nthe end after the table, the same way as ``bytes_processed`` and\n``items_processed``. This is best for cases in which there are few counters,\nor where there are only a couple of lines per benchmark. Here's an example of\nthe default output:\n\n```\n------------------------------------------------------------------------------\nBenchmark Time CPU Iterations UserCounters...\n------------------------------------------------------------------------------\nBM_UserCounter/threads:8 2248 ns 10277 ns 68808 Bar=16 Bat=40 Baz=24 Foo=8\nBM_UserCounter/threads:1 9797 ns 9788 ns 71523 Bar=2 Bat=5 Baz=3 Foo=1024m\nBM_UserCounter/threads:2 4924 ns 9842 ns 71036 Bar=4 Bat=10 Baz=6 Foo=2\nBM_UserCounter/threads:4 2589 ns 10284 ns 68012 Bar=8 Bat=20 Baz=12 Foo=4\nBM_UserCounter/threads:8 2212 ns 10287 ns 68040 Bar=16 Bat=40 Baz=24 Foo=8\nBM_UserCounter/threads:16 1782 ns 10278 ns 68144 Bar=32 Bat=80 Baz=48 Foo=16\nBM_UserCounter/threads:32 1291 ns 10296 ns 68256 Bar=64 Bat=160 Baz=96 Foo=32\nBM_UserCounter/threads:4 2615 ns 10307 ns 68040 Bar=8 Bat=20 Baz=12 Foo=4\nBM_Factorial 26 ns 26 ns 26608979 40320\nBM_Factorial/real_time 26 ns 26 ns 26587936 40320\nBM_CalculatePiRange/1 16 ns 16 ns 45704255 0\nBM_CalculatePiRange/8 73 ns 73 ns 9520927 3.28374\nBM_CalculatePiRange/64 609 ns 609 ns 1140647 3.15746\nBM_CalculatePiRange/512 4900 ns 4901 ns 142696 3.14355\n```\n\nIf this doesn't suit you, you can print each counter as a table column by\npassing the flag `--benchmark_counters_tabular=true` to the benchmark\napplication. This is best for cases in which there are a lot of counters, or\na lot of lines per individual benchmark. Note that this will trigger a\nreprinting of the table header any time the counter set changes between\nindividual benchmarks. Here's an example of corresponding output when\n`--benchmark_counters_tabular=true` is passed:\n\n```\n---------------------------------------------------------------------------------------\nBenchmark Time CPU Iterations Bar Bat Baz Foo\n---------------------------------------------------------------------------------------\nBM_UserCounter/threads:8 2198 ns 9953 ns 70688 16 40 24 8\nBM_UserCounter/threads:1 9504 ns 9504 ns 73787 2 5 3 1\nBM_UserCounter/threads:2 4775 ns 9550 ns 72606 4 10 6 2\nBM_UserCounter/threads:4 2508 ns 9951 ns 70332 8 20 12 4\nBM_UserCounter/threads:8 2055 ns 9933 ns 70344 16 40 24 8\nBM_UserCounter/threads:16 1610 ns 9946 ns 70720 32 80 48 16\nBM_UserCounter/threads:32 1192 ns 9948 ns 70496 64 160 96 32\nBM_UserCounter/threads:4 2506 ns 9949 ns 70332 8 20 12 4\n--------------------------------------------------------------\nBenchmark Time CPU Iterations\n--------------------------------------------------------------\nBM_Factorial 26 ns 26 ns 26392245 40320\nBM_Factorial/real_time 26 ns 26 ns 26494107 40320\nBM_CalculatePiRange/1 15 ns 15 ns 45571597 0\nBM_CalculatePiRange/8 74 ns 74 ns 9450212 3.28374\nBM_CalculatePiRange/64 595 ns 595 ns 1173901 3.15746\nBM_CalculatePiRange/512 4752 ns 4752 ns 147380 3.14355\nBM_CalculatePiRange/4k 37970 ns 37972 ns 18453 3.14184\nBM_CalculatePiRange/32k 303733 ns 303744 ns 2305 3.14162\nBM_CalculatePiRange/256k 2434095 ns 2434186 ns 288 3.1416\nBM_CalculatePiRange/1024k 9721140 ns 9721413 ns 71 3.14159\nBM_CalculatePi/threads:8 2255 ns 9943 ns 70936\n```\n\nNote above the additional header printed when the benchmark changes from\n``BM_UserCounter`` to ``BM_Factorial``. This is because ``BM_Factorial`` does\nnot have the same counter set as ``BM_UserCounter``.\n\n\n\n## Multithreaded Benchmarks\n\nIn a multithreaded test (benchmark invoked by multiple threads simultaneously),\nit is guaranteed that none of the threads will start until all have reached\nthe start of the benchmark loop, and all will have finished before any thread\nexits the benchmark loop. (This behavior is also provided by the `KeepRunning()`\nAPI) As such, any global setup or teardown can be wrapped in a check against the thread\nindex:\n\n```c++\nstatic void BM_MultiThreaded(benchmark::State& state) {\n if (state.thread_index() == 0) {\n // Setup code here.\n }\n for (auto _ : state) {\n // Run the test as normal.\n }\n if (state.thread_index() == 0) {\n // Teardown code here.\n }\n}\nBENCHMARK(BM_MultiThreaded)->Threads(2);\n```\n\nTo run the benchmark across a range of thread counts, instead of `Threads`, use\n`ThreadRange`. This takes two parameters (`min_threads` and `max_threads`) and\nruns the benchmark once for values in the inclusive range. For example:\n\n```c++\nBENCHMARK(BM_MultiThreaded)->ThreadRange(1, 8);\n```\n\nwill run `BM_MultiThreaded` with thread counts 1, 2, 4, and 8.\n\nIf the benchmarked code itself uses threads and you want to compare it to\nsingle-threaded code, you may want to use real-time (\"wallclock\") measurements\nfor latency comparisons:\n\n```c++\nBENCHMARK(BM_test)->Range(8, 8<<10)->UseRealTime();\n```\n\nWithout `UseRealTime`, CPU time is used by default.\n\n\n\n## CPU Timers\n\nBy default, the CPU timer only measures the time spent by the main thread.\nIf the benchmark itself uses threads internally, this measurement may not\nbe what you are looking for. Instead, there is a way to measure the total\nCPU usage of the process, by all the threads.\n\n```c++\nvoid callee(int i);\n\nstatic void MyMain(int size) {\n#pragma omp parallel for\n for(int i = 0; i < size; i++)\n callee(i);\n}\n\nstatic void BM_OpenMP(benchmark::State& state) {\n for (auto _ : state)\n MyMain(state.range(0));\n}\n\n// Measure the time spent by the main thread, use it to decide for how long to\n// run the benchmark loop. Depending on the internal implementation detail may\n// measure to anywhere from near-zero (the overhead spent before/after work\n// handoff to worker thread[s]) to the whole single-thread time.\nBENCHMARK(BM_OpenMP)->Range(8, 8<<10);\n\n// Measure the user-visible time, the wall clock (literally, the time that\n// has passed on the clock on the wall), use it to decide for how long to\n// run the benchmark loop. This will always be meaningful, and will match the\n// time spent by the main thread in single-threaded case, in general decreasing\n// with the number of internal threads doing the work.\nBENCHMARK(BM_OpenMP)->Range(8, 8<<10)->UseRealTime();\n\n// Measure the total CPU consumption, use it to decide for how long to\n// run the benchmark loop. This will always measure to no less than the\n// time spent by the main thread in single-threaded case.\nBENCHMARK(BM_OpenMP)->Range(8, 8<<10)->MeasureProcessCPUTime();\n\n// A mixture of the last two. Measure the total CPU consumption, but use the\n// wall clock to decide for how long to run the benchmark loop.\nBENCHMARK(BM_OpenMP)->Range(8, 8<<10)->MeasureProcessCPUTime()->UseRealTime();\n```\n\n### Controlling Timers\n\nNormally, the entire duration of the work loop (`for (auto _ : state) {}`)\nis measured. But sometimes, it is necessary to do some work inside of\nthat loop, every iteration, but without counting that time to the benchmark time.\nThat is possible, although it is not recommended, since it has high overhead.\n\n\n```c++\nstatic void BM_SetInsert_With_Timer_Control(benchmark::State& state) {\n std::set data;\n for (auto _ : state) {\n state.PauseTiming(); // Stop timers. They will not count until they are resumed.\n data = ConstructRandomSet(state.range(0)); // Do something that should not be measured\n state.ResumeTiming(); // And resume timers. They are now counting again.\n // The rest will be measured.\n for (int j = 0; j < state.range(1); ++j)\n data.insert(RandomNumber());\n }\n}\nBENCHMARK(BM_SetInsert_With_Timer_Control)->Ranges({{1<<10, 8<<10}, {128, 512}});\n```\n\n\n\n\n## Manual Timing\n\nFor benchmarking something for which neither CPU time nor real-time are\ncorrect or accurate enough, completely manual timing is supported using\nthe `UseManualTime` function.\n\nWhen `UseManualTime` is used, the benchmarked code must call\n`SetIterationTime` once per iteration of the benchmark loop to\nreport the manually measured time.\n\nAn example use case for this is benchmarking GPU execution (e.g. OpenCL\nor CUDA kernels, OpenGL or Vulkan or Direct3D draw calls), which cannot\nbe accurately measured using CPU time or real-time. Instead, they can be\nmeasured accurately using a dedicated API, and these measurement results\ncan be reported back with `SetIterationTime`.\n\n```c++\nstatic void BM_ManualTiming(benchmark::State& state) {\n int microseconds = state.range(0);\n std::chrono::duration sleep_duration {\n static_cast(microseconds)\n };\n\n for (auto _ : state) {\n auto start = std::chrono::high_resolution_clock::now();\n // Simulate some useful workload with a sleep\n std::this_thread::sleep_for(sleep_duration);\n auto end = std::chrono::high_resolution_clock::now();\n\n auto elapsed_seconds =\n std::chrono::duration_cast>(\n end - start);\n\n state.SetIterationTime(elapsed_seconds.count());\n }\n}\nBENCHMARK(BM_ManualTiming)->Range(1, 1<<17)->UseManualTime();\n```\n\n\n\n## Setting the Time Unit\n\nIf a benchmark runs a few milliseconds it may be hard to visually compare the\nmeasured times, since the output data is given in nanoseconds per default. In\norder to manually set the time unit, you can specify it manually:\n\n```c++\nBENCHMARK(BM_test)->Unit(benchmark::kMillisecond);\n```\n\nAdditionally the default time unit can be set globally with the\n`--benchmark_time_unit={ns|us|ms|s}` command line argument. The argument only\naffects benchmarks where the time unit is not set explicitly.\n\n\n\n## Preventing Optimization\n\nTo prevent a value or expression from being optimized away by the compiler\nthe `benchmark::DoNotOptimize(...)` and `benchmark::ClobberMemory()`\nfunctions can be used.\n\n```c++\nstatic void BM_test(benchmark::State& state) {\n for (auto _ : state) {\n int x = 0;\n for (int i=0; i < 64; ++i) {\n benchmark::DoNotOptimize(x += i);\n }\n }\n}\n```\n\n`DoNotOptimize()` forces the *result* of `` to be stored in either\nmemory or a register. For GNU based compilers it acts as read/write barrier\nfor global memory. More specifically it forces the compiler to flush pending\nwrites to memory and reload any other values as necessary.\n\nNote that `DoNotOptimize()` does not prevent optimizations on ``\nin any way. `` may even be removed entirely when the result is already\nknown. For example:\n\n```c++\n /* Example 1: `` is removed entirely. */\n int foo(int x) { return x + 42; }\n while (...) DoNotOptimize(foo(0)); // Optimized to DoNotOptimize(42);\n\n /* Example 2: Result of '' is only reused */\n int bar(int) __attribute__((const));\n while (...) DoNotOptimize(bar(0)); // Optimized to:\n // int __result__ = bar(0);\n // while (...) DoNotOptimize(__result__);\n```\n\nThe second tool for preventing optimizations is `ClobberMemory()`. In essence\n`ClobberMemory()` forces the compiler to perform all pending writes to global\nmemory. Memory managed by block scope objects must be \"escaped\" using\n`DoNotOptimize(...)` before it can be clobbered. In the below example\n`ClobberMemory()` prevents the call to `v.push_back(42)` from being optimized\naway.\n\n```c++\nstatic void BM_vector_push_back(benchmark::State& state) {\n for (auto _ : state) {\n std::vector v;\n v.reserve(1);\n auto data = v.data(); // Allow v.data() to be clobbered. Pass as non-const\n benchmark::DoNotOptimize(data); // lvalue to avoid undesired compiler optimizations\n v.push_back(42);\n benchmark::ClobberMemory(); // Force 42 to be written to memory.\n }\n}\n```\n\nNote that `ClobberMemory()` is only available for GNU or MSVC based compilers.\n\n\n\n## Statistics: Reporting the Mean, Median and Standard Deviation / Coefficient of variation of Repeated Benchmarks\n\nBy default each benchmark is run once and that single result is reported.\nHowever benchmarks are often noisy and a single result may not be representative\nof the overall behavior. For this reason it's possible to repeatedly rerun the\nbenchmark.\n\nThe number of runs of each benchmark is specified globally by the\n`--benchmark_repetitions` flag or on a per benchmark basis by calling\n`Repetitions` on the registered benchmark object. When a benchmark is run more\nthan once the mean, median, standard deviation and coefficient of variation\nof the runs will be reported.\n\nAdditionally the `--benchmark_report_aggregates_only={true|false}`,\n`--benchmark_display_aggregates_only={true|false}` flags or\n`ReportAggregatesOnly(bool)`, `DisplayAggregatesOnly(bool)` functions can be\nused to change how repeated tests are reported. By default the result of each\nrepeated run is reported. When `report aggregates only` option is `true`,\nonly the aggregates (i.e. mean, median, standard deviation and coefficient\nof variation, maybe complexity measurements if they were requested) of the runs\nis reported, to both the reporters - standard output (console), and the file.\nHowever when only the `display aggregates only` option is `true`,\nonly the aggregates are displayed in the standard output, while the file\noutput still contains everything.\nCalling `ReportAggregatesOnly(bool)` / `DisplayAggregatesOnly(bool)` on a\nregistered benchmark object overrides the value of the appropriate flag for that\nbenchmark.\n\n\n\n## Custom Statistics\n\nWhile having these aggregates is nice, this may not be enough for everyone.\nFor example you may want to know what the largest observation is, e.g. because\nyou have some real-time constraints. This is easy. The following code will\nspecify a custom statistic to be calculated, defined by a lambda function.\n\n```c++\nvoid BM_spin_empty(benchmark::State& state) {\n for (auto _ : state) {\n for (int x = 0; x < state.range(0); ++x) {\n benchmark::DoNotOptimize(x);\n }\n }\n}\n\nBENCHMARK(BM_spin_empty)\n ->ComputeStatistics(\"max\", [](const std::vector& v) -> double {\n return *(std::max_element(std::begin(v), std::end(v)));\n })\n ->Arg(512);\n```\n\nWhile usually the statistics produce values in time units,\nyou can also produce percentages:\n\n```c++\nvoid BM_spin_empty(benchmark::State& state) {\n for (auto _ : state) {\n for (int x = 0; x < state.range(0); ++x) {\n benchmark::DoNotOptimize(x);\n }\n }\n}\n\nBENCHMARK(BM_spin_empty)\n ->ComputeStatistics(\"ratio\", [](const std::vector& v) -> double {\n return std::begin(v) / std::end(v);\n }, benchmark::StatisticUnit::kPercentage)\n ->Arg(512);\n```\n\n\n\n## Memory Usage\n\nIt's often useful to also track memory usage for benchmarks, alongside CPU\nperformance. For this reason, benchmark offers the `RegisterMemoryManager`\nmethod that allows a custom `MemoryManager` to be injected.\n\nIf set, the `MemoryManager::Start` and `MemoryManager::Stop` methods will be\ncalled at the start and end of benchmark runs to allow user code to fill out\na report on the number of allocations, bytes used, etc.\n\nThis data will then be reported alongside other performance data, currently\nonly when using JSON output.\n\n\n\n## Using RegisterBenchmark(name, fn, args...)\n\nThe `RegisterBenchmark(name, func, args...)` function provides an alternative\nway to create and register benchmarks.\n`RegisterBenchmark(name, func, args...)` creates, registers, and returns a\npointer to a new benchmark with the specified `name` that invokes\n`func(st, args...)` where `st` is a `benchmark::State` object.\n\nUnlike the `BENCHMARK` registration macros, which can only be used at the global\nscope, the `RegisterBenchmark` can be called anywhere. This allows for\nbenchmark tests to be registered programmatically.\n\nAdditionally `RegisterBenchmark` allows any callable object to be registered\nas a benchmark. Including capturing lambdas and function objects.\n\nFor Example:\n```c++\nauto BM_test = [](benchmark::State& st, auto Inputs) { /* ... */ };\n\nint main(int argc, char** argv) {\n for (auto& test_input : { /* ... */ })\n benchmark::RegisterBenchmark(test_input.name(), BM_test, test_input);\n benchmark::Initialize(&argc, argv);\n benchmark::RunSpecifiedBenchmarks();\n benchmark::Shutdown();\n}\n```\n\n\n\n## Exiting with an Error\n\nWhen errors caused by external influences, such as file I/O and network\ncommunication, occur within a benchmark the\n`State::SkipWithError(const std::string& msg)` function can be used to skip that run\nof benchmark and report the error. Note that only future iterations of the\n`KeepRunning()` are skipped. For the ranged-for version of the benchmark loop\nUsers must explicitly exit the loop, otherwise all iterations will be performed.\nUsers may explicitly return to exit the benchmark immediately.\n\nThe `SkipWithError(...)` function may be used at any point within the benchmark,\nincluding before and after the benchmark loop. Moreover, if `SkipWithError(...)`\nhas been used, it is not required to reach the benchmark loop and one may return\nfrom the benchmark function early.\n\nFor example:\n\n```c++\nstatic void BM_test(benchmark::State& state) {\n auto resource = GetResource();\n if (!resource.good()) {\n state.SkipWithError(\"Resource is not good!\");\n // KeepRunning() loop will not be entered.\n }\n while (state.KeepRunning()) {\n auto data = resource.read_data();\n if (!resource.good()) {\n state.SkipWithError(\"Failed to read data!\");\n break; // Needed to skip the rest of the iteration.\n }\n do_stuff(data);\n }\n}\n\nstatic void BM_test_ranged_fo(benchmark::State & state) {\n auto resource = GetResource();\n if (!resource.good()) {\n state.SkipWithError(\"Resource is not good!\");\n return; // Early return is allowed when SkipWithError() has been used.\n }\n for (auto _ : state) {\n auto data = resource.read_data();\n if (!resource.good()) {\n state.SkipWithError(\"Failed to read data!\");\n break; // REQUIRED to prevent all further iterations.\n }\n do_stuff(data);\n }\n}\n```\n\n\n## A Faster KeepRunning Loop\n\nIn C++11 mode, a ranged-based for loop should be used in preference to\nthe `KeepRunning` loop for running the benchmarks. For example:\n\n```c++\nstatic void BM_Fast(benchmark::State &state) {\n for (auto _ : state) {\n FastOperation();\n }\n}\nBENCHMARK(BM_Fast);\n```\n\nThe reason the ranged-for loop is faster than using `KeepRunning`, is\nbecause `KeepRunning` requires a memory load and store of the iteration count\never iteration, whereas the ranged-for variant is able to keep the iteration count\nin a register.\n\nFor example, an empty inner loop of using the ranged-based for method looks like:\n\n```asm\n# Loop Init\n mov rbx, qword ptr [r14 + 104]\n call benchmark::State::StartKeepRunning()\n test rbx, rbx\n je .LoopEnd\n.LoopHeader: # =>This Inner Loop Header: Depth=1\n add rbx, -1\n jne .LoopHeader\n.LoopEnd:\n```\n\nCompared to an empty `KeepRunning` loop, which looks like:\n\n```asm\n.LoopHeader: # in Loop: Header=BB0_3 Depth=1\n cmp byte ptr [rbx], 1\n jne .LoopInit\n.LoopBody: # =>This Inner Loop Header: Depth=1\n mov rax, qword ptr [rbx + 8]\n lea rcx, [rax + 1]\n mov qword ptr [rbx + 8], rcx\n cmp rax, qword ptr [rbx + 104]\n jb .LoopHeader\n jmp .LoopEnd\n.LoopInit:\n mov rdi, rbx\n call benchmark::State::StartKeepRunning()\n jmp .LoopBody\n.LoopEnd:\n```\n\nUnless C++03 compatibility is required, the ranged-for variant of writing\nthe benchmark loop should be preferred.\n\n\n\n## Disabling CPU Frequency Scaling\n\nIf you see this error:\n\n```\n***WARNING*** CPU scaling is enabled, the benchmark real time measurements may\nbe noisy and will incur extra overhead.\n```\n\nyou might want to disable the CPU frequency scaling while running the\nbenchmark, as well as consider other ways to stabilize the performance of\nyour system while benchmarking.\n\nSee [Reducing Variance](reducing_variance.md) for more information.\n" }, { "path": "3rd/benchmark-1.8.2/include/benchmark/benchmark.h", "content": "// Copyright 2015 Google Inc. 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// 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// Support for registering benchmarks for functions.\n\n/* Example usage:\n// Define a function that executes the code to be measured a\n// specified number of times:\nstatic void BM_StringCreation(benchmark::State& state) {\n for (auto _ : state)\n std::string empty_string;\n}\n\n// Register the function as a benchmark\nBENCHMARK(BM_StringCreation);\n\n// Define another benchmark\nstatic void BM_StringCopy(benchmark::State& state) {\n std::string x = \"hello\";\n for (auto _ : state)\n std::string copy(x);\n}\nBENCHMARK(BM_StringCopy);\n\n// Augment the main() program to invoke benchmarks if specified\n// via the --benchmark_filter command line flag. E.g.,\n// my_unittest --benchmark_filter=all\n// my_unittest --benchmark_filter=BM_StringCreation\n// my_unittest --benchmark_filter=String\n// my_unittest --benchmark_filter='Copy|Creation'\nint main(int argc, char** argv) {\n benchmark::Initialize(&argc, argv);\n benchmark::RunSpecifiedBenchmarks();\n benchmark::Shutdown();\n return 0;\n}\n\n// Sometimes a family of microbenchmarks can be implemented with\n// just one routine that takes an extra argument to specify which\n// one of the family of benchmarks to run. For example, the following\n// code defines a family of microbenchmarks for measuring the speed\n// of memcpy() calls of different lengths:\n\nstatic void BM_memcpy(benchmark::State& state) {\n char* src = new char[state.range(0)]; char* dst = new char[state.range(0)];\n memset(src, 'x', state.range(0));\n for (auto _ : state)\n memcpy(dst, src, state.range(0));\n state.SetBytesProcessed(state.iterations() * state.range(0));\n delete[] src; delete[] dst;\n}\nBENCHMARK(BM_memcpy)->Arg(8)->Arg(64)->Arg(512)->Arg(1<<10)->Arg(8<<10);\n\n// The preceding code is quite repetitive, and can be replaced with the\n// following short-hand. The following invocation will pick a few\n// appropriate arguments in the specified range and will generate a\n// microbenchmark for each such argument.\nBENCHMARK(BM_memcpy)->Range(8, 8<<10);\n\n// You might have a microbenchmark that depends on two inputs. For\n// example, the following code defines a family of microbenchmarks for\n// measuring the speed of set insertion.\nstatic void BM_SetInsert(benchmark::State& state) {\n set data;\n for (auto _ : state) {\n state.PauseTiming();\n data = ConstructRandomSet(state.range(0));\n state.ResumeTiming();\n for (int j = 0; j < state.range(1); ++j)\n data.insert(RandomNumber());\n }\n}\nBENCHMARK(BM_SetInsert)\n ->Args({1<<10, 128})\n ->Args({2<<10, 128})\n ->Args({4<<10, 128})\n ->Args({8<<10, 128})\n ->Args({1<<10, 512})\n ->Args({2<<10, 512})\n ->Args({4<<10, 512})\n ->Args({8<<10, 512});\n\n// The preceding code is quite repetitive, and can be replaced with\n// the following short-hand. The following macro will pick a few\n// appropriate arguments in the product of the two specified ranges\n// and will generate a microbenchmark for each such pair.\nBENCHMARK(BM_SetInsert)->Ranges({{1<<10, 8<<10}, {128, 512}});\n\n// For more complex patterns of inputs, passing a custom function\n// to Apply allows programmatic specification of an\n// arbitrary set of arguments to run the microbenchmark on.\n// The following example enumerates a dense range on\n// one parameter, and a sparse range on the second.\nstatic void CustomArguments(benchmark::internal::Benchmark* b) {\n for (int i = 0; i <= 10; ++i)\n for (int j = 32; j <= 1024*1024; j *= 8)\n b->Args({i, j});\n}\nBENCHMARK(BM_SetInsert)->Apply(CustomArguments);\n\n// Templated microbenchmarks work the same way:\n// Produce then consume 'size' messages 'iters' times\n// Measures throughput in the absence of multiprogramming.\ntemplate int BM_Sequential(benchmark::State& state) {\n Q q;\n typename Q::value_type v;\n for (auto _ : state) {\n for (int i = state.range(0); i--; )\n q.push(v);\n for (int e = state.range(0); e--; )\n q.Wait(&v);\n }\n // actually messages, not bytes:\n state.SetBytesProcessed(state.iterations() * state.range(0));\n}\nBENCHMARK_TEMPLATE(BM_Sequential, WaitQueue)->Range(1<<0, 1<<10);\n\nUse `Benchmark::MinTime(double t)` to set the minimum time used to run the\nbenchmark. This option overrides the `benchmark_min_time` flag.\n\nvoid BM_test(benchmark::State& state) {\n ... body ...\n}\nBENCHMARK(BM_test)->MinTime(2.0); // Run for at least 2 seconds.\n\nIn a multithreaded test, it is guaranteed that none of the threads will start\nuntil all have reached the loop start, and all will have finished before any\nthread exits the loop body. As such, any global setup or teardown you want to\ndo can be wrapped in a check against the thread index:\n\nstatic void BM_MultiThreaded(benchmark::State& state) {\n if (state.thread_index() == 0) {\n // Setup code here.\n }\n for (auto _ : state) {\n // Run the test as normal.\n }\n if (state.thread_index() == 0) {\n // Teardown code here.\n }\n}\nBENCHMARK(BM_MultiThreaded)->Threads(4);\n\n\nIf a benchmark runs a few milliseconds it may be hard to visually compare the\nmeasured times, since the output data is given in nanoseconds per default. In\norder to manually set the time unit, you can specify it manually:\n\nBENCHMARK(BM_test)->Unit(benchmark::kMillisecond);\n*/\n\n#ifndef BENCHMARK_BENCHMARK_H_\n#define BENCHMARK_BENCHMARK_H_\n\n// The _MSVC_LANG check should detect Visual Studio 2015 Update 3 and newer.\n#if __cplusplus >= 201103L || (defined(_MSVC_LANG) && _MSVC_LANG >= 201103L)\n#define BENCHMARK_HAS_CXX11\n#endif\n\n// This _MSC_VER check should detect VS 2017 v15.3 and newer.\n#if __cplusplus >= 201703L || \\\n (defined(_MSC_VER) && _MSC_VER >= 1911 && _MSVC_LANG >= 201703L)\n#define BENCHMARK_HAS_CXX17\n#endif\n\n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/export.h\"\n\n#if defined(BENCHMARK_HAS_CXX11)\n#include \n#include \n#include \n#include \n#endif\n\n#if defined(_MSC_VER)\n#include // for _ReadWriteBarrier\n#endif\n\n#ifndef BENCHMARK_HAS_CXX11\n#define BENCHMARK_DISALLOW_COPY_AND_ASSIGN(TypeName) \\\n TypeName(const TypeName&); \\\n TypeName& operator=(const TypeName&)\n#else\n#define BENCHMARK_DISALLOW_COPY_AND_ASSIGN(TypeName) \\\n TypeName(const TypeName&) = delete; \\\n TypeName& operator=(const TypeName&) = delete\n#endif\n\n#ifdef BENCHMARK_HAS_CXX17\n#define BENCHMARK_UNUSED [[maybe_unused]]\n#elif defined(__GNUC__) || defined(__clang__)\n#define BENCHMARK_UNUSED __attribute__((unused))\n#else\n#define BENCHMARK_UNUSED\n#endif\n\n// Used to annotate functions, methods and classes so they\n// are not optimized by the compiler. Useful for tests\n// where you expect loops to stay in place churning cycles\n#if defined(__clang__)\n#define BENCHMARK_DONT_OPTIMIZE __attribute__((optnone))\n#elif defined(__GNUC__) || defined(__GNUG__)\n#define BENCHMARK_DONT_OPTIMIZE __attribute__((optimize(0)))\n#else\n// MSVC & Intel do not have a no-optimize attribute, only line pragmas\n#define BENCHMARK_DONT_OPTIMIZE\n#endif\n\n#if defined(__GNUC__) || defined(__clang__)\n#define BENCHMARK_ALWAYS_INLINE __attribute__((always_inline))\n#elif defined(_MSC_VER) && !defined(__clang__)\n#define BENCHMARK_ALWAYS_INLINE __forceinline\n#define __func__ __FUNCTION__\n#else\n#define BENCHMARK_ALWAYS_INLINE\n#endif\n\n#define BENCHMARK_INTERNAL_TOSTRING2(x) #x\n#define BENCHMARK_INTERNAL_TOSTRING(x) BENCHMARK_INTERNAL_TOSTRING2(x)\n\n// clang-format off\n#if (defined(__GNUC__) && !defined(__NVCC__) && !defined(__NVCOMPILER)) || defined(__clang__)\n#define BENCHMARK_BUILTIN_EXPECT(x, y) __builtin_expect(x, y)\n#define BENCHMARK_DEPRECATED_MSG(msg) __attribute__((deprecated(msg)))\n#define BENCHMARK_DISABLE_DEPRECATED_WARNING \\\n _Pragma(\"GCC diagnostic push\") \\\n _Pragma(\"GCC diagnostic ignored \\\"-Wdeprecated-declarations\\\"\")\n#define BENCHMARK_RESTORE_DEPRECATED_WARNING _Pragma(\"GCC diagnostic pop\")\n#elif defined(__NVCOMPILER)\n#define BENCHMARK_BUILTIN_EXPECT(x, y) __builtin_expect(x, y)\n#define BENCHMARK_DEPRECATED_MSG(msg) __attribute__((deprecated(msg)))\n#define BENCHMARK_DISABLE_DEPRECATED_WARNING \\\n _Pragma(\"diagnostic push\") \\\n _Pragma(\"diag_suppress deprecated_entity_with_custom_message\")\n#define BENCHMARK_RESTORE_DEPRECATED_WARNING _Pragma(\"diagnostic pop\")\n#else\n#define BENCHMARK_BUILTIN_EXPECT(x, y) x\n#define BENCHMARK_DEPRECATED_MSG(msg)\n#define BENCHMARK_WARNING_MSG(msg) \\\n __pragma(message(__FILE__ \"(\" BENCHMARK_INTERNAL_TOSTRING( \\\n __LINE__) \") : warning note: \" msg))\n#define BENCHMARK_DISABLE_DEPRECATED_WARNING\n#define BENCHMARK_RESTORE_DEPRECATED_WARNING\n#endif\n// clang-format on\n\n#if defined(__GNUC__) && !defined(__clang__)\n#define BENCHMARK_GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)\n#endif\n\n#ifndef __has_builtin\n#define __has_builtin(x) 0\n#endif\n\n#if defined(__GNUC__) || __has_builtin(__builtin_unreachable)\n#define BENCHMARK_UNREACHABLE() __builtin_unreachable()\n#elif defined(_MSC_VER)\n#define BENCHMARK_UNREACHABLE() __assume(false)\n#else\n#define BENCHMARK_UNREACHABLE() ((void)0)\n#endif\n\n#ifdef BENCHMARK_HAS_CXX11\n#define BENCHMARK_OVERRIDE override\n#else\n#define BENCHMARK_OVERRIDE\n#endif\n\n#if defined(_MSC_VER)\n#pragma warning(push)\n// C4251: needs to have dll-interface to be used by clients of class\n#pragma warning(disable : 4251)\n#endif\n\nnamespace benchmark {\nclass BenchmarkReporter;\n\n// Default number of minimum benchmark running time in seconds.\nconst char kDefaultMinTimeStr[] = \"0.5s\";\n\nBENCHMARK_EXPORT void PrintDefaultHelp();\n\nBENCHMARK_EXPORT void Initialize(int* argc, char** argv,\n void (*HelperPrinterf)() = PrintDefaultHelp);\nBENCHMARK_EXPORT void Shutdown();\n\n// Report to stdout all arguments in 'argv' as unrecognized except the first.\n// Returns true there is at least on unrecognized argument (i.e. 'argc' > 1).\nBENCHMARK_EXPORT bool ReportUnrecognizedArguments(int argc, char** argv);\n\n// Returns the current value of --benchmark_filter.\nBENCHMARK_EXPORT std::string GetBenchmarkFilter();\n\n// Sets a new value to --benchmark_filter. (This will override this flag's\n// current value).\n// Should be called after `benchmark::Initialize()`, as\n// `benchmark::Initialize()` will override the flag's value.\nBENCHMARK_EXPORT void SetBenchmarkFilter(std::string value);\n\n// Returns the current value of --v (command line value for verbosity).\nBENCHMARK_EXPORT int32_t GetBenchmarkVerbosity();\n\n// Creates a default display reporter. Used by the library when no display\n// reporter is provided, but also made available for external use in case a\n// custom reporter should respect the `--benchmark_format` flag as a fallback\nBENCHMARK_EXPORT BenchmarkReporter* CreateDefaultDisplayReporter();\n\n// Generate a list of benchmarks matching the specified --benchmark_filter flag\n// and if --benchmark_list_tests is specified return after printing the name\n// of each matching benchmark. Otherwise run each matching benchmark and\n// report the results.\n//\n// spec : Specify the benchmarks to run. If users do not specify this arg,\n// then the value of FLAGS_benchmark_filter\n// will be used.\n//\n// The second and third overload use the specified 'display_reporter' and\n// 'file_reporter' respectively. 'file_reporter' will write to the file\n// specified\n// by '--benchmark_output'. If '--benchmark_output' is not given the\n// 'file_reporter' is ignored.\n//\n// RETURNS: The number of matching benchmarks.\nBENCHMARK_EXPORT size_t RunSpecifiedBenchmarks();\nBENCHMARK_EXPORT size_t RunSpecifiedBenchmarks(std::string spec);\n\nBENCHMARK_EXPORT size_t\nRunSpecifiedBenchmarks(BenchmarkReporter* display_reporter);\nBENCHMARK_EXPORT size_t\nRunSpecifiedBenchmarks(BenchmarkReporter* display_reporter, std::string spec);\n\nBENCHMARK_EXPORT size_t RunSpecifiedBenchmarks(\n BenchmarkReporter* display_reporter, BenchmarkReporter* file_reporter);\nBENCHMARK_EXPORT size_t\nRunSpecifiedBenchmarks(BenchmarkReporter* display_reporter,\n BenchmarkReporter* file_reporter, std::string spec);\n\n// TimeUnit is passed to a benchmark in order to specify the order of magnitude\n// for the measured time.\nenum TimeUnit { kNanosecond, kMicrosecond, kMillisecond, kSecond };\n\nBENCHMARK_EXPORT TimeUnit GetDefaultTimeUnit();\n\n// Sets the default time unit the benchmarks use\n// Has to be called before the benchmark loop to take effect\nBENCHMARK_EXPORT void SetDefaultTimeUnit(TimeUnit unit);\n\n// If a MemoryManager is registered (via RegisterMemoryManager()),\n// it can be used to collect and report allocation metrics for a run of the\n// benchmark.\nclass MemoryManager {\n public:\n static const int64_t TombstoneValue;\n\n struct Result {\n Result()\n : num_allocs(0),\n max_bytes_used(0),\n total_allocated_bytes(TombstoneValue),\n net_heap_growth(TombstoneValue) {}\n\n // The number of allocations made in total between Start and Stop.\n int64_t num_allocs;\n\n // The peak memory use between Start and Stop.\n int64_t max_bytes_used;\n\n // The total memory allocated, in bytes, between Start and Stop.\n // Init'ed to TombstoneValue if metric not available.\n int64_t total_allocated_bytes;\n\n // The net changes in memory, in bytes, between Start and Stop.\n // ie., total_allocated_bytes - total_deallocated_bytes.\n // Init'ed to TombstoneValue if metric not available.\n int64_t net_heap_growth;\n };\n\n virtual ~MemoryManager() {}\n\n // Implement this to start recording allocation information.\n virtual void Start() = 0;\n\n // Implement this to stop recording and fill out the given Result structure.\n virtual void Stop(Result& result) = 0;\n};\n\n// Register a MemoryManager instance that will be used to collect and report\n// allocation measurements for benchmark runs.\nBENCHMARK_EXPORT\nvoid RegisterMemoryManager(MemoryManager* memory_manager);\n\n// Add a key-value pair to output as part of the context stanza in the report.\nBENCHMARK_EXPORT\nvoid AddCustomContext(const std::string& key, const std::string& value);\n\nnamespace internal {\nclass Benchmark;\nclass BenchmarkImp;\nclass BenchmarkFamilies;\n\nBENCHMARK_EXPORT std::map*& GetGlobalContext();\n\nBENCHMARK_EXPORT\nvoid UseCharPointer(char const volatile*);\n\n// Take ownership of the pointer and register the benchmark. Return the\n// registered benchmark.\nBENCHMARK_EXPORT Benchmark* RegisterBenchmarkInternal(Benchmark*);\n\n// Ensure that the standard streams are properly initialized in every TU.\nBENCHMARK_EXPORT int InitializeStreams();\nBENCHMARK_UNUSED static int stream_init_anchor = InitializeStreams();\n\n} // namespace internal\n\n#if (!defined(__GNUC__) && !defined(__clang__)) || defined(__pnacl__) || \\\n defined(__EMSCRIPTEN__)\n#define BENCHMARK_HAS_NO_INLINE_ASSEMBLY\n#endif\n\n// Force the compiler to flush pending writes to global memory. Acts as an\n// effective read/write barrier\n#ifdef BENCHMARK_HAS_CXX11\ninline BENCHMARK_ALWAYS_INLINE void ClobberMemory() {\n std::atomic_signal_fence(std::memory_order_acq_rel);\n}\n#endif\n\n// The DoNotOptimize(...) function can be used to prevent a value or\n// expression from being optimized away by the compiler. This function is\n// intended to add little to no overhead.\n// See: https://youtu.be/nXaxk27zwlk?t=2441\n#ifndef BENCHMARK_HAS_NO_INLINE_ASSEMBLY\n#if !defined(__GNUC__) || defined(__llvm__) || defined(__INTEL_COMPILER)\ntemplate \nBENCHMARK_DEPRECATED_MSG(\n \"The const-ref version of this method can permit \"\n \"undesired compiler optimizations in benchmarks\")\ninline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) {\n asm volatile(\"\" : : \"r,m\"(value) : \"memory\");\n}\n\ntemplate \ninline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp& value) {\n#if defined(__clang__)\n asm volatile(\"\" : \"+r,m\"(value) : : \"memory\");\n#else\n asm volatile(\"\" : \"+m,r\"(value) : : \"memory\");\n#endif\n}\n\n#ifdef BENCHMARK_HAS_CXX11\ntemplate \ninline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp&& value) {\n#if defined(__clang__)\n asm volatile(\"\" : \"+r,m\"(value) : : \"memory\");\n#else\n asm volatile(\"\" : \"+m,r\"(value) : : \"memory\");\n#endif\n}\n#endif\n#elif defined(BENCHMARK_HAS_CXX11) && (__GNUC__ >= 5)\n// Workaround for a bug with full argument copy overhead with GCC.\n// See: #1340 and https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105519\ntemplate \nBENCHMARK_DEPRECATED_MSG(\n \"The const-ref version of this method can permit \"\n \"undesired compiler optimizations in benchmarks\")\ninline BENCHMARK_ALWAYS_INLINE\n typename std::enable_if::value &&\n (sizeof(Tp) <= sizeof(Tp*))>::type\n DoNotOptimize(Tp const& value) {\n asm volatile(\"\" : : \"r,m\"(value) : \"memory\");\n}\n\ntemplate \nBENCHMARK_DEPRECATED_MSG(\n \"The const-ref version of this method can permit \"\n \"undesired compiler optimizations in benchmarks\")\ninline BENCHMARK_ALWAYS_INLINE\n typename std::enable_if::value ||\n (sizeof(Tp) > sizeof(Tp*))>::type\n DoNotOptimize(Tp const& value) {\n asm volatile(\"\" : : \"m\"(value) : \"memory\");\n}\n\ntemplate \ninline BENCHMARK_ALWAYS_INLINE\n typename std::enable_if::value &&\n (sizeof(Tp) <= sizeof(Tp*))>::type\n DoNotOptimize(Tp& value) {\n asm volatile(\"\" : \"+m,r\"(value) : : \"memory\");\n}\n\ntemplate \ninline BENCHMARK_ALWAYS_INLINE\n typename std::enable_if::value ||\n (sizeof(Tp) > sizeof(Tp*))>::type\n DoNotOptimize(Tp& value) {\n asm volatile(\"\" : \"+m\"(value) : : \"memory\");\n}\n\ntemplate \ninline BENCHMARK_ALWAYS_INLINE\n typename std::enable_if::value &&\n (sizeof(Tp) <= sizeof(Tp*))>::type\n DoNotOptimize(Tp&& value) {\n asm volatile(\"\" : \"+m,r\"(value) : : \"memory\");\n}\n\ntemplate \ninline BENCHMARK_ALWAYS_INLINE\n typename std::enable_if::value ||\n (sizeof(Tp) > sizeof(Tp*))>::type\n DoNotOptimize(Tp&& value) {\n asm volatile(\"\" : \"+m\"(value) : : \"memory\");\n}\n\n#else\n// Fallback for GCC < 5. Can add some overhead because the compiler is forced\n// to use memory operations instead of operations with registers.\n// TODO: Remove if GCC < 5 will be unsupported.\ntemplate \nBENCHMARK_DEPRECATED_MSG(\n \"The const-ref version of this method can permit \"\n \"undesired compiler optimizations in benchmarks\")\ninline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) {\n asm volatile(\"\" : : \"m\"(value) : \"memory\");\n}\n\ntemplate \ninline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp& value) {\n asm volatile(\"\" : \"+m\"(value) : : \"memory\");\n}\n\n#ifdef BENCHMARK_HAS_CXX11\ntemplate \ninline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp&& value) {\n asm volatile(\"\" : \"+m\"(value) : : \"memory\");\n}\n#endif\n#endif\n\n#ifndef BENCHMARK_HAS_CXX11\ninline BENCHMARK_ALWAYS_INLINE void ClobberMemory() {\n asm volatile(\"\" : : : \"memory\");\n}\n#endif\n#elif defined(_MSC_VER)\ntemplate \nBENCHMARK_DEPRECATED_MSG(\n \"The const-ref version of this method can permit \"\n \"undesired compiler optimizations in benchmarks\")\ninline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) {\n internal::UseCharPointer(&reinterpret_cast(value));\n _ReadWriteBarrier();\n}\n\n#ifndef BENCHMARK_HAS_CXX11\ninline BENCHMARK_ALWAYS_INLINE void ClobberMemory() { _ReadWriteBarrier(); }\n#endif\n#else\ntemplate \nBENCHMARK_DEPRECATED_MSG(\n \"The const-ref version of this method can permit \"\n \"undesired compiler optimizations in benchmarks\")\ninline BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const& value) {\n internal::UseCharPointer(&reinterpret_cast(value));\n}\n// FIXME Add ClobberMemory() for non-gnu and non-msvc compilers, before C++11.\n#endif\n\n// This class is used for user-defined counters.\nclass Counter {\n public:\n enum Flags {\n kDefaults = 0,\n // Mark the counter as a rate. It will be presented divided\n // by the duration of the benchmark.\n kIsRate = 1 << 0,\n // Mark the counter as a thread-average quantity. It will be\n // presented divided by the number of threads.\n kAvgThreads = 1 << 1,\n // Mark the counter as a thread-average rate. See above.\n kAvgThreadsRate = kIsRate | kAvgThreads,\n // Mark the counter as a constant value, valid/same for *every* iteration.\n // When reporting, it will be *multiplied* by the iteration count.\n kIsIterationInvariant = 1 << 2,\n // Mark the counter as a constant rate.\n // When reporting, it will be *multiplied* by the iteration count\n // and then divided by the duration of the benchmark.\n kIsIterationInvariantRate = kIsRate | kIsIterationInvariant,\n // Mark the counter as a iteration-average quantity.\n // It will be presented divided by the number of iterations.\n kAvgIterations = 1 << 3,\n // Mark the counter as a iteration-average rate. See above.\n kAvgIterationsRate = kIsRate | kAvgIterations,\n\n // In the end, invert the result. This is always done last!\n kInvert = 1 << 31\n };\n\n enum OneK {\n // 1'000 items per 1k\n kIs1000 = 1000,\n // 1'024 items per 1k\n kIs1024 = 1024\n };\n\n double value;\n Flags flags;\n OneK oneK;\n\n BENCHMARK_ALWAYS_INLINE\n Counter(double v = 0., Flags f = kDefaults, OneK k = kIs1000)\n : value(v), flags(f), oneK(k) {}\n\n BENCHMARK_ALWAYS_INLINE operator double const &() const { return value; }\n BENCHMARK_ALWAYS_INLINE operator double&() { return value; }\n};\n\n// A helper for user code to create unforeseen combinations of Flags, without\n// having to do this cast manually each time, or providing this operator.\nCounter::Flags inline operator|(const Counter::Flags& LHS,\n const Counter::Flags& RHS) {\n return static_cast(static_cast(LHS) |\n static_cast(RHS));\n}\n\n// This is the container for the user-defined counters.\ntypedef std::map UserCounters;\n\n// BigO is passed to a benchmark in order to specify the asymptotic\n// computational\n// complexity for the benchmark. In case oAuto is selected, complexity will be\n// calculated automatically to the best fit.\nenum BigO { oNone, o1, oN, oNSquared, oNCubed, oLogN, oNLogN, oAuto, oLambda };\n\ntypedef int64_t IterationCount;\n\nenum StatisticUnit { kTime, kPercentage };\n\n// BigOFunc is passed to a benchmark in order to specify the asymptotic\n// computational complexity for the benchmark.\ntypedef double(BigOFunc)(IterationCount);\n\n// StatisticsFunc is passed to a benchmark in order to compute some descriptive\n// statistics over all the measurements of some type\ntypedef double(StatisticsFunc)(const std::vector&);\n\nnamespace internal {\nstruct Statistics {\n std::string name_;\n StatisticsFunc* compute_;\n StatisticUnit unit_;\n\n Statistics(const std::string& name, StatisticsFunc* compute,\n StatisticUnit unit = kTime)\n : name_(name), compute_(compute), unit_(unit) {}\n};\n\nclass BenchmarkInstance;\nclass ThreadTimer;\nclass ThreadManager;\nclass PerfCountersMeasurement;\n\nenum AggregationReportMode\n#if defined(BENCHMARK_HAS_CXX11)\n : unsigned\n#else\n#endif\n{\n // The mode has not been manually specified\n ARM_Unspecified = 0,\n // The mode is user-specified.\n // This may or may not be set when the following bit-flags are set.\n ARM_Default = 1U << 0U,\n // File reporter should only output aggregates.\n ARM_FileReportAggregatesOnly = 1U << 1U,\n // Display reporter should only output aggregates\n ARM_DisplayReportAggregatesOnly = 1U << 2U,\n // Both reporters should only display aggregates.\n ARM_ReportAggregatesOnly =\n ARM_FileReportAggregatesOnly | ARM_DisplayReportAggregatesOnly\n};\n\nenum Skipped\n#if defined(BENCHMARK_HAS_CXX11)\n : unsigned\n#endif\n{\n NotSkipped = 0,\n SkippedWithMessage,\n SkippedWithError\n};\n\n} // namespace internal\n\n// State is passed to a running Benchmark and contains state for the\n// benchmark to use.\nclass BENCHMARK_EXPORT State {\n public:\n struct StateIterator;\n friend struct StateIterator;\n\n // Returns iterators used to run each iteration of a benchmark using a\n // C++11 ranged-based for loop. These functions should not be called directly.\n //\n // REQUIRES: The benchmark has not started running yet. Neither begin nor end\n // have been called previously.\n //\n // NOTE: KeepRunning may not be used after calling either of these functions.\n BENCHMARK_ALWAYS_INLINE StateIterator begin();\n BENCHMARK_ALWAYS_INLINE StateIterator end();\n\n // Returns true if the benchmark should continue through another iteration.\n // NOTE: A benchmark may not return from the test until KeepRunning() has\n // returned false.\n bool KeepRunning();\n\n // Returns true iff the benchmark should run n more iterations.\n // REQUIRES: 'n' > 0.\n // NOTE: A benchmark must not return from the test until KeepRunningBatch()\n // has returned false.\n // NOTE: KeepRunningBatch() may overshoot by up to 'n' iterations.\n //\n // Intended usage:\n // while (state.KeepRunningBatch(1000)) {\n // // process 1000 elements\n // }\n bool KeepRunningBatch(IterationCount n);\n\n // REQUIRES: timer is running and 'SkipWithMessage(...)' or\n // 'SkipWithError(...)' has not been called by the current thread.\n // Stop the benchmark timer. If not called, the timer will be\n // automatically stopped after the last iteration of the benchmark loop.\n //\n // For threaded benchmarks the PauseTiming() function only pauses the timing\n // for the current thread.\n //\n // NOTE: The \"real time\" measurement is per-thread. If different threads\n // report different measurements the largest one is reported.\n //\n // NOTE: PauseTiming()/ResumeTiming() are relatively\n // heavyweight, and so their use should generally be avoided\n // within each benchmark iteration, if possible.\n void PauseTiming();\n\n // REQUIRES: timer is not running and 'SkipWithMessage(...)' or\n // 'SkipWithError(...)' has not been called by the current thread.\n // Start the benchmark timer. The timer is NOT running on entrance to the\n // benchmark function. It begins running after control flow enters the\n // benchmark loop.\n //\n // NOTE: PauseTiming()/ResumeTiming() are relatively\n // heavyweight, and so their use should generally be avoided\n // within each benchmark iteration, if possible.\n void ResumeTiming();\n\n // REQUIRES: 'SkipWithMessage(...)' or 'SkipWithError(...)' has not been\n // called previously by the current thread.\n // Report the benchmark as resulting in being skipped with the specified\n // 'msg'.\n // After this call the user may explicitly 'return' from the benchmark.\n //\n // If the ranged-for style of benchmark loop is used, the user must explicitly\n // break from the loop, otherwise all future iterations will be run.\n // If the 'KeepRunning()' loop is used the current thread will automatically\n // exit the loop at the end of the current iteration.\n //\n // For threaded benchmarks only the current thread stops executing and future\n // calls to `KeepRunning()` will block until all threads have completed\n // the `KeepRunning()` loop. If multiple threads report being skipped only the\n // first skip message is used.\n //\n // NOTE: Calling 'SkipWithMessage(...)' does not cause the benchmark to exit\n // the current scope immediately. If the function is called from within\n // the 'KeepRunning()' loop the current iteration will finish. It is the users\n // responsibility to exit the scope as needed.\n void SkipWithMessage(const std::string& msg);\n\n // REQUIRES: 'SkipWithMessage(...)' or 'SkipWithError(...)' has not been\n // called previously by the current thread.\n // Report the benchmark as resulting in an error with the specified 'msg'.\n // After this call the user may explicitly 'return' from the benchmark.\n //\n // If the ranged-for style of benchmark loop is used, the user must explicitly\n // break from the loop, otherwise all future iterations will be run.\n // If the 'KeepRunning()' loop is used the current thread will automatically\n // exit the loop at the end of the current iteration.\n //\n // For threaded benchmarks only the current thread stops executing and future\n // calls to `KeepRunning()` will block until all threads have completed\n // the `KeepRunning()` loop. If multiple threads report an error only the\n // first error message is used.\n //\n // NOTE: Calling 'SkipWithError(...)' does not cause the benchmark to exit\n // the current scope immediately. If the function is called from within\n // the 'KeepRunning()' loop the current iteration will finish. It is the users\n // responsibility to exit the scope as needed.\n void SkipWithError(const std::string& msg);\n\n // Returns true if 'SkipWithMessage(...)' or 'SkipWithError(...)' was called.\n bool skipped() const { return internal::NotSkipped != skipped_; }\n\n // Returns true if an error has been reported with 'SkipWithError(...)'.\n bool error_occurred() const { return internal::SkippedWithError == skipped_; }\n\n // REQUIRES: called exactly once per iteration of the benchmarking loop.\n // Set the manually measured time for this benchmark iteration, which\n // is used instead of automatically measured time if UseManualTime() was\n // specified.\n //\n // For threaded benchmarks the final value will be set to the largest\n // reported values.\n void SetIterationTime(double seconds);\n\n // Set the number of bytes processed by the current benchmark\n // execution. This routine is typically called once at the end of a\n // throughput oriented benchmark.\n //\n // REQUIRES: a benchmark has exited its benchmarking loop.\n BENCHMARK_ALWAYS_INLINE\n void SetBytesProcessed(int64_t bytes) {\n counters[\"bytes_per_second\"] =\n Counter(static_cast(bytes), Counter::kIsRate, Counter::kIs1024);\n }\n\n BENCHMARK_ALWAYS_INLINE\n int64_t bytes_processed() const {\n if (counters.find(\"bytes_per_second\") != counters.end())\n return static_cast(counters.at(\"bytes_per_second\"));\n return 0;\n }\n\n // If this routine is called with complexity_n > 0 and complexity report is\n // requested for the\n // family benchmark, then current benchmark will be part of the computation\n // and complexity_n will\n // represent the length of N.\n BENCHMARK_ALWAYS_INLINE\n void SetComplexityN(int64_t complexity_n) { complexity_n_ = complexity_n; }\n\n BENCHMARK_ALWAYS_INLINE\n int64_t complexity_length_n() const { return complexity_n_; }\n\n // If this routine is called with items > 0, then an items/s\n // label is printed on the benchmark report line for the currently\n // executing benchmark. It is typically called at the end of a processing\n // benchmark where a processing items/second output is desired.\n //\n // REQUIRES: a benchmark has exited its benchmarking loop.\n BENCHMARK_ALWAYS_INLINE\n void SetItemsProcessed(int64_t items) {\n counters[\"items_per_second\"] =\n Counter(static_cast(items), benchmark::Counter::kIsRate);\n }\n\n BENCHMARK_ALWAYS_INLINE\n int64_t items_processed() const {\n if (counters.find(\"items_per_second\") != counters.end())\n return static_cast(counters.at(\"items_per_second\"));\n return 0;\n }\n\n // If this routine is called, the specified label is printed at the\n // end of the benchmark report line for the currently executing\n // benchmark. Example:\n // static void BM_Compress(benchmark::State& state) {\n // ...\n // double compress = input_size / output_size;\n // state.SetLabel(StrFormat(\"compress:%.1f%%\", 100.0*compression));\n // }\n // Produces output that looks like:\n // BM_Compress 50 50 14115038 compress:27.3%\n //\n // REQUIRES: a benchmark has exited its benchmarking loop.\n void SetLabel(const std::string& label);\n\n // Range arguments for this run. CHECKs if the argument has been set.\n BENCHMARK_ALWAYS_INLINE\n int64_t range(std::size_t pos = 0) const {\n assert(range_.size() > pos);\n return range_[pos];\n }\n\n BENCHMARK_DEPRECATED_MSG(\"use 'range(0)' instead\")\n int64_t range_x() const { return range(0); }\n\n BENCHMARK_DEPRECATED_MSG(\"use 'range(1)' instead\")\n int64_t range_y() const { return range(1); }\n\n // Number of threads concurrently executing the benchmark.\n BENCHMARK_ALWAYS_INLINE\n int threads() const { return threads_; }\n\n // Index of the executing thread. Values from [0, threads).\n BENCHMARK_ALWAYS_INLINE\n int thread_index() const { return thread_index_; }\n\n BENCHMARK_ALWAYS_INLINE\n IterationCount iterations() const {\n if (BENCHMARK_BUILTIN_EXPECT(!started_, false)) {\n return 0;\n }\n return max_iterations - total_iterations_ + batch_leftover_;\n }\n\n BENCHMARK_ALWAYS_INLINE\n std::string name() const { return name_; }\n\n private:\n // items we expect on the first cache line (ie 64 bytes of the struct)\n // When total_iterations_ is 0, KeepRunning() and friends will return false.\n // May be larger than max_iterations.\n IterationCount total_iterations_;\n\n // When using KeepRunningBatch(), batch_leftover_ holds the number of\n // iterations beyond max_iters that were run. Used to track\n // completed_iterations_ accurately.\n IterationCount batch_leftover_;\n\n public:\n const IterationCount max_iterations;\n\n private:\n bool started_;\n bool finished_;\n internal::Skipped skipped_;\n\n // items we don't need on the first cache line\n std::vector range_;\n\n int64_t complexity_n_;\n\n public:\n // Container for user-defined counters.\n UserCounters counters;\n\n private:\n State(std::string name, IterationCount max_iters,\n const std::vector& ranges, int thread_i, int n_threads,\n internal::ThreadTimer* timer, internal::ThreadManager* manager,\n internal::PerfCountersMeasurement* perf_counters_measurement);\n\n void StartKeepRunning();\n // Implementation of KeepRunning() and KeepRunningBatch().\n // is_batch must be true unless n is 1.\n bool KeepRunningInternal(IterationCount n, bool is_batch);\n void FinishKeepRunning();\n\n const std::string name_;\n const int thread_index_;\n const int threads_;\n\n internal::ThreadTimer* const timer_;\n internal::ThreadManager* const manager_;\n internal::PerfCountersMeasurement* const perf_counters_measurement_;\n\n friend class internal::BenchmarkInstance;\n};\n\ninline BENCHMARK_ALWAYS_INLINE bool State::KeepRunning() {\n return KeepRunningInternal(1, /*is_batch=*/false);\n}\n\ninline BENCHMARK_ALWAYS_INLINE bool State::KeepRunningBatch(IterationCount n) {\n return KeepRunningInternal(n, /*is_batch=*/true);\n}\n\ninline BENCHMARK_ALWAYS_INLINE bool State::KeepRunningInternal(IterationCount n,\n bool is_batch) {\n // total_iterations_ is set to 0 by the constructor, and always set to a\n // nonzero value by StartKepRunning().\n assert(n > 0);\n // n must be 1 unless is_batch is true.\n assert(is_batch || n == 1);\n if (BENCHMARK_BUILTIN_EXPECT(total_iterations_ >= n, true)) {\n total_iterations_ -= n;\n return true;\n }\n if (!started_) {\n StartKeepRunning();\n if (!skipped() && total_iterations_ >= n) {\n total_iterations_ -= n;\n return true;\n }\n }\n // For non-batch runs, total_iterations_ must be 0 by now.\n if (is_batch && total_iterations_ != 0) {\n batch_leftover_ = n - total_iterations_;\n total_iterations_ = 0;\n return true;\n }\n FinishKeepRunning();\n return false;\n}\n\nstruct State::StateIterator {\n struct BENCHMARK_UNUSED Value {};\n typedef std::forward_iterator_tag iterator_category;\n typedef Value value_type;\n typedef Value reference;\n typedef Value pointer;\n typedef std::ptrdiff_t difference_type;\n\n private:\n friend class State;\n BENCHMARK_ALWAYS_INLINE\n StateIterator() : cached_(0), parent_() {}\n\n BENCHMARK_ALWAYS_INLINE\n explicit StateIterator(State* st)\n : cached_(st->skipped() ? 0 : st->max_iterations), parent_(st) {}\n\n public:\n BENCHMARK_ALWAYS_INLINE\n Value operator*() const { return Value(); }\n\n BENCHMARK_ALWAYS_INLINE\n StateIterator& operator++() {\n assert(cached_ > 0);\n --cached_;\n return *this;\n }\n\n BENCHMARK_ALWAYS_INLINE\n bool operator!=(StateIterator const&) const {\n if (BENCHMARK_BUILTIN_EXPECT(cached_ != 0, true)) return true;\n parent_->FinishKeepRunning();\n return false;\n }\n\n private:\n IterationCount cached_;\n State* const parent_;\n};\n\ninline BENCHMARK_ALWAYS_INLINE State::StateIterator State::begin() {\n return StateIterator(this);\n}\ninline BENCHMARK_ALWAYS_INLINE State::StateIterator State::end() {\n StartKeepRunning();\n return StateIterator();\n}\n\nnamespace internal {\n\ntypedef void(Function)(State&);\n\n// ------------------------------------------------------\n// Benchmark registration object. The BENCHMARK() macro expands\n// into an internal::Benchmark* object. Various methods can\n// be called on this object to change the properties of the benchmark.\n// Each method returns \"this\" so that multiple method calls can\n// chained into one expression.\nclass BENCHMARK_EXPORT Benchmark {\n public:\n virtual ~Benchmark();\n\n // Note: the following methods all return \"this\" so that multiple\n // method calls can be chained together in one expression.\n\n // Specify the name of the benchmark\n Benchmark* Name(const std::string& name);\n\n // Run this benchmark once with \"x\" as the extra argument passed\n // to the function.\n // REQUIRES: The function passed to the constructor must accept an arg1.\n Benchmark* Arg(int64_t x);\n\n // Run this benchmark with the given time unit for the generated output report\n Benchmark* Unit(TimeUnit unit);\n\n // Run this benchmark once for a number of values picked from the\n // range [start..limit]. (start and limit are always picked.)\n // REQUIRES: The function passed to the constructor must accept an arg1.\n Benchmark* Range(int64_t start, int64_t limit);\n\n // Run this benchmark once for all values in the range [start..limit] with\n // specific step\n // REQUIRES: The function passed to the constructor must accept an arg1.\n Benchmark* DenseRange(int64_t start, int64_t limit, int step = 1);\n\n // Run this benchmark once with \"args\" as the extra arguments passed\n // to the function.\n // REQUIRES: The function passed to the constructor must accept arg1, arg2 ...\n Benchmark* Args(const std::vector& args);\n\n // Equivalent to Args({x, y})\n // NOTE: This is a legacy C++03 interface provided for compatibility only.\n // New code should use 'Args'.\n Benchmark* ArgPair(int64_t x, int64_t y) {\n std::vector args;\n args.push_back(x);\n args.push_back(y);\n return Args(args);\n }\n\n // Run this benchmark once for a number of values picked from the\n // ranges [start..limit]. (starts and limits are always picked.)\n // REQUIRES: The function passed to the constructor must accept arg1, arg2 ...\n Benchmark* Ranges(const std::vector >& ranges);\n\n // Run this benchmark once for each combination of values in the (cartesian)\n // product of the supplied argument lists.\n // REQUIRES: The function passed to the constructor must accept arg1, arg2 ...\n Benchmark* ArgsProduct(const std::vector >& arglists);\n\n // Equivalent to ArgNames({name})\n Benchmark* ArgName(const std::string& name);\n\n // Set the argument names to display in the benchmark name. If not called,\n // only argument values will be shown.\n Benchmark* ArgNames(const std::vector& names);\n\n // Equivalent to Ranges({{lo1, hi1}, {lo2, hi2}}).\n // NOTE: This is a legacy C++03 interface provided for compatibility only.\n // New code should use 'Ranges'.\n Benchmark* RangePair(int64_t lo1, int64_t hi1, int64_t lo2, int64_t hi2) {\n std::vector > ranges;\n ranges.push_back(std::make_pair(lo1, hi1));\n ranges.push_back(std::make_pair(lo2, hi2));\n return Ranges(ranges);\n }\n\n // Have \"setup\" and/or \"teardown\" invoked once for every benchmark run.\n // If the benchmark is multi-threaded (will run in k threads concurrently),\n // the setup callback will be be invoked exactly once (not k times) before\n // each run with k threads. Time allowing (e.g. for a short benchmark), there\n // may be multiple such runs per benchmark, each run with its own\n // \"setup\"/\"teardown\".\n //\n // If the benchmark uses different size groups of threads (e.g. via\n // ThreadRange), the above will be true for each size group.\n //\n // The callback will be passed a State object, which includes the number\n // of threads, thread-index, benchmark arguments, etc.\n //\n // The callback must not be NULL or self-deleting.\n Benchmark* Setup(void (*setup)(const benchmark::State&));\n Benchmark* Teardown(void (*teardown)(const benchmark::State&));\n\n // Pass this benchmark object to *func, which can customize\n // the benchmark by calling various methods like Arg, Args,\n // Threads, etc.\n Benchmark* Apply(void (*func)(Benchmark* benchmark));\n\n // Set the range multiplier for non-dense range. If not called, the range\n // multiplier kRangeMultiplier will be used.\n Benchmark* RangeMultiplier(int multiplier);\n\n // Set the minimum amount of time to use when running this benchmark. This\n // option overrides the `benchmark_min_time` flag.\n // REQUIRES: `t > 0` and `Iterations` has not been called on this benchmark.\n Benchmark* MinTime(double t);\n\n // Set the minimum amount of time to run the benchmark before taking runtimes\n // of this benchmark into account. This\n // option overrides the `benchmark_min_warmup_time` flag.\n // REQUIRES: `t >= 0` and `Iterations` has not been called on this benchmark.\n Benchmark* MinWarmUpTime(double t);\n\n // Specify the amount of iterations that should be run by this benchmark.\n // This option overrides the `benchmark_min_time` flag.\n // REQUIRES: 'n > 0' and `MinTime` has not been called on this benchmark.\n //\n // NOTE: This function should only be used when *exact* iteration control is\n // needed and never to control or limit how long a benchmark runs, where\n // `--benchmark_min_time=s` or `MinTime(...)` should be used instead.\n Benchmark* Iterations(IterationCount n);\n\n // Specify the amount of times to repeat this benchmark. This option overrides\n // the `benchmark_repetitions` flag.\n // REQUIRES: `n > 0`\n Benchmark* Repetitions(int n);\n\n // Specify if each repetition of the benchmark should be reported separately\n // or if only the final statistics should be reported. If the benchmark\n // is not repeated then the single result is always reported.\n // Applies to *ALL* reporters (display and file).\n Benchmark* ReportAggregatesOnly(bool value = true);\n\n // Same as ReportAggregatesOnly(), but applies to display reporter only.\n Benchmark* DisplayAggregatesOnly(bool value = true);\n\n // By default, the CPU time is measured only for the main thread, which may\n // be unrepresentative if the benchmark uses threads internally. If called,\n // the total CPU time spent by all the threads will be measured instead.\n // By default, only the main thread CPU time will be measured.\n Benchmark* MeasureProcessCPUTime();\n\n // If a particular benchmark should use the Wall clock instead of the CPU time\n // (be it either the CPU time of the main thread only (default), or the\n // total CPU usage of the benchmark), call this method. If called, the elapsed\n // (wall) time will be used to control how many iterations are run, and in the\n // printing of items/second or MB/seconds values.\n // If not called, the CPU time used by the benchmark will be used.\n Benchmark* UseRealTime();\n\n // If a benchmark must measure time manually (e.g. if GPU execution time is\n // being\n // measured), call this method. If called, each benchmark iteration should\n // call\n // SetIterationTime(seconds) to report the measured time, which will be used\n // to control how many iterations are run, and in the printing of items/second\n // or MB/second values.\n Benchmark* UseManualTime();\n\n // Set the asymptotic computational complexity for the benchmark. If called\n // the asymptotic computational complexity will be shown on the output.\n Benchmark* Complexity(BigO complexity = benchmark::oAuto);\n\n // Set the asymptotic computational complexity for the benchmark. If called\n // the asymptotic computational complexity will be shown on the output.\n Benchmark* Complexity(BigOFunc* complexity);\n\n // Add this statistics to be computed over all the values of benchmark run\n Benchmark* ComputeStatistics(const std::string& name,\n StatisticsFunc* statistics,\n StatisticUnit unit = kTime);\n\n // Support for running multiple copies of the same benchmark concurrently\n // in multiple threads. This may be useful when measuring the scaling\n // of some piece of code.\n\n // Run one instance of this benchmark concurrently in t threads.\n Benchmark* Threads(int t);\n\n // Pick a set of values T from [min_threads,max_threads].\n // min_threads and max_threads are always included in T. Run this\n // benchmark once for each value in T. The benchmark run for a\n // particular value t consists of t threads running the benchmark\n // function concurrently. For example, consider:\n // BENCHMARK(Foo)->ThreadRange(1,16);\n // This will run the following benchmarks:\n // Foo in 1 thread\n // Foo in 2 threads\n // Foo in 4 threads\n // Foo in 8 threads\n // Foo in 16 threads\n Benchmark* ThreadRange(int min_threads, int max_threads);\n\n // For each value n in the range, run this benchmark once using n threads.\n // min_threads and max_threads are always included in the range.\n // stride specifies the increment. E.g. DenseThreadRange(1, 8, 3) starts\n // a benchmark with 1, 4, 7 and 8 threads.\n Benchmark* DenseThreadRange(int min_threads, int max_threads, int stride = 1);\n\n // Equivalent to ThreadRange(NumCPUs(), NumCPUs())\n Benchmark* ThreadPerCpu();\n\n virtual void Run(State& state) = 0;\n\n TimeUnit GetTimeUnit() const;\n\n protected:\n explicit Benchmark(const std::string& name);\n void SetName(const std::string& name);\n\n public:\n const char* GetName() const;\n int ArgsCnt() const;\n const char* GetArgName(int arg) const;\n\n private:\n friend class BenchmarkFamilies;\n friend class BenchmarkInstance;\n\n std::string name_;\n AggregationReportMode aggregation_report_mode_;\n std::vector arg_names_; // Args for all benchmark runs\n std::vector > args_; // Args for all benchmark runs\n\n TimeUnit time_unit_;\n bool use_default_time_unit_;\n\n int range_multiplier_;\n double min_time_;\n double min_warmup_time_;\n IterationCount iterations_;\n int repetitions_;\n bool measure_process_cpu_time_;\n bool use_real_time_;\n bool use_manual_time_;\n BigO complexity_;\n BigOFunc* complexity_lambda_;\n std::vector statistics_;\n std::vector thread_counts_;\n\n typedef void (*callback_function)(const benchmark::State&);\n callback_function setup_;\n callback_function teardown_;\n\n Benchmark(Benchmark const&)\n#if defined(BENCHMARK_HAS_CXX11)\n = delete\n#endif\n ;\n\n Benchmark& operator=(Benchmark const&)\n#if defined(BENCHMARK_HAS_CXX11)\n = delete\n#endif\n ;\n};\n\n} // namespace internal\n\n// Create and register a benchmark with the specified 'name' that invokes\n// the specified functor 'fn'.\n//\n// RETURNS: A pointer to the registered benchmark.\ninternal::Benchmark* RegisterBenchmark(const std::string& name,\n internal::Function* fn);\n\n#if defined(BENCHMARK_HAS_CXX11)\ntemplate \ninternal::Benchmark* RegisterBenchmark(const std::string& name, Lambda&& fn);\n#endif\n\n// Remove all registered benchmarks. All pointers to previously registered\n// benchmarks are invalidated.\nBENCHMARK_EXPORT void ClearRegisteredBenchmarks();\n\nnamespace internal {\n// The class used to hold all Benchmarks created from static function.\n// (ie those created using the BENCHMARK(...) macros.\nclass BENCHMARK_EXPORT FunctionBenchmark : public Benchmark {\n public:\n FunctionBenchmark(const std::string& name, Function* func)\n : Benchmark(name), func_(func) {}\n\n void Run(State& st) BENCHMARK_OVERRIDE;\n\n private:\n Function* func_;\n};\n\n#ifdef BENCHMARK_HAS_CXX11\ntemplate \nclass LambdaBenchmark : public Benchmark {\n public:\n void Run(State& st) BENCHMARK_OVERRIDE { lambda_(st); }\n\n private:\n template \n LambdaBenchmark(const std::string& name, OLambda&& lam)\n : Benchmark(name), lambda_(std::forward(lam)) {}\n\n LambdaBenchmark(LambdaBenchmark const&) = delete;\n\n template // NOLINTNEXTLINE(readability-redundant-declaration)\n friend Benchmark* ::benchmark::RegisterBenchmark(const std::string&, Lam&&);\n\n Lambda lambda_;\n};\n#endif\n} // namespace internal\n\ninline internal::Benchmark* RegisterBenchmark(const std::string& name,\n internal::Function* fn) {\n // FIXME: this should be a `std::make_unique<>()` but we don't have C++14.\n // codechecker_intentional [cplusplus.NewDeleteLeaks]\n return internal::RegisterBenchmarkInternal(\n ::new internal::FunctionBenchmark(name, fn));\n}\n\n#ifdef BENCHMARK_HAS_CXX11\ntemplate \ninternal::Benchmark* RegisterBenchmark(const std::string& name, Lambda&& fn) {\n using BenchType =\n internal::LambdaBenchmark::type>;\n // FIXME: this should be a `std::make_unique<>()` but we don't have C++14.\n // codechecker_intentional [cplusplus.NewDeleteLeaks]\n return internal::RegisterBenchmarkInternal(\n ::new BenchType(name, std::forward(fn)));\n}\n#endif\n\n#if defined(BENCHMARK_HAS_CXX11) && \\\n (!defined(BENCHMARK_GCC_VERSION) || BENCHMARK_GCC_VERSION >= 409)\ntemplate \ninternal::Benchmark* RegisterBenchmark(const std::string& name, Lambda&& fn,\n Args&&... args) {\n return benchmark::RegisterBenchmark(\n name, [=](benchmark::State& st) { fn(st, args...); });\n}\n#else\n#define BENCHMARK_HAS_NO_VARIADIC_REGISTER_BENCHMARK\n#endif\n\n// The base class for all fixture tests.\nclass Fixture : public internal::Benchmark {\n public:\n Fixture() : internal::Benchmark(\"\") {}\n\n void Run(State& st) BENCHMARK_OVERRIDE {\n this->SetUp(st);\n this->BenchmarkCase(st);\n this->TearDown(st);\n }\n\n // These will be deprecated ...\n virtual void SetUp(const State&) {}\n virtual void TearDown(const State&) {}\n // ... In favor of these.\n virtual void SetUp(State& st) { SetUp(const_cast(st)); }\n virtual void TearDown(State& st) { TearDown(const_cast(st)); }\n\n protected:\n virtual void BenchmarkCase(State&) = 0;\n};\n} // namespace benchmark\n\n// ------------------------------------------------------\n// Macro to register benchmarks\n\n// Check that __COUNTER__ is defined and that __COUNTER__ increases by 1\n// every time it is expanded. X + 1 == X + 0 is used in case X is defined to be\n// empty. If X is empty the expression becomes (+1 == +0).\n#if defined(__COUNTER__) && (__COUNTER__ + 1 == __COUNTER__ + 0)\n#define BENCHMARK_PRIVATE_UNIQUE_ID __COUNTER__\n#else\n#define BENCHMARK_PRIVATE_UNIQUE_ID __LINE__\n#endif\n\n// Helpers for generating unique variable names\n#ifdef BENCHMARK_HAS_CXX11\n#define BENCHMARK_PRIVATE_NAME(...) \\\n BENCHMARK_PRIVATE_CONCAT(benchmark_uniq_, BENCHMARK_PRIVATE_UNIQUE_ID, \\\n __VA_ARGS__)\n#else\n#define BENCHMARK_PRIVATE_NAME(n) \\\n BENCHMARK_PRIVATE_CONCAT(benchmark_uniq_, BENCHMARK_PRIVATE_UNIQUE_ID, n)\n#endif // BENCHMARK_HAS_CXX11\n\n#define BENCHMARK_PRIVATE_CONCAT(a, b, c) BENCHMARK_PRIVATE_CONCAT2(a, b, c)\n#define BENCHMARK_PRIVATE_CONCAT2(a, b, c) a##b##c\n// Helper for concatenation with macro name expansion\n#define BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method) \\\n BaseClass##_##Method##_Benchmark\n\n#define BENCHMARK_PRIVATE_DECLARE(n) \\\n static ::benchmark::internal::Benchmark* BENCHMARK_PRIVATE_NAME(n) \\\n BENCHMARK_UNUSED\n\n#ifdef BENCHMARK_HAS_CXX11\n#define BENCHMARK(...) \\\n BENCHMARK_PRIVATE_DECLARE(_benchmark_) = \\\n (::benchmark::internal::RegisterBenchmarkInternal( \\\n new ::benchmark::internal::FunctionBenchmark(#__VA_ARGS__, \\\n __VA_ARGS__)))\n#else\n#define BENCHMARK(n) \\\n BENCHMARK_PRIVATE_DECLARE(n) = \\\n (::benchmark::internal::RegisterBenchmarkInternal( \\\n new ::benchmark::internal::FunctionBenchmark(#n, n)))\n#endif // BENCHMARK_HAS_CXX11\n\n// Old-style macros\n#define BENCHMARK_WITH_ARG(n, a) BENCHMARK(n)->Arg((a))\n#define BENCHMARK_WITH_ARG2(n, a1, a2) BENCHMARK(n)->Args({(a1), (a2)})\n#define BENCHMARK_WITH_UNIT(n, t) BENCHMARK(n)->Unit((t))\n#define BENCHMARK_RANGE(n, lo, hi) BENCHMARK(n)->Range((lo), (hi))\n#define BENCHMARK_RANGE2(n, l1, h1, l2, h2) \\\n BENCHMARK(n)->RangePair({{(l1), (h1)}, {(l2), (h2)}})\n\n#ifdef BENCHMARK_HAS_CXX11\n\n// Register a benchmark which invokes the function specified by `func`\n// with the additional arguments specified by `...`.\n//\n// For example:\n//\n// template `\n// void BM_takes_args(benchmark::State& state, ExtraArgs&&... extra_args) {\n// [...]\n//}\n// /* Registers a benchmark named \"BM_takes_args/int_string_test` */\n// BENCHMARK_CAPTURE(BM_takes_args, int_string_test, 42, std::string(\"abc\"));\n#define BENCHMARK_CAPTURE(func, test_case_name, ...) \\\n BENCHMARK_PRIVATE_DECLARE(func) = \\\n (::benchmark::internal::RegisterBenchmarkInternal( \\\n new ::benchmark::internal::FunctionBenchmark( \\\n #func \"/\" #test_case_name, \\\n [](::benchmark::State& st) { func(st, __VA_ARGS__); })))\n\n#endif // BENCHMARK_HAS_CXX11\n\n// This will register a benchmark for a templatized function. For example:\n//\n// template\n// void BM_Foo(int iters);\n//\n// BENCHMARK_TEMPLATE(BM_Foo, 1);\n//\n// will register BM_Foo<1> as a benchmark.\n#define BENCHMARK_TEMPLATE1(n, a) \\\n BENCHMARK_PRIVATE_DECLARE(n) = \\\n (::benchmark::internal::RegisterBenchmarkInternal( \\\n new ::benchmark::internal::FunctionBenchmark(#n \"<\" #a \">\", n)))\n\n#define BENCHMARK_TEMPLATE2(n, a, b) \\\n BENCHMARK_PRIVATE_DECLARE(n) = \\\n (::benchmark::internal::RegisterBenchmarkInternal( \\\n new ::benchmark::internal::FunctionBenchmark(#n \"<\" #a \",\" #b \">\", \\\n n)))\n\n#ifdef BENCHMARK_HAS_CXX11\n#define BENCHMARK_TEMPLATE(n, ...) \\\n BENCHMARK_PRIVATE_DECLARE(n) = \\\n (::benchmark::internal::RegisterBenchmarkInternal( \\\n new ::benchmark::internal::FunctionBenchmark( \\\n #n \"<\" #__VA_ARGS__ \">\", n<__VA_ARGS__>)))\n#else\n#define BENCHMARK_TEMPLATE(n, a) BENCHMARK_TEMPLATE1(n, a)\n#endif\n\n#define BENCHMARK_PRIVATE_DECLARE_F(BaseClass, Method) \\\n class BaseClass##_##Method##_Benchmark : public BaseClass { \\\n public: \\\n BaseClass##_##Method##_Benchmark() { \\\n this->SetName(#BaseClass \"/\" #Method); \\\n } \\\n \\\n protected: \\\n void BenchmarkCase(::benchmark::State&) BENCHMARK_OVERRIDE; \\\n };\n\n#define BENCHMARK_TEMPLATE1_PRIVATE_DECLARE_F(BaseClass, Method, a) \\\n class BaseClass##_##Method##_Benchmark : public BaseClass { \\\n public: \\\n BaseClass##_##Method##_Benchmark() { \\\n this->SetName(#BaseClass \"<\" #a \">/\" #Method); \\\n } \\\n \\\n protected: \\\n void BenchmarkCase(::benchmark::State&) BENCHMARK_OVERRIDE; \\\n };\n\n#define BENCHMARK_TEMPLATE2_PRIVATE_DECLARE_F(BaseClass, Method, a, b) \\\n class BaseClass##_##Method##_Benchmark : public BaseClass { \\\n public: \\\n BaseClass##_##Method##_Benchmark() { \\\n this->SetName(#BaseClass \"<\" #a \",\" #b \">/\" #Method); \\\n } \\\n \\\n protected: \\\n void BenchmarkCase(::benchmark::State&) BENCHMARK_OVERRIDE; \\\n };\n\n#ifdef BENCHMARK_HAS_CXX11\n#define BENCHMARK_TEMPLATE_PRIVATE_DECLARE_F(BaseClass, Method, ...) \\\n class BaseClass##_##Method##_Benchmark : public BaseClass<__VA_ARGS__> { \\\n public: \\\n BaseClass##_##Method##_Benchmark() { \\\n this->SetName(#BaseClass \"<\" #__VA_ARGS__ \">/\" #Method); \\\n } \\\n \\\n protected: \\\n void BenchmarkCase(::benchmark::State&) BENCHMARK_OVERRIDE; \\\n };\n#else\n#define BENCHMARK_TEMPLATE_PRIVATE_DECLARE_F(n, a) \\\n BENCHMARK_TEMPLATE1_PRIVATE_DECLARE_F(n, a)\n#endif\n\n#define BENCHMARK_DEFINE_F(BaseClass, Method) \\\n BENCHMARK_PRIVATE_DECLARE_F(BaseClass, Method) \\\n void BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method)::BenchmarkCase\n\n#define BENCHMARK_TEMPLATE1_DEFINE_F(BaseClass, Method, a) \\\n BENCHMARK_TEMPLATE1_PRIVATE_DECLARE_F(BaseClass, Method, a) \\\n void BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method)::BenchmarkCase\n\n#define BENCHMARK_TEMPLATE2_DEFINE_F(BaseClass, Method, a, b) \\\n BENCHMARK_TEMPLATE2_PRIVATE_DECLARE_F(BaseClass, Method, a, b) \\\n void BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method)::BenchmarkCase\n\n#ifdef BENCHMARK_HAS_CXX11\n#define BENCHMARK_TEMPLATE_DEFINE_F(BaseClass, Method, ...) \\\n BENCHMARK_TEMPLATE_PRIVATE_DECLARE_F(BaseClass, Method, __VA_ARGS__) \\\n void BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method)::BenchmarkCase\n#else\n#define BENCHMARK_TEMPLATE_DEFINE_F(BaseClass, Method, a) \\\n BENCHMARK_TEMPLATE1_DEFINE_F(BaseClass, Method, a)\n#endif\n\n#define BENCHMARK_REGISTER_F(BaseClass, Method) \\\n BENCHMARK_PRIVATE_REGISTER_F(BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method))\n\n#define BENCHMARK_PRIVATE_REGISTER_F(TestName) \\\n BENCHMARK_PRIVATE_DECLARE(TestName) = \\\n (::benchmark::internal::RegisterBenchmarkInternal(new TestName()))\n\n// This macro will define and register a benchmark within a fixture class.\n#define BENCHMARK_F(BaseClass, Method) \\\n BENCHMARK_PRIVATE_DECLARE_F(BaseClass, Method) \\\n BENCHMARK_REGISTER_F(BaseClass, Method); \\\n void BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method)::BenchmarkCase\n\n#define BENCHMARK_TEMPLATE1_F(BaseClass, Method, a) \\\n BENCHMARK_TEMPLATE1_PRIVATE_DECLARE_F(BaseClass, Method, a) \\\n BENCHMARK_REGISTER_F(BaseClass, Method); \\\n void BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method)::BenchmarkCase\n\n#define BENCHMARK_TEMPLATE2_F(BaseClass, Method, a, b) \\\n BENCHMARK_TEMPLATE2_PRIVATE_DECLARE_F(BaseClass, Method, a, b) \\\n BENCHMARK_REGISTER_F(BaseClass, Method); \\\n void BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method)::BenchmarkCase\n\n#ifdef BENCHMARK_HAS_CXX11\n#define BENCHMARK_TEMPLATE_F(BaseClass, Method, ...) \\\n BENCHMARK_TEMPLATE_PRIVATE_DECLARE_F(BaseClass, Method, __VA_ARGS__) \\\n BENCHMARK_REGISTER_F(BaseClass, Method); \\\n void BENCHMARK_PRIVATE_CONCAT_NAME(BaseClass, Method)::BenchmarkCase\n#else\n#define BENCHMARK_TEMPLATE_F(BaseClass, Method, a) \\\n BENCHMARK_TEMPLATE1_F(BaseClass, Method, a)\n#endif\n\n// Helper macro to create a main routine in a test that runs the benchmarks\n// Note the workaround for Hexagon simulator passing argc != 0, argv = NULL.\n#define BENCHMARK_MAIN() \\\n int main(int argc, char** argv) { \\\n char arg0_default[] = \"benchmark\"; \\\n char* args_default = arg0_default; \\\n if (!argv) { \\\n argc = 1; \\\n argv = &args_default; \\\n } \\\n ::benchmark::Initialize(&argc, argv); \\\n if (::benchmark::ReportUnrecognizedArguments(argc, argv)) return 1; \\\n ::benchmark::RunSpecifiedBenchmarks(); \\\n ::benchmark::Shutdown(); \\\n return 0; \\\n } \\\n int main(int, char**)\n\n// ------------------------------------------------------\n// Benchmark Reporters\n\nnamespace benchmark {\n\nstruct BENCHMARK_EXPORT CPUInfo {\n struct CacheInfo {\n std::string type;\n int level;\n int size;\n int num_sharing;\n };\n\n enum Scaling { UNKNOWN, ENABLED, DISABLED };\n\n int num_cpus;\n Scaling scaling;\n double cycles_per_second;\n std::vector caches;\n std::vector load_avg;\n\n static const CPUInfo& Get();\n\n private:\n CPUInfo();\n BENCHMARK_DISALLOW_COPY_AND_ASSIGN(CPUInfo);\n};\n\n// Adding Struct for System Information\nstruct BENCHMARK_EXPORT SystemInfo {\n std::string name;\n static const SystemInfo& Get();\n\n private:\n SystemInfo();\n BENCHMARK_DISALLOW_COPY_AND_ASSIGN(SystemInfo);\n};\n\n// BenchmarkName contains the components of the Benchmark's name\n// which allows individual fields to be modified or cleared before\n// building the final name using 'str()'.\nstruct BENCHMARK_EXPORT BenchmarkName {\n std::string function_name;\n std::string args;\n std::string min_time;\n std::string min_warmup_time;\n std::string iterations;\n std::string repetitions;\n std::string time_type;\n std::string threads;\n\n // Return the full name of the benchmark with each non-empty\n // field separated by a '/'\n std::string str() const;\n};\n\n// Interface for custom benchmark result printers.\n// By default, benchmark reports are printed to stdout. However an application\n// can control the destination of the reports by calling\n// RunSpecifiedBenchmarks and passing it a custom reporter object.\n// The reporter object must implement the following interface.\nclass BENCHMARK_EXPORT BenchmarkReporter {\n public:\n struct Context {\n CPUInfo const& cpu_info;\n SystemInfo const& sys_info;\n // The number of chars in the longest benchmark name.\n size_t name_field_width;\n static const char* executable_name;\n Context();\n };\n\n struct BENCHMARK_EXPORT Run {\n static const int64_t no_repetition_index = -1;\n enum RunType { RT_Iteration, RT_Aggregate };\n\n Run()\n : run_type(RT_Iteration),\n aggregate_unit(kTime),\n skipped(internal::NotSkipped),\n iterations(1),\n threads(1),\n time_unit(GetDefaultTimeUnit()),\n real_accumulated_time(0),\n cpu_accumulated_time(0),\n max_heapbytes_used(0),\n complexity(oNone),\n complexity_lambda(),\n complexity_n(0),\n report_big_o(false),\n report_rms(false),\n memory_result(NULL),\n allocs_per_iter(0.0) {}\n\n std::string benchmark_name() const;\n BenchmarkName run_name;\n int64_t family_index;\n int64_t per_family_instance_index;\n RunType run_type;\n std::string aggregate_name;\n StatisticUnit aggregate_unit;\n std::string report_label; // Empty if not set by benchmark.\n internal::Skipped skipped;\n std::string skip_message;\n\n IterationCount iterations;\n int64_t threads;\n int64_t repetition_index;\n int64_t repetitions;\n TimeUnit time_unit;\n double real_accumulated_time;\n double cpu_accumulated_time;\n\n // Return a value representing the real time per iteration in the unit\n // specified by 'time_unit'.\n // NOTE: If 'iterations' is zero the returned value represents the\n // accumulated time.\n double GetAdjustedRealTime() const;\n\n // Return a value representing the cpu time per iteration in the unit\n // specified by 'time_unit'.\n // NOTE: If 'iterations' is zero the returned value represents the\n // accumulated time.\n double GetAdjustedCPUTime() const;\n\n // This is set to 0.0 if memory tracing is not enabled.\n double max_heapbytes_used;\n\n // Keep track of arguments to compute asymptotic complexity\n BigO complexity;\n BigOFunc* complexity_lambda;\n int64_t complexity_n;\n\n // what statistics to compute from the measurements\n const std::vector* statistics;\n\n // Inform print function whether the current run is a complexity report\n bool report_big_o;\n bool report_rms;\n\n UserCounters counters;\n\n // Memory metrics.\n const MemoryManager::Result* memory_result;\n double allocs_per_iter;\n };\n\n struct PerFamilyRunReports {\n PerFamilyRunReports() : num_runs_total(0), num_runs_done(0) {}\n\n // How many runs will all instances of this benchmark perform?\n int num_runs_total;\n\n // How many runs have happened already?\n int num_runs_done;\n\n // The reports about (non-errneous!) runs of this family.\n std::vector Runs;\n };\n\n // Construct a BenchmarkReporter with the output stream set to 'std::cout'\n // and the error stream set to 'std::cerr'\n BenchmarkReporter();\n\n // Called once for every suite of benchmarks run.\n // The parameter \"context\" contains information that the\n // reporter may wish to use when generating its report, for example the\n // platform under which the benchmarks are running. The benchmark run is\n // never started if this function returns false, allowing the reporter\n // to skip runs based on the context information.\n virtual bool ReportContext(const Context& context) = 0;\n\n // Called once for each group of benchmark runs, gives information about\n // the configurations of the runs.\n virtual void ReportRunsConfig(double /*min_time*/,\n bool /*has_explicit_iters*/,\n IterationCount /*iters*/) {}\n\n // Called once for each group of benchmark runs, gives information about\n // cpu-time and heap memory usage during the benchmark run. If the group\n // of runs contained more than two entries then 'report' contains additional\n // elements representing the mean and standard deviation of those runs.\n // Additionally if this group of runs was the last in a family of benchmarks\n // 'reports' contains additional entries representing the asymptotic\n // complexity and RMS of that benchmark family.\n virtual void ReportRuns(const std::vector& report) = 0;\n\n // Called once and only once after ever group of benchmarks is run and\n // reported.\n virtual void Finalize() {}\n\n // REQUIRES: The object referenced by 'out' is valid for the lifetime\n // of the reporter.\n void SetOutputStream(std::ostream* out) {\n assert(out);\n output_stream_ = out;\n }\n\n // REQUIRES: The object referenced by 'err' is valid for the lifetime\n // of the reporter.\n void SetErrorStream(std::ostream* err) {\n assert(err);\n error_stream_ = err;\n }\n\n std::ostream& GetOutputStream() const { return *output_stream_; }\n\n std::ostream& GetErrorStream() const { return *error_stream_; }\n\n virtual ~BenchmarkReporter();\n\n // Write a human readable string to 'out' representing the specified\n // 'context'.\n // REQUIRES: 'out' is non-null.\n static void PrintBasicContext(std::ostream* out, Context const& context);\n\n private:\n std::ostream* output_stream_;\n std::ostream* error_stream_;\n};\n\n// Simple reporter that outputs benchmark data to the console. This is the\n// default reporter used by RunSpecifiedBenchmarks().\nclass BENCHMARK_EXPORT ConsoleReporter : public BenchmarkReporter {\n public:\n enum OutputOptions {\n OO_None = 0,\n OO_Color = 1,\n OO_Tabular = 2,\n OO_ColorTabular = OO_Color | OO_Tabular,\n OO_Defaults = OO_ColorTabular\n };\n explicit ConsoleReporter(OutputOptions opts_ = OO_Defaults)\n : output_options_(opts_), name_field_width_(0), printed_header_(false) {}\n\n bool ReportContext(const Context& context) BENCHMARK_OVERRIDE;\n void ReportRuns(const std::vector& reports) BENCHMARK_OVERRIDE;\n\n protected:\n virtual void PrintRunData(const Run& report);\n virtual void PrintHeader(const Run& report);\n\n OutputOptions output_options_;\n size_t name_field_width_;\n UserCounters prev_counters_;\n bool printed_header_;\n};\n\nclass BENCHMARK_EXPORT JSONReporter : public BenchmarkReporter {\n public:\n JSONReporter() : first_report_(true) {}\n bool ReportContext(const Context& context) BENCHMARK_OVERRIDE;\n void ReportRuns(const std::vector& reports) BENCHMARK_OVERRIDE;\n void Finalize() BENCHMARK_OVERRIDE;\n\n private:\n void PrintRunData(const Run& report);\n\n bool first_report_;\n};\n\nclass BENCHMARK_EXPORT BENCHMARK_DEPRECATED_MSG(\n \"The CSV Reporter will be removed in a future release\") CSVReporter\n : public BenchmarkReporter {\n public:\n CSVReporter() : printed_header_(false) {}\n bool ReportContext(const Context& context) BENCHMARK_OVERRIDE;\n void ReportRuns(const std::vector& reports) BENCHMARK_OVERRIDE;\n\n private:\n void PrintRunData(const Run& report);\n\n bool printed_header_;\n std::set user_counter_names_;\n};\n\ninline const char* GetTimeUnitString(TimeUnit unit) {\n switch (unit) {\n case kSecond:\n return \"s\";\n case kMillisecond:\n return \"ms\";\n case kMicrosecond:\n return \"us\";\n case kNanosecond:\n return \"ns\";\n }\n BENCHMARK_UNREACHABLE();\n}\n\ninline double GetTimeUnitMultiplier(TimeUnit unit) {\n switch (unit) {\n case kSecond:\n return 1;\n case kMillisecond:\n return 1e3;\n case kMicrosecond:\n return 1e6;\n case kNanosecond:\n return 1e9;\n }\n BENCHMARK_UNREACHABLE();\n}\n\n// Creates a list of integer values for the given range and multiplier.\n// This can be used together with ArgsProduct() to allow multiple ranges\n// with different multipliers.\n// Example:\n// ArgsProduct({\n// CreateRange(0, 1024, /*multi=*/32),\n// CreateRange(0, 100, /*multi=*/4),\n// CreateDenseRange(0, 4, /*step=*/1),\n// });\nBENCHMARK_EXPORT\nstd::vector CreateRange(int64_t lo, int64_t hi, int multi);\n\n// Creates a list of integer values for the given range and step.\nBENCHMARK_EXPORT\nstd::vector CreateDenseRange(int64_t start, int64_t limit, int step);\n\n} // namespace benchmark\n\n#if defined(_MSC_VER)\n#pragma warning(pop)\n#endif\n\n#endif // BENCHMARK_BENCHMARK_H_\n" }, { "path": "3rd/benchmark-1.8.2/include/benchmark/export.h", "content": "#ifndef BENCHMARK_EXPORT_H\n#define BENCHMARK_EXPORT_H\n\n#if defined(_WIN32)\n#define EXPORT_ATTR __declspec(dllexport)\n#define IMPORT_ATTR __declspec(dllimport)\n#define NO_EXPORT_ATTR\n#define DEPRECATED_ATTR __declspec(deprecated)\n#else // _WIN32\n#define EXPORT_ATTR __attribute__((visibility(\"default\")))\n#define IMPORT_ATTR __attribute__((visibility(\"default\")))\n#define NO_EXPORT_ATTR __attribute__((visibility(\"hidden\")))\n#define DEPRECATE_ATTR __attribute__((__deprecated__))\n#endif // _WIN32\n\n#ifdef BENCHMARK_STATIC_DEFINE\n#define BENCHMARK_EXPORT\n#define BENCHMARK_NO_EXPORT\n#else // BENCHMARK_STATIC_DEFINE\n#ifndef BENCHMARK_EXPORT\n#ifdef benchmark_EXPORTS\n/* We are building this library */\n#define BENCHMARK_EXPORT EXPORT_ATTR\n#else // benchmark_EXPORTS\n/* We are using this library */\n#define BENCHMARK_EXPORT IMPORT_ATTR\n#endif // benchmark_EXPORTS\n#endif // !BENCHMARK_EXPORT\n\n#ifndef BENCHMARK_NO_EXPORT\n#define BENCHMARK_NO_EXPORT NO_EXPORT_ATTR\n#endif // !BENCHMARK_NO_EXPORT\n#endif // BENCHMARK_STATIC_DEFINE\n\n#ifndef BENCHMARK_DEPRECATED\n#define BENCHMARK_DEPRECATED DEPRECATE_ATTR\n#endif // BENCHMARK_DEPRECATED\n\n#ifndef BENCHMARK_DEPRECATED_EXPORT\n#define BENCHMARK_DEPRECATED_EXPORT BENCHMARK_EXPORT BENCHMARK_DEPRECATED\n#endif // BENCHMARK_DEPRECATED_EXPORT\n\n#ifndef BENCHMARK_DEPRECATED_NO_EXPORT\n#define BENCHMARK_DEPRECATED_NO_EXPORT BENCHMARK_NO_EXPORT BENCHMARK_DEPRECATED\n#endif // BENCHMARK_DEPRECATED_EXPORT\n\n#endif /* BENCHMARK_EXPORT_H */\n" }, { "path": "3rd/benchmark-1.8.2/setup.py", "content": "import contextlib\nimport os\nimport platform\nimport shutil\nimport sysconfig\nfrom pathlib import Path\nfrom typing import List\n\nimport setuptools\nfrom setuptools.command import build_ext\n\n\nPYTHON_INCLUDE_PATH_PLACEHOLDER = \"\"\n\nIS_WINDOWS = platform.system() == \"Windows\"\nIS_MAC = platform.system() == \"Darwin\"\n\n\ndef _get_long_description(fp: str) -> str:\n with open(fp, \"r\", encoding=\"utf-8\") as f:\n return f.read()\n\n\ndef _get_version(fp: str) -> str:\n \"\"\"Parse a version string from a file.\"\"\"\n with open(fp, \"r\") as f:\n for line in f:\n if \"__version__\" in line:\n delim = '\"'\n return line.split(delim)[1]\n raise RuntimeError(f\"could not find a version string in file {fp!r}.\")\n\n\ndef _parse_requirements(fp: str) -> List[str]:\n with open(fp) as requirements:\n return [\n line.rstrip()\n for line in requirements\n if not (line.isspace() or line.startswith(\"#\"))\n ]\n\n\n@contextlib.contextmanager\ndef temp_fill_include_path(fp: str):\n \"\"\"Temporarily set the Python include path in a file.\"\"\"\n with open(fp, \"r+\") as f:\n try:\n content = f.read()\n replaced = content.replace(\n PYTHON_INCLUDE_PATH_PLACEHOLDER,\n Path(sysconfig.get_paths()['include']).as_posix(),\n )\n f.seek(0)\n f.write(replaced)\n f.truncate()\n yield\n finally:\n # revert to the original content after exit\n f.seek(0)\n f.write(content)\n f.truncate()\n\n\nclass BazelExtension(setuptools.Extension):\n \"\"\"A C/C++ extension that is defined as a Bazel BUILD target.\"\"\"\n\n def __init__(self, name: str, bazel_target: str):\n super().__init__(name=name, sources=[])\n\n self.bazel_target = bazel_target\n stripped_target = bazel_target.split(\"//\")[-1]\n self.relpath, self.target_name = stripped_target.split(\":\")\n\n\nclass BuildBazelExtension(build_ext.build_ext):\n \"\"\"A command that runs Bazel to build a C/C++ extension.\"\"\"\n\n def run(self):\n for ext in self.extensions:\n self.bazel_build(ext)\n build_ext.build_ext.run(self)\n\n def bazel_build(self, ext: BazelExtension):\n \"\"\"Runs the bazel build to create the package.\"\"\"\n with temp_fill_include_path(\"WORKSPACE\"):\n temp_path = Path(self.build_temp)\n\n bazel_argv = [\n \"bazel\",\n \"build\",\n ext.bazel_target,\n f\"--symlink_prefix={temp_path / 'bazel-'}\",\n f\"--compilation_mode={'dbg' if self.debug else 'opt'}\",\n # C++17 is required by nanobind\n f\"--cxxopt={'/std:c++17' if IS_WINDOWS else '-std=c++17'}\",\n ]\n\n if IS_WINDOWS:\n # Link with python*.lib.\n for library_dir in self.library_dirs:\n bazel_argv.append(\"--linkopt=/LIBPATH:\" + library_dir)\n elif IS_MAC:\n if platform.machine() == \"x86_64\":\n # C++17 needs macOS 10.14 at minimum\n bazel_argv.append(\"--macos_minimum_os=10.14\")\n\n # cross-compilation for Mac ARM64 on GitHub Mac x86 runners.\n # ARCHFLAGS is set by cibuildwheel before macOS wheel builds.\n archflags = os.getenv(\"ARCHFLAGS\", \"\")\n if \"arm64\" in archflags:\n bazel_argv.append(\"--cpu=darwin_arm64\")\n bazel_argv.append(\"--macos_cpus=arm64\")\n\n elif platform.machine() == \"arm64\":\n bazel_argv.append(\"--macos_minimum_os=11.0\")\n\n self.spawn(bazel_argv)\n\n shared_lib_suffix = '.dll' if IS_WINDOWS else '.so'\n ext_name = ext.target_name + shared_lib_suffix\n ext_bazel_bin_path = temp_path / 'bazel-bin' / ext.relpath / ext_name\n\n ext_dest_path = Path(self.get_ext_fullpath(ext.name))\n shutil.copyfile(ext_bazel_bin_path, ext_dest_path)\n\n # explicitly call `bazel shutdown` for graceful exit\n self.spawn([\"bazel\", \"shutdown\"])\n\n\nsetuptools.setup(\n name=\"google_benchmark\",\n version=_get_version(\"bindings/python/google_benchmark/__init__.py\"),\n url=\"https://github.com/google/benchmark\",\n description=\"A library to benchmark code snippets.\",\n long_description=_get_long_description(\"README.md\"),\n long_description_content_type=\"text/markdown\",\n author=\"Google\",\n author_email=\"benchmark-py@google.com\",\n # Contained modules and scripts.\n package_dir={\"\": \"bindings/python\"},\n packages=setuptools.find_packages(\"bindings/python\"),\n install_requires=_parse_requirements(\"bindings/python/requirements.txt\"),\n cmdclass=dict(build_ext=BuildBazelExtension),\n ext_modules=[\n BazelExtension(\n \"google_benchmark._benchmark\",\n \"//bindings/python/google_benchmark:_benchmark\",\n )\n ],\n zip_safe=False,\n # PyPI package information.\n classifiers=[\n \"Development Status :: 4 - Beta\",\n \"Intended Audience :: Developers\",\n \"Intended Audience :: Science/Research\",\n \"License :: OSI Approved :: Apache Software License\",\n \"Programming Language :: Python :: 3.8\",\n \"Programming Language :: Python :: 3.9\",\n \"Programming Language :: Python :: 3.10\",\n \"Programming Language :: Python :: 3.11\",\n \"Topic :: Software Development :: Testing\",\n \"Topic :: System :: Benchmark\",\n ],\n license=\"Apache 2.0\",\n keywords=\"benchmark\",\n)\n" }, { "path": "3rd/benchmark-1.8.2/src/CMakeLists.txt", "content": "# Allow the source files to find headers in src/\ninclude(GNUInstallDirs)\ninclude_directories(${PROJECT_SOURCE_DIR}/src)\n\nif (DEFINED BENCHMARK_CXX_LINKER_FLAGS)\n list(APPEND CMAKE_SHARED_LINKER_FLAGS ${BENCHMARK_CXX_LINKER_FLAGS})\n list(APPEND CMAKE_MODULE_LINKER_FLAGS ${BENCHMARK_CXX_LINKER_FLAGS})\nendif()\n\nfile(GLOB\n SOURCE_FILES\n *.cc\n ${PROJECT_SOURCE_DIR}/include/benchmark/*.h\n ${CMAKE_CURRENT_SOURCE_DIR}/*.h)\nfile(GLOB BENCHMARK_MAIN \"benchmark_main.cc\")\nforeach(item ${BENCHMARK_MAIN})\n list(REMOVE_ITEM SOURCE_FILES \"${item}\")\nendforeach()\n\nadd_library(benchmark ${SOURCE_FILES})\nadd_library(benchmark::benchmark ALIAS benchmark)\nset_target_properties(benchmark PROPERTIES\n OUTPUT_NAME \"benchmark\"\n VERSION ${GENERIC_LIB_VERSION}\n SOVERSION ${GENERIC_LIB_SOVERSION}\n)\ntarget_include_directories(benchmark PUBLIC\n $\n)\n\n# libpfm, if available\nif (HAVE_LIBPFM)\n target_link_libraries(benchmark PRIVATE pfm)\n target_compile_definitions(benchmark PRIVATE -DHAVE_LIBPFM)\nendif()\n\n# pthread affinity, if available\nif(HAVE_PTHREAD_AFFINITY)\n target_compile_definitions(benchmark PRIVATE -DBENCHMARK_HAS_PTHREAD_AFFINITY)\nendif()\n\n# Link threads.\ntarget_link_libraries(benchmark PRIVATE Threads::Threads)\n\ntarget_link_libraries(benchmark PRIVATE ${BENCHMARK_CXX_LIBRARIES})\n\nif(HAVE_LIB_RT)\n target_link_libraries(benchmark PRIVATE rt)\nendif(HAVE_LIB_RT)\n\n\n# We need extra libraries on Windows\nif(${CMAKE_SYSTEM_NAME} MATCHES \"Windows\")\n target_link_libraries(benchmark PRIVATE shlwapi)\nendif()\n\n# We need extra libraries on Solaris\nif(${CMAKE_SYSTEM_NAME} MATCHES \"SunOS\")\n target_link_libraries(benchmark PRIVATE kstat)\nendif()\n\nif (NOT BUILD_SHARED_LIBS)\n target_compile_definitions(benchmark PUBLIC -DBENCHMARK_STATIC_DEFINE)\nendif()\n\n# Benchmark main library\nadd_library(benchmark_main \"benchmark_main.cc\")\nadd_library(benchmark::benchmark_main ALIAS benchmark_main)\nset_target_properties(benchmark_main PROPERTIES\n OUTPUT_NAME \"benchmark_main\"\n VERSION ${GENERIC_LIB_VERSION}\n SOVERSION ${GENERIC_LIB_SOVERSION}\n DEFINE_SYMBOL benchmark_EXPORTS\n)\ntarget_link_libraries(benchmark_main PUBLIC benchmark::benchmark)\n\nset(generated_dir \"${PROJECT_BINARY_DIR}\")\n\nset(version_config \"${generated_dir}/${PROJECT_NAME}ConfigVersion.cmake\")\nset(project_config \"${generated_dir}/${PROJECT_NAME}Config.cmake\")\nset(pkg_config \"${generated_dir}/${PROJECT_NAME}.pc\")\nset(targets_to_export benchmark benchmark_main)\nset(targets_export_name \"${PROJECT_NAME}Targets\")\n\nset(namespace \"${PROJECT_NAME}::\")\n\ninclude(CMakePackageConfigHelpers)\n\nconfigure_package_config_file (\n ${PROJECT_SOURCE_DIR}/cmake/Config.cmake.in\n ${project_config}\n INSTALL_DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/${PROJECT_NAME}\n NO_SET_AND_CHECK_MACRO\n NO_CHECK_REQUIRED_COMPONENTS_MACRO\n)\nwrite_basic_package_version_file(\n \"${version_config}\" VERSION ${GENERIC_LIB_VERSION} COMPATIBILITY SameMajorVersion\n)\n\nconfigure_file(\"${PROJECT_SOURCE_DIR}/cmake/benchmark.pc.in\" \"${pkg_config}\" @ONLY)\n\nexport (\n TARGETS ${targets_to_export}\n NAMESPACE \"${namespace}\"\n FILE ${generated_dir}/${targets_export_name}.cmake\n)\n\nif (BENCHMARK_ENABLE_INSTALL)\n # Install target (will install the library to specified CMAKE_INSTALL_PREFIX variable)\n install(\n TARGETS ${targets_to_export}\n EXPORT ${targets_export_name}\n ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}\n LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}\n RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}\n INCLUDES DESTINATION ${CMAKE_INSTALL_INCLUDEDIR})\n\n install(\n DIRECTORY \"${PROJECT_SOURCE_DIR}/include/benchmark\"\n \"${PROJECT_BINARY_DIR}/include/benchmark\"\n DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}\n FILES_MATCHING PATTERN \"*.*h\")\n\n install(\n FILES \"${project_config}\" \"${version_config}\"\n DESTINATION \"${CMAKE_INSTALL_LIBDIR}/cmake/${PROJECT_NAME}\")\n\n install(\n FILES \"${pkg_config}\"\n DESTINATION \"${CMAKE_INSTALL_LIBDIR}/pkgconfig\")\n\n install(\n EXPORT \"${targets_export_name}\"\n NAMESPACE \"${namespace}\"\n DESTINATION \"${CMAKE_INSTALL_LIBDIR}/cmake/${PROJECT_NAME}\")\nendif()\n\nif (BENCHMARK_ENABLE_DOXYGEN)\n find_package(Doxygen REQUIRED)\n set(DOXYGEN_QUIET YES)\n set(DOXYGEN_RECURSIVE YES)\n set(DOXYGEN_GENERATE_HTML YES)\n set(DOXYGEN_GENERATE_MAN NO)\n set(DOXYGEN_MARKDOWN_SUPPORT YES)\n set(DOXYGEN_BUILTIN_STL_SUPPORT YES)\n set(DOXYGEN_EXTRACT_PACKAGE YES)\n set(DOXYGEN_EXTRACT_STATIC YES)\n set(DOXYGEN_SHOW_INCLUDE_FILES YES)\n set(DOXYGEN_BINARY_TOC YES)\n set(DOXYGEN_TOC_EXPAND YES)\n set(DOXYGEN_USE_MDFILE_AS_MAINPAGE \"index.md\")\n doxygen_add_docs(benchmark_doxygen\n docs\n include\n src\n ALL\n WORKING_DIRECTORY ${PROJECT_SOURCE_DIR}\n COMMENT \"Building documentation with Doxygen.\")\n if (BENCHMARK_ENABLE_INSTALL AND BENCHMARK_INSTALL_DOCS)\n install(\n DIRECTORY \"${CMAKE_CURRENT_BINARY_DIR}/html/\"\n DESTINATION ${CMAKE_INSTALL_DOCDIR})\n endif()\nelse()\n if (BENCHMARK_ENABLE_INSTALL AND BENCHMARK_INSTALL_DOCS)\n install(\n DIRECTORY \"${PROJECT_SOURCE_DIR}/docs/\"\n DESTINATION ${CMAKE_INSTALL_DOCDIR})\n endif()\nendif()\n" }, { "path": "3rd/benchmark-1.8.2/src/arraysize.h", "content": "#ifndef BENCHMARK_ARRAYSIZE_H_\n#define BENCHMARK_ARRAYSIZE_H_\n\n#include \"internal_macros.h\"\n\nnamespace benchmark {\nnamespace internal {\n// The arraysize(arr) macro returns the # of elements in an array arr.\n// The expression is a compile-time constant, and therefore can be\n// used in defining new arrays, for example. If you use arraysize on\n// a pointer by mistake, you will get a compile-time error.\n//\n\n// This template function declaration is used in defining arraysize.\n// Note that the function doesn't need an implementation, as we only\n// use its type.\ntemplate \nchar (&ArraySizeHelper(T (&array)[N]))[N];\n\n// That gcc wants both of these prototypes seems mysterious. VC, for\n// its part, can't decide which to use (another mystery). Matching of\n// template overloads: the final frontier.\n#ifndef COMPILER_MSVC\ntemplate \nchar (&ArraySizeHelper(const T (&array)[N]))[N];\n#endif\n\n#define arraysize(array) (sizeof(::benchmark::internal::ArraySizeHelper(array)))\n\n} // end namespace internal\n} // end namespace benchmark\n\n#endif // BENCHMARK_ARRAYSIZE_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \"benchmark/benchmark.h\"\n\n#include \"benchmark_api_internal.h\"\n#include \"benchmark_runner.h\"\n#include \"internal_macros.h\"\n\n#ifndef BENCHMARK_OS_WINDOWS\n#if !defined(BENCHMARK_OS_FUCHSIA) && !defined(BENCHMARK_OS_QURT)\n#include \n#endif\n#include \n#include \n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"check.h\"\n#include \"colorprint.h\"\n#include \"commandlineflags.h\"\n#include \"complexity.h\"\n#include \"counter.h\"\n#include \"internal_macros.h\"\n#include \"log.h\"\n#include \"mutex.h\"\n#include \"perf_counters.h\"\n#include \"re.h\"\n#include \"statistics.h\"\n#include \"string_util.h\"\n#include \"thread_manager.h\"\n#include \"thread_timer.h\"\n\nnamespace benchmark {\n// Print a list of benchmarks. This option overrides all other options.\nBM_DEFINE_bool(benchmark_list_tests, false);\n\n// A regular expression that specifies the set of benchmarks to execute. If\n// this flag is empty, or if this flag is the string \\\"all\\\", all benchmarks\n// linked into the binary are run.\nBM_DEFINE_string(benchmark_filter, \"\");\n\n// Specification of how long to run the benchmark.\n//\n// It can be either an exact number of iterations (specified as `x`),\n// or a minimum number of seconds (specified as `s`). If the latter\n// format (ie., min seconds) is used, the system may run the benchmark longer\n// until the results are considered significant.\n//\n// For backward compatibility, the `s` suffix may be omitted, in which case,\n// the specified number is interpreted as the number of seconds.\n//\n// For cpu-time based tests, this is the lower bound\n// on the total cpu time used by all threads that make up the test. For\n// real-time based tests, this is the lower bound on the elapsed time of the\n// benchmark execution, regardless of number of threads.\nBM_DEFINE_string(benchmark_min_time, kDefaultMinTimeStr);\n\n// Minimum number of seconds a benchmark should be run before results should be\n// taken into account. This e.g can be necessary for benchmarks of code which\n// needs to fill some form of cache before performance is of interest.\n// Note: results gathered within this period are discarded and not used for\n// reported result.\nBM_DEFINE_double(benchmark_min_warmup_time, 0.0);\n\n// The number of runs of each benchmark. If greater than 1, the mean and\n// standard deviation of the runs will be reported.\nBM_DEFINE_int32(benchmark_repetitions, 1);\n\n// If set, enable random interleaving of repetitions of all benchmarks.\n// See http://github.com/google/benchmark/issues/1051 for details.\nBM_DEFINE_bool(benchmark_enable_random_interleaving, false);\n\n// Report the result of each benchmark repetitions. When 'true' is specified\n// only the mean, standard deviation, and other statistics are reported for\n// repeated benchmarks. Affects all reporters.\nBM_DEFINE_bool(benchmark_report_aggregates_only, false);\n\n// Display the result of each benchmark repetitions. When 'true' is specified\n// only the mean, standard deviation, and other statistics are displayed for\n// repeated benchmarks. Unlike benchmark_report_aggregates_only, only affects\n// the display reporter, but *NOT* file reporter, which will still contain\n// all the output.\nBM_DEFINE_bool(benchmark_display_aggregates_only, false);\n\n// The format to use for console output.\n// Valid values are 'console', 'json', or 'csv'.\nBM_DEFINE_string(benchmark_format, \"console\");\n\n// The format to use for file output.\n// Valid values are 'console', 'json', or 'csv'.\nBM_DEFINE_string(benchmark_out_format, \"json\");\n\n// The file to write additional output to.\nBM_DEFINE_string(benchmark_out, \"\");\n\n// Whether to use colors in the output. Valid values:\n// 'true'/'yes'/1, 'false'/'no'/0, and 'auto'. 'auto' means to use colors if\n// the output is being sent to a terminal and the TERM environment variable is\n// set to a terminal type that supports colors.\nBM_DEFINE_string(benchmark_color, \"auto\");\n\n// Whether to use tabular format when printing user counters to the console.\n// Valid values: 'true'/'yes'/1, 'false'/'no'/0. Defaults to false.\nBM_DEFINE_bool(benchmark_counters_tabular, false);\n\n// List of additional perf counters to collect, in libpfm format. For more\n// information about libpfm: https://man7.org/linux/man-pages/man3/libpfm.3.html\nBM_DEFINE_string(benchmark_perf_counters, \"\");\n\n// Extra context to include in the output formatted as comma-separated key-value\n// pairs. Kept internal as it's only used for parsing from env/command line.\nBM_DEFINE_kvpairs(benchmark_context, {});\n\n// Set the default time unit to use for reports\n// Valid values are 'ns', 'us', 'ms' or 's'\nBM_DEFINE_string(benchmark_time_unit, \"\");\n\n// The level of verbose logging to output\nBM_DEFINE_int32(v, 0);\n\nnamespace internal {\n\nstd::map* global_context = nullptr;\n\nBENCHMARK_EXPORT std::map*& GetGlobalContext() {\n return global_context;\n}\n\n// FIXME: wouldn't LTO mess this up?\nvoid UseCharPointer(char const volatile*) {}\n\n} // namespace internal\n\nState::State(std::string name, IterationCount max_iters,\n const std::vector& ranges, int thread_i, int n_threads,\n internal::ThreadTimer* timer, internal::ThreadManager* manager,\n internal::PerfCountersMeasurement* perf_counters_measurement)\n : total_iterations_(0),\n batch_leftover_(0),\n max_iterations(max_iters),\n started_(false),\n finished_(false),\n skipped_(internal::NotSkipped),\n range_(ranges),\n complexity_n_(0),\n name_(std::move(name)),\n thread_index_(thread_i),\n threads_(n_threads),\n timer_(timer),\n manager_(manager),\n perf_counters_measurement_(perf_counters_measurement) {\n BM_CHECK(max_iterations != 0) << \"At least one iteration must be run\";\n BM_CHECK_LT(thread_index_, threads_)\n << \"thread_index must be less than threads\";\n\n // Note: The use of offsetof below is technically undefined until C++17\n // because State is not a standard layout type. However, all compilers\n // currently provide well-defined behavior as an extension (which is\n // demonstrated since constexpr evaluation must diagnose all undefined\n // behavior). However, GCC and Clang also warn about this use of offsetof,\n // which must be suppressed.\n#if defined(__INTEL_COMPILER)\n#pragma warning push\n#pragma warning(disable : 1875)\n#elif defined(__GNUC__)\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Winvalid-offsetof\"\n#endif\n#if defined(__NVCC__)\n#pragma nv_diagnostic push\n#pragma nv_diag_suppress 1427\n#endif\n#if defined(__NVCOMPILER)\n#pragma diagnostic push\n#pragma diag_suppress offset_in_non_POD_nonstandard\n#endif\n // Offset tests to ensure commonly accessed data is on the first cache line.\n const int cache_line_size = 64;\n static_assert(\n offsetof(State, skipped_) <= (cache_line_size - sizeof(skipped_)), \"\");\n#if defined(__INTEL_COMPILER)\n#pragma warning pop\n#elif defined(__GNUC__)\n#pragma GCC diagnostic pop\n#endif\n#if defined(__NVCC__)\n#pragma nv_diagnostic pop\n#endif\n#if defined(__NVCOMPILER)\n#pragma diagnostic pop\n#endif\n}\n\nvoid State::PauseTiming() {\n // Add in time accumulated so far\n BM_CHECK(started_ && !finished_ && !skipped());\n timer_->StopTimer();\n if (perf_counters_measurement_) {\n std::vector> measurements;\n if (!perf_counters_measurement_->Stop(measurements)) {\n BM_CHECK(false) << \"Perf counters read the value failed.\";\n }\n for (const auto& name_and_measurement : measurements) {\n auto name = name_and_measurement.first;\n auto measurement = name_and_measurement.second;\n BM_CHECK_EQ(std::fpclassify(double{counters[name]}), FP_ZERO);\n counters[name] = Counter(measurement, Counter::kAvgIterations);\n }\n }\n}\n\nvoid State::ResumeTiming() {\n BM_CHECK(started_ && !finished_ && !skipped());\n timer_->StartTimer();\n if (perf_counters_measurement_) {\n perf_counters_measurement_->Start();\n }\n}\n\nvoid State::SkipWithMessage(const std::string& msg) {\n skipped_ = internal::SkippedWithMessage;\n {\n MutexLock l(manager_->GetBenchmarkMutex());\n if (internal::NotSkipped == manager_->results.skipped_) {\n manager_->results.skip_message_ = msg;\n manager_->results.skipped_ = skipped_;\n }\n }\n total_iterations_ = 0;\n if (timer_->running()) timer_->StopTimer();\n}\n\nvoid State::SkipWithError(const std::string& msg) {\n skipped_ = internal::SkippedWithError;\n {\n MutexLock l(manager_->GetBenchmarkMutex());\n if (internal::NotSkipped == manager_->results.skipped_) {\n manager_->results.skip_message_ = msg;\n manager_->results.skipped_ = skipped_;\n }\n }\n total_iterations_ = 0;\n if (timer_->running()) timer_->StopTimer();\n}\n\nvoid State::SetIterationTime(double seconds) {\n timer_->SetIterationTime(seconds);\n}\n\nvoid State::SetLabel(const std::string& label) {\n MutexLock l(manager_->GetBenchmarkMutex());\n manager_->results.report_label_ = label;\n}\n\nvoid State::StartKeepRunning() {\n BM_CHECK(!started_ && !finished_);\n started_ = true;\n total_iterations_ = skipped() ? 0 : max_iterations;\n manager_->StartStopBarrier();\n if (!skipped()) ResumeTiming();\n}\n\nvoid State::FinishKeepRunning() {\n BM_CHECK(started_ && (!finished_ || skipped()));\n if (!skipped()) {\n PauseTiming();\n }\n // Total iterations has now wrapped around past 0. Fix this.\n total_iterations_ = 0;\n finished_ = true;\n manager_->StartStopBarrier();\n}\n\nnamespace internal {\nnamespace {\n\n// Flushes streams after invoking reporter methods that write to them. This\n// ensures users get timely updates even when streams are not line-buffered.\nvoid FlushStreams(BenchmarkReporter* reporter) {\n if (!reporter) return;\n std::flush(reporter->GetOutputStream());\n std::flush(reporter->GetErrorStream());\n}\n\n// Reports in both display and file reporters.\nvoid Report(BenchmarkReporter* display_reporter,\n BenchmarkReporter* file_reporter, const RunResults& run_results) {\n auto report_one = [](BenchmarkReporter* reporter, bool aggregates_only,\n const RunResults& results) {\n assert(reporter);\n // If there are no aggregates, do output non-aggregates.\n aggregates_only &= !results.aggregates_only.empty();\n if (!aggregates_only) reporter->ReportRuns(results.non_aggregates);\n if (!results.aggregates_only.empty())\n reporter->ReportRuns(results.aggregates_only);\n };\n\n report_one(display_reporter, run_results.display_report_aggregates_only,\n run_results);\n if (file_reporter)\n report_one(file_reporter, run_results.file_report_aggregates_only,\n run_results);\n\n FlushStreams(display_reporter);\n FlushStreams(file_reporter);\n}\n\nvoid RunBenchmarks(const std::vector& benchmarks,\n BenchmarkReporter* display_reporter,\n BenchmarkReporter* file_reporter) {\n // Note the file_reporter can be null.\n BM_CHECK(display_reporter != nullptr);\n\n // Determine the width of the name field using a minimum width of 10.\n bool might_have_aggregates = FLAGS_benchmark_repetitions > 1;\n size_t name_field_width = 10;\n size_t stat_field_width = 0;\n for (const BenchmarkInstance& benchmark : benchmarks) {\n name_field_width =\n std::max(name_field_width, benchmark.name().str().size());\n might_have_aggregates |= benchmark.repetitions() > 1;\n\n for (const auto& Stat : benchmark.statistics())\n stat_field_width = std::max(stat_field_width, Stat.name_.size());\n }\n if (might_have_aggregates) name_field_width += 1 + stat_field_width;\n\n // Print header here\n BenchmarkReporter::Context context;\n context.name_field_width = name_field_width;\n\n // Keep track of running times of all instances of each benchmark family.\n std::map\n per_family_reports;\n\n if (display_reporter->ReportContext(context) &&\n (!file_reporter || file_reporter->ReportContext(context))) {\n FlushStreams(display_reporter);\n FlushStreams(file_reporter);\n\n size_t num_repetitions_total = 0;\n\n // This perfcounters object needs to be created before the runners vector\n // below so it outlasts their lifetime.\n PerfCountersMeasurement perfcounters(\n StrSplit(FLAGS_benchmark_perf_counters, ','));\n\n // Vector of benchmarks to run\n std::vector runners;\n runners.reserve(benchmarks.size());\n\n // Count the number of benchmarks with threads to warn the user in case\n // performance counters are used.\n int benchmarks_with_threads = 0;\n\n // Loop through all benchmarks\n for (const BenchmarkInstance& benchmark : benchmarks) {\n BenchmarkReporter::PerFamilyRunReports* reports_for_family = nullptr;\n if (benchmark.complexity() != oNone)\n reports_for_family = &per_family_reports[benchmark.family_index()];\n benchmarks_with_threads += (benchmark.threads() > 0);\n runners.emplace_back(benchmark, &perfcounters, reports_for_family);\n int num_repeats_of_this_instance = runners.back().GetNumRepeats();\n num_repetitions_total += num_repeats_of_this_instance;\n if (reports_for_family)\n reports_for_family->num_runs_total += num_repeats_of_this_instance;\n }\n assert(runners.size() == benchmarks.size() && \"Unexpected runner count.\");\n\n // The use of performance counters with threads would be unintuitive for\n // the average user so we need to warn them about this case\n if ((benchmarks_with_threads > 0) && (perfcounters.num_counters() > 0)) {\n GetErrorLogInstance()\n << \"***WARNING*** There are \" << benchmarks_with_threads\n << \" benchmarks with threads and \" << perfcounters.num_counters()\n << \" performance counters were requested. Beware counters will \"\n \"reflect the combined usage across all \"\n \"threads.\\n\";\n }\n\n std::vector repetition_indices;\n repetition_indices.reserve(num_repetitions_total);\n for (size_t runner_index = 0, num_runners = runners.size();\n runner_index != num_runners; ++runner_index) {\n const internal::BenchmarkRunner& runner = runners[runner_index];\n std::fill_n(std::back_inserter(repetition_indices),\n runner.GetNumRepeats(), runner_index);\n }\n assert(repetition_indices.size() == num_repetitions_total &&\n \"Unexpected number of repetition indexes.\");\n\n if (FLAGS_benchmark_enable_random_interleaving) {\n std::random_device rd;\n std::mt19937 g(rd());\n std::shuffle(repetition_indices.begin(), repetition_indices.end(), g);\n }\n\n for (size_t repetition_index : repetition_indices) {\n internal::BenchmarkRunner& runner = runners[repetition_index];\n runner.DoOneRepetition();\n if (runner.HasRepeatsRemaining()) continue;\n // FIXME: report each repetition separately, not all of them in bulk.\n\n display_reporter->ReportRunsConfig(\n runner.GetMinTime(), runner.HasExplicitIters(), runner.GetIters());\n if (file_reporter)\n file_reporter->ReportRunsConfig(\n runner.GetMinTime(), runner.HasExplicitIters(), runner.GetIters());\n\n RunResults run_results = runner.GetResults();\n\n // Maybe calculate complexity report\n if (const auto* reports_for_family = runner.GetReportsForFamily()) {\n if (reports_for_family->num_runs_done ==\n reports_for_family->num_runs_total) {\n auto additional_run_stats = ComputeBigO(reports_for_family->Runs);\n run_results.aggregates_only.insert(run_results.aggregates_only.end(),\n additional_run_stats.begin(),\n additional_run_stats.end());\n per_family_reports.erase(\n static_cast(reports_for_family->Runs.front().family_index));\n }\n }\n\n Report(display_reporter, file_reporter, run_results);\n }\n }\n display_reporter->Finalize();\n if (file_reporter) file_reporter->Finalize();\n FlushStreams(display_reporter);\n FlushStreams(file_reporter);\n}\n\n// Disable deprecated warnings temporarily because we need to reference\n// CSVReporter but don't want to trigger -Werror=-Wdeprecated-declarations\nBENCHMARK_DISABLE_DEPRECATED_WARNING\n\nstd::unique_ptr CreateReporter(\n std::string const& name, ConsoleReporter::OutputOptions output_opts) {\n typedef std::unique_ptr PtrType;\n if (name == \"console\") {\n return PtrType(new ConsoleReporter(output_opts));\n }\n if (name == \"json\") {\n return PtrType(new JSONReporter());\n }\n if (name == \"csv\") {\n return PtrType(new CSVReporter());\n }\n std::cerr << \"Unexpected format: '\" << name << \"'\\n\";\n std::exit(1);\n}\n\nBENCHMARK_RESTORE_DEPRECATED_WARNING\n\n} // end namespace\n\nbool IsZero(double n) {\n return std::abs(n) < std::numeric_limits::epsilon();\n}\n\nConsoleReporter::OutputOptions GetOutputOptions(bool force_no_color) {\n int output_opts = ConsoleReporter::OO_Defaults;\n auto is_benchmark_color = [force_no_color]() -> bool {\n if (force_no_color) {\n return false;\n }\n if (FLAGS_benchmark_color == \"auto\") {\n return IsColorTerminal();\n }\n return IsTruthyFlagValue(FLAGS_benchmark_color);\n };\n if (is_benchmark_color()) {\n output_opts |= ConsoleReporter::OO_Color;\n } else {\n output_opts &= ~ConsoleReporter::OO_Color;\n }\n if (FLAGS_benchmark_counters_tabular) {\n output_opts |= ConsoleReporter::OO_Tabular;\n } else {\n output_opts &= ~ConsoleReporter::OO_Tabular;\n }\n return static_cast(output_opts);\n}\n\n} // end namespace internal\n\nBenchmarkReporter* CreateDefaultDisplayReporter() {\n static auto default_display_reporter =\n internal::CreateReporter(FLAGS_benchmark_format,\n internal::GetOutputOptions())\n .release();\n return default_display_reporter;\n}\n\nsize_t RunSpecifiedBenchmarks() {\n return RunSpecifiedBenchmarks(nullptr, nullptr, FLAGS_benchmark_filter);\n}\n\nsize_t RunSpecifiedBenchmarks(std::string spec) {\n return RunSpecifiedBenchmarks(nullptr, nullptr, std::move(spec));\n}\n\nsize_t RunSpecifiedBenchmarks(BenchmarkReporter* display_reporter) {\n return RunSpecifiedBenchmarks(display_reporter, nullptr,\n FLAGS_benchmark_filter);\n}\n\nsize_t RunSpecifiedBenchmarks(BenchmarkReporter* display_reporter,\n std::string spec) {\n return RunSpecifiedBenchmarks(display_reporter, nullptr, std::move(spec));\n}\n\nsize_t RunSpecifiedBenchmarks(BenchmarkReporter* display_reporter,\n BenchmarkReporter* file_reporter) {\n return RunSpecifiedBenchmarks(display_reporter, file_reporter,\n FLAGS_benchmark_filter);\n}\n\nsize_t RunSpecifiedBenchmarks(BenchmarkReporter* display_reporter,\n BenchmarkReporter* file_reporter,\n std::string spec) {\n if (spec.empty() || spec == \"all\")\n spec = \".\"; // Regexp that matches all benchmarks\n\n // Setup the reporters\n std::ofstream output_file;\n std::unique_ptr default_display_reporter;\n std::unique_ptr default_file_reporter;\n if (!display_reporter) {\n default_display_reporter.reset(CreateDefaultDisplayReporter());\n display_reporter = default_display_reporter.get();\n }\n auto& Out = display_reporter->GetOutputStream();\n auto& Err = display_reporter->GetErrorStream();\n\n std::string const& fname = FLAGS_benchmark_out;\n if (fname.empty() && file_reporter) {\n Err << \"A custom file reporter was provided but \"\n \"--benchmark_out= was not specified.\"\n << std::endl;\n std::exit(1);\n }\n if (!fname.empty()) {\n output_file.open(fname);\n if (!output_file.is_open()) {\n Err << \"invalid file name: '\" << fname << \"'\" << std::endl;\n std::exit(1);\n }\n if (!file_reporter) {\n default_file_reporter = internal::CreateReporter(\n FLAGS_benchmark_out_format, ConsoleReporter::OO_None);\n file_reporter = default_file_reporter.get();\n }\n file_reporter->SetOutputStream(&output_file);\n file_reporter->SetErrorStream(&output_file);\n }\n\n std::vector benchmarks;\n if (!FindBenchmarksInternal(spec, &benchmarks, &Err)) return 0;\n\n if (benchmarks.empty()) {\n Err << \"Failed to match any benchmarks against regex: \" << spec << \"\\n\";\n return 0;\n }\n\n if (FLAGS_benchmark_list_tests) {\n for (auto const& benchmark : benchmarks)\n Out << benchmark.name().str() << \"\\n\";\n } else {\n internal::RunBenchmarks(benchmarks, display_reporter, file_reporter);\n }\n\n return benchmarks.size();\n}\n\nnamespace {\n// stores the time unit benchmarks use by default\nTimeUnit default_time_unit = kNanosecond;\n} // namespace\n\nTimeUnit GetDefaultTimeUnit() { return default_time_unit; }\n\nvoid SetDefaultTimeUnit(TimeUnit unit) { default_time_unit = unit; }\n\nstd::string GetBenchmarkFilter() { return FLAGS_benchmark_filter; }\n\nvoid SetBenchmarkFilter(std::string value) {\n FLAGS_benchmark_filter = std::move(value);\n}\n\nint32_t GetBenchmarkVerbosity() { return FLAGS_v; }\n\nvoid RegisterMemoryManager(MemoryManager* manager) {\n internal::memory_manager = manager;\n}\n\nvoid AddCustomContext(const std::string& key, const std::string& value) {\n if (internal::global_context == nullptr) {\n internal::global_context = new std::map();\n }\n if (!internal::global_context->emplace(key, value).second) {\n std::cerr << \"Failed to add custom context \\\"\" << key << \"\\\" as it already \"\n << \"exists with value \\\"\" << value << \"\\\"\\n\";\n }\n}\n\nnamespace internal {\n\nvoid (*HelperPrintf)();\n\nvoid PrintUsageAndExit() {\n HelperPrintf();\n exit(0);\n}\n\nvoid SetDefaultTimeUnitFromFlag(const std::string& time_unit_flag) {\n if (time_unit_flag == \"s\") {\n return SetDefaultTimeUnit(kSecond);\n }\n if (time_unit_flag == \"ms\") {\n return SetDefaultTimeUnit(kMillisecond);\n }\n if (time_unit_flag == \"us\") {\n return SetDefaultTimeUnit(kMicrosecond);\n }\n if (time_unit_flag == \"ns\") {\n return SetDefaultTimeUnit(kNanosecond);\n }\n if (!time_unit_flag.empty()) {\n PrintUsageAndExit();\n }\n}\n\nvoid ParseCommandLineFlags(int* argc, char** argv) {\n using namespace benchmark;\n BenchmarkReporter::Context::executable_name =\n (argc && *argc > 0) ? argv[0] : \"unknown\";\n for (int i = 1; argc && i < *argc; ++i) {\n if (ParseBoolFlag(argv[i], \"benchmark_list_tests\",\n &FLAGS_benchmark_list_tests) ||\n ParseStringFlag(argv[i], \"benchmark_filter\", &FLAGS_benchmark_filter) ||\n ParseStringFlag(argv[i], \"benchmark_min_time\",\n &FLAGS_benchmark_min_time) ||\n ParseDoubleFlag(argv[i], \"benchmark_min_warmup_time\",\n &FLAGS_benchmark_min_warmup_time) ||\n ParseInt32Flag(argv[i], \"benchmark_repetitions\",\n &FLAGS_benchmark_repetitions) ||\n ParseBoolFlag(argv[i], \"benchmark_enable_random_interleaving\",\n &FLAGS_benchmark_enable_random_interleaving) ||\n ParseBoolFlag(argv[i], \"benchmark_report_aggregates_only\",\n &FLAGS_benchmark_report_aggregates_only) ||\n ParseBoolFlag(argv[i], \"benchmark_display_aggregates_only\",\n &FLAGS_benchmark_display_aggregates_only) ||\n ParseStringFlag(argv[i], \"benchmark_format\", &FLAGS_benchmark_format) ||\n ParseStringFlag(argv[i], \"benchmark_out\", &FLAGS_benchmark_out) ||\n ParseStringFlag(argv[i], \"benchmark_out_format\",\n &FLAGS_benchmark_out_format) ||\n ParseStringFlag(argv[i], \"benchmark_color\", &FLAGS_benchmark_color) ||\n ParseBoolFlag(argv[i], \"benchmark_counters_tabular\",\n &FLAGS_benchmark_counters_tabular) ||\n ParseStringFlag(argv[i], \"benchmark_perf_counters\",\n &FLAGS_benchmark_perf_counters) ||\n ParseKeyValueFlag(argv[i], \"benchmark_context\",\n &FLAGS_benchmark_context) ||\n ParseStringFlag(argv[i], \"benchmark_time_unit\",\n &FLAGS_benchmark_time_unit) ||\n ParseInt32Flag(argv[i], \"v\", &FLAGS_v)) {\n for (int j = i; j != *argc - 1; ++j) argv[j] = argv[j + 1];\n\n --(*argc);\n --i;\n } else if (IsFlag(argv[i], \"help\")) {\n PrintUsageAndExit();\n }\n }\n for (auto const* flag :\n {&FLAGS_benchmark_format, &FLAGS_benchmark_out_format}) {\n if (*flag != \"console\" && *flag != \"json\" && *flag != \"csv\") {\n PrintUsageAndExit();\n }\n }\n SetDefaultTimeUnitFromFlag(FLAGS_benchmark_time_unit);\n if (FLAGS_benchmark_color.empty()) {\n PrintUsageAndExit();\n }\n for (const auto& kv : FLAGS_benchmark_context) {\n AddCustomContext(kv.first, kv.second);\n }\n}\n\nint InitializeStreams() {\n static std::ios_base::Init init;\n return 0;\n}\n\n} // end namespace internal\n\nvoid PrintDefaultHelp() {\n fprintf(stdout,\n \"benchmark\"\n \" [--benchmark_list_tests={true|false}]\\n\"\n \" [--benchmark_filter=]\\n\"\n \" [--benchmark_min_time=`x` OR `s` ]\\n\"\n \" [--benchmark_min_warmup_time=]\\n\"\n \" [--benchmark_repetitions=]\\n\"\n \" [--benchmark_enable_random_interleaving={true|false}]\\n\"\n \" [--benchmark_report_aggregates_only={true|false}]\\n\"\n \" [--benchmark_display_aggregates_only={true|false}]\\n\"\n \" [--benchmark_format=]\\n\"\n \" [--benchmark_out=]\\n\"\n \" [--benchmark_out_format=]\\n\"\n \" [--benchmark_color={auto|true|false}]\\n\"\n \" [--benchmark_counters_tabular={true|false}]\\n\"\n#if defined HAVE_LIBPFM\n \" [--benchmark_perf_counters=,...]\\n\"\n#endif\n \" [--benchmark_context==,...]\\n\"\n \" [--benchmark_time_unit={ns|us|ms|s}]\\n\"\n \" [--v=]\\n\");\n}\n\nvoid Initialize(int* argc, char** argv, void (*HelperPrintf)()) {\n internal::HelperPrintf = HelperPrintf;\n internal::ParseCommandLineFlags(argc, argv);\n internal::LogLevel() = FLAGS_v;\n}\n\nvoid Shutdown() { delete internal::global_context; }\n\nbool ReportUnrecognizedArguments(int argc, char** argv) {\n for (int i = 1; i < argc; ++i) {\n fprintf(stderr, \"%s: error: unrecognized command-line flag: %s\\n\", argv[0],\n argv[i]);\n }\n return argc > 1;\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark_api_internal.cc", "content": "#include \"benchmark_api_internal.h\"\n\n#include \n\n#include \"string_util.h\"\n\nnamespace benchmark {\nnamespace internal {\n\nBenchmarkInstance::BenchmarkInstance(Benchmark* benchmark, int family_idx,\n int per_family_instance_idx,\n const std::vector& args,\n int thread_count)\n : benchmark_(*benchmark),\n family_index_(family_idx),\n per_family_instance_index_(per_family_instance_idx),\n aggregation_report_mode_(benchmark_.aggregation_report_mode_),\n args_(args),\n time_unit_(benchmark_.GetTimeUnit()),\n measure_process_cpu_time_(benchmark_.measure_process_cpu_time_),\n use_real_time_(benchmark_.use_real_time_),\n use_manual_time_(benchmark_.use_manual_time_),\n complexity_(benchmark_.complexity_),\n complexity_lambda_(benchmark_.complexity_lambda_),\n statistics_(benchmark_.statistics_),\n repetitions_(benchmark_.repetitions_),\n min_time_(benchmark_.min_time_),\n min_warmup_time_(benchmark_.min_warmup_time_),\n iterations_(benchmark_.iterations_),\n threads_(thread_count) {\n name_.function_name = benchmark_.name_;\n\n size_t arg_i = 0;\n for (const auto& arg : args) {\n if (!name_.args.empty()) {\n name_.args += '/';\n }\n\n if (arg_i < benchmark->arg_names_.size()) {\n const auto& arg_name = benchmark_.arg_names_[arg_i];\n if (!arg_name.empty()) {\n name_.args += StrFormat(\"%s:\", arg_name.c_str());\n }\n }\n\n name_.args += StrFormat(\"%\" PRId64, arg);\n ++arg_i;\n }\n\n if (!IsZero(benchmark->min_time_)) {\n name_.min_time = StrFormat(\"min_time:%0.3f\", benchmark_.min_time_);\n }\n\n if (!IsZero(benchmark->min_warmup_time_)) {\n name_.min_warmup_time =\n StrFormat(\"min_warmup_time:%0.3f\", benchmark_.min_warmup_time_);\n }\n\n if (benchmark_.iterations_ != 0) {\n name_.iterations = StrFormat(\n \"iterations:%lu\", static_cast(benchmark_.iterations_));\n }\n\n if (benchmark_.repetitions_ != 0) {\n name_.repetitions = StrFormat(\"repeats:%d\", benchmark_.repetitions_);\n }\n\n if (benchmark_.measure_process_cpu_time_) {\n name_.time_type = \"process_time\";\n }\n\n if (benchmark_.use_manual_time_) {\n if (!name_.time_type.empty()) {\n name_.time_type += '/';\n }\n name_.time_type += \"manual_time\";\n } else if (benchmark_.use_real_time_) {\n if (!name_.time_type.empty()) {\n name_.time_type += '/';\n }\n name_.time_type += \"real_time\";\n }\n\n if (!benchmark_.thread_counts_.empty()) {\n name_.threads = StrFormat(\"threads:%d\", threads_);\n }\n\n setup_ = benchmark_.setup_;\n teardown_ = benchmark_.teardown_;\n}\n\nState BenchmarkInstance::Run(\n IterationCount iters, int thread_id, internal::ThreadTimer* timer,\n internal::ThreadManager* manager,\n internal::PerfCountersMeasurement* perf_counters_measurement) const {\n State st(name_.function_name, iters, args_, thread_id, threads_, timer,\n manager, perf_counters_measurement);\n benchmark_.Run(st);\n return st;\n}\n\nvoid BenchmarkInstance::Setup() const {\n if (setup_) {\n State st(name_.function_name, /*iters*/ 1, args_, /*thread_id*/ 0, threads_,\n nullptr, nullptr, nullptr);\n setup_(st);\n }\n}\n\nvoid BenchmarkInstance::Teardown() const {\n if (teardown_) {\n State st(name_.function_name, /*iters*/ 1, args_, /*thread_id*/ 0, threads_,\n nullptr, nullptr, nullptr);\n teardown_(st);\n }\n}\n} // namespace internal\n} // namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark_api_internal.h", "content": "#ifndef BENCHMARK_API_INTERNAL_H\n#define BENCHMARK_API_INTERNAL_H\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"commandlineflags.h\"\n\nnamespace benchmark {\nnamespace internal {\n\n// Information kept per benchmark we may want to run\nclass BenchmarkInstance {\n public:\n BenchmarkInstance(Benchmark* benchmark, int family_index,\n int per_family_instance_index,\n const std::vector& args, int threads);\n\n const BenchmarkName& name() const { return name_; }\n int family_index() const { return family_index_; }\n int per_family_instance_index() const { return per_family_instance_index_; }\n AggregationReportMode aggregation_report_mode() const {\n return aggregation_report_mode_;\n }\n TimeUnit time_unit() const { return time_unit_; }\n bool measure_process_cpu_time() const { return measure_process_cpu_time_; }\n bool use_real_time() const { return use_real_time_; }\n bool use_manual_time() const { return use_manual_time_; }\n BigO complexity() const { return complexity_; }\n BigOFunc* complexity_lambda() const { return complexity_lambda_; }\n const std::vector& statistics() const { return statistics_; }\n int repetitions() const { return repetitions_; }\n double min_time() const { return min_time_; }\n double min_warmup_time() const { return min_warmup_time_; }\n IterationCount iterations() const { return iterations_; }\n int threads() const { return threads_; }\n void Setup() const;\n void Teardown() const;\n\n State Run(IterationCount iters, int thread_id, internal::ThreadTimer* timer,\n internal::ThreadManager* manager,\n internal::PerfCountersMeasurement* perf_counters_measurement) const;\n\n private:\n BenchmarkName name_;\n Benchmark& benchmark_;\n const int family_index_;\n const int per_family_instance_index_;\n AggregationReportMode aggregation_report_mode_;\n const std::vector& args_;\n TimeUnit time_unit_;\n bool measure_process_cpu_time_;\n bool use_real_time_;\n bool use_manual_time_;\n BigO complexity_;\n BigOFunc* complexity_lambda_;\n UserCounters counters_;\n const std::vector& statistics_;\n int repetitions_;\n double min_time_;\n double min_warmup_time_;\n IterationCount iterations_;\n int threads_; // Number of concurrent threads to us\n\n typedef void (*callback_function)(const benchmark::State&);\n callback_function setup_ = nullptr;\n callback_function teardown_ = nullptr;\n};\n\nbool FindBenchmarksInternal(const std::string& re,\n std::vector* benchmarks,\n std::ostream* Err);\n\nbool IsZero(double n);\n\nBENCHMARK_EXPORT\nConsoleReporter::OutputOptions GetOutputOptions(bool force_no_color = false);\n\n} // end namespace internal\n} // end namespace benchmark\n\n#endif // BENCHMARK_API_INTERNAL_H\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark_main.cc", "content": "// Copyright 2018 Google Inc. 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// 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#include \"benchmark/benchmark.h\"\n\nBENCHMARK_EXPORT int main(int, char**);\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark_name.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \n\nnamespace benchmark {\n\nnamespace {\n\n// Compute the total size of a pack of std::strings\nsize_t size_impl() { return 0; }\n\ntemplate \nsize_t size_impl(const Head& head, const Tail&... tail) {\n return head.size() + size_impl(tail...);\n}\n\n// Join a pack of std::strings using a delimiter\n// TODO: use absl::StrJoin\nvoid join_impl(std::string&, char) {}\n\ntemplate \nvoid join_impl(std::string& s, const char delimiter, const Head& head,\n const Tail&... tail) {\n if (!s.empty() && !head.empty()) {\n s += delimiter;\n }\n\n s += head;\n\n join_impl(s, delimiter, tail...);\n}\n\ntemplate \nstd::string join(char delimiter, const Ts&... ts) {\n std::string s;\n s.reserve(sizeof...(Ts) + size_impl(ts...));\n join_impl(s, delimiter, ts...);\n return s;\n}\n} // namespace\n\nBENCHMARK_EXPORT\nstd::string BenchmarkName::str() const {\n return join('/', function_name, args, min_time, min_warmup_time, iterations,\n repetitions, time_type, threads);\n}\n} // namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark_register.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \"benchmark_register.h\"\n\n#ifndef BENCHMARK_OS_WINDOWS\n#if !defined(BENCHMARK_OS_FUCHSIA) && !defined(BENCHMARK_OS_QURT)\n#include \n#endif\n#include \n#include \n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"benchmark_api_internal.h\"\n#include \"check.h\"\n#include \"commandlineflags.h\"\n#include \"complexity.h\"\n#include \"internal_macros.h\"\n#include \"log.h\"\n#include \"mutex.h\"\n#include \"re.h\"\n#include \"statistics.h\"\n#include \"string_util.h\"\n#include \"timers.h\"\n\nnamespace benchmark {\n\nnamespace {\n// For non-dense Range, intermediate values are powers of kRangeMultiplier.\nstatic constexpr int kRangeMultiplier = 8;\n\n// The size of a benchmark family determines is the number of inputs to repeat\n// the benchmark on. If this is \"large\" then warn the user during configuration.\nstatic constexpr size_t kMaxFamilySize = 100;\n\nstatic constexpr char kDisabledPrefix[] = \"DISABLED_\";\n} // end namespace\n\nnamespace internal {\n\n//=============================================================================//\n// BenchmarkFamilies\n//=============================================================================//\n\n// Class for managing registered benchmarks. Note that each registered\n// benchmark identifies a family of related benchmarks to run.\nclass BenchmarkFamilies {\n public:\n static BenchmarkFamilies* GetInstance();\n\n // Registers a benchmark family and returns the index assigned to it.\n size_t AddBenchmark(std::unique_ptr family);\n\n // Clear all registered benchmark families.\n void ClearBenchmarks();\n\n // Extract the list of benchmark instances that match the specified\n // regular expression.\n bool FindBenchmarks(std::string re,\n std::vector* benchmarks,\n std::ostream* Err);\n\n private:\n BenchmarkFamilies() {}\n\n std::vector> families_;\n Mutex mutex_;\n};\n\nBenchmarkFamilies* BenchmarkFamilies::GetInstance() {\n static BenchmarkFamilies instance;\n return &instance;\n}\n\nsize_t BenchmarkFamilies::AddBenchmark(std::unique_ptr family) {\n MutexLock l(mutex_);\n size_t index = families_.size();\n families_.push_back(std::move(family));\n return index;\n}\n\nvoid BenchmarkFamilies::ClearBenchmarks() {\n MutexLock l(mutex_);\n families_.clear();\n families_.shrink_to_fit();\n}\n\nbool BenchmarkFamilies::FindBenchmarks(\n std::string spec, std::vector* benchmarks,\n std::ostream* ErrStream) {\n BM_CHECK(ErrStream);\n auto& Err = *ErrStream;\n // Make regular expression out of command-line flag\n std::string error_msg;\n Regex re;\n bool is_negative_filter = false;\n if (spec[0] == '-') {\n spec.replace(0, 1, \"\");\n is_negative_filter = true;\n }\n if (!re.Init(spec, &error_msg)) {\n Err << \"Could not compile benchmark re: \" << error_msg << std::endl;\n return false;\n }\n\n // Special list of thread counts to use when none are specified\n const std::vector one_thread = {1};\n\n int next_family_index = 0;\n\n MutexLock l(mutex_);\n for (std::unique_ptr& family : families_) {\n int family_index = next_family_index;\n int per_family_instance_index = 0;\n\n // Family was deleted or benchmark doesn't match\n if (!family) continue;\n\n if (family->ArgsCnt() == -1) {\n family->Args({});\n }\n const std::vector* thread_counts =\n (family->thread_counts_.empty()\n ? &one_thread\n : &static_cast&>(family->thread_counts_));\n const size_t family_size = family->args_.size() * thread_counts->size();\n // The benchmark will be run at least 'family_size' different inputs.\n // If 'family_size' is very large warn the user.\n if (family_size > kMaxFamilySize) {\n Err << \"The number of inputs is very large. \" << family->name_\n << \" will be repeated at least \" << family_size << \" times.\\n\";\n }\n // reserve in the special case the regex \".\", since we know the final\n // family size. this doesn't take into account any disabled benchmarks\n // so worst case we reserve more than we need.\n if (spec == \".\") benchmarks->reserve(benchmarks->size() + family_size);\n\n for (auto const& args : family->args_) {\n for (int num_threads : *thread_counts) {\n BenchmarkInstance instance(family.get(), family_index,\n per_family_instance_index, args,\n num_threads);\n\n const auto full_name = instance.name().str();\n if (full_name.rfind(kDisabledPrefix, 0) != 0 &&\n ((re.Match(full_name) && !is_negative_filter) ||\n (!re.Match(full_name) && is_negative_filter))) {\n benchmarks->push_back(std::move(instance));\n\n ++per_family_instance_index;\n\n // Only bump the next family index once we've estabilished that\n // at least one instance of this family will be run.\n if (next_family_index == family_index) ++next_family_index;\n }\n }\n }\n }\n return true;\n}\n\nBenchmark* RegisterBenchmarkInternal(Benchmark* bench) {\n std::unique_ptr bench_ptr(bench);\n BenchmarkFamilies* families = BenchmarkFamilies::GetInstance();\n families->AddBenchmark(std::move(bench_ptr));\n return bench;\n}\n\n// FIXME: This function is a hack so that benchmark.cc can access\n// `BenchmarkFamilies`\nbool FindBenchmarksInternal(const std::string& re,\n std::vector* benchmarks,\n std::ostream* Err) {\n return BenchmarkFamilies::GetInstance()->FindBenchmarks(re, benchmarks, Err);\n}\n\n//=============================================================================//\n// Benchmark\n//=============================================================================//\n\nBenchmark::Benchmark(const std::string& name)\n : name_(name),\n aggregation_report_mode_(ARM_Unspecified),\n time_unit_(GetDefaultTimeUnit()),\n use_default_time_unit_(true),\n range_multiplier_(kRangeMultiplier),\n min_time_(0),\n min_warmup_time_(0),\n iterations_(0),\n repetitions_(0),\n measure_process_cpu_time_(false),\n use_real_time_(false),\n use_manual_time_(false),\n complexity_(oNone),\n complexity_lambda_(nullptr),\n setup_(nullptr),\n teardown_(nullptr) {\n ComputeStatistics(\"mean\", StatisticsMean);\n ComputeStatistics(\"median\", StatisticsMedian);\n ComputeStatistics(\"stddev\", StatisticsStdDev);\n ComputeStatistics(\"cv\", StatisticsCV, kPercentage);\n}\n\nBenchmark::~Benchmark() {}\n\nBenchmark* Benchmark::Name(const std::string& name) {\n SetName(name);\n return this;\n}\n\nBenchmark* Benchmark::Arg(int64_t x) {\n BM_CHECK(ArgsCnt() == -1 || ArgsCnt() == 1);\n args_.push_back({x});\n return this;\n}\n\nBenchmark* Benchmark::Unit(TimeUnit unit) {\n time_unit_ = unit;\n use_default_time_unit_ = false;\n return this;\n}\n\nBenchmark* Benchmark::Range(int64_t start, int64_t limit) {\n BM_CHECK(ArgsCnt() == -1 || ArgsCnt() == 1);\n std::vector arglist;\n AddRange(&arglist, start, limit, range_multiplier_);\n\n for (int64_t i : arglist) {\n args_.push_back({i});\n }\n return this;\n}\n\nBenchmark* Benchmark::Ranges(\n const std::vector>& ranges) {\n BM_CHECK(ArgsCnt() == -1 || ArgsCnt() == static_cast(ranges.size()));\n std::vector> arglists(ranges.size());\n for (std::size_t i = 0; i < ranges.size(); i++) {\n AddRange(&arglists[i], ranges[i].first, ranges[i].second,\n range_multiplier_);\n }\n\n ArgsProduct(arglists);\n\n return this;\n}\n\nBenchmark* Benchmark::ArgsProduct(\n const std::vector>& arglists) {\n BM_CHECK(ArgsCnt() == -1 || ArgsCnt() == static_cast(arglists.size()));\n\n std::vector indices(arglists.size());\n const std::size_t total = std::accumulate(\n std::begin(arglists), std::end(arglists), std::size_t{1},\n [](const std::size_t res, const std::vector& arglist) {\n return res * arglist.size();\n });\n std::vector args;\n args.reserve(arglists.size());\n for (std::size_t i = 0; i < total; i++) {\n for (std::size_t arg = 0; arg < arglists.size(); arg++) {\n args.push_back(arglists[arg][indices[arg]]);\n }\n args_.push_back(args);\n args.clear();\n\n std::size_t arg = 0;\n do {\n indices[arg] = (indices[arg] + 1) % arglists[arg].size();\n } while (indices[arg++] == 0 && arg < arglists.size());\n }\n\n return this;\n}\n\nBenchmark* Benchmark::ArgName(const std::string& name) {\n BM_CHECK(ArgsCnt() == -1 || ArgsCnt() == 1);\n arg_names_ = {name};\n return this;\n}\n\nBenchmark* Benchmark::ArgNames(const std::vector& names) {\n BM_CHECK(ArgsCnt() == -1 || ArgsCnt() == static_cast(names.size()));\n arg_names_ = names;\n return this;\n}\n\nBenchmark* Benchmark::DenseRange(int64_t start, int64_t limit, int step) {\n BM_CHECK(ArgsCnt() == -1 || ArgsCnt() == 1);\n BM_CHECK_LE(start, limit);\n for (int64_t arg = start; arg <= limit; arg += step) {\n args_.push_back({arg});\n }\n return this;\n}\n\nBenchmark* Benchmark::Args(const std::vector& args) {\n BM_CHECK(ArgsCnt() == -1 || ArgsCnt() == static_cast(args.size()));\n args_.push_back(args);\n return this;\n}\n\nBenchmark* Benchmark::Apply(void (*custom_arguments)(Benchmark* benchmark)) {\n custom_arguments(this);\n return this;\n}\n\nBenchmark* Benchmark::Setup(void (*setup)(const benchmark::State&)) {\n BM_CHECK(setup != nullptr);\n setup_ = setup;\n return this;\n}\n\nBenchmark* Benchmark::Teardown(void (*teardown)(const benchmark::State&)) {\n BM_CHECK(teardown != nullptr);\n teardown_ = teardown;\n return this;\n}\n\nBenchmark* Benchmark::RangeMultiplier(int multiplier) {\n BM_CHECK(multiplier > 1);\n range_multiplier_ = multiplier;\n return this;\n}\n\nBenchmark* Benchmark::MinTime(double t) {\n BM_CHECK(t > 0.0);\n BM_CHECK(iterations_ == 0);\n min_time_ = t;\n return this;\n}\n\nBenchmark* Benchmark::MinWarmUpTime(double t) {\n BM_CHECK(t >= 0.0);\n BM_CHECK(iterations_ == 0);\n min_warmup_time_ = t;\n return this;\n}\n\nBenchmark* Benchmark::Iterations(IterationCount n) {\n BM_CHECK(n > 0);\n BM_CHECK(IsZero(min_time_));\n BM_CHECK(IsZero(min_warmup_time_));\n iterations_ = n;\n return this;\n}\n\nBenchmark* Benchmark::Repetitions(int n) {\n BM_CHECK(n > 0);\n repetitions_ = n;\n return this;\n}\n\nBenchmark* Benchmark::ReportAggregatesOnly(bool value) {\n aggregation_report_mode_ = value ? ARM_ReportAggregatesOnly : ARM_Default;\n return this;\n}\n\nBenchmark* Benchmark::DisplayAggregatesOnly(bool value) {\n // If we were called, the report mode is no longer 'unspecified', in any case.\n aggregation_report_mode_ = static_cast(\n aggregation_report_mode_ | ARM_Default);\n\n if (value) {\n aggregation_report_mode_ = static_cast(\n aggregation_report_mode_ | ARM_DisplayReportAggregatesOnly);\n } else {\n aggregation_report_mode_ = static_cast(\n aggregation_report_mode_ & ~ARM_DisplayReportAggregatesOnly);\n }\n\n return this;\n}\n\nBenchmark* Benchmark::MeasureProcessCPUTime() {\n // Can be used together with UseRealTime() / UseManualTime().\n measure_process_cpu_time_ = true;\n return this;\n}\n\nBenchmark* Benchmark::UseRealTime() {\n BM_CHECK(!use_manual_time_)\n << \"Cannot set UseRealTime and UseManualTime simultaneously.\";\n use_real_time_ = true;\n return this;\n}\n\nBenchmark* Benchmark::UseManualTime() {\n BM_CHECK(!use_real_time_)\n << \"Cannot set UseRealTime and UseManualTime simultaneously.\";\n use_manual_time_ = true;\n return this;\n}\n\nBenchmark* Benchmark::Complexity(BigO complexity) {\n complexity_ = complexity;\n return this;\n}\n\nBenchmark* Benchmark::Complexity(BigOFunc* complexity) {\n complexity_lambda_ = complexity;\n complexity_ = oLambda;\n return this;\n}\n\nBenchmark* Benchmark::ComputeStatistics(const std::string& name,\n StatisticsFunc* statistics,\n StatisticUnit unit) {\n statistics_.emplace_back(name, statistics, unit);\n return this;\n}\n\nBenchmark* Benchmark::Threads(int t) {\n BM_CHECK_GT(t, 0);\n thread_counts_.push_back(t);\n return this;\n}\n\nBenchmark* Benchmark::ThreadRange(int min_threads, int max_threads) {\n BM_CHECK_GT(min_threads, 0);\n BM_CHECK_GE(max_threads, min_threads);\n\n AddRange(&thread_counts_, min_threads, max_threads, 2);\n return this;\n}\n\nBenchmark* Benchmark::DenseThreadRange(int min_threads, int max_threads,\n int stride) {\n BM_CHECK_GT(min_threads, 0);\n BM_CHECK_GE(max_threads, min_threads);\n BM_CHECK_GE(stride, 1);\n\n for (auto i = min_threads; i < max_threads; i += stride) {\n thread_counts_.push_back(i);\n }\n thread_counts_.push_back(max_threads);\n return this;\n}\n\nBenchmark* Benchmark::ThreadPerCpu() {\n thread_counts_.push_back(CPUInfo::Get().num_cpus);\n return this;\n}\n\nvoid Benchmark::SetName(const std::string& name) { name_ = name; }\n\nconst char* Benchmark::GetName() const { return name_.c_str(); }\n\nint Benchmark::ArgsCnt() const {\n if (args_.empty()) {\n if (arg_names_.empty()) return -1;\n return static_cast(arg_names_.size());\n }\n return static_cast(args_.front().size());\n}\n\nconst char* Benchmark::GetArgName(int arg) const {\n BM_CHECK_GE(arg, 0);\n BM_CHECK_LT(arg, static_cast(arg_names_.size()));\n return arg_names_[arg].c_str();\n}\n\nTimeUnit Benchmark::GetTimeUnit() const {\n return use_default_time_unit_ ? GetDefaultTimeUnit() : time_unit_;\n}\n\n//=============================================================================//\n// FunctionBenchmark\n//=============================================================================//\n\nvoid FunctionBenchmark::Run(State& st) { func_(st); }\n\n} // end namespace internal\n\nvoid ClearRegisteredBenchmarks() {\n internal::BenchmarkFamilies::GetInstance()->ClearBenchmarks();\n}\n\nstd::vector CreateRange(int64_t lo, int64_t hi, int multi) {\n std::vector args;\n internal::AddRange(&args, lo, hi, multi);\n return args;\n}\n\nstd::vector CreateDenseRange(int64_t start, int64_t limit, int step) {\n BM_CHECK_LE(start, limit);\n std::vector args;\n for (int64_t arg = start; arg <= limit; arg += step) {\n args.push_back(arg);\n }\n return args;\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark_register.h", "content": "#ifndef BENCHMARK_REGISTER_H\n#define BENCHMARK_REGISTER_H\n\n#include \n#include \n#include \n\n#include \"check.h\"\n\nnamespace benchmark {\nnamespace internal {\n\n// Append the powers of 'mult' in the closed interval [lo, hi].\n// Returns iterator to the start of the inserted range.\ntemplate \ntypename std::vector::iterator AddPowers(std::vector* dst, T lo, T hi,\n int mult) {\n BM_CHECK_GE(lo, 0);\n BM_CHECK_GE(hi, lo);\n BM_CHECK_GE(mult, 2);\n\n const size_t start_offset = dst->size();\n\n static const T kmax = std::numeric_limits::max();\n\n // Space out the values in multiples of \"mult\"\n for (T i = static_cast(1); i <= hi; i *= static_cast(mult)) {\n if (i >= lo) {\n dst->push_back(i);\n }\n // Break the loop here since multiplying by\n // 'mult' would move outside of the range of T\n if (i > kmax / mult) break;\n }\n\n return dst->begin() + static_cast(start_offset);\n}\n\ntemplate \nvoid AddNegatedPowers(std::vector* dst, T lo, T hi, int mult) {\n // We negate lo and hi so we require that they cannot be equal to 'min'.\n BM_CHECK_GT(lo, std::numeric_limits::min());\n BM_CHECK_GT(hi, std::numeric_limits::min());\n BM_CHECK_GE(hi, lo);\n BM_CHECK_LE(hi, 0);\n\n // Add positive powers, then negate and reverse.\n // Casts necessary since small integers get promoted\n // to 'int' when negating.\n const auto lo_complement = static_cast(-lo);\n const auto hi_complement = static_cast(-hi);\n\n const auto it = AddPowers(dst, hi_complement, lo_complement, mult);\n\n std::for_each(it, dst->end(), [](T& t) { t *= -1; });\n std::reverse(it, dst->end());\n}\n\ntemplate \nvoid AddRange(std::vector* dst, T lo, T hi, int mult) {\n static_assert(std::is_integral::value && std::is_signed::value,\n \"Args type must be a signed integer\");\n\n BM_CHECK_GE(hi, lo);\n BM_CHECK_GE(mult, 2);\n\n // Add \"lo\"\n dst->push_back(lo);\n\n // Handle lo == hi as a special case, so we then know\n // lo < hi and so it is safe to add 1 to lo and subtract 1\n // from hi without falling outside of the range of T.\n if (lo == hi) return;\n\n // Ensure that lo_inner <= hi_inner below.\n if (lo + 1 == hi) {\n dst->push_back(hi);\n return;\n }\n\n // Add all powers of 'mult' in the range [lo+1, hi-1] (inclusive).\n const auto lo_inner = static_cast(lo + 1);\n const auto hi_inner = static_cast(hi - 1);\n\n // Insert negative values\n if (lo_inner < 0) {\n AddNegatedPowers(dst, lo_inner, std::min(hi_inner, T{-1}), mult);\n }\n\n // Treat 0 as a special case (see discussion on #762).\n if (lo < 0 && hi >= 0) {\n dst->push_back(0);\n }\n\n // Insert positive values\n if (hi_inner > 0) {\n AddPowers(dst, std::max(lo_inner, T{1}), hi_inner, mult);\n }\n\n // Add \"hi\" (if different from last value).\n if (hi != dst->back()) {\n dst->push_back(hi);\n }\n}\n\n} // namespace internal\n} // namespace benchmark\n\n#endif // BENCHMARK_REGISTER_H\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark_runner.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \"benchmark_runner.h\"\n\n#include \"benchmark/benchmark.h\"\n#include \"benchmark_api_internal.h\"\n#include \"internal_macros.h\"\n\n#ifndef BENCHMARK_OS_WINDOWS\n#if !defined(BENCHMARK_OS_FUCHSIA) && !defined(BENCHMARK_OS_QURT)\n#include \n#endif\n#include \n#include \n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"check.h\"\n#include \"colorprint.h\"\n#include \"commandlineflags.h\"\n#include \"complexity.h\"\n#include \"counter.h\"\n#include \"internal_macros.h\"\n#include \"log.h\"\n#include \"mutex.h\"\n#include \"perf_counters.h\"\n#include \"re.h\"\n#include \"statistics.h\"\n#include \"string_util.h\"\n#include \"thread_manager.h\"\n#include \"thread_timer.h\"\n\nnamespace benchmark {\n\nnamespace internal {\n\nMemoryManager* memory_manager = nullptr;\n\nnamespace {\n\nstatic constexpr IterationCount kMaxIterations = 1000000000;\nconst double kDefaultMinTime =\n std::strtod(::benchmark::kDefaultMinTimeStr, /*p_end*/ nullptr);\n\nBenchmarkReporter::Run CreateRunReport(\n const benchmark::internal::BenchmarkInstance& b,\n const internal::ThreadManager::Result& results,\n IterationCount memory_iterations,\n const MemoryManager::Result* memory_result, double seconds,\n int64_t repetition_index, int64_t repeats) {\n // Create report about this benchmark run.\n BenchmarkReporter::Run report;\n\n report.run_name = b.name();\n report.family_index = b.family_index();\n report.per_family_instance_index = b.per_family_instance_index();\n report.skipped = results.skipped_;\n report.skip_message = results.skip_message_;\n report.report_label = results.report_label_;\n // This is the total iterations across all threads.\n report.iterations = results.iterations;\n report.time_unit = b.time_unit();\n report.threads = b.threads();\n report.repetition_index = repetition_index;\n report.repetitions = repeats;\n\n if (!report.skipped) {\n if (b.use_manual_time()) {\n report.real_accumulated_time = results.manual_time_used;\n } else {\n report.real_accumulated_time = results.real_time_used;\n }\n report.cpu_accumulated_time = results.cpu_time_used;\n report.complexity_n = results.complexity_n;\n report.complexity = b.complexity();\n report.complexity_lambda = b.complexity_lambda();\n report.statistics = &b.statistics();\n report.counters = results.counters;\n\n if (memory_iterations > 0) {\n assert(memory_result != nullptr);\n report.memory_result = memory_result;\n report.allocs_per_iter =\n memory_iterations ? static_cast(memory_result->num_allocs) /\n memory_iterations\n : 0;\n }\n\n internal::Finish(&report.counters, results.iterations, seconds,\n b.threads());\n }\n return report;\n}\n\n// Execute one thread of benchmark b for the specified number of iterations.\n// Adds the stats collected for the thread into manager->results.\nvoid RunInThread(const BenchmarkInstance* b, IterationCount iters,\n int thread_id, ThreadManager* manager,\n PerfCountersMeasurement* perf_counters_measurement) {\n internal::ThreadTimer timer(\n b->measure_process_cpu_time()\n ? internal::ThreadTimer::CreateProcessCpuTime()\n : internal::ThreadTimer::Create());\n\n State st =\n b->Run(iters, thread_id, &timer, manager, perf_counters_measurement);\n BM_CHECK(st.skipped() || st.iterations() >= st.max_iterations)\n << \"Benchmark returned before State::KeepRunning() returned false!\";\n {\n MutexLock l(manager->GetBenchmarkMutex());\n internal::ThreadManager::Result& results = manager->results;\n results.iterations += st.iterations();\n results.cpu_time_used += timer.cpu_time_used();\n results.real_time_used += timer.real_time_used();\n results.manual_time_used += timer.manual_time_used();\n results.complexity_n += st.complexity_length_n();\n internal::Increment(&results.counters, st.counters);\n }\n manager->NotifyThreadComplete();\n}\n\ndouble ComputeMinTime(const benchmark::internal::BenchmarkInstance& b,\n const BenchTimeType& iters_or_time) {\n if (!IsZero(b.min_time())) return b.min_time();\n // If the flag was used to specify number of iters, then return the default\n // min_time.\n if (iters_or_time.tag == BenchTimeType::ITERS) return kDefaultMinTime;\n\n return iters_or_time.time;\n}\n\nIterationCount ComputeIters(const benchmark::internal::BenchmarkInstance& b,\n const BenchTimeType& iters_or_time) {\n if (b.iterations() != 0) return b.iterations();\n\n // We've already concluded that this flag is currently used to pass\n // iters but do a check here again anyway.\n BM_CHECK(iters_or_time.tag == BenchTimeType::ITERS);\n return iters_or_time.iters;\n}\n\n} // end namespace\n\nBenchTimeType ParseBenchMinTime(const std::string& value) {\n BenchTimeType ret;\n\n if (value.empty()) {\n ret.tag = BenchTimeType::TIME;\n ret.time = 0.0;\n return ret;\n }\n\n if (value.back() == 'x') {\n char* p_end;\n // Reset errno before it's changed by strtol.\n errno = 0;\n IterationCount num_iters = std::strtol(value.c_str(), &p_end, 10);\n\n // After a valid parse, p_end should have been set to\n // point to the 'x' suffix.\n BM_CHECK(errno == 0 && p_end != nullptr && *p_end == 'x')\n << \"Malformed iters value passed to --benchmark_min_time: `\" << value\n << \"`. Expected --benchmark_min_time=x.\";\n\n ret.tag = BenchTimeType::ITERS;\n ret.iters = num_iters;\n return ret;\n }\n\n bool has_suffix = value.back() == 's';\n if (!has_suffix) {\n BM_VLOG(0) << \"Value passed to --benchmark_min_time should have a suffix. \"\n \"Eg., `30s` for 30-seconds.\";\n }\n\n char* p_end;\n // Reset errno before it's changed by strtod.\n errno = 0;\n double min_time = std::strtod(value.c_str(), &p_end);\n\n // After a successful parse, p_end should point to the suffix 's',\n // or the end of the string if the suffix was omitted.\n BM_CHECK(errno == 0 && p_end != nullptr &&\n ((has_suffix && *p_end == 's') || *p_end == '\\0'))\n << \"Malformed seconds value passed to --benchmark_min_time: `\" << value\n << \"`. Expected --benchmark_min_time=x.\";\n\n ret.tag = BenchTimeType::TIME;\n ret.time = min_time;\n\n return ret;\n}\n\nBenchmarkRunner::BenchmarkRunner(\n const benchmark::internal::BenchmarkInstance& b_,\n PerfCountersMeasurement* pcm_,\n BenchmarkReporter::PerFamilyRunReports* reports_for_family_)\n : b(b_),\n reports_for_family(reports_for_family_),\n parsed_benchtime_flag(ParseBenchMinTime(FLAGS_benchmark_min_time)),\n min_time(ComputeMinTime(b_, parsed_benchtime_flag)),\n min_warmup_time((!IsZero(b.min_time()) && b.min_warmup_time() > 0.0)\n ? b.min_warmup_time()\n : FLAGS_benchmark_min_warmup_time),\n warmup_done(!(min_warmup_time > 0.0)),\n repeats(b.repetitions() != 0 ? b.repetitions()\n : FLAGS_benchmark_repetitions),\n has_explicit_iteration_count(b.iterations() != 0 ||\n parsed_benchtime_flag.tag ==\n BenchTimeType::ITERS),\n pool(b.threads() - 1),\n iters(has_explicit_iteration_count\n ? ComputeIters(b_, parsed_benchtime_flag)\n : 1),\n perf_counters_measurement_ptr(pcm_) {\n run_results.display_report_aggregates_only =\n (FLAGS_benchmark_report_aggregates_only ||\n FLAGS_benchmark_display_aggregates_only);\n run_results.file_report_aggregates_only =\n FLAGS_benchmark_report_aggregates_only;\n if (b.aggregation_report_mode() != internal::ARM_Unspecified) {\n run_results.display_report_aggregates_only =\n (b.aggregation_report_mode() &\n internal::ARM_DisplayReportAggregatesOnly);\n run_results.file_report_aggregates_only =\n (b.aggregation_report_mode() & internal::ARM_FileReportAggregatesOnly);\n BM_CHECK(FLAGS_benchmark_perf_counters.empty() ||\n (perf_counters_measurement_ptr->num_counters() == 0))\n << \"Perf counters were requested but could not be set up.\";\n }\n}\n\nBenchmarkRunner::IterationResults BenchmarkRunner::DoNIterations() {\n BM_VLOG(2) << \"Running \" << b.name().str() << \" for \" << iters << \"\\n\";\n\n std::unique_ptr manager;\n manager.reset(new internal::ThreadManager(b.threads()));\n\n // Run all but one thread in separate threads\n for (std::size_t ti = 0; ti < pool.size(); ++ti) {\n pool[ti] = std::thread(&RunInThread, &b, iters, static_cast(ti + 1),\n manager.get(), perf_counters_measurement_ptr);\n }\n // And run one thread here directly.\n // (If we were asked to run just one thread, we don't create new threads.)\n // Yes, we need to do this here *after* we start the separate threads.\n RunInThread(&b, iters, 0, manager.get(), perf_counters_measurement_ptr);\n\n // The main thread has finished. Now let's wait for the other threads.\n manager->WaitForAllThreads();\n for (std::thread& thread : pool) thread.join();\n\n IterationResults i;\n // Acquire the measurements/counters from the manager, UNDER THE LOCK!\n {\n MutexLock l(manager->GetBenchmarkMutex());\n i.results = manager->results;\n }\n\n // And get rid of the manager.\n manager.reset();\n\n // Adjust real/manual time stats since they were reported per thread.\n i.results.real_time_used /= b.threads();\n i.results.manual_time_used /= b.threads();\n // If we were measuring whole-process CPU usage, adjust the CPU time too.\n if (b.measure_process_cpu_time()) i.results.cpu_time_used /= b.threads();\n\n BM_VLOG(2) << \"Ran in \" << i.results.cpu_time_used << \"/\"\n << i.results.real_time_used << \"\\n\";\n\n // By using KeepRunningBatch a benchmark can iterate more times than\n // requested, so take the iteration count from i.results.\n i.iters = i.results.iterations / b.threads();\n\n // Base decisions off of real time if requested by this benchmark.\n i.seconds = i.results.cpu_time_used;\n if (b.use_manual_time()) {\n i.seconds = i.results.manual_time_used;\n } else if (b.use_real_time()) {\n i.seconds = i.results.real_time_used;\n }\n\n return i;\n}\n\nIterationCount BenchmarkRunner::PredictNumItersNeeded(\n const IterationResults& i) const {\n // See how much iterations should be increased by.\n // Note: Avoid division by zero with max(seconds, 1ns).\n double multiplier = GetMinTimeToApply() * 1.4 / std::max(i.seconds, 1e-9);\n // If our last run was at least 10% of FLAGS_benchmark_min_time then we\n // use the multiplier directly.\n // Otherwise we use at most 10 times expansion.\n // NOTE: When the last run was at least 10% of the min time the max\n // expansion should be 14x.\n const bool is_significant = (i.seconds / GetMinTimeToApply()) > 0.1;\n multiplier = is_significant ? multiplier : 10.0;\n\n // So what seems to be the sufficiently-large iteration count? Round up.\n const IterationCount max_next_iters = static_cast(\n std::lround(std::max(multiplier * static_cast(i.iters),\n static_cast(i.iters) + 1.0)));\n // But we do have *some* limits though..\n const IterationCount next_iters = std::min(max_next_iters, kMaxIterations);\n\n BM_VLOG(3) << \"Next iters: \" << next_iters << \", \" << multiplier << \"\\n\";\n return next_iters; // round up before conversion to integer.\n}\n\nbool BenchmarkRunner::ShouldReportIterationResults(\n const IterationResults& i) const {\n // Determine if this run should be reported;\n // Either it has run for a sufficient amount of time\n // or because an error was reported.\n return i.results.skipped_ ||\n i.iters >= kMaxIterations || // Too many iterations already.\n i.seconds >=\n GetMinTimeToApply() || // The elapsed time is large enough.\n // CPU time is specified but the elapsed real time greatly exceeds\n // the minimum time.\n // Note that user provided timers are except from this test.\n ((i.results.real_time_used >= 5 * GetMinTimeToApply()) &&\n !b.use_manual_time());\n}\n\ndouble BenchmarkRunner::GetMinTimeToApply() const {\n // In order to re-use functionality to run and measure benchmarks for running\n // a warmup phase of the benchmark, we need a way of telling whether to apply\n // min_time or min_warmup_time. This function will figure out if we are in the\n // warmup phase and therefore need to apply min_warmup_time or if we already\n // in the benchmarking phase and min_time needs to be applied.\n return warmup_done ? min_time : min_warmup_time;\n}\n\nvoid BenchmarkRunner::FinishWarmUp(const IterationCount& i) {\n warmup_done = true;\n iters = i;\n}\n\nvoid BenchmarkRunner::RunWarmUp() {\n // Use the same mechanisms for warming up the benchmark as used for actually\n // running and measuring the benchmark.\n IterationResults i_warmup;\n // Dont use the iterations determined in the warmup phase for the actual\n // measured benchmark phase. While this may be a good starting point for the\n // benchmark and it would therefore get rid of the need to figure out how many\n // iterations are needed if min_time is set again, this may also be a complete\n // wrong guess since the warmup loops might be considerably slower (e.g\n // because of caching effects).\n const IterationCount i_backup = iters;\n\n for (;;) {\n b.Setup();\n i_warmup = DoNIterations();\n b.Teardown();\n\n const bool finish = ShouldReportIterationResults(i_warmup);\n\n if (finish) {\n FinishWarmUp(i_backup);\n break;\n }\n\n // Although we are running \"only\" a warmup phase where running enough\n // iterations at once without measuring time isn't as important as it is for\n // the benchmarking phase, we still do it the same way as otherwise it is\n // very confusing for the user to know how to choose a proper value for\n // min_warmup_time if a different approach on running it is used.\n iters = PredictNumItersNeeded(i_warmup);\n assert(iters > i_warmup.iters &&\n \"if we did more iterations than we want to do the next time, \"\n \"then we should have accepted the current iteration run.\");\n }\n}\n\nvoid BenchmarkRunner::DoOneRepetition() {\n assert(HasRepeatsRemaining() && \"Already done all repetitions?\");\n\n const bool is_the_first_repetition = num_repetitions_done == 0;\n\n // In case a warmup phase is requested by the benchmark, run it now.\n // After running the warmup phase the BenchmarkRunner should be in a state as\n // this warmup never happened except the fact that warmup_done is set. Every\n // other manipulation of the BenchmarkRunner instance would be a bug! Please\n // fix it.\n if (!warmup_done) RunWarmUp();\n\n IterationResults i;\n // We *may* be gradually increasing the length (iteration count)\n // of the benchmark until we decide the results are significant.\n // And once we do, we report those last results and exit.\n // Please do note that the if there are repetitions, the iteration count\n // is *only* calculated for the *first* repetition, and other repetitions\n // simply use that precomputed iteration count.\n for (;;) {\n b.Setup();\n i = DoNIterations();\n b.Teardown();\n\n // Do we consider the results to be significant?\n // If we are doing repetitions, and the first repetition was already done,\n // it has calculated the correct iteration time, so we have run that very\n // iteration count just now. No need to calculate anything. Just report.\n // Else, the normal rules apply.\n const bool results_are_significant = !is_the_first_repetition ||\n has_explicit_iteration_count ||\n ShouldReportIterationResults(i);\n\n if (results_are_significant) break; // Good, let's report them!\n\n // Nope, bad iteration. Let's re-estimate the hopefully-sufficient\n // iteration count, and run the benchmark again...\n\n iters = PredictNumItersNeeded(i);\n assert(iters > i.iters &&\n \"if we did more iterations than we want to do the next time, \"\n \"then we should have accepted the current iteration run.\");\n }\n\n // Oh, one last thing, we need to also produce the 'memory measurements'..\n MemoryManager::Result* memory_result = nullptr;\n IterationCount memory_iterations = 0;\n if (memory_manager != nullptr) {\n // TODO(vyng): Consider making BenchmarkReporter::Run::memory_result an\n // optional so we don't have to own the Result here.\n // Can't do it now due to cxx03.\n memory_results.push_back(MemoryManager::Result());\n memory_result = &memory_results.back();\n // Only run a few iterations to reduce the impact of one-time\n // allocations in benchmarks that are not properly managed.\n memory_iterations = std::min(16, iters);\n memory_manager->Start();\n std::unique_ptr manager;\n manager.reset(new internal::ThreadManager(1));\n b.Setup();\n RunInThread(&b, memory_iterations, 0, manager.get(),\n perf_counters_measurement_ptr);\n manager->WaitForAllThreads();\n manager.reset();\n b.Teardown();\n memory_manager->Stop(*memory_result);\n }\n\n // Ok, now actually report.\n BenchmarkReporter::Run report =\n CreateRunReport(b, i.results, memory_iterations, memory_result, i.seconds,\n num_repetitions_done, repeats);\n\n if (reports_for_family) {\n ++reports_for_family->num_runs_done;\n if (!report.skipped) reports_for_family->Runs.push_back(report);\n }\n\n run_results.non_aggregates.push_back(report);\n\n ++num_repetitions_done;\n}\n\nRunResults&& BenchmarkRunner::GetResults() {\n assert(!HasRepeatsRemaining() && \"Did not run all repetitions yet?\");\n\n // Calculate additional statistics over the repetitions of this instance.\n run_results.aggregates_only = ComputeStats(run_results.non_aggregates);\n\n return std::move(run_results);\n}\n\n} // end namespace internal\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/benchmark_runner.h", "content": "// Copyright 2015 Google Inc. 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// 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#ifndef BENCHMARK_RUNNER_H_\n#define BENCHMARK_RUNNER_H_\n\n#include \n#include \n\n#include \"benchmark_api_internal.h\"\n#include \"internal_macros.h\"\n#include \"perf_counters.h\"\n#include \"thread_manager.h\"\n\nnamespace benchmark {\n\nBM_DECLARE_string(benchmark_min_time);\nBM_DECLARE_double(benchmark_min_warmup_time);\nBM_DECLARE_int32(benchmark_repetitions);\nBM_DECLARE_bool(benchmark_report_aggregates_only);\nBM_DECLARE_bool(benchmark_display_aggregates_only);\nBM_DECLARE_string(benchmark_perf_counters);\n\nnamespace internal {\n\nextern MemoryManager* memory_manager;\n\nstruct RunResults {\n std::vector non_aggregates;\n std::vector aggregates_only;\n\n bool display_report_aggregates_only = false;\n bool file_report_aggregates_only = false;\n};\n\nstruct BENCHMARK_EXPORT BenchTimeType {\n enum { ITERS, TIME } tag;\n union {\n IterationCount iters;\n double time;\n };\n};\n\nBENCHMARK_EXPORT\nBenchTimeType ParseBenchMinTime(const std::string& value);\n\nclass BenchmarkRunner {\n public:\n BenchmarkRunner(const benchmark::internal::BenchmarkInstance& b_,\n benchmark::internal::PerfCountersMeasurement* pmc_,\n BenchmarkReporter::PerFamilyRunReports* reports_for_family);\n\n int GetNumRepeats() const { return repeats; }\n\n bool HasRepeatsRemaining() const {\n return GetNumRepeats() != num_repetitions_done;\n }\n\n void DoOneRepetition();\n\n RunResults&& GetResults();\n\n BenchmarkReporter::PerFamilyRunReports* GetReportsForFamily() const {\n return reports_for_family;\n }\n\n double GetMinTime() const { return min_time; }\n\n bool HasExplicitIters() const { return has_explicit_iteration_count; }\n\n IterationCount GetIters() const { return iters; }\n\n private:\n RunResults run_results;\n\n const benchmark::internal::BenchmarkInstance& b;\n BenchmarkReporter::PerFamilyRunReports* reports_for_family;\n\n BenchTimeType parsed_benchtime_flag;\n const double min_time;\n const double min_warmup_time;\n bool warmup_done;\n const int repeats;\n const bool has_explicit_iteration_count;\n\n int num_repetitions_done = 0;\n\n std::vector pool;\n\n std::vector memory_results;\n\n IterationCount iters; // preserved between repetitions!\n // So only the first repetition has to find/calculate it,\n // the other repetitions will just use that precomputed iteration count.\n\n PerfCountersMeasurement* const perf_counters_measurement_ptr = nullptr;\n\n struct IterationResults {\n internal::ThreadManager::Result results;\n IterationCount iters;\n double seconds;\n };\n IterationResults DoNIterations();\n\n IterationCount PredictNumItersNeeded(const IterationResults& i) const;\n\n bool ShouldReportIterationResults(const IterationResults& i) const;\n\n double GetMinTimeToApply() const;\n\n void FinishWarmUp(const IterationCount& i);\n\n void RunWarmUp();\n};\n\n} // namespace internal\n\n} // end namespace benchmark\n\n#endif // BENCHMARK_RUNNER_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/check.cc", "content": "#include \"check.h\"\n\nnamespace benchmark {\nnamespace internal {\n\nstatic AbortHandlerT* handler = &std::abort;\n\nBENCHMARK_EXPORT AbortHandlerT*& GetAbortHandler() { return handler; }\n\n} // namespace internal\n} // namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/check.h", "content": "#ifndef CHECK_H_\n#define CHECK_H_\n\n#include \n#include \n#include \n\n#include \"benchmark/export.h\"\n#include \"internal_macros.h\"\n#include \"log.h\"\n\n#if defined(__GNUC__) || defined(__clang__)\n#define BENCHMARK_NOEXCEPT noexcept\n#define BENCHMARK_NOEXCEPT_OP(x) noexcept(x)\n#elif defined(_MSC_VER) && !defined(__clang__)\n#if _MSC_VER >= 1900\n#define BENCHMARK_NOEXCEPT noexcept\n#define BENCHMARK_NOEXCEPT_OP(x) noexcept(x)\n#else\n#define BENCHMARK_NOEXCEPT\n#define BENCHMARK_NOEXCEPT_OP(x)\n#endif\n#define __func__ __FUNCTION__\n#else\n#define BENCHMARK_NOEXCEPT\n#define BENCHMARK_NOEXCEPT_OP(x)\n#endif\n\nnamespace benchmark {\nnamespace internal {\n\ntypedef void(AbortHandlerT)();\n\nBENCHMARK_EXPORT\nAbortHandlerT*& GetAbortHandler();\n\nBENCHMARK_NORETURN inline void CallAbortHandler() {\n GetAbortHandler()();\n std::abort(); // fallback to enforce noreturn\n}\n\n// CheckHandler is the class constructed by failing BM_CHECK macros.\n// CheckHandler will log information about the failures and abort when it is\n// destructed.\nclass CheckHandler {\n public:\n CheckHandler(const char* check, const char* file, const char* func, int line)\n : log_(GetErrorLogInstance()) {\n log_ << file << \":\" << line << \": \" << func << \": Check `\" << check\n << \"' failed. \";\n }\n\n LogType& GetLog() { return log_; }\n\n#if defined(COMPILER_MSVC)\n#pragma warning(push)\n#pragma warning(disable : 4722)\n#endif\n BENCHMARK_NORETURN ~CheckHandler() BENCHMARK_NOEXCEPT_OP(false) {\n log_ << std::endl;\n CallAbortHandler();\n }\n#if defined(COMPILER_MSVC)\n#pragma warning(pop)\n#endif\n\n CheckHandler& operator=(const CheckHandler&) = delete;\n CheckHandler(const CheckHandler&) = delete;\n CheckHandler() = delete;\n\n private:\n LogType& log_;\n};\n\n} // end namespace internal\n} // end namespace benchmark\n\n// The BM_CHECK macro returns a std::ostream object that can have extra\n// information written to it.\n#ifndef NDEBUG\n#define BM_CHECK(b) \\\n (b ? ::benchmark::internal::GetNullLogInstance() \\\n : ::benchmark::internal::CheckHandler(#b, __FILE__, __func__, __LINE__) \\\n .GetLog())\n#else\n#define BM_CHECK(b) ::benchmark::internal::GetNullLogInstance()\n#endif\n\n// clang-format off\n// preserve whitespacing between operators for alignment\n#define BM_CHECK_EQ(a, b) BM_CHECK((a) == (b))\n#define BM_CHECK_NE(a, b) BM_CHECK((a) != (b))\n#define BM_CHECK_GE(a, b) BM_CHECK((a) >= (b))\n#define BM_CHECK_LE(a, b) BM_CHECK((a) <= (b))\n#define BM_CHECK_GT(a, b) BM_CHECK((a) > (b))\n#define BM_CHECK_LT(a, b) BM_CHECK((a) < (b))\n\n#define BM_CHECK_FLOAT_EQ(a, b, eps) BM_CHECK(std::fabs((a) - (b)) < (eps))\n#define BM_CHECK_FLOAT_NE(a, b, eps) BM_CHECK(std::fabs((a) - (b)) >= (eps))\n#define BM_CHECK_FLOAT_GE(a, b, eps) BM_CHECK((a) - (b) > -(eps))\n#define BM_CHECK_FLOAT_LE(a, b, eps) BM_CHECK((b) - (a) > -(eps))\n#define BM_CHECK_FLOAT_GT(a, b, eps) BM_CHECK((a) - (b) > (eps))\n#define BM_CHECK_FLOAT_LT(a, b, eps) BM_CHECK((b) - (a) > (eps))\n//clang-format on\n\n#endif // CHECK_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/colorprint.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \"colorprint.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"check.h\"\n#include \"internal_macros.h\"\n\n#ifdef BENCHMARK_OS_WINDOWS\n#include \n#include \n#else\n#include \n#endif // BENCHMARK_OS_WINDOWS\n\nnamespace benchmark {\nnamespace {\n#ifdef BENCHMARK_OS_WINDOWS\ntypedef WORD PlatformColorCode;\n#else\ntypedef const char* PlatformColorCode;\n#endif\n\nPlatformColorCode GetPlatformColorCode(LogColor color) {\n#ifdef BENCHMARK_OS_WINDOWS\n switch (color) {\n case COLOR_RED:\n return FOREGROUND_RED;\n case COLOR_GREEN:\n return FOREGROUND_GREEN;\n case COLOR_YELLOW:\n return FOREGROUND_RED | FOREGROUND_GREEN;\n case COLOR_BLUE:\n return FOREGROUND_BLUE;\n case COLOR_MAGENTA:\n return FOREGROUND_BLUE | FOREGROUND_RED;\n case COLOR_CYAN:\n return FOREGROUND_BLUE | FOREGROUND_GREEN;\n case COLOR_WHITE: // fall through to default\n default:\n return 0;\n }\n#else\n switch (color) {\n case COLOR_RED:\n return \"1\";\n case COLOR_GREEN:\n return \"2\";\n case COLOR_YELLOW:\n return \"3\";\n case COLOR_BLUE:\n return \"4\";\n case COLOR_MAGENTA:\n return \"5\";\n case COLOR_CYAN:\n return \"6\";\n case COLOR_WHITE:\n return \"7\";\n default:\n return nullptr;\n };\n#endif\n}\n\n} // end namespace\n\nstd::string FormatString(const char* msg, va_list args) {\n // we might need a second shot at this, so pre-emptivly make a copy\n va_list args_cp;\n va_copy(args_cp, args);\n\n std::size_t size = 256;\n char local_buff[256];\n auto ret = vsnprintf(local_buff, size, msg, args_cp);\n\n va_end(args_cp);\n\n // currently there is no error handling for failure, so this is hack.\n BM_CHECK(ret >= 0);\n\n if (ret == 0) { // handle empty expansion\n return {};\n }\n if (static_cast(ret) < size) {\n return local_buff;\n }\n // we did not provide a long enough buffer on our first attempt.\n size = static_cast(ret) + 1; // + 1 for the null byte\n std::unique_ptr buff(new char[size]);\n ret = vsnprintf(buff.get(), size, msg, args);\n BM_CHECK(ret > 0 && (static_cast(ret)) < size);\n return buff.get();\n}\n\nstd::string FormatString(const char* msg, ...) {\n va_list args;\n va_start(args, msg);\n auto tmp = FormatString(msg, args);\n va_end(args);\n return tmp;\n}\n\nvoid ColorPrintf(std::ostream& out, LogColor color, const char* fmt, ...) {\n va_list args;\n va_start(args, fmt);\n ColorPrintf(out, color, fmt, args);\n va_end(args);\n}\n\nvoid ColorPrintf(std::ostream& out, LogColor color, const char* fmt,\n va_list args) {\n#ifdef BENCHMARK_OS_WINDOWS\n ((void)out); // suppress unused warning\n\n const HANDLE stdout_handle = GetStdHandle(STD_OUTPUT_HANDLE);\n\n // Gets the current text color.\n CONSOLE_SCREEN_BUFFER_INFO buffer_info;\n GetConsoleScreenBufferInfo(stdout_handle, &buffer_info);\n const WORD old_color_attrs = buffer_info.wAttributes;\n\n // We need to flush the stream buffers into the console before each\n // SetConsoleTextAttribute call lest it affect the text that is already\n // printed but has not yet reached the console.\n fflush(stdout);\n SetConsoleTextAttribute(stdout_handle,\n GetPlatformColorCode(color) | FOREGROUND_INTENSITY);\n vprintf(fmt, args);\n\n fflush(stdout);\n // Restores the text color.\n SetConsoleTextAttribute(stdout_handle, old_color_attrs);\n#else\n const char* color_code = GetPlatformColorCode(color);\n if (color_code) out << FormatString(\"\\033[0;3%sm\", color_code);\n out << FormatString(fmt, args) << \"\\033[m\";\n#endif\n}\n\nbool IsColorTerminal() {\n#if BENCHMARK_OS_WINDOWS\n // On Windows the TERM variable is usually not set, but the\n // console there does support colors.\n return 0 != _isatty(_fileno(stdout));\n#else\n // On non-Windows platforms, we rely on the TERM variable. This list of\n // supported TERM values is copied from Google Test:\n // .\n const char* const SUPPORTED_TERM_VALUES[] = {\n \"xterm\",\n \"xterm-color\",\n \"xterm-256color\",\n \"screen\",\n \"screen-256color\",\n \"tmux\",\n \"tmux-256color\",\n \"rxvt-unicode\",\n \"rxvt-unicode-256color\",\n \"linux\",\n \"cygwin\",\n \"xterm-kitty\",\n \"alacritty\",\n \"foot\",\n \"foot-extra\",\n \"wezterm\",\n };\n\n const char* const term = getenv(\"TERM\");\n\n bool term_supports_color = false;\n for (const char* candidate : SUPPORTED_TERM_VALUES) {\n if (term && 0 == strcmp(term, candidate)) {\n term_supports_color = true;\n break;\n }\n }\n\n return 0 != isatty(fileno(stdout)) && term_supports_color;\n#endif // BENCHMARK_OS_WINDOWS\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/colorprint.h", "content": "#ifndef BENCHMARK_COLORPRINT_H_\n#define BENCHMARK_COLORPRINT_H_\n\n#include \n#include \n#include \n\nnamespace benchmark {\nenum LogColor {\n COLOR_DEFAULT,\n COLOR_RED,\n COLOR_GREEN,\n COLOR_YELLOW,\n COLOR_BLUE,\n COLOR_MAGENTA,\n COLOR_CYAN,\n COLOR_WHITE\n};\n\nstd::string FormatString(const char* msg, va_list args);\nstd::string FormatString(const char* msg, ...);\n\nvoid ColorPrintf(std::ostream& out, LogColor color, const char* fmt,\n va_list args);\nvoid ColorPrintf(std::ostream& out, LogColor color, const char* fmt, ...);\n\n// Returns true if stdout appears to be a terminal that supports colored\n// output, false otherwise.\nbool IsColorTerminal();\n\n} // end namespace benchmark\n\n#endif // BENCHMARK_COLORPRINT_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/commandlineflags.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \"commandlineflags.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"../src/string_util.h\"\n\nnamespace benchmark {\nnamespace {\n\n// Parses 'str' for a 32-bit signed integer. If successful, writes\n// the result to *value and returns true; otherwise leaves *value\n// unchanged and returns false.\nbool ParseInt32(const std::string& src_text, const char* str, int32_t* value) {\n // Parses the environment variable as a decimal integer.\n char* end = nullptr;\n const long long_value = strtol(str, &end, 10); // NOLINT\n\n // Has strtol() consumed all characters in the string?\n if (*end != '\\0') {\n // No - an invalid character was encountered.\n std::cerr << src_text << \" is expected to be a 32-bit integer, \"\n << \"but actually has value \\\"\" << str << \"\\\".\\n\";\n return false;\n }\n\n // Is the parsed value in the range of an Int32?\n const int32_t result = static_cast(long_value);\n if (long_value == std::numeric_limits::max() ||\n long_value == std::numeric_limits::min() ||\n // The parsed value overflows as a long. (strtol() returns\n // LONG_MAX or LONG_MIN when the input overflows.)\n result != long_value\n // The parsed value overflows as an Int32.\n ) {\n std::cerr << src_text << \" is expected to be a 32-bit integer, \"\n << \"but actually has value \\\"\" << str << \"\\\", \"\n << \"which overflows.\\n\";\n return false;\n }\n\n *value = result;\n return true;\n}\n\n// Parses 'str' for a double. If successful, writes the result to *value and\n// returns true; otherwise leaves *value unchanged and returns false.\nbool ParseDouble(const std::string& src_text, const char* str, double* value) {\n // Parses the environment variable as a decimal integer.\n char* end = nullptr;\n const double double_value = strtod(str, &end); // NOLINT\n\n // Has strtol() consumed all characters in the string?\n if (*end != '\\0') {\n // No - an invalid character was encountered.\n std::cerr << src_text << \" is expected to be a double, \"\n << \"but actually has value \\\"\" << str << \"\\\".\\n\";\n return false;\n }\n\n *value = double_value;\n return true;\n}\n\n// Parses 'str' into KV pairs. If successful, writes the result to *value and\n// returns true; otherwise leaves *value unchanged and returns false.\nbool ParseKvPairs(const std::string& src_text, const char* str,\n std::map* value) {\n std::map kvs;\n for (const auto& kvpair : StrSplit(str, ',')) {\n const auto kv = StrSplit(kvpair, '=');\n if (kv.size() != 2) {\n std::cerr << src_text << \" is expected to be a comma-separated list of \"\n << \"= strings, but actually has value \\\"\" << str\n << \"\\\".\\n\";\n return false;\n }\n if (!kvs.emplace(kv[0], kv[1]).second) {\n std::cerr << src_text << \" is expected to contain unique keys but key \\\"\"\n << kv[0] << \"\\\" was repeated.\\n\";\n return false;\n }\n }\n\n *value = kvs;\n return true;\n}\n\n// Returns the name of the environment variable corresponding to the\n// given flag. For example, FlagToEnvVar(\"foo\") will return\n// \"BENCHMARK_FOO\" in the open-source version.\nstatic std::string FlagToEnvVar(const char* flag) {\n const std::string flag_str(flag);\n\n std::string env_var;\n for (size_t i = 0; i != flag_str.length(); ++i)\n env_var += static_cast(::toupper(flag_str.c_str()[i]));\n\n return env_var;\n}\n\n} // namespace\n\nBENCHMARK_EXPORT\nbool BoolFromEnv(const char* flag, bool default_val) {\n const std::string env_var = FlagToEnvVar(flag);\n const char* const value_str = getenv(env_var.c_str());\n return value_str == nullptr ? default_val : IsTruthyFlagValue(value_str);\n}\n\nBENCHMARK_EXPORT\nint32_t Int32FromEnv(const char* flag, int32_t default_val) {\n const std::string env_var = FlagToEnvVar(flag);\n const char* const value_str = getenv(env_var.c_str());\n int32_t value = default_val;\n if (value_str == nullptr ||\n !ParseInt32(std::string(\"Environment variable \") + env_var, value_str,\n &value)) {\n return default_val;\n }\n return value;\n}\n\nBENCHMARK_EXPORT\ndouble DoubleFromEnv(const char* flag, double default_val) {\n const std::string env_var = FlagToEnvVar(flag);\n const char* const value_str = getenv(env_var.c_str());\n double value = default_val;\n if (value_str == nullptr ||\n !ParseDouble(std::string(\"Environment variable \") + env_var, value_str,\n &value)) {\n return default_val;\n }\n return value;\n}\n\nBENCHMARK_EXPORT\nconst char* StringFromEnv(const char* flag, const char* default_val) {\n const std::string env_var = FlagToEnvVar(flag);\n const char* const value = getenv(env_var.c_str());\n return value == nullptr ? default_val : value;\n}\n\nBENCHMARK_EXPORT\nstd::map KvPairsFromEnv(\n const char* flag, std::map default_val) {\n const std::string env_var = FlagToEnvVar(flag);\n const char* const value_str = getenv(env_var.c_str());\n\n if (value_str == nullptr) return default_val;\n\n std::map value;\n if (!ParseKvPairs(\"Environment variable \" + env_var, value_str, &value)) {\n return default_val;\n }\n return value;\n}\n\n// Parses a string as a command line flag. The string should have\n// the format \"--flag=value\". When def_optional is true, the \"=value\"\n// part can be omitted.\n//\n// Returns the value of the flag, or nullptr if the parsing failed.\nconst char* ParseFlagValue(const char* str, const char* flag,\n bool def_optional) {\n // str and flag must not be nullptr.\n if (str == nullptr || flag == nullptr) return nullptr;\n\n // The flag must start with \"--\".\n const std::string flag_str = std::string(\"--\") + std::string(flag);\n const size_t flag_len = flag_str.length();\n if (strncmp(str, flag_str.c_str(), flag_len) != 0) return nullptr;\n\n // Skips the flag name.\n const char* flag_end = str + flag_len;\n\n // When def_optional is true, it's OK to not have a \"=value\" part.\n if (def_optional && (flag_end[0] == '\\0')) return flag_end;\n\n // If def_optional is true and there are more characters after the\n // flag name, or if def_optional is false, there must be a '=' after\n // the flag name.\n if (flag_end[0] != '=') return nullptr;\n\n // Returns the string after \"=\".\n return flag_end + 1;\n}\n\nBENCHMARK_EXPORT\nbool ParseBoolFlag(const char* str, const char* flag, bool* value) {\n // Gets the value of the flag as a string.\n const char* const value_str = ParseFlagValue(str, flag, true);\n\n // Aborts if the parsing failed.\n if (value_str == nullptr) return false;\n\n // Converts the string value to a bool.\n *value = IsTruthyFlagValue(value_str);\n return true;\n}\n\nBENCHMARK_EXPORT\nbool ParseInt32Flag(const char* str, const char* flag, int32_t* value) {\n // Gets the value of the flag as a string.\n const char* const value_str = ParseFlagValue(str, flag, false);\n\n // Aborts if the parsing failed.\n if (value_str == nullptr) return false;\n\n // Sets *value to the value of the flag.\n return ParseInt32(std::string(\"The value of flag --\") + flag, value_str,\n value);\n}\n\nBENCHMARK_EXPORT\nbool ParseDoubleFlag(const char* str, const char* flag, double* value) {\n // Gets the value of the flag as a string.\n const char* const value_str = ParseFlagValue(str, flag, false);\n\n // Aborts if the parsing failed.\n if (value_str == nullptr) return false;\n\n // Sets *value to the value of the flag.\n return ParseDouble(std::string(\"The value of flag --\") + flag, value_str,\n value);\n}\n\nBENCHMARK_EXPORT\nbool ParseStringFlag(const char* str, const char* flag, std::string* value) {\n // Gets the value of the flag as a string.\n const char* const value_str = ParseFlagValue(str, flag, false);\n\n // Aborts if the parsing failed.\n if (value_str == nullptr) return false;\n\n *value = value_str;\n return true;\n}\n\nBENCHMARK_EXPORT\nbool ParseKeyValueFlag(const char* str, const char* flag,\n std::map* value) {\n const char* const value_str = ParseFlagValue(str, flag, false);\n\n if (value_str == nullptr) return false;\n\n for (const auto& kvpair : StrSplit(value_str, ',')) {\n const auto kv = StrSplit(kvpair, '=');\n if (kv.size() != 2) return false;\n value->emplace(kv[0], kv[1]);\n }\n\n return true;\n}\n\nBENCHMARK_EXPORT\nbool IsFlag(const char* str, const char* flag) {\n return (ParseFlagValue(str, flag, true) != nullptr);\n}\n\nBENCHMARK_EXPORT\nbool IsTruthyFlagValue(const std::string& value) {\n if (value.size() == 1) {\n char v = value[0];\n return isalnum(v) &&\n !(v == '0' || v == 'f' || v == 'F' || v == 'n' || v == 'N');\n }\n if (!value.empty()) {\n std::string value_lower(value);\n std::transform(value_lower.begin(), value_lower.end(), value_lower.begin(),\n [](char c) { return static_cast(::tolower(c)); });\n return !(value_lower == \"false\" || value_lower == \"no\" ||\n value_lower == \"off\");\n }\n return true;\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/commandlineflags.h", "content": "#ifndef BENCHMARK_COMMANDLINEFLAGS_H_\n#define BENCHMARK_COMMANDLINEFLAGS_H_\n\n#include \n#include \n#include \n\n#include \"benchmark/export.h\"\n\n// Macro for referencing flags.\n#define FLAG(name) FLAGS_##name\n\n// Macros for declaring flags.\n#define BM_DECLARE_bool(name) BENCHMARK_EXPORT extern bool FLAG(name)\n#define BM_DECLARE_int32(name) BENCHMARK_EXPORT extern int32_t FLAG(name)\n#define BM_DECLARE_double(name) BENCHMARK_EXPORT extern double FLAG(name)\n#define BM_DECLARE_string(name) BENCHMARK_EXPORT extern std::string FLAG(name)\n#define BM_DECLARE_kvpairs(name) \\\n BENCHMARK_EXPORT extern std::map FLAG(name)\n\n// Macros for defining flags.\n#define BM_DEFINE_bool(name, default_val) \\\n BENCHMARK_EXPORT bool FLAG(name) = benchmark::BoolFromEnv(#name, default_val)\n#define BM_DEFINE_int32(name, default_val) \\\n BENCHMARK_EXPORT int32_t FLAG(name) = \\\n benchmark::Int32FromEnv(#name, default_val)\n#define BM_DEFINE_double(name, default_val) \\\n BENCHMARK_EXPORT double FLAG(name) = \\\n benchmark::DoubleFromEnv(#name, default_val)\n#define BM_DEFINE_string(name, default_val) \\\n BENCHMARK_EXPORT std::string FLAG(name) = \\\n benchmark::StringFromEnv(#name, default_val)\n#define BM_DEFINE_kvpairs(name, default_val) \\\n BENCHMARK_EXPORT std::map FLAG(name) = \\\n benchmark::KvPairsFromEnv(#name, default_val)\n\nnamespace benchmark {\n\n// Parses a bool from the environment variable corresponding to the given flag.\n//\n// If the variable exists, returns IsTruthyFlagValue() value; if not,\n// returns the given default value.\nBENCHMARK_EXPORT\nbool BoolFromEnv(const char* flag, bool default_val);\n\n// Parses an Int32 from the environment variable corresponding to the given\n// flag.\n//\n// If the variable exists, returns ParseInt32() value; if not, returns\n// the given default value.\nBENCHMARK_EXPORT\nint32_t Int32FromEnv(const char* flag, int32_t default_val);\n\n// Parses an Double from the environment variable corresponding to the given\n// flag.\n//\n// If the variable exists, returns ParseDouble(); if not, returns\n// the given default value.\nBENCHMARK_EXPORT\ndouble DoubleFromEnv(const char* flag, double default_val);\n\n// Parses a string from the environment variable corresponding to the given\n// flag.\n//\n// If variable exists, returns its value; if not, returns\n// the given default value.\nBENCHMARK_EXPORT\nconst char* StringFromEnv(const char* flag, const char* default_val);\n\n// Parses a set of kvpairs from the environment variable corresponding to the\n// given flag.\n//\n// If variable exists, returns its value; if not, returns\n// the given default value.\nBENCHMARK_EXPORT\nstd::map KvPairsFromEnv(\n const char* flag, std::map default_val);\n\n// Parses a string for a bool flag, in the form of either\n// \"--flag=value\" or \"--flag\".\n//\n// In the former case, the value is taken as true if it passes IsTruthyValue().\n//\n// In the latter case, the value is taken as true.\n//\n// On success, stores the value of the flag in *value, and returns\n// true. On failure, returns false without changing *value.\nBENCHMARK_EXPORT\nbool ParseBoolFlag(const char* str, const char* flag, bool* value);\n\n// Parses a string for an Int32 flag, in the form of \"--flag=value\".\n//\n// On success, stores the value of the flag in *value, and returns\n// true. On failure, returns false without changing *value.\nBENCHMARK_EXPORT\nbool ParseInt32Flag(const char* str, const char* flag, int32_t* value);\n\n// Parses a string for a Double flag, in the form of \"--flag=value\".\n//\n// On success, stores the value of the flag in *value, and returns\n// true. On failure, returns false without changing *value.\nBENCHMARK_EXPORT\nbool ParseDoubleFlag(const char* str, const char* flag, double* value);\n\n// Parses a string for a string flag, in the form of \"--flag=value\".\n//\n// On success, stores the value of the flag in *value, and returns\n// true. On failure, returns false without changing *value.\nBENCHMARK_EXPORT\nbool ParseStringFlag(const char* str, const char* flag, std::string* value);\n\n// Parses a string for a kvpairs flag in the form \"--flag=key=value,key=value\"\n//\n// On success, stores the value of the flag in *value and returns true. On\n// failure returns false, though *value may have been mutated.\nBENCHMARK_EXPORT\nbool ParseKeyValueFlag(const char* str, const char* flag,\n std::map* value);\n\n// Returns true if the string matches the flag.\nBENCHMARK_EXPORT\nbool IsFlag(const char* str, const char* flag);\n\n// Returns true unless value starts with one of: '0', 'f', 'F', 'n' or 'N', or\n// some non-alphanumeric character. Also returns false if the value matches\n// one of 'no', 'false', 'off' (case-insensitive). As a special case, also\n// returns true if value is the empty string.\nBENCHMARK_EXPORT\nbool IsTruthyFlagValue(const std::string& value);\n\n} // end namespace benchmark\n\n#endif // BENCHMARK_COMMANDLINEFLAGS_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/complexity.cc", "content": "// Copyright 2016 Ismael Jimenez Martinez. 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// 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// Source project : https://github.com/ismaelJimenez/cpp.leastsq\n// Adapted to be used with google benchmark\n\n#include \"complexity.h\"\n\n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"check.h\"\n\nnamespace benchmark {\n\n// Internal function to calculate the different scalability forms\nBigOFunc* FittingCurve(BigO complexity) {\n static const double kLog2E = 1.44269504088896340736;\n switch (complexity) {\n case oN:\n return [](IterationCount n) -> double { return static_cast(n); };\n case oNSquared:\n return [](IterationCount n) -> double { return std::pow(n, 2); };\n case oNCubed:\n return [](IterationCount n) -> double { return std::pow(n, 3); };\n case oLogN:\n /* Note: can't use log2 because Android's GNU STL lacks it */\n return\n [](IterationCount n) { return kLog2E * log(static_cast(n)); };\n case oNLogN:\n /* Note: can't use log2 because Android's GNU STL lacks it */\n return [](IterationCount n) {\n return kLog2E * n * log(static_cast(n));\n };\n case o1:\n default:\n return [](IterationCount) { return 1.0; };\n }\n}\n\n// Function to return an string for the calculated complexity\nstd::string GetBigOString(BigO complexity) {\n switch (complexity) {\n case oN:\n return \"N\";\n case oNSquared:\n return \"N^2\";\n case oNCubed:\n return \"N^3\";\n case oLogN:\n return \"lgN\";\n case oNLogN:\n return \"NlgN\";\n case o1:\n return \"(1)\";\n default:\n return \"f(N)\";\n }\n}\n\n// Find the coefficient for the high-order term in the running time, by\n// minimizing the sum of squares of relative error, for the fitting curve\n// given by the lambda expression.\n// - n : Vector containing the size of the benchmark tests.\n// - time : Vector containing the times for the benchmark tests.\n// - fitting_curve : lambda expression (e.g. [](int64_t n) {return n; };).\n\n// For a deeper explanation on the algorithm logic, please refer to\n// https://en.wikipedia.org/wiki/Least_squares#Least_squares,_regression_analysis_and_statistics\n\nLeastSq MinimalLeastSq(const std::vector& n,\n const std::vector& time,\n BigOFunc* fitting_curve) {\n double sigma_gn_squared = 0.0;\n double sigma_time = 0.0;\n double sigma_time_gn = 0.0;\n\n // Calculate least square fitting parameter\n for (size_t i = 0; i < n.size(); ++i) {\n double gn_i = fitting_curve(n[i]);\n sigma_gn_squared += gn_i * gn_i;\n sigma_time += time[i];\n sigma_time_gn += time[i] * gn_i;\n }\n\n LeastSq result;\n result.complexity = oLambda;\n\n // Calculate complexity.\n result.coef = sigma_time_gn / sigma_gn_squared;\n\n // Calculate RMS\n double rms = 0.0;\n for (size_t i = 0; i < n.size(); ++i) {\n double fit = result.coef * fitting_curve(n[i]);\n rms += pow((time[i] - fit), 2);\n }\n\n // Normalized RMS by the mean of the observed values\n double mean = sigma_time / n.size();\n result.rms = sqrt(rms / n.size()) / mean;\n\n return result;\n}\n\n// Find the coefficient for the high-order term in the running time, by\n// minimizing the sum of squares of relative error.\n// - n : Vector containing the size of the benchmark tests.\n// - time : Vector containing the times for the benchmark tests.\n// - complexity : If different than oAuto, the fitting curve will stick to\n// this one. If it is oAuto, it will be calculated the best\n// fitting curve.\nLeastSq MinimalLeastSq(const std::vector& n,\n const std::vector& time, const BigO complexity) {\n BM_CHECK_EQ(n.size(), time.size());\n BM_CHECK_GE(n.size(), 2); // Do not compute fitting curve is less than two\n // benchmark runs are given\n BM_CHECK_NE(complexity, oNone);\n\n LeastSq best_fit;\n\n if (complexity == oAuto) {\n std::vector fit_curves = {oLogN, oN, oNLogN, oNSquared, oNCubed};\n\n // Take o1 as default best fitting curve\n best_fit = MinimalLeastSq(n, time, FittingCurve(o1));\n best_fit.complexity = o1;\n\n // Compute all possible fitting curves and stick to the best one\n for (const auto& fit : fit_curves) {\n LeastSq current_fit = MinimalLeastSq(n, time, FittingCurve(fit));\n if (current_fit.rms < best_fit.rms) {\n best_fit = current_fit;\n best_fit.complexity = fit;\n }\n }\n } else {\n best_fit = MinimalLeastSq(n, time, FittingCurve(complexity));\n best_fit.complexity = complexity;\n }\n\n return best_fit;\n}\n\nstd::vector ComputeBigO(\n const std::vector& reports) {\n typedef BenchmarkReporter::Run Run;\n std::vector results;\n\n if (reports.size() < 2) return results;\n\n // Accumulators.\n std::vector n;\n std::vector real_time;\n std::vector cpu_time;\n\n // Populate the accumulators.\n for (const Run& run : reports) {\n BM_CHECK_GT(run.complexity_n, 0)\n << \"Did you forget to call SetComplexityN?\";\n n.push_back(run.complexity_n);\n real_time.push_back(run.real_accumulated_time / run.iterations);\n cpu_time.push_back(run.cpu_accumulated_time / run.iterations);\n }\n\n LeastSq result_cpu;\n LeastSq result_real;\n\n if (reports[0].complexity == oLambda) {\n result_cpu = MinimalLeastSq(n, cpu_time, reports[0].complexity_lambda);\n result_real = MinimalLeastSq(n, real_time, reports[0].complexity_lambda);\n } else {\n result_cpu = MinimalLeastSq(n, cpu_time, reports[0].complexity);\n result_real = MinimalLeastSq(n, real_time, result_cpu.complexity);\n }\n\n // Drop the 'args' when reporting complexity.\n auto run_name = reports[0].run_name;\n run_name.args.clear();\n\n // Get the data from the accumulator to BenchmarkReporter::Run's.\n Run big_o;\n big_o.run_name = run_name;\n big_o.family_index = reports[0].family_index;\n big_o.per_family_instance_index = reports[0].per_family_instance_index;\n big_o.run_type = BenchmarkReporter::Run::RT_Aggregate;\n big_o.repetitions = reports[0].repetitions;\n big_o.repetition_index = Run::no_repetition_index;\n big_o.threads = reports[0].threads;\n big_o.aggregate_name = \"BigO\";\n big_o.aggregate_unit = StatisticUnit::kTime;\n big_o.report_label = reports[0].report_label;\n big_o.iterations = 0;\n big_o.real_accumulated_time = result_real.coef;\n big_o.cpu_accumulated_time = result_cpu.coef;\n big_o.report_big_o = true;\n big_o.complexity = result_cpu.complexity;\n\n // All the time results are reported after being multiplied by the\n // time unit multiplier. But since RMS is a relative quantity it\n // should not be multiplied at all. So, here, we _divide_ it by the\n // multiplier so that when it is multiplied later the result is the\n // correct one.\n double multiplier = GetTimeUnitMultiplier(reports[0].time_unit);\n\n // Only add label to mean/stddev if it is same for all runs\n Run rms;\n rms.run_name = run_name;\n rms.family_index = reports[0].family_index;\n rms.per_family_instance_index = reports[0].per_family_instance_index;\n rms.run_type = BenchmarkReporter::Run::RT_Aggregate;\n rms.aggregate_name = \"RMS\";\n rms.aggregate_unit = StatisticUnit::kPercentage;\n rms.report_label = big_o.report_label;\n rms.iterations = 0;\n rms.repetition_index = Run::no_repetition_index;\n rms.repetitions = reports[0].repetitions;\n rms.threads = reports[0].threads;\n rms.real_accumulated_time = result_real.rms / multiplier;\n rms.cpu_accumulated_time = result_cpu.rms / multiplier;\n rms.report_rms = true;\n rms.complexity = result_cpu.complexity;\n // don't forget to keep the time unit, or we won't be able to\n // recover the correct value.\n rms.time_unit = reports[0].time_unit;\n\n results.push_back(big_o);\n results.push_back(rms);\n return results;\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/complexity.h", "content": "// Copyright 2016 Ismael Jimenez Martinez. 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// 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// Source project : https://github.com/ismaelJimenez/cpp.leastsq\n// Adapted to be used with google benchmark\n\n#ifndef COMPLEXITY_H_\n#define COMPLEXITY_H_\n\n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\nnamespace benchmark {\n\n// Return a vector containing the bigO and RMS information for the specified\n// list of reports. If 'reports.size() < 2' an empty vector is returned.\nstd::vector ComputeBigO(\n const std::vector& reports);\n\n// This data structure will contain the result returned by MinimalLeastSq\n// - coef : Estimated coefficient for the high-order term as\n// interpolated from data.\n// - rms : Normalized Root Mean Squared Error.\n// - complexity : Scalability form (e.g. oN, oNLogN). In case a scalability\n// form has been provided to MinimalLeastSq this will return\n// the same value. In case BigO::oAuto has been selected, this\n// parameter will return the best fitting curve detected.\n\nstruct LeastSq {\n LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {}\n\n double coef;\n double rms;\n BigO complexity;\n};\n\n// Function to return an string for the calculated complexity\nstd::string GetBigOString(BigO complexity);\n\n} // end namespace benchmark\n\n#endif // COMPLEXITY_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/console_reporter.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"check.h\"\n#include \"colorprint.h\"\n#include \"commandlineflags.h\"\n#include \"complexity.h\"\n#include \"counter.h\"\n#include \"internal_macros.h\"\n#include \"string_util.h\"\n#include \"timers.h\"\n\nnamespace benchmark {\n\nBENCHMARK_EXPORT\nbool ConsoleReporter::ReportContext(const Context& context) {\n name_field_width_ = context.name_field_width;\n printed_header_ = false;\n prev_counters_.clear();\n\n PrintBasicContext(&GetErrorStream(), context);\n\n#ifdef BENCHMARK_OS_WINDOWS\n if ((output_options_ & OO_Color) && &std::cout != &GetOutputStream()) {\n GetErrorStream()\n << \"Color printing is only supported for stdout on windows.\"\n \" Disabling color printing\\n\";\n output_options_ = static_cast(output_options_ & ~OO_Color);\n }\n#endif\n\n return true;\n}\n\nBENCHMARK_EXPORT\nvoid ConsoleReporter::PrintHeader(const Run& run) {\n std::string str =\n FormatString(\"%-*s %13s %15s %12s\", static_cast(name_field_width_),\n \"Benchmark\", \"Time\", \"CPU\", \"Iterations\");\n if (!run.counters.empty()) {\n if (output_options_ & OO_Tabular) {\n for (auto const& c : run.counters) {\n str += FormatString(\" %10s\", c.first.c_str());\n }\n } else {\n str += \" UserCounters...\";\n }\n }\n std::string line = std::string(str.length(), '-');\n GetOutputStream() << line << \"\\n\" << str << \"\\n\" << line << \"\\n\";\n}\n\nBENCHMARK_EXPORT\nvoid ConsoleReporter::ReportRuns(const std::vector& reports) {\n for (const auto& run : reports) {\n // print the header:\n // --- if none was printed yet\n bool print_header = !printed_header_;\n // --- or if the format is tabular and this run\n // has different fields from the prev header\n print_header |= (output_options_ & OO_Tabular) &&\n (!internal::SameNames(run.counters, prev_counters_));\n if (print_header) {\n printed_header_ = true;\n prev_counters_ = run.counters;\n PrintHeader(run);\n }\n // As an alternative to printing the headers like this, we could sort\n // the benchmarks by header and then print. But this would require\n // waiting for the full results before printing, or printing twice.\n PrintRunData(run);\n }\n}\n\nstatic void IgnoreColorPrint(std::ostream& out, LogColor, const char* fmt,\n ...) {\n va_list args;\n va_start(args, fmt);\n out << FormatString(fmt, args);\n va_end(args);\n}\n\nstatic std::string FormatTime(double time) {\n // For the time columns of the console printer 13 digits are reserved. One of\n // them is a space and max two of them are the time unit (e.g ns). That puts\n // us at 10 digits usable for the number.\n // Align decimal places...\n if (time < 1.0) {\n return FormatString(\"%10.3f\", time);\n }\n if (time < 10.0) {\n return FormatString(\"%10.2f\", time);\n }\n if (time < 100.0) {\n return FormatString(\"%10.1f\", time);\n }\n // Assuming the time is at max 9.9999e+99 and we have 10 digits for the\n // number, we get 10-1(.)-1(e)-1(sign)-2(exponent) = 5 digits to print.\n if (time > 9999999999 /*max 10 digit number*/) {\n return FormatString(\"%1.4e\", time);\n }\n return FormatString(\"%10.0f\", time);\n}\n\nBENCHMARK_EXPORT\nvoid ConsoleReporter::PrintRunData(const Run& result) {\n typedef void(PrinterFn)(std::ostream&, LogColor, const char*, ...);\n auto& Out = GetOutputStream();\n PrinterFn* printer = (output_options_ & OO_Color)\n ? static_cast(ColorPrintf)\n : IgnoreColorPrint;\n auto name_color =\n (result.report_big_o || result.report_rms) ? COLOR_BLUE : COLOR_GREEN;\n printer(Out, name_color, \"%-*s \", name_field_width_,\n result.benchmark_name().c_str());\n\n if (internal::SkippedWithError == result.skipped) {\n printer(Out, COLOR_RED, \"ERROR OCCURRED: \\'%s\\'\",\n result.skip_message.c_str());\n printer(Out, COLOR_DEFAULT, \"\\n\");\n return;\n } else if (internal::SkippedWithMessage == result.skipped) {\n printer(Out, COLOR_WHITE, \"SKIPPED: \\'%s\\'\", result.skip_message.c_str());\n printer(Out, COLOR_DEFAULT, \"\\n\");\n return;\n }\n\n const double real_time = result.GetAdjustedRealTime();\n const double cpu_time = result.GetAdjustedCPUTime();\n const std::string real_time_str = FormatTime(real_time);\n const std::string cpu_time_str = FormatTime(cpu_time);\n\n if (result.report_big_o) {\n std::string big_o = GetBigOString(result.complexity);\n printer(Out, COLOR_YELLOW, \"%10.2f %-4s %10.2f %-4s \", real_time,\n big_o.c_str(), cpu_time, big_o.c_str());\n } else if (result.report_rms) {\n printer(Out, COLOR_YELLOW, \"%10.0f %-4s %10.0f %-4s \", real_time * 100, \"%\",\n cpu_time * 100, \"%\");\n } else if (result.run_type != Run::RT_Aggregate ||\n result.aggregate_unit == StatisticUnit::kTime) {\n const char* timeLabel = GetTimeUnitString(result.time_unit);\n printer(Out, COLOR_YELLOW, \"%s %-4s %s %-4s \", real_time_str.c_str(),\n timeLabel, cpu_time_str.c_str(), timeLabel);\n } else {\n assert(result.aggregate_unit == StatisticUnit::kPercentage);\n printer(Out, COLOR_YELLOW, \"%10.2f %-4s %10.2f %-4s \",\n (100. * result.real_accumulated_time), \"%\",\n (100. * result.cpu_accumulated_time), \"%\");\n }\n\n if (!result.report_big_o && !result.report_rms) {\n printer(Out, COLOR_CYAN, \"%10lld\", result.iterations);\n }\n\n for (auto& c : result.counters) {\n const std::size_t cNameLen =\n std::max(std::string::size_type(10), c.first.length());\n std::string s;\n const char* unit = \"\";\n if (result.run_type == Run::RT_Aggregate &&\n result.aggregate_unit == StatisticUnit::kPercentage) {\n s = StrFormat(\"%.2f\", 100. * c.second.value);\n unit = \"%\";\n } else {\n s = HumanReadableNumber(c.second.value, c.second.oneK);\n if (c.second.flags & Counter::kIsRate)\n unit = (c.second.flags & Counter::kInvert) ? \"s\" : \"/s\";\n }\n if (output_options_ & OO_Tabular) {\n printer(Out, COLOR_DEFAULT, \" %*s%s\", cNameLen - strlen(unit), s.c_str(),\n unit);\n } else {\n printer(Out, COLOR_DEFAULT, \" %s=%s%s\", c.first.c_str(), s.c_str(), unit);\n }\n }\n\n if (!result.report_label.empty()) {\n printer(Out, COLOR_DEFAULT, \" %s\", result.report_label.c_str());\n }\n\n printer(Out, COLOR_DEFAULT, \"\\n\");\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/counter.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \"counter.h\"\n\nnamespace benchmark {\nnamespace internal {\n\ndouble Finish(Counter const& c, IterationCount iterations, double cpu_time,\n double num_threads) {\n double v = c.value;\n if (c.flags & Counter::kIsRate) {\n v /= cpu_time;\n }\n if (c.flags & Counter::kAvgThreads) {\n v /= num_threads;\n }\n if (c.flags & Counter::kIsIterationInvariant) {\n v *= iterations;\n }\n if (c.flags & Counter::kAvgIterations) {\n v /= iterations;\n }\n\n if (c.flags & Counter::kInvert) { // Invert is *always* last.\n v = 1.0 / v;\n }\n return v;\n}\n\nvoid Finish(UserCounters* l, IterationCount iterations, double cpu_time,\n double num_threads) {\n for (auto& c : *l) {\n c.second.value = Finish(c.second, iterations, cpu_time, num_threads);\n }\n}\n\nvoid Increment(UserCounters* l, UserCounters const& r) {\n // add counters present in both or just in *l\n for (auto& c : *l) {\n auto it = r.find(c.first);\n if (it != r.end()) {\n c.second.value = c.second + it->second;\n }\n }\n // add counters present in r, but not in *l\n for (auto const& tc : r) {\n auto it = l->find(tc.first);\n if (it == l->end()) {\n (*l)[tc.first] = tc.second;\n }\n }\n}\n\nbool SameNames(UserCounters const& l, UserCounters const& r) {\n if (&l == &r) return true;\n if (l.size() != r.size()) {\n return false;\n }\n for (auto const& c : l) {\n if (r.find(c.first) == r.end()) {\n return false;\n }\n }\n return true;\n}\n\n} // end namespace internal\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/counter.h", "content": "// Copyright 2015 Google Inc. 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// 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#ifndef BENCHMARK_COUNTER_H_\n#define BENCHMARK_COUNTER_H_\n\n#include \"benchmark/benchmark.h\"\n\nnamespace benchmark {\n\n// these counter-related functions are hidden to reduce API surface.\nnamespace internal {\nvoid Finish(UserCounters* l, IterationCount iterations, double time,\n double num_threads);\nvoid Increment(UserCounters* l, UserCounters const& r);\nbool SameNames(UserCounters const& l, UserCounters const& r);\n} // end namespace internal\n\n} // end namespace benchmark\n\n#endif // BENCHMARK_COUNTER_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/csv_reporter.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"check.h\"\n#include \"complexity.h\"\n#include \"string_util.h\"\n#include \"timers.h\"\n\n// File format reference: http://edoceo.com/utilitas/csv-file-format.\n\nnamespace benchmark {\n\nnamespace {\nstd::vector elements = {\n \"name\", \"iterations\", \"real_time\", \"cpu_time\",\n \"time_unit\", \"bytes_per_second\", \"items_per_second\", \"label\",\n \"error_occurred\", \"error_message\"};\n} // namespace\n\nstd::string CsvEscape(const std::string& s) {\n std::string tmp;\n tmp.reserve(s.size() + 2);\n for (char c : s) {\n switch (c) {\n case '\"':\n tmp += \"\\\"\\\"\";\n break;\n default:\n tmp += c;\n break;\n }\n }\n return '\"' + tmp + '\"';\n}\n\nBENCHMARK_EXPORT\nbool CSVReporter::ReportContext(const Context& context) {\n PrintBasicContext(&GetErrorStream(), context);\n return true;\n}\n\nBENCHMARK_EXPORT\nvoid CSVReporter::ReportRuns(const std::vector& reports) {\n std::ostream& Out = GetOutputStream();\n\n if (!printed_header_) {\n // save the names of all the user counters\n for (const auto& run : reports) {\n for (const auto& cnt : run.counters) {\n if (cnt.first == \"bytes_per_second\" || cnt.first == \"items_per_second\")\n continue;\n user_counter_names_.insert(cnt.first);\n }\n }\n\n // print the header\n for (auto B = elements.begin(); B != elements.end();) {\n Out << *B++;\n if (B != elements.end()) Out << \",\";\n }\n for (auto B = user_counter_names_.begin();\n B != user_counter_names_.end();) {\n Out << \",\\\"\" << *B++ << \"\\\"\";\n }\n Out << \"\\n\";\n\n printed_header_ = true;\n } else {\n // check that all the current counters are saved in the name set\n for (const auto& run : reports) {\n for (const auto& cnt : run.counters) {\n if (cnt.first == \"bytes_per_second\" || cnt.first == \"items_per_second\")\n continue;\n BM_CHECK(user_counter_names_.find(cnt.first) !=\n user_counter_names_.end())\n << \"All counters must be present in each run. \"\n << \"Counter named \\\"\" << cnt.first\n << \"\\\" was not in a run after being added to the header\";\n }\n }\n }\n\n // print results for each run\n for (const auto& run : reports) {\n PrintRunData(run);\n }\n}\n\nBENCHMARK_EXPORT\nvoid CSVReporter::PrintRunData(const Run& run) {\n std::ostream& Out = GetOutputStream();\n Out << CsvEscape(run.benchmark_name()) << \",\";\n if (run.skipped) {\n Out << std::string(elements.size() - 3, ',');\n Out << std::boolalpha << (internal::SkippedWithError == run.skipped) << \",\";\n Out << CsvEscape(run.skip_message) << \"\\n\";\n return;\n }\n\n // Do not print iteration on bigO and RMS report\n if (!run.report_big_o && !run.report_rms) {\n Out << run.iterations;\n }\n Out << \",\";\n\n Out << run.GetAdjustedRealTime() << \",\";\n Out << run.GetAdjustedCPUTime() << \",\";\n\n // Do not print timeLabel on bigO and RMS report\n if (run.report_big_o) {\n Out << GetBigOString(run.complexity);\n } else if (!run.report_rms) {\n Out << GetTimeUnitString(run.time_unit);\n }\n Out << \",\";\n\n if (run.counters.find(\"bytes_per_second\") != run.counters.end()) {\n Out << run.counters.at(\"bytes_per_second\");\n }\n Out << \",\";\n if (run.counters.find(\"items_per_second\") != run.counters.end()) {\n Out << run.counters.at(\"items_per_second\");\n }\n Out << \",\";\n if (!run.report_label.empty()) {\n Out << CsvEscape(run.report_label);\n }\n Out << \",,\"; // for error_occurred and error_message\n\n // Print user counters\n for (const auto& ucn : user_counter_names_) {\n auto it = run.counters.find(ucn);\n if (it == run.counters.end()) {\n Out << \",\";\n } else {\n Out << \",\" << it->second;\n }\n }\n Out << '\\n';\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/cycleclock.h", "content": "// ----------------------------------------------------------------------\n// CycleClock\n// A CycleClock tells you the current time in Cycles. The \"time\"\n// is actually time since power-on. This is like time() but doesn't\n// involve a system call and is much more precise.\n//\n// NOTE: Not all cpu/platform/kernel combinations guarantee that this\n// clock increments at a constant rate or is synchronized across all logical\n// cpus in a system.\n//\n// If you need the above guarantees, please consider using a different\n// API. There are efforts to provide an interface which provides a millisecond\n// granularity and implemented as a memory read. A memory read is generally\n// cheaper than the CycleClock for many architectures.\n//\n// Also, in some out of order CPU implementations, the CycleClock is not\n// serializing. So if you're trying to count at cycles granularity, your\n// data might be inaccurate due to out of order instruction execution.\n// ----------------------------------------------------------------------\n\n#ifndef BENCHMARK_CYCLECLOCK_H_\n#define BENCHMARK_CYCLECLOCK_H_\n\n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"internal_macros.h\"\n\n#if defined(BENCHMARK_OS_MACOSX)\n#include \n#endif\n// For MSVC, we want to use '_asm rdtsc' when possible (since it works\n// with even ancient MSVC compilers), and when not possible the\n// __rdtsc intrinsic, declared in . Unfortunately, in some\n// environments, and have conflicting\n// declarations of some other intrinsics, breaking compilation.\n// Therefore, we simply declare __rdtsc ourselves. See also\n// http://connect.microsoft.com/VisualStudio/feedback/details/262047\n#if defined(COMPILER_MSVC) && !defined(_M_IX86) && !defined(_M_ARM64) && \\\n !defined(_M_ARM64EC)\nextern \"C\" uint64_t __rdtsc();\n#pragma intrinsic(__rdtsc)\n#endif\n\n#if !defined(BENCHMARK_OS_WINDOWS) || defined(BENCHMARK_OS_MINGW)\n#include \n#include \n#endif\n\n#ifdef BENCHMARK_OS_EMSCRIPTEN\n#include \n#endif\n\nnamespace benchmark {\n// NOTE: only i386 and x86_64 have been well tested.\n// PPC, sparc, alpha, and ia64 are based on\n// http://peter.kuscsik.com/wordpress/?p=14\n// with modifications by m3b. See also\n// https://setisvn.ssl.berkeley.edu/svn/lib/fftw-3.0.1/kernel/cycle.h\nnamespace cycleclock {\n// This should return the number of cycles since power-on. Thread-safe.\ninline BENCHMARK_ALWAYS_INLINE int64_t Now() {\n#if defined(BENCHMARK_OS_MACOSX)\n // this goes at the top because we need ALL Macs, regardless of\n // architecture, to return the number of \"mach time units\" that\n // have passed since startup. See sysinfo.cc where\n // InitializeSystemInfo() sets the supposed cpu clock frequency of\n // macs to the number of mach time units per second, not actual\n // CPU clock frequency (which can change in the face of CPU\n // frequency scaling). Also note that when the Mac sleeps, this\n // counter pauses; it does not continue counting, nor does it\n // reset to zero.\n return mach_absolute_time();\n#elif defined(BENCHMARK_OS_EMSCRIPTEN)\n // this goes above x86-specific code because old versions of Emscripten\n // define __x86_64__, although they have nothing to do with it.\n return static_cast(emscripten_get_now() * 1e+6);\n#elif defined(__i386__)\n int64_t ret;\n __asm__ volatile(\"rdtsc\" : \"=A\"(ret));\n return ret;\n#elif defined(__x86_64__) || defined(__amd64__)\n uint64_t low, high;\n __asm__ volatile(\"rdtsc\" : \"=a\"(low), \"=d\"(high));\n return (high << 32) | low;\n#elif defined(__powerpc__) || defined(__ppc__)\n // This returns a time-base, which is not always precisely a cycle-count.\n#if defined(__powerpc64__) || defined(__ppc64__)\n int64_t tb;\n asm volatile(\"mfspr %0, 268\" : \"=r\"(tb));\n return tb;\n#else\n uint32_t tbl, tbu0, tbu1;\n asm volatile(\n \"mftbu %0\\n\"\n \"mftb %1\\n\"\n \"mftbu %2\"\n : \"=r\"(tbu0), \"=r\"(tbl), \"=r\"(tbu1));\n tbl &= -static_cast(tbu0 == tbu1);\n // high 32 bits in tbu1; low 32 bits in tbl (tbu0 is no longer needed)\n return (static_cast(tbu1) << 32) | tbl;\n#endif\n#elif defined(__sparc__)\n int64_t tick;\n asm(\".byte 0x83, 0x41, 0x00, 0x00\");\n asm(\"mov %%g1, %0\" : \"=r\"(tick));\n return tick;\n#elif defined(__ia64__)\n int64_t itc;\n asm(\"mov %0 = ar.itc\" : \"=r\"(itc));\n return itc;\n#elif defined(COMPILER_MSVC) && defined(_M_IX86)\n // Older MSVC compilers (like 7.x) don't seem to support the\n // __rdtsc intrinsic properly, so I prefer to use _asm instead\n // when I know it will work. Otherwise, I'll use __rdtsc and hope\n // the code is being compiled with a non-ancient compiler.\n _asm rdtsc\n#elif defined(COMPILER_MSVC) && (defined(_M_ARM64) || defined(_M_ARM64EC))\n // See // https://docs.microsoft.com/en-us/cpp/intrinsics/arm64-intrinsics\n // and https://reviews.llvm.org/D53115\n int64_t virtual_timer_value;\n virtual_timer_value = _ReadStatusReg(ARM64_CNTVCT);\n return virtual_timer_value;\n#elif defined(COMPILER_MSVC)\n return __rdtsc();\n#elif defined(BENCHMARK_OS_NACL)\n // Native Client validator on x86/x86-64 allows RDTSC instructions,\n // and this case is handled above. Native Client validator on ARM\n // rejects MRC instructions (used in the ARM-specific sequence below),\n // so we handle it here. Portable Native Client compiles to\n // architecture-agnostic bytecode, which doesn't provide any\n // cycle counter access mnemonics.\n\n // Native Client does not provide any API to access cycle counter.\n // Use clock_gettime(CLOCK_MONOTONIC, ...) instead of gettimeofday\n // because is provides nanosecond resolution (which is noticeable at\n // least for PNaCl modules running on x86 Mac & Linux).\n // Initialize to always return 0 if clock_gettime fails.\n struct timespec ts = {0, 0};\n clock_gettime(CLOCK_MONOTONIC, &ts);\n return static_cast(ts.tv_sec) * 1000000000 + ts.tv_nsec;\n#elif defined(__aarch64__)\n // System timer of ARMv8 runs at a different frequency than the CPU's.\n // The frequency is fixed, typically in the range 1-50MHz. It can be\n // read at CNTFRQ special register. We assume the OS has set up\n // the virtual timer properly.\n int64_t virtual_timer_value;\n asm volatile(\"mrs %0, cntvct_el0\" : \"=r\"(virtual_timer_value));\n return virtual_timer_value;\n#elif defined(__ARM_ARCH)\n // V6 is the earliest arch that has a standard cyclecount\n // Native Client validator doesn't allow MRC instructions.\n#if (__ARM_ARCH >= 6)\n uint32_t pmccntr;\n uint32_t pmuseren;\n uint32_t pmcntenset;\n // Read the user mode perf monitor counter access permissions.\n asm volatile(\"mrc p15, 0, %0, c9, c14, 0\" : \"=r\"(pmuseren));\n if (pmuseren & 1) { // Allows reading perfmon counters for user mode code.\n asm volatile(\"mrc p15, 0, %0, c9, c12, 1\" : \"=r\"(pmcntenset));\n if (pmcntenset & 0x80000000ul) { // Is it counting?\n asm volatile(\"mrc p15, 0, %0, c9, c13, 0\" : \"=r\"(pmccntr));\n // The counter is set up to count every 64th cycle\n return static_cast(pmccntr) * 64; // Should optimize to << 6\n }\n }\n#endif\n struct timeval tv;\n gettimeofday(&tv, nullptr);\n return static_cast(tv.tv_sec) * 1000000 + tv.tv_usec;\n#elif defined(__mips__) || defined(__m68k__)\n // mips apparently only allows rdtsc for superusers, so we fall\n // back to gettimeofday. It's possible clock_gettime would be better.\n struct timeval tv;\n gettimeofday(&tv, nullptr);\n return static_cast(tv.tv_sec) * 1000000 + tv.tv_usec;\n#elif defined(__loongarch__) || defined(__csky__)\n struct timeval tv;\n gettimeofday(&tv, nullptr);\n return static_cast(tv.tv_sec) * 1000000 + tv.tv_usec;\n#elif defined(__s390__) // Covers both s390 and s390x.\n // Return the CPU clock.\n uint64_t tsc;\n#if defined(BENCHMARK_OS_ZOS) && defined(COMPILER_IBMXL)\n // z/OS XL compiler HLASM syntax.\n asm(\" stck %0\" : \"=m\"(tsc) : : \"cc\");\n#else\n asm(\"stck %0\" : \"=Q\"(tsc) : : \"cc\");\n#endif\n return tsc;\n#elif defined(__riscv) // RISC-V\n // Use RDCYCLE (and RDCYCLEH on riscv32)\n#if __riscv_xlen == 32\n uint32_t cycles_lo, cycles_hi0, cycles_hi1;\n // This asm also includes the PowerPC overflow handling strategy, as above.\n // Implemented in assembly because Clang insisted on branching.\n asm volatile(\n \"rdcycleh %0\\n\"\n \"rdcycle %1\\n\"\n \"rdcycleh %2\\n\"\n \"sub %0, %0, %2\\n\"\n \"seqz %0, %0\\n\"\n \"sub %0, zero, %0\\n\"\n \"and %1, %1, %0\\n\"\n : \"=r\"(cycles_hi0), \"=r\"(cycles_lo), \"=r\"(cycles_hi1));\n return (static_cast(cycles_hi1) << 32) | cycles_lo;\n#else\n uint64_t cycles;\n asm volatile(\"rdcycle %0\" : \"=r\"(cycles));\n return cycles;\n#endif\n#elif defined(__e2k__) || defined(__elbrus__)\n struct timeval tv;\n gettimeofday(&tv, nullptr);\n return static_cast(tv.tv_sec) * 1000000 + tv.tv_usec;\n#elif defined(__hexagon__)\n uint64_t pcycle;\n asm volatile(\"%0 = C15:14\" : \"=r\"(pcycle));\n return static_cast(pcycle);\n#else\n// The soft failover to a generic implementation is automatic only for ARM.\n// For other platforms the developer is expected to make an attempt to create\n// a fast implementation and use generic version if nothing better is available.\n#error You need to define CycleTimer for your OS and CPU\n#endif\n}\n} // end namespace cycleclock\n} // end namespace benchmark\n\n#endif // BENCHMARK_CYCLECLOCK_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/internal_macros.h", "content": "#ifndef BENCHMARK_INTERNAL_MACROS_H_\n#define BENCHMARK_INTERNAL_MACROS_H_\n\n/* Needed to detect STL */\n#include \n\n// clang-format off\n\n#ifndef __has_feature\n#define __has_feature(x) 0\n#endif\n\n#if defined(__clang__)\n #if defined(__ibmxl__)\n #if !defined(COMPILER_IBMXL)\n #define COMPILER_IBMXL\n #endif\n #elif !defined(COMPILER_CLANG)\n #define COMPILER_CLANG\n #endif\n#elif defined(_MSC_VER)\n #if !defined(COMPILER_MSVC)\n #define COMPILER_MSVC\n #endif\n#elif defined(__GNUC__)\n #if !defined(COMPILER_GCC)\n #define COMPILER_GCC\n #endif\n#endif\n\n#if __has_feature(cxx_attributes)\n #define BENCHMARK_NORETURN [[noreturn]]\n#elif defined(__GNUC__)\n #define BENCHMARK_NORETURN __attribute__((noreturn))\n#elif defined(COMPILER_MSVC)\n #define BENCHMARK_NORETURN __declspec(noreturn)\n#else\n #define BENCHMARK_NORETURN\n#endif\n\n#if defined(__CYGWIN__)\n #define BENCHMARK_OS_CYGWIN 1\n#elif defined(_WIN32)\n #define BENCHMARK_OS_WINDOWS 1\n // WINAPI_FAMILY_PARTITION is defined in winapifamily.h.\n // We include windows.h which implicitly includes winapifamily.h for compatibility.\n #ifndef NOMINMAX\n #define NOMINMAX\n #endif\n #include \n #if defined(WINAPI_FAMILY_PARTITION)\n #if WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_DESKTOP)\n #define BENCHMARK_OS_WINDOWS_WIN32 1\n #elif WINAPI_FAMILY_PARTITION(WINAPI_PARTITION_APP)\n #define BENCHMARK_OS_WINDOWS_RT 1\n #endif\n #endif\n #if defined(__MINGW32__)\n #define BENCHMARK_OS_MINGW 1\n #endif\n#elif defined(__APPLE__)\n #define BENCHMARK_OS_APPLE 1\n #include \"TargetConditionals.h\"\n #if defined(TARGET_OS_MAC)\n #define BENCHMARK_OS_MACOSX 1\n #if defined(TARGET_OS_IPHONE)\n #define BENCHMARK_OS_IOS 1\n #endif\n #endif\n#elif defined(__FreeBSD__)\n #define BENCHMARK_OS_FREEBSD 1\n#elif defined(__NetBSD__)\n #define BENCHMARK_OS_NETBSD 1\n#elif defined(__OpenBSD__)\n #define BENCHMARK_OS_OPENBSD 1\n#elif defined(__DragonFly__)\n #define BENCHMARK_OS_DRAGONFLY 1\n#elif defined(__linux__)\n #define BENCHMARK_OS_LINUX 1\n#elif defined(__native_client__)\n #define BENCHMARK_OS_NACL 1\n#elif defined(__EMSCRIPTEN__)\n #define BENCHMARK_OS_EMSCRIPTEN 1\n#elif defined(__rtems__)\n #define BENCHMARK_OS_RTEMS 1\n#elif defined(__Fuchsia__)\n#define BENCHMARK_OS_FUCHSIA 1\n#elif defined (__SVR4) && defined (__sun)\n#define BENCHMARK_OS_SOLARIS 1\n#elif defined(__QNX__)\n#define BENCHMARK_OS_QNX 1\n#elif defined(__MVS__)\n#define BENCHMARK_OS_ZOS 1\n#elif defined(__hexagon__)\n#define BENCHMARK_OS_QURT 1\n#endif\n\n#if defined(__ANDROID__) && defined(__GLIBCXX__)\n#define BENCHMARK_STL_ANDROID_GNUSTL 1\n#endif\n\n#if !__has_feature(cxx_exceptions) && !defined(__cpp_exceptions) \\\n && !defined(__EXCEPTIONS)\n #define BENCHMARK_HAS_NO_EXCEPTIONS\n#endif\n\n#if defined(COMPILER_CLANG) || defined(COMPILER_GCC)\n #define BENCHMARK_MAYBE_UNUSED __attribute__((unused))\n#else\n #define BENCHMARK_MAYBE_UNUSED\n#endif\n\n// clang-format on\n\n#endif // BENCHMARK_INTERNAL_MACROS_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/json_reporter.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \n#include \n#include \n#include // for setprecision\n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"complexity.h\"\n#include \"string_util.h\"\n#include \"timers.h\"\n\nnamespace benchmark {\nnamespace {\n\nstd::string StrEscape(const std::string& s) {\n std::string tmp;\n tmp.reserve(s.size());\n for (char c : s) {\n switch (c) {\n case '\\b':\n tmp += \"\\\\b\";\n break;\n case '\\f':\n tmp += \"\\\\f\";\n break;\n case '\\n':\n tmp += \"\\\\n\";\n break;\n case '\\r':\n tmp += \"\\\\r\";\n break;\n case '\\t':\n tmp += \"\\\\t\";\n break;\n case '\\\\':\n tmp += \"\\\\\\\\\";\n break;\n case '\"':\n tmp += \"\\\\\\\"\";\n break;\n default:\n tmp += c;\n break;\n }\n }\n return tmp;\n}\n\nstd::string FormatKV(std::string const& key, std::string const& value) {\n return StrFormat(\"\\\"%s\\\": \\\"%s\\\"\", StrEscape(key).c_str(),\n StrEscape(value).c_str());\n}\n\nstd::string FormatKV(std::string const& key, const char* value) {\n return StrFormat(\"\\\"%s\\\": \\\"%s\\\"\", StrEscape(key).c_str(),\n StrEscape(value).c_str());\n}\n\nstd::string FormatKV(std::string const& key, bool value) {\n return StrFormat(\"\\\"%s\\\": %s\", StrEscape(key).c_str(),\n value ? \"true\" : \"false\");\n}\n\nstd::string FormatKV(std::string const& key, int64_t value) {\n std::stringstream ss;\n ss << '\"' << StrEscape(key) << \"\\\": \" << value;\n return ss.str();\n}\n\nstd::string FormatKV(std::string const& key, double value) {\n std::stringstream ss;\n ss << '\"' << StrEscape(key) << \"\\\": \";\n\n if (std::isnan(value))\n ss << (value < 0 ? \"-\" : \"\") << \"NaN\";\n else if (std::isinf(value))\n ss << (value < 0 ? \"-\" : \"\") << \"Infinity\";\n else {\n const auto max_digits10 =\n std::numeric_limits::max_digits10;\n const auto max_fractional_digits10 = max_digits10 - 1;\n ss << std::scientific << std::setprecision(max_fractional_digits10)\n << value;\n }\n return ss.str();\n}\n\nint64_t RoundDouble(double v) { return std::lround(v); }\n\n} // end namespace\n\nbool JSONReporter::ReportContext(const Context& context) {\n std::ostream& out = GetOutputStream();\n\n out << \"{\\n\";\n std::string inner_indent(2, ' ');\n\n // Open context block and print context information.\n out << inner_indent << \"\\\"context\\\": {\\n\";\n std::string indent(4, ' ');\n\n std::string walltime_value = LocalDateTimeString();\n out << indent << FormatKV(\"date\", walltime_value) << \",\\n\";\n\n out << indent << FormatKV(\"host_name\", context.sys_info.name) << \",\\n\";\n\n if (Context::executable_name) {\n out << indent << FormatKV(\"executable\", Context::executable_name) << \",\\n\";\n }\n\n CPUInfo const& info = context.cpu_info;\n out << indent << FormatKV(\"num_cpus\", static_cast(info.num_cpus))\n << \",\\n\";\n out << indent\n << FormatKV(\"mhz_per_cpu\",\n RoundDouble(info.cycles_per_second / 1000000.0))\n << \",\\n\";\n if (CPUInfo::Scaling::UNKNOWN != info.scaling) {\n out << indent\n << FormatKV(\"cpu_scaling_enabled\",\n info.scaling == CPUInfo::Scaling::ENABLED ? true : false)\n << \",\\n\";\n }\n\n out << indent << \"\\\"caches\\\": [\\n\";\n indent = std::string(6, ' ');\n std::string cache_indent(8, ' ');\n for (size_t i = 0; i < info.caches.size(); ++i) {\n auto& CI = info.caches[i];\n out << indent << \"{\\n\";\n out << cache_indent << FormatKV(\"type\", CI.type) << \",\\n\";\n out << cache_indent << FormatKV(\"level\", static_cast(CI.level))\n << \",\\n\";\n out << cache_indent << FormatKV(\"size\", static_cast(CI.size))\n << \",\\n\";\n out << cache_indent\n << FormatKV(\"num_sharing\", static_cast(CI.num_sharing))\n << \"\\n\";\n out << indent << \"}\";\n if (i != info.caches.size() - 1) out << \",\";\n out << \"\\n\";\n }\n indent = std::string(4, ' ');\n out << indent << \"],\\n\";\n out << indent << \"\\\"load_avg\\\": [\";\n for (auto it = info.load_avg.begin(); it != info.load_avg.end();) {\n out << *it++;\n if (it != info.load_avg.end()) out << \",\";\n }\n out << \"],\\n\";\n\n#if defined(NDEBUG)\n const char build_type[] = \"release\";\n#else\n const char build_type[] = \"debug\";\n#endif\n out << indent << FormatKV(\"library_build_type\", build_type);\n\n std::map* global_context =\n internal::GetGlobalContext();\n\n if (global_context != nullptr) {\n for (const auto& kv : *global_context) {\n out << \",\\n\";\n out << indent << FormatKV(kv.first, kv.second);\n }\n }\n out << \"\\n\";\n\n // Close context block and open the list of benchmarks.\n out << inner_indent << \"},\\n\";\n out << inner_indent << \"\\\"benchmarks\\\": [\\n\";\n return true;\n}\n\nvoid JSONReporter::ReportRuns(std::vector const& reports) {\n if (reports.empty()) {\n return;\n }\n std::string indent(4, ' ');\n std::ostream& out = GetOutputStream();\n if (!first_report_) {\n out << \",\\n\";\n }\n first_report_ = false;\n\n for (auto it = reports.begin(); it != reports.end(); ++it) {\n out << indent << \"{\\n\";\n PrintRunData(*it);\n out << indent << '}';\n auto it_cp = it;\n if (++it_cp != reports.end()) {\n out << \",\\n\";\n }\n }\n}\n\nvoid JSONReporter::Finalize() {\n // Close the list of benchmarks and the top level object.\n GetOutputStream() << \"\\n ]\\n}\\n\";\n}\n\nvoid JSONReporter::PrintRunData(Run const& run) {\n std::string indent(6, ' ');\n std::ostream& out = GetOutputStream();\n out << indent << FormatKV(\"name\", run.benchmark_name()) << \",\\n\";\n out << indent << FormatKV(\"family_index\", run.family_index) << \",\\n\";\n out << indent\n << FormatKV(\"per_family_instance_index\", run.per_family_instance_index)\n << \",\\n\";\n out << indent << FormatKV(\"run_name\", run.run_name.str()) << \",\\n\";\n out << indent << FormatKV(\"run_type\", [&run]() -> const char* {\n switch (run.run_type) {\n case BenchmarkReporter::Run::RT_Iteration:\n return \"iteration\";\n case BenchmarkReporter::Run::RT_Aggregate:\n return \"aggregate\";\n }\n BENCHMARK_UNREACHABLE();\n }()) << \",\\n\";\n out << indent << FormatKV(\"repetitions\", run.repetitions) << \",\\n\";\n if (run.run_type != BenchmarkReporter::Run::RT_Aggregate) {\n out << indent << FormatKV(\"repetition_index\", run.repetition_index)\n << \",\\n\";\n }\n out << indent << FormatKV(\"threads\", run.threads) << \",\\n\";\n if (run.run_type == BenchmarkReporter::Run::RT_Aggregate) {\n out << indent << FormatKV(\"aggregate_name\", run.aggregate_name) << \",\\n\";\n out << indent << FormatKV(\"aggregate_unit\", [&run]() -> const char* {\n switch (run.aggregate_unit) {\n case StatisticUnit::kTime:\n return \"time\";\n case StatisticUnit::kPercentage:\n return \"percentage\";\n }\n BENCHMARK_UNREACHABLE();\n }()) << \",\\n\";\n }\n if (internal::SkippedWithError == run.skipped) {\n out << indent << FormatKV(\"error_occurred\", true) << \",\\n\";\n out << indent << FormatKV(\"error_message\", run.skip_message) << \",\\n\";\n } else if (internal::SkippedWithMessage == run.skipped) {\n out << indent << FormatKV(\"skipped\", true) << \",\\n\";\n out << indent << FormatKV(\"skip_message\", run.skip_message) << \",\\n\";\n }\n if (!run.report_big_o && !run.report_rms) {\n out << indent << FormatKV(\"iterations\", run.iterations) << \",\\n\";\n if (run.run_type != Run::RT_Aggregate ||\n run.aggregate_unit == StatisticUnit::kTime) {\n out << indent << FormatKV(\"real_time\", run.GetAdjustedRealTime())\n << \",\\n\";\n out << indent << FormatKV(\"cpu_time\", run.GetAdjustedCPUTime());\n } else {\n assert(run.aggregate_unit == StatisticUnit::kPercentage);\n out << indent << FormatKV(\"real_time\", run.real_accumulated_time)\n << \",\\n\";\n out << indent << FormatKV(\"cpu_time\", run.cpu_accumulated_time);\n }\n out << \",\\n\"\n << indent << FormatKV(\"time_unit\", GetTimeUnitString(run.time_unit));\n } else if (run.report_big_o) {\n out << indent << FormatKV(\"cpu_coefficient\", run.GetAdjustedCPUTime())\n << \",\\n\";\n out << indent << FormatKV(\"real_coefficient\", run.GetAdjustedRealTime())\n << \",\\n\";\n out << indent << FormatKV(\"big_o\", GetBigOString(run.complexity)) << \",\\n\";\n out << indent << FormatKV(\"time_unit\", GetTimeUnitString(run.time_unit));\n } else if (run.report_rms) {\n out << indent << FormatKV(\"rms\", run.GetAdjustedCPUTime());\n }\n\n for (auto& c : run.counters) {\n out << \",\\n\" << indent << FormatKV(c.first, c.second);\n }\n\n if (run.memory_result) {\n const MemoryManager::Result memory_result = *run.memory_result;\n out << \",\\n\" << indent << FormatKV(\"allocs_per_iter\", run.allocs_per_iter);\n out << \",\\n\"\n << indent << FormatKV(\"max_bytes_used\", memory_result.max_bytes_used);\n\n auto report_if_present = [&out, &indent](const std::string& label,\n int64_t val) {\n if (val != MemoryManager::TombstoneValue)\n out << \",\\n\" << indent << FormatKV(label, val);\n };\n\n report_if_present(\"total_allocated_bytes\",\n memory_result.total_allocated_bytes);\n report_if_present(\"net_heap_growth\", memory_result.net_heap_growth);\n }\n\n if (!run.report_label.empty()) {\n out << \",\\n\" << indent << FormatKV(\"label\", run.report_label);\n }\n out << '\\n';\n}\n\nconst int64_t MemoryManager::TombstoneValue =\n std::numeric_limits::max();\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/log.h", "content": "#ifndef BENCHMARK_LOG_H_\n#define BENCHMARK_LOG_H_\n\n#include \n#include \n\n// NOTE: this is also defined in benchmark.h but we're trying to avoid a\n// dependency.\n// The _MSVC_LANG check should detect Visual Studio 2015 Update 3 and newer.\n#if __cplusplus >= 201103L || (defined(_MSVC_LANG) && _MSVC_LANG >= 201103L)\n#define BENCHMARK_HAS_CXX11\n#endif\n\nnamespace benchmark {\nnamespace internal {\n\ntypedef std::basic_ostream&(EndLType)(std::basic_ostream&);\n\nclass LogType {\n friend LogType& GetNullLogInstance();\n friend LogType& GetErrorLogInstance();\n\n // FIXME: Add locking to output.\n template \n friend LogType& operator<<(LogType&, Tp const&);\n friend LogType& operator<<(LogType&, EndLType*);\n\n private:\n LogType(std::ostream* out) : out_(out) {}\n std::ostream* out_;\n\n // NOTE: we could use BENCHMARK_DISALLOW_COPY_AND_ASSIGN but we shouldn't have\n // a dependency on benchmark.h from here.\n#ifndef BENCHMARK_HAS_CXX11\n LogType(const LogType&);\n LogType& operator=(const LogType&);\n#else\n LogType(const LogType&) = delete;\n LogType& operator=(const LogType&) = delete;\n#endif\n};\n\ntemplate \nLogType& operator<<(LogType& log, Tp const& value) {\n if (log.out_) {\n *log.out_ << value;\n }\n return log;\n}\n\ninline LogType& operator<<(LogType& log, EndLType* m) {\n if (log.out_) {\n *log.out_ << m;\n }\n return log;\n}\n\ninline int& LogLevel() {\n static int log_level = 0;\n return log_level;\n}\n\ninline LogType& GetNullLogInstance() {\n static LogType null_log(static_cast(nullptr));\n return null_log;\n}\n\ninline LogType& GetErrorLogInstance() {\n static LogType error_log(&std::clog);\n return error_log;\n}\n\ninline LogType& GetLogInstanceForLevel(int level) {\n if (level <= LogLevel()) {\n return GetErrorLogInstance();\n }\n return GetNullLogInstance();\n}\n\n} // end namespace internal\n} // end namespace benchmark\n\n// clang-format off\n#define BM_VLOG(x) \\\n (::benchmark::internal::GetLogInstanceForLevel(x) << \"-- LOG(\" << x << \"):\" \\\n \" \")\n// clang-format on\n#endif\n" }, { "path": "3rd/benchmark-1.8.2/src/mutex.h", "content": "#ifndef BENCHMARK_MUTEX_H_\n#define BENCHMARK_MUTEX_H_\n\n#include \n#include \n\n#include \"check.h\"\n\n// Enable thread safety attributes only with clang.\n// The attributes can be safely erased when compiling with other compilers.\n#if defined(HAVE_THREAD_SAFETY_ATTRIBUTES)\n#define THREAD_ANNOTATION_ATTRIBUTE_(x) __attribute__((x))\n#else\n#define THREAD_ANNOTATION_ATTRIBUTE_(x) // no-op\n#endif\n\n#define CAPABILITY(x) THREAD_ANNOTATION_ATTRIBUTE_(capability(x))\n\n#define SCOPED_CAPABILITY THREAD_ANNOTATION_ATTRIBUTE_(scoped_lockable)\n\n#define GUARDED_BY(x) THREAD_ANNOTATION_ATTRIBUTE_(guarded_by(x))\n\n#define PT_GUARDED_BY(x) THREAD_ANNOTATION_ATTRIBUTE_(pt_guarded_by(x))\n\n#define ACQUIRED_BEFORE(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(acquired_before(__VA_ARGS__))\n\n#define ACQUIRED_AFTER(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(acquired_after(__VA_ARGS__))\n\n#define REQUIRES(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(requires_capability(__VA_ARGS__))\n\n#define REQUIRES_SHARED(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(requires_shared_capability(__VA_ARGS__))\n\n#define ACQUIRE(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(acquire_capability(__VA_ARGS__))\n\n#define ACQUIRE_SHARED(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(acquire_shared_capability(__VA_ARGS__))\n\n#define RELEASE(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(release_capability(__VA_ARGS__))\n\n#define RELEASE_SHARED(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(release_shared_capability(__VA_ARGS__))\n\n#define TRY_ACQUIRE(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(try_acquire_capability(__VA_ARGS__))\n\n#define TRY_ACQUIRE_SHARED(...) \\\n THREAD_ANNOTATION_ATTRIBUTE_(try_acquire_shared_capability(__VA_ARGS__))\n\n#define EXCLUDES(...) THREAD_ANNOTATION_ATTRIBUTE_(locks_excluded(__VA_ARGS__))\n\n#define ASSERT_CAPABILITY(x) THREAD_ANNOTATION_ATTRIBUTE_(assert_capability(x))\n\n#define ASSERT_SHARED_CAPABILITY(x) \\\n THREAD_ANNOTATION_ATTRIBUTE_(assert_shared_capability(x))\n\n#define RETURN_CAPABILITY(x) THREAD_ANNOTATION_ATTRIBUTE_(lock_returned(x))\n\n#define NO_THREAD_SAFETY_ANALYSIS \\\n THREAD_ANNOTATION_ATTRIBUTE_(no_thread_safety_analysis)\n\nnamespace benchmark {\n\ntypedef std::condition_variable Condition;\n\n// NOTE: Wrappers for std::mutex and std::unique_lock are provided so that\n// we can annotate them with thread safety attributes and use the\n// -Wthread-safety warning with clang. The standard library types cannot be\n// used directly because they do not provide the required annotations.\nclass CAPABILITY(\"mutex\") Mutex {\n public:\n Mutex() {}\n\n void lock() ACQUIRE() { mut_.lock(); }\n void unlock() RELEASE() { mut_.unlock(); }\n std::mutex& native_handle() { return mut_; }\n\n private:\n std::mutex mut_;\n};\n\nclass SCOPED_CAPABILITY MutexLock {\n typedef std::unique_lock MutexLockImp;\n\n public:\n MutexLock(Mutex& m) ACQUIRE(m) : ml_(m.native_handle()) {}\n ~MutexLock() RELEASE() {}\n MutexLockImp& native_handle() { return ml_; }\n\n private:\n MutexLockImp ml_;\n};\n\nclass Barrier {\n public:\n Barrier(int num_threads) : running_threads_(num_threads) {}\n\n // Called by each thread\n bool wait() EXCLUDES(lock_) {\n bool last_thread = false;\n {\n MutexLock ml(lock_);\n last_thread = createBarrier(ml);\n }\n if (last_thread) phase_condition_.notify_all();\n return last_thread;\n }\n\n void removeThread() EXCLUDES(lock_) {\n MutexLock ml(lock_);\n --running_threads_;\n if (entered_ != 0) phase_condition_.notify_all();\n }\n\n private:\n Mutex lock_;\n Condition phase_condition_;\n int running_threads_;\n\n // State for barrier management\n int phase_number_ = 0;\n int entered_ = 0; // Number of threads that have entered this barrier\n\n // Enter the barrier and wait until all other threads have also\n // entered the barrier. Returns iff this is the last thread to\n // enter the barrier.\n bool createBarrier(MutexLock& ml) REQUIRES(lock_) {\n BM_CHECK_LT(entered_, running_threads_);\n entered_++;\n if (entered_ < running_threads_) {\n // Wait for all threads to enter\n int phase_number_cp = phase_number_;\n auto cb = [this, phase_number_cp]() {\n return this->phase_number_ > phase_number_cp ||\n entered_ == running_threads_; // A thread has aborted in error\n };\n phase_condition_.wait(ml.native_handle(), cb);\n if (phase_number_ > phase_number_cp) return false;\n // else (running_threads_ == entered_) and we are the last thread.\n }\n // Last thread has reached the barrier\n phase_number_++;\n entered_ = 0;\n return true;\n }\n};\n\n} // end namespace benchmark\n\n#endif // BENCHMARK_MUTEX_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/perf_counters.cc", "content": "// Copyright 2021 Google Inc. 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// 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#include \"perf_counters.h\"\n\n#include \n#include \n#include \n\n#if defined HAVE_LIBPFM\n#include \"perfmon/pfmlib.h\"\n#include \"perfmon/pfmlib_perf_event.h\"\n#endif\n\nnamespace benchmark {\nnamespace internal {\n\nconstexpr size_t PerfCounterValues::kMaxCounters;\n\n#if defined HAVE_LIBPFM\n\nsize_t PerfCounterValues::Read(const std::vector& leaders) {\n // Create a pointer for multiple reads\n const size_t bufsize = values_.size() * sizeof(values_[0]);\n char* ptr = reinterpret_cast(values_.data());\n size_t size = bufsize;\n for (int lead : leaders) {\n auto read_bytes = ::read(lead, ptr, size);\n if (read_bytes >= ssize_t(sizeof(uint64_t))) {\n // Actual data bytes are all bytes minus initial padding\n std::size_t data_bytes = read_bytes - sizeof(uint64_t);\n // This should be very cheap since it's in hot cache\n std::memmove(ptr, ptr + sizeof(uint64_t), data_bytes);\n // Increment our counters\n ptr += data_bytes;\n size -= data_bytes;\n } else {\n int err = errno;\n GetErrorLogInstance() << \"Error reading lead \" << lead << \" errno:\" << err\n << \" \" << ::strerror(err) << \"\\n\";\n return 0;\n }\n }\n return (bufsize - size) / sizeof(uint64_t);\n}\n\nconst bool PerfCounters::kSupported = true;\n\nbool PerfCounters::Initialize() { return pfm_initialize() == PFM_SUCCESS; }\n\nbool PerfCounters::IsCounterSupported(const std::string& name) {\n perf_event_attr_t attr;\n std::memset(&attr, 0, sizeof(attr));\n pfm_perf_encode_arg_t arg;\n std::memset(&arg, 0, sizeof(arg));\n arg.attr = &attr;\n const int mode = PFM_PLM3; // user mode only\n int ret = pfm_get_os_event_encoding(name.c_str(), mode, PFM_OS_PERF_EVENT_EXT,\n &arg);\n return (ret == PFM_SUCCESS);\n}\n\nPerfCounters PerfCounters::Create(\n const std::vector& counter_names) {\n // Valid counters will populate these arrays but we start empty\n std::vector valid_names;\n std::vector counter_ids;\n std::vector leader_ids;\n\n // Resize to the maximum possible\n valid_names.reserve(counter_names.size());\n counter_ids.reserve(counter_names.size());\n\n const int kCounterMode = PFM_PLM3; // user mode only\n\n // Group leads will be assigned on demand. The idea is that once we cannot\n // create a counter descriptor, the reason is that this group has maxed out\n // so we set the group_id again to -1 and retry - giving the algorithm a\n // chance to create a new group leader to hold the next set of counters.\n int group_id = -1;\n\n // Loop through all performance counters\n for (size_t i = 0; i < counter_names.size(); ++i) {\n // we are about to push into the valid names vector\n // check if we did not reach the maximum\n if (valid_names.size() == PerfCounterValues::kMaxCounters) {\n // Log a message if we maxed out and stop adding\n GetErrorLogInstance()\n << counter_names.size() << \" counters were requested. The maximum is \"\n << PerfCounterValues::kMaxCounters << \" and \" << valid_names.size()\n << \" were already added. All remaining counters will be ignored\\n\";\n // stop the loop and return what we have already\n break;\n }\n\n // Check if this name is empty\n const auto& name = counter_names[i];\n if (name.empty()) {\n GetErrorLogInstance()\n << \"A performance counter name was the empty string\\n\";\n continue;\n }\n\n // Here first means first in group, ie the group leader\n const bool is_first = (group_id < 0);\n\n // This struct will be populated by libpfm from the counter string\n // and then fed into the syscall perf_event_open\n struct perf_event_attr attr {};\n attr.size = sizeof(attr);\n\n // This is the input struct to libpfm.\n pfm_perf_encode_arg_t arg{};\n arg.attr = &attr;\n const int pfm_get = pfm_get_os_event_encoding(name.c_str(), kCounterMode,\n PFM_OS_PERF_EVENT, &arg);\n if (pfm_get != PFM_SUCCESS) {\n GetErrorLogInstance()\n << \"Unknown performance counter name: \" << name << \"\\n\";\n continue;\n }\n\n // We then proceed to populate the remaining fields in our attribute struct\n // Note: the man page for perf_event_create suggests inherit = true and\n // read_format = PERF_FORMAT_GROUP don't work together, but that's not the\n // case.\n attr.disabled = is_first;\n attr.inherit = true;\n attr.pinned = is_first;\n attr.exclude_kernel = true;\n attr.exclude_user = false;\n attr.exclude_hv = true;\n\n // Read all counters in a group in one read.\n attr.read_format = PERF_FORMAT_GROUP;\n\n int id = -1;\n while (id < 0) {\n static constexpr size_t kNrOfSyscallRetries = 5;\n // Retry syscall as it was interrupted often (b/64774091).\n for (size_t num_retries = 0; num_retries < kNrOfSyscallRetries;\n ++num_retries) {\n id = perf_event_open(&attr, 0, -1, group_id, 0);\n if (id >= 0 || errno != EINTR) {\n break;\n }\n }\n if (id < 0) {\n // If the file descriptor is negative we might have reached a limit\n // in the current group. Set the group_id to -1 and retry\n if (group_id >= 0) {\n // Create a new group\n group_id = -1;\n } else {\n // At this point we have already retried to set a new group id and\n // failed. We then give up.\n break;\n }\n }\n }\n\n // We failed to get a new file descriptor. We might have reached a hard\n // hardware limit that cannot be resolved even with group multiplexing\n if (id < 0) {\n GetErrorLogInstance() << \"***WARNING** Failed to get a file descriptor \"\n \"for performance counter \"\n << name << \". Ignoring\\n\";\n\n // We give up on this counter but try to keep going\n // as the others would be fine\n continue;\n }\n if (group_id < 0) {\n // This is a leader, store and assign it to the current file descriptor\n leader_ids.push_back(id);\n group_id = id;\n }\n // This is a valid counter, add it to our descriptor's list\n counter_ids.push_back(id);\n valid_names.push_back(name);\n }\n\n // Loop through all group leaders activating them\n // There is another option of starting ALL counters in a process but\n // that would be far reaching an intrusion. If the user is using PMCs\n // by themselves then this would have a side effect on them. It is\n // friendlier to loop through all groups individually.\n for (int lead : leader_ids) {\n if (ioctl(lead, PERF_EVENT_IOC_ENABLE) != 0) {\n // This should never happen but if it does, we give up on the\n // entire batch as recovery would be a mess.\n GetErrorLogInstance() << \"***WARNING*** Failed to start counters. \"\n \"Claring out all counters.\\n\";\n\n // Close all peformance counters\n for (int id : counter_ids) {\n ::close(id);\n }\n\n // Return an empty object so our internal state is still good and\n // the process can continue normally without impact\n return NoCounters();\n }\n }\n\n return PerfCounters(std::move(valid_names), std::move(counter_ids),\n std::move(leader_ids));\n}\n\nvoid PerfCounters::CloseCounters() const {\n if (counter_ids_.empty()) {\n return;\n }\n for (int lead : leader_ids_) {\n ioctl(lead, PERF_EVENT_IOC_DISABLE);\n }\n for (int fd : counter_ids_) {\n close(fd);\n }\n}\n#else // defined HAVE_LIBPFM\nsize_t PerfCounterValues::Read(const std::vector&) { return 0; }\n\nconst bool PerfCounters::kSupported = false;\n\nbool PerfCounters::Initialize() { return false; }\n\nbool PerfCounters::IsCounterSupported(const std::string&) { return false; }\n\nPerfCounters PerfCounters::Create(\n const std::vector& counter_names) {\n if (!counter_names.empty()) {\n GetErrorLogInstance() << \"Performance counters not supported.\";\n }\n return NoCounters();\n}\n\nvoid PerfCounters::CloseCounters() const {}\n#endif // defined HAVE_LIBPFM\n\nPerfCountersMeasurement::PerfCountersMeasurement(\n const std::vector& counter_names)\n : start_values_(counter_names.size()), end_values_(counter_names.size()) {\n counters_ = PerfCounters::Create(counter_names);\n}\n\nPerfCounters& PerfCounters::operator=(PerfCounters&& other) noexcept {\n if (this != &other) {\n CloseCounters();\n\n counter_ids_ = std::move(other.counter_ids_);\n leader_ids_ = std::move(other.leader_ids_);\n counter_names_ = std::move(other.counter_names_);\n }\n return *this;\n}\n} // namespace internal\n} // namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/perf_counters.h", "content": "// Copyright 2021 Google Inc. 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// 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#ifndef BENCHMARK_PERF_COUNTERS_H\n#define BENCHMARK_PERF_COUNTERS_H\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"check.h\"\n#include \"log.h\"\n#include \"mutex.h\"\n\n#ifndef BENCHMARK_OS_WINDOWS\n#include \n#endif\n\n#if defined(_MSC_VER)\n#pragma warning(push)\n// C4251: needs to have dll-interface to be used by clients of class\n#pragma warning(disable : 4251)\n#endif\n\nnamespace benchmark {\nnamespace internal {\n\n// Typically, we can only read a small number of counters. There is also a\n// padding preceding counter values, when reading multiple counters with one\n// syscall (which is desirable). PerfCounterValues abstracts these details.\n// The implementation ensures the storage is inlined, and allows 0-based\n// indexing into the counter values.\n// The object is used in conjunction with a PerfCounters object, by passing it\n// to Snapshot(). The Read() method relocates individual reads, discarding\n// the initial padding from each group leader in the values buffer such that\n// all user accesses through the [] operator are correct.\nclass BENCHMARK_EXPORT PerfCounterValues {\n public:\n explicit PerfCounterValues(size_t nr_counters) : nr_counters_(nr_counters) {\n BM_CHECK_LE(nr_counters_, kMaxCounters);\n }\n\n // We are reading correctly now so the values don't need to skip padding\n uint64_t operator[](size_t pos) const { return values_[pos]; }\n\n // Increased the maximum to 32 only since the buffer\n // is std::array<> backed\n static constexpr size_t kMaxCounters = 32;\n\n private:\n friend class PerfCounters;\n // Get the byte buffer in which perf counters can be captured.\n // This is used by PerfCounters::Read\n std::pair get_data_buffer() {\n return {reinterpret_cast(values_.data()),\n sizeof(uint64_t) * (kPadding + nr_counters_)};\n }\n\n // This reading is complex and as the goal of this class is to\n // abstract away the intrincacies of the reading process, this is\n // a better place for it\n size_t Read(const std::vector& leaders);\n\n // Move the padding to 2 due to the reading algorithm (1st padding plus a\n // current read padding)\n static constexpr size_t kPadding = 2;\n std::array values_;\n const size_t nr_counters_;\n};\n\n// Collect PMU counters. The object, once constructed, is ready to be used by\n// calling read(). PMU counter collection is enabled from the time create() is\n// called, to obtain the object, until the object's destructor is called.\nclass BENCHMARK_EXPORT PerfCounters final {\n public:\n // True iff this platform supports performance counters.\n static const bool kSupported;\n\n // Returns an empty object\n static PerfCounters NoCounters() { return PerfCounters(); }\n\n ~PerfCounters() { CloseCounters(); }\n PerfCounters() = default;\n PerfCounters(PerfCounters&&) = default;\n PerfCounters(const PerfCounters&) = delete;\n PerfCounters& operator=(PerfCounters&&) noexcept;\n PerfCounters& operator=(const PerfCounters&) = delete;\n\n // Platform-specific implementations may choose to do some library\n // initialization here.\n static bool Initialize();\n\n // Check if the given counter is supported, if the app wants to\n // check before passing\n static bool IsCounterSupported(const std::string& name);\n\n // Return a PerfCounters object ready to read the counters with the names\n // specified. The values are user-mode only. The counter name format is\n // implementation and OS specific.\n // In case of failure, this method will in the worst case return an\n // empty object whose state will still be valid.\n static PerfCounters Create(const std::vector& counter_names);\n\n // Take a snapshot of the current value of the counters into the provided\n // valid PerfCounterValues storage. The values are populated such that:\n // names()[i]'s value is (*values)[i]\n BENCHMARK_ALWAYS_INLINE bool Snapshot(PerfCounterValues* values) const {\n#ifndef BENCHMARK_OS_WINDOWS\n assert(values != nullptr);\n return values->Read(leader_ids_) == counter_ids_.size();\n#else\n (void)values;\n return false;\n#endif\n }\n\n const std::vector& names() const { return counter_names_; }\n size_t num_counters() const { return counter_names_.size(); }\n\n private:\n PerfCounters(const std::vector& counter_names,\n std::vector&& counter_ids, std::vector&& leader_ids)\n : counter_ids_(std::move(counter_ids)),\n leader_ids_(std::move(leader_ids)),\n counter_names_(counter_names) {}\n\n void CloseCounters() const;\n\n std::vector counter_ids_;\n std::vector leader_ids_;\n std::vector counter_names_;\n};\n\n// Typical usage of the above primitives.\nclass BENCHMARK_EXPORT PerfCountersMeasurement final {\n public:\n PerfCountersMeasurement(const std::vector& counter_names);\n\n size_t num_counters() const { return counters_.num_counters(); }\n\n std::vector names() const { return counters_.names(); }\n\n BENCHMARK_ALWAYS_INLINE bool Start() {\n if (num_counters() == 0) return true;\n // Tell the compiler to not move instructions above/below where we take\n // the snapshot.\n ClobberMemory();\n valid_read_ &= counters_.Snapshot(&start_values_);\n ClobberMemory();\n\n return valid_read_;\n }\n\n BENCHMARK_ALWAYS_INLINE bool Stop(\n std::vector>& measurements) {\n if (num_counters() == 0) return true;\n // Tell the compiler to not move instructions above/below where we take\n // the snapshot.\n ClobberMemory();\n valid_read_ &= counters_.Snapshot(&end_values_);\n ClobberMemory();\n\n for (size_t i = 0; i < counters_.names().size(); ++i) {\n double measurement = static_cast(end_values_[i]) -\n static_cast(start_values_[i]);\n measurements.push_back({counters_.names()[i], measurement});\n }\n\n return valid_read_;\n }\n\n private:\n PerfCounters counters_;\n bool valid_read_ = true;\n PerfCounterValues start_values_;\n PerfCounterValues end_values_;\n};\n\nBENCHMARK_UNUSED static bool perf_init_anchor = PerfCounters::Initialize();\n\n} // namespace internal\n} // namespace benchmark\n\n#if defined(_MSC_VER)\n#pragma warning(pop)\n#endif\n\n#endif // BENCHMARK_PERF_COUNTERS_H\n" }, { "path": "3rd/benchmark-1.8.2/src/re.h", "content": "// Copyright 2015 Google Inc. 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// 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#ifndef BENCHMARK_RE_H_\n#define BENCHMARK_RE_H_\n\n#include \"internal_macros.h\"\n\n// clang-format off\n\n#if !defined(HAVE_STD_REGEX) && \\\n !defined(HAVE_GNU_POSIX_REGEX) && \\\n !defined(HAVE_POSIX_REGEX)\n // No explicit regex selection; detect based on builtin hints.\n #if defined(BENCHMARK_OS_LINUX) || defined(BENCHMARK_OS_APPLE)\n #define HAVE_POSIX_REGEX 1\n #elif __cplusplus >= 199711L\n #define HAVE_STD_REGEX 1\n #endif\n#endif\n\n// Prefer C regex libraries when compiling w/o exceptions so that we can\n// correctly report errors.\n#if defined(BENCHMARK_HAS_NO_EXCEPTIONS) && \\\n defined(HAVE_STD_REGEX) && \\\n (defined(HAVE_GNU_POSIX_REGEX) || defined(HAVE_POSIX_REGEX))\n #undef HAVE_STD_REGEX\n#endif\n\n#if defined(HAVE_STD_REGEX)\n #include \n#elif defined(HAVE_GNU_POSIX_REGEX)\n #include \n#elif defined(HAVE_POSIX_REGEX)\n #include \n#else\n#error No regular expression backend was found!\n#endif\n\n// clang-format on\n\n#include \n\n#include \"check.h\"\n\nnamespace benchmark {\n\n// A wrapper around the POSIX regular expression API that provides automatic\n// cleanup\nclass Regex {\n public:\n Regex() : init_(false) {}\n\n ~Regex();\n\n // Compile a regular expression matcher from spec. Returns true on success.\n //\n // On failure (and if error is not nullptr), error is populated with a human\n // readable error message if an error occurs.\n bool Init(const std::string& spec, std::string* error);\n\n // Returns whether str matches the compiled regular expression.\n bool Match(const std::string& str);\n\n private:\n bool init_;\n// Underlying regular expression object\n#if defined(HAVE_STD_REGEX)\n std::regex re_;\n#elif defined(HAVE_POSIX_REGEX) || defined(HAVE_GNU_POSIX_REGEX)\n regex_t re_;\n#else\n#error No regular expression backend implementation available\n#endif\n};\n\n#if defined(HAVE_STD_REGEX)\n\ninline bool Regex::Init(const std::string& spec, std::string* error) {\n#ifdef BENCHMARK_HAS_NO_EXCEPTIONS\n ((void)error); // suppress unused warning\n#else\n try {\n#endif\n re_ = std::regex(spec, std::regex_constants::extended);\n init_ = true;\n#ifndef BENCHMARK_HAS_NO_EXCEPTIONS\n}\ncatch (const std::regex_error& e) {\n if (error) {\n *error = e.what();\n }\n}\n#endif\nreturn init_;\n}\n\ninline Regex::~Regex() {}\n\ninline bool Regex::Match(const std::string& str) {\n if (!init_) {\n return false;\n }\n return std::regex_search(str, re_);\n}\n\n#else\ninline bool Regex::Init(const std::string& spec, std::string* error) {\n int ec = regcomp(&re_, spec.c_str(), REG_EXTENDED | REG_NOSUB);\n if (ec != 0) {\n if (error) {\n size_t needed = regerror(ec, &re_, nullptr, 0);\n char* errbuf = new char[needed];\n regerror(ec, &re_, errbuf, needed);\n\n // regerror returns the number of bytes necessary to null terminate\n // the string, so we move that when assigning to error.\n BM_CHECK_NE(needed, 0);\n error->assign(errbuf, needed - 1);\n\n delete[] errbuf;\n }\n\n return false;\n }\n\n init_ = true;\n return true;\n}\n\ninline Regex::~Regex() {\n if (init_) {\n regfree(&re_);\n }\n}\n\ninline bool Regex::Match(const std::string& str) {\n if (!init_) {\n return false;\n }\n return regexec(&re_, str.c_str(), 0, nullptr, 0) == 0;\n}\n#endif\n\n} // end namespace benchmark\n\n#endif // BENCHMARK_RE_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/reporter.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"check.h\"\n#include \"string_util.h\"\n#include \"timers.h\"\n\nnamespace benchmark {\n\nBenchmarkReporter::BenchmarkReporter()\n : output_stream_(&std::cout), error_stream_(&std::cerr) {}\n\nBenchmarkReporter::~BenchmarkReporter() {}\n\nvoid BenchmarkReporter::PrintBasicContext(std::ostream *out,\n Context const &context) {\n BM_CHECK(out) << \"cannot be null\";\n auto &Out = *out;\n\n#ifndef BENCHMARK_OS_QURT\n // Date/time information is not available on QuRT.\n // Attempting to get it via this call cause the binary to crash.\n Out << LocalDateTimeString() << \"\\n\";\n#endif\n\n if (context.executable_name)\n Out << \"Running \" << context.executable_name << \"\\n\";\n\n const CPUInfo &info = context.cpu_info;\n Out << \"Run on (\" << info.num_cpus << \" X \"\n << (info.cycles_per_second / 1000000.0) << \" MHz CPU \"\n << ((info.num_cpus > 1) ? \"s\" : \"\") << \")\\n\";\n if (info.caches.size() != 0) {\n Out << \"CPU Caches:\\n\";\n for (auto &CInfo : info.caches) {\n Out << \" L\" << CInfo.level << \" \" << CInfo.type << \" \"\n << (CInfo.size / 1024) << \" KiB\";\n if (CInfo.num_sharing != 0)\n Out << \" (x\" << (info.num_cpus / CInfo.num_sharing) << \")\";\n Out << \"\\n\";\n }\n }\n if (!info.load_avg.empty()) {\n Out << \"Load Average: \";\n for (auto It = info.load_avg.begin(); It != info.load_avg.end();) {\n Out << StrFormat(\"%.2f\", *It++);\n if (It != info.load_avg.end()) Out << \", \";\n }\n Out << \"\\n\";\n }\n\n std::map *global_context =\n internal::GetGlobalContext();\n\n if (global_context != nullptr) {\n for (const auto &kv : *global_context) {\n Out << kv.first << \": \" << kv.second << \"\\n\";\n }\n }\n\n if (CPUInfo::Scaling::ENABLED == info.scaling) {\n Out << \"***WARNING*** CPU scaling is enabled, the benchmark \"\n \"real time measurements may be noisy and will incur extra \"\n \"overhead.\\n\";\n }\n\n#ifndef NDEBUG\n Out << \"***WARNING*** Library was built as DEBUG. Timings may be \"\n \"affected.\\n\";\n#endif\n}\n\n// No initializer because it's already initialized to NULL.\nconst char *BenchmarkReporter::Context::executable_name;\n\nBenchmarkReporter::Context::Context()\n : cpu_info(CPUInfo::Get()), sys_info(SystemInfo::Get()) {}\n\nstd::string BenchmarkReporter::Run::benchmark_name() const {\n std::string name = run_name.str();\n if (run_type == RT_Aggregate) {\n name += \"_\" + aggregate_name;\n }\n return name;\n}\n\ndouble BenchmarkReporter::Run::GetAdjustedRealTime() const {\n double new_time = real_accumulated_time * GetTimeUnitMultiplier(time_unit);\n if (iterations != 0) new_time /= static_cast(iterations);\n return new_time;\n}\n\ndouble BenchmarkReporter::Run::GetAdjustedCPUTime() const {\n double new_time = cpu_accumulated_time * GetTimeUnitMultiplier(time_unit);\n if (iterations != 0) new_time /= static_cast(iterations);\n return new_time;\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/statistics.cc", "content": "// Copyright 2016 Ismael Jimenez Martinez. All rights reserved.\n// Copyright 2017 Roman Lebedev. 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// 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#include \"statistics.h\"\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"check.h\"\n\nnamespace benchmark {\n\nauto StatisticsSum = [](const std::vector& v) {\n return std::accumulate(v.begin(), v.end(), 0.0);\n};\n\ndouble StatisticsMean(const std::vector& v) {\n if (v.empty()) return 0.0;\n return StatisticsSum(v) * (1.0 / v.size());\n}\n\ndouble StatisticsMedian(const std::vector& v) {\n if (v.size() < 3) return StatisticsMean(v);\n std::vector copy(v);\n\n auto center = copy.begin() + v.size() / 2;\n std::nth_element(copy.begin(), center, copy.end());\n\n // did we have an odd number of samples?\n // if yes, then center is the median\n // it no, then we are looking for the average between center and the value\n // before\n if (v.size() % 2 == 1) return *center;\n auto center2 = copy.begin() + v.size() / 2 - 1;\n std::nth_element(copy.begin(), center2, copy.end());\n return (*center + *center2) / 2.0;\n}\n\n// Return the sum of the squares of this sample set\nauto SumSquares = [](const std::vector& v) {\n return std::inner_product(v.begin(), v.end(), v.begin(), 0.0);\n};\n\nauto Sqr = [](const double dat) { return dat * dat; };\nauto Sqrt = [](const double dat) {\n // Avoid NaN due to imprecision in the calculations\n if (dat < 0.0) return 0.0;\n return std::sqrt(dat);\n};\n\ndouble StatisticsStdDev(const std::vector& v) {\n const auto mean = StatisticsMean(v);\n if (v.empty()) return mean;\n\n // Sample standard deviation is undefined for n = 1\n if (v.size() == 1) return 0.0;\n\n const double avg_squares = SumSquares(v) * (1.0 / v.size());\n return Sqrt(v.size() / (v.size() - 1.0) * (avg_squares - Sqr(mean)));\n}\n\ndouble StatisticsCV(const std::vector& v) {\n if (v.size() < 2) return 0.0;\n\n const auto stddev = StatisticsStdDev(v);\n const auto mean = StatisticsMean(v);\n\n return stddev / mean;\n}\n\nstd::vector ComputeStats(\n const std::vector& reports) {\n typedef BenchmarkReporter::Run Run;\n std::vector results;\n\n auto error_count = std::count_if(reports.begin(), reports.end(),\n [](Run const& run) { return run.skipped; });\n\n if (reports.size() - error_count < 2) {\n // We don't report aggregated data if there was a single run.\n return results;\n }\n\n // Accumulators.\n std::vector real_accumulated_time_stat;\n std::vector cpu_accumulated_time_stat;\n\n real_accumulated_time_stat.reserve(reports.size());\n cpu_accumulated_time_stat.reserve(reports.size());\n\n // All repetitions should be run with the same number of iterations so we\n // can take this information from the first benchmark.\n const IterationCount run_iterations = reports.front().iterations;\n // create stats for user counters\n struct CounterStat {\n Counter c;\n std::vector s;\n };\n std::map counter_stats;\n for (Run const& r : reports) {\n for (auto const& cnt : r.counters) {\n auto it = counter_stats.find(cnt.first);\n if (it == counter_stats.end()) {\n it = counter_stats\n .emplace(cnt.first,\n CounterStat{cnt.second, std::vector{}})\n .first;\n it->second.s.reserve(reports.size());\n } else {\n BM_CHECK_EQ(it->second.c.flags, cnt.second.flags);\n }\n }\n }\n\n // Populate the accumulators.\n for (Run const& run : reports) {\n BM_CHECK_EQ(reports[0].benchmark_name(), run.benchmark_name());\n BM_CHECK_EQ(run_iterations, run.iterations);\n if (run.skipped) continue;\n real_accumulated_time_stat.emplace_back(run.real_accumulated_time);\n cpu_accumulated_time_stat.emplace_back(run.cpu_accumulated_time);\n // user counters\n for (auto const& cnt : run.counters) {\n auto it = counter_stats.find(cnt.first);\n BM_CHECK_NE(it, counter_stats.end());\n it->second.s.emplace_back(cnt.second);\n }\n }\n\n // Only add label if it is same for all runs\n std::string report_label = reports[0].report_label;\n for (std::size_t i = 1; i < reports.size(); i++) {\n if (reports[i].report_label != report_label) {\n report_label = \"\";\n break;\n }\n }\n\n const double iteration_rescale_factor =\n double(reports.size()) / double(run_iterations);\n\n for (const auto& Stat : *reports[0].statistics) {\n // Get the data from the accumulator to BenchmarkReporter::Run's.\n Run data;\n data.run_name = reports[0].run_name;\n data.family_index = reports[0].family_index;\n data.per_family_instance_index = reports[0].per_family_instance_index;\n data.run_type = BenchmarkReporter::Run::RT_Aggregate;\n data.threads = reports[0].threads;\n data.repetitions = reports[0].repetitions;\n data.repetition_index = Run::no_repetition_index;\n data.aggregate_name = Stat.name_;\n data.aggregate_unit = Stat.unit_;\n data.report_label = report_label;\n\n // It is incorrect to say that an aggregate is computed over\n // run's iterations, because those iterations already got averaged.\n // Similarly, if there are N repetitions with 1 iterations each,\n // an aggregate will be computed over N measurements, not 1.\n // Thus it is best to simply use the count of separate reports.\n data.iterations = reports.size();\n\n data.real_accumulated_time = Stat.compute_(real_accumulated_time_stat);\n data.cpu_accumulated_time = Stat.compute_(cpu_accumulated_time_stat);\n\n if (data.aggregate_unit == StatisticUnit::kTime) {\n // We will divide these times by data.iterations when reporting, but the\n // data.iterations is not necessarily the scale of these measurements,\n // because in each repetition, these timers are sum over all the iters.\n // And if we want to say that the stats are over N repetitions and not\n // M iterations, we need to multiply these by (N/M).\n data.real_accumulated_time *= iteration_rescale_factor;\n data.cpu_accumulated_time *= iteration_rescale_factor;\n }\n\n data.time_unit = reports[0].time_unit;\n\n // user counters\n for (auto const& kv : counter_stats) {\n // Do *NOT* rescale the custom counters. They are already properly scaled.\n const auto uc_stat = Stat.compute_(kv.second.s);\n auto c = Counter(uc_stat, counter_stats[kv.first].c.flags,\n counter_stats[kv.first].c.oneK);\n data.counters[kv.first] = c;\n }\n\n results.push_back(data);\n }\n\n return results;\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/statistics.h", "content": "// Copyright 2016 Ismael Jimenez Martinez. All rights reserved.\n// Copyright 2017 Roman Lebedev. 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// 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#ifndef STATISTICS_H_\n#define STATISTICS_H_\n\n#include \n\n#include \"benchmark/benchmark.h\"\n\nnamespace benchmark {\n\n// Return a vector containing the mean, median and standard deviation\n// information (and any user-specified info) for the specified list of reports.\n// If 'reports' contains less than two non-errored runs an empty vector is\n// returned\nBENCHMARK_EXPORT\nstd::vector ComputeStats(\n const std::vector& reports);\n\nBENCHMARK_EXPORT\ndouble StatisticsMean(const std::vector& v);\nBENCHMARK_EXPORT\ndouble StatisticsMedian(const std::vector& v);\nBENCHMARK_EXPORT\ndouble StatisticsStdDev(const std::vector& v);\nBENCHMARK_EXPORT\ndouble StatisticsCV(const std::vector& v);\n\n} // end namespace benchmark\n\n#endif // STATISTICS_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/string_util.cc", "content": "#include \"string_util.h\"\n\n#include \n#ifdef BENCHMARK_STL_ANDROID_GNUSTL\n#include \n#endif\n#include \n#include \n#include \n#include \n#include \n\n#include \"arraysize.h\"\n\nnamespace benchmark {\nnamespace {\n\n// kilo, Mega, Giga, Tera, Peta, Exa, Zetta, Yotta.\nconst char kBigSIUnits[] = \"kMGTPEZY\";\n// Kibi, Mebi, Gibi, Tebi, Pebi, Exbi, Zebi, Yobi.\nconst char kBigIECUnits[] = \"KMGTPEZY\";\n// milli, micro, nano, pico, femto, atto, zepto, yocto.\nconst char kSmallSIUnits[] = \"munpfazy\";\n\n// We require that all three arrays have the same size.\nstatic_assert(arraysize(kBigSIUnits) == arraysize(kBigIECUnits),\n \"SI and IEC unit arrays must be the same size\");\nstatic_assert(arraysize(kSmallSIUnits) == arraysize(kBigSIUnits),\n \"Small SI and Big SI unit arrays must be the same size\");\n\nstatic const int64_t kUnitsSize = arraysize(kBigSIUnits);\n\nvoid ToExponentAndMantissa(double val, double thresh, int precision,\n double one_k, std::string* mantissa,\n int64_t* exponent) {\n std::stringstream mantissa_stream;\n\n if (val < 0) {\n mantissa_stream << \"-\";\n val = -val;\n }\n\n // Adjust threshold so that it never excludes things which can't be rendered\n // in 'precision' digits.\n const double adjusted_threshold =\n std::max(thresh, 1.0 / std::pow(10.0, precision));\n const double big_threshold = adjusted_threshold * one_k;\n const double small_threshold = adjusted_threshold;\n // Values in ]simple_threshold,small_threshold[ will be printed as-is\n const double simple_threshold = 0.01;\n\n if (val > big_threshold) {\n // Positive powers\n double scaled = val;\n for (size_t i = 0; i < arraysize(kBigSIUnits); ++i) {\n scaled /= one_k;\n if (scaled <= big_threshold) {\n mantissa_stream << scaled;\n *exponent = i + 1;\n *mantissa = mantissa_stream.str();\n return;\n }\n }\n mantissa_stream << val;\n *exponent = 0;\n } else if (val < small_threshold) {\n // Negative powers\n if (val < simple_threshold) {\n double scaled = val;\n for (size_t i = 0; i < arraysize(kSmallSIUnits); ++i) {\n scaled *= one_k;\n if (scaled >= small_threshold) {\n mantissa_stream << scaled;\n *exponent = -static_cast(i + 1);\n *mantissa = mantissa_stream.str();\n return;\n }\n }\n }\n mantissa_stream << val;\n *exponent = 0;\n } else {\n mantissa_stream << val;\n *exponent = 0;\n }\n *mantissa = mantissa_stream.str();\n}\n\nstd::string ExponentToPrefix(int64_t exponent, bool iec) {\n if (exponent == 0) return \"\";\n\n const int64_t index = (exponent > 0 ? exponent - 1 : -exponent - 1);\n if (index >= kUnitsSize) return \"\";\n\n const char* array =\n (exponent > 0 ? (iec ? kBigIECUnits : kBigSIUnits) : kSmallSIUnits);\n if (iec) {\n return array[index] + std::string(\"i\");\n }\n return std::string(1, array[index]);\n}\n\nstd::string ToBinaryStringFullySpecified(double value, double threshold,\n int precision, double one_k = 1024.0) {\n std::string mantissa;\n int64_t exponent;\n ToExponentAndMantissa(value, threshold, precision, one_k, &mantissa,\n &exponent);\n return mantissa + ExponentToPrefix(exponent, false);\n}\n\n} // end namespace\n\nvoid AppendHumanReadable(int n, std::string* str) {\n std::stringstream ss;\n // Round down to the nearest SI prefix.\n ss << ToBinaryStringFullySpecified(n, 1.0, 0);\n *str += ss.str();\n}\n\nstd::string HumanReadableNumber(double n, double one_k) {\n // 1.1 means that figures up to 1.1k should be shown with the next unit down;\n // this softens edge effects.\n // 1 means that we should show one decimal place of precision.\n return ToBinaryStringFullySpecified(n, 1.1, 1, one_k);\n}\n\nstd::string StrFormatImp(const char* msg, va_list args) {\n // we might need a second shot at this, so pre-emptivly make a copy\n va_list args_cp;\n va_copy(args_cp, args);\n\n // TODO(ericwf): use std::array for first attempt to avoid one memory\n // allocation guess what the size might be\n std::array local_buff;\n\n // 2015-10-08: vsnprintf is used instead of snd::vsnprintf due to a limitation\n // in the android-ndk\n auto ret = vsnprintf(local_buff.data(), local_buff.size(), msg, args_cp);\n\n va_end(args_cp);\n\n // handle empty expansion\n if (ret == 0) return std::string{};\n if (static_cast(ret) < local_buff.size())\n return std::string(local_buff.data());\n\n // we did not provide a long enough buffer on our first attempt.\n // add 1 to size to account for null-byte in size cast to prevent overflow\n std::size_t size = static_cast(ret) + 1;\n auto buff_ptr = std::unique_ptr(new char[size]);\n // 2015-10-08: vsnprintf is used instead of snd::vsnprintf due to a limitation\n // in the android-ndk\n vsnprintf(buff_ptr.get(), size, msg, args);\n return std::string(buff_ptr.get());\n}\n\nstd::string StrFormat(const char* format, ...) {\n va_list args;\n va_start(args, format);\n std::string tmp = StrFormatImp(format, args);\n va_end(args);\n return tmp;\n}\n\nstd::vector StrSplit(const std::string& str, char delim) {\n if (str.empty()) return {};\n std::vector ret;\n size_t first = 0;\n size_t next = str.find(delim);\n for (; next != std::string::npos;\n first = next + 1, next = str.find(delim, first)) {\n ret.push_back(str.substr(first, next - first));\n }\n ret.push_back(str.substr(first));\n return ret;\n}\n\n#ifdef BENCHMARK_STL_ANDROID_GNUSTL\n/*\n * GNU STL in Android NDK lacks support for some C++11 functions, including\n * stoul, stoi, stod. We reimplement them here using C functions strtoul,\n * strtol, strtod. Note that reimplemented functions are in benchmark::\n * namespace, not std:: namespace.\n */\nunsigned long stoul(const std::string& str, size_t* pos, int base) {\n /* Record previous errno */\n const int oldErrno = errno;\n errno = 0;\n\n const char* strStart = str.c_str();\n char* strEnd = const_cast(strStart);\n const unsigned long result = strtoul(strStart, &strEnd, base);\n\n const int strtoulErrno = errno;\n /* Restore previous errno */\n errno = oldErrno;\n\n /* Check for errors and return */\n if (strtoulErrno == ERANGE) {\n throw std::out_of_range(\"stoul failed: \" + str +\n \" is outside of range of unsigned long\");\n } else if (strEnd == strStart || strtoulErrno != 0) {\n throw std::invalid_argument(\"stoul failed: \" + str + \" is not an integer\");\n }\n if (pos != nullptr) {\n *pos = static_cast(strEnd - strStart);\n }\n return result;\n}\n\nint stoi(const std::string& str, size_t* pos, int base) {\n /* Record previous errno */\n const int oldErrno = errno;\n errno = 0;\n\n const char* strStart = str.c_str();\n char* strEnd = const_cast(strStart);\n const long result = strtol(strStart, &strEnd, base);\n\n const int strtolErrno = errno;\n /* Restore previous errno */\n errno = oldErrno;\n\n /* Check for errors and return */\n if (strtolErrno == ERANGE || long(int(result)) != result) {\n throw std::out_of_range(\"stoul failed: \" + str +\n \" is outside of range of int\");\n } else if (strEnd == strStart || strtolErrno != 0) {\n throw std::invalid_argument(\"stoul failed: \" + str + \" is not an integer\");\n }\n if (pos != nullptr) {\n *pos = static_cast(strEnd - strStart);\n }\n return int(result);\n}\n\ndouble stod(const std::string& str, size_t* pos) {\n /* Record previous errno */\n const int oldErrno = errno;\n errno = 0;\n\n const char* strStart = str.c_str();\n char* strEnd = const_cast(strStart);\n const double result = strtod(strStart, &strEnd);\n\n /* Restore previous errno */\n const int strtodErrno = errno;\n errno = oldErrno;\n\n /* Check for errors and return */\n if (strtodErrno == ERANGE) {\n throw std::out_of_range(\"stoul failed: \" + str +\n \" is outside of range of int\");\n } else if (strEnd == strStart || strtodErrno != 0) {\n throw std::invalid_argument(\"stoul failed: \" + str + \" is not an integer\");\n }\n if (pos != nullptr) {\n *pos = static_cast(strEnd - strStart);\n }\n return result;\n}\n#endif\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/string_util.h", "content": "#ifndef BENCHMARK_STRING_UTIL_H_\n#define BENCHMARK_STRING_UTIL_H_\n\n#include \n#include \n#include \n#include \n\n#include \"benchmark/export.h\"\n#include \"check.h\"\n#include \"internal_macros.h\"\n\nnamespace benchmark {\n\nvoid AppendHumanReadable(int n, std::string* str);\n\nstd::string HumanReadableNumber(double n, double one_k = 1024.0);\n\nBENCHMARK_EXPORT\n#if defined(__MINGW32__)\n__attribute__((format(__MINGW_PRINTF_FORMAT, 1, 2)))\n#elif defined(__GNUC__)\n__attribute__((format(printf, 1, 2)))\n#endif\nstd::string\nStrFormat(const char* format, ...);\n\ninline std::ostream& StrCatImp(std::ostream& out) BENCHMARK_NOEXCEPT {\n return out;\n}\n\ntemplate \ninline std::ostream& StrCatImp(std::ostream& out, First&& f, Rest&&... rest) {\n out << std::forward(f);\n return StrCatImp(out, std::forward(rest)...);\n}\n\ntemplate \ninline std::string StrCat(Args&&... args) {\n std::ostringstream ss;\n StrCatImp(ss, std::forward(args)...);\n return ss.str();\n}\n\nBENCHMARK_EXPORT\nstd::vector StrSplit(const std::string& str, char delim);\n\n// Disable lint checking for this block since it re-implements C functions.\n// NOLINTBEGIN\n#ifdef BENCHMARK_STL_ANDROID_GNUSTL\n/*\n * GNU STL in Android NDK lacks support for some C++11 functions, including\n * stoul, stoi, stod. We reimplement them here using C functions strtoul,\n * strtol, strtod. Note that reimplemented functions are in benchmark::\n * namespace, not std:: namespace.\n */\nunsigned long stoul(const std::string& str, size_t* pos = nullptr,\n int base = 10);\nint stoi(const std::string& str, size_t* pos = nullptr, int base = 10);\ndouble stod(const std::string& str, size_t* pos = nullptr);\n#else\nusing std::stod; // NOLINT(misc-unused-using-decls)\nusing std::stoi; // NOLINT(misc-unused-using-decls)\nusing std::stoul; // NOLINT(misc-unused-using-decls)\n#endif\n// NOLINTEND\n\n} // end namespace benchmark\n\n#endif // BENCHMARK_STRING_UTIL_H_\n" }, { "path": "3rd/benchmark-1.8.2/src/sysinfo.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \"internal_macros.h\"\n\n#ifdef BENCHMARK_OS_WINDOWS\n#include \n#undef StrCat // Don't let StrCat in string_util.h be renamed to lstrcatA\n#include \n#include \n\n#include \n#else\n#include \n#if !defined(BENCHMARK_OS_FUCHSIA) && !defined(BENCHMARK_OS_QURT)\n#include \n#endif\n#include \n#include // this header must be included before 'sys/sysctl.h' to avoid compilation error on FreeBSD\n#include \n#if defined BENCHMARK_OS_FREEBSD || defined BENCHMARK_OS_MACOSX || \\\n defined BENCHMARK_OS_NETBSD || defined BENCHMARK_OS_OPENBSD || \\\n defined BENCHMARK_OS_DRAGONFLY\n#define BENCHMARK_HAS_SYSCTL\n#include \n#endif\n#endif\n#if defined(BENCHMARK_OS_SOLARIS)\n#include \n#include \n#endif\n#if defined(BENCHMARK_OS_QNX)\n#include \n#endif\n#if defined(BENCHMARK_OS_QURT)\n#include \n#endif\n#if defined(BENCHMARK_HAS_PTHREAD_AFFINITY)\n#include \n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"check.h\"\n#include \"cycleclock.h\"\n#include \"internal_macros.h\"\n#include \"log.h\"\n#include \"string_util.h\"\n#include \"timers.h\"\n\nnamespace benchmark {\nnamespace {\n\nvoid PrintImp(std::ostream& out) { out << std::endl; }\n\ntemplate \nvoid PrintImp(std::ostream& out, First&& f, Rest&&... rest) {\n out << std::forward(f);\n PrintImp(out, std::forward(rest)...);\n}\n\ntemplate \nBENCHMARK_NORETURN void PrintErrorAndDie(Args&&... args) {\n PrintImp(std::cerr, std::forward(args)...);\n std::exit(EXIT_FAILURE);\n}\n\n#ifdef BENCHMARK_HAS_SYSCTL\n\n/// ValueUnion - A type used to correctly alias the byte-for-byte output of\n/// `sysctl` with the result type it's to be interpreted as.\nstruct ValueUnion {\n union DataT {\n int32_t int32_value;\n int64_t int64_value;\n // For correct aliasing of union members from bytes.\n char bytes[8];\n };\n using DataPtr = std::unique_ptr;\n\n // The size of the data union member + its trailing array size.\n std::size_t size;\n DataPtr buff;\n\n public:\n ValueUnion() : size(0), buff(nullptr, &std::free) {}\n\n explicit ValueUnion(std::size_t buff_size)\n : size(sizeof(DataT) + buff_size),\n buff(::new (std::malloc(size)) DataT(), &std::free) {}\n\n ValueUnion(ValueUnion&& other) = default;\n\n explicit operator bool() const { return bool(buff); }\n\n char* data() const { return buff->bytes; }\n\n std::string GetAsString() const { return std::string(data()); }\n\n int64_t GetAsInteger() const {\n if (size == sizeof(buff->int32_value))\n return buff->int32_value;\n else if (size == sizeof(buff->int64_value))\n return buff->int64_value;\n BENCHMARK_UNREACHABLE();\n }\n\n template \n std::array GetAsArray() {\n const int arr_size = sizeof(T) * N;\n BM_CHECK_LE(arr_size, size);\n std::array arr;\n std::memcpy(arr.data(), data(), arr_size);\n return arr;\n }\n};\n\nValueUnion GetSysctlImp(std::string const& name) {\n#if defined BENCHMARK_OS_OPENBSD\n int mib[2];\n\n mib[0] = CTL_HW;\n if ((name == \"hw.ncpu\") || (name == \"hw.cpuspeed\")) {\n ValueUnion buff(sizeof(int));\n\n if (name == \"hw.ncpu\") {\n mib[1] = HW_NCPU;\n } else {\n mib[1] = HW_CPUSPEED;\n }\n\n if (sysctl(mib, 2, buff.data(), &buff.Size, nullptr, 0) == -1) {\n return ValueUnion();\n }\n return buff;\n }\n return ValueUnion();\n#else\n std::size_t cur_buff_size = 0;\n if (sysctlbyname(name.c_str(), nullptr, &cur_buff_size, nullptr, 0) == -1)\n return ValueUnion();\n\n ValueUnion buff(cur_buff_size);\n if (sysctlbyname(name.c_str(), buff.data(), &buff.size, nullptr, 0) == 0)\n return buff;\n return ValueUnion();\n#endif\n}\n\nBENCHMARK_MAYBE_UNUSED\nbool GetSysctl(std::string const& name, std::string* out) {\n out->clear();\n auto buff = GetSysctlImp(name);\n if (!buff) return false;\n out->assign(buff.data());\n return true;\n}\n\ntemplate ::value>::type>\nbool GetSysctl(std::string const& name, Tp* out) {\n *out = 0;\n auto buff = GetSysctlImp(name);\n if (!buff) return false;\n *out = static_cast(buff.GetAsInteger());\n return true;\n}\n\ntemplate \nbool GetSysctl(std::string const& name, std::array* out) {\n auto buff = GetSysctlImp(name);\n if (!buff) return false;\n *out = buff.GetAsArray();\n return true;\n}\n#endif\n\ntemplate \nbool ReadFromFile(std::string const& fname, ArgT* arg) {\n *arg = ArgT();\n std::ifstream f(fname.c_str());\n if (!f.is_open()) return false;\n f >> *arg;\n return f.good();\n}\n\nCPUInfo::Scaling CpuScaling(int num_cpus) {\n // We don't have a valid CPU count, so don't even bother.\n if (num_cpus <= 0) return CPUInfo::Scaling::UNKNOWN;\n#if defined(BENCHMARK_OS_QNX)\n return CPUInfo::Scaling::UNKNOWN;\n#elif !defined(BENCHMARK_OS_WINDOWS)\n // On Linux, the CPUfreq subsystem exposes CPU information as files on the\n // local file system. If reading the exported files fails, then we may not be\n // running on Linux, so we silently ignore all the read errors.\n std::string res;\n for (int cpu = 0; cpu < num_cpus; ++cpu) {\n std::string governor_file =\n StrCat(\"/sys/devices/system/cpu/cpu\", cpu, \"/cpufreq/scaling_governor\");\n if (ReadFromFile(governor_file, &res) && res != \"performance\")\n return CPUInfo::Scaling::ENABLED;\n }\n return CPUInfo::Scaling::DISABLED;\n#else\n return CPUInfo::Scaling::UNKNOWN;\n#endif\n}\n\nint CountSetBitsInCPUMap(std::string val) {\n auto CountBits = [](std::string part) {\n using CPUMask = std::bitset;\n part = \"0x\" + part;\n CPUMask mask(benchmark::stoul(part, nullptr, 16));\n return static_cast(mask.count());\n };\n std::size_t pos;\n int total = 0;\n while ((pos = val.find(',')) != std::string::npos) {\n total += CountBits(val.substr(0, pos));\n val = val.substr(pos + 1);\n }\n if (!val.empty()) {\n total += CountBits(val);\n }\n return total;\n}\n\nBENCHMARK_MAYBE_UNUSED\nstd::vector GetCacheSizesFromKVFS() {\n std::vector res;\n std::string dir = \"/sys/devices/system/cpu/cpu0/cache/\";\n int idx = 0;\n while (true) {\n CPUInfo::CacheInfo info;\n std::string fpath = StrCat(dir, \"index\", idx++, \"/\");\n std::ifstream f(StrCat(fpath, \"size\").c_str());\n if (!f.is_open()) break;\n std::string suffix;\n f >> info.size;\n if (f.fail())\n PrintErrorAndDie(\"Failed while reading file '\", fpath, \"size'\");\n if (f.good()) {\n f >> suffix;\n if (f.bad())\n PrintErrorAndDie(\n \"Invalid cache size format: failed to read size suffix\");\n else if (f && suffix != \"K\")\n PrintErrorAndDie(\"Invalid cache size format: Expected bytes \", suffix);\n else if (suffix == \"K\")\n info.size *= 1024;\n }\n if (!ReadFromFile(StrCat(fpath, \"type\"), &info.type))\n PrintErrorAndDie(\"Failed to read from file \", fpath, \"type\");\n if (!ReadFromFile(StrCat(fpath, \"level\"), &info.level))\n PrintErrorAndDie(\"Failed to read from file \", fpath, \"level\");\n std::string map_str;\n if (!ReadFromFile(StrCat(fpath, \"shared_cpu_map\"), &map_str))\n PrintErrorAndDie(\"Failed to read from file \", fpath, \"shared_cpu_map\");\n info.num_sharing = CountSetBitsInCPUMap(map_str);\n res.push_back(info);\n }\n\n return res;\n}\n\n#ifdef BENCHMARK_OS_MACOSX\nstd::vector GetCacheSizesMacOSX() {\n std::vector res;\n std::array cache_counts{{0, 0, 0, 0}};\n GetSysctl(\"hw.cacheconfig\", &cache_counts);\n\n struct {\n std::string name;\n std::string type;\n int level;\n int num_sharing;\n } cases[] = {{\"hw.l1dcachesize\", \"Data\", 1, cache_counts[1]},\n {\"hw.l1icachesize\", \"Instruction\", 1, cache_counts[1]},\n {\"hw.l2cachesize\", \"Unified\", 2, cache_counts[2]},\n {\"hw.l3cachesize\", \"Unified\", 3, cache_counts[3]}};\n for (auto& c : cases) {\n int val;\n if (!GetSysctl(c.name, &val)) continue;\n CPUInfo::CacheInfo info;\n info.type = c.type;\n info.level = c.level;\n info.size = val;\n info.num_sharing = c.num_sharing;\n res.push_back(std::move(info));\n }\n return res;\n}\n#elif defined(BENCHMARK_OS_WINDOWS)\nstd::vector GetCacheSizesWindows() {\n std::vector res;\n DWORD buffer_size = 0;\n using PInfo = SYSTEM_LOGICAL_PROCESSOR_INFORMATION;\n using CInfo = CACHE_DESCRIPTOR;\n\n using UPtr = std::unique_ptr;\n GetLogicalProcessorInformation(nullptr, &buffer_size);\n UPtr buff((PInfo*)malloc(buffer_size), &std::free);\n if (!GetLogicalProcessorInformation(buff.get(), &buffer_size))\n PrintErrorAndDie(\"Failed during call to GetLogicalProcessorInformation: \",\n GetLastError());\n\n PInfo* it = buff.get();\n PInfo* end = buff.get() + (buffer_size / sizeof(PInfo));\n\n for (; it != end; ++it) {\n if (it->Relationship != RelationCache) continue;\n using BitSet = std::bitset;\n BitSet b(it->ProcessorMask);\n // To prevent duplicates, only consider caches where CPU 0 is specified\n if (!b.test(0)) continue;\n const CInfo& cache = it->Cache;\n CPUInfo::CacheInfo C;\n C.num_sharing = static_cast(b.count());\n C.level = cache.Level;\n C.size = cache.Size;\n C.type = \"Unknown\";\n switch (cache.Type) {\n case CacheUnified:\n C.type = \"Unified\";\n break;\n case CacheInstruction:\n C.type = \"Instruction\";\n break;\n case CacheData:\n C.type = \"Data\";\n break;\n case CacheTrace:\n C.type = \"Trace\";\n break;\n }\n res.push_back(C);\n }\n return res;\n}\n#elif BENCHMARK_OS_QNX\nstd::vector GetCacheSizesQNX() {\n std::vector res;\n struct cacheattr_entry* cache = SYSPAGE_ENTRY(cacheattr);\n uint32_t const elsize = SYSPAGE_ELEMENT_SIZE(cacheattr);\n int num = SYSPAGE_ENTRY_SIZE(cacheattr) / elsize;\n for (int i = 0; i < num; ++i) {\n CPUInfo::CacheInfo info;\n switch (cache->flags) {\n case CACHE_FLAG_INSTR:\n info.type = \"Instruction\";\n info.level = 1;\n break;\n case CACHE_FLAG_DATA:\n info.type = \"Data\";\n info.level = 1;\n break;\n case CACHE_FLAG_UNIFIED:\n info.type = \"Unified\";\n info.level = 2;\n break;\n case CACHE_FLAG_SHARED:\n info.type = \"Shared\";\n info.level = 3;\n break;\n default:\n continue;\n break;\n }\n info.size = cache->line_size * cache->num_lines;\n info.num_sharing = 0;\n res.push_back(std::move(info));\n cache = SYSPAGE_ARRAY_ADJ_OFFSET(cacheattr, cache, elsize);\n }\n return res;\n}\n#endif\n\nstd::vector GetCacheSizes() {\n#ifdef BENCHMARK_OS_MACOSX\n return GetCacheSizesMacOSX();\n#elif defined(BENCHMARK_OS_WINDOWS)\n return GetCacheSizesWindows();\n#elif defined(BENCHMARK_OS_QNX)\n return GetCacheSizesQNX();\n#elif defined(BENCHMARK_OS_QURT)\n return std::vector();\n#else\n return GetCacheSizesFromKVFS();\n#endif\n}\n\nstd::string GetSystemName() {\n#if defined(BENCHMARK_OS_WINDOWS)\n std::string str;\n static constexpr int COUNT = MAX_COMPUTERNAME_LENGTH + 1;\n TCHAR hostname[COUNT] = {'\\0'};\n DWORD DWCOUNT = COUNT;\n if (!GetComputerName(hostname, &DWCOUNT)) return std::string(\"\");\n#ifndef UNICODE\n str = std::string(hostname, DWCOUNT);\n#else\n // `WideCharToMultiByte` returns `0` when conversion fails.\n int len = WideCharToMultiByte(CP_UTF8, WC_ERR_INVALID_CHARS, hostname,\n DWCOUNT, NULL, 0, NULL, NULL);\n str.resize(len);\n WideCharToMultiByte(CP_UTF8, WC_ERR_INVALID_CHARS, hostname, DWCOUNT, &str[0],\n str.size(), NULL, NULL);\n#endif\n return str;\n#elif defined(BENCHMARK_OS_QURT)\n std::string str = \"Hexagon DSP\";\n qurt_arch_version_t arch_version_struct;\n if (qurt_sysenv_get_arch_version(&arch_version_struct) == QURT_EOK) {\n str += \" v\";\n str += std::to_string(arch_version_struct.arch_version);\n }\n return str;\n#else\n#ifndef HOST_NAME_MAX\n#ifdef BENCHMARK_HAS_SYSCTL // BSD/Mac doesn't have HOST_NAME_MAX defined\n#define HOST_NAME_MAX 64\n#elif defined(BENCHMARK_OS_NACL)\n#define HOST_NAME_MAX 64\n#elif defined(BENCHMARK_OS_QNX)\n#define HOST_NAME_MAX 154\n#elif defined(BENCHMARK_OS_RTEMS)\n#define HOST_NAME_MAX 256\n#elif defined(BENCHMARK_OS_SOLARIS)\n#define HOST_NAME_MAX MAXHOSTNAMELEN\n#else\n#pragma message(\"HOST_NAME_MAX not defined. using 64\")\n#define HOST_NAME_MAX 64\n#endif\n#endif // def HOST_NAME_MAX\n char hostname[HOST_NAME_MAX];\n int retVal = gethostname(hostname, HOST_NAME_MAX);\n if (retVal != 0) return std::string(\"\");\n return std::string(hostname);\n#endif // Catch-all POSIX block.\n}\n\nint GetNumCPUs() {\n#ifdef BENCHMARK_HAS_SYSCTL\n int num_cpu = -1;\n if (GetSysctl(\"hw.ncpu\", &num_cpu)) return num_cpu;\n fprintf(stderr, \"Err: %s\\n\", strerror(errno));\n std::exit(EXIT_FAILURE);\n#elif defined(BENCHMARK_OS_WINDOWS)\n SYSTEM_INFO sysinfo;\n // Use memset as opposed to = {} to avoid GCC missing initializer false\n // positives.\n std::memset(&sysinfo, 0, sizeof(SYSTEM_INFO));\n GetSystemInfo(&sysinfo);\n return sysinfo.dwNumberOfProcessors; // number of logical\n // processors in the current\n // group\n#elif defined(BENCHMARK_OS_SOLARIS)\n // Returns -1 in case of a failure.\n long num_cpu = sysconf(_SC_NPROCESSORS_ONLN);\n if (num_cpu < 0) {\n fprintf(stderr, \"sysconf(_SC_NPROCESSORS_ONLN) failed with error: %s\\n\",\n strerror(errno));\n }\n return (int)num_cpu;\n#elif defined(BENCHMARK_OS_QNX)\n return static_cast(_syspage_ptr->num_cpu);\n#elif defined(BENCHMARK_OS_QURT)\n qurt_sysenv_max_hthreads_t hardware_threads;\n if (qurt_sysenv_get_max_hw_threads(&hardware_threads) != QURT_EOK) {\n hardware_threads.max_hthreads = 1;\n }\n return hardware_threads.max_hthreads;\n#else\n int num_cpus = 0;\n int max_id = -1;\n std::ifstream f(\"/proc/cpuinfo\");\n if (!f.is_open()) {\n std::cerr << \"failed to open /proc/cpuinfo\\n\";\n return -1;\n }\n const std::string Key = \"processor\";\n std::string ln;\n while (std::getline(f, ln)) {\n if (ln.empty()) continue;\n std::size_t split_idx = ln.find(':');\n std::string value;\n#if defined(__s390__)\n // s390 has another format in /proc/cpuinfo\n // it needs to be parsed differently\n if (split_idx != std::string::npos)\n value = ln.substr(Key.size() + 1, split_idx - Key.size() - 1);\n#else\n if (split_idx != std::string::npos) value = ln.substr(split_idx + 1);\n#endif\n if (ln.size() >= Key.size() && ln.compare(0, Key.size(), Key) == 0) {\n num_cpus++;\n if (!value.empty()) {\n const int cur_id = benchmark::stoi(value);\n max_id = std::max(cur_id, max_id);\n }\n }\n }\n if (f.bad()) {\n std::cerr << \"Failure reading /proc/cpuinfo\\n\";\n return -1;\n }\n if (!f.eof()) {\n std::cerr << \"Failed to read to end of /proc/cpuinfo\\n\";\n return -1;\n }\n f.close();\n\n if ((max_id + 1) != num_cpus) {\n fprintf(stderr,\n \"CPU ID assignments in /proc/cpuinfo seem messed up.\"\n \" This is usually caused by a bad BIOS.\\n\");\n }\n return num_cpus;\n#endif\n BENCHMARK_UNREACHABLE();\n}\n\nclass ThreadAffinityGuard final {\n public:\n ThreadAffinityGuard() : reset_affinity(SetAffinity()) {\n if (!reset_affinity)\n std::cerr << \"***WARNING*** Failed to set thread affinity. Estimated CPU \"\n \"frequency may be incorrect.\"\n << std::endl;\n }\n\n ~ThreadAffinityGuard() {\n if (!reset_affinity) return;\n\n#if defined(BENCHMARK_HAS_PTHREAD_AFFINITY)\n int ret = pthread_setaffinity_np(self, sizeof(previous_affinity),\n &previous_affinity);\n if (ret == 0) return;\n#elif defined(BENCHMARK_OS_WINDOWS_WIN32)\n DWORD_PTR ret = SetThreadAffinityMask(self, previous_affinity);\n if (ret != 0) return;\n#endif // def BENCHMARK_HAS_PTHREAD_AFFINITY\n PrintErrorAndDie(\"Failed to reset thread affinity\");\n }\n\n ThreadAffinityGuard(ThreadAffinityGuard&&) = delete;\n ThreadAffinityGuard(const ThreadAffinityGuard&) = delete;\n ThreadAffinityGuard& operator=(ThreadAffinityGuard&&) = delete;\n ThreadAffinityGuard& operator=(const ThreadAffinityGuard&) = delete;\n\n private:\n bool SetAffinity() {\n#if defined(BENCHMARK_HAS_PTHREAD_AFFINITY)\n int ret;\n self = pthread_self();\n ret = pthread_getaffinity_np(self, sizeof(previous_affinity),\n &previous_affinity);\n if (ret != 0) return false;\n\n cpu_set_t affinity;\n memcpy(&affinity, &previous_affinity, sizeof(affinity));\n\n bool is_first_cpu = true;\n\n for (int i = 0; i < CPU_SETSIZE; ++i)\n if (CPU_ISSET(i, &affinity)) {\n if (is_first_cpu)\n is_first_cpu = false;\n else\n CPU_CLR(i, &affinity);\n }\n\n if (is_first_cpu) return false;\n\n ret = pthread_setaffinity_np(self, sizeof(affinity), &affinity);\n return ret == 0;\n#elif defined(BENCHMARK_OS_WINDOWS_WIN32)\n self = GetCurrentThread();\n DWORD_PTR mask = static_cast(1) << GetCurrentProcessorNumber();\n previous_affinity = SetThreadAffinityMask(self, mask);\n return previous_affinity != 0;\n#else\n return false;\n#endif // def BENCHMARK_HAS_PTHREAD_AFFINITY\n }\n\n#if defined(BENCHMARK_HAS_PTHREAD_AFFINITY)\n pthread_t self;\n cpu_set_t previous_affinity;\n#elif defined(BENCHMARK_OS_WINDOWS_WIN32)\n HANDLE self;\n DWORD_PTR previous_affinity;\n#endif // def BENCHMARK_HAS_PTHREAD_AFFINITY\n bool reset_affinity;\n};\n\ndouble GetCPUCyclesPerSecond(CPUInfo::Scaling scaling) {\n // Currently, scaling is only used on linux path here,\n // suppress diagnostics about it being unused on other paths.\n (void)scaling;\n\n#if defined BENCHMARK_OS_LINUX || defined BENCHMARK_OS_CYGWIN\n long freq;\n\n // If the kernel is exporting the tsc frequency use that. There are issues\n // where cpuinfo_max_freq cannot be relied on because the BIOS may be\n // exporintg an invalid p-state (on x86) or p-states may be used to put the\n // processor in a new mode (turbo mode). Essentially, those frequencies\n // cannot always be relied upon. The same reasons apply to /proc/cpuinfo as\n // well.\n if (ReadFromFile(\"/sys/devices/system/cpu/cpu0/tsc_freq_khz\", &freq)\n // If CPU scaling is disabled, use the *current* frequency.\n // Note that we specifically don't want to read cpuinfo_cur_freq,\n // because it is only readable by root.\n || (scaling == CPUInfo::Scaling::DISABLED &&\n ReadFromFile(\"/sys/devices/system/cpu/cpu0/cpufreq/scaling_cur_freq\",\n &freq))\n // Otherwise, if CPU scaling may be in effect, we want to use\n // the *maximum* frequency, not whatever CPU speed some random processor\n // happens to be using now.\n || ReadFromFile(\"/sys/devices/system/cpu/cpu0/cpufreq/cpuinfo_max_freq\",\n &freq)) {\n // The value is in kHz (as the file name suggests). For example, on a\n // 2GHz warpstation, the file contains the value \"2000000\".\n return freq * 1000.0;\n }\n\n const double error_value = -1;\n double bogo_clock = error_value;\n\n std::ifstream f(\"/proc/cpuinfo\");\n if (!f.is_open()) {\n std::cerr << \"failed to open /proc/cpuinfo\\n\";\n return error_value;\n }\n\n auto StartsWithKey = [](std::string const& Value, std::string const& Key) {\n if (Key.size() > Value.size()) return false;\n auto Cmp = [&](char X, char Y) {\n return std::tolower(X) == std::tolower(Y);\n };\n return std::equal(Key.begin(), Key.end(), Value.begin(), Cmp);\n };\n\n std::string ln;\n while (std::getline(f, ln)) {\n if (ln.empty()) continue;\n std::size_t split_idx = ln.find(':');\n std::string value;\n if (split_idx != std::string::npos) value = ln.substr(split_idx + 1);\n // When parsing the \"cpu MHz\" and \"bogomips\" (fallback) entries, we only\n // accept positive values. Some environments (virtual machines) report zero,\n // which would cause infinite looping in WallTime_Init.\n if (StartsWithKey(ln, \"cpu MHz\")) {\n if (!value.empty()) {\n double cycles_per_second = benchmark::stod(value) * 1000000.0;\n if (cycles_per_second > 0) return cycles_per_second;\n }\n } else if (StartsWithKey(ln, \"bogomips\")) {\n if (!value.empty()) {\n bogo_clock = benchmark::stod(value) * 1000000.0;\n if (bogo_clock < 0.0) bogo_clock = error_value;\n }\n }\n }\n if (f.bad()) {\n std::cerr << \"Failure reading /proc/cpuinfo\\n\";\n return error_value;\n }\n if (!f.eof()) {\n std::cerr << \"Failed to read to end of /proc/cpuinfo\\n\";\n return error_value;\n }\n f.close();\n // If we found the bogomips clock, but nothing better, we'll use it (but\n // we're not happy about it); otherwise, fallback to the rough estimation\n // below.\n if (bogo_clock >= 0.0) return bogo_clock;\n\n#elif defined BENCHMARK_HAS_SYSCTL\n constexpr auto* freqStr =\n#if defined(BENCHMARK_OS_FREEBSD) || defined(BENCHMARK_OS_NETBSD)\n \"machdep.tsc_freq\";\n#elif defined BENCHMARK_OS_OPENBSD\n \"hw.cpuspeed\";\n#elif defined BENCHMARK_OS_DRAGONFLY\n \"hw.tsc_frequency\";\n#else\n \"hw.cpufrequency\";\n#endif\n unsigned long long hz = 0;\n#if defined BENCHMARK_OS_OPENBSD\n if (GetSysctl(freqStr, &hz)) return hz * 1000000;\n#else\n if (GetSysctl(freqStr, &hz)) return hz;\n#endif\n fprintf(stderr, \"Unable to determine clock rate from sysctl: %s: %s\\n\",\n freqStr, strerror(errno));\n fprintf(stderr,\n \"This does not affect benchmark measurements, only the \"\n \"metadata output.\\n\");\n\n#elif defined BENCHMARK_OS_WINDOWS_WIN32\n // In NT, read MHz from the registry. If we fail to do so or we're in win9x\n // then make a crude estimate.\n DWORD data, data_size = sizeof(data);\n if (IsWindowsXPOrGreater() &&\n SUCCEEDED(\n SHGetValueA(HKEY_LOCAL_MACHINE,\n \"HARDWARE\\\\DESCRIPTION\\\\System\\\\CentralProcessor\\\\0\",\n \"~MHz\", nullptr, &data, &data_size)))\n return static_cast((int64_t)data *\n (int64_t)(1000 * 1000)); // was mhz\n#elif defined(BENCHMARK_OS_SOLARIS)\n kstat_ctl_t* kc = kstat_open();\n if (!kc) {\n std::cerr << \"failed to open /dev/kstat\\n\";\n return -1;\n }\n kstat_t* ksp = kstat_lookup(kc, const_cast(\"cpu_info\"), -1,\n const_cast(\"cpu_info0\"));\n if (!ksp) {\n std::cerr << \"failed to lookup in /dev/kstat\\n\";\n return -1;\n }\n if (kstat_read(kc, ksp, NULL) < 0) {\n std::cerr << \"failed to read from /dev/kstat\\n\";\n return -1;\n }\n kstat_named_t* knp = (kstat_named_t*)kstat_data_lookup(\n ksp, const_cast(\"current_clock_Hz\"));\n if (!knp) {\n std::cerr << \"failed to lookup data in /dev/kstat\\n\";\n return -1;\n }\n if (knp->data_type != KSTAT_DATA_UINT64) {\n std::cerr << \"current_clock_Hz is of unexpected data type: \"\n << knp->data_type << \"\\n\";\n return -1;\n }\n double clock_hz = knp->value.ui64;\n kstat_close(kc);\n return clock_hz;\n#elif defined(BENCHMARK_OS_QNX)\n return static_cast((int64_t)(SYSPAGE_ENTRY(cpuinfo)->speed) *\n (int64_t)(1000 * 1000));\n#elif defined(BENCHMARK_OS_QURT)\n // QuRT doesn't provide any API to query Hexagon frequency.\n return 1000000000;\n#endif\n // If we've fallen through, attempt to roughly estimate the CPU clock rate.\n\n // Make sure to use the same cycle counter when starting and stopping the\n // cycle timer. We just pin the current thread to a cpu in the previous\n // affinity set.\n ThreadAffinityGuard affinity_guard;\n\n static constexpr double estimate_time_s = 1.0;\n const double start_time = ChronoClockNow();\n const auto start_ticks = cycleclock::Now();\n\n // Impose load instead of calling sleep() to make sure the cycle counter\n // works.\n using PRNG = std::minstd_rand;\n using Result = PRNG::result_type;\n PRNG rng(static_cast(start_ticks));\n\n Result state = 0;\n\n do {\n static constexpr size_t batch_size = 10000;\n rng.discard(batch_size);\n state += rng();\n\n } while (ChronoClockNow() - start_time < estimate_time_s);\n\n DoNotOptimize(state);\n\n const auto end_ticks = cycleclock::Now();\n const double end_time = ChronoClockNow();\n\n return static_cast(end_ticks - start_ticks) / (end_time - start_time);\n // Reset the affinity of current thread when the lifetime of affinity_guard\n // ends.\n}\n\nstd::vector GetLoadAvg() {\n#if (defined BENCHMARK_OS_FREEBSD || defined(BENCHMARK_OS_LINUX) || \\\n defined BENCHMARK_OS_MACOSX || defined BENCHMARK_OS_NETBSD || \\\n defined BENCHMARK_OS_OPENBSD || defined BENCHMARK_OS_DRAGONFLY) && \\\n !defined(__ANDROID__)\n static constexpr int kMaxSamples = 3;\n std::vector res(kMaxSamples, 0.0);\n const int nelem = getloadavg(res.data(), kMaxSamples);\n if (nelem < 1) {\n res.clear();\n } else {\n res.resize(nelem);\n }\n return res;\n#else\n return {};\n#endif\n}\n\n} // end namespace\n\nconst CPUInfo& CPUInfo::Get() {\n static const CPUInfo* info = new CPUInfo();\n return *info;\n}\n\nCPUInfo::CPUInfo()\n : num_cpus(GetNumCPUs()),\n scaling(CpuScaling(num_cpus)),\n cycles_per_second(GetCPUCyclesPerSecond(scaling)),\n caches(GetCacheSizes()),\n load_avg(GetLoadAvg()) {}\n\nconst SystemInfo& SystemInfo::Get() {\n static const SystemInfo* info = new SystemInfo();\n return *info;\n}\n\nSystemInfo::SystemInfo() : name(GetSystemName()) {}\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/thread_manager.h", "content": "#ifndef BENCHMARK_THREAD_MANAGER_H\n#define BENCHMARK_THREAD_MANAGER_H\n\n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"mutex.h\"\n\nnamespace benchmark {\nnamespace internal {\n\nclass ThreadManager {\n public:\n explicit ThreadManager(int num_threads)\n : alive_threads_(num_threads), start_stop_barrier_(num_threads) {}\n\n Mutex& GetBenchmarkMutex() const RETURN_CAPABILITY(benchmark_mutex_) {\n return benchmark_mutex_;\n }\n\n bool StartStopBarrier() EXCLUDES(end_cond_mutex_) {\n return start_stop_barrier_.wait();\n }\n\n void NotifyThreadComplete() EXCLUDES(end_cond_mutex_) {\n start_stop_barrier_.removeThread();\n if (--alive_threads_ == 0) {\n MutexLock lock(end_cond_mutex_);\n end_condition_.notify_all();\n }\n }\n\n void WaitForAllThreads() EXCLUDES(end_cond_mutex_) {\n MutexLock lock(end_cond_mutex_);\n end_condition_.wait(lock.native_handle(),\n [this]() { return alive_threads_ == 0; });\n }\n\n struct Result {\n IterationCount iterations = 0;\n double real_time_used = 0;\n double cpu_time_used = 0;\n double manual_time_used = 0;\n int64_t complexity_n = 0;\n std::string report_label_;\n std::string skip_message_;\n internal::Skipped skipped_ = internal::NotSkipped;\n UserCounters counters;\n };\n GUARDED_BY(GetBenchmarkMutex()) Result results;\n\n private:\n mutable Mutex benchmark_mutex_;\n std::atomic alive_threads_;\n Barrier start_stop_barrier_;\n Mutex end_cond_mutex_;\n Condition end_condition_;\n};\n\n} // namespace internal\n} // namespace benchmark\n\n#endif // BENCHMARK_THREAD_MANAGER_H\n" }, { "path": "3rd/benchmark-1.8.2/src/thread_timer.h", "content": "#ifndef BENCHMARK_THREAD_TIMER_H\n#define BENCHMARK_THREAD_TIMER_H\n\n#include \"check.h\"\n#include \"timers.h\"\n\nnamespace benchmark {\nnamespace internal {\n\nclass ThreadTimer {\n explicit ThreadTimer(bool measure_process_cpu_time_)\n : measure_process_cpu_time(measure_process_cpu_time_) {}\n\n public:\n static ThreadTimer Create() {\n return ThreadTimer(/*measure_process_cpu_time_=*/false);\n }\n static ThreadTimer CreateProcessCpuTime() {\n return ThreadTimer(/*measure_process_cpu_time_=*/true);\n }\n\n // Called by each thread\n void StartTimer() {\n running_ = true;\n start_real_time_ = ChronoClockNow();\n start_cpu_time_ = ReadCpuTimerOfChoice();\n }\n\n // Called by each thread\n void StopTimer() {\n BM_CHECK(running_);\n running_ = false;\n real_time_used_ += ChronoClockNow() - start_real_time_;\n // Floating point error can result in the subtraction producing a negative\n // time. Guard against that.\n cpu_time_used_ +=\n std::max(ReadCpuTimerOfChoice() - start_cpu_time_, 0);\n }\n\n // Called by each thread\n void SetIterationTime(double seconds) { manual_time_used_ += seconds; }\n\n bool running() const { return running_; }\n\n // REQUIRES: timer is not running\n double real_time_used() const {\n BM_CHECK(!running_);\n return real_time_used_;\n }\n\n // REQUIRES: timer is not running\n double cpu_time_used() const {\n BM_CHECK(!running_);\n return cpu_time_used_;\n }\n\n // REQUIRES: timer is not running\n double manual_time_used() const {\n BM_CHECK(!running_);\n return manual_time_used_;\n }\n\n private:\n double ReadCpuTimerOfChoice() const {\n if (measure_process_cpu_time) return ProcessCPUUsage();\n return ThreadCPUUsage();\n }\n\n // should the thread, or the process, time be measured?\n const bool measure_process_cpu_time;\n\n bool running_ = false; // Is the timer running\n double start_real_time_ = 0; // If running_\n double start_cpu_time_ = 0; // If running_\n\n // Accumulated time so far (does not contain current slice if running_)\n double real_time_used_ = 0;\n double cpu_time_used_ = 0;\n // Manually set iteration time. User sets this with SetIterationTime(seconds).\n double manual_time_used_ = 0;\n};\n\n} // namespace internal\n} // namespace benchmark\n\n#endif // BENCHMARK_THREAD_TIMER_H\n" }, { "path": "3rd/benchmark-1.8.2/src/timers.cc", "content": "// Copyright 2015 Google Inc. 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// 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#include \"timers.h\"\n\n#include \"internal_macros.h\"\n\n#ifdef BENCHMARK_OS_WINDOWS\n#include \n#undef StrCat // Don't let StrCat in string_util.h be renamed to lstrcatA\n#include \n#include \n#else\n#include \n#if !defined(BENCHMARK_OS_FUCHSIA) && !defined(BENCHMARK_OS_QURT)\n#include \n#endif\n#include \n#include // this header must be included before 'sys/sysctl.h' to avoid compilation error on FreeBSD\n#include \n#if defined BENCHMARK_OS_FREEBSD || defined BENCHMARK_OS_DRAGONFLY || \\\n defined BENCHMARK_OS_MACOSX\n#include \n#endif\n#if defined(BENCHMARK_OS_MACOSX)\n#include \n#include \n#include \n#endif\n#if defined(BENCHMARK_OS_QURT)\n#include \n#endif\n#endif\n\n#ifdef BENCHMARK_OS_EMSCRIPTEN\n#include \n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"check.h\"\n#include \"log.h\"\n#include \"string_util.h\"\n\nnamespace benchmark {\n\n// Suppress unused warnings on helper functions.\n#if defined(__GNUC__)\n#pragma GCC diagnostic ignored \"-Wunused-function\"\n#endif\n#if defined(__NVCOMPILER)\n#pragma diag_suppress declared_but_not_referenced\n#endif\n\nnamespace {\n#if defined(BENCHMARK_OS_WINDOWS)\ndouble MakeTime(FILETIME const& kernel_time, FILETIME const& user_time) {\n ULARGE_INTEGER kernel;\n ULARGE_INTEGER user;\n kernel.HighPart = kernel_time.dwHighDateTime;\n kernel.LowPart = kernel_time.dwLowDateTime;\n user.HighPart = user_time.dwHighDateTime;\n user.LowPart = user_time.dwLowDateTime;\n return (static_cast(kernel.QuadPart) +\n static_cast(user.QuadPart)) *\n 1e-7;\n}\n#elif !defined(BENCHMARK_OS_FUCHSIA) && !defined(BENCHMARK_OS_QURT)\ndouble MakeTime(struct rusage const& ru) {\n return (static_cast(ru.ru_utime.tv_sec) +\n static_cast(ru.ru_utime.tv_usec) * 1e-6 +\n static_cast(ru.ru_stime.tv_sec) +\n static_cast(ru.ru_stime.tv_usec) * 1e-6);\n}\n#endif\n#if defined(BENCHMARK_OS_MACOSX)\ndouble MakeTime(thread_basic_info_data_t const& info) {\n return (static_cast(info.user_time.seconds) +\n static_cast(info.user_time.microseconds) * 1e-6 +\n static_cast(info.system_time.seconds) +\n static_cast(info.system_time.microseconds) * 1e-6);\n}\n#endif\n#if defined(CLOCK_PROCESS_CPUTIME_ID) || defined(CLOCK_THREAD_CPUTIME_ID)\ndouble MakeTime(struct timespec const& ts) {\n return ts.tv_sec + (static_cast(ts.tv_nsec) * 1e-9);\n}\n#endif\n\nBENCHMARK_NORETURN static void DiagnoseAndExit(const char* msg) {\n std::cerr << \"ERROR: \" << msg << std::endl;\n std::exit(EXIT_FAILURE);\n}\n\n} // end namespace\n\ndouble ProcessCPUUsage() {\n#if defined(BENCHMARK_OS_WINDOWS)\n HANDLE proc = GetCurrentProcess();\n FILETIME creation_time;\n FILETIME exit_time;\n FILETIME kernel_time;\n FILETIME user_time;\n if (GetProcessTimes(proc, &creation_time, &exit_time, &kernel_time,\n &user_time))\n return MakeTime(kernel_time, user_time);\n DiagnoseAndExit(\"GetProccessTimes() failed\");\n#elif defined(BENCHMARK_OS_QURT)\n return static_cast(\n qurt_timer_timetick_to_us(qurt_timer_get_ticks())) *\n 1.0e-6;\n#elif defined(BENCHMARK_OS_EMSCRIPTEN)\n // clock_gettime(CLOCK_PROCESS_CPUTIME_ID, ...) returns 0 on Emscripten.\n // Use Emscripten-specific API. Reported CPU time would be exactly the\n // same as total time, but this is ok because there aren't long-latency\n // synchronous system calls in Emscripten.\n return emscripten_get_now() * 1e-3;\n#elif defined(CLOCK_PROCESS_CPUTIME_ID) && !defined(BENCHMARK_OS_MACOSX)\n // FIXME We want to use clock_gettime, but its not available in MacOS 10.11.\n // See https://github.com/google/benchmark/pull/292\n struct timespec spec;\n if (clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &spec) == 0)\n return MakeTime(spec);\n DiagnoseAndExit(\"clock_gettime(CLOCK_PROCESS_CPUTIME_ID, ...) failed\");\n#else\n struct rusage ru;\n if (getrusage(RUSAGE_SELF, &ru) == 0) return MakeTime(ru);\n DiagnoseAndExit(\"getrusage(RUSAGE_SELF, ...) failed\");\n#endif\n}\n\ndouble ThreadCPUUsage() {\n#if defined(BENCHMARK_OS_WINDOWS)\n HANDLE this_thread = GetCurrentThread();\n FILETIME creation_time;\n FILETIME exit_time;\n FILETIME kernel_time;\n FILETIME user_time;\n GetThreadTimes(this_thread, &creation_time, &exit_time, &kernel_time,\n &user_time);\n return MakeTime(kernel_time, user_time);\n#elif defined(BENCHMARK_OS_QURT)\n return static_cast(\n qurt_timer_timetick_to_us(qurt_timer_get_ticks())) *\n 1.0e-6;\n#elif defined(BENCHMARK_OS_MACOSX)\n // FIXME We want to use clock_gettime, but its not available in MacOS 10.11.\n // See https://github.com/google/benchmark/pull/292\n mach_msg_type_number_t count = THREAD_BASIC_INFO_COUNT;\n thread_basic_info_data_t info;\n mach_port_t thread = pthread_mach_thread_np(pthread_self());\n if (thread_info(thread, THREAD_BASIC_INFO,\n reinterpret_cast(&info),\n &count) == KERN_SUCCESS) {\n return MakeTime(info);\n }\n DiagnoseAndExit(\"ThreadCPUUsage() failed when evaluating thread_info\");\n#elif defined(BENCHMARK_OS_EMSCRIPTEN)\n // Emscripten doesn't support traditional threads\n return ProcessCPUUsage();\n#elif defined(BENCHMARK_OS_RTEMS)\n // RTEMS doesn't support CLOCK_THREAD_CPUTIME_ID. See\n // https://github.com/RTEMS/rtems/blob/master/cpukit/posix/src/clockgettime.c\n return ProcessCPUUsage();\n#elif defined(BENCHMARK_OS_SOLARIS)\n struct rusage ru;\n if (getrusage(RUSAGE_LWP, &ru) == 0) return MakeTime(ru);\n DiagnoseAndExit(\"getrusage(RUSAGE_LWP, ...) failed\");\n#elif defined(CLOCK_THREAD_CPUTIME_ID)\n struct timespec ts;\n if (clock_gettime(CLOCK_THREAD_CPUTIME_ID, &ts) == 0) return MakeTime(ts);\n DiagnoseAndExit(\"clock_gettime(CLOCK_THREAD_CPUTIME_ID, ...) failed\");\n#else\n#error Per-thread timing is not available on your system.\n#endif\n}\n\nstd::string LocalDateTimeString() {\n // Write the local time in RFC3339 format yyyy-mm-ddTHH:MM:SS+/-HH:MM.\n typedef std::chrono::system_clock Clock;\n std::time_t now = Clock::to_time_t(Clock::now());\n const std::size_t kTzOffsetLen = 6;\n const std::size_t kTimestampLen = 19;\n\n std::size_t tz_len;\n std::size_t timestamp_len;\n long int offset_minutes;\n char tz_offset_sign = '+';\n // tz_offset is set in one of three ways:\n // * strftime with %z - This either returns empty or the ISO 8601 time. The\n // maximum length an\n // ISO 8601 string can be is 7 (e.g. -03:30, plus trailing zero).\n // * snprintf with %c%02li:%02li - The maximum length is 41 (one for %c, up to\n // 19 for %02li,\n // one for :, up to 19 %02li, plus trailing zero).\n // * A fixed string of \"-00:00\". The maximum length is 7 (-00:00, plus\n // trailing zero).\n //\n // Thus, the maximum size this needs to be is 41.\n char tz_offset[41];\n // Long enough buffer to avoid format-overflow warnings\n char storage[128];\n\n#if defined(BENCHMARK_OS_WINDOWS)\n std::tm* timeinfo_p = ::localtime(&now);\n#else\n std::tm timeinfo;\n std::tm* timeinfo_p = &timeinfo;\n ::localtime_r(&now, &timeinfo);\n#endif\n\n tz_len = std::strftime(tz_offset, sizeof(tz_offset), \"%z\", timeinfo_p);\n\n if (tz_len < kTzOffsetLen && tz_len > 1) {\n // Timezone offset was written. strftime writes offset as +HHMM or -HHMM,\n // RFC3339 specifies an offset as +HH:MM or -HH:MM. To convert, we parse\n // the offset as an integer, then reprint it to a string.\n\n offset_minutes = ::strtol(tz_offset, NULL, 10);\n if (offset_minutes < 0) {\n offset_minutes *= -1;\n tz_offset_sign = '-';\n }\n\n tz_len =\n ::snprintf(tz_offset, sizeof(tz_offset), \"%c%02li:%02li\",\n tz_offset_sign, offset_minutes / 100, offset_minutes % 100);\n BM_CHECK(tz_len == kTzOffsetLen);\n ((void)tz_len); // Prevent unused variable warning in optimized build.\n } else {\n // Unknown offset. RFC3339 specifies that unknown local offsets should be\n // written as UTC time with -00:00 timezone.\n#if defined(BENCHMARK_OS_WINDOWS)\n // Potential race condition if another thread calls localtime or gmtime.\n timeinfo_p = ::gmtime(&now);\n#else\n ::gmtime_r(&now, &timeinfo);\n#endif\n\n strncpy(tz_offset, \"-00:00\", kTzOffsetLen + 1);\n }\n\n timestamp_len =\n std::strftime(storage, sizeof(storage), \"%Y-%m-%dT%H:%M:%S\", timeinfo_p);\n BM_CHECK(timestamp_len == kTimestampLen);\n // Prevent unused variable warning in optimized build.\n ((void)kTimestampLen);\n\n std::strncat(storage, tz_offset, sizeof(storage) - timestamp_len - 1);\n return std::string(storage);\n}\n\n} // end namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/src/timers.h", "content": "#ifndef BENCHMARK_TIMERS_H\n#define BENCHMARK_TIMERS_H\n\n#include \n#include \n\nnamespace benchmark {\n\n// Return the CPU usage of the current process\ndouble ProcessCPUUsage();\n\n// Return the CPU usage of the children of the current process\ndouble ChildrenCPUUsage();\n\n// Return the CPU usage of the current thread\ndouble ThreadCPUUsage();\n\n#if defined(HAVE_STEADY_CLOCK)\ntemplate \nstruct ChooseSteadyClock {\n typedef std::chrono::high_resolution_clock type;\n};\n\ntemplate <>\nstruct ChooseSteadyClock {\n typedef std::chrono::steady_clock type;\n};\n#endif\n\nstruct ChooseClockType {\n#if defined(HAVE_STEADY_CLOCK)\n typedef ChooseSteadyClock<>::type type;\n#else\n typedef std::chrono::high_resolution_clock type;\n#endif\n};\n\ninline double ChronoClockNow() {\n typedef ChooseClockType::type ClockType;\n using FpSeconds = std::chrono::duration;\n return FpSeconds(ClockType::now().time_since_epoch()).count();\n}\n\nstd::string LocalDateTimeString();\n\n} // end namespace benchmark\n\n#endif // BENCHMARK_TIMERS_H\n" }, { "path": "3rd/benchmark-1.8.2/test/BUILD", "content": "load(\"@rules_cc//cc:defs.bzl\", \"cc_library\", \"cc_test\")\n\nplatform(\n name = \"windows\",\n constraint_values = [\n \"@platforms//os:windows\",\n ],\n)\n\nTEST_COPTS = [\n \"-pedantic\",\n \"-pedantic-errors\",\n \"-std=c++11\",\n \"-Wall\",\n \"-Wconversion\",\n \"-Wextra\",\n \"-Wshadow\",\n # \"-Wshorten-64-to-32\",\n \"-Wfloat-equal\",\n \"-fstrict-aliasing\",\n]\n\n# Some of the issues with DoNotOptimize only occur when optimization is enabled\nPER_SRC_COPTS = {\n \"donotoptimize_test.cc\": [\"-O3\"],\n}\n\nTEST_ARGS = [\"--benchmark_min_time=0.01s\"]\n\nPER_SRC_TEST_ARGS = {\n \"user_counters_tabular_test.cc\": [\"--benchmark_counters_tabular=true\"],\n \"repetitions_test.cc\": [\" --benchmark_repetitions=3\"],\n \"spec_arg_test.cc\": [\"--benchmark_filter=BM_NotChosen\"],\n \"spec_arg_verbosity_test.cc\": [\"--v=42\"],\n}\n\ncc_library(\n name = \"output_test_helper\",\n testonly = 1,\n srcs = [\"output_test_helper.cc\"],\n hdrs = [\"output_test.h\"],\n copts = select({\n \"//:windows\": [],\n \"//conditions:default\": TEST_COPTS,\n }),\n deps = [\n \"//:benchmark\",\n \"//:benchmark_internal_headers\",\n ],\n)\n\n[\n cc_test(\n name = test_src[:-len(\".cc\")],\n size = \"small\",\n srcs = [test_src],\n args = TEST_ARGS + PER_SRC_TEST_ARGS.get(test_src, []),\n copts = select({\n \"//:windows\": [],\n \"//conditions:default\": TEST_COPTS,\n }) + PER_SRC_COPTS.get(test_src, []),\n deps = [\n \":output_test_helper\",\n \"//:benchmark\",\n \"//:benchmark_internal_headers\",\n \"@com_google_googletest//:gtest\",\n \"@com_google_googletest//:gtest_main\",\n ],\n # FIXME: Add support for assembly tests to bazel.\n # See Issue #556\n # https://github.com/google/benchmark/issues/556\n )\n for test_src in glob(\n [\"*test.cc\"],\n exclude = [\n \"*_assembly_test.cc\",\n \"cxx03_test.cc\",\n \"link_main_test.cc\",\n ],\n )\n]\n\ncc_test(\n name = \"cxx03_test\",\n size = \"small\",\n srcs = [\"cxx03_test.cc\"],\n copts = TEST_COPTS + [\"-std=c++03\"],\n target_compatible_with = select({\n \"//:windows\": [\"@platforms//:incompatible\"],\n \"//conditions:default\": [],\n }),\n deps = [\n \":output_test_helper\",\n \"//:benchmark\",\n \"//:benchmark_internal_headers\",\n \"@com_google_googletest//:gtest\",\n \"@com_google_googletest//:gtest_main\",\n ],\n)\n\ncc_test(\n name = \"link_main_test\",\n size = \"small\",\n srcs = [\"link_main_test.cc\"],\n copts = select({\n \"//:windows\": [],\n \"//conditions:default\": TEST_COPTS,\n }),\n deps = [\"//:benchmark_main\"],\n)\n" }, { "path": "3rd/benchmark-1.8.2/test/CMakeLists.txt", "content": "# Enable the tests\n\nset(THREADS_PREFER_PTHREAD_FLAG ON)\n\nfind_package(Threads REQUIRED)\ninclude(CheckCXXCompilerFlag)\n\n# NOTE: Some tests use `` to perform the test. Therefore we must\n# strip -DNDEBUG from the default CMake flags in DEBUG mode.\nstring(TOUPPER \"${CMAKE_BUILD_TYPE}\" uppercase_CMAKE_BUILD_TYPE)\nif( NOT uppercase_CMAKE_BUILD_TYPE STREQUAL \"DEBUG\" )\n add_definitions( -UNDEBUG )\n add_definitions(-DTEST_BENCHMARK_LIBRARY_HAS_NO_ASSERTIONS)\n # Also remove /D NDEBUG to avoid MSVC warnings about conflicting defines.\n foreach (flags_var_to_scrub\n CMAKE_CXX_FLAGS_RELEASE\n CMAKE_CXX_FLAGS_RELWITHDEBINFO\n CMAKE_CXX_FLAGS_MINSIZEREL\n CMAKE_C_FLAGS_RELEASE\n CMAKE_C_FLAGS_RELWITHDEBINFO\n CMAKE_C_FLAGS_MINSIZEREL)\n string (REGEX REPLACE \"(^| )[/-]D *NDEBUG($| )\" \" \"\n \"${flags_var_to_scrub}\" \"${${flags_var_to_scrub}}\")\n endforeach()\nendif()\n\nif (NOT BUILD_SHARED_LIBS)\n add_definitions(-DBENCHMARK_STATIC_DEFINE)\nendif()\n\ncheck_cxx_compiler_flag(-O3 BENCHMARK_HAS_O3_FLAG)\nset(BENCHMARK_O3_FLAG \"\")\nif (BENCHMARK_HAS_O3_FLAG)\n set(BENCHMARK_O3_FLAG \"-O3\")\nendif()\n\n# NOTE: These flags must be added after find_package(Threads REQUIRED) otherwise\n# they will break the configuration check.\nif (DEFINED BENCHMARK_CXX_LINKER_FLAGS)\n list(APPEND CMAKE_EXE_LINKER_FLAGS ${BENCHMARK_CXX_LINKER_FLAGS})\nendif()\n\nadd_library(output_test_helper STATIC output_test_helper.cc output_test.h)\ntarget_link_libraries(output_test_helper PRIVATE benchmark::benchmark)\n\nmacro(compile_benchmark_test name)\n add_executable(${name} \"${name}.cc\")\n target_link_libraries(${name} benchmark::benchmark ${CMAKE_THREAD_LIBS_INIT})\n if(\"${CMAKE_CXX_COMPILER_ID}\" STREQUAL \"NVHPC\")\n target_compile_options( ${name} PRIVATE --diag_suppress partial_override )\n endif()\nendmacro(compile_benchmark_test)\n\nmacro(compile_benchmark_test_with_main name)\n add_executable(${name} \"${name}.cc\")\n target_link_libraries(${name} benchmark::benchmark_main)\nendmacro(compile_benchmark_test_with_main)\n\nmacro(compile_output_test name)\n add_executable(${name} \"${name}.cc\" output_test.h)\n target_link_libraries(${name} output_test_helper benchmark::benchmark_main\n ${BENCHMARK_CXX_LIBRARIES} ${CMAKE_THREAD_LIBS_INIT})\nendmacro(compile_output_test)\n\n# Demonstration executable\ncompile_benchmark_test(benchmark_test)\nadd_test(NAME benchmark COMMAND benchmark_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(spec_arg_test)\nadd_test(NAME spec_arg COMMAND spec_arg_test --benchmark_filter=BM_NotChosen)\n\ncompile_benchmark_test(spec_arg_verbosity_test)\nadd_test(NAME spec_arg_verbosity COMMAND spec_arg_verbosity_test --v=42)\n\ncompile_benchmark_test(benchmark_setup_teardown_test)\nadd_test(NAME benchmark_setup_teardown COMMAND benchmark_setup_teardown_test)\n\ncompile_benchmark_test(filter_test)\nmacro(add_filter_test name filter expect)\n add_test(NAME ${name} COMMAND filter_test --benchmark_min_time=0.01s --benchmark_filter=${filter} ${expect})\n add_test(NAME ${name}_list_only COMMAND filter_test --benchmark_list_tests --benchmark_filter=${filter} ${expect})\nendmacro(add_filter_test)\n\ncompile_benchmark_test(benchmark_min_time_flag_time_test)\nadd_test(NAME min_time_flag_time COMMAND benchmark_min_time_flag_time_test)\n\ncompile_benchmark_test(benchmark_min_time_flag_iters_test)\nadd_test(NAME min_time_flag_iters COMMAND benchmark_min_time_flag_iters_test)\n\nadd_filter_test(filter_simple \"Foo\" 3)\nadd_filter_test(filter_simple_negative \"-Foo\" 2)\nadd_filter_test(filter_suffix \"BM_.*\" 4)\nadd_filter_test(filter_suffix_negative \"-BM_.*\" 1)\nadd_filter_test(filter_regex_all \".*\" 5)\nadd_filter_test(filter_regex_all_negative \"-.*\" 0)\nadd_filter_test(filter_regex_blank \"\" 5)\nadd_filter_test(filter_regex_blank_negative \"-\" 0)\nadd_filter_test(filter_regex_none \"monkey\" 0)\nadd_filter_test(filter_regex_none_negative \"-monkey\" 5)\nadd_filter_test(filter_regex_wildcard \".*Foo.*\" 3)\nadd_filter_test(filter_regex_wildcard_negative \"-.*Foo.*\" 2)\nadd_filter_test(filter_regex_begin \"^BM_.*\" 4)\nadd_filter_test(filter_regex_begin_negative \"-^BM_.*\" 1)\nadd_filter_test(filter_regex_begin2 \"^N\" 1)\nadd_filter_test(filter_regex_begin2_negative \"-^N\" 4)\nadd_filter_test(filter_regex_end \".*Ba$\" 1)\nadd_filter_test(filter_regex_end_negative \"-.*Ba$\" 4)\n\ncompile_benchmark_test(options_test)\nadd_test(NAME options_benchmarks COMMAND options_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(basic_test)\nadd_test(NAME basic_benchmark COMMAND basic_test --benchmark_min_time=0.01s)\n\ncompile_output_test(repetitions_test)\nadd_test(NAME repetitions_benchmark COMMAND repetitions_test --benchmark_min_time=0.01s --benchmark_repetitions=3)\n\ncompile_benchmark_test(diagnostics_test)\nadd_test(NAME diagnostics_test COMMAND diagnostics_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(skip_with_error_test)\nadd_test(NAME skip_with_error_test COMMAND skip_with_error_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(donotoptimize_test)\n# Enable errors for deprecated deprecations (DoNotOptimize(Tp const& value)).\ncheck_cxx_compiler_flag(-Werror=deprecated-declarations BENCHMARK_HAS_DEPRECATED_DECLARATIONS_FLAG)\nif (BENCHMARK_HAS_DEPRECATED_DECLARATIONS_FLAG)\n target_compile_options (donotoptimize_test PRIVATE \"-Werror=deprecated-declarations\")\nendif()\n# Some of the issues with DoNotOptimize only occur when optimization is enabled\ncheck_cxx_compiler_flag(-O3 BENCHMARK_HAS_O3_FLAG)\nif (BENCHMARK_HAS_O3_FLAG)\n set_target_properties(donotoptimize_test PROPERTIES COMPILE_FLAGS \"-O3\")\nendif()\nadd_test(NAME donotoptimize_test COMMAND donotoptimize_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(fixture_test)\nadd_test(NAME fixture_test COMMAND fixture_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(register_benchmark_test)\nadd_test(NAME register_benchmark_test COMMAND register_benchmark_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(map_test)\nadd_test(NAME map_test COMMAND map_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(multiple_ranges_test)\nadd_test(NAME multiple_ranges_test COMMAND multiple_ranges_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test(args_product_test)\nadd_test(NAME args_product_test COMMAND args_product_test --benchmark_min_time=0.01s)\n\ncompile_benchmark_test_with_main(link_main_test)\nadd_test(NAME link_main_test COMMAND link_main_test --benchmark_min_time=0.01s)\n\ncompile_output_test(reporter_output_test)\nadd_test(NAME reporter_output_test COMMAND reporter_output_test --benchmark_min_time=0.01s)\n\ncompile_output_test(templated_fixture_test)\nadd_test(NAME templated_fixture_test COMMAND templated_fixture_test --benchmark_min_time=0.01s)\n\ncompile_output_test(user_counters_test)\nadd_test(NAME user_counters_test COMMAND user_counters_test --benchmark_min_time=0.01s)\n\ncompile_output_test(perf_counters_test)\nadd_test(NAME perf_counters_test COMMAND perf_counters_test --benchmark_min_time=0.01s --benchmark_perf_counters=CYCLES,BRANCHES)\n\ncompile_output_test(internal_threading_test)\nadd_test(NAME internal_threading_test COMMAND internal_threading_test --benchmark_min_time=0.01s)\n\ncompile_output_test(report_aggregates_only_test)\nadd_test(NAME report_aggregates_only_test COMMAND report_aggregates_only_test --benchmark_min_time=0.01s)\n\ncompile_output_test(display_aggregates_only_test)\nadd_test(NAME display_aggregates_only_test COMMAND display_aggregates_only_test --benchmark_min_time=0.01s)\n\ncompile_output_test(user_counters_tabular_test)\nadd_test(NAME user_counters_tabular_test COMMAND user_counters_tabular_test --benchmark_counters_tabular=true --benchmark_min_time=0.01s)\n\ncompile_output_test(user_counters_thousands_test)\nadd_test(NAME user_counters_thousands_test COMMAND user_counters_thousands_test --benchmark_min_time=0.01s)\n\ncompile_output_test(memory_manager_test)\nadd_test(NAME memory_manager_test COMMAND memory_manager_test --benchmark_min_time=0.01s)\n\n# MSVC does not allow to set the language standard to C++98/03.\nif(NOT CMAKE_CXX_COMPILER_ID STREQUAL \"MSVC\")\n compile_benchmark_test(cxx03_test)\n set_target_properties(cxx03_test\n PROPERTIES\n CXX_STANDARD 98\n CXX_STANDARD_REQUIRED YES)\n # libstdc++ provides different definitions within between dialects. When\n # LTO is enabled and -Werror is specified GCC diagnoses this ODR violation\n # causing the test to fail to compile. To prevent this we explicitly disable\n # the warning.\n check_cxx_compiler_flag(-Wno-odr BENCHMARK_HAS_WNO_ODR)\n check_cxx_compiler_flag(-Wno-lto-type-mismatch BENCHMARK_HAS_WNO_LTO_TYPE_MISMATCH)\n # Cannot set_target_properties multiple times here because the warnings will\n # be overwritten on each call\n set (DISABLE_LTO_WARNINGS \"\")\n if (BENCHMARK_HAS_WNO_ODR)\n set(DISABLE_LTO_WARNINGS \"${DISABLE_LTO_WARNINGS} -Wno-odr\")\n endif()\n if (BENCHMARK_HAS_WNO_LTO_TYPE_MISMATCH)\n set(DISABLE_LTO_WARNINGS \"${DISABLE_LTO_WARNINGS} -Wno-lto-type-mismatch\")\n endif()\n set_target_properties(cxx03_test PROPERTIES LINK_FLAGS \"${DISABLE_LTO_WARNINGS}\")\n add_test(NAME cxx03 COMMAND cxx03_test --benchmark_min_time=0.01s)\nendif()\n\n# Attempt to work around flaky test failures when running on Appveyor servers.\nif (DEFINED ENV{APPVEYOR})\n set(COMPLEXITY_MIN_TIME \"0.5s\")\nelse()\n set(COMPLEXITY_MIN_TIME \"0.01s\")\nendif()\ncompile_output_test(complexity_test)\nadd_test(NAME complexity_benchmark COMMAND complexity_test --benchmark_min_time=${COMPLEXITY_MIN_TIME})\n\n###############################################################################\n# GoogleTest Unit Tests\n###############################################################################\n\nif (BENCHMARK_ENABLE_GTEST_TESTS)\n macro(compile_gtest name)\n add_executable(${name} \"${name}.cc\")\n target_link_libraries(${name} benchmark::benchmark\n gmock_main ${CMAKE_THREAD_LIBS_INIT})\n endmacro(compile_gtest)\n\n macro(add_gtest name)\n compile_gtest(${name})\n add_test(NAME ${name} COMMAND ${name})\n endmacro()\n\n add_gtest(benchmark_gtest)\n add_gtest(benchmark_name_gtest)\n add_gtest(benchmark_random_interleaving_gtest)\n add_gtest(commandlineflags_gtest)\n add_gtest(statistics_gtest)\n add_gtest(string_util_gtest)\n add_gtest(perf_counters_gtest)\n add_gtest(time_unit_gtest)\n add_gtest(min_time_parse_gtest)\nendif(BENCHMARK_ENABLE_GTEST_TESTS)\n\n###############################################################################\n# Assembly Unit Tests\n###############################################################################\n\nif (BENCHMARK_ENABLE_ASSEMBLY_TESTS)\n if (NOT LLVM_FILECHECK_EXE)\n message(FATAL_ERROR \"LLVM FileCheck is required when including this file\")\n endif()\n include(AssemblyTests.cmake)\n add_filecheck_test(donotoptimize_assembly_test)\n add_filecheck_test(state_assembly_test)\n add_filecheck_test(clobber_memory_assembly_test)\nendif()\n\n\n\n###############################################################################\n# Code Coverage Configuration\n###############################################################################\n\n# Add the coverage command(s)\nif(CMAKE_BUILD_TYPE)\n string(TOLOWER ${CMAKE_BUILD_TYPE} CMAKE_BUILD_TYPE_LOWER)\nendif()\nif (${CMAKE_BUILD_TYPE_LOWER} MATCHES \"coverage\")\n find_program(GCOV gcov)\n find_program(LCOV lcov)\n find_program(GENHTML genhtml)\n find_program(CTEST ctest)\n if (GCOV AND LCOV AND GENHTML AND CTEST AND HAVE_CXX_FLAG_COVERAGE)\n add_custom_command(\n OUTPUT ${CMAKE_BINARY_DIR}/lcov/index.html\n COMMAND ${LCOV} -q -z -d .\n COMMAND ${LCOV} -q --no-external -c -b \"${CMAKE_SOURCE_DIR}\" -d . -o before.lcov -i\n COMMAND ${CTEST} --force-new-ctest-process\n COMMAND ${LCOV} -q --no-external -c -b \"${CMAKE_SOURCE_DIR}\" -d . -o after.lcov\n COMMAND ${LCOV} -q -a before.lcov -a after.lcov --output-file final.lcov\n COMMAND ${LCOV} -q -r final.lcov \"'${CMAKE_SOURCE_DIR}/test/*'\" -o final.lcov\n COMMAND ${GENHTML} final.lcov -o lcov --demangle-cpp --sort -p \"${CMAKE_BINARY_DIR}\" -t benchmark\n DEPENDS filter_test benchmark_test options_test basic_test fixture_test cxx03_test complexity_test\n WORKING_DIRECTORY ${CMAKE_BINARY_DIR}\n COMMENT \"Running LCOV\"\n )\n add_custom_target(coverage\n DEPENDS ${CMAKE_BINARY_DIR}/lcov/index.html\n COMMENT \"LCOV report at lcov/index.html\"\n )\n message(STATUS \"Coverage command added\")\n else()\n if (HAVE_CXX_FLAG_COVERAGE)\n set(CXX_FLAG_COVERAGE_MESSAGE supported)\n else()\n set(CXX_FLAG_COVERAGE_MESSAGE unavailable)\n endif()\n message(WARNING\n \"Coverage not available:\\n\"\n \" gcov: ${GCOV}\\n\"\n \" lcov: ${LCOV}\\n\"\n \" genhtml: ${GENHTML}\\n\"\n \" ctest: ${CTEST}\\n\"\n \" --coverage flag: ${CXX_FLAG_COVERAGE_MESSAGE}\")\n endif()\nendif()\n" }, { "path": "3rd/benchmark-1.8.2/test/args_product_test.cc", "content": "#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\nclass ArgsProductFixture : public ::benchmark::Fixture {\n public:\n ArgsProductFixture()\n : expectedValues({{0, 100, 2000, 30000},\n {1, 15, 3, 8},\n {1, 15, 3, 9},\n {1, 15, 7, 8},\n {1, 15, 7, 9},\n {1, 15, 10, 8},\n {1, 15, 10, 9},\n {2, 15, 3, 8},\n {2, 15, 3, 9},\n {2, 15, 7, 8},\n {2, 15, 7, 9},\n {2, 15, 10, 8},\n {2, 15, 10, 9},\n {4, 5, 6, 11}}) {}\n\n void SetUp(const ::benchmark::State& state) override {\n std::vector ranges = {state.range(0), state.range(1),\n state.range(2), state.range(3)};\n\n assert(expectedValues.find(ranges) != expectedValues.end());\n\n actualValues.insert(ranges);\n }\n\n // NOTE: This is not TearDown as we want to check after _all_ runs are\n // complete.\n ~ArgsProductFixture() override {\n if (actualValues != expectedValues) {\n std::cout << \"EXPECTED\\n\";\n for (const auto& v : expectedValues) {\n std::cout << \"{\";\n for (int64_t iv : v) {\n std::cout << iv << \", \";\n }\n std::cout << \"}\\n\";\n }\n std::cout << \"ACTUAL\\n\";\n for (const auto& v : actualValues) {\n std::cout << \"{\";\n for (int64_t iv : v) {\n std::cout << iv << \", \";\n }\n std::cout << \"}\\n\";\n }\n }\n }\n\n std::set> expectedValues;\n std::set> actualValues;\n};\n\nBENCHMARK_DEFINE_F(ArgsProductFixture, Empty)(benchmark::State& state) {\n for (auto _ : state) {\n int64_t product =\n state.range(0) * state.range(1) * state.range(2) * state.range(3);\n for (int64_t x = 0; x < product; x++) {\n benchmark::DoNotOptimize(x);\n }\n }\n}\n\nBENCHMARK_REGISTER_F(ArgsProductFixture, Empty)\n ->Args({0, 100, 2000, 30000})\n ->ArgsProduct({{1, 2}, {15}, {3, 7, 10}, {8, 9}})\n ->Args({4, 5, 6, 11});\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/basic_test.cc", "content": "\n#include \"benchmark/benchmark.h\"\n\n#define BASIC_BENCHMARK_TEST(x) BENCHMARK(x)->Arg(8)->Arg(512)->Arg(8192)\n\nvoid BM_empty(benchmark::State& state) {\n for (auto _ : state) {\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n}\nBENCHMARK(BM_empty);\nBENCHMARK(BM_empty)->ThreadPerCpu();\n\nvoid BM_spin_empty(benchmark::State& state) {\n for (auto _ : state) {\n for (auto x = 0; x < state.range(0); ++x) {\n benchmark::DoNotOptimize(x);\n }\n }\n}\nBASIC_BENCHMARK_TEST(BM_spin_empty);\nBASIC_BENCHMARK_TEST(BM_spin_empty)->ThreadPerCpu();\n\nvoid BM_spin_pause_before(benchmark::State& state) {\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n for (auto _ : state) {\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n }\n}\nBASIC_BENCHMARK_TEST(BM_spin_pause_before);\nBASIC_BENCHMARK_TEST(BM_spin_pause_before)->ThreadPerCpu();\n\nvoid BM_spin_pause_during(benchmark::State& state) {\n for (auto _ : state) {\n state.PauseTiming();\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n state.ResumeTiming();\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n }\n}\nBASIC_BENCHMARK_TEST(BM_spin_pause_during);\nBASIC_BENCHMARK_TEST(BM_spin_pause_during)->ThreadPerCpu();\n\nvoid BM_pause_during(benchmark::State& state) {\n for (auto _ : state) {\n state.PauseTiming();\n state.ResumeTiming();\n }\n}\nBENCHMARK(BM_pause_during);\nBENCHMARK(BM_pause_during)->ThreadPerCpu();\nBENCHMARK(BM_pause_during)->UseRealTime();\nBENCHMARK(BM_pause_during)->UseRealTime()->ThreadPerCpu();\n\nvoid BM_spin_pause_after(benchmark::State& state) {\n for (auto _ : state) {\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n }\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n}\nBASIC_BENCHMARK_TEST(BM_spin_pause_after);\nBASIC_BENCHMARK_TEST(BM_spin_pause_after)->ThreadPerCpu();\n\nvoid BM_spin_pause_before_and_after(benchmark::State& state) {\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n for (auto _ : state) {\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n }\n for (auto i = 0; i < state.range(0); ++i) {\n benchmark::DoNotOptimize(i);\n }\n}\nBASIC_BENCHMARK_TEST(BM_spin_pause_before_and_after);\nBASIC_BENCHMARK_TEST(BM_spin_pause_before_and_after)->ThreadPerCpu();\n\nvoid BM_empty_stop_start(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_empty_stop_start);\nBENCHMARK(BM_empty_stop_start)->ThreadPerCpu();\n\nvoid BM_KeepRunning(benchmark::State& state) {\n benchmark::IterationCount iter_count = 0;\n assert(iter_count == state.iterations());\n while (state.KeepRunning()) {\n ++iter_count;\n }\n assert(iter_count == state.iterations());\n}\nBENCHMARK(BM_KeepRunning);\n\nvoid BM_KeepRunningBatch(benchmark::State& state) {\n // Choose a batch size >1000 to skip the typical runs with iteration\n // targets of 10, 100 and 1000. If these are not actually skipped the\n // bug would be detectable as consecutive runs with the same iteration\n // count. Below we assert that this does not happen.\n const benchmark::IterationCount batch_size = 1009;\n\n static benchmark::IterationCount prior_iter_count = 0;\n benchmark::IterationCount iter_count = 0;\n while (state.KeepRunningBatch(batch_size)) {\n iter_count += batch_size;\n }\n assert(state.iterations() == iter_count);\n\n // Verify that the iteration count always increases across runs (see\n // comment above).\n assert(iter_count == batch_size // max_iterations == 1\n || iter_count > prior_iter_count); // max_iterations > batch_size\n prior_iter_count = iter_count;\n}\n// Register with a fixed repetition count to establish the invariant that\n// the iteration count should always change across runs. This overrides\n// the --benchmark_repetitions command line flag, which would otherwise\n// cause this test to fail if set > 1.\nBENCHMARK(BM_KeepRunningBatch)->Repetitions(1);\n\nvoid BM_RangedFor(benchmark::State& state) {\n benchmark::IterationCount iter_count = 0;\n for (auto _ : state) {\n ++iter_count;\n }\n assert(iter_count == state.max_iterations);\n}\nBENCHMARK(BM_RangedFor);\n\n#ifdef BENCHMARK_HAS_CXX11\ntemplate \nvoid BM_OneTemplateFunc(benchmark::State& state) {\n auto arg = state.range(0);\n T sum = 0;\n for (auto _ : state) {\n sum += static_cast(arg);\n }\n}\nBENCHMARK(BM_OneTemplateFunc)->Arg(1);\nBENCHMARK(BM_OneTemplateFunc)->Arg(1);\n\ntemplate \nvoid BM_TwoTemplateFunc(benchmark::State& state) {\n auto arg = state.range(0);\n A sum = 0;\n B prod = 1;\n for (auto _ : state) {\n sum += static_cast(arg);\n prod *= static_cast(arg);\n }\n}\nBENCHMARK(BM_TwoTemplateFunc)->Arg(1);\nBENCHMARK(BM_TwoTemplateFunc)->Arg(1);\n\n#endif // BENCHMARK_HAS_CXX11\n\n// Ensure that StateIterator provides all the necessary typedefs required to\n// instantiate std::iterator_traits.\nstatic_assert(\n std::is_same::value_type,\n typename benchmark::State::StateIterator::value_type>::value,\n \"\");\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/benchmark_gtest.cc", "content": "#include \n#include \n#include \n\n#include \"../src/benchmark_register.h\"\n#include \"benchmark/benchmark.h\"\n#include \"gmock/gmock.h\"\n#include \"gtest/gtest.h\"\n\nnamespace benchmark {\nnamespace internal {\n\nnamespace {\n\nTEST(AddRangeTest, Simple) {\n std::vector dst;\n AddRange(&dst, 1, 2, 2);\n EXPECT_THAT(dst, testing::ElementsAre(1, 2));\n}\n\nTEST(AddRangeTest, Simple64) {\n std::vector dst;\n AddRange(&dst, static_cast(1), static_cast(2), 2);\n EXPECT_THAT(dst, testing::ElementsAre(1, 2));\n}\n\nTEST(AddRangeTest, Advanced) {\n std::vector dst;\n AddRange(&dst, 5, 15, 2);\n EXPECT_THAT(dst, testing::ElementsAre(5, 8, 15));\n}\n\nTEST(AddRangeTest, Advanced64) {\n std::vector dst;\n AddRange(&dst, static_cast(5), static_cast(15), 2);\n EXPECT_THAT(dst, testing::ElementsAre(5, 8, 15));\n}\n\nTEST(AddRangeTest, FullRange8) {\n std::vector dst;\n AddRange(&dst, int8_t{1}, std::numeric_limits::max(), int8_t{8});\n EXPECT_THAT(\n dst, testing::ElementsAre(int8_t{1}, int8_t{8}, int8_t{64}, int8_t{127}));\n}\n\nTEST(AddRangeTest, FullRange64) {\n std::vector dst;\n AddRange(&dst, int64_t{1}, std::numeric_limits::max(), 1024);\n EXPECT_THAT(\n dst, testing::ElementsAre(1LL, 1024LL, 1048576LL, 1073741824LL,\n 1099511627776LL, 1125899906842624LL,\n 1152921504606846976LL, 9223372036854775807LL));\n}\n\nTEST(AddRangeTest, NegativeRanges) {\n std::vector dst;\n AddRange(&dst, -8, 0, 2);\n EXPECT_THAT(dst, testing::ElementsAre(-8, -4, -2, -1, 0));\n}\n\nTEST(AddRangeTest, StrictlyNegative) {\n std::vector dst;\n AddRange(&dst, -8, -1, 2);\n EXPECT_THAT(dst, testing::ElementsAre(-8, -4, -2, -1));\n}\n\nTEST(AddRangeTest, SymmetricNegativeRanges) {\n std::vector dst;\n AddRange(&dst, -8, 8, 2);\n EXPECT_THAT(dst, testing::ElementsAre(-8, -4, -2, -1, 0, 1, 2, 4, 8));\n}\n\nTEST(AddRangeTest, SymmetricNegativeRangesOddMult) {\n std::vector dst;\n AddRange(&dst, -30, 32, 5);\n EXPECT_THAT(dst, testing::ElementsAre(-30, -25, -5, -1, 0, 1, 5, 25, 32));\n}\n\nTEST(AddRangeTest, NegativeRangesAsymmetric) {\n std::vector dst;\n AddRange(&dst, -3, 5, 2);\n EXPECT_THAT(dst, testing::ElementsAre(-3, -2, -1, 0, 1, 2, 4, 5));\n}\n\nTEST(AddRangeTest, NegativeRangesLargeStep) {\n // Always include -1, 0, 1 when crossing zero.\n std::vector dst;\n AddRange(&dst, -8, 8, 10);\n EXPECT_THAT(dst, testing::ElementsAre(-8, -1, 0, 1, 8));\n}\n\nTEST(AddRangeTest, ZeroOnlyRange) {\n std::vector dst;\n AddRange(&dst, 0, 0, 2);\n EXPECT_THAT(dst, testing::ElementsAre(0));\n}\n\nTEST(AddRangeTest, ZeroStartingRange) {\n std::vector dst;\n AddRange(&dst, 0, 2, 2);\n EXPECT_THAT(dst, testing::ElementsAre(0, 1, 2));\n}\n\nTEST(AddRangeTest, NegativeRange64) {\n std::vector dst;\n AddRange(&dst, -4, 4, 2);\n EXPECT_THAT(dst, testing::ElementsAre(-4, -2, -1, 0, 1, 2, 4));\n}\n\nTEST(AddRangeTest, NegativeRangePreservesExistingOrder) {\n // If elements already exist in the range, ensure we don't change\n // their ordering by adding negative values.\n std::vector dst = {1, 2, 3};\n AddRange(&dst, -2, 2, 2);\n EXPECT_THAT(dst, testing::ElementsAre(1, 2, 3, -2, -1, 0, 1, 2));\n}\n\nTEST(AddRangeTest, FullNegativeRange64) {\n std::vector dst;\n const auto min = std::numeric_limits::min();\n const auto max = std::numeric_limits::max();\n AddRange(&dst, min, max, 1024);\n EXPECT_THAT(\n dst, testing::ElementsAreArray(std::vector{\n min, -1152921504606846976LL, -1125899906842624LL,\n -1099511627776LL, -1073741824LL, -1048576LL, -1024LL, -1LL, 0LL,\n 1LL, 1024LL, 1048576LL, 1073741824LL, 1099511627776LL,\n 1125899906842624LL, 1152921504606846976LL, max}));\n}\n\nTEST(AddRangeTest, Simple8) {\n std::vector dst;\n AddRange(&dst, int8_t{1}, int8_t{8}, int8_t{2});\n EXPECT_THAT(dst,\n testing::ElementsAre(int8_t{1}, int8_t{2}, int8_t{4}, int8_t{8}));\n}\n\nTEST(AddCustomContext, Simple) {\n std::map *&global_context = GetGlobalContext();\n EXPECT_THAT(global_context, nullptr);\n\n AddCustomContext(\"foo\", \"bar\");\n AddCustomContext(\"baz\", \"qux\");\n\n EXPECT_THAT(*global_context,\n testing::UnorderedElementsAre(testing::Pair(\"foo\", \"bar\"),\n testing::Pair(\"baz\", \"qux\")));\n\n delete global_context;\n global_context = nullptr;\n}\n\nTEST(AddCustomContext, DuplicateKey) {\n std::map *&global_context = GetGlobalContext();\n EXPECT_THAT(global_context, nullptr);\n\n AddCustomContext(\"foo\", \"bar\");\n AddCustomContext(\"foo\", \"qux\");\n\n EXPECT_THAT(*global_context,\n testing::UnorderedElementsAre(testing::Pair(\"foo\", \"bar\")));\n\n delete global_context;\n global_context = nullptr;\n}\n\n} // namespace\n} // namespace internal\n} // namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/test/benchmark_min_time_flag_iters_test.cc", "content": "#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\n// Tests that we can specify the number of iterations with\n// --benchmark_min_time=x.\nnamespace {\n\nclass TestReporter : public benchmark::ConsoleReporter {\n public:\n virtual bool ReportContext(const Context& context) BENCHMARK_OVERRIDE {\n return ConsoleReporter::ReportContext(context);\n };\n\n virtual void ReportRuns(const std::vector& report) BENCHMARK_OVERRIDE {\n assert(report.size() == 1);\n iter_nums_.push_back(report[0].iterations);\n ConsoleReporter::ReportRuns(report);\n };\n\n TestReporter() {}\n\n virtual ~TestReporter() {}\n\n const std::vector& GetIters() const {\n return iter_nums_;\n }\n\n private:\n std::vector iter_nums_;\n};\n\n} // end namespace\n\nstatic void BM_MyBench(benchmark::State& state) {\n for (auto s : state) {\n }\n}\nBENCHMARK(BM_MyBench);\n\nint main(int argc, char** argv) {\n // Make a fake argv and append the new --benchmark_min_time= to it.\n int fake_argc = argc + 1;\n const char** fake_argv = new const char*[static_cast(fake_argc)];\n for (int i = 0; i < argc; ++i) fake_argv[i] = argv[i];\n fake_argv[argc] = \"--benchmark_min_time=4x\";\n\n benchmark::Initialize(&fake_argc, const_cast(fake_argv));\n\n TestReporter test_reporter;\n const size_t returned_count =\n benchmark::RunSpecifiedBenchmarks(&test_reporter, \"BM_MyBench\");\n assert(returned_count == 1);\n\n // Check the executed iters.\n const std::vector iters = test_reporter.GetIters();\n assert(!iters.empty() && iters[0] == 4);\n\n delete[] fake_argv;\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/benchmark_min_time_flag_time_test.cc", "content": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\n// Tests that we can specify the min time with\n// --benchmark_min_time= (no suffix needed) OR\n// --benchmark_min_time=s\nnamespace {\n\n// This is from benchmark.h\ntypedef int64_t IterationCount;\n\nclass TestReporter : public benchmark::ConsoleReporter {\n public:\n virtual bool ReportContext(const Context& context) BENCHMARK_OVERRIDE {\n return ConsoleReporter::ReportContext(context);\n };\n\n virtual void ReportRuns(const std::vector& report) BENCHMARK_OVERRIDE {\n assert(report.size() == 1);\n ConsoleReporter::ReportRuns(report);\n };\n\n virtual void ReportRunsConfig(double min_time, bool /* has_explicit_iters */,\n IterationCount /* iters */) BENCHMARK_OVERRIDE {\n min_times_.push_back(min_time);\n }\n\n TestReporter() {}\n\n virtual ~TestReporter() {}\n\n const std::vector& GetMinTimes() const { return min_times_; }\n\n private:\n std::vector min_times_;\n};\n\nbool AlmostEqual(double a, double b) {\n return std::fabs(a - b) < std::numeric_limits::epsilon();\n}\n\nvoid DoTestHelper(int* argc, const char** argv, double expected) {\n benchmark::Initialize(argc, const_cast(argv));\n\n TestReporter test_reporter;\n const size_t returned_count =\n benchmark::RunSpecifiedBenchmarks(&test_reporter, \"BM_MyBench\");\n assert(returned_count == 1);\n\n // Check the min_time\n const std::vector& min_times = test_reporter.GetMinTimes();\n assert(!min_times.empty() && AlmostEqual(min_times[0], expected));\n}\n\n} // end namespace\n\nstatic void BM_MyBench(benchmark::State& state) {\n for (auto s : state) {\n }\n}\nBENCHMARK(BM_MyBench);\n\nint main(int argc, char** argv) {\n // Make a fake argv and append the new --benchmark_min_time= to it.\n int fake_argc = argc + 1;\n const char** fake_argv = new const char*[static_cast(fake_argc)];\n\n for (int i = 0; i < argc; ++i) fake_argv[i] = argv[i];\n\n const char* no_suffix = \"--benchmark_min_time=4\";\n const char* with_suffix = \"--benchmark_min_time=4.0s\";\n double expected = 4.0;\n\n fake_argv[argc] = no_suffix;\n DoTestHelper(&fake_argc, fake_argv, expected);\n\n fake_argv[argc] = with_suffix;\n DoTestHelper(&fake_argc, fake_argv, expected);\n\n delete[] fake_argv;\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/benchmark_name_gtest.cc", "content": "#include \"benchmark/benchmark.h\"\n#include \"gtest/gtest.h\"\n\nnamespace {\n\nusing namespace benchmark;\nusing namespace benchmark::internal;\n\nTEST(BenchmarkNameTest, Empty) {\n const auto name = BenchmarkName();\n EXPECT_EQ(name.str(), std::string());\n}\n\nTEST(BenchmarkNameTest, FunctionName) {\n auto name = BenchmarkName();\n name.function_name = \"function_name\";\n EXPECT_EQ(name.str(), \"function_name\");\n}\n\nTEST(BenchmarkNameTest, FunctionNameAndArgs) {\n auto name = BenchmarkName();\n name.function_name = \"function_name\";\n name.args = \"some_args:3/4/5\";\n EXPECT_EQ(name.str(), \"function_name/some_args:3/4/5\");\n}\n\nTEST(BenchmarkNameTest, MinTime) {\n auto name = BenchmarkName();\n name.function_name = \"function_name\";\n name.args = \"some_args:3/4\";\n name.min_time = \"min_time:3.4s\";\n EXPECT_EQ(name.str(), \"function_name/some_args:3/4/min_time:3.4s\");\n}\n\nTEST(BenchmarkNameTest, MinWarmUpTime) {\n auto name = BenchmarkName();\n name.function_name = \"function_name\";\n name.args = \"some_args:3/4\";\n name.min_warmup_time = \"min_warmup_time:3.5s\";\n EXPECT_EQ(name.str(), \"function_name/some_args:3/4/min_warmup_time:3.5s\");\n}\n\nTEST(BenchmarkNameTest, Iterations) {\n auto name = BenchmarkName();\n name.function_name = \"function_name\";\n name.min_time = \"min_time:3.4s\";\n name.iterations = \"iterations:42\";\n EXPECT_EQ(name.str(), \"function_name/min_time:3.4s/iterations:42\");\n}\n\nTEST(BenchmarkNameTest, Repetitions) {\n auto name = BenchmarkName();\n name.function_name = \"function_name\";\n name.min_time = \"min_time:3.4s\";\n name.repetitions = \"repetitions:24\";\n EXPECT_EQ(name.str(), \"function_name/min_time:3.4s/repetitions:24\");\n}\n\nTEST(BenchmarkNameTest, TimeType) {\n auto name = BenchmarkName();\n name.function_name = \"function_name\";\n name.min_time = \"min_time:3.4s\";\n name.time_type = \"hammer_time\";\n EXPECT_EQ(name.str(), \"function_name/min_time:3.4s/hammer_time\");\n}\n\nTEST(BenchmarkNameTest, Threads) {\n auto name = BenchmarkName();\n name.function_name = \"function_name\";\n name.min_time = \"min_time:3.4s\";\n name.threads = \"threads:256\";\n EXPECT_EQ(name.str(), \"function_name/min_time:3.4s/threads:256\");\n}\n\nTEST(BenchmarkNameTest, TestEmptyFunctionName) {\n auto name = BenchmarkName();\n name.args = \"first:3/second:4\";\n name.threads = \"threads:22\";\n EXPECT_EQ(name.str(), \"first:3/second:4/threads:22\");\n}\n\n} // end namespace\n" }, { "path": "3rd/benchmark-1.8.2/test/benchmark_random_interleaving_gtest.cc", "content": "#include \n#include \n#include \n\n#include \"../src/commandlineflags.h\"\n#include \"../src/string_util.h\"\n#include \"benchmark/benchmark.h\"\n#include \"gmock/gmock.h\"\n#include \"gtest/gtest.h\"\n\nnamespace benchmark {\n\nBM_DECLARE_bool(benchmark_enable_random_interleaving);\nBM_DECLARE_string(benchmark_filter);\nBM_DECLARE_int32(benchmark_repetitions);\n\nnamespace internal {\nnamespace {\n\nclass EventQueue : public std::queue {\n public:\n void Put(const std::string& event) { push(event); }\n\n void Clear() {\n while (!empty()) {\n pop();\n }\n }\n\n std::string Get() {\n std::string event = front();\n pop();\n return event;\n }\n};\n\nEventQueue* queue = new EventQueue();\n\nclass NullReporter : public BenchmarkReporter {\n public:\n bool ReportContext(const Context& /*context*/) override { return true; }\n void ReportRuns(const std::vector& /* report */) override {}\n};\n\nclass BenchmarkTest : public testing::Test {\n public:\n static void SetupHook(int /* num_threads */) { queue->push(\"Setup\"); }\n\n static void TeardownHook(int /* num_threads */) { queue->push(\"Teardown\"); }\n\n void Execute(const std::string& pattern) {\n queue->Clear();\n\n std::unique_ptr reporter(new NullReporter());\n FLAGS_benchmark_filter = pattern;\n RunSpecifiedBenchmarks(reporter.get());\n\n queue->Put(\"DONE\"); // End marker\n }\n};\n\nvoid BM_Match1(benchmark::State& state) {\n const int64_t arg = state.range(0);\n\n for (auto _ : state) {\n }\n queue->Put(StrFormat(\"BM_Match1/%d\", static_cast(arg)));\n}\nBENCHMARK(BM_Match1)\n ->Iterations(100)\n ->Arg(1)\n ->Arg(2)\n ->Arg(3)\n ->Range(10, 80)\n ->Args({90})\n ->Args({100});\n\nTEST_F(BenchmarkTest, Match1) {\n Execute(\"BM_Match1\");\n ASSERT_EQ(\"BM_Match1/1\", queue->Get());\n ASSERT_EQ(\"BM_Match1/2\", queue->Get());\n ASSERT_EQ(\"BM_Match1/3\", queue->Get());\n ASSERT_EQ(\"BM_Match1/10\", queue->Get());\n ASSERT_EQ(\"BM_Match1/64\", queue->Get());\n ASSERT_EQ(\"BM_Match1/80\", queue->Get());\n ASSERT_EQ(\"BM_Match1/90\", queue->Get());\n ASSERT_EQ(\"BM_Match1/100\", queue->Get());\n ASSERT_EQ(\"DONE\", queue->Get());\n}\n\nTEST_F(BenchmarkTest, Match1WithRepetition) {\n FLAGS_benchmark_repetitions = 2;\n\n Execute(\"BM_Match1/(64|80)\");\n ASSERT_EQ(\"BM_Match1/64\", queue->Get());\n ASSERT_EQ(\"BM_Match1/64\", queue->Get());\n ASSERT_EQ(\"BM_Match1/80\", queue->Get());\n ASSERT_EQ(\"BM_Match1/80\", queue->Get());\n ASSERT_EQ(\"DONE\", queue->Get());\n}\n\nTEST_F(BenchmarkTest, Match1WithRandomInterleaving) {\n FLAGS_benchmark_enable_random_interleaving = true;\n FLAGS_benchmark_repetitions = 100;\n\n std::map element_count;\n std::map interleaving_count;\n Execute(\"BM_Match1/(64|80)\");\n for (int i = 0; i < 100; ++i) {\n std::vector interleaving;\n interleaving.push_back(queue->Get());\n interleaving.push_back(queue->Get());\n element_count[interleaving[0]]++;\n element_count[interleaving[1]]++;\n interleaving_count[StrFormat(\"%s,%s\", interleaving[0].c_str(),\n interleaving[1].c_str())]++;\n }\n EXPECT_EQ(element_count[\"BM_Match1/64\"], 100) << \"Unexpected repetitions.\";\n EXPECT_EQ(element_count[\"BM_Match1/80\"], 100) << \"Unexpected repetitions.\";\n EXPECT_GE(interleaving_count.size(), 2) << \"Interleaving was not randomized.\";\n ASSERT_EQ(\"DONE\", queue->Get());\n}\n\n} // namespace\n} // namespace internal\n} // namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/test/benchmark_setup_teardown_test.cc", "content": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\n// Test that Setup() and Teardown() are called exactly once\n// for each benchmark run (single-threaded).\nnamespace singlethreaded {\nstatic int setup_call = 0;\nstatic int teardown_call = 0;\n} // namespace singlethreaded\nstatic void DoSetup1(const benchmark::State& state) {\n ++singlethreaded::setup_call;\n\n // Setup/Teardown should never be called with any thread_idx != 0.\n assert(state.thread_index() == 0);\n}\n\nstatic void DoTeardown1(const benchmark::State& state) {\n ++singlethreaded::teardown_call;\n assert(state.thread_index() == 0);\n}\n\nstatic void BM_with_setup(benchmark::State& state) {\n for (auto s : state) {\n }\n}\nBENCHMARK(BM_with_setup)\n ->Arg(1)\n ->Arg(3)\n ->Arg(5)\n ->Arg(7)\n ->Iterations(100)\n ->Setup(DoSetup1)\n ->Teardown(DoTeardown1);\n\n// Test that Setup() and Teardown() are called once for each group of threads.\nnamespace concurrent {\nstatic std::atomic setup_call(0);\nstatic std::atomic teardown_call(0);\nstatic std::atomic func_call(0);\n} // namespace concurrent\n\nstatic void DoSetup2(const benchmark::State& state) {\n concurrent::setup_call.fetch_add(1, std::memory_order_acquire);\n assert(state.thread_index() == 0);\n}\n\nstatic void DoTeardown2(const benchmark::State& state) {\n concurrent::teardown_call.fetch_add(1, std::memory_order_acquire);\n assert(state.thread_index() == 0);\n}\n\nstatic void BM_concurrent(benchmark::State& state) {\n for (auto s : state) {\n }\n concurrent::func_call.fetch_add(1, std::memory_order_acquire);\n}\n\nBENCHMARK(BM_concurrent)\n ->Setup(DoSetup2)\n ->Teardown(DoTeardown2)\n ->Iterations(100)\n ->Threads(5)\n ->Threads(10)\n ->Threads(15);\n\n// Testing interaction with Fixture::Setup/Teardown\nnamespace fixture_interaction {\nint setup = 0;\nint fixture_setup = 0;\n} // namespace fixture_interaction\n\n#define FIXTURE_BECHMARK_NAME MyFixture\n\nclass FIXTURE_BECHMARK_NAME : public ::benchmark::Fixture {\n public:\n void SetUp(const ::benchmark::State&) override {\n fixture_interaction::fixture_setup++;\n }\n\n ~FIXTURE_BECHMARK_NAME() override {}\n};\n\nBENCHMARK_F(FIXTURE_BECHMARK_NAME, BM_WithFixture)(benchmark::State& st) {\n for (auto _ : st) {\n }\n}\n\nstatic void DoSetupWithFixture(const benchmark::State&) {\n fixture_interaction::setup++;\n}\n\nBENCHMARK_REGISTER_F(FIXTURE_BECHMARK_NAME, BM_WithFixture)\n ->Arg(1)\n ->Arg(3)\n ->Arg(5)\n ->Arg(7)\n ->Setup(DoSetupWithFixture)\n ->Repetitions(1)\n ->Iterations(100);\n\n// Testing repetitions.\nnamespace repetitions {\nint setup = 0;\n}\n\nstatic void DoSetupWithRepetitions(const benchmark::State&) {\n repetitions::setup++;\n}\nstatic void BM_WithRep(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\n\nBENCHMARK(BM_WithRep)\n ->Arg(1)\n ->Arg(3)\n ->Arg(5)\n ->Arg(7)\n ->Setup(DoSetupWithRepetitions)\n ->Iterations(100)\n ->Repetitions(4);\n\nint main(int argc, char** argv) {\n benchmark::Initialize(&argc, argv);\n\n size_t ret = benchmark::RunSpecifiedBenchmarks(\".\");\n assert(ret > 0);\n\n // Setup/Teardown is called once for each arg group (1,3,5,7).\n assert(singlethreaded::setup_call == 4);\n assert(singlethreaded::teardown_call == 4);\n\n // 3 group of threads calling this function (3,5,10).\n assert(concurrent::setup_call.load(std::memory_order_relaxed) == 3);\n assert(concurrent::teardown_call.load(std::memory_order_relaxed) == 3);\n assert((5 + 10 + 15) ==\n concurrent::func_call.load(std::memory_order_relaxed));\n\n // Setup is called 4 times, once for each arg group (1,3,5,7)\n assert(fixture_interaction::setup == 4);\n // Fixture::Setup is called every time the bm routine is run.\n // The exact number is indeterministic, so we just assert that\n // it's more than setup.\n assert(fixture_interaction::fixture_setup > fixture_interaction::setup);\n\n // Setup is call once for each repetition * num_arg = 4 * 4 = 16.\n assert(repetitions::setup == 16);\n\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/benchmark_test.cc", "content": "#include \"benchmark/benchmark.h\"\n\n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#if defined(__GNUC__)\n#define BENCHMARK_NOINLINE __attribute__((noinline))\n#else\n#define BENCHMARK_NOINLINE\n#endif\n\nnamespace {\n\nint BENCHMARK_NOINLINE Factorial(int n) {\n return (n == 1) ? 1 : n * Factorial(n - 1);\n}\n\ndouble CalculatePi(int depth) {\n double pi = 0.0;\n for (int i = 0; i < depth; ++i) {\n double numerator = static_cast(((i % 2) * 2) - 1);\n double denominator = static_cast((2 * i) - 1);\n pi += numerator / denominator;\n }\n return (pi - 1.0) * 4;\n}\n\nstd::set ConstructRandomSet(int64_t size) {\n std::set s;\n for (int i = 0; i < size; ++i) s.insert(s.end(), i);\n return s;\n}\n\nstd::mutex test_vector_mu;\nstd::vector* test_vector = nullptr;\n\n} // end namespace\n\nstatic void BM_Factorial(benchmark::State& state) {\n int fac_42 = 0;\n for (auto _ : state) fac_42 = Factorial(8);\n // Prevent compiler optimizations\n std::stringstream ss;\n ss << fac_42;\n state.SetLabel(ss.str());\n}\nBENCHMARK(BM_Factorial);\nBENCHMARK(BM_Factorial)->UseRealTime();\n\nstatic void BM_CalculatePiRange(benchmark::State& state) {\n double pi = 0.0;\n for (auto _ : state) pi = CalculatePi(static_cast(state.range(0)));\n std::stringstream ss;\n ss << pi;\n state.SetLabel(ss.str());\n}\nBENCHMARK_RANGE(BM_CalculatePiRange, 1, 1024 * 1024);\n\nstatic void BM_CalculatePi(benchmark::State& state) {\n static const int depth = 1024;\n for (auto _ : state) {\n double pi = CalculatePi(static_cast(depth));\n benchmark::DoNotOptimize(pi);\n }\n}\nBENCHMARK(BM_CalculatePi)->Threads(8);\nBENCHMARK(BM_CalculatePi)->ThreadRange(1, 32);\nBENCHMARK(BM_CalculatePi)->ThreadPerCpu();\n\nstatic void BM_SetInsert(benchmark::State& state) {\n std::set data;\n for (auto _ : state) {\n state.PauseTiming();\n data = ConstructRandomSet(state.range(0));\n state.ResumeTiming();\n for (int j = 0; j < state.range(1); ++j) data.insert(rand());\n }\n state.SetItemsProcessed(state.iterations() * state.range(1));\n state.SetBytesProcessed(state.iterations() * state.range(1) *\n static_cast(sizeof(int)));\n}\n\n// Test many inserts at once to reduce the total iterations needed. Otherwise,\n// the slower, non-timed part of each iteration will make the benchmark take\n// forever.\nBENCHMARK(BM_SetInsert)->Ranges({{1 << 10, 8 << 10}, {128, 512}});\n\ntemplate \nstatic void BM_Sequential(benchmark::State& state) {\n ValueType v = 42;\n for (auto _ : state) {\n Container c;\n for (int64_t i = state.range(0); --i;) c.push_back(v);\n }\n const int64_t items_processed = state.iterations() * state.range(0);\n state.SetItemsProcessed(items_processed);\n state.SetBytesProcessed(items_processed * static_cast(sizeof(v)));\n}\nBENCHMARK_TEMPLATE2(BM_Sequential, std::vector, int)\n ->Range(1 << 0, 1 << 10);\nBENCHMARK_TEMPLATE(BM_Sequential, std::list)->Range(1 << 0, 1 << 10);\n// Test the variadic version of BENCHMARK_TEMPLATE in C++11 and beyond.\n#ifdef BENCHMARK_HAS_CXX11\nBENCHMARK_TEMPLATE(BM_Sequential, std::vector, int)->Arg(512);\n#endif\n\nstatic void BM_StringCompare(benchmark::State& state) {\n size_t len = static_cast(state.range(0));\n std::string s1(len, '-');\n std::string s2(len, '-');\n for (auto _ : state) {\n auto comp = s1.compare(s2);\n benchmark::DoNotOptimize(comp);\n }\n}\nBENCHMARK(BM_StringCompare)->Range(1, 1 << 20);\n\nstatic void BM_SetupTeardown(benchmark::State& state) {\n if (state.thread_index() == 0) {\n // No need to lock test_vector_mu here as this is running single-threaded.\n test_vector = new std::vector();\n }\n int i = 0;\n for (auto _ : state) {\n std::lock_guard l(test_vector_mu);\n if (i % 2 == 0)\n test_vector->push_back(i);\n else\n test_vector->pop_back();\n ++i;\n }\n if (state.thread_index() == 0) {\n delete test_vector;\n }\n}\nBENCHMARK(BM_SetupTeardown)->ThreadPerCpu();\n\nstatic void BM_LongTest(benchmark::State& state) {\n double tracker = 0.0;\n for (auto _ : state) {\n for (int i = 0; i < state.range(0); ++i)\n benchmark::DoNotOptimize(tracker += i);\n }\n}\nBENCHMARK(BM_LongTest)->Range(1 << 16, 1 << 28);\n\nstatic void BM_ParallelMemset(benchmark::State& state) {\n int64_t size = state.range(0) / static_cast(sizeof(int));\n int thread_size = static_cast(size) / state.threads();\n int from = thread_size * state.thread_index();\n int to = from + thread_size;\n\n if (state.thread_index() == 0) {\n test_vector = new std::vector(static_cast(size));\n }\n\n for (auto _ : state) {\n for (int i = from; i < to; i++) {\n // No need to lock test_vector_mu as ranges\n // do not overlap between threads.\n benchmark::DoNotOptimize(test_vector->at(static_cast(i)) = 1);\n }\n }\n\n if (state.thread_index() == 0) {\n delete test_vector;\n }\n}\nBENCHMARK(BM_ParallelMemset)->Arg(10 << 20)->ThreadRange(1, 4);\n\nstatic void BM_ManualTiming(benchmark::State& state) {\n int64_t slept_for = 0;\n int64_t microseconds = state.range(0);\n std::chrono::duration sleep_duration{\n static_cast(microseconds)};\n\n for (auto _ : state) {\n auto start = std::chrono::high_resolution_clock::now();\n // Simulate some useful workload with a sleep\n std::this_thread::sleep_for(\n std::chrono::duration_cast(sleep_duration));\n auto end = std::chrono::high_resolution_clock::now();\n\n auto elapsed =\n std::chrono::duration_cast>(end - start);\n\n state.SetIterationTime(elapsed.count());\n slept_for += microseconds;\n }\n state.SetItemsProcessed(slept_for);\n}\nBENCHMARK(BM_ManualTiming)->Range(1, 1 << 14)->UseRealTime();\nBENCHMARK(BM_ManualTiming)->Range(1, 1 << 14)->UseManualTime();\n\n#ifdef BENCHMARK_HAS_CXX11\n\ntemplate \nvoid BM_with_args(benchmark::State& state, Args&&...) {\n for (auto _ : state) {\n }\n}\nBENCHMARK_CAPTURE(BM_with_args, int_test, 42, 43, 44);\nBENCHMARK_CAPTURE(BM_with_args, string_and_pair_test, std::string(\"abc\"),\n std::pair(42, 3.8));\n\nvoid BM_non_template_args(benchmark::State& state, int, double) {\n while (state.KeepRunning()) {\n }\n}\nBENCHMARK_CAPTURE(BM_non_template_args, basic_test, 0, 0);\n\n#endif // BENCHMARK_HAS_CXX11\n\nstatic void BM_DenseThreadRanges(benchmark::State& st) {\n switch (st.range(0)) {\n case 1:\n assert(st.threads() == 1 || st.threads() == 2 || st.threads() == 3);\n break;\n case 2:\n assert(st.threads() == 1 || st.threads() == 3 || st.threads() == 4);\n break;\n case 3:\n assert(st.threads() == 5 || st.threads() == 8 || st.threads() == 11 ||\n st.threads() == 14);\n break;\n default:\n assert(false && \"Invalid test case number\");\n }\n while (st.KeepRunning()) {\n }\n}\nBENCHMARK(BM_DenseThreadRanges)->Arg(1)->DenseThreadRange(1, 3);\nBENCHMARK(BM_DenseThreadRanges)->Arg(2)->DenseThreadRange(1, 4, 2);\nBENCHMARK(BM_DenseThreadRanges)->Arg(3)->DenseThreadRange(5, 14, 3);\n\nstatic void BM_BenchmarkName(benchmark::State& state) {\n for (auto _ : state) {\n }\n\n // Check that the benchmark name is passed correctly to `state`.\n assert(\"BM_BenchmarkName\" == state.name());\n}\nBENCHMARK(BM_BenchmarkName);\n\n// regression test for #1446\ntemplate \nstatic void BM_templated_test(benchmark::State& state) {\n for (auto _ : state) {\n type created_string;\n benchmark::DoNotOptimize(created_string);\n }\n}\n\nstatic auto BM_templated_test_double = BM_templated_test>;\nBENCHMARK(BM_templated_test_double);\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/clobber_memory_assembly_test.cc", "content": "#include \n\n#ifdef __clang__\n#pragma clang diagnostic ignored \"-Wreturn-type\"\n#endif\nBENCHMARK_DISABLE_DEPRECATED_WARNING\n\nextern \"C\" {\n\nextern int ExternInt;\nextern int ExternInt2;\nextern int ExternInt3;\n}\n\n// CHECK-LABEL: test_basic:\nextern \"C\" void test_basic() {\n int x;\n benchmark::DoNotOptimize(&x);\n x = 101;\n benchmark::ClobberMemory();\n // CHECK: leaq [[DEST:[^,]+]], %rax\n // CHECK: movl $101, [[DEST]]\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_redundant_store:\nextern \"C\" void test_redundant_store() {\n ExternInt = 3;\n benchmark::ClobberMemory();\n ExternInt = 51;\n // CHECK-DAG: ExternInt\n // CHECK-DAG: movl $3\n // CHECK: movl $51\n}\n\n// CHECK-LABEL: test_redundant_read:\nextern \"C\" void test_redundant_read() {\n int x;\n benchmark::DoNotOptimize(&x);\n x = ExternInt;\n benchmark::ClobberMemory();\n x = ExternInt2;\n // CHECK: leaq [[DEST:[^,]+]], %rax\n // CHECK: ExternInt(%rip)\n // CHECK: movl %eax, [[DEST]]\n // CHECK-NOT: ExternInt2\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_redundant_read2:\nextern \"C\" void test_redundant_read2() {\n int x;\n benchmark::DoNotOptimize(&x);\n x = ExternInt;\n benchmark::ClobberMemory();\n x = ExternInt2;\n benchmark::ClobberMemory();\n // CHECK: leaq [[DEST:[^,]+]], %rax\n // CHECK: ExternInt(%rip)\n // CHECK: movl %eax, [[DEST]]\n // CHECK: ExternInt2(%rip)\n // CHECK: movl %eax, [[DEST]]\n // CHECK: ret\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/commandlineflags_gtest.cc", "content": "#include \n\n#include \"../src/commandlineflags.h\"\n#include \"../src/internal_macros.h\"\n#include \"gmock/gmock.h\"\n#include \"gtest/gtest.h\"\n\nnamespace benchmark {\nnamespace {\n\n#if defined(BENCHMARK_OS_WINDOWS)\nint setenv(const char* name, const char* value, int overwrite) {\n if (!overwrite) {\n // NOTE: getenv_s is far superior but not available under mingw.\n char* env_value = getenv(name);\n if (env_value == nullptr) {\n return -1;\n }\n }\n return _putenv_s(name, value);\n}\n\nint unsetenv(const char* name) { return _putenv_s(name, \"\"); }\n\n#endif // BENCHMARK_OS_WINDOWS\n\nTEST(BoolFromEnv, Default) {\n ASSERT_EQ(unsetenv(\"NOT_IN_ENV\"), 0);\n EXPECT_EQ(BoolFromEnv(\"not_in_env\", true), true);\n}\n\nTEST(BoolFromEnv, False) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"0\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"N\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"n\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"NO\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"No\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"no\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"F\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"f\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"FALSE\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"False\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"false\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"OFF\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"Off\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"off\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", true), false);\n unsetenv(\"IN_ENV\");\n}\n\nTEST(BoolFromEnv, True) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"1\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"Y\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"y\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"YES\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"Yes\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"yes\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"T\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"t\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"TRUE\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"True\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"true\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"ON\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"On\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n ASSERT_EQ(setenv(\"IN_ENV\", \"on\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n\n#ifndef BENCHMARK_OS_WINDOWS\n ASSERT_EQ(setenv(\"IN_ENV\", \"\", 1), 0);\n EXPECT_EQ(BoolFromEnv(\"in_env\", false), true);\n unsetenv(\"IN_ENV\");\n#endif\n}\n\nTEST(Int32FromEnv, NotInEnv) {\n ASSERT_EQ(unsetenv(\"NOT_IN_ENV\"), 0);\n EXPECT_EQ(Int32FromEnv(\"not_in_env\", 42), 42);\n}\n\nTEST(Int32FromEnv, InvalidInteger) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"foo\", 1), 0);\n EXPECT_EQ(Int32FromEnv(\"in_env\", 42), 42);\n unsetenv(\"IN_ENV\");\n}\n\nTEST(Int32FromEnv, ValidInteger) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"42\", 1), 0);\n EXPECT_EQ(Int32FromEnv(\"in_env\", 64), 42);\n unsetenv(\"IN_ENV\");\n}\n\nTEST(DoubleFromEnv, NotInEnv) {\n ASSERT_EQ(unsetenv(\"NOT_IN_ENV\"), 0);\n EXPECT_EQ(DoubleFromEnv(\"not_in_env\", 0.51), 0.51);\n}\n\nTEST(DoubleFromEnv, InvalidReal) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"foo\", 1), 0);\n EXPECT_EQ(DoubleFromEnv(\"in_env\", 0.51), 0.51);\n unsetenv(\"IN_ENV\");\n}\n\nTEST(DoubleFromEnv, ValidReal) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"0.51\", 1), 0);\n EXPECT_EQ(DoubleFromEnv(\"in_env\", 0.71), 0.51);\n unsetenv(\"IN_ENV\");\n}\n\nTEST(StringFromEnv, Default) {\n ASSERT_EQ(unsetenv(\"NOT_IN_ENV\"), 0);\n EXPECT_STREQ(StringFromEnv(\"not_in_env\", \"foo\"), \"foo\");\n}\n\nTEST(StringFromEnv, Valid) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"foo\", 1), 0);\n EXPECT_STREQ(StringFromEnv(\"in_env\", \"bar\"), \"foo\");\n unsetenv(\"IN_ENV\");\n}\n\nTEST(KvPairsFromEnv, Default) {\n ASSERT_EQ(unsetenv(\"NOT_IN_ENV\"), 0);\n EXPECT_THAT(KvPairsFromEnv(\"not_in_env\", {{\"foo\", \"bar\"}}),\n testing::ElementsAre(testing::Pair(\"foo\", \"bar\")));\n}\n\nTEST(KvPairsFromEnv, MalformedReturnsDefault) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"foo\", 1), 0);\n EXPECT_THAT(KvPairsFromEnv(\"in_env\", {{\"foo\", \"bar\"}}),\n testing::ElementsAre(testing::Pair(\"foo\", \"bar\")));\n unsetenv(\"IN_ENV\");\n}\n\nTEST(KvPairsFromEnv, Single) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"foo=bar\", 1), 0);\n EXPECT_THAT(KvPairsFromEnv(\"in_env\", {}),\n testing::ElementsAre(testing::Pair(\"foo\", \"bar\")));\n unsetenv(\"IN_ENV\");\n}\n\nTEST(KvPairsFromEnv, Multiple) {\n ASSERT_EQ(setenv(\"IN_ENV\", \"foo=bar,baz=qux\", 1), 0);\n EXPECT_THAT(KvPairsFromEnv(\"in_env\", {}),\n testing::UnorderedElementsAre(testing::Pair(\"foo\", \"bar\"),\n testing::Pair(\"baz\", \"qux\")));\n unsetenv(\"IN_ENV\");\n}\n\n} // namespace\n} // namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/test/complexity_test.cc", "content": "#undef NDEBUG\n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\nnamespace {\n\n#define ADD_COMPLEXITY_CASES(...) \\\n int CONCAT(dummy, __LINE__) = AddComplexityTest(__VA_ARGS__)\n\nint AddComplexityTest(const std::string &test_name,\n const std::string &big_o_test_name,\n const std::string &rms_test_name,\n const std::string &big_o, int family_index) {\n SetSubstitutions({{\"%name\", test_name},\n {\"%bigo_name\", big_o_test_name},\n {\"%rms_name\", rms_test_name},\n {\"%bigo_str\", \"[ ]* %float \" + big_o},\n {\"%bigo\", big_o},\n {\"%rms\", \"[ ]*[0-9]+ %\"}});\n AddCases(\n TC_ConsoleOut,\n {{\"^%bigo_name %bigo_str %bigo_str[ ]*$\"},\n {\"^%bigo_name\", MR_Not}, // Assert we we didn't only matched a name.\n {\"^%rms_name %rms %rms[ ]*$\", MR_Next}});\n AddCases(\n TC_JSONOut,\n {{\"\\\"name\\\": \\\"%bigo_name\\\",$\"},\n {\"\\\"family_index\\\": \" + std::to_string(family_index) + \",$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"%name\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": %int,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"BigO\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"cpu_coefficient\\\": %float,$\", MR_Next},\n {\"\\\"real_coefficient\\\": %float,$\", MR_Next},\n {\"\\\"big_o\\\": \\\"%bigo\\\",$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next},\n {\"\\\"name\\\": \\\"%rms_name\\\",$\"},\n {\"\\\"family_index\\\": \" + std::to_string(family_index) + \",$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"%name\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": %int,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"RMS\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"percentage\\\",$\", MR_Next},\n {\"\\\"rms\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\n AddCases(TC_CSVOut, {{\"^\\\"%bigo_name\\\",,%float,%float,%bigo,,,,,$\"},\n {\"^\\\"%bigo_name\\\"\", MR_Not},\n {\"^\\\"%rms_name\\\",,%float,%float,,,,,,$\", MR_Next}});\n return 0;\n}\n\n} // end namespace\n\n// ========================================================================= //\n// --------------------------- Testing BigO O(1) --------------------------- //\n// ========================================================================= //\n\nvoid BM_Complexity_O1(benchmark::State &state) {\n for (auto _ : state) {\n for (int i = 0; i < 1024; ++i) {\n benchmark::DoNotOptimize(i);\n }\n }\n state.SetComplexityN(state.range(0));\n}\nBENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);\nBENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();\nBENCHMARK(BM_Complexity_O1)\n ->Range(1, 1 << 18)\n ->Complexity([](benchmark::IterationCount) { return 1.0; });\n\nconst char *one_test_name = \"BM_Complexity_O1\";\nconst char *big_o_1_test_name = \"BM_Complexity_O1_BigO\";\nconst char *rms_o_1_test_name = \"BM_Complexity_O1_RMS\";\nconst char *enum_big_o_1 = \"\\\\([0-9]+\\\\)\";\n// FIXME: Tolerate both '(1)' and 'lgN' as output when the complexity is auto\n// deduced.\n// See https://github.com/google/benchmark/issues/272\nconst char *auto_big_o_1 = \"(\\\\([0-9]+\\\\))|(lgN)\";\nconst char *lambda_big_o_1 = \"f\\\\(N\\\\)\";\n\n// Add enum tests\nADD_COMPLEXITY_CASES(one_test_name, big_o_1_test_name, rms_o_1_test_name,\n enum_big_o_1, /*family_index=*/0);\n\n// Add auto enum tests\nADD_COMPLEXITY_CASES(one_test_name, big_o_1_test_name, rms_o_1_test_name,\n auto_big_o_1, /*family_index=*/1);\n\n// Add lambda tests\nADD_COMPLEXITY_CASES(one_test_name, big_o_1_test_name, rms_o_1_test_name,\n lambda_big_o_1, /*family_index=*/2);\n\n// ========================================================================= //\n// --------------------------- Testing BigO O(N) --------------------------- //\n// ========================================================================= //\n\nstd::vector ConstructRandomVector(int64_t size) {\n std::vector v;\n v.reserve(static_cast(size));\n for (int i = 0; i < size; ++i) {\n v.push_back(static_cast(std::rand() % size));\n }\n return v;\n}\n\nvoid BM_Complexity_O_N(benchmark::State &state) {\n auto v = ConstructRandomVector(state.range(0));\n // Test worst case scenario (item not in vector)\n const int64_t item_not_in_vector = state.range(0) * 2;\n for (auto _ : state) {\n auto it = std::find(v.begin(), v.end(), item_not_in_vector);\n benchmark::DoNotOptimize(it);\n }\n state.SetComplexityN(state.range(0));\n}\nBENCHMARK(BM_Complexity_O_N)\n ->RangeMultiplier(2)\n ->Range(1 << 10, 1 << 16)\n ->Complexity(benchmark::oN);\nBENCHMARK(BM_Complexity_O_N)\n ->RangeMultiplier(2)\n ->Range(1 << 10, 1 << 16)\n ->Complexity([](benchmark::IterationCount n) -> double {\n return static_cast(n);\n });\nBENCHMARK(BM_Complexity_O_N)\n ->RangeMultiplier(2)\n ->Range(1 << 10, 1 << 16)\n ->Complexity();\n\nconst char *n_test_name = \"BM_Complexity_O_N\";\nconst char *big_o_n_test_name = \"BM_Complexity_O_N_BigO\";\nconst char *rms_o_n_test_name = \"BM_Complexity_O_N_RMS\";\nconst char *enum_auto_big_o_n = \"N\";\nconst char *lambda_big_o_n = \"f\\\\(N\\\\)\";\n\n// Add enum tests\nADD_COMPLEXITY_CASES(n_test_name, big_o_n_test_name, rms_o_n_test_name,\n enum_auto_big_o_n, /*family_index=*/3);\n\n// Add lambda tests\nADD_COMPLEXITY_CASES(n_test_name, big_o_n_test_name, rms_o_n_test_name,\n lambda_big_o_n, /*family_index=*/4);\n\n// ========================================================================= //\n// ------------------------- Testing BigO O(N*lgN) ------------------------- //\n// ========================================================================= //\n\nstatic void BM_Complexity_O_N_log_N(benchmark::State &state) {\n auto v = ConstructRandomVector(state.range(0));\n for (auto _ : state) {\n std::sort(v.begin(), v.end());\n }\n state.SetComplexityN(state.range(0));\n}\nstatic const double kLog2E = 1.44269504088896340736;\nBENCHMARK(BM_Complexity_O_N_log_N)\n ->RangeMultiplier(2)\n ->Range(1 << 10, 1 << 16)\n ->Complexity(benchmark::oNLogN);\nBENCHMARK(BM_Complexity_O_N_log_N)\n ->RangeMultiplier(2)\n ->Range(1 << 10, 1 << 16)\n ->Complexity([](benchmark::IterationCount n) {\n return kLog2E * static_cast(n) * log(static_cast(n));\n });\nBENCHMARK(BM_Complexity_O_N_log_N)\n ->RangeMultiplier(2)\n ->Range(1 << 10, 1 << 16)\n ->Complexity();\n\nconst char *n_lg_n_test_name = \"BM_Complexity_O_N_log_N\";\nconst char *big_o_n_lg_n_test_name = \"BM_Complexity_O_N_log_N_BigO\";\nconst char *rms_o_n_lg_n_test_name = \"BM_Complexity_O_N_log_N_RMS\";\nconst char *enum_auto_big_o_n_lg_n = \"NlgN\";\nconst char *lambda_big_o_n_lg_n = \"f\\\\(N\\\\)\";\n\n// Add enum tests\nADD_COMPLEXITY_CASES(n_lg_n_test_name, big_o_n_lg_n_test_name,\n rms_o_n_lg_n_test_name, enum_auto_big_o_n_lg_n,\n /*family_index=*/6);\n\n// Add lambda tests\nADD_COMPLEXITY_CASES(n_lg_n_test_name, big_o_n_lg_n_test_name,\n rms_o_n_lg_n_test_name, lambda_big_o_n_lg_n,\n /*family_index=*/7);\n\n// ========================================================================= //\n// -------- Testing formatting of Complexity with captured args ------------ //\n// ========================================================================= //\n\nvoid BM_ComplexityCaptureArgs(benchmark::State &state, int n) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n state.SetComplexityN(n);\n}\n\nBENCHMARK_CAPTURE(BM_ComplexityCaptureArgs, capture_test, 100)\n ->Complexity(benchmark::oN)\n ->Ranges({{1, 2}, {3, 4}});\n\nconst std::string complexity_capture_name =\n \"BM_ComplexityCaptureArgs/capture_test\";\n\nADD_COMPLEXITY_CASES(complexity_capture_name, complexity_capture_name + \"_BigO\",\n complexity_capture_name + \"_RMS\", \"N\", /*family_index=*/9);\n\n// ========================================================================= //\n// --------------------------- TEST CASES END ------------------------------ //\n// ========================================================================= //\n\nint main(int argc, char *argv[]) { RunOutputTests(argc, argv); }\n" }, { "path": "3rd/benchmark-1.8.2/test/cxx03_test.cc", "content": "#undef NDEBUG\n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\n#if __cplusplus >= 201103L\n#error C++11 or greater detected. Should be C++03.\n#endif\n\n#ifdef BENCHMARK_HAS_CXX11\n#error C++11 or greater detected by the library. BENCHMARK_HAS_CXX11 is defined.\n#endif\n\nvoid BM_empty(benchmark::State& state) {\n while (state.KeepRunning()) {\n volatile benchmark::IterationCount x = state.iterations();\n ((void)x);\n }\n}\nBENCHMARK(BM_empty);\n\n// The new C++11 interface for args/ranges requires initializer list support.\n// Therefore we provide the old interface to support C++03.\nvoid BM_old_arg_range_interface(benchmark::State& state) {\n assert((state.range(0) == 1 && state.range(1) == 2) ||\n (state.range(0) == 5 && state.range(1) == 6));\n while (state.KeepRunning()) {\n }\n}\nBENCHMARK(BM_old_arg_range_interface)->ArgPair(1, 2)->RangePair(5, 5, 6, 6);\n\ntemplate \nvoid BM_template2(benchmark::State& state) {\n BM_empty(state);\n}\nBENCHMARK_TEMPLATE2(BM_template2, int, long);\n\ntemplate \nvoid BM_template1(benchmark::State& state) {\n BM_empty(state);\n}\nBENCHMARK_TEMPLATE(BM_template1, long);\nBENCHMARK_TEMPLATE1(BM_template1, int);\n\ntemplate \nstruct BM_Fixture : public ::benchmark::Fixture {};\n\nBENCHMARK_TEMPLATE_F(BM_Fixture, BM_template1, long)(benchmark::State& state) {\n BM_empty(state);\n}\nBENCHMARK_TEMPLATE1_F(BM_Fixture, BM_template2, int)(benchmark::State& state) {\n BM_empty(state);\n}\n\nvoid BM_counters(benchmark::State& state) {\n BM_empty(state);\n state.counters[\"Foo\"] = 2;\n}\nBENCHMARK(BM_counters);\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/diagnostics_test.cc", "content": "// Testing:\n// State::PauseTiming()\n// State::ResumeTiming()\n// Test that CHECK's within these function diagnose when they are called\n// outside of the KeepRunning() loop.\n//\n// NOTE: Users should NOT include or use src/check.h. This is only done in\n// order to test library internals.\n\n#include \n#include \n\n#include \"../src/check.h\"\n#include \"benchmark/benchmark.h\"\n\n#if defined(__GNUC__) && !defined(__EXCEPTIONS)\n#define TEST_HAS_NO_EXCEPTIONS\n#endif\n\nvoid TestHandler() {\n#ifndef TEST_HAS_NO_EXCEPTIONS\n throw std::logic_error(\"\");\n#else\n std::abort();\n#endif\n}\n\nvoid try_invalid_pause_resume(benchmark::State& state) {\n#if !defined(TEST_BENCHMARK_LIBRARY_HAS_NO_ASSERTIONS) && \\\n !defined(TEST_HAS_NO_EXCEPTIONS)\n try {\n state.PauseTiming();\n std::abort();\n } catch (std::logic_error const&) {\n }\n try {\n state.ResumeTiming();\n std::abort();\n } catch (std::logic_error const&) {\n }\n#else\n (void)state; // avoid unused warning\n#endif\n}\n\nvoid BM_diagnostic_test(benchmark::State& state) {\n static bool called_once = false;\n\n if (called_once == false) try_invalid_pause_resume(state);\n\n for (auto _ : state) {\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n\n if (called_once == false) try_invalid_pause_resume(state);\n\n called_once = true;\n}\nBENCHMARK(BM_diagnostic_test);\n\nvoid BM_diagnostic_test_keep_running(benchmark::State& state) {\n static bool called_once = false;\n\n if (called_once == false) try_invalid_pause_resume(state);\n\n while (state.KeepRunning()) {\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n\n if (called_once == false) try_invalid_pause_resume(state);\n\n called_once = true;\n}\nBENCHMARK(BM_diagnostic_test_keep_running);\n\nint main(int argc, char* argv[]) {\n#ifdef NDEBUG\n // This test is exercising functionality for debug builds, which are not\n // available in release builds. Skip the test if we are in that environment\n // to avoid a test failure.\n std::cout << \"Diagnostic test disabled in release build\" << std::endl;\n (void)argc;\n (void)argv;\n#else\n benchmark::internal::GetAbortHandler() = &TestHandler;\n benchmark::Initialize(&argc, argv);\n benchmark::RunSpecifiedBenchmarks();\n#endif\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/display_aggregates_only_test.cc", "content": "\n#undef NDEBUG\n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\n// Ok this test is super ugly. We want to check what happens with the file\n// reporter in the presence of DisplayAggregatesOnly().\n// We do not care about console output, the normal tests check that already.\n\nvoid BM_SummaryRepeat(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_SummaryRepeat)->Repetitions(3)->DisplayAggregatesOnly();\n\nint main(int argc, char* argv[]) {\n const std::string output = GetFileReporterOutput(argc, argv);\n\n if (SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3\") != 7 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3\\\"\") != 3 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_mean\\\"\") != 1 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_median\\\"\") !=\n 1 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_stddev\\\"\") !=\n 1 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_cv\\\"\") != 1) {\n std::cout << \"Precondition mismatch. Expected to only find 8 \"\n \"occurrences of \\\"BM_SummaryRepeat/repeats:3\\\" substring:\\n\"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_mean\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_median\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_stddev\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_cv\\\"\\nThe entire \"\n \"output:\\n\";\n std::cout << output;\n return 1;\n }\n\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/donotoptimize_assembly_test.cc", "content": "#include \n\n#ifdef __clang__\n#pragma clang diagnostic ignored \"-Wreturn-type\"\n#endif\nBENCHMARK_DISABLE_DEPRECATED_WARNING\n\nextern \"C\" {\n\nextern int ExternInt;\nextern int ExternInt2;\nextern int ExternInt3;\nextern int BigArray[2049];\n\nconst int ConstBigArray[2049]{};\n\ninline int Add42(int x) { return x + 42; }\n\nstruct NotTriviallyCopyable {\n NotTriviallyCopyable();\n explicit NotTriviallyCopyable(int x) : value(x) {}\n NotTriviallyCopyable(NotTriviallyCopyable const &);\n int value;\n};\n\nstruct Large {\n int value;\n int data[2];\n};\n\nstruct ExtraLarge {\n int arr[2049];\n};\n}\n\nextern ExtraLarge ExtraLargeObj;\nconst ExtraLarge ConstExtraLargeObj{};\n\n// CHECK-LABEL: test_with_rvalue:\nextern \"C\" void test_with_rvalue() {\n benchmark::DoNotOptimize(Add42(0));\n // CHECK: movl $42, %eax\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_large_rvalue:\nextern \"C\" void test_with_large_rvalue() {\n benchmark::DoNotOptimize(Large{ExternInt, {ExternInt, ExternInt}});\n // CHECK: ExternInt(%rip)\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG:[a-z]+]]\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG]])\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG]])\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_non_trivial_rvalue:\nextern \"C\" void test_with_non_trivial_rvalue() {\n benchmark::DoNotOptimize(NotTriviallyCopyable(ExternInt));\n // CHECK: mov{{l|q}} ExternInt(%rip)\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_lvalue:\nextern \"C\" void test_with_lvalue() {\n int x = 101;\n benchmark::DoNotOptimize(x);\n // CHECK-GNU: movl $101, %eax\n // CHECK-CLANG: movl $101, -{{[0-9]+}}(%[[REG:[a-z]+]])\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_large_lvalue:\nextern \"C\" void test_with_large_lvalue() {\n Large L{ExternInt, {ExternInt, ExternInt}};\n benchmark::DoNotOptimize(L);\n // CHECK: ExternInt(%rip)\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG:[a-z]+]])\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG]])\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG]])\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_extra_large_lvalue_with_op:\nextern \"C\" void test_with_extra_large_lvalue_with_op() {\n ExtraLargeObj.arr[16] = 42;\n benchmark::DoNotOptimize(ExtraLargeObj);\n // CHECK: movl $42, ExtraLargeObj+64(%rip)\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_big_array_with_op\nextern \"C\" void test_with_big_array_with_op() {\n BigArray[16] = 42;\n benchmark::DoNotOptimize(BigArray);\n // CHECK: movl $42, BigArray+64(%rip)\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_non_trivial_lvalue:\nextern \"C\" void test_with_non_trivial_lvalue() {\n NotTriviallyCopyable NTC(ExternInt);\n benchmark::DoNotOptimize(NTC);\n // CHECK: ExternInt(%rip)\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG:[a-z]+]])\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_const_lvalue:\nextern \"C\" void test_with_const_lvalue() {\n const int x = 123;\n benchmark::DoNotOptimize(x);\n // CHECK: movl $123, %eax\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_large_const_lvalue:\nextern \"C\" void test_with_large_const_lvalue() {\n const Large L{ExternInt, {ExternInt, ExternInt}};\n benchmark::DoNotOptimize(L);\n // CHECK: ExternInt(%rip)\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG:[a-z]+]])\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG]])\n // CHECK: movl %eax, -{{[0-9]+}}(%[[REG]])\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_const_extra_large_obj:\nextern \"C\" void test_with_const_extra_large_obj() {\n benchmark::DoNotOptimize(ConstExtraLargeObj);\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_const_big_array\nextern \"C\" void test_with_const_big_array() {\n benchmark::DoNotOptimize(ConstBigArray);\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_with_non_trivial_const_lvalue:\nextern \"C\" void test_with_non_trivial_const_lvalue() {\n const NotTriviallyCopyable Obj(ExternInt);\n benchmark::DoNotOptimize(Obj);\n // CHECK: mov{{q|l}} ExternInt(%rip)\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_div_by_two:\nextern \"C\" int test_div_by_two(int input) {\n int divisor = 2;\n benchmark::DoNotOptimize(divisor);\n return input / divisor;\n // CHECK: movl $2, [[DEST:.*]]\n // CHECK: idivl [[DEST]]\n // CHECK: ret\n}\n\n// CHECK-LABEL: test_inc_integer:\nextern \"C\" int test_inc_integer() {\n int x = 0;\n for (int i = 0; i < 5; ++i) benchmark::DoNotOptimize(++x);\n // CHECK: movl $1, [[DEST:.*]]\n // CHECK: {{(addl \\$1,|incl)}} [[DEST]]\n // CHECK: {{(addl \\$1,|incl)}} [[DEST]]\n // CHECK: {{(addl \\$1,|incl)}} [[DEST]]\n // CHECK: {{(addl \\$1,|incl)}} [[DEST]]\n // CHECK-CLANG: movl [[DEST]], %eax\n // CHECK: ret\n return x;\n}\n\n// CHECK-LABEL: test_pointer_rvalue\nextern \"C\" void test_pointer_rvalue() {\n // CHECK: movl $42, [[DEST:.*]]\n // CHECK: leaq [[DEST]], %rax\n // CHECK-CLANG: movq %rax, -{{[0-9]+}}(%[[REG:[a-z]+]])\n // CHECK: ret\n int x = 42;\n benchmark::DoNotOptimize(&x);\n}\n\n// CHECK-LABEL: test_pointer_const_lvalue:\nextern \"C\" void test_pointer_const_lvalue() {\n // CHECK: movl $42, [[DEST:.*]]\n // CHECK: leaq [[DEST]], %rax\n // CHECK-CLANG: movq %rax, -{{[0-9]+}}(%[[REG:[a-z]+]])\n // CHECK: ret\n int x = 42;\n int *const xp = &x;\n benchmark::DoNotOptimize(xp);\n}\n\n// CHECK-LABEL: test_pointer_lvalue:\nextern \"C\" void test_pointer_lvalue() {\n // CHECK: movl $42, [[DEST:.*]]\n // CHECK: leaq [[DEST]], %rax\n // CHECK-CLANG: movq %rax, -{{[0-9]+}}(%[[REG:[a-z+]+]])\n // CHECK: ret\n int x = 42;\n int *xp = &x;\n benchmark::DoNotOptimize(xp);\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/donotoptimize_test.cc", "content": "#include \n\n#include \"benchmark/benchmark.h\"\n\nnamespace {\n#if defined(__GNUC__)\nstd::int64_t double_up(const std::int64_t x) __attribute__((const));\n#endif\nstd::int64_t double_up(const std::int64_t x) { return x * 2; }\n} // namespace\n\n// Using DoNotOptimize on types like BitRef seem to cause a lot of problems\n// with the inline assembly on both GCC and Clang.\nstruct BitRef {\n int index;\n unsigned char& byte;\n\n public:\n static BitRef Make() {\n static unsigned char arr[2] = {};\n BitRef b(1, arr[0]);\n return b;\n }\n\n private:\n BitRef(int i, unsigned char& b) : index(i), byte(b) {}\n};\n\nint main(int, char*[]) {\n // this test verifies compilation of DoNotOptimize() for some types\n\n char buffer1[1] = \"\";\n benchmark::DoNotOptimize(buffer1);\n\n char buffer2[2] = \"\";\n benchmark::DoNotOptimize(buffer2);\n\n char buffer3[3] = \"\";\n benchmark::DoNotOptimize(buffer3);\n\n char buffer8[8] = \"\";\n benchmark::DoNotOptimize(buffer8);\n\n char buffer20[20] = \"\";\n benchmark::DoNotOptimize(buffer20);\n\n char buffer1024[1024] = \"\";\n benchmark::DoNotOptimize(buffer1024);\n char* bptr = &buffer1024[0];\n benchmark::DoNotOptimize(bptr);\n\n int x = 123;\n benchmark::DoNotOptimize(x);\n int* xp = &x;\n benchmark::DoNotOptimize(xp);\n benchmark::DoNotOptimize(x += 42);\n\n std::int64_t y = double_up(x);\n benchmark::DoNotOptimize(y);\n\n // These tests are to e\n BitRef lval = BitRef::Make();\n benchmark::DoNotOptimize(lval);\n\n#ifdef BENCHMARK_HAS_CXX11\n // Check that accept rvalue.\n benchmark::DoNotOptimize(BitRef::Make());\n#endif\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/filter_test.cc", "content": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\nnamespace {\n\nclass TestReporter : public benchmark::ConsoleReporter {\n public:\n bool ReportContext(const Context& context) override {\n return ConsoleReporter::ReportContext(context);\n };\n\n void ReportRuns(const std::vector& report) override {\n ++count_;\n max_family_index_ = std::max(max_family_index_, report[0].family_index);\n ConsoleReporter::ReportRuns(report);\n };\n\n TestReporter() : count_(0), max_family_index_(0) {}\n\n ~TestReporter() override {}\n\n int GetCount() const { return count_; }\n\n int64_t GetMaxFamilyIndex() const { return max_family_index_; }\n\n private:\n mutable int count_;\n mutable int64_t max_family_index_;\n};\n\n} // end namespace\n\nstatic void NoPrefix(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(NoPrefix);\n\nstatic void BM_Foo(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_Foo);\n\nstatic void BM_Bar(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_Bar);\n\nstatic void BM_FooBar(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_FooBar);\n\nstatic void BM_FooBa(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_FooBa);\n\nint main(int argc, char** argv) {\n bool list_only = false;\n for (int i = 0; i < argc; ++i)\n list_only |= std::string(argv[i]).find(\"--benchmark_list_tests\") !=\n std::string::npos;\n\n benchmark::Initialize(&argc, argv);\n\n TestReporter test_reporter;\n const int64_t returned_count =\n static_cast(benchmark::RunSpecifiedBenchmarks(&test_reporter));\n\n if (argc == 2) {\n // Make sure we ran all of the tests\n std::stringstream ss(argv[1]);\n int64_t expected_return;\n ss >> expected_return;\n\n if (returned_count != expected_return) {\n std::cerr << \"ERROR: Expected \" << expected_return\n << \" tests to match the filter but returned_count = \"\n << returned_count << std::endl;\n return -1;\n }\n\n const int64_t expected_reports = list_only ? 0 : expected_return;\n const int64_t reports_count = test_reporter.GetCount();\n if (reports_count != expected_reports) {\n std::cerr << \"ERROR: Expected \" << expected_reports\n << \" tests to be run but reported_count = \" << reports_count\n << std::endl;\n return -1;\n }\n\n const int64_t max_family_index = test_reporter.GetMaxFamilyIndex();\n const int64_t num_families = reports_count == 0 ? 0 : 1 + max_family_index;\n if (num_families != expected_reports) {\n std::cerr << \"ERROR: Expected \" << expected_reports\n << \" test families to be run but num_families = \"\n << num_families << std::endl;\n return -1;\n }\n }\n\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/fixture_test.cc", "content": "\n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\n#define FIXTURE_BECHMARK_NAME MyFixture\n\nclass FIXTURE_BECHMARK_NAME : public ::benchmark::Fixture {\n public:\n void SetUp(const ::benchmark::State& state) override {\n if (state.thread_index() == 0) {\n assert(data.get() == nullptr);\n data.reset(new int(42));\n }\n }\n\n void TearDown(const ::benchmark::State& state) override {\n if (state.thread_index() == 0) {\n assert(data.get() != nullptr);\n data.reset();\n }\n }\n\n ~FIXTURE_BECHMARK_NAME() override { assert(data == nullptr); }\n\n std::unique_ptr data;\n};\n\nBENCHMARK_F(FIXTURE_BECHMARK_NAME, Foo)(benchmark::State& st) {\n assert(data.get() != nullptr);\n assert(*data == 42);\n for (auto _ : st) {\n }\n}\n\nBENCHMARK_DEFINE_F(FIXTURE_BECHMARK_NAME, Bar)(benchmark::State& st) {\n if (st.thread_index() == 0) {\n assert(data.get() != nullptr);\n assert(*data == 42);\n }\n for (auto _ : st) {\n assert(data.get() != nullptr);\n assert(*data == 42);\n }\n st.SetItemsProcessed(st.range(0));\n}\nBENCHMARK_REGISTER_F(FIXTURE_BECHMARK_NAME, Bar)->Arg(42);\nBENCHMARK_REGISTER_F(FIXTURE_BECHMARK_NAME, Bar)->Arg(42)->ThreadPerCpu();\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/internal_threading_test.cc", "content": "\n#undef NDEBUG\n\n#include \n#include \n\n#include \"../src/timers.h\"\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\nstatic const std::chrono::duration time_frame(50);\nstatic const double time_frame_in_sec(\n std::chrono::duration_cast>>(\n time_frame)\n .count());\n\nvoid MyBusySpinwait() {\n const auto start = benchmark::ChronoClockNow();\n\n while (true) {\n const auto now = benchmark::ChronoClockNow();\n const auto elapsed = now - start;\n\n if (std::chrono::duration(elapsed) >=\n time_frame)\n return;\n }\n}\n\n// ========================================================================= //\n// --------------------------- TEST CASES BEGIN ---------------------------- //\n// ========================================================================= //\n\n// ========================================================================= //\n// BM_MainThread\n\nvoid BM_MainThread(benchmark::State& state) {\n for (auto _ : state) {\n MyBusySpinwait();\n state.SetIterationTime(time_frame_in_sec);\n }\n state.counters[\"invtime\"] =\n benchmark::Counter{1, benchmark::Counter::kIsRate};\n}\n\nBENCHMARK(BM_MainThread)->Iterations(1)->Threads(1);\nBENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->UseRealTime();\nBENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->UseManualTime();\nBENCHMARK(BM_MainThread)->Iterations(1)->Threads(1)->MeasureProcessCPUTime();\nBENCHMARK(BM_MainThread)\n ->Iterations(1)\n ->Threads(1)\n ->MeasureProcessCPUTime()\n ->UseRealTime();\nBENCHMARK(BM_MainThread)\n ->Iterations(1)\n ->Threads(1)\n ->MeasureProcessCPUTime()\n ->UseManualTime();\n\nBENCHMARK(BM_MainThread)->Iterations(1)->Threads(2);\nBENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->UseRealTime();\nBENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->UseManualTime();\nBENCHMARK(BM_MainThread)->Iterations(1)->Threads(2)->MeasureProcessCPUTime();\nBENCHMARK(BM_MainThread)\n ->Iterations(1)\n ->Threads(2)\n ->MeasureProcessCPUTime()\n ->UseRealTime();\nBENCHMARK(BM_MainThread)\n ->Iterations(1)\n ->Threads(2)\n ->MeasureProcessCPUTime()\n ->UseManualTime();\n\n// ========================================================================= //\n// BM_WorkerThread\n\nvoid BM_WorkerThread(benchmark::State& state) {\n for (auto _ : state) {\n std::thread Worker(&MyBusySpinwait);\n Worker.join();\n state.SetIterationTime(time_frame_in_sec);\n }\n state.counters[\"invtime\"] =\n benchmark::Counter{1, benchmark::Counter::kIsRate};\n}\n\nBENCHMARK(BM_WorkerThread)->Iterations(1)->Threads(1);\nBENCHMARK(BM_WorkerThread)->Iterations(1)->Threads(1)->UseRealTime();\nBENCHMARK(BM_WorkerThread)->Iterations(1)->Threads(1)->UseManualTime();\nBENCHMARK(BM_WorkerThread)->Iterations(1)->Threads(1)->MeasureProcessCPUTime();\nBENCHMARK(BM_WorkerThread)\n ->Iterations(1)\n ->Threads(1)\n ->MeasureProcessCPUTime()\n ->UseRealTime();\nBENCHMARK(BM_WorkerThread)\n ->Iterations(1)\n ->Threads(1)\n ->MeasureProcessCPUTime()\n ->UseManualTime();\n\nBENCHMARK(BM_WorkerThread)->Iterations(1)->Threads(2);\nBENCHMARK(BM_WorkerThread)->Iterations(1)->Threads(2)->UseRealTime();\nBENCHMARK(BM_WorkerThread)->Iterations(1)->Threads(2)->UseManualTime();\nBENCHMARK(BM_WorkerThread)->Iterations(1)->Threads(2)->MeasureProcessCPUTime();\nBENCHMARK(BM_WorkerThread)\n ->Iterations(1)\n ->Threads(2)\n ->MeasureProcessCPUTime()\n ->UseRealTime();\nBENCHMARK(BM_WorkerThread)\n ->Iterations(1)\n ->Threads(2)\n ->MeasureProcessCPUTime()\n ->UseManualTime();\n\n// ========================================================================= //\n// BM_MainThreadAndWorkerThread\n\nvoid BM_MainThreadAndWorkerThread(benchmark::State& state) {\n for (auto _ : state) {\n std::thread Worker(&MyBusySpinwait);\n MyBusySpinwait();\n Worker.join();\n state.SetIterationTime(time_frame_in_sec);\n }\n state.counters[\"invtime\"] =\n benchmark::Counter{1, benchmark::Counter::kIsRate};\n}\n\nBENCHMARK(BM_MainThreadAndWorkerThread)->Iterations(1)->Threads(1);\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(1)\n ->UseRealTime();\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(1)\n ->UseManualTime();\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(1)\n ->MeasureProcessCPUTime();\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(1)\n ->MeasureProcessCPUTime()\n ->UseRealTime();\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(1)\n ->MeasureProcessCPUTime()\n ->UseManualTime();\n\nBENCHMARK(BM_MainThreadAndWorkerThread)->Iterations(1)->Threads(2);\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(2)\n ->UseRealTime();\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(2)\n ->UseManualTime();\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(2)\n ->MeasureProcessCPUTime();\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(2)\n ->MeasureProcessCPUTime()\n ->UseRealTime();\nBENCHMARK(BM_MainThreadAndWorkerThread)\n ->Iterations(1)\n ->Threads(2)\n ->MeasureProcessCPUTime()\n ->UseManualTime();\n\n// ========================================================================= //\n// ---------------------------- TEST CASES END ----------------------------- //\n// ========================================================================= //\n\nint main(int argc, char* argv[]) { RunOutputTests(argc, argv); }\n" }, { "path": "3rd/benchmark-1.8.2/test/link_main_test.cc", "content": "#include \"benchmark/benchmark.h\"\n\nvoid BM_empty(benchmark::State& state) {\n for (auto _ : state) {\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n}\nBENCHMARK(BM_empty);\n" }, { "path": "3rd/benchmark-1.8.2/test/map_test.cc", "content": "#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\nnamespace {\n\nstd::map ConstructRandomMap(int size) {\n std::map m;\n for (int i = 0; i < size; ++i) {\n m.insert(std::make_pair(std::rand() % size, std::rand() % size));\n }\n return m;\n}\n\n} // namespace\n\n// Basic version.\nstatic void BM_MapLookup(benchmark::State& state) {\n const int size = static_cast(state.range(0));\n std::map m;\n for (auto _ : state) {\n state.PauseTiming();\n m = ConstructRandomMap(size);\n state.ResumeTiming();\n for (int i = 0; i < size; ++i) {\n auto it = m.find(std::rand() % size);\n benchmark::DoNotOptimize(it);\n }\n }\n state.SetItemsProcessed(state.iterations() * size);\n}\nBENCHMARK(BM_MapLookup)->Range(1 << 3, 1 << 12);\n\n// Using fixtures.\nclass MapFixture : public ::benchmark::Fixture {\n public:\n void SetUp(const ::benchmark::State& st) override {\n m = ConstructRandomMap(static_cast(st.range(0)));\n }\n\n void TearDown(const ::benchmark::State&) override { m.clear(); }\n\n std::map m;\n};\n\nBENCHMARK_DEFINE_F(MapFixture, Lookup)(benchmark::State& state) {\n const int size = static_cast(state.range(0));\n for (auto _ : state) {\n for (int i = 0; i < size; ++i) {\n auto it = m.find(std::rand() % size);\n benchmark::DoNotOptimize(it);\n }\n }\n state.SetItemsProcessed(state.iterations() * size);\n}\nBENCHMARK_REGISTER_F(MapFixture, Lookup)->Range(1 << 3, 1 << 12);\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/memory_manager_test.cc", "content": "#include \n\n#include \"../src/check.h\"\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\nclass TestMemoryManager : public benchmark::MemoryManager {\n void Start() override {}\n void Stop(Result& result) override {\n result.num_allocs = 42;\n result.max_bytes_used = 42000;\n }\n};\n\nvoid BM_empty(benchmark::State& state) {\n for (auto _ : state) {\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n}\nBENCHMARK(BM_empty);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_empty %console_report$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_empty\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_empty\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"allocs_per_iter\\\": %float,$\", MR_Next},\n {\"\\\"max_bytes_used\\\": 42000$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_empty\\\",%csv_report$\"}});\n\nint main(int argc, char* argv[]) {\n std::unique_ptr mm(new TestMemoryManager());\n\n benchmark::RegisterMemoryManager(mm.get());\n RunOutputTests(argc, argv);\n benchmark::RegisterMemoryManager(nullptr);\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/min_time_parse_gtest.cc", "content": "#include \"../src/benchmark_runner.h\"\n#include \"gtest/gtest.h\"\n\nnamespace {\n\nTEST(ParseMinTimeTest, InvalidInput) {\n#if GTEST_HAS_DEATH_TEST\n // Tests only runnable in debug mode (when BM_CHECK is enabled).\n#ifndef NDEBUG\n#ifndef TEST_BENCHMARK_LIBRARY_HAS_NO_ASSERTIONS\n ASSERT_DEATH_IF_SUPPORTED(\n { benchmark::internal::ParseBenchMinTime(\"abc\"); },\n \"Malformed seconds value passed to --benchmark_min_time: `abc`\");\n\n ASSERT_DEATH_IF_SUPPORTED(\n { benchmark::internal::ParseBenchMinTime(\"123ms\"); },\n \"Malformed seconds value passed to --benchmark_min_time: `123ms`\");\n\n ASSERT_DEATH_IF_SUPPORTED(\n { benchmark::internal::ParseBenchMinTime(\"1z\"); },\n \"Malformed seconds value passed to --benchmark_min_time: `1z`\");\n\n ASSERT_DEATH_IF_SUPPORTED(\n { benchmark::internal::ParseBenchMinTime(\"1hs\"); },\n \"Malformed seconds value passed to --benchmark_min_time: `1hs`\");\n#endif\n#endif\n#endif\n}\n} // namespace\n" }, { "path": "3rd/benchmark-1.8.2/test/multiple_ranges_test.cc", "content": "#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\nclass MultipleRangesFixture : public ::benchmark::Fixture {\n public:\n MultipleRangesFixture()\n : expectedValues({{1, 3, 5},\n {1, 3, 8},\n {1, 3, 15},\n {2, 3, 5},\n {2, 3, 8},\n {2, 3, 15},\n {1, 4, 5},\n {1, 4, 8},\n {1, 4, 15},\n {2, 4, 5},\n {2, 4, 8},\n {2, 4, 15},\n {1, 7, 5},\n {1, 7, 8},\n {1, 7, 15},\n {2, 7, 5},\n {2, 7, 8},\n {2, 7, 15},\n {7, 6, 3}}) {}\n\n void SetUp(const ::benchmark::State& state) override {\n std::vector ranges = {state.range(0), state.range(1),\n state.range(2)};\n\n assert(expectedValues.find(ranges) != expectedValues.end());\n\n actualValues.insert(ranges);\n }\n\n // NOTE: This is not TearDown as we want to check after _all_ runs are\n // complete.\n ~MultipleRangesFixture() override {\n if (actualValues != expectedValues) {\n std::cout << \"EXPECTED\\n\";\n for (const auto& v : expectedValues) {\n std::cout << \"{\";\n for (int64_t iv : v) {\n std::cout << iv << \", \";\n }\n std::cout << \"}\\n\";\n }\n std::cout << \"ACTUAL\\n\";\n for (const auto& v : actualValues) {\n std::cout << \"{\";\n for (int64_t iv : v) {\n std::cout << iv << \", \";\n }\n std::cout << \"}\\n\";\n }\n }\n }\n\n std::set> expectedValues;\n std::set> actualValues;\n};\n\nBENCHMARK_DEFINE_F(MultipleRangesFixture, Empty)(benchmark::State& state) {\n for (auto _ : state) {\n int64_t product = state.range(0) * state.range(1) * state.range(2);\n for (int64_t x = 0; x < product; x++) {\n benchmark::DoNotOptimize(x);\n }\n }\n}\n\nBENCHMARK_REGISTER_F(MultipleRangesFixture, Empty)\n ->RangeMultiplier(2)\n ->Ranges({{1, 2}, {3, 7}, {5, 15}})\n ->Args({7, 6, 3});\n\nvoid BM_CheckDefaultArgument(benchmark::State& state) {\n // Test that the 'range()' without an argument is the same as 'range(0)'.\n assert(state.range() == state.range(0));\n assert(state.range() != state.range(1));\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_CheckDefaultArgument)->Ranges({{1, 5}, {6, 10}});\n\nstatic void BM_MultipleRanges(benchmark::State& st) {\n for (auto _ : st) {\n }\n}\nBENCHMARK(BM_MultipleRanges)->Ranges({{5, 5}, {6, 6}});\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/options_test.cc", "content": "#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\n#if defined(NDEBUG)\n#undef NDEBUG\n#endif\n#include \n\nvoid BM_basic(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\n\nvoid BM_basic_slow(benchmark::State& state) {\n std::chrono::milliseconds sleep_duration(state.range(0));\n for (auto _ : state) {\n std::this_thread::sleep_for(\n std::chrono::duration_cast(sleep_duration));\n }\n}\n\nBENCHMARK(BM_basic);\nBENCHMARK(BM_basic)->Arg(42);\nBENCHMARK(BM_basic_slow)->Arg(10)->Unit(benchmark::kNanosecond);\nBENCHMARK(BM_basic_slow)->Arg(100)->Unit(benchmark::kMicrosecond);\nBENCHMARK(BM_basic_slow)->Arg(1000)->Unit(benchmark::kMillisecond);\nBENCHMARK(BM_basic_slow)->Arg(1000)->Unit(benchmark::kSecond);\nBENCHMARK(BM_basic)->Range(1, 8);\nBENCHMARK(BM_basic)->RangeMultiplier(2)->Range(1, 8);\nBENCHMARK(BM_basic)->DenseRange(10, 15);\nBENCHMARK(BM_basic)->Args({42, 42});\nBENCHMARK(BM_basic)->Ranges({{64, 512}, {64, 512}});\nBENCHMARK(BM_basic)->MinTime(0.7);\nBENCHMARK(BM_basic)->MinWarmUpTime(0.8);\nBENCHMARK(BM_basic)->MinTime(0.1)->MinWarmUpTime(0.2);\nBENCHMARK(BM_basic)->UseRealTime();\nBENCHMARK(BM_basic)->ThreadRange(2, 4);\nBENCHMARK(BM_basic)->ThreadPerCpu();\nBENCHMARK(BM_basic)->Repetitions(3);\nBENCHMARK(BM_basic)\n ->RangeMultiplier(std::numeric_limits::max())\n ->Range(std::numeric_limits::min(),\n std::numeric_limits::max());\n\n// Negative ranges\nBENCHMARK(BM_basic)->Range(-64, -1);\nBENCHMARK(BM_basic)->RangeMultiplier(4)->Range(-8, 8);\nBENCHMARK(BM_basic)->DenseRange(-2, 2, 1);\nBENCHMARK(BM_basic)->Ranges({{-64, 1}, {-8, -1}});\n\nvoid CustomArgs(benchmark::internal::Benchmark* b) {\n for (int i = 0; i < 10; ++i) {\n b->Arg(i);\n }\n}\n\nBENCHMARK(BM_basic)->Apply(CustomArgs);\n\nvoid BM_explicit_iteration_count(benchmark::State& state) {\n // Test that benchmarks specified with an explicit iteration count are\n // only run once.\n static bool invoked_before = false;\n assert(!invoked_before);\n invoked_before = true;\n\n // Test that the requested iteration count is respected.\n assert(state.max_iterations == 42);\n for (auto _ : state) {\n }\n assert(state.iterations() == state.max_iterations);\n assert(state.iterations() == 42);\n}\nBENCHMARK(BM_explicit_iteration_count)->Iterations(42);\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/output_test.h", "content": "#ifndef TEST_OUTPUT_TEST_H\n#define TEST_OUTPUT_TEST_H\n\n#undef NDEBUG\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"../src/re.h\"\n#include \"benchmark/benchmark.h\"\n\n#define CONCAT2(x, y) x##y\n#define CONCAT(x, y) CONCAT2(x, y)\n\n#define ADD_CASES(...) int CONCAT(dummy, __LINE__) = ::AddCases(__VA_ARGS__)\n\n#define SET_SUBSTITUTIONS(...) \\\n int CONCAT(dummy, __LINE__) = ::SetSubstitutions(__VA_ARGS__)\n\nenum MatchRules {\n MR_Default, // Skip non-matching lines until a match is found.\n MR_Next, // Match must occur on the next line.\n MR_Not // No line between the current position and the next match matches\n // the regex\n};\n\nstruct TestCase {\n TestCase(std::string re, int rule = MR_Default);\n\n std::string regex_str;\n int match_rule;\n std::string substituted_regex;\n std::shared_ptr regex;\n};\n\nenum TestCaseID {\n TC_ConsoleOut,\n TC_ConsoleErr,\n TC_JSONOut,\n TC_JSONErr,\n TC_CSVOut,\n TC_CSVErr,\n\n TC_NumID // PRIVATE\n};\n\n// Add a list of test cases to be run against the output specified by\n// 'ID'\nint AddCases(TestCaseID ID, std::initializer_list il);\n\n// Add or set a list of substitutions to be performed on constructed regex's\n// See 'output_test_helper.cc' for a list of default substitutions.\nint SetSubstitutions(\n std::initializer_list> il);\n\n// Run all output tests.\nvoid RunOutputTests(int argc, char* argv[]);\n\n// Count the number of 'pat' substrings in the 'haystack' string.\nint SubstrCnt(const std::string& haystack, const std::string& pat);\n\n// Run registered benchmarks with file reporter enabled, and return the content\n// outputted by the file reporter.\nstd::string GetFileReporterOutput(int argc, char* argv[]);\n\n// ========================================================================= //\n// ------------------------- Results checking ------------------------------ //\n// ========================================================================= //\n\n// Call this macro to register a benchmark for checking its results. This\n// should be all that's needed. It subscribes a function to check the (CSV)\n// results of a benchmark. This is done only after verifying that the output\n// strings are really as expected.\n// bm_name_pattern: a name or a regex pattern which will be matched against\n// all the benchmark names. Matching benchmarks\n// will be the subject of a call to checker_function\n// checker_function: should be of type ResultsCheckFn (see below)\n#define CHECK_BENCHMARK_RESULTS(bm_name_pattern, checker_function) \\\n size_t CONCAT(dummy, __LINE__) = AddChecker(bm_name_pattern, checker_function)\n\nstruct Results;\ntypedef std::function ResultsCheckFn;\n\nsize_t AddChecker(const std::string& bm_name_pattern, const ResultsCheckFn& fn);\n\n// Class holding the results of a benchmark.\n// It is passed in calls to checker functions.\nstruct Results {\n // the benchmark name\n std::string name;\n // the benchmark fields\n std::map values;\n\n Results(const std::string& n) : name(n) {}\n\n int NumThreads() const;\n\n double NumIterations() const;\n\n typedef enum { kCpuTime, kRealTime } BenchmarkTime;\n\n // get cpu_time or real_time in seconds\n double GetTime(BenchmarkTime which) const;\n\n // get the real_time duration of the benchmark in seconds.\n // it is better to use fuzzy float checks for this, as the float\n // ASCII formatting is lossy.\n double DurationRealTime() const {\n return NumIterations() * GetTime(kRealTime);\n }\n // get the cpu_time duration of the benchmark in seconds\n double DurationCPUTime() const { return NumIterations() * GetTime(kCpuTime); }\n\n // get the string for a result by name, or nullptr if the name\n // is not found\n const std::string* Get(const std::string& entry_name) const {\n auto it = values.find(entry_name);\n if (it == values.end()) return nullptr;\n return &it->second;\n }\n\n // get a result by name, parsed as a specific type.\n // NOTE: for counters, use GetCounterAs instead.\n template \n T GetAs(const std::string& entry_name) const;\n\n // counters are written as doubles, so they have to be read first\n // as a double, and only then converted to the asked type.\n template \n T GetCounterAs(const std::string& entry_name) const {\n double dval = GetAs(entry_name);\n T tval = static_cast(dval);\n return tval;\n }\n};\n\ntemplate \nT Results::GetAs(const std::string& entry_name) const {\n auto* sv = Get(entry_name);\n BM_CHECK(sv != nullptr && !sv->empty());\n std::stringstream ss;\n ss << *sv;\n T out;\n ss >> out;\n BM_CHECK(!ss.fail());\n return out;\n}\n\n//----------------------------------\n// Macros to help in result checking. Do not use them with arguments causing\n// side-effects.\n\n// clang-format off\n\n#define CHECK_RESULT_VALUE_IMPL(entry, getfn, var_type, var_name, relationship, value) \\\n CONCAT(BM_CHECK_, relationship) \\\n (entry.getfn< var_type >(var_name), (value)) << \"\\n\" \\\n << __FILE__ << \":\" << __LINE__ << \": \" << (entry).name << \":\\n\" \\\n << __FILE__ << \":\" << __LINE__ << \": \" \\\n << \"expected (\" << #var_type << \")\" << (var_name) \\\n << \"=\" << (entry).getfn< var_type >(var_name) \\\n << \" to be \" #relationship \" to \" << (value) << \"\\n\"\n\n// check with tolerance. eps_factor is the tolerance window, which is\n// interpreted relative to value (eg, 0.1 means 10% of value).\n#define CHECK_FLOAT_RESULT_VALUE_IMPL(entry, getfn, var_type, var_name, relationship, value, eps_factor) \\\n CONCAT(BM_CHECK_FLOAT_, relationship) \\\n (entry.getfn< var_type >(var_name), (value), (eps_factor) * (value)) << \"\\n\" \\\n << __FILE__ << \":\" << __LINE__ << \": \" << (entry).name << \":\\n\" \\\n << __FILE__ << \":\" << __LINE__ << \": \" \\\n << \"expected (\" << #var_type << \")\" << (var_name) \\\n << \"=\" << (entry).getfn< var_type >(var_name) \\\n << \" to be \" #relationship \" to \" << (value) << \"\\n\" \\\n << __FILE__ << \":\" << __LINE__ << \": \" \\\n << \"with tolerance of \" << (eps_factor) * (value) \\\n << \" (\" << (eps_factor)*100. << \"%), \" \\\n << \"but delta was \" << ((entry).getfn< var_type >(var_name) - (value)) \\\n << \" (\" << (((entry).getfn< var_type >(var_name) - (value)) \\\n / \\\n ((value) > 1.e-5 || value < -1.e-5 ? value : 1.e-5)*100.) \\\n << \"%)\"\n\n#define CHECK_RESULT_VALUE(entry, var_type, var_name, relationship, value) \\\n CHECK_RESULT_VALUE_IMPL(entry, GetAs, var_type, var_name, relationship, value)\n\n#define CHECK_COUNTER_VALUE(entry, var_type, var_name, relationship, value) \\\n CHECK_RESULT_VALUE_IMPL(entry, GetCounterAs, var_type, var_name, relationship, value)\n\n#define CHECK_FLOAT_RESULT_VALUE(entry, var_name, relationship, value, eps_factor) \\\n CHECK_FLOAT_RESULT_VALUE_IMPL(entry, GetAs, double, var_name, relationship, value, eps_factor)\n\n#define CHECK_FLOAT_COUNTER_VALUE(entry, var_name, relationship, value, eps_factor) \\\n CHECK_FLOAT_RESULT_VALUE_IMPL(entry, GetCounterAs, double, var_name, relationship, value, eps_factor)\n\n// clang-format on\n\n// ========================================================================= //\n// --------------------------- Misc Utilities ------------------------------ //\n// ========================================================================= //\n\nnamespace {\n\nconst char* const dec_re = \"[0-9]*[.]?[0-9]+([eE][-+][0-9]+)?\";\n\n} // end namespace\n\n#endif // TEST_OUTPUT_TEST_H\n" }, { "path": "3rd/benchmark-1.8.2/test/output_test_helper.cc", "content": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"../src/benchmark_api_internal.h\"\n#include \"../src/check.h\" // NOTE: check.h is for internal use only!\n#include \"../src/log.h\" // NOTE: log.h is for internal use only\n#include \"../src/re.h\" // NOTE: re.h is for internal use only\n#include \"output_test.h\"\n\n// ========================================================================= //\n// ------------------------------ Internals -------------------------------- //\n// ========================================================================= //\nnamespace internal {\nnamespace {\n\nusing TestCaseList = std::vector;\n\n// Use a vector because the order elements are added matters during iteration.\n// std::map/unordered_map don't guarantee that.\n// For example:\n// SetSubstitutions({{\"%HelloWorld\", \"Hello\"}, {\"%Hello\", \"Hi\"}});\n// Substitute(\"%HelloWorld\") // Always expands to Hello.\nusing SubMap = std::vector>;\n\nTestCaseList& GetTestCaseList(TestCaseID ID) {\n // Uses function-local statics to ensure initialization occurs\n // before first use.\n static TestCaseList lists[TC_NumID];\n return lists[ID];\n}\n\nSubMap& GetSubstitutions() {\n // Don't use 'dec_re' from header because it may not yet be initialized.\n // clang-format off\n static std::string safe_dec_re = \"[0-9]*[.]?[0-9]+([eE][-+][0-9]+)?\";\n static std::string time_re = \"([0-9]+[.])?[0-9]+\";\n static std::string percentage_re = \"[0-9]+[.][0-9]{2}\";\n static SubMap map = {\n {\"%float\", \"[0-9]*[.]?[0-9]+([eE][-+][0-9]+)?\"},\n // human-readable float\n {\"%hrfloat\", \"[0-9]*[.]?[0-9]+([eE][-+][0-9]+)?[kMGTPEZYmunpfazy]?\"},\n {\"%percentage\", percentage_re},\n {\"%int\", \"[ ]*[0-9]+\"},\n {\" %s \", \"[ ]+\"},\n {\"%time\", \"[ ]*\" + time_re + \"[ ]+ns\"},\n {\"%console_report\", \"[ ]*\" + time_re + \"[ ]+ns [ ]*\" + time_re + \"[ ]+ns [ ]*[0-9]+\"},\n {\"%console_percentage_report\", \"[ ]*\" + percentage_re + \"[ ]+% [ ]*\" + percentage_re + \"[ ]+% [ ]*[0-9]+\"},\n {\"%console_us_report\", \"[ ]*\" + time_re + \"[ ]+us [ ]*\" + time_re + \"[ ]+us [ ]*[0-9]+\"},\n {\"%console_ms_report\", \"[ ]*\" + time_re + \"[ ]+ms [ ]*\" + time_re + \"[ ]+ms [ ]*[0-9]+\"},\n {\"%console_s_report\", \"[ ]*\" + time_re + \"[ ]+s [ ]*\" + time_re + \"[ ]+s [ ]*[0-9]+\"},\n {\"%console_time_only_report\", \"[ ]*\" + time_re + \"[ ]+ns [ ]*\" + time_re + \"[ ]+ns\"},\n {\"%console_us_report\", \"[ ]*\" + time_re + \"[ ]+us [ ]*\" + time_re + \"[ ]+us [ ]*[0-9]+\"},\n {\"%console_us_time_only_report\", \"[ ]*\" + time_re + \"[ ]+us [ ]*\" + time_re + \"[ ]+us\"},\n {\"%csv_header\",\n \"name,iterations,real_time,cpu_time,time_unit,bytes_per_second,\"\n \"items_per_second,label,error_occurred,error_message\"},\n {\"%csv_report\", \"[0-9]+,\" + safe_dec_re + \",\" + safe_dec_re + \",ns,,,,,\"},\n {\"%csv_us_report\", \"[0-9]+,\" + safe_dec_re + \",\" + safe_dec_re + \",us,,,,,\"},\n {\"%csv_ms_report\", \"[0-9]+,\" + safe_dec_re + \",\" + safe_dec_re + \",ms,,,,,\"},\n {\"%csv_s_report\", \"[0-9]+,\" + safe_dec_re + \",\" + safe_dec_re + \",s,,,,,\"},\n {\"%csv_bytes_report\",\n \"[0-9]+,\" + safe_dec_re + \",\" + safe_dec_re + \",ns,\" + safe_dec_re + \",,,,\"},\n {\"%csv_items_report\",\n \"[0-9]+,\" + safe_dec_re + \",\" + safe_dec_re + \",ns,,\" + safe_dec_re + \",,,\"},\n {\"%csv_bytes_items_report\",\n \"[0-9]+,\" + safe_dec_re + \",\" + safe_dec_re + \",ns,\" + safe_dec_re +\n \",\" + safe_dec_re + \",,,\"},\n {\"%csv_label_report_begin\", \"[0-9]+,\" + safe_dec_re + \",\" + safe_dec_re + \",ns,,,\"},\n {\"%csv_label_report_end\", \",,\"}};\n // clang-format on\n return map;\n}\n\nstd::string PerformSubstitutions(std::string source) {\n SubMap const& subs = GetSubstitutions();\n using SizeT = std::string::size_type;\n for (auto const& KV : subs) {\n SizeT pos;\n SizeT next_start = 0;\n while ((pos = source.find(KV.first, next_start)) != std::string::npos) {\n next_start = pos + KV.second.size();\n source.replace(pos, KV.first.size(), KV.second);\n }\n }\n return source;\n}\n\nvoid CheckCase(std::stringstream& remaining_output, TestCase const& TC,\n TestCaseList const& not_checks) {\n std::string first_line;\n bool on_first = true;\n std::string line;\n while (remaining_output.eof() == false) {\n BM_CHECK(remaining_output.good());\n std::getline(remaining_output, line);\n if (on_first) {\n first_line = line;\n on_first = false;\n }\n for (const auto& NC : not_checks) {\n BM_CHECK(!NC.regex->Match(line))\n << \"Unexpected match for line \\\"\" << line << \"\\\" for MR_Not regex \\\"\"\n << NC.regex_str << \"\\\"\"\n << \"\\n actual regex string \\\"\" << TC.substituted_regex << \"\\\"\"\n << \"\\n started matching near: \" << first_line;\n }\n if (TC.regex->Match(line)) return;\n BM_CHECK(TC.match_rule != MR_Next)\n << \"Expected line \\\"\" << line << \"\\\" to match regex \\\"\" << TC.regex_str\n << \"\\\"\"\n << \"\\n actual regex string \\\"\" << TC.substituted_regex << \"\\\"\"\n << \"\\n started matching near: \" << first_line;\n }\n BM_CHECK(remaining_output.eof() == false)\n << \"End of output reached before match for regex \\\"\" << TC.regex_str\n << \"\\\" was found\"\n << \"\\n actual regex string \\\"\" << TC.substituted_regex << \"\\\"\"\n << \"\\n started matching near: \" << first_line;\n}\n\nvoid CheckCases(TestCaseList const& checks, std::stringstream& output) {\n std::vector not_checks;\n for (size_t i = 0; i < checks.size(); ++i) {\n const auto& TC = checks[i];\n if (TC.match_rule == MR_Not) {\n not_checks.push_back(TC);\n continue;\n }\n CheckCase(output, TC, not_checks);\n not_checks.clear();\n }\n}\n\nclass TestReporter : public benchmark::BenchmarkReporter {\n public:\n TestReporter(std::vector reps)\n : reporters_(std::move(reps)) {}\n\n bool ReportContext(const Context& context) override {\n bool last_ret = false;\n bool first = true;\n for (auto rep : reporters_) {\n bool new_ret = rep->ReportContext(context);\n BM_CHECK(first || new_ret == last_ret)\n << \"Reports return different values for ReportContext\";\n first = false;\n last_ret = new_ret;\n }\n (void)first;\n return last_ret;\n }\n\n void ReportRuns(const std::vector& report) override {\n for (auto rep : reporters_) rep->ReportRuns(report);\n }\n void Finalize() override {\n for (auto rep : reporters_) rep->Finalize();\n }\n\n private:\n std::vector reporters_;\n};\n} // namespace\n\n} // end namespace internal\n\n// ========================================================================= //\n// -------------------------- Results checking ----------------------------- //\n// ========================================================================= //\n\nnamespace internal {\n\n// Utility class to manage subscribers for checking benchmark results.\n// It works by parsing the CSV output to read the results.\nclass ResultsChecker {\n public:\n struct PatternAndFn : public TestCase { // reusing TestCase for its regexes\n PatternAndFn(const std::string& rx, ResultsCheckFn fn_)\n : TestCase(rx), fn(std::move(fn_)) {}\n ResultsCheckFn fn;\n };\n\n std::vector check_patterns;\n std::vector results;\n std::vector field_names;\n\n void Add(const std::string& entry_pattern, const ResultsCheckFn& fn);\n\n void CheckResults(std::stringstream& output);\n\n private:\n void SetHeader_(const std::string& csv_header);\n void SetValues_(const std::string& entry_csv_line);\n\n std::vector SplitCsv_(const std::string& line);\n};\n\n// store the static ResultsChecker in a function to prevent initialization\n// order problems\nResultsChecker& GetResultsChecker() {\n static ResultsChecker rc;\n return rc;\n}\n\n// add a results checker for a benchmark\nvoid ResultsChecker::Add(const std::string& entry_pattern,\n const ResultsCheckFn& fn) {\n check_patterns.emplace_back(entry_pattern, fn);\n}\n\n// check the results of all subscribed benchmarks\nvoid ResultsChecker::CheckResults(std::stringstream& output) {\n // first reset the stream to the start\n {\n auto start = std::stringstream::pos_type(0);\n // clear before calling tellg()\n output.clear();\n // seek to zero only when needed\n if (output.tellg() > start) output.seekg(start);\n // and just in case\n output.clear();\n }\n // now go over every line and publish it to the ResultsChecker\n std::string line;\n bool on_first = true;\n while (output.eof() == false) {\n BM_CHECK(output.good());\n std::getline(output, line);\n if (on_first) {\n SetHeader_(line); // this is important\n on_first = false;\n continue;\n }\n SetValues_(line);\n }\n // finally we can call the subscribed check functions\n for (const auto& p : check_patterns) {\n BM_VLOG(2) << \"--------------------------------\\n\";\n BM_VLOG(2) << \"checking for benchmarks matching \" << p.regex_str << \"...\\n\";\n for (const auto& r : results) {\n if (!p.regex->Match(r.name)) {\n BM_VLOG(2) << p.regex_str << \" is not matched by \" << r.name << \"\\n\";\n continue;\n }\n BM_VLOG(2) << p.regex_str << \" is matched by \" << r.name << \"\\n\";\n BM_VLOG(1) << \"Checking results of \" << r.name << \": ... \\n\";\n p.fn(r);\n BM_VLOG(1) << \"Checking results of \" << r.name << \": OK.\\n\";\n }\n }\n}\n\n// prepare for the names in this header\nvoid ResultsChecker::SetHeader_(const std::string& csv_header) {\n field_names = SplitCsv_(csv_header);\n}\n\n// set the values for a benchmark\nvoid ResultsChecker::SetValues_(const std::string& entry_csv_line) {\n if (entry_csv_line.empty()) return; // some lines are empty\n BM_CHECK(!field_names.empty());\n auto vals = SplitCsv_(entry_csv_line);\n BM_CHECK_EQ(vals.size(), field_names.size());\n results.emplace_back(vals[0]); // vals[0] is the benchmark name\n auto& entry = results.back();\n for (size_t i = 1, e = vals.size(); i < e; ++i) {\n entry.values[field_names[i]] = vals[i];\n }\n}\n\n// a quick'n'dirty csv splitter (eliminating quotes)\nstd::vector ResultsChecker::SplitCsv_(const std::string& line) {\n std::vector out;\n if (line.empty()) return out;\n if (!field_names.empty()) out.reserve(field_names.size());\n size_t prev = 0, pos = line.find_first_of(','), curr = pos;\n while (pos != line.npos) {\n BM_CHECK(curr > 0);\n if (line[prev] == '\"') ++prev;\n if (line[curr - 1] == '\"') --curr;\n out.push_back(line.substr(prev, curr - prev));\n prev = pos + 1;\n pos = line.find_first_of(',', pos + 1);\n curr = pos;\n }\n curr = line.size();\n if (line[prev] == '\"') ++prev;\n if (line[curr - 1] == '\"') --curr;\n out.push_back(line.substr(prev, curr - prev));\n return out;\n}\n\n} // end namespace internal\n\nsize_t AddChecker(const std::string& bm_name, const ResultsCheckFn& fn) {\n auto& rc = internal::GetResultsChecker();\n rc.Add(bm_name, fn);\n return rc.results.size();\n}\n\nint Results::NumThreads() const {\n auto pos = name.find(\"/threads:\");\n if (pos == name.npos) return 1;\n auto end = name.find('/', pos + 9);\n std::stringstream ss;\n ss << name.substr(pos + 9, end);\n int num = 1;\n ss >> num;\n BM_CHECK(!ss.fail());\n return num;\n}\n\ndouble Results::NumIterations() const { return GetAs(\"iterations\"); }\n\ndouble Results::GetTime(BenchmarkTime which) const {\n BM_CHECK(which == kCpuTime || which == kRealTime);\n const char* which_str = which == kCpuTime ? \"cpu_time\" : \"real_time\";\n double val = GetAs(which_str);\n auto unit = Get(\"time_unit\");\n BM_CHECK(unit);\n if (*unit == \"ns\") {\n return val * 1.e-9;\n }\n if (*unit == \"us\") {\n return val * 1.e-6;\n }\n if (*unit == \"ms\") {\n return val * 1.e-3;\n }\n if (*unit == \"s\") {\n return val;\n }\n BM_CHECK(1 == 0) << \"unknown time unit: \" << *unit;\n return 0;\n}\n\n// ========================================================================= //\n// -------------------------- Public API Definitions------------------------ //\n// ========================================================================= //\n\nTestCase::TestCase(std::string re, int rule)\n : regex_str(std::move(re)),\n match_rule(rule),\n substituted_regex(internal::PerformSubstitutions(regex_str)),\n regex(std::make_shared()) {\n std::string err_str;\n regex->Init(substituted_regex, &err_str);\n BM_CHECK(err_str.empty())\n << \"Could not construct regex \\\"\" << substituted_regex << \"\\\"\"\n << \"\\n originally \\\"\" << regex_str << \"\\\"\"\n << \"\\n got error: \" << err_str;\n}\n\nint AddCases(TestCaseID ID, std::initializer_list il) {\n auto& L = internal::GetTestCaseList(ID);\n L.insert(L.end(), il);\n return 0;\n}\n\nint SetSubstitutions(\n std::initializer_list> il) {\n auto& subs = internal::GetSubstitutions();\n for (auto KV : il) {\n bool exists = false;\n KV.second = internal::PerformSubstitutions(KV.second);\n for (auto& EKV : subs) {\n if (EKV.first == KV.first) {\n EKV.second = std::move(KV.second);\n exists = true;\n break;\n }\n }\n if (!exists) subs.push_back(std::move(KV));\n }\n return 0;\n}\n\n// Disable deprecated warnings temporarily because we need to reference\n// CSVReporter but don't want to trigger -Werror=-Wdeprecated-declarations\nBENCHMARK_DISABLE_DEPRECATED_WARNING\n\nvoid RunOutputTests(int argc, char* argv[]) {\n using internal::GetTestCaseList;\n benchmark::Initialize(&argc, argv);\n auto options = benchmark::internal::GetOutputOptions(/*force_no_color*/ true);\n benchmark::ConsoleReporter CR(options);\n benchmark::JSONReporter JR;\n benchmark::CSVReporter CSVR;\n struct ReporterTest {\n std::string name;\n std::vector& output_cases;\n std::vector& error_cases;\n benchmark::BenchmarkReporter& reporter;\n std::stringstream out_stream;\n std::stringstream err_stream;\n\n ReporterTest(const std::string& n, std::vector& out_tc,\n std::vector& err_tc,\n benchmark::BenchmarkReporter& br)\n : name(n), output_cases(out_tc), error_cases(err_tc), reporter(br) {\n reporter.SetOutputStream(&out_stream);\n reporter.SetErrorStream(&err_stream);\n }\n } TestCases[] = {\n {std::string(\"ConsoleReporter\"), GetTestCaseList(TC_ConsoleOut),\n GetTestCaseList(TC_ConsoleErr), CR},\n {std::string(\"JSONReporter\"), GetTestCaseList(TC_JSONOut),\n GetTestCaseList(TC_JSONErr), JR},\n {std::string(\"CSVReporter\"), GetTestCaseList(TC_CSVOut),\n GetTestCaseList(TC_CSVErr), CSVR},\n };\n\n // Create the test reporter and run the benchmarks.\n std::cout << \"Running benchmarks...\\n\";\n internal::TestReporter test_rep({&CR, &JR, &CSVR});\n benchmark::RunSpecifiedBenchmarks(&test_rep);\n\n for (auto& rep_test : TestCases) {\n std::string msg =\n std::string(\"\\nTesting \") + rep_test.name + std::string(\" Output\\n\");\n std::string banner(msg.size() - 1, '-');\n std::cout << banner << msg << banner << \"\\n\";\n\n std::cerr << rep_test.err_stream.str();\n std::cout << rep_test.out_stream.str();\n\n internal::CheckCases(rep_test.error_cases, rep_test.err_stream);\n internal::CheckCases(rep_test.output_cases, rep_test.out_stream);\n\n std::cout << \"\\n\";\n }\n\n // now that we know the output is as expected, we can dispatch\n // the checks to subscribees.\n auto& csv = TestCases[2];\n // would use == but gcc spits a warning\n BM_CHECK(csv.name == std::string(\"CSVReporter\"));\n internal::GetResultsChecker().CheckResults(csv.out_stream);\n}\n\nBENCHMARK_RESTORE_DEPRECATED_WARNING\n\nint SubstrCnt(const std::string& haystack, const std::string& pat) {\n if (pat.length() == 0) return 0;\n int count = 0;\n for (size_t offset = haystack.find(pat); offset != std::string::npos;\n offset = haystack.find(pat, offset + pat.length()))\n ++count;\n return count;\n}\n\nstatic char ToHex(int ch) {\n return ch < 10 ? static_cast('0' + ch)\n : static_cast('a' + (ch - 10));\n}\n\nstatic char RandomHexChar() {\n static std::mt19937 rd{std::random_device{}()};\n static std::uniform_int_distribution mrand{0, 15};\n return ToHex(mrand(rd));\n}\n\nstatic std::string GetRandomFileName() {\n std::string model = \"test.%%%%%%\";\n for (auto& ch : model) {\n if (ch == '%') ch = RandomHexChar();\n }\n return model;\n}\n\nstatic bool FileExists(std::string const& name) {\n std::ifstream in(name.c_str());\n return in.good();\n}\n\nstatic std::string GetTempFileName() {\n // This function attempts to avoid race conditions where two tests\n // create the same file at the same time. However, it still introduces races\n // similar to tmpnam.\n int retries = 3;\n while (--retries) {\n std::string name = GetRandomFileName();\n if (!FileExists(name)) return name;\n }\n std::cerr << \"Failed to create unique temporary file name\" << std::endl;\n std::abort();\n}\n\nstd::string GetFileReporterOutput(int argc, char* argv[]) {\n std::vector new_argv(argv, argv + argc);\n assert(static_cast(argc) == new_argv.size());\n\n std::string tmp_file_name = GetTempFileName();\n std::cout << \"Will be using this as the tmp file: \" << tmp_file_name << '\\n';\n\n std::string tmp = \"--benchmark_out=\";\n tmp += tmp_file_name;\n new_argv.emplace_back(const_cast(tmp.c_str()));\n\n argc = int(new_argv.size());\n\n benchmark::Initialize(&argc, new_argv.data());\n benchmark::RunSpecifiedBenchmarks();\n\n // Read the output back from the file, and delete the file.\n std::ifstream tmp_stream(tmp_file_name);\n std::string output = std::string((std::istreambuf_iterator(tmp_stream)),\n std::istreambuf_iterator());\n std::remove(tmp_file_name.c_str());\n\n return output;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/perf_counters_gtest.cc", "content": "#include \n#include \n\n#include \"../src/perf_counters.h\"\n#include \"gtest/gtest.h\"\n\n#ifndef GTEST_SKIP\nstruct MsgHandler {\n void operator=(std::ostream&) {}\n};\n#define GTEST_SKIP() return MsgHandler() = std::cout\n#endif\n\nusing benchmark::internal::PerfCounters;\nusing benchmark::internal::PerfCountersMeasurement;\nusing benchmark::internal::PerfCounterValues;\n\nnamespace {\nconst char kGenericPerfEvent1[] = \"CYCLES\";\nconst char kGenericPerfEvent2[] = \"BRANCHES\";\nconst char kGenericPerfEvent3[] = \"INSTRUCTIONS\";\n\nTEST(PerfCountersTest, Init) {\n EXPECT_EQ(PerfCounters::Initialize(), PerfCounters::kSupported);\n}\n\nTEST(PerfCountersTest, OneCounter) {\n if (!PerfCounters::kSupported) {\n GTEST_SKIP() << \"Performance counters not supported.\\n\";\n }\n EXPECT_TRUE(PerfCounters::Initialize());\n EXPECT_EQ(PerfCounters::Create({kGenericPerfEvent1}).num_counters(), 1);\n}\n\nTEST(PerfCountersTest, NegativeTest) {\n if (!PerfCounters::kSupported) {\n EXPECT_FALSE(PerfCounters::Initialize());\n return;\n }\n EXPECT_TRUE(PerfCounters::Initialize());\n // Sanity checks\n // Create() will always create a valid object, even if passed no or\n // wrong arguments as the new behavior is to warn and drop unsupported\n // counters\n EXPECT_EQ(PerfCounters::Create({}).num_counters(), 0);\n EXPECT_EQ(PerfCounters::Create({\"\"}).num_counters(), 0);\n EXPECT_EQ(PerfCounters::Create({\"not a counter name\"}).num_counters(), 0);\n {\n // Try sneaking in a bad egg to see if it is filtered out. The\n // number of counters has to be two, not zero\n auto counter =\n PerfCounters::Create({kGenericPerfEvent2, \"\", kGenericPerfEvent1});\n EXPECT_EQ(counter.num_counters(), 2);\n EXPECT_EQ(counter.names(), std::vector(\n {kGenericPerfEvent2, kGenericPerfEvent1}));\n }\n {\n // Try sneaking in an outrageous counter, like a fat finger mistake\n auto counter = PerfCounters::Create(\n {kGenericPerfEvent3, \"not a counter name\", kGenericPerfEvent1});\n EXPECT_EQ(counter.num_counters(), 2);\n EXPECT_EQ(counter.names(), std::vector(\n {kGenericPerfEvent3, kGenericPerfEvent1}));\n }\n {\n // Finally try a golden input - it should like all them\n EXPECT_EQ(PerfCounters::Create(\n {kGenericPerfEvent1, kGenericPerfEvent2, kGenericPerfEvent3})\n .num_counters(),\n 3);\n }\n {\n // Add a bad apple in the end of the chain to check the edges\n auto counter = PerfCounters::Create({kGenericPerfEvent1, kGenericPerfEvent2,\n kGenericPerfEvent3,\n \"MISPREDICTED_BRANCH_RETIRED\"});\n EXPECT_EQ(counter.num_counters(), 3);\n EXPECT_EQ(counter.names(),\n std::vector({kGenericPerfEvent1, kGenericPerfEvent2,\n kGenericPerfEvent3}));\n }\n}\n\nTEST(PerfCountersTest, Read1Counter) {\n if (!PerfCounters::kSupported) {\n GTEST_SKIP() << \"Test skipped because libpfm is not supported.\\n\";\n }\n EXPECT_TRUE(PerfCounters::Initialize());\n auto counters = PerfCounters::Create({kGenericPerfEvent1});\n EXPECT_EQ(counters.num_counters(), 1);\n PerfCounterValues values1(1);\n EXPECT_TRUE(counters.Snapshot(&values1));\n EXPECT_GT(values1[0], 0);\n PerfCounterValues values2(1);\n EXPECT_TRUE(counters.Snapshot(&values2));\n EXPECT_GT(values2[0], 0);\n EXPECT_GT(values2[0], values1[0]);\n}\n\nTEST(PerfCountersTest, Read2Counters) {\n if (!PerfCounters::kSupported) {\n GTEST_SKIP() << \"Test skipped because libpfm is not supported.\\n\";\n }\n EXPECT_TRUE(PerfCounters::Initialize());\n auto counters =\n PerfCounters::Create({kGenericPerfEvent1, kGenericPerfEvent2});\n EXPECT_EQ(counters.num_counters(), 2);\n PerfCounterValues values1(2);\n EXPECT_TRUE(counters.Snapshot(&values1));\n EXPECT_GT(values1[0], 0);\n EXPECT_GT(values1[1], 0);\n PerfCounterValues values2(2);\n EXPECT_TRUE(counters.Snapshot(&values2));\n EXPECT_GT(values2[0], 0);\n EXPECT_GT(values2[1], 0);\n}\n\nTEST(PerfCountersTest, ReopenExistingCounters) {\n // This test works in recent and old Intel hardware\n // However we cannot make assumptions beyond 3 HW counters\n if (!PerfCounters::kSupported) {\n GTEST_SKIP() << \"Test skipped because libpfm is not supported.\\n\";\n }\n EXPECT_TRUE(PerfCounters::Initialize());\n std::vector kMetrics({kGenericPerfEvent1});\n std::vector counters(3);\n for (auto& counter : counters) {\n counter = PerfCounters::Create(kMetrics);\n }\n PerfCounterValues values(1);\n EXPECT_TRUE(counters[0].Snapshot(&values));\n EXPECT_TRUE(counters[1].Snapshot(&values));\n EXPECT_TRUE(counters[2].Snapshot(&values));\n}\n\nTEST(PerfCountersTest, CreateExistingMeasurements) {\n // The test works (i.e. causes read to fail) for the assumptions\n // about hardware capabilities (i.e. small number (3) hardware\n // counters) at this date,\n // the same as previous test ReopenExistingCounters.\n if (!PerfCounters::kSupported) {\n GTEST_SKIP() << \"Test skipped because libpfm is not supported.\\n\";\n }\n EXPECT_TRUE(PerfCounters::Initialize());\n\n // This means we will try 10 counters but we can only guarantee\n // for sure at this time that only 3 will work. Perhaps in the future\n // we could use libpfm to query for the hardware limits on this\n // particular platform.\n const int kMaxCounters = 10;\n const int kMinValidCounters = 3;\n\n // Let's use a ubiquitous counter that is guaranteed to work\n // on all platforms\n const std::vector kMetrics{\"cycles\"};\n\n // Cannot create a vector of actual objects because the\n // copy constructor of PerfCounters is deleted - and so is\n // implicitly deleted on PerfCountersMeasurement too\n std::vector>\n perf_counter_measurements;\n\n perf_counter_measurements.reserve(kMaxCounters);\n for (int j = 0; j < kMaxCounters; ++j) {\n perf_counter_measurements.emplace_back(\n new PerfCountersMeasurement(kMetrics));\n }\n\n std::vector> measurements;\n\n // Start all counters together to see if they hold\n size_t max_counters = kMaxCounters;\n for (size_t i = 0; i < kMaxCounters; ++i) {\n auto& counter(*perf_counter_measurements[i]);\n EXPECT_EQ(counter.num_counters(), 1);\n if (!counter.Start()) {\n max_counters = i;\n break;\n };\n }\n\n ASSERT_GE(max_counters, kMinValidCounters);\n\n // Start all together\n for (size_t i = 0; i < max_counters; ++i) {\n auto& counter(*perf_counter_measurements[i]);\n EXPECT_TRUE(counter.Stop(measurements) || (i >= kMinValidCounters));\n }\n\n // Start/stop individually\n for (size_t i = 0; i < max_counters; ++i) {\n auto& counter(*perf_counter_measurements[i]);\n measurements.clear();\n counter.Start();\n EXPECT_TRUE(counter.Stop(measurements) || (i >= kMinValidCounters));\n }\n}\n\n// We try to do some meaningful work here but the compiler\n// insists in optimizing away our loop so we had to add a\n// no-optimize macro. In case it fails, we added some entropy\n// to this pool as well.\n\nBENCHMARK_DONT_OPTIMIZE size_t do_work() {\n static std::mt19937 rd{std::random_device{}()};\n static std::uniform_int_distribution mrand(0, 10);\n const size_t kNumLoops = 1000000;\n size_t sum = 0;\n for (size_t j = 0; j < kNumLoops; ++j) {\n sum += mrand(rd);\n }\n benchmark::DoNotOptimize(sum);\n return sum;\n}\n\nvoid measure(size_t threadcount, PerfCounterValues* before,\n PerfCounterValues* after) {\n BM_CHECK_NE(before, nullptr);\n BM_CHECK_NE(after, nullptr);\n std::vector threads(threadcount);\n auto work = [&]() { BM_CHECK(do_work() > 1000); };\n\n // We need to first set up the counters, then start the threads, so the\n // threads would inherit the counters. But later, we need to first destroy\n // the thread pool (so all the work finishes), then measure the counters. So\n // the scopes overlap, and we need to explicitly control the scope of the\n // threadpool.\n auto counters =\n PerfCounters::Create({kGenericPerfEvent1, kGenericPerfEvent3});\n for (auto& t : threads) t = std::thread(work);\n counters.Snapshot(before);\n for (auto& t : threads) t.join();\n counters.Snapshot(after);\n}\n\nTEST(PerfCountersTest, MultiThreaded) {\n if (!PerfCounters::kSupported) {\n GTEST_SKIP() << \"Test skipped because libpfm is not supported.\";\n }\n EXPECT_TRUE(PerfCounters::Initialize());\n PerfCounterValues before(2);\n PerfCounterValues after(2);\n\n // Notice that this test will work even if we taskset it to a single CPU\n // In this case the threads will run sequentially\n // Start two threads and measure the number of combined cycles and\n // instructions\n measure(2, &before, &after);\n std::vector Elapsed2Threads{\n static_cast(after[0] - before[0]),\n static_cast(after[1] - before[1])};\n\n // Start four threads and measure the number of combined cycles and\n // instructions\n measure(4, &before, &after);\n std::vector Elapsed4Threads{\n static_cast(after[0] - before[0]),\n static_cast(after[1] - before[1])};\n\n // Some extra work will happen on the main thread - like joining the threads\n // - so the ratio won't be quite 2.0, but very close.\n EXPECT_GE(Elapsed4Threads[0], 1.9 * Elapsed2Threads[0]);\n EXPECT_GE(Elapsed4Threads[1], 1.9 * Elapsed2Threads[1]);\n}\n\nTEST(PerfCountersTest, HardwareLimits) {\n // The test works (i.e. causes read to fail) for the assumptions\n // about hardware capabilities (i.e. small number (3-4) hardware\n // counters) at this date,\n // the same as previous test ReopenExistingCounters.\n if (!PerfCounters::kSupported) {\n GTEST_SKIP() << \"Test skipped because libpfm is not supported.\\n\";\n }\n EXPECT_TRUE(PerfCounters::Initialize());\n\n // Taken straight from `perf list` on x86-64\n // Got all hardware names since these are the problematic ones\n std::vector counter_names{\"cycles\", // leader\n \"instructions\",\n \"branches\",\n \"L1-dcache-loads\",\n \"L1-dcache-load-misses\",\n \"L1-dcache-prefetches\",\n \"L1-icache-load-misses\", // leader\n \"L1-icache-loads\",\n \"branch-load-misses\",\n \"branch-loads\",\n \"dTLB-load-misses\",\n \"dTLB-loads\",\n \"iTLB-load-misses\", // leader\n \"iTLB-loads\",\n \"branch-instructions\",\n \"branch-misses\",\n \"cache-misses\",\n \"cache-references\",\n \"stalled-cycles-backend\", // leader\n \"stalled-cycles-frontend\"};\n\n // In the off-chance that some of these values are not supported,\n // we filter them out so the test will complete without failure\n // albeit it might not actually test the grouping on that platform\n std::vector valid_names;\n for (const std::string& name : counter_names) {\n if (PerfCounters::IsCounterSupported(name)) {\n valid_names.push_back(name);\n }\n }\n PerfCountersMeasurement counter(valid_names);\n\n std::vector> measurements;\n\n counter.Start();\n EXPECT_TRUE(counter.Stop(measurements));\n}\n\n} // namespace\n" }, { "path": "3rd/benchmark-1.8.2/test/perf_counters_test.cc", "content": "#undef NDEBUG\n\n#include \"../src/perf_counters.h\"\n\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\nstatic void BM_Simple(benchmark::State& state) {\n for (auto _ : state) {\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n}\nBENCHMARK(BM_Simple);\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_Simple\\\",$\"}});\n\nstatic void CheckSimple(Results const& e) {\n CHECK_COUNTER_VALUE(e, double, \"CYCLES\", GT, 0);\n CHECK_COUNTER_VALUE(e, double, \"BRANCHES\", GT, 0.0);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Simple\", &CheckSimple);\n\nint main(int argc, char* argv[]) {\n if (!benchmark::internal::PerfCounters::kSupported) {\n return 0;\n }\n RunOutputTests(argc, argv);\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/register_benchmark_test.cc", "content": "\n#undef NDEBUG\n#include \n#include \n\n#include \"../src/check.h\" // NOTE: check.h is for internal use only!\n#include \"benchmark/benchmark.h\"\n\nnamespace {\n\nclass TestReporter : public benchmark::ConsoleReporter {\n public:\n void ReportRuns(const std::vector& report) override {\n all_runs_.insert(all_runs_.end(), begin(report), end(report));\n ConsoleReporter::ReportRuns(report);\n }\n\n std::vector all_runs_;\n};\n\nstruct TestCase {\n const std::string name;\n const std::string label;\n // Note: not explicit as we rely on it being converted through ADD_CASES.\n TestCase(const std::string& xname) : TestCase(xname, \"\") {}\n TestCase(const std::string& xname, const std::string& xlabel)\n : name(xname), label(xlabel) {}\n\n typedef benchmark::BenchmarkReporter::Run Run;\n\n void CheckRun(Run const& run) const {\n // clang-format off\n BM_CHECK(name == run.benchmark_name()) << \"expected \" << name << \" got \"\n << run.benchmark_name();\n if (!label.empty()) {\n BM_CHECK(run.report_label == label) << \"expected \" << label << \" got \"\n << run.report_label;\n } else {\n BM_CHECK(run.report_label.empty());\n }\n // clang-format on\n }\n};\n\nstd::vector ExpectedResults;\n\nint AddCases(std::initializer_list const& v) {\n for (const auto& N : v) {\n ExpectedResults.push_back(N);\n }\n return 0;\n}\n\n#define CONCAT(x, y) CONCAT2(x, y)\n#define CONCAT2(x, y) x##y\n#define ADD_CASES(...) int CONCAT(dummy, __LINE__) = AddCases({__VA_ARGS__})\n\n} // end namespace\n\ntypedef benchmark::internal::Benchmark* ReturnVal;\n\n//----------------------------------------------------------------------------//\n// Test RegisterBenchmark with no additional arguments\n//----------------------------------------------------------------------------//\nvoid BM_function(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_function);\nReturnVal dummy = benchmark::RegisterBenchmark(\n \"BM_function_manual_registration\", BM_function);\nADD_CASES({\"BM_function\"}, {\"BM_function_manual_registration\"});\n\n//----------------------------------------------------------------------------//\n// Test RegisterBenchmark with additional arguments\n// Note: GCC <= 4.8 do not support this form of RegisterBenchmark because they\n// reject the variadic pack expansion of lambda captures.\n//----------------------------------------------------------------------------//\n#ifndef BENCHMARK_HAS_NO_VARIADIC_REGISTER_BENCHMARK\n\nvoid BM_extra_args(benchmark::State& st, const char* label) {\n for (auto _ : st) {\n }\n st.SetLabel(label);\n}\nint RegisterFromFunction() {\n std::pair cases[] = {\n {\"test1\", \"One\"}, {\"test2\", \"Two\"}, {\"test3\", \"Three\"}};\n for (auto const& c : cases)\n benchmark::RegisterBenchmark(c.first, &BM_extra_args, c.second);\n return 0;\n}\nint dummy2 = RegisterFromFunction();\nADD_CASES({\"test1\", \"One\"}, {\"test2\", \"Two\"}, {\"test3\", \"Three\"});\n\n#endif // BENCHMARK_HAS_NO_VARIADIC_REGISTER_BENCHMARK\n\n//----------------------------------------------------------------------------//\n// Test RegisterBenchmark with DISABLED_ benchmark\n//----------------------------------------------------------------------------//\nvoid DISABLED_BM_function(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(DISABLED_BM_function);\nReturnVal dummy3 = benchmark::RegisterBenchmark(\"DISABLED_BM_function_manual\",\n DISABLED_BM_function);\n// No need to add cases because we don't expect them to run.\n\n//----------------------------------------------------------------------------//\n// Test RegisterBenchmark with different callable types\n//----------------------------------------------------------------------------//\n\nstruct CustomFixture {\n void operator()(benchmark::State& st) {\n for (auto _ : st) {\n }\n }\n};\n\nvoid TestRegistrationAtRuntime() {\n#ifdef BENCHMARK_HAS_CXX11\n {\n CustomFixture fx;\n benchmark::RegisterBenchmark(\"custom_fixture\", fx);\n AddCases({std::string(\"custom_fixture\")});\n }\n#endif\n#ifndef BENCHMARK_HAS_NO_VARIADIC_REGISTER_BENCHMARK\n {\n const char* x = \"42\";\n auto capturing_lam = [=](benchmark::State& st) {\n for (auto _ : st) {\n }\n st.SetLabel(x);\n };\n benchmark::RegisterBenchmark(\"lambda_benchmark\", capturing_lam);\n AddCases({{\"lambda_benchmark\", x}});\n }\n#endif\n}\n\n// Test that all benchmarks, registered at either during static init or runtime,\n// are run and the results are passed to the reported.\nvoid RunTestOne() {\n TestRegistrationAtRuntime();\n\n TestReporter test_reporter;\n benchmark::RunSpecifiedBenchmarks(&test_reporter);\n\n typedef benchmark::BenchmarkReporter::Run Run;\n auto EB = ExpectedResults.begin();\n\n for (Run const& run : test_reporter.all_runs_) {\n assert(EB != ExpectedResults.end());\n EB->CheckRun(run);\n ++EB;\n }\n assert(EB == ExpectedResults.end());\n}\n\n// Test that ClearRegisteredBenchmarks() clears all previously registered\n// benchmarks.\n// Also test that new benchmarks can be registered and ran afterwards.\nvoid RunTestTwo() {\n assert(ExpectedResults.size() != 0 &&\n \"must have at least one registered benchmark\");\n ExpectedResults.clear();\n benchmark::ClearRegisteredBenchmarks();\n\n TestReporter test_reporter;\n size_t num_ran = benchmark::RunSpecifiedBenchmarks(&test_reporter);\n assert(num_ran == 0);\n assert(test_reporter.all_runs_.begin() == test_reporter.all_runs_.end());\n\n TestRegistrationAtRuntime();\n num_ran = benchmark::RunSpecifiedBenchmarks(&test_reporter);\n assert(num_ran == ExpectedResults.size());\n\n typedef benchmark::BenchmarkReporter::Run Run;\n auto EB = ExpectedResults.begin();\n\n for (Run const& run : test_reporter.all_runs_) {\n assert(EB != ExpectedResults.end());\n EB->CheckRun(run);\n ++EB;\n }\n assert(EB == ExpectedResults.end());\n}\n\nint main(int argc, char* argv[]) {\n benchmark::Initialize(&argc, argv);\n\n RunTestOne();\n RunTestTwo();\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/repetitions_test.cc", "content": "\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\n// ========================================================================= //\n// ------------------------ Testing Basic Output --------------------------- //\n// ========================================================================= //\n\nstatic void BM_ExplicitRepetitions(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_ExplicitRepetitions)->Repetitions(2);\n\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_ExplicitRepetitions/repeats:2 %console_report$\"}});\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_ExplicitRepetitions/repeats:2 %console_report$\"}});\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_ExplicitRepetitions/repeats:2_mean %console_report$\"}});\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_ExplicitRepetitions/repeats:2_median %console_report$\"}});\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_ExplicitRepetitions/repeats:2_stddev %console_report$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_ExplicitRepetitions/repeats:2\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ExplicitRepetitions/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_ExplicitRepetitions/repeats:2\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ExplicitRepetitions/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_ExplicitRepetitions/repeats:2_mean\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ExplicitRepetitions/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_ExplicitRepetitions/repeats:2_median\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ExplicitRepetitions/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_ExplicitRepetitions/repeats:2_stddev\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ExplicitRepetitions/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_ExplicitRepetitions/repeats:2\\\",%csv_report$\"}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_ExplicitRepetitions/repeats:2\\\",%csv_report$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_ExplicitRepetitions/repeats:2_mean\\\",%csv_report$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_ExplicitRepetitions/repeats:2_median\\\",%csv_report$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_ExplicitRepetitions/repeats:2_stddev\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Basic Output --------------------------- //\n// ========================================================================= //\n\nstatic void BM_ImplicitRepetitions(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_ImplicitRepetitions);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_ImplicitRepetitions %console_report$\"}});\nADD_CASES(TC_ConsoleOut, {{\"^BM_ImplicitRepetitions %console_report$\"}});\nADD_CASES(TC_ConsoleOut, {{\"^BM_ImplicitRepetitions %console_report$\"}});\nADD_CASES(TC_ConsoleOut, {{\"^BM_ImplicitRepetitions_mean %console_report$\"}});\nADD_CASES(TC_ConsoleOut, {{\"^BM_ImplicitRepetitions_median %console_report$\"}});\nADD_CASES(TC_ConsoleOut, {{\"^BM_ImplicitRepetitions_stddev %console_report$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_ImplicitRepetitions\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ImplicitRepetitions\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_ImplicitRepetitions\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ImplicitRepetitions\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_ImplicitRepetitions\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ImplicitRepetitions\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_ImplicitRepetitions_mean\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ImplicitRepetitions\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_ImplicitRepetitions_median\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ImplicitRepetitions\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_ImplicitRepetitions_stddev\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_ImplicitRepetitions\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_ImplicitRepetitions\\\",%csv_report$\"}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_ImplicitRepetitions\\\",%csv_report$\"}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_ImplicitRepetitions_mean\\\",%csv_report$\"}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_ImplicitRepetitions_median\\\",%csv_report$\"}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_ImplicitRepetitions_stddev\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// --------------------------- TEST CASES END ------------------------------ //\n// ========================================================================= //\n\nint main(int argc, char* argv[]) { RunOutputTests(argc, argv); }\n" }, { "path": "3rd/benchmark-1.8.2/test/report_aggregates_only_test.cc", "content": "\n#undef NDEBUG\n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\n// Ok this test is super ugly. We want to check what happens with the file\n// reporter in the presence of ReportAggregatesOnly().\n// We do not care about console output, the normal tests check that already.\n\nvoid BM_SummaryRepeat(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_SummaryRepeat)->Repetitions(3)->ReportAggregatesOnly();\n\nint main(int argc, char* argv[]) {\n const std::string output = GetFileReporterOutput(argc, argv);\n\n if (SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3\") != 4 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_mean\\\"\") != 1 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_median\\\"\") !=\n 1 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_stddev\\\"\") !=\n 1 ||\n SubstrCnt(output, \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_cv\\\"\") != 1) {\n std::cout << \"Precondition mismatch. Expected to only find four \"\n \"occurrences of \\\"BM_SummaryRepeat/repeats:3\\\" substring:\\n\"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_mean\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_median\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_stddev\\\", \"\n \"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_cv\\\"\\nThe entire \"\n \"output:\\n\";\n std::cout << output;\n return 1;\n }\n\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/reporter_output_test.cc", "content": "\n#undef NDEBUG\n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\n// ========================================================================= //\n// ---------------------- Testing Prologue Output -------------------------- //\n// ========================================================================= //\n\nADD_CASES(TC_ConsoleOut, {{\"^[-]+$\", MR_Next},\n {\"^Benchmark %s Time %s CPU %s Iterations$\", MR_Next},\n {\"^[-]+$\", MR_Next}});\nstatic int AddContextCases() {\n AddCases(TC_ConsoleErr,\n {\n {\"^%int-%int-%intT%int:%int:%int[-+]%int:%int$\", MR_Default},\n {\"Running .*(/|\\\\\\\\)reporter_output_test(\\\\.exe)?$\", MR_Next},\n {\"Run on \\\\(%int X %float MHz CPU s?\\\\)\", MR_Next},\n });\n AddCases(TC_JSONOut,\n {{\"^\\\\{\", MR_Default},\n {\"\\\"context\\\":\", MR_Next},\n {\"\\\"date\\\": \\\"\", MR_Next},\n {\"\\\"host_name\\\":\", MR_Next},\n {\"\\\"executable\\\": \\\".*(/|\\\\\\\\)reporter_output_test(\\\\.exe)?\\\",\",\n MR_Next},\n {\"\\\"num_cpus\\\": %int,$\", MR_Next},\n {\"\\\"mhz_per_cpu\\\": %float,$\", MR_Next},\n {\"\\\"caches\\\": \\\\[$\", MR_Default}});\n auto const& Info = benchmark::CPUInfo::Get();\n auto const& Caches = Info.caches;\n if (!Caches.empty()) {\n AddCases(TC_ConsoleErr, {{\"CPU Caches:$\", MR_Next}});\n }\n for (size_t I = 0; I < Caches.size(); ++I) {\n std::string num_caches_str =\n Caches[I].num_sharing != 0 ? \" \\\\(x%int\\\\)$\" : \"$\";\n AddCases(TC_ConsoleErr,\n {{\"L%int (Data|Instruction|Unified) %int KiB\" + num_caches_str,\n MR_Next}});\n AddCases(TC_JSONOut, {{\"\\\\{$\", MR_Next},\n {\"\\\"type\\\": \\\"\", MR_Next},\n {\"\\\"level\\\": %int,$\", MR_Next},\n {\"\\\"size\\\": %int,$\", MR_Next},\n {\"\\\"num_sharing\\\": %int$\", MR_Next},\n {\"}[,]{0,1}$\", MR_Next}});\n }\n AddCases(TC_JSONOut, {{\"],$\"}});\n auto const& LoadAvg = Info.load_avg;\n if (!LoadAvg.empty()) {\n AddCases(TC_ConsoleErr,\n {{\"Load Average: (%float, ){0,2}%float$\", MR_Next}});\n }\n AddCases(TC_JSONOut, {{\"\\\"load_avg\\\": \\\\[(%float,?){0,3}],$\", MR_Next}});\n return 0;\n}\nint dummy_register = AddContextCases();\nADD_CASES(TC_CSVOut, {{\"%csv_header\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Basic Output --------------------------- //\n// ========================================================================= //\n\nvoid BM_basic(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_basic);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_basic %console_report$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_basic\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_basic\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_basic\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Bytes per Second Output ---------------- //\n// ========================================================================= //\n\nvoid BM_bytes_per_second(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n state.SetBytesProcessed(1);\n}\nBENCHMARK(BM_bytes_per_second);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_bytes_per_second %console_report \"\n \"bytes_per_second=%float[kM]{0,1}/s$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_bytes_per_second\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_bytes_per_second\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bytes_per_second\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_bytes_per_second\\\",%csv_bytes_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Items per Second Output ---------------- //\n// ========================================================================= //\n\nvoid BM_items_per_second(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n state.SetItemsProcessed(1);\n}\nBENCHMARK(BM_items_per_second);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_items_per_second %console_report \"\n \"items_per_second=%float[kM]{0,1}/s$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_items_per_second\\\",$\"},\n {\"\\\"family_index\\\": 2,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_items_per_second\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"items_per_second\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_items_per_second\\\",%csv_items_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Label Output --------------------------- //\n// ========================================================================= //\n\nvoid BM_label(benchmark::State& state) {\n for (auto _ : state) {\n }\n state.SetLabel(\"some label\");\n}\nBENCHMARK(BM_label);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_label %console_report some label$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_label\\\",$\"},\n {\"\\\"family_index\\\": 3,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_label\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"label\\\": \\\"some label\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_label\\\",%csv_label_report_begin\\\"some \"\n \"label\\\"%csv_label_report_end$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Time Label Output ---------------------- //\n// ========================================================================= //\n\nvoid BM_time_label_nanosecond(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_time_label_nanosecond)->Unit(benchmark::kNanosecond);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_time_label_nanosecond %console_report$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_time_label_nanosecond\\\",$\"},\n {\"\\\"family_index\\\": 4,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_time_label_nanosecond\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_time_label_nanosecond\\\",%csv_report$\"}});\n\nvoid BM_time_label_microsecond(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_time_label_microsecond)->Unit(benchmark::kMicrosecond);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_time_label_microsecond %console_us_report$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_time_label_microsecond\\\",$\"},\n {\"\\\"family_index\\\": 5,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_time_label_microsecond\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"us\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_time_label_microsecond\\\",%csv_us_report$\"}});\n\nvoid BM_time_label_millisecond(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_time_label_millisecond)->Unit(benchmark::kMillisecond);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_time_label_millisecond %console_ms_report$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_time_label_millisecond\\\",$\"},\n {\"\\\"family_index\\\": 6,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_time_label_millisecond\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ms\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_time_label_millisecond\\\",%csv_ms_report$\"}});\n\nvoid BM_time_label_second(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_time_label_second)->Unit(benchmark::kSecond);\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_time_label_second %console_s_report$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_time_label_second\\\",$\"},\n {\"\\\"family_index\\\": 7,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_time_label_second\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"s\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_time_label_second\\\",%csv_s_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Error Output --------------------------- //\n// ========================================================================= //\n\nvoid BM_error(benchmark::State& state) {\n state.SkipWithError(\"message\");\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_error);\nADD_CASES(TC_ConsoleOut, {{\"^BM_error[ ]+ERROR OCCURRED: 'message'$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_error\\\",$\"},\n {\"\\\"family_index\\\": 8,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_error\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"error_occurred\\\": true,$\", MR_Next},\n {\"\\\"error_message\\\": \\\"message\\\",$\", MR_Next}});\n\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_error\\\",,,,,,,,true,\\\"message\\\"$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing No Arg Name Output -----------------------\n// //\n// ========================================================================= //\n\nvoid BM_no_arg_name(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_no_arg_name)->Arg(3);\nADD_CASES(TC_ConsoleOut, {{\"^BM_no_arg_name/3 %console_report$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_no_arg_name/3\\\",$\"},\n {\"\\\"family_index\\\": 9,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_no_arg_name/3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_no_arg_name/3\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Arg Name Output ------------------------ //\n// ========================================================================= //\n\nvoid BM_arg_name(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_arg_name)->ArgName(\"first\")->Arg(3);\nADD_CASES(TC_ConsoleOut, {{\"^BM_arg_name/first:3 %console_report$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_arg_name/first:3\\\",$\"},\n {\"\\\"family_index\\\": 10,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_arg_name/first:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_arg_name/first:3\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Arg Names Output ----------------------- //\n// ========================================================================= //\n\nvoid BM_arg_names(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_arg_names)->Args({2, 5, 4})->ArgNames({\"first\", \"\", \"third\"});\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_arg_names/first:2/5/third:4 %console_report$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_arg_names/first:2/5/third:4\\\",$\"},\n {\"\\\"family_index\\\": 11,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_arg_names/first:2/5/third:4\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_arg_names/first:2/5/third:4\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Name Output ---------------------------- //\n// ========================================================================= //\n\nvoid BM_name(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_name)->Name(\"BM_custom_name\");\n\nADD_CASES(TC_ConsoleOut, {{\"^BM_custom_name %console_report$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_custom_name\\\",$\"},\n {\"\\\"family_index\\\": 12,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_custom_name\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\"$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_custom_name\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// ------------------------ Testing Big Args Output ------------------------ //\n// ========================================================================= //\n\nvoid BM_BigArgs(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_BigArgs)->RangeMultiplier(2)->Range(1U << 30U, 1U << 31U);\nADD_CASES(TC_ConsoleOut, {{\"^BM_BigArgs/1073741824 %console_report$\"},\n {\"^BM_BigArgs/2147483648 %console_report$\"}});\n\n// ========================================================================= //\n// ----------------------- Testing Complexity Output ----------------------- //\n// ========================================================================= //\n\nvoid BM_Complexity_O1(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n state.SetComplexityN(state.range(0));\n}\nBENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);\nSET_SUBSTITUTIONS({{\"%bigOStr\", \"[ ]* %float \\\\([0-9]+\\\\)\"},\n {\"%RMS\", \"[ ]*[0-9]+ %\"}});\nADD_CASES(TC_ConsoleOut, {{\"^BM_Complexity_O1_BigO %bigOStr %bigOStr[ ]*$\"},\n {\"^BM_Complexity_O1_RMS %RMS %RMS[ ]*$\"}});\n\n// ========================================================================= //\n// ----------------------- Testing Aggregate Output ------------------------ //\n// ========================================================================= //\n\n// Test that non-aggregate data is printed by default\nvoid BM_Repeat(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\n// need two repetitions min to be able to output any aggregate output\nBENCHMARK(BM_Repeat)->Repetitions(2);\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_Repeat/repeats:2 %console_report$\"},\n {\"^BM_Repeat/repeats:2 %console_report$\"},\n {\"^BM_Repeat/repeats:2_mean %console_time_only_report [ ]*2$\"},\n {\"^BM_Repeat/repeats:2_median %console_time_only_report [ ]*2$\"},\n {\"^BM_Repeat/repeats:2_stddev %console_time_only_report [ ]*2$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_Repeat/repeats:2\\\",$\"},\n {\"\\\"family_index\\\": 15,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:2\\\"\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:2\\\",$\"},\n {\"\\\"family_index\\\": 15,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:2_mean\\\",$\"},\n {\"\\\"family_index\\\": 15,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:2_median\\\",$\"},\n {\"\\\"family_index\\\": 15,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:2_stddev\\\",$\"},\n {\"\\\"family_index\\\": 15,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Repeat/repeats:2\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:2\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:2_mean\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:2_median\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:2_stddev\\\",%csv_report$\"}});\n// but for two repetitions, mean and median is the same, so let's repeat..\nBENCHMARK(BM_Repeat)->Repetitions(3);\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_Repeat/repeats:3 %console_report$\"},\n {\"^BM_Repeat/repeats:3 %console_report$\"},\n {\"^BM_Repeat/repeats:3 %console_report$\"},\n {\"^BM_Repeat/repeats:3_mean %console_time_only_report [ ]*3$\"},\n {\"^BM_Repeat/repeats:3_median %console_time_only_report [ ]*3$\"},\n {\"^BM_Repeat/repeats:3_stddev %console_time_only_report [ ]*3$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_Repeat/repeats:3\\\",$\"},\n {\"\\\"family_index\\\": 16,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:3\\\",$\"},\n {\"\\\"family_index\\\": 16,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:3\\\",$\"},\n {\"\\\"family_index\\\": 16,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:3_mean\\\",$\"},\n {\"\\\"family_index\\\": 16,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:3_median\\\",$\"},\n {\"\\\"family_index\\\": 16,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:3_stddev\\\",$\"},\n {\"\\\"family_index\\\": 16,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Repeat/repeats:3\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:3\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:3\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:3_mean\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:3_median\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:3_stddev\\\",%csv_report$\"}});\n// median differs between even/odd number of repetitions, so just to be sure\nBENCHMARK(BM_Repeat)->Repetitions(4);\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_Repeat/repeats:4 %console_report$\"},\n {\"^BM_Repeat/repeats:4 %console_report$\"},\n {\"^BM_Repeat/repeats:4 %console_report$\"},\n {\"^BM_Repeat/repeats:4 %console_report$\"},\n {\"^BM_Repeat/repeats:4_mean %console_time_only_report [ ]*4$\"},\n {\"^BM_Repeat/repeats:4_median %console_time_only_report [ ]*4$\"},\n {\"^BM_Repeat/repeats:4_stddev %console_time_only_report [ ]*4$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_Repeat/repeats:4\\\",$\"},\n {\"\\\"family_index\\\": 17,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:4\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 4,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:4\\\",$\"},\n {\"\\\"family_index\\\": 17,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:4\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 4,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:4\\\",$\"},\n {\"\\\"family_index\\\": 17,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:4\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 4,$\", MR_Next},\n {\"\\\"repetition_index\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:4\\\",$\"},\n {\"\\\"family_index\\\": 17,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:4\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 4,$\", MR_Next},\n {\"\\\"repetition_index\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:4_mean\\\",$\"},\n {\"\\\"family_index\\\": 17,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:4\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 4,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 4,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:4_median\\\",$\"},\n {\"\\\"family_index\\\": 17,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:4\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 4,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 4,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_Repeat/repeats:4_stddev\\\",$\"},\n {\"\\\"family_index\\\": 17,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Repeat/repeats:4\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 4,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 4,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Repeat/repeats:4\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:4\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:4\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:4\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:4_mean\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:4_median\\\",%csv_report$\"},\n {\"^\\\"BM_Repeat/repeats:4_stddev\\\",%csv_report$\"}});\n\n// Test that a non-repeated test still prints non-aggregate results even when\n// only-aggregate reports have been requested\nvoid BM_RepeatOnce(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_RepeatOnce)->Repetitions(1)->ReportAggregatesOnly();\nADD_CASES(TC_ConsoleOut, {{\"^BM_RepeatOnce/repeats:1 %console_report$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_RepeatOnce/repeats:1\\\",$\"},\n {\"\\\"family_index\\\": 18,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_RepeatOnce/repeats:1\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_RepeatOnce/repeats:1\\\",%csv_report$\"}});\n\n// Test that non-aggregate data is not reported\nvoid BM_SummaryRepeat(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_SummaryRepeat)->Repetitions(3)->ReportAggregatesOnly();\nADD_CASES(\n TC_ConsoleOut,\n {{\".*BM_SummaryRepeat/repeats:3 \", MR_Not},\n {\"^BM_SummaryRepeat/repeats:3_mean %console_time_only_report [ ]*3$\"},\n {\"^BM_SummaryRepeat/repeats:3_median %console_time_only_report [ ]*3$\"},\n {\"^BM_SummaryRepeat/repeats:3_stddev %console_time_only_report [ ]*3$\"}});\nADD_CASES(TC_JSONOut,\n {{\".*BM_SummaryRepeat/repeats:3 \", MR_Not},\n {\"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_mean\\\",$\"},\n {\"\\\"family_index\\\": 19,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_SummaryRepeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_median\\\",$\"},\n {\"\\\"family_index\\\": 19,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_SummaryRepeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_SummaryRepeat/repeats:3_stddev\\\",$\"},\n {\"\\\"family_index\\\": 19,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_SummaryRepeat/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\".*BM_SummaryRepeat/repeats:3 \", MR_Not},\n {\"^\\\"BM_SummaryRepeat/repeats:3_mean\\\",%csv_report$\"},\n {\"^\\\"BM_SummaryRepeat/repeats:3_median\\\",%csv_report$\"},\n {\"^\\\"BM_SummaryRepeat/repeats:3_stddev\\\",%csv_report$\"}});\n\n// Test that non-aggregate data is not displayed.\n// NOTE: this test is kinda bad. we are only testing the display output.\n// But we don't check that the file output still contains everything...\nvoid BM_SummaryDisplay(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_SummaryDisplay)->Repetitions(2)->DisplayAggregatesOnly();\nADD_CASES(\n TC_ConsoleOut,\n {{\".*BM_SummaryDisplay/repeats:2 \", MR_Not},\n {\"^BM_SummaryDisplay/repeats:2_mean %console_time_only_report [ ]*2$\"},\n {\"^BM_SummaryDisplay/repeats:2_median %console_time_only_report [ ]*2$\"},\n {\"^BM_SummaryDisplay/repeats:2_stddev %console_time_only_report [ ]*2$\"}});\nADD_CASES(TC_JSONOut,\n {{\".*BM_SummaryDisplay/repeats:2 \", MR_Not},\n {\"\\\"name\\\": \\\"BM_SummaryDisplay/repeats:2_mean\\\",$\"},\n {\"\\\"family_index\\\": 20,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_SummaryDisplay/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_SummaryDisplay/repeats:2_median\\\",$\"},\n {\"\\\"family_index\\\": 20,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_SummaryDisplay/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_SummaryDisplay/repeats:2_stddev\\\",$\"},\n {\"\\\"family_index\\\": 20,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_SummaryDisplay/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next}});\nADD_CASES(TC_CSVOut,\n {{\".*BM_SummaryDisplay/repeats:2 \", MR_Not},\n {\"^\\\"BM_SummaryDisplay/repeats:2_mean\\\",%csv_report$\"},\n {\"^\\\"BM_SummaryDisplay/repeats:2_median\\\",%csv_report$\"},\n {\"^\\\"BM_SummaryDisplay/repeats:2_stddev\\\",%csv_report$\"}});\n\n// Test repeats with custom time unit.\nvoid BM_RepeatTimeUnit(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_RepeatTimeUnit)\n ->Repetitions(3)\n ->ReportAggregatesOnly()\n ->Unit(benchmark::kMicrosecond);\nADD_CASES(\n TC_ConsoleOut,\n {{\".*BM_RepeatTimeUnit/repeats:3 \", MR_Not},\n {\"^BM_RepeatTimeUnit/repeats:3_mean %console_us_time_only_report [ ]*3$\"},\n {\"^BM_RepeatTimeUnit/repeats:3_median %console_us_time_only_report [ \"\n \"]*3$\"},\n {\"^BM_RepeatTimeUnit/repeats:3_stddev %console_us_time_only_report [ \"\n \"]*3$\"}});\nADD_CASES(TC_JSONOut,\n {{\".*BM_RepeatTimeUnit/repeats:3 \", MR_Not},\n {\"\\\"name\\\": \\\"BM_RepeatTimeUnit/repeats:3_mean\\\",$\"},\n {\"\\\"family_index\\\": 21,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_RepeatTimeUnit/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"us\\\",?$\"},\n {\"\\\"name\\\": \\\"BM_RepeatTimeUnit/repeats:3_median\\\",$\"},\n {\"\\\"family_index\\\": 21,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_RepeatTimeUnit/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"us\\\",?$\"},\n {\"\\\"name\\\": \\\"BM_RepeatTimeUnit/repeats:3_stddev\\\",$\"},\n {\"\\\"family_index\\\": 21,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_RepeatTimeUnit/repeats:3\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"us\\\",?$\"}});\nADD_CASES(TC_CSVOut,\n {{\".*BM_RepeatTimeUnit/repeats:3 \", MR_Not},\n {\"^\\\"BM_RepeatTimeUnit/repeats:3_mean\\\",%csv_us_report$\"},\n {\"^\\\"BM_RepeatTimeUnit/repeats:3_median\\\",%csv_us_report$\"},\n {\"^\\\"BM_RepeatTimeUnit/repeats:3_stddev\\\",%csv_us_report$\"}});\n\n// ========================================================================= //\n// -------------------- Testing user-provided statistics ------------------- //\n// ========================================================================= //\n\nconst auto UserStatistics = [](const std::vector& v) {\n return v.back();\n};\nvoid BM_UserStats(benchmark::State& state) {\n for (auto _ : state) {\n state.SetIterationTime(150 / 10e8);\n }\n}\n// clang-format off\nBENCHMARK(BM_UserStats)\n ->Repetitions(3)\n ->Iterations(5)\n ->UseManualTime()\n ->ComputeStatistics(\"\", UserStatistics);\n// clang-format on\n\n// check that user-provided stats is calculated, and is after the default-ones\n// empty string as name is intentional, it would sort before anything else\nADD_CASES(TC_ConsoleOut, {{\"^BM_UserStats/iterations:5/repeats:3/manual_time [ \"\n \"]* 150 ns %time [ ]*5$\"},\n {\"^BM_UserStats/iterations:5/repeats:3/manual_time [ \"\n \"]* 150 ns %time [ ]*5$\"},\n {\"^BM_UserStats/iterations:5/repeats:3/manual_time [ \"\n \"]* 150 ns %time [ ]*5$\"},\n {\"^BM_UserStats/iterations:5/repeats:3/\"\n \"manual_time_mean [ ]* 150 ns %time [ ]*3$\"},\n {\"^BM_UserStats/iterations:5/repeats:3/\"\n \"manual_time_median [ ]* 150 ns %time [ ]*3$\"},\n {\"^BM_UserStats/iterations:5/repeats:3/\"\n \"manual_time_stddev [ ]* 0.000 ns %time [ ]*3$\"},\n {\"^BM_UserStats/iterations:5/repeats:3/manual_time_ \"\n \"[ ]* 150 ns %time [ ]*3$\"}});\nADD_CASES(\n TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\"},\n {\"\\\"family_index\\\": 22,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": 5,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\"},\n {\"\\\"family_index\\\": 22,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": 5,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\"},\n {\"\\\"family_index\\\": 22,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": 5,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time_mean\\\",$\"},\n {\"\\\"family_index\\\": 22,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time_median\\\",$\"},\n {\"\\\"family_index\\\": 22,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time_stddev\\\",$\"},\n {\"\\\"family_index\\\": 22,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time_\\\",$\"},\n {\"\\\"family_index\\\": 22,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next}});\nADD_CASES(\n TC_CSVOut,\n {{\"^\\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",%csv_report$\"},\n {\"^\\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",%csv_report$\"},\n {\"^\\\"BM_UserStats/iterations:5/repeats:3/manual_time\\\",%csv_report$\"},\n {\"^\\\"BM_UserStats/iterations:5/repeats:3/manual_time_mean\\\",%csv_report$\"},\n {\"^\\\"BM_UserStats/iterations:5/repeats:3/\"\n \"manual_time_median\\\",%csv_report$\"},\n {\"^\\\"BM_UserStats/iterations:5/repeats:3/\"\n \"manual_time_stddev\\\",%csv_report$\"},\n {\"^\\\"BM_UserStats/iterations:5/repeats:3/manual_time_\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// ------------- Testing relative standard deviation statistics ------------ //\n// ========================================================================= //\n\nconst auto UserPercentStatistics = [](const std::vector&) {\n return 1. / 100.;\n};\nvoid BM_UserPercentStats(benchmark::State& state) {\n for (auto _ : state) {\n state.SetIterationTime(150 / 10e8);\n }\n}\n// clang-format off\nBENCHMARK(BM_UserPercentStats)\n ->Repetitions(3)\n ->Iterations(5)\n ->UseManualTime()\n ->Unit(benchmark::TimeUnit::kNanosecond)\n ->ComputeStatistics(\"\", UserPercentStatistics, benchmark::StatisticUnit::kPercentage);\n// clang-format on\n\n// check that UserPercent-provided stats is calculated, and is after the\n// default-ones empty string as name is intentional, it would sort before\n// anything else\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_UserPercentStats/iterations:5/repeats:3/manual_time [ \"\n \"]* 150 ns %time [ ]*5$\"},\n {\"^BM_UserPercentStats/iterations:5/repeats:3/manual_time [ \"\n \"]* 150 ns %time [ ]*5$\"},\n {\"^BM_UserPercentStats/iterations:5/repeats:3/manual_time [ \"\n \"]* 150 ns %time [ ]*5$\"},\n {\"^BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time_mean [ ]* 150 ns %time [ ]*3$\"},\n {\"^BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time_median [ ]* 150 ns %time [ ]*3$\"},\n {\"^BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time_stddev [ ]* 0.000 ns %time [ ]*3$\"},\n {\"^BM_UserPercentStats/iterations:5/repeats:3/manual_time_ \"\n \"[ ]* 1.00 % [ ]* 1.00 %[ ]*3$\"}});\nADD_CASES(\n TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\"},\n {\"\\\"family_index\\\": 23,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": 5,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\"},\n {\"\\\"family_index\\\": 23,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": 5,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\"},\n {\"\\\"family_index\\\": 23,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"repetition_index\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": 5,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time_mean\\\",$\"},\n {\"\\\"family_index\\\": 23,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time_median\\\",$\"},\n {\"\\\"family_index\\\": 23,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.5(0)*e\\\\+(0)*2,$\", MR_Next},\n {\"\\\"name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time_stddev\\\",$\"},\n {\"\\\"family_index\\\": 23,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time_\\\",$\"},\n {\"\\\"family_index\\\": 23,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \"\n \"\\\"BM_UserPercentStats/iterations:5/repeats:3/manual_time\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 3,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"percentage\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 3,$\", MR_Next},\n {\"\\\"real_time\\\": 1\\\\.(0)*e-(0)*2,$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time\\\",%csv_report$\"},\n {\"^\\\"BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time\\\",%csv_report$\"},\n {\"^\\\"BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time\\\",%csv_report$\"},\n {\"^\\\"BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time_mean\\\",%csv_report$\"},\n {\"^\\\"BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time_median\\\",%csv_report$\"},\n {\"^\\\"BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time_stddev\\\",%csv_report$\"},\n {\"^\\\"BM_UserPercentStats/iterations:5/repeats:3/\"\n \"manual_time_\\\",%csv_report$\"}});\n\n// ========================================================================= //\n// ------------------------- Testing StrEscape JSON ------------------------ //\n// ========================================================================= //\n#if 0 // enable when csv testing code correctly handles multi-line fields\nvoid BM_JSON_Format(benchmark::State& state) {\n state.SkipWithError(\"val\\b\\f\\n\\r\\t\\\\\\\"with\\\"es,capes\");\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_JSON_Format);\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_JSON_Format\\\",$\"},\n {\"\\\"family_index\\\": 23,$\", MR_Next},\n{\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_JSON_Format\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"error_occurred\\\": true,$\", MR_Next},\n {R\"(\"error_message\": \"val\\\\b\\\\f\\\\n\\\\r\\\\t\\\\\\\\\\\\\"with\\\\\"es,capes\",$)\", MR_Next}});\n#endif\n// ========================================================================= //\n// -------------------------- Testing CsvEscape ---------------------------- //\n// ========================================================================= //\n\nvoid BM_CSV_Format(benchmark::State& state) {\n state.SkipWithError(\"\\\"freedom\\\"\");\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_CSV_Format);\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_CSV_Format\\\",,,,,,,,true,\\\"\\\"\\\"freedom\\\"\\\"\\\"$\"}});\n\n// ========================================================================= //\n// --------------------------- TEST CASES END ------------------------------ //\n// ========================================================================= //\n\nint main(int argc, char* argv[]) { RunOutputTests(argc, argv); }\n" }, { "path": "3rd/benchmark-1.8.2/test/skip_with_error_test.cc", "content": "\n#undef NDEBUG\n#include \n#include \n\n#include \"../src/check.h\" // NOTE: check.h is for internal use only!\n#include \"benchmark/benchmark.h\"\n\nnamespace {\n\nclass TestReporter : public benchmark::ConsoleReporter {\n public:\n bool ReportContext(const Context& context) override {\n return ConsoleReporter::ReportContext(context);\n };\n\n void ReportRuns(const std::vector& report) override {\n all_runs_.insert(all_runs_.end(), begin(report), end(report));\n ConsoleReporter::ReportRuns(report);\n }\n\n TestReporter() {}\n ~TestReporter() override {}\n\n mutable std::vector all_runs_;\n};\n\nstruct TestCase {\n std::string name;\n bool error_occurred;\n std::string error_message;\n\n typedef benchmark::BenchmarkReporter::Run Run;\n\n void CheckRun(Run const& run) const {\n BM_CHECK(name == run.benchmark_name())\n << \"expected \" << name << \" got \" << run.benchmark_name();\n BM_CHECK_EQ(error_occurred,\n benchmark::internal::SkippedWithError == run.skipped);\n BM_CHECK(error_message == run.skip_message);\n if (error_occurred) {\n // BM_CHECK(run.iterations == 0);\n } else {\n BM_CHECK(run.iterations != 0);\n }\n }\n};\n\nstd::vector ExpectedResults;\n\nint AddCases(const std::string& base_name,\n std::initializer_list const& v) {\n for (auto TC : v) {\n TC.name = base_name + TC.name;\n ExpectedResults.push_back(std::move(TC));\n }\n return 0;\n}\n\n#define CONCAT(x, y) CONCAT2(x, y)\n#define CONCAT2(x, y) x##y\n#define ADD_CASES(...) int CONCAT(dummy, __LINE__) = AddCases(__VA_ARGS__)\n\n} // end namespace\n\nvoid BM_error_no_running(benchmark::State& state) {\n state.SkipWithError(\"error message\");\n}\nBENCHMARK(BM_error_no_running);\nADD_CASES(\"BM_error_no_running\", {{\"\", true, \"error message\"}});\n\nvoid BM_error_before_running(benchmark::State& state) {\n state.SkipWithError(\"error message\");\n while (state.KeepRunning()) {\n assert(false);\n }\n}\nBENCHMARK(BM_error_before_running);\nADD_CASES(\"BM_error_before_running\", {{\"\", true, \"error message\"}});\n\nvoid BM_error_before_running_batch(benchmark::State& state) {\n state.SkipWithError(\"error message\");\n while (state.KeepRunningBatch(17)) {\n assert(false);\n }\n}\nBENCHMARK(BM_error_before_running_batch);\nADD_CASES(\"BM_error_before_running_batch\", {{\"\", true, \"error message\"}});\n\nvoid BM_error_before_running_range_for(benchmark::State& state) {\n state.SkipWithError(\"error message\");\n for (auto _ : state) {\n assert(false);\n }\n}\nBENCHMARK(BM_error_before_running_range_for);\nADD_CASES(\"BM_error_before_running_range_for\", {{\"\", true, \"error message\"}});\n\nvoid BM_error_during_running(benchmark::State& state) {\n int first_iter = true;\n while (state.KeepRunning()) {\n if (state.range(0) == 1 && state.thread_index() <= (state.threads() / 2)) {\n assert(first_iter);\n first_iter = false;\n state.SkipWithError(\"error message\");\n } else {\n state.PauseTiming();\n state.ResumeTiming();\n }\n }\n}\nBENCHMARK(BM_error_during_running)->Arg(1)->Arg(2)->ThreadRange(1, 8);\nADD_CASES(\"BM_error_during_running\", {{\"/1/threads:1\", true, \"error message\"},\n {\"/1/threads:2\", true, \"error message\"},\n {\"/1/threads:4\", true, \"error message\"},\n {\"/1/threads:8\", true, \"error message\"},\n {\"/2/threads:1\", false, \"\"},\n {\"/2/threads:2\", false, \"\"},\n {\"/2/threads:4\", false, \"\"},\n {\"/2/threads:8\", false, \"\"}});\n\nvoid BM_error_during_running_ranged_for(benchmark::State& state) {\n assert(state.max_iterations > 3 && \"test requires at least a few iterations\");\n bool first_iter = true;\n // NOTE: Users should not write the for loop explicitly.\n for (auto It = state.begin(), End = state.end(); It != End; ++It) {\n if (state.range(0) == 1) {\n assert(first_iter);\n first_iter = false;\n (void)first_iter;\n state.SkipWithError(\"error message\");\n // Test the unfortunate but documented behavior that the ranged-for loop\n // doesn't automatically terminate when SkipWithError is set.\n assert(++It != End);\n break; // Required behavior\n }\n }\n}\nBENCHMARK(BM_error_during_running_ranged_for)->Arg(1)->Arg(2)->Iterations(5);\nADD_CASES(\"BM_error_during_running_ranged_for\",\n {{\"/1/iterations:5\", true, \"error message\"},\n {\"/2/iterations:5\", false, \"\"}});\n\nvoid BM_error_after_running(benchmark::State& state) {\n for (auto _ : state) {\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n if (state.thread_index() <= (state.threads() / 2))\n state.SkipWithError(\"error message\");\n}\nBENCHMARK(BM_error_after_running)->ThreadRange(1, 8);\nADD_CASES(\"BM_error_after_running\", {{\"/threads:1\", true, \"error message\"},\n {\"/threads:2\", true, \"error message\"},\n {\"/threads:4\", true, \"error message\"},\n {\"/threads:8\", true, \"error message\"}});\n\nvoid BM_error_while_paused(benchmark::State& state) {\n bool first_iter = true;\n while (state.KeepRunning()) {\n if (state.range(0) == 1 && state.thread_index() <= (state.threads() / 2)) {\n assert(first_iter);\n first_iter = false;\n state.PauseTiming();\n state.SkipWithError(\"error message\");\n } else {\n state.PauseTiming();\n state.ResumeTiming();\n }\n }\n}\nBENCHMARK(BM_error_while_paused)->Arg(1)->Arg(2)->ThreadRange(1, 8);\nADD_CASES(\"BM_error_while_paused\", {{\"/1/threads:1\", true, \"error message\"},\n {\"/1/threads:2\", true, \"error message\"},\n {\"/1/threads:4\", true, \"error message\"},\n {\"/1/threads:8\", true, \"error message\"},\n {\"/2/threads:1\", false, \"\"},\n {\"/2/threads:2\", false, \"\"},\n {\"/2/threads:4\", false, \"\"},\n {\"/2/threads:8\", false, \"\"}});\n\nint main(int argc, char* argv[]) {\n benchmark::Initialize(&argc, argv);\n\n TestReporter test_reporter;\n benchmark::RunSpecifiedBenchmarks(&test_reporter);\n\n typedef benchmark::BenchmarkReporter::Run Run;\n auto EB = ExpectedResults.begin();\n\n for (Run const& run : test_reporter.all_runs_) {\n assert(EB != ExpectedResults.end());\n EB->CheckRun(run);\n ++EB;\n }\n assert(EB == ExpectedResults.end());\n\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/spec_arg_test.cc", "content": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\n// Tests that we can override benchmark-spec value from FLAGS_benchmark_filter\n// with argument to RunSpecifiedBenchmarks(...).\n\nnamespace {\n\nclass TestReporter : public benchmark::ConsoleReporter {\n public:\n bool ReportContext(const Context& context) override {\n return ConsoleReporter::ReportContext(context);\n };\n\n void ReportRuns(const std::vector& report) override {\n assert(report.size() == 1);\n matched_functions.push_back(report[0].run_name.function_name);\n ConsoleReporter::ReportRuns(report);\n };\n\n TestReporter() {}\n\n ~TestReporter() override {}\n\n const std::vector& GetMatchedFunctions() const {\n return matched_functions;\n }\n\n private:\n std::vector matched_functions;\n};\n\n} // end namespace\n\nstatic void BM_NotChosen(benchmark::State& state) {\n assert(false && \"SHOULD NOT BE CALLED\");\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_NotChosen);\n\nstatic void BM_Chosen(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_Chosen);\n\nint main(int argc, char** argv) {\n const std::string flag = \"BM_NotChosen\";\n\n // Verify that argv specify --benchmark_filter=BM_NotChosen.\n bool found = false;\n for (int i = 0; i < argc; ++i) {\n if (strcmp(\"--benchmark_filter=BM_NotChosen\", argv[i]) == 0) {\n found = true;\n break;\n }\n }\n assert(found);\n\n benchmark::Initialize(&argc, argv);\n\n // Check that the current flag value is reported accurately via the\n // GetBenchmarkFilter() function.\n if (flag != benchmark::GetBenchmarkFilter()) {\n std::cerr\n << \"Seeing different value for flags. GetBenchmarkFilter() returns [\"\n << benchmark::GetBenchmarkFilter() << \"] expected flag=[\" << flag\n << \"]\\n\";\n return 1;\n }\n TestReporter test_reporter;\n const char* const spec = \"BM_Chosen\";\n const size_t returned_count =\n benchmark::RunSpecifiedBenchmarks(&test_reporter, spec);\n assert(returned_count == 1);\n const std::vector matched_functions =\n test_reporter.GetMatchedFunctions();\n assert(matched_functions.size() == 1);\n if (strcmp(spec, matched_functions.front().c_str()) != 0) {\n std::cerr << \"Expected benchmark [\" << spec << \"] to run, but got [\"\n << matched_functions.front() << \"]\\n\";\n return 2;\n }\n\n // Test that SetBenchmarkFilter works.\n const std::string golden_value = \"golden_value\";\n benchmark::SetBenchmarkFilter(golden_value);\n std::string current_value = benchmark::GetBenchmarkFilter();\n if (golden_value != current_value) {\n std::cerr << \"Expected [\" << golden_value\n << \"] for --benchmark_filter but got [\" << current_value << \"]\\n\";\n return 3;\n }\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/spec_arg_verbosity_test.cc", "content": "#include \n\n#include \n\n#include \"benchmark/benchmark.h\"\n\n// Tests that the user specified verbosity level can be get.\nstatic void BM_Verbosity(benchmark::State& state) {\n for (auto _ : state) {\n }\n}\nBENCHMARK(BM_Verbosity);\n\nint main(int argc, char** argv) {\n const int32_t flagv = 42;\n\n // Verify that argv specify --v=42.\n bool found = false;\n for (int i = 0; i < argc; ++i) {\n if (strcmp(\"--v=42\", argv[i]) == 0) {\n found = true;\n break;\n }\n }\n if (!found) {\n std::cerr << \"This test requires '--v=42' to be passed as a command-line \"\n << \"argument.\\n\";\n return 1;\n }\n\n benchmark::Initialize(&argc, argv);\n\n // Check that the current flag value is reported accurately via the\n // GetBenchmarkVerbosity() function.\n if (flagv != benchmark::GetBenchmarkVerbosity()) {\n std::cerr\n << \"Seeing different value for flags. GetBenchmarkVerbosity() returns [\"\n << benchmark::GetBenchmarkVerbosity() << \"] expected flag=[\" << flagv\n << \"]\\n\";\n return 1;\n }\n return 0;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/state_assembly_test.cc", "content": "#include \n\n#ifdef __clang__\n#pragma clang diagnostic ignored \"-Wreturn-type\"\n#endif\n\n// clang-format off\nextern \"C\" {\n extern int ExternInt;\n benchmark::State& GetState();\n void Fn();\n}\n// clang-format on\n\nusing benchmark::State;\n\n// CHECK-LABEL: test_for_auto_loop:\nextern \"C\" int test_for_auto_loop() {\n State& S = GetState();\n int x = 42;\n // CHECK: \t[[CALL:call(q)*]]\t_ZN9benchmark5State16StartKeepRunningEv\n // CHECK-NEXT: testq %rbx, %rbx\n // CHECK-NEXT: je [[LOOP_END:.*]]\n\n for (auto _ : S) {\n // CHECK: .L[[LOOP_HEAD:[a-zA-Z0-9_]+]]:\n // CHECK-GNU-NEXT: subq $1, %rbx\n // CHECK-CLANG-NEXT: {{(addq \\$1, %rax|incq %rax|addq \\$-1, %rbx)}}\n // CHECK-NEXT: jne .L[[LOOP_HEAD]]\n benchmark::DoNotOptimize(x);\n }\n // CHECK: [[LOOP_END]]:\n // CHECK: [[CALL]]\t_ZN9benchmark5State17FinishKeepRunningEv\n\n // CHECK: movl $101, %eax\n // CHECK: ret\n return 101;\n}\n\n// CHECK-LABEL: test_while_loop:\nextern \"C\" int test_while_loop() {\n State& S = GetState();\n int x = 42;\n\n // CHECK: j{{(e|mp)}} .L[[LOOP_HEADER:[a-zA-Z0-9_]+]]\n // CHECK-NEXT: .L[[LOOP_BODY:[a-zA-Z0-9_]+]]:\n while (S.KeepRunning()) {\n // CHECK-GNU-NEXT: subq $1, %[[IREG:[a-z]+]]\n // CHECK-CLANG-NEXT: {{(addq \\$-1,|decq)}} %[[IREG:[a-z]+]]\n // CHECK: movq %[[IREG]], [[DEST:.*]]\n benchmark::DoNotOptimize(x);\n }\n // CHECK-DAG: movq [[DEST]], %[[IREG]]\n // CHECK-DAG: testq %[[IREG]], %[[IREG]]\n // CHECK-DAG: jne .L[[LOOP_BODY]]\n // CHECK-DAG: .L[[LOOP_HEADER]]:\n\n // CHECK: cmpb $0\n // CHECK-NEXT: jne .L[[LOOP_END:[a-zA-Z0-9_]+]]\n // CHECK: [[CALL:call(q)*]] _ZN9benchmark5State16StartKeepRunningEv\n\n // CHECK: .L[[LOOP_END]]:\n // CHECK: [[CALL]] _ZN9benchmark5State17FinishKeepRunningEv\n\n // CHECK: movl $101, %eax\n // CHECK: ret\n return 101;\n}\n" }, { "path": "3rd/benchmark-1.8.2/test/statistics_gtest.cc", "content": "//===---------------------------------------------------------------------===//\n// statistics_test - Unit tests for src/statistics.cc\n//===---------------------------------------------------------------------===//\n\n#include \"../src/statistics.h\"\n#include \"gtest/gtest.h\"\n\nnamespace {\nTEST(StatisticsTest, Mean) {\n EXPECT_DOUBLE_EQ(benchmark::StatisticsMean({42, 42, 42, 42}), 42.0);\n EXPECT_DOUBLE_EQ(benchmark::StatisticsMean({1, 2, 3, 4}), 2.5);\n EXPECT_DOUBLE_EQ(benchmark::StatisticsMean({1, 2, 5, 10, 10, 14}), 7.0);\n}\n\nTEST(StatisticsTest, Median) {\n EXPECT_DOUBLE_EQ(benchmark::StatisticsMedian({42, 42, 42, 42}), 42.0);\n EXPECT_DOUBLE_EQ(benchmark::StatisticsMedian({1, 2, 3, 4}), 2.5);\n EXPECT_DOUBLE_EQ(benchmark::StatisticsMedian({1, 2, 5, 10, 10}), 5.0);\n}\n\nTEST(StatisticsTest, StdDev) {\n EXPECT_DOUBLE_EQ(benchmark::StatisticsStdDev({101, 101, 101, 101}), 0.0);\n EXPECT_DOUBLE_EQ(benchmark::StatisticsStdDev({1, 2, 3}), 1.0);\n EXPECT_DOUBLE_EQ(benchmark::StatisticsStdDev({2.5, 2.4, 3.3, 4.2, 5.1}),\n 1.151086443322134);\n}\n\nTEST(StatisticsTest, CV) {\n EXPECT_DOUBLE_EQ(benchmark::StatisticsCV({101, 101, 101, 101}), 0.0);\n EXPECT_DOUBLE_EQ(benchmark::StatisticsCV({1, 2, 3}), 1. / 2.);\n EXPECT_DOUBLE_EQ(benchmark::StatisticsCV({2.5, 2.4, 3.3, 4.2, 5.1}),\n 0.32888184094918121);\n}\n\n} // end namespace\n" }, { "path": "3rd/benchmark-1.8.2/test/string_util_gtest.cc", "content": "//===---------------------------------------------------------------------===//\n// statistics_test - Unit tests for src/statistics.cc\n//===---------------------------------------------------------------------===//\n\n#include \n\n#include \"../src/internal_macros.h\"\n#include \"../src/string_util.h\"\n#include \"gtest/gtest.h\"\n\nnamespace {\nTEST(StringUtilTest, stoul) {\n {\n size_t pos = 0;\n EXPECT_EQ(0ul, benchmark::stoul(\"0\", &pos));\n EXPECT_EQ(1ul, pos);\n }\n {\n size_t pos = 0;\n EXPECT_EQ(7ul, benchmark::stoul(\"7\", &pos));\n EXPECT_EQ(1ul, pos);\n }\n {\n size_t pos = 0;\n EXPECT_EQ(135ul, benchmark::stoul(\"135\", &pos));\n EXPECT_EQ(3ul, pos);\n }\n#if ULONG_MAX == 0xFFFFFFFFul\n {\n size_t pos = 0;\n EXPECT_EQ(0xFFFFFFFFul, benchmark::stoul(\"4294967295\", &pos));\n EXPECT_EQ(10ul, pos);\n }\n#elif ULONG_MAX == 0xFFFFFFFFFFFFFFFFul\n {\n size_t pos = 0;\n EXPECT_EQ(0xFFFFFFFFFFFFFFFFul,\n benchmark::stoul(\"18446744073709551615\", &pos));\n EXPECT_EQ(20ul, pos);\n }\n#endif\n {\n size_t pos = 0;\n EXPECT_EQ(10ul, benchmark::stoul(\"1010\", &pos, 2));\n EXPECT_EQ(4ul, pos);\n }\n {\n size_t pos = 0;\n EXPECT_EQ(520ul, benchmark::stoul(\"1010\", &pos, 8));\n EXPECT_EQ(4ul, pos);\n }\n {\n size_t pos = 0;\n EXPECT_EQ(1010ul, benchmark::stoul(\"1010\", &pos, 10));\n EXPECT_EQ(4ul, pos);\n }\n {\n size_t pos = 0;\n EXPECT_EQ(4112ul, benchmark::stoul(\"1010\", &pos, 16));\n EXPECT_EQ(4ul, pos);\n }\n {\n size_t pos = 0;\n EXPECT_EQ(0xBEEFul, benchmark::stoul(\"BEEF\", &pos, 16));\n EXPECT_EQ(4ul, pos);\n }\n#ifndef BENCHMARK_HAS_NO_EXCEPTIONS\n {\n ASSERT_THROW(std::ignore = benchmark::stoul(\"this is a test\"),\n std::invalid_argument);\n }\n#endif\n}\n\nTEST(StringUtilTest, stoi){{size_t pos = 0;\nEXPECT_EQ(0, benchmark::stoi(\"0\", &pos));\nEXPECT_EQ(1ul, pos);\n} // namespace\n{\n size_t pos = 0;\n EXPECT_EQ(-17, benchmark::stoi(\"-17\", &pos));\n EXPECT_EQ(3ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(1357, benchmark::stoi(\"1357\", &pos));\n EXPECT_EQ(4ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(10, benchmark::stoi(\"1010\", &pos, 2));\n EXPECT_EQ(4ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(520, benchmark::stoi(\"1010\", &pos, 8));\n EXPECT_EQ(4ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(1010, benchmark::stoi(\"1010\", &pos, 10));\n EXPECT_EQ(4ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(4112, benchmark::stoi(\"1010\", &pos, 16));\n EXPECT_EQ(4ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(0xBEEF, benchmark::stoi(\"BEEF\", &pos, 16));\n EXPECT_EQ(4ul, pos);\n}\n#ifndef BENCHMARK_HAS_NO_EXCEPTIONS\n{\n ASSERT_THROW(std::ignore = benchmark::stoi(\"this is a test\"),\n std::invalid_argument);\n}\n#endif\n}\n\nTEST(StringUtilTest, stod){{size_t pos = 0;\nEXPECT_EQ(0.0, benchmark::stod(\"0\", &pos));\nEXPECT_EQ(1ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(-84.0, benchmark::stod(\"-84\", &pos));\n EXPECT_EQ(3ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(1234.0, benchmark::stod(\"1234\", &pos));\n EXPECT_EQ(4ul, pos);\n}\n{\n size_t pos = 0;\n EXPECT_EQ(1.5, benchmark::stod(\"1.5\", &pos));\n EXPECT_EQ(3ul, pos);\n}\n{\n size_t pos = 0;\n /* Note: exactly representable as double */\n EXPECT_EQ(-1.25e+9, benchmark::stod(\"-1.25e+9\", &pos));\n EXPECT_EQ(8ul, pos);\n}\n#ifndef BENCHMARK_HAS_NO_EXCEPTIONS\n{\n ASSERT_THROW(std::ignore = benchmark::stod(\"this is a test\"),\n std::invalid_argument);\n}\n#endif\n}\n\nTEST(StringUtilTest, StrSplit) {\n EXPECT_EQ(benchmark::StrSplit(\"\", ','), std::vector{});\n EXPECT_EQ(benchmark::StrSplit(\"hello\", ','),\n std::vector({\"hello\"}));\n EXPECT_EQ(benchmark::StrSplit(\"hello,there,is,more\", ','),\n std::vector({\"hello\", \"there\", \"is\", \"more\"}));\n}\n\n} // end namespace\n" }, { "path": "3rd/benchmark-1.8.2/test/templated_fixture_test.cc", "content": "\n#include \n#include \n\n#include \"benchmark/benchmark.h\"\n\ntemplate \nclass MyFixture : public ::benchmark::Fixture {\n public:\n MyFixture() : data(0) {}\n\n T data;\n};\n\nBENCHMARK_TEMPLATE_F(MyFixture, Foo, int)(benchmark::State& st) {\n for (auto _ : st) {\n data += 1;\n }\n}\n\nBENCHMARK_TEMPLATE_DEFINE_F(MyFixture, Bar, double)(benchmark::State& st) {\n for (auto _ : st) {\n data += 1.0;\n }\n}\nBENCHMARK_REGISTER_F(MyFixture, Bar);\n\nBENCHMARK_MAIN();\n" }, { "path": "3rd/benchmark-1.8.2/test/time_unit_gtest.cc", "content": "#include \"../include/benchmark/benchmark.h\"\n#include \"gtest/gtest.h\"\n\nnamespace benchmark {\nnamespace internal {\n\nnamespace {\n\nclass DummyBenchmark : public Benchmark {\n public:\n DummyBenchmark() : Benchmark(\"dummy\") {}\n void Run(State&) override {}\n};\n\nTEST(DefaultTimeUnitTest, TimeUnitIsNotSet) {\n DummyBenchmark benchmark;\n EXPECT_EQ(benchmark.GetTimeUnit(), kNanosecond);\n}\n\nTEST(DefaultTimeUnitTest, DefaultIsSet) {\n DummyBenchmark benchmark;\n EXPECT_EQ(benchmark.GetTimeUnit(), kNanosecond);\n SetDefaultTimeUnit(kMillisecond);\n EXPECT_EQ(benchmark.GetTimeUnit(), kMillisecond);\n}\n\nTEST(DefaultTimeUnitTest, DefaultAndExplicitUnitIsSet) {\n DummyBenchmark benchmark;\n benchmark.Unit(kMillisecond);\n SetDefaultTimeUnit(kMicrosecond);\n\n EXPECT_EQ(benchmark.GetTimeUnit(), kMillisecond);\n}\n\n} // namespace\n} // namespace internal\n} // namespace benchmark\n" }, { "path": "3rd/benchmark-1.8.2/test/user_counters_tabular_test.cc", "content": "\n#undef NDEBUG\n\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\n// @todo: this checks the full output at once; the rule for\n// CounterSet1 was failing because it was not matching \"^[-]+$\".\n// @todo: check that the counters are vertically aligned.\nADD_CASES(TC_ConsoleOut,\n {\n // keeping these lines long improves readability, so:\n // clang-format off\n {\"^[-]+$\", MR_Next},\n {\"^Benchmark %s Time %s CPU %s Iterations %s Bar %s Bat %s Baz %s Foo %s Frob %s Lob$\", MR_Next},\n {\"^[-]+$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:1 %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:1 %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:1_mean %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:1_median %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:1_stddev %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:1_cv %console_percentage_report [ ]*%percentage[ ]*% [ ]*%percentage[ ]*% [ ]*%percentage[ ]*% [ ]*%percentage[ ]*% [ ]*%percentage[ ]*% [ ]*%percentage[ ]*%$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:2 %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:2 %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:2_mean %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:2_median %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:2_stddev %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_Counters_Tabular/repeats:2/threads:2_cv %console_percentage_report [ ]*%percentage[ ]*% [ ]*%percentage[ ]*% [ ]*%percentage[ ]*% [ ]*%percentage[ ]*% [ ]*%percentage[ ]*% [ ]*%percentage[ ]*%$\", MR_Next},\n {\"^BM_CounterRates_Tabular/threads:%int %console_report [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s$\", MR_Next},\n {\"^BM_CounterRates_Tabular/threads:%int %console_report [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s$\", MR_Next},\n {\"^BM_CounterRates_Tabular/threads:%int %console_report [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s$\", MR_Next},\n {\"^BM_CounterRates_Tabular/threads:%int %console_report [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s$\", MR_Next},\n {\"^BM_CounterRates_Tabular/threads:%int %console_report [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s [ ]*%hrfloat/s$\", MR_Next},\n {\"^[-]+$\", MR_Next},\n {\"^Benchmark %s Time %s CPU %s Iterations %s Bar %s Baz %s Foo$\", MR_Next},\n {\"^[-]+$\", MR_Next},\n {\"^BM_CounterSet0_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet0_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet0_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet0_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet0_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet1_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet1_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet1_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet1_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet1_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^[-]+$\", MR_Next},\n {\"^Benchmark %s Time %s CPU %s Iterations %s Bat %s Baz %s Foo$\", MR_Next},\n {\"^[-]+$\", MR_Next},\n {\"^BM_CounterSet2_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet2_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet2_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet2_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\", MR_Next},\n {\"^BM_CounterSet2_Tabular/threads:%int %console_report [ ]*%hrfloat [ ]*%hrfloat [ ]*%hrfloat$\"},\n // clang-format on\n });\nADD_CASES(TC_CSVOut, {{\"%csv_header,\"\n \"\\\"Bar\\\",\\\"Bat\\\",\\\"Baz\\\",\\\"Foo\\\",\\\"Frob\\\",\\\"Lob\\\"\"}});\n\n// ========================================================================= //\n// ------------------------- Tabular Counters Output ----------------------- //\n// ========================================================================= //\n\nvoid BM_Counters_Tabular(benchmark::State& state) {\n for (auto _ : state) {\n }\n namespace bm = benchmark;\n state.counters.insert({\n {\"Foo\", {1, bm::Counter::kAvgThreads}},\n {\"Bar\", {2, bm::Counter::kAvgThreads}},\n {\"Baz\", {4, bm::Counter::kAvgThreads}},\n {\"Bat\", {8, bm::Counter::kAvgThreads}},\n {\"Frob\", {16, bm::Counter::kAvgThreads}},\n {\"Lob\", {32, bm::Counter::kAvgThreads}},\n });\n}\nBENCHMARK(BM_Counters_Tabular)->ThreadRange(1, 2)->Repetitions(2);\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1_mean\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1_median\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1_stddev\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1_cv\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:1\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"cv\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"percentage\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\n\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 1,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 2,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 1,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 2,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2_median\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 1,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 2,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2_stddev\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 1,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 2,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2_cv\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 1,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Tabular/repeats:2/threads:2\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 2,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"cv\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"percentage\\\",$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:1\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:1\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:1_mean\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:1_median\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:1_stddev\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:1_cv\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:2\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:2\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:2_mean\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:2_median\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:2_stddev\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_Tabular/repeats:2/threads:2_cv\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckTabular(Results const& e) {\n CHECK_COUNTER_VALUE(e, int, \"Foo\", EQ, 1);\n CHECK_COUNTER_VALUE(e, int, \"Bar\", EQ, 2);\n CHECK_COUNTER_VALUE(e, int, \"Baz\", EQ, 4);\n CHECK_COUNTER_VALUE(e, int, \"Bat\", EQ, 8);\n CHECK_COUNTER_VALUE(e, int, \"Frob\", EQ, 16);\n CHECK_COUNTER_VALUE(e, int, \"Lob\", EQ, 32);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_Tabular/repeats:2/threads:1$\",\n &CheckTabular);\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_Tabular/repeats:2/threads:2$\",\n &CheckTabular);\n\n// ========================================================================= //\n// -------------------- Tabular+Rate Counters Output ----------------------- //\n// ========================================================================= //\n\nvoid BM_CounterRates_Tabular(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n namespace bm = benchmark;\n state.counters.insert({\n {\"Foo\", {1, bm::Counter::kAvgThreadsRate}},\n {\"Bar\", {2, bm::Counter::kAvgThreadsRate}},\n {\"Baz\", {4, bm::Counter::kAvgThreadsRate}},\n {\"Bat\", {8, bm::Counter::kAvgThreadsRate}},\n {\"Frob\", {16, bm::Counter::kAvgThreadsRate}},\n {\"Lob\", {32, bm::Counter::kAvgThreadsRate}},\n });\n}\nBENCHMARK(BM_CounterRates_Tabular)->ThreadRange(1, 16);\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_CounterRates_Tabular/threads:%int\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_CounterRates_Tabular/threads:%int\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float,$\", MR_Next},\n {\"\\\"Frob\\\": %float,$\", MR_Next},\n {\"\\\"Lob\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_CounterRates_Tabular/threads:%int\\\",%csv_report,\"\n \"%float,%float,%float,%float,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckTabularRate(Results const& e) {\n double t = e.DurationCPUTime();\n CHECK_FLOAT_COUNTER_VALUE(e, \"Foo\", EQ, 1. / t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"Bar\", EQ, 2. / t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"Baz\", EQ, 4. / t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"Bat\", EQ, 8. / t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"Frob\", EQ, 16. / t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"Lob\", EQ, 32. / t, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_CounterRates_Tabular/threads:%int\",\n &CheckTabularRate);\n\n// ========================================================================= //\n// ------------------------- Tabular Counters Output ----------------------- //\n// ========================================================================= //\n\n// set only some of the counters\nvoid BM_CounterSet0_Tabular(benchmark::State& state) {\n for (auto _ : state) {\n }\n namespace bm = benchmark;\n state.counters.insert({\n {\"Foo\", {10, bm::Counter::kAvgThreads}},\n {\"Bar\", {20, bm::Counter::kAvgThreads}},\n {\"Baz\", {40, bm::Counter::kAvgThreads}},\n });\n}\nBENCHMARK(BM_CounterSet0_Tabular)->ThreadRange(1, 16);\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_CounterSet0_Tabular/threads:%int\\\",$\"},\n {\"\\\"family_index\\\": 2,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_CounterSet0_Tabular/threads:%int\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_CounterSet0_Tabular/threads:%int\\\",%csv_report,\"\n \"%float,,%float,%float,,\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckSet0(Results const& e) {\n CHECK_COUNTER_VALUE(e, int, \"Foo\", EQ, 10);\n CHECK_COUNTER_VALUE(e, int, \"Bar\", EQ, 20);\n CHECK_COUNTER_VALUE(e, int, \"Baz\", EQ, 40);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_CounterSet0_Tabular\", &CheckSet0);\n\n// again.\nvoid BM_CounterSet1_Tabular(benchmark::State& state) {\n for (auto _ : state) {\n }\n namespace bm = benchmark;\n state.counters.insert({\n {\"Foo\", {15, bm::Counter::kAvgThreads}},\n {\"Bar\", {25, bm::Counter::kAvgThreads}},\n {\"Baz\", {45, bm::Counter::kAvgThreads}},\n });\n}\nBENCHMARK(BM_CounterSet1_Tabular)->ThreadRange(1, 16);\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_CounterSet1_Tabular/threads:%int\\\",$\"},\n {\"\\\"family_index\\\": 3,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_CounterSet1_Tabular/threads:%int\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bar\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_CounterSet1_Tabular/threads:%int\\\",%csv_report,\"\n \"%float,,%float,%float,,\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckSet1(Results const& e) {\n CHECK_COUNTER_VALUE(e, int, \"Foo\", EQ, 15);\n CHECK_COUNTER_VALUE(e, int, \"Bar\", EQ, 25);\n CHECK_COUNTER_VALUE(e, int, \"Baz\", EQ, 45);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_CounterSet1_Tabular/threads:%int\", &CheckSet1);\n\n// ========================================================================= //\n// ------------------------- Tabular Counters Output ----------------------- //\n// ========================================================================= //\n\n// set only some of the counters, different set now.\nvoid BM_CounterSet2_Tabular(benchmark::State& state) {\n for (auto _ : state) {\n }\n namespace bm = benchmark;\n state.counters.insert({\n {\"Foo\", {10, bm::Counter::kAvgThreads}},\n {\"Bat\", {30, bm::Counter::kAvgThreads}},\n {\"Baz\", {40, bm::Counter::kAvgThreads}},\n });\n}\nBENCHMARK(BM_CounterSet2_Tabular)->ThreadRange(1, 16);\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_CounterSet2_Tabular/threads:%int\\\",$\"},\n {\"\\\"family_index\\\": 4,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_CounterSet2_Tabular/threads:%int\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"Bat\\\": %float,$\", MR_Next},\n {\"\\\"Baz\\\": %float,$\", MR_Next},\n {\"\\\"Foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_CounterSet2_Tabular/threads:%int\\\",%csv_report,\"\n \",%float,%float,%float,,\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckSet2(Results const& e) {\n CHECK_COUNTER_VALUE(e, int, \"Foo\", EQ, 10);\n CHECK_COUNTER_VALUE(e, int, \"Bat\", EQ, 30);\n CHECK_COUNTER_VALUE(e, int, \"Baz\", EQ, 40);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_CounterSet2_Tabular\", &CheckSet2);\n\n// ========================================================================= //\n// --------------------------- TEST CASES END ------------------------------ //\n// ========================================================================= //\n\nint main(int argc, char* argv[]) { RunOutputTests(argc, argv); }\n" }, { "path": "3rd/benchmark-1.8.2/test/user_counters_test.cc", "content": "\n#undef NDEBUG\n\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\n// ========================================================================= //\n// ---------------------- Testing Prologue Output -------------------------- //\n// ========================================================================= //\n\n// clang-format off\n\nADD_CASES(TC_ConsoleOut,\n {{\"^[-]+$\", MR_Next},\n {\"^Benchmark %s Time %s CPU %s Iterations UserCounters...$\", MR_Next},\n {\"^[-]+$\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"%csv_header,\\\"bar\\\",\\\"foo\\\"\"}});\n\n// clang-format on\n\n// ========================================================================= //\n// ------------------------- Simple Counters Output ------------------------ //\n// ========================================================================= //\n\nvoid BM_Counters_Simple(benchmark::State& state) {\n for (auto _ : state) {\n }\n state.counters[\"foo\"] = 1;\n state.counters[\"bar\"] = 2 * static_cast(state.iterations());\n}\nBENCHMARK(BM_Counters_Simple);\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_Counters_Simple %console_report bar=%hrfloat foo=%hrfloat$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_Counters_Simple\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Simple\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Counters_Simple\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckSimple(Results const& e) {\n double its = e.NumIterations();\n CHECK_COUNTER_VALUE(e, int, \"foo\", EQ, 1);\n // check that the value of bar is within 0.1% of the expected value\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, 2. * its, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_Simple\", &CheckSimple);\n\n// ========================================================================= //\n// --------------------- Counters+Items+Bytes/s Output --------------------- //\n// ========================================================================= //\n\nnamespace {\nint num_calls1 = 0;\n}\nvoid BM_Counters_WithBytesAndItemsPSec(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n state.counters[\"foo\"] = 1;\n state.counters[\"bar\"] = ++num_calls1;\n state.SetBytesProcessed(364);\n state.SetItemsProcessed(150);\n}\nBENCHMARK(BM_Counters_WithBytesAndItemsPSec);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_WithBytesAndItemsPSec %console_report \"\n \"bar=%hrfloat bytes_per_second=%hrfloat/s \"\n \"foo=%hrfloat items_per_second=%hrfloat/s$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_WithBytesAndItemsPSec\\\",$\"},\n {\"\\\"family_index\\\": 1,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_WithBytesAndItemsPSec\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"bytes_per_second\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float,$\", MR_Next},\n {\"\\\"items_per_second\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Counters_WithBytesAndItemsPSec\\\",\"\n \"%csv_bytes_items_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckBytesAndItemsPSec(Results const& e) {\n double t = e.DurationCPUTime(); // this (and not real time) is the time used\n CHECK_COUNTER_VALUE(e, int, \"foo\", EQ, 1);\n CHECK_COUNTER_VALUE(e, int, \"bar\", EQ, num_calls1);\n // check that the values are within 0.1% of the expected values\n CHECK_FLOAT_RESULT_VALUE(e, \"bytes_per_second\", EQ, 364. / t, 0.001);\n CHECK_FLOAT_RESULT_VALUE(e, \"items_per_second\", EQ, 150. / t, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_WithBytesAndItemsPSec\",\n &CheckBytesAndItemsPSec);\n\n// ========================================================================= //\n// ------------------------- Rate Counters Output -------------------------- //\n// ========================================================================= //\n\nvoid BM_Counters_Rate(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] = bm::Counter{1, bm::Counter::kIsRate};\n state.counters[\"bar\"] = bm::Counter{2, bm::Counter::kIsRate};\n}\nBENCHMARK(BM_Counters_Rate);\nADD_CASES(\n TC_ConsoleOut,\n {{\"^BM_Counters_Rate %console_report bar=%hrfloat/s foo=%hrfloat/s$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_Counters_Rate\\\",$\"},\n {\"\\\"family_index\\\": 2,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Rate\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Counters_Rate\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckRate(Results const& e) {\n double t = e.DurationCPUTime(); // this (and not real time) is the time used\n // check that the values are within 0.1% of the expected values\n CHECK_FLOAT_COUNTER_VALUE(e, \"foo\", EQ, 1. / t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, 2. / t, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_Rate\", &CheckRate);\n\n// ========================================================================= //\n// ----------------------- Inverted Counters Output ------------------------ //\n// ========================================================================= //\n\nvoid BM_Invert(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] = bm::Counter{0.0001, bm::Counter::kInvert};\n state.counters[\"bar\"] = bm::Counter{10000, bm::Counter::kInvert};\n}\nBENCHMARK(BM_Invert);\nADD_CASES(TC_ConsoleOut,\n {{\"^BM_Invert %console_report bar=%hrfloatu foo=%hrfloatk$\"}});\nADD_CASES(TC_JSONOut, {{\"\\\"name\\\": \\\"BM_Invert\\\",$\"},\n {\"\\\"family_index\\\": 3,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Invert\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Invert\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckInvert(Results const& e) {\n CHECK_FLOAT_COUNTER_VALUE(e, \"foo\", EQ, 10000, 0.0001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, 0.0001, 0.0001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Invert\", &CheckInvert);\n\n// ========================================================================= //\n// --------------------- InvertedRate Counters Output ---------------------- //\n// ========================================================================= //\n\nvoid BM_Counters_InvertedRate(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] =\n bm::Counter{1, bm::Counter::kIsRate | bm::Counter::kInvert};\n state.counters[\"bar\"] =\n bm::Counter{8192, bm::Counter::kIsRate | bm::Counter::kInvert};\n}\nBENCHMARK(BM_Counters_InvertedRate);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_InvertedRate %console_report \"\n \"bar=%hrfloats foo=%hrfloats$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_InvertedRate\\\",$\"},\n {\"\\\"family_index\\\": 4,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_InvertedRate\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_InvertedRate\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckInvertedRate(Results const& e) {\n double t = e.DurationCPUTime(); // this (and not real time) is the time used\n // check that the values are within 0.1% of the expected values\n CHECK_FLOAT_COUNTER_VALUE(e, \"foo\", EQ, t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, t / 8192.0, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_InvertedRate\", &CheckInvertedRate);\n\n// ========================================================================= //\n// ------------------------- Thread Counters Output ------------------------ //\n// ========================================================================= //\n\nvoid BM_Counters_Threads(benchmark::State& state) {\n for (auto _ : state) {\n }\n state.counters[\"foo\"] = 1;\n state.counters[\"bar\"] = 2;\n}\nBENCHMARK(BM_Counters_Threads)->ThreadRange(1, 8);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_Threads/threads:%int %console_report \"\n \"bar=%hrfloat foo=%hrfloat$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Threads/threads:%int\\\",$\"},\n {\"\\\"family_index\\\": 5,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Threads/threads:%int\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(\n TC_CSVOut,\n {{\"^\\\"BM_Counters_Threads/threads:%int\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckThreads(Results const& e) {\n CHECK_COUNTER_VALUE(e, int, \"foo\", EQ, e.NumThreads());\n CHECK_COUNTER_VALUE(e, int, \"bar\", EQ, 2 * e.NumThreads());\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_Threads/threads:%int\", &CheckThreads);\n\n// ========================================================================= //\n// ---------------------- ThreadAvg Counters Output ------------------------ //\n// ========================================================================= //\n\nvoid BM_Counters_AvgThreads(benchmark::State& state) {\n for (auto _ : state) {\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] = bm::Counter{1, bm::Counter::kAvgThreads};\n state.counters[\"bar\"] = bm::Counter{2, bm::Counter::kAvgThreads};\n}\nBENCHMARK(BM_Counters_AvgThreads)->ThreadRange(1, 8);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_AvgThreads/threads:%int \"\n \"%console_report bar=%hrfloat foo=%hrfloat$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_AvgThreads/threads:%int\\\",$\"},\n {\"\\\"family_index\\\": 6,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_AvgThreads/threads:%int\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(\n TC_CSVOut,\n {{\"^\\\"BM_Counters_AvgThreads/threads:%int\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckAvgThreads(Results const& e) {\n CHECK_COUNTER_VALUE(e, int, \"foo\", EQ, 1);\n CHECK_COUNTER_VALUE(e, int, \"bar\", EQ, 2);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_AvgThreads/threads:%int\",\n &CheckAvgThreads);\n\n// ========================================================================= //\n// ---------------------- ThreadAvg Counters Output ------------------------ //\n// ========================================================================= //\n\nvoid BM_Counters_AvgThreadsRate(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] = bm::Counter{1, bm::Counter::kAvgThreadsRate};\n state.counters[\"bar\"] = bm::Counter{2, bm::Counter::kAvgThreadsRate};\n}\nBENCHMARK(BM_Counters_AvgThreadsRate)->ThreadRange(1, 8);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_AvgThreadsRate/threads:%int \"\n \"%console_report bar=%hrfloat/s foo=%hrfloat/s$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_AvgThreadsRate/threads:%int\\\",$\"},\n {\"\\\"family_index\\\": 7,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_AvgThreadsRate/threads:%int\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Counters_AvgThreadsRate/\"\n \"threads:%int\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckAvgThreadsRate(Results const& e) {\n CHECK_FLOAT_COUNTER_VALUE(e, \"foo\", EQ, 1. / e.DurationCPUTime(), 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, 2. / e.DurationCPUTime(), 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_AvgThreadsRate/threads:%int\",\n &CheckAvgThreadsRate);\n\n// ========================================================================= //\n// ------------------- IterationInvariant Counters Output ------------------ //\n// ========================================================================= //\n\nvoid BM_Counters_IterationInvariant(benchmark::State& state) {\n for (auto _ : state) {\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] = bm::Counter{1, bm::Counter::kIsIterationInvariant};\n state.counters[\"bar\"] = bm::Counter{2, bm::Counter::kIsIterationInvariant};\n}\nBENCHMARK(BM_Counters_IterationInvariant);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_IterationInvariant %console_report \"\n \"bar=%hrfloat foo=%hrfloat$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_IterationInvariant\\\",$\"},\n {\"\\\"family_index\\\": 8,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_IterationInvariant\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_IterationInvariant\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckIterationInvariant(Results const& e) {\n double its = e.NumIterations();\n // check that the values are within 0.1% of the expected value\n CHECK_FLOAT_COUNTER_VALUE(e, \"foo\", EQ, its, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, 2. * its, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_IterationInvariant\",\n &CheckIterationInvariant);\n\n// ========================================================================= //\n// ----------------- IterationInvariantRate Counters Output ---------------- //\n// ========================================================================= //\n\nvoid BM_Counters_kIsIterationInvariantRate(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] =\n bm::Counter{1, bm::Counter::kIsIterationInvariantRate};\n state.counters[\"bar\"] =\n bm::Counter{2, bm::Counter::kIsRate | bm::Counter::kIsIterationInvariant};\n}\nBENCHMARK(BM_Counters_kIsIterationInvariantRate);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_kIsIterationInvariantRate \"\n \"%console_report bar=%hrfloat/s foo=%hrfloat/s$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_kIsIterationInvariantRate\\\",$\"},\n {\"\\\"family_index\\\": 9,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_kIsIterationInvariantRate\\\",$\",\n MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Counters_kIsIterationInvariantRate\\\",%csv_report,\"\n \"%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckIsIterationInvariantRate(Results const& e) {\n double its = e.NumIterations();\n double t = e.DurationCPUTime(); // this (and not real time) is the time used\n // check that the values are within 0.1% of the expected values\n CHECK_FLOAT_COUNTER_VALUE(e, \"foo\", EQ, its * 1. / t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, its * 2. / t, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_kIsIterationInvariantRate\",\n &CheckIsIterationInvariantRate);\n\n// ========================================================================= //\n// --------------------- AvgIterations Counters Output --------------------- //\n// ========================================================================= //\n\nvoid BM_Counters_AvgIterations(benchmark::State& state) {\n for (auto _ : state) {\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] = bm::Counter{1, bm::Counter::kAvgIterations};\n state.counters[\"bar\"] = bm::Counter{2, bm::Counter::kAvgIterations};\n}\nBENCHMARK(BM_Counters_AvgIterations);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_AvgIterations %console_report \"\n \"bar=%hrfloat foo=%hrfloat$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_AvgIterations\\\",$\"},\n {\"\\\"family_index\\\": 10,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_AvgIterations\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut,\n {{\"^\\\"BM_Counters_AvgIterations\\\",%csv_report,%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckAvgIterations(Results const& e) {\n double its = e.NumIterations();\n // check that the values are within 0.1% of the expected value\n CHECK_FLOAT_COUNTER_VALUE(e, \"foo\", EQ, 1. / its, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, 2. / its, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_AvgIterations\", &CheckAvgIterations);\n\n// ========================================================================= //\n// ------------------- AvgIterationsRate Counters Output ------------------- //\n// ========================================================================= //\n\nvoid BM_Counters_kAvgIterationsRate(benchmark::State& state) {\n for (auto _ : state) {\n // This test requires a non-zero CPU time to avoid divide-by-zero\n auto iterations = state.iterations();\n benchmark::DoNotOptimize(iterations);\n }\n namespace bm = benchmark;\n state.counters[\"foo\"] = bm::Counter{1, bm::Counter::kAvgIterationsRate};\n state.counters[\"bar\"] =\n bm::Counter{2, bm::Counter::kIsRate | bm::Counter::kAvgIterations};\n}\nBENCHMARK(BM_Counters_kAvgIterationsRate);\nADD_CASES(TC_ConsoleOut, {{\"^BM_Counters_kAvgIterationsRate \"\n \"%console_report bar=%hrfloat/s foo=%hrfloat/s$\"}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_kAvgIterationsRate\\\",$\"},\n {\"\\\"family_index\\\": 11,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_kAvgIterationsRate\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 1,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"bar\\\": %float,$\", MR_Next},\n {\"\\\"foo\\\": %float$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_CSVOut, {{\"^\\\"BM_Counters_kAvgIterationsRate\\\",%csv_report,\"\n \"%float,%float$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckAvgIterationsRate(Results const& e) {\n double its = e.NumIterations();\n double t = e.DurationCPUTime(); // this (and not real time) is the time used\n // check that the values are within 0.1% of the expected values\n CHECK_FLOAT_COUNTER_VALUE(e, \"foo\", EQ, 1. / its / t, 0.001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"bar\", EQ, 2. / its / t, 0.001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_kAvgIterationsRate\",\n &CheckAvgIterationsRate);\n\n// ========================================================================= //\n// --------------------------- TEST CASES END ------------------------------ //\n// ========================================================================= //\n\nint main(int argc, char* argv[]) { RunOutputTests(argc, argv); }\n" }, { "path": "3rd/benchmark-1.8.2/test/user_counters_thousands_test.cc", "content": "\n#undef NDEBUG\n\n#include \"benchmark/benchmark.h\"\n#include \"output_test.h\"\n\n// ========================================================================= //\n// ------------------------ Thousands Customisation ------------------------ //\n// ========================================================================= //\n\nvoid BM_Counters_Thousands(benchmark::State& state) {\n for (auto _ : state) {\n }\n namespace bm = benchmark;\n state.counters.insert({\n {\"t0_1000000DefaultBase\",\n bm::Counter(1000 * 1000, bm::Counter::kDefaults)},\n {\"t1_1000000Base1000\", bm::Counter(1000 * 1000, bm::Counter::kDefaults,\n benchmark::Counter::OneK::kIs1000)},\n {\"t2_1000000Base1024\", bm::Counter(1000 * 1000, bm::Counter::kDefaults,\n benchmark::Counter::OneK::kIs1024)},\n {\"t3_1048576Base1000\", bm::Counter(1024 * 1024, bm::Counter::kDefaults,\n benchmark::Counter::OneK::kIs1000)},\n {\"t4_1048576Base1024\", bm::Counter(1024 * 1024, bm::Counter::kDefaults,\n benchmark::Counter::OneK::kIs1024)},\n });\n}\nBENCHMARK(BM_Counters_Thousands)->Repetitions(2);\nADD_CASES(\n TC_ConsoleOut,\n {\n {\"^BM_Counters_Thousands/repeats:2 %console_report \"\n \"t0_1000000DefaultBase=1000k \"\n \"t1_1000000Base1000=1000k t2_1000000Base1024=976.56[23]k \"\n \"t3_1048576Base1000=1048.58k t4_1048576Base1024=1024k$\"},\n {\"^BM_Counters_Thousands/repeats:2 %console_report \"\n \"t0_1000000DefaultBase=1000k \"\n \"t1_1000000Base1000=1000k t2_1000000Base1024=976.56[23]k \"\n \"t3_1048576Base1000=1048.58k t4_1048576Base1024=1024k$\"},\n {\"^BM_Counters_Thousands/repeats:2_mean %console_report \"\n \"t0_1000000DefaultBase=1000k t1_1000000Base1000=1000k \"\n \"t2_1000000Base1024=976.56[23]k t3_1048576Base1000=1048.58k \"\n \"t4_1048576Base1024=1024k$\"},\n {\"^BM_Counters_Thousands/repeats:2_median %console_report \"\n \"t0_1000000DefaultBase=1000k t1_1000000Base1000=1000k \"\n \"t2_1000000Base1024=976.56[23]k t3_1048576Base1000=1048.58k \"\n \"t4_1048576Base1024=1024k$\"},\n {\"^BM_Counters_Thousands/repeats:2_stddev %console_time_only_report [ \"\n \"]*2 t0_1000000DefaultBase=0 t1_1000000Base1000=0 \"\n \"t2_1000000Base1024=0 t3_1048576Base1000=0 t4_1048576Base1024=0$\"},\n });\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Thousands/repeats:2\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Thousands/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 0,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"t0_1000000DefaultBase\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t1_1000000Base1000\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t2_1000000Base1024\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t3_1048576Base1000\\\": 1\\\\.048576(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t4_1048576Base1024\\\": 1\\\\.048576(0)*e\\\\+(0)*6$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Thousands/repeats:2\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Thousands/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"iteration\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"repetition_index\\\": 1,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"iterations\\\": %int,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"t0_1000000DefaultBase\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t1_1000000Base1000\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t2_1000000Base1024\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t3_1048576Base1000\\\": 1\\\\.048576(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t4_1048576Base1024\\\": 1\\\\.048576(0)*e\\\\+(0)*6$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Thousands/repeats:2_mean\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Thousands/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"mean\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"t0_1000000DefaultBase\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t1_1000000Base1000\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t2_1000000Base1024\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t3_1048576Base1000\\\": 1\\\\.048576(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t4_1048576Base1024\\\": 1\\\\.048576(0)*e\\\\+(0)*6$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Thousands/repeats:2_median\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Thousands/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"median\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"t0_1000000DefaultBase\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t1_1000000Base1000\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t2_1000000Base1024\\\": 1\\\\.(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t3_1048576Base1000\\\": 1\\\\.048576(0)*e\\\\+(0)*6,$\", MR_Next},\n {\"\\\"t4_1048576Base1024\\\": 1\\\\.048576(0)*e\\\\+(0)*6$\", MR_Next},\n {\"}\", MR_Next}});\nADD_CASES(TC_JSONOut,\n {{\"\\\"name\\\": \\\"BM_Counters_Thousands/repeats:2_stddev\\\",$\"},\n {\"\\\"family_index\\\": 0,$\", MR_Next},\n {\"\\\"per_family_instance_index\\\": 0,$\", MR_Next},\n {\"\\\"run_name\\\": \\\"BM_Counters_Thousands/repeats:2\\\",$\", MR_Next},\n {\"\\\"run_type\\\": \\\"aggregate\\\",$\", MR_Next},\n {\"\\\"repetitions\\\": 2,$\", MR_Next},\n {\"\\\"threads\\\": 1,$\", MR_Next},\n {\"\\\"aggregate_name\\\": \\\"stddev\\\",$\", MR_Next},\n {\"\\\"aggregate_unit\\\": \\\"time\\\",$\", MR_Next},\n {\"\\\"iterations\\\": 2,$\", MR_Next},\n {\"\\\"real_time\\\": %float,$\", MR_Next},\n {\"\\\"cpu_time\\\": %float,$\", MR_Next},\n {\"\\\"time_unit\\\": \\\"ns\\\",$\", MR_Next},\n {\"\\\"t0_1000000DefaultBase\\\": 0\\\\.(0)*e\\\\+(0)*,$\", MR_Next},\n {\"\\\"t1_1000000Base1000\\\": 0\\\\.(0)*e\\\\+(0)*,$\", MR_Next},\n {\"\\\"t2_1000000Base1024\\\": 0\\\\.(0)*e\\\\+(0)*,$\", MR_Next},\n {\"\\\"t3_1048576Base1000\\\": 0\\\\.(0)*e\\\\+(0)*,$\", MR_Next},\n {\"\\\"t4_1048576Base1024\\\": 0\\\\.(0)*e\\\\+(0)*$\", MR_Next},\n {\"}\", MR_Next}});\n\nADD_CASES(\n TC_CSVOut,\n {{\"^\\\"BM_Counters_Thousands/\"\n \"repeats:2\\\",%csv_report,1e\\\\+(0)*6,1e\\\\+(0)*6,1e\\\\+(0)*6,1\\\\.04858e\\\\+(\"\n \"0)*6,1\\\\.04858e\\\\+(0)*6$\"},\n {\"^\\\"BM_Counters_Thousands/\"\n \"repeats:2\\\",%csv_report,1e\\\\+(0)*6,1e\\\\+(0)*6,1e\\\\+(0)*6,1\\\\.04858e\\\\+(\"\n \"0)*6,1\\\\.04858e\\\\+(0)*6$\"},\n {\"^\\\"BM_Counters_Thousands/\"\n \"repeats:2_mean\\\",%csv_report,1e\\\\+(0)*6,1e\\\\+(0)*6,1e\\\\+(0)*6,1\\\\.\"\n \"04858e\\\\+(0)*6,1\\\\.04858e\\\\+(0)*6$\"},\n {\"^\\\"BM_Counters_Thousands/\"\n \"repeats:2_median\\\",%csv_report,1e\\\\+(0)*6,1e\\\\+(0)*6,1e\\\\+(0)*6,1\\\\.\"\n \"04858e\\\\+(0)*6,1\\\\.04858e\\\\+(0)*6$\"},\n {\"^\\\"BM_Counters_Thousands/repeats:2_stddev\\\",%csv_report,0,0,0,0,0$\"}});\n// VS2013 does not allow this function to be passed as a lambda argument\n// to CHECK_BENCHMARK_RESULTS()\nvoid CheckThousands(Results const& e) {\n if (e.name != \"BM_Counters_Thousands/repeats:2\")\n return; // Do not check the aggregates!\n\n // check that the values are within 0.01% of the expected values\n CHECK_FLOAT_COUNTER_VALUE(e, \"t0_1000000DefaultBase\", EQ, 1000 * 1000,\n 0.0001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"t1_1000000Base1000\", EQ, 1000 * 1000, 0.0001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"t2_1000000Base1024\", EQ, 1000 * 1000, 0.0001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"t3_1048576Base1000\", EQ, 1024 * 1024, 0.0001);\n CHECK_FLOAT_COUNTER_VALUE(e, \"t4_1048576Base1024\", EQ, 1024 * 1024, 0.0001);\n}\nCHECK_BENCHMARK_RESULTS(\"BM_Counters_Thousands\", &CheckThousands);\n\n// ========================================================================= //\n// --------------------------- TEST CASES END ------------------------------ //\n// ========================================================================= //\n\nint main(int argc, char* argv[]) { RunOutputTests(argc, argv); }\n" }, { "path": "3rd/benchmark-1.8.2/tools/BUILD.bazel", "content": "load(\"@tools_pip_deps//:requirements.bzl\", \"requirement\")\n\npy_library(\n name = \"gbench\",\n srcs = glob([\"gbench/*.py\"]),\n deps = [\n requirement(\"numpy\"),\n requirement(\"scipy\"),\n ],\n)\n\npy_binary(\n name = \"compare\",\n srcs = [\"compare.py\"],\n python_version = \"PY3\",\n deps = [\n \":gbench\",\n ],\n)\n" }, { "path": "3rd/benchmark-1.8.2/tools/compare.py", "content": "#!/usr/bin/env python3\n\nimport unittest\n\"\"\"\ncompare.py - versatile benchmark output compare tool\n\"\"\"\n\nimport argparse\nfrom argparse import ArgumentParser\nimport json\nimport sys\nimport os\nimport gbench\nfrom gbench import util, report\n\n\ndef check_inputs(in1, in2, flags):\n \"\"\"\n Perform checking on the user provided inputs and diagnose any abnormalities\n \"\"\"\n in1_kind, in1_err = util.classify_input_file(in1)\n in2_kind, in2_err = util.classify_input_file(in2)\n output_file = util.find_benchmark_flag('--benchmark_out=', flags)\n output_type = util.find_benchmark_flag('--benchmark_out_format=', flags)\n if in1_kind == util.IT_Executable and in2_kind == util.IT_Executable and output_file:\n print((\"WARNING: '--benchmark_out=%s' will be passed to both \"\n \"benchmarks causing it to be overwritten\") % output_file)\n if in1_kind == util.IT_JSON and in2_kind == util.IT_JSON:\n # When both sides are JSON the only supported flag is\n # --benchmark_filter=\n for flag in util.remove_benchmark_flags('--benchmark_filter=', flags):\n print(\"WARNING: passing %s has no effect since both \"\n \"inputs are JSON\" % flag)\n if output_type is not None and output_type != 'json':\n print((\"ERROR: passing '--benchmark_out_format=%s' to 'compare.py`\"\n \" is not supported.\") % output_type)\n sys.exit(1)\n\n\ndef create_parser():\n parser = ArgumentParser(\n description='versatile benchmark output compare tool')\n\n parser.add_argument(\n '-a',\n '--display_aggregates_only',\n dest='display_aggregates_only',\n action=\"store_true\",\n help=\"If there are repetitions, by default, we display everything - the\"\n \" actual runs, and the aggregates computed. Sometimes, it is \"\n \"desirable to only view the aggregates. E.g. when there are a lot \"\n \"of repetitions. Do note that only the display is affected. \"\n \"Internally, all the actual runs are still used, e.g. for U test.\")\n\n parser.add_argument(\n '--no-color',\n dest='color',\n default=True,\n action=\"store_false\",\n help=\"Do not use colors in the terminal output\"\n )\n\n parser.add_argument(\n '-d',\n '--dump_to_json',\n dest='dump_to_json',\n help=\"Additionally, dump benchmark comparison output to this file in JSON format.\")\n\n utest = parser.add_argument_group()\n utest.add_argument(\n '--no-utest',\n dest='utest',\n default=True,\n action=\"store_false\",\n help=\"The tool can do a two-tailed Mann-Whitney U test with the null hypothesis that it is equally likely that a randomly selected value from one sample will be less than or greater than a randomly selected value from a second sample.\\nWARNING: requires **LARGE** (no less than {}) number of repetitions to be meaningful!\\nThe test is being done by default, if at least {} repetitions were done.\\nThis option can disable the U Test.\".format(report.UTEST_OPTIMAL_REPETITIONS, report.UTEST_MIN_REPETITIONS))\n alpha_default = 0.05\n utest.add_argument(\n \"--alpha\",\n dest='utest_alpha',\n default=alpha_default,\n type=float,\n help=(\"significance level alpha. if the calculated p-value is below this value, then the result is said to be statistically significant and the null hypothesis is rejected.\\n(default: %0.4f)\") %\n alpha_default)\n\n subparsers = parser.add_subparsers(\n help='This tool has multiple modes of operation:',\n dest='mode')\n\n parser_a = subparsers.add_parser(\n 'benchmarks',\n help='The most simple use-case, compare all the output of these two benchmarks')\n baseline = parser_a.add_argument_group(\n 'baseline', 'The benchmark baseline')\n baseline.add_argument(\n 'test_baseline',\n metavar='test_baseline',\n type=argparse.FileType('r'),\n nargs=1,\n help='A benchmark executable or JSON output file')\n contender = parser_a.add_argument_group(\n 'contender', 'The benchmark that will be compared against the baseline')\n contender.add_argument(\n 'test_contender',\n metavar='test_contender',\n type=argparse.FileType('r'),\n nargs=1,\n help='A benchmark executable or JSON output file')\n parser_a.add_argument(\n 'benchmark_options',\n metavar='benchmark_options',\n nargs=argparse.REMAINDER,\n help='Arguments to pass when running benchmark executables')\n\n parser_b = subparsers.add_parser(\n 'filters', help='Compare filter one with the filter two of benchmark')\n baseline = parser_b.add_argument_group(\n 'baseline', 'The benchmark baseline')\n baseline.add_argument(\n 'test',\n metavar='test',\n type=argparse.FileType('r'),\n nargs=1,\n help='A benchmark executable or JSON output file')\n baseline.add_argument(\n 'filter_baseline',\n metavar='filter_baseline',\n type=str,\n nargs=1,\n help='The first filter, that will be used as baseline')\n contender = parser_b.add_argument_group(\n 'contender', 'The benchmark that will be compared against the baseline')\n contender.add_argument(\n 'filter_contender',\n metavar='filter_contender',\n type=str,\n nargs=1,\n help='The second filter, that will be compared against the baseline')\n parser_b.add_argument(\n 'benchmark_options',\n metavar='benchmark_options',\n nargs=argparse.REMAINDER,\n help='Arguments to pass when running benchmark executables')\n\n parser_c = subparsers.add_parser(\n 'benchmarksfiltered',\n help='Compare filter one of first benchmark with filter two of the second benchmark')\n baseline = parser_c.add_argument_group(\n 'baseline', 'The benchmark baseline')\n baseline.add_argument(\n 'test_baseline',\n metavar='test_baseline',\n type=argparse.FileType('r'),\n nargs=1,\n help='A benchmark executable or JSON output file')\n baseline.add_argument(\n 'filter_baseline',\n metavar='filter_baseline',\n type=str,\n nargs=1,\n help='The first filter, that will be used as baseline')\n contender = parser_c.add_argument_group(\n 'contender', 'The benchmark that will be compared against the baseline')\n contender.add_argument(\n 'test_contender',\n metavar='test_contender',\n type=argparse.FileType('r'),\n nargs=1,\n help='The second benchmark executable or JSON output file, that will be compared against the baseline')\n contender.add_argument(\n 'filter_contender',\n metavar='filter_contender',\n type=str,\n nargs=1,\n help='The second filter, that will be compared against the baseline')\n parser_c.add_argument(\n 'benchmark_options',\n metavar='benchmark_options',\n nargs=argparse.REMAINDER,\n help='Arguments to pass when running benchmark executables')\n\n return parser\n\n\ndef main():\n # Parse the command line flags\n parser = create_parser()\n args, unknown_args = parser.parse_known_args()\n if args.mode is None:\n parser.print_help()\n exit(1)\n assert not unknown_args\n benchmark_options = args.benchmark_options\n\n if args.mode == 'benchmarks':\n test_baseline = args.test_baseline[0].name\n test_contender = args.test_contender[0].name\n filter_baseline = ''\n filter_contender = ''\n\n # NOTE: if test_baseline == test_contender, you are analyzing the stdev\n\n description = 'Comparing %s to %s' % (test_baseline, test_contender)\n elif args.mode == 'filters':\n test_baseline = args.test[0].name\n test_contender = args.test[0].name\n filter_baseline = args.filter_baseline[0]\n filter_contender = args.filter_contender[0]\n\n # NOTE: if filter_baseline == filter_contender, you are analyzing the\n # stdev\n\n description = 'Comparing %s to %s (from %s)' % (\n filter_baseline, filter_contender, args.test[0].name)\n elif args.mode == 'benchmarksfiltered':\n test_baseline = args.test_baseline[0].name\n test_contender = args.test_contender[0].name\n filter_baseline = args.filter_baseline[0]\n filter_contender = args.filter_contender[0]\n\n # NOTE: if test_baseline == test_contender and\n # filter_baseline == filter_contender, you are analyzing the stdev\n\n description = 'Comparing %s (from %s) to %s (from %s)' % (\n filter_baseline, test_baseline, filter_contender, test_contender)\n else:\n # should never happen\n print(\"Unrecognized mode of operation: '%s'\" % args.mode)\n parser.print_help()\n exit(1)\n\n check_inputs(test_baseline, test_contender, benchmark_options)\n\n if args.display_aggregates_only:\n benchmark_options += ['--benchmark_display_aggregates_only=true']\n\n options_baseline = []\n options_contender = []\n\n if filter_baseline and filter_contender:\n options_baseline = ['--benchmark_filter=%s' % filter_baseline]\n options_contender = ['--benchmark_filter=%s' % filter_contender]\n\n # Run the benchmarks and report the results\n json1 = json1_orig = gbench.util.sort_benchmark_results(gbench.util.run_or_load_benchmark(\n test_baseline, benchmark_options + options_baseline))\n json2 = json2_orig = gbench.util.sort_benchmark_results(gbench.util.run_or_load_benchmark(\n test_contender, benchmark_options + options_contender))\n\n # Now, filter the benchmarks so that the difference report can work\n if filter_baseline and filter_contender:\n replacement = '[%s vs. %s]' % (filter_baseline, filter_contender)\n json1 = gbench.report.filter_benchmark(\n json1_orig, filter_baseline, replacement)\n json2 = gbench.report.filter_benchmark(\n json2_orig, filter_contender, replacement)\n\n diff_report = gbench.report.get_difference_report(\n json1, json2, args.utest)\n output_lines = gbench.report.print_difference_report(\n diff_report,\n args.display_aggregates_only,\n args.utest, args.utest_alpha, args.color)\n print(description)\n for ln in output_lines:\n print(ln)\n\n # Optionally, diff and output to JSON\n if args.dump_to_json is not None:\n with open(args.dump_to_json, 'w') as f_json:\n json.dump(diff_report, f_json)\n\nclass TestParser(unittest.TestCase):\n def setUp(self):\n self.parser = create_parser()\n testInputs = os.path.join(\n os.path.dirname(\n os.path.realpath(__file__)),\n 'gbench',\n 'Inputs')\n self.testInput0 = os.path.join(testInputs, 'test1_run1.json')\n self.testInput1 = os.path.join(testInputs, 'test1_run2.json')\n\n def test_benchmarks_basic(self):\n parsed = self.parser.parse_args(\n ['benchmarks', self.testInput0, self.testInput1])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'benchmarks')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertFalse(parsed.benchmark_options)\n\n def test_benchmarks_basic_without_utest(self):\n parsed = self.parser.parse_args(\n ['--no-utest', 'benchmarks', self.testInput0, self.testInput1])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertFalse(parsed.utest)\n self.assertEqual(parsed.utest_alpha, 0.05)\n self.assertEqual(parsed.mode, 'benchmarks')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertFalse(parsed.benchmark_options)\n\n def test_benchmarks_basic_display_aggregates_only(self):\n parsed = self.parser.parse_args(\n ['-a', 'benchmarks', self.testInput0, self.testInput1])\n self.assertTrue(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'benchmarks')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertFalse(parsed.benchmark_options)\n\n def test_benchmarks_basic_with_utest_alpha(self):\n parsed = self.parser.parse_args(\n ['--alpha=0.314', 'benchmarks', self.testInput0, self.testInput1])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.utest_alpha, 0.314)\n self.assertEqual(parsed.mode, 'benchmarks')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertFalse(parsed.benchmark_options)\n\n def test_benchmarks_basic_without_utest_with_utest_alpha(self):\n parsed = self.parser.parse_args(\n ['--no-utest', '--alpha=0.314', 'benchmarks', self.testInput0, self.testInput1])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertFalse(parsed.utest)\n self.assertEqual(parsed.utest_alpha, 0.314)\n self.assertEqual(parsed.mode, 'benchmarks')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertFalse(parsed.benchmark_options)\n\n def test_benchmarks_with_remainder(self):\n parsed = self.parser.parse_args(\n ['benchmarks', self.testInput0, self.testInput1, 'd'])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'benchmarks')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertEqual(parsed.benchmark_options, ['d'])\n\n def test_benchmarks_with_remainder_after_doubleminus(self):\n parsed = self.parser.parse_args(\n ['benchmarks', self.testInput0, self.testInput1, '--', 'e'])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'benchmarks')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertEqual(parsed.benchmark_options, ['e'])\n\n def test_filters_basic(self):\n parsed = self.parser.parse_args(\n ['filters', self.testInput0, 'c', 'd'])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'filters')\n self.assertEqual(parsed.test[0].name, self.testInput0)\n self.assertEqual(parsed.filter_baseline[0], 'c')\n self.assertEqual(parsed.filter_contender[0], 'd')\n self.assertFalse(parsed.benchmark_options)\n\n def test_filters_with_remainder(self):\n parsed = self.parser.parse_args(\n ['filters', self.testInput0, 'c', 'd', 'e'])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'filters')\n self.assertEqual(parsed.test[0].name, self.testInput0)\n self.assertEqual(parsed.filter_baseline[0], 'c')\n self.assertEqual(parsed.filter_contender[0], 'd')\n self.assertEqual(parsed.benchmark_options, ['e'])\n\n def test_filters_with_remainder_after_doubleminus(self):\n parsed = self.parser.parse_args(\n ['filters', self.testInput0, 'c', 'd', '--', 'f'])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'filters')\n self.assertEqual(parsed.test[0].name, self.testInput0)\n self.assertEqual(parsed.filter_baseline[0], 'c')\n self.assertEqual(parsed.filter_contender[0], 'd')\n self.assertEqual(parsed.benchmark_options, ['f'])\n\n def test_benchmarksfiltered_basic(self):\n parsed = self.parser.parse_args(\n ['benchmarksfiltered', self.testInput0, 'c', self.testInput1, 'e'])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'benchmarksfiltered')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.filter_baseline[0], 'c')\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertEqual(parsed.filter_contender[0], 'e')\n self.assertFalse(parsed.benchmark_options)\n\n def test_benchmarksfiltered_with_remainder(self):\n parsed = self.parser.parse_args(\n ['benchmarksfiltered', self.testInput0, 'c', self.testInput1, 'e', 'f'])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'benchmarksfiltered')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.filter_baseline[0], 'c')\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertEqual(parsed.filter_contender[0], 'e')\n self.assertEqual(parsed.benchmark_options[0], 'f')\n\n def test_benchmarksfiltered_with_remainder_after_doubleminus(self):\n parsed = self.parser.parse_args(\n ['benchmarksfiltered', self.testInput0, 'c', self.testInput1, 'e', '--', 'g'])\n self.assertFalse(parsed.display_aggregates_only)\n self.assertTrue(parsed.utest)\n self.assertEqual(parsed.mode, 'benchmarksfiltered')\n self.assertEqual(parsed.test_baseline[0].name, self.testInput0)\n self.assertEqual(parsed.filter_baseline[0], 'c')\n self.assertEqual(parsed.test_contender[0].name, self.testInput1)\n self.assertEqual(parsed.filter_contender[0], 'e')\n self.assertEqual(parsed.benchmark_options[0], 'g')\n\n\nif __name__ == '__main__':\n # unittest.main()\n main()\n\n# vim: tabstop=4 expandtab shiftwidth=4 softtabstop=4\n# kate: tab-width: 4; replace-tabs on; indent-width 4; tab-indents: off;\n# kate: indent-mode python; remove-trailing-spaces modified;\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/Inputs/test1_run1.json", "content": "{\n \"context\": {\n \"date\": \"2016-08-02 17:44:46\",\n \"num_cpus\": 4,\n \"mhz_per_cpu\": 4228,\n \"cpu_scaling_enabled\": false,\n \"library_build_type\": \"release\"\n },\n \"benchmarks\": [\n {\n \"name\": \"BM_SameTimes\",\n \"iterations\": 1000,\n \"real_time\": 10,\n \"cpu_time\": 10,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_2xFaster\",\n \"iterations\": 1000,\n \"real_time\": 50,\n \"cpu_time\": 50,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_2xSlower\",\n \"iterations\": 1000,\n \"real_time\": 50,\n \"cpu_time\": 50,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_1PercentFaster\",\n \"iterations\": 1000,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_1PercentSlower\",\n \"iterations\": 1000,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_10PercentFaster\",\n \"iterations\": 1000,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_10PercentSlower\",\n \"iterations\": 1000,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_100xSlower\",\n \"iterations\": 1000,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_100xFaster\",\n \"iterations\": 1000,\n \"real_time\": 10000,\n \"cpu_time\": 10000,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_10PercentCPUToTime\",\n \"iterations\": 1000,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_ThirdFaster\",\n \"iterations\": 1000,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"MyComplexityTest_BigO\",\n \"run_name\": \"MyComplexityTest\",\n \"run_type\": \"aggregate\",\n \"aggregate_name\": \"BigO\",\n \"cpu_coefficient\": 4.2749856294592886e+00,\n \"real_coefficient\": 6.4789275289789780e+00,\n \"big_o\": \"N\",\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"MyComplexityTest_RMS\",\n \"run_name\": \"MyComplexityTest\",\n \"run_type\": \"aggregate\",\n \"aggregate_name\": \"RMS\",\n \"rms\": 4.5097802512472874e-03\n },\n {\n \"name\": \"BM_NotBadTimeUnit\",\n \"iterations\": 1000,\n \"real_time\": 0.4,\n \"cpu_time\": 0.5,\n \"time_unit\": \"s\"\n },\n {\n \"name\": \"BM_DifferentTimeUnit\",\n \"iterations\": 1,\n \"real_time\": 1,\n \"cpu_time\": 1,\n \"time_unit\": \"s\"\n },\n {\n \"name\": \"BM_hasLabel\",\n \"label\": \"a label\",\n \"iterations\": 1,\n \"real_time\": 1,\n \"cpu_time\": 1,\n \"time_unit\": \"s\"\n }\n ]\n}\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/Inputs/test1_run2.json", "content": "{\n \"context\": {\n \"date\": \"2016-08-02 17:44:46\",\n \"num_cpus\": 4,\n \"mhz_per_cpu\": 4228,\n \"cpu_scaling_enabled\": false,\n \"library_build_type\": \"release\"\n },\n \"benchmarks\": [\n {\n \"name\": \"BM_SameTimes\",\n \"iterations\": 1000,\n \"real_time\": 10,\n \"cpu_time\": 10,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_2xFaster\",\n \"iterations\": 1000,\n \"real_time\": 25,\n \"cpu_time\": 25,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_2xSlower\",\n \"iterations\": 20833333,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_1PercentFaster\",\n \"iterations\": 1000,\n \"real_time\": 98.9999999,\n \"cpu_time\": 98.9999999,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_1PercentSlower\",\n \"iterations\": 1000,\n \"real_time\": 100.9999999,\n \"cpu_time\": 100.9999999,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_10PercentFaster\",\n \"iterations\": 1000,\n \"real_time\": 90,\n \"cpu_time\": 90,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_10PercentSlower\",\n \"iterations\": 1000,\n \"real_time\": 110,\n \"cpu_time\": 110,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_100xSlower\",\n \"iterations\": 1000,\n \"real_time\": 1.0000e+04,\n \"cpu_time\": 1.0000e+04,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_100xFaster\",\n \"iterations\": 1000,\n \"real_time\": 100,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_10PercentCPUToTime\",\n \"iterations\": 1000,\n \"real_time\": 110,\n \"cpu_time\": 90,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_ThirdFaster\",\n \"iterations\": 1000,\n \"real_time\": 66.665,\n \"cpu_time\": 66.664,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"MyComplexityTest_BigO\",\n \"run_name\": \"MyComplexityTest\",\n \"run_type\": \"aggregate\",\n \"aggregate_name\": \"BigO\",\n \"cpu_coefficient\": 5.6215779594361486e+00,\n \"real_coefficient\": 5.6288314793554610e+00,\n \"big_o\": \"N\",\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"MyComplexityTest_RMS\",\n \"run_name\": \"MyComplexityTest\",\n \"run_type\": \"aggregate\",\n \"aggregate_name\": \"RMS\",\n \"rms\": 3.3128901852342174e-03\n },\n {\n \"name\": \"BM_NotBadTimeUnit\",\n \"iterations\": 1000,\n \"real_time\": 0.04,\n \"cpu_time\": 0.6,\n \"time_unit\": \"s\"\n },\n {\n \"name\": \"BM_DifferentTimeUnit\",\n \"iterations\": 1,\n \"real_time\": 1,\n \"cpu_time\": 1,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_hasLabel\",\n \"label\": \"a label\",\n \"iterations\": 1,\n \"real_time\": 1,\n \"cpu_time\": 1,\n \"time_unit\": \"s\"\n }\n ]\n}\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/Inputs/test2_run.json", "content": "{\n \"context\": {\n \"date\": \"2016-08-02 17:44:46\",\n \"num_cpus\": 4,\n \"mhz_per_cpu\": 4228,\n \"cpu_scaling_enabled\": false,\n \"library_build_type\": \"release\"\n },\n \"benchmarks\": [\n {\n \"name\": \"BM_Hi\",\n \"iterations\": 1234,\n \"real_time\": 42,\n \"cpu_time\": 24,\n \"time_unit\": \"ms\"\n },\n {\n \"name\": \"BM_Zero\",\n \"iterations\": 1000,\n \"real_time\": 10,\n \"cpu_time\": 10,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_Zero/4\",\n \"iterations\": 4000,\n \"real_time\": 40,\n \"cpu_time\": 40,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"Prefix/BM_Zero\",\n \"iterations\": 2000,\n \"real_time\": 20,\n \"cpu_time\": 20,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"Prefix/BM_Zero/3\",\n \"iterations\": 3000,\n \"real_time\": 30,\n \"cpu_time\": 30,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_One\",\n \"iterations\": 5000,\n \"real_time\": 5,\n \"cpu_time\": 5,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_One/4\",\n \"iterations\": 2000,\n \"real_time\": 20,\n \"cpu_time\": 20,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"Prefix/BM_One\",\n \"iterations\": 1000,\n \"real_time\": 10,\n \"cpu_time\": 10,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"Prefix/BM_One/3\",\n \"iterations\": 1500,\n \"real_time\": 15,\n \"cpu_time\": 15,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_Bye\",\n \"iterations\": 5321,\n \"real_time\": 11,\n \"cpu_time\": 63,\n \"time_unit\": \"ns\"\n }\n ]\n}\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/Inputs/test3_run0.json", "content": "{\n \"context\": {\n \"date\": \"2016-08-02 17:44:46\",\n \"num_cpus\": 4,\n \"mhz_per_cpu\": 4228,\n \"cpu_scaling_enabled\": false,\n \"library_build_type\": \"release\"\n },\n \"benchmarks\": [\n {\n \"name\": \"BM_One\",\n \"run_type\": \"aggregate\",\n \"iterations\": 1000,\n \"real_time\": 10,\n \"cpu_time\": 100,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_Two\",\n \"iterations\": 1000,\n \"real_time\": 9,\n \"cpu_time\": 90,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_Two\",\n \"iterations\": 1000,\n \"real_time\": 8,\n \"cpu_time\": 86,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"short\",\n \"run_type\": \"aggregate\",\n \"iterations\": 1000,\n \"real_time\": 8,\n \"cpu_time\": 80,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"short\",\n \"run_type\": \"aggregate\",\n \"iterations\": 1000,\n \"real_time\": 8,\n \"cpu_time\": 77,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"medium\",\n \"run_type\": \"iteration\",\n \"iterations\": 1000,\n \"real_time\": 8,\n \"cpu_time\": 80,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"medium\",\n \"run_type\": \"iteration\",\n \"iterations\": 1000,\n \"real_time\": 9,\n \"cpu_time\": 82,\n \"time_unit\": \"ns\"\n }\n ]\n}\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/Inputs/test3_run1.json", "content": "{\n \"context\": {\n \"date\": \"2016-08-02 17:44:46\",\n \"num_cpus\": 4,\n \"mhz_per_cpu\": 4228,\n \"cpu_scaling_enabled\": false,\n \"library_build_type\": \"release\"\n },\n \"benchmarks\": [\n {\n \"name\": \"BM_One\",\n \"iterations\": 1000,\n \"real_time\": 9,\n \"cpu_time\": 110,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_Two\",\n \"run_type\": \"aggregate\",\n \"iterations\": 1000,\n \"real_time\": 10,\n \"cpu_time\": 89,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"BM_Two\",\n \"iterations\": 1000,\n \"real_time\": 7,\n \"cpu_time\": 72,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"short\",\n \"run_type\": \"aggregate\",\n \"iterations\": 1000,\n \"real_time\": 7,\n \"cpu_time\": 75,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"short\",\n \"run_type\": \"aggregate\",\n \"iterations\": 762,\n \"real_time\": 4.54,\n \"cpu_time\": 66.6,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"short\",\n \"run_type\": \"iteration\",\n \"iterations\": 1000,\n \"real_time\": 800,\n \"cpu_time\": 1,\n \"time_unit\": \"ns\"\n },\n {\n \"name\": \"medium\",\n \"run_type\": \"iteration\",\n \"iterations\": 1200,\n \"real_time\": 5,\n \"cpu_time\": 53,\n \"time_unit\": \"ns\"\n }\n ]\n}\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/Inputs/test4_run.json", "content": "{\n \"benchmarks\": [\n {\n \"name\": \"99 family 0 instance 0 repetition 0\",\n \"run_type\": \"iteration\",\n \"family_index\": 0,\n \"per_family_instance_index\": 0,\n \"repetition_index\": 0\n },\n {\n \"name\": \"98 family 0 instance 0 repetition 1\",\n \"run_type\": \"iteration\",\n \"family_index\": 0,\n \"per_family_instance_index\": 0,\n \"repetition_index\": 1\n },\n {\n \"name\": \"97 family 0 instance 0 aggregate\",\n \"run_type\": \"aggregate\",\n \"family_index\": 0,\n \"per_family_instance_index\": 0,\n \"aggregate_name\": \"9 aggregate\"\n },\n\n\n {\n \"name\": \"96 family 0 instance 1 repetition 0\",\n \"run_type\": \"iteration\",\n \"family_index\": 0,\n \"per_family_instance_index\": 1,\n \"repetition_index\": 0\n },\n {\n \"name\": \"95 family 0 instance 1 repetition 1\",\n \"run_type\": \"iteration\",\n \"family_index\": 0,\n \"per_family_instance_index\": 1,\n \"repetition_index\": 1\n },\n {\n \"name\": \"94 family 0 instance 1 aggregate\",\n \"run_type\": \"aggregate\",\n \"family_index\": 0,\n \"per_family_instance_index\": 1,\n \"aggregate_name\": \"9 aggregate\"\n },\n\n\n\n\n {\n \"name\": \"93 family 1 instance 0 repetition 0\",\n \"run_type\": \"iteration\",\n \"family_index\": 1,\n \"per_family_instance_index\": 0,\n \"repetition_index\": 0\n },\n {\n \"name\": \"92 family 1 instance 0 repetition 1\",\n \"run_type\": \"iteration\",\n \"family_index\": 1,\n \"per_family_instance_index\": 0,\n \"repetition_index\": 1\n },\n {\n \"name\": \"91 family 1 instance 0 aggregate\",\n \"run_type\": \"aggregate\",\n \"family_index\": 1,\n \"per_family_instance_index\": 0,\n \"aggregate_name\": \"9 aggregate\"\n },\n\n\n {\n \"name\": \"90 family 1 instance 1 repetition 0\",\n \"run_type\": \"iteration\",\n \"family_index\": 1,\n \"per_family_instance_index\": 1,\n \"repetition_index\": 0\n },\n {\n \"name\": \"89 family 1 instance 1 repetition 1\",\n \"run_type\": \"iteration\",\n \"family_index\": 1,\n \"per_family_instance_index\": 1,\n \"repetition_index\": 1\n },\n {\n \"name\": \"88 family 1 instance 1 aggregate\",\n \"run_type\": \"aggregate\",\n \"family_index\": 1,\n \"per_family_instance_index\": 1,\n \"aggregate_name\": \"9 aggregate\"\n }\n ]\n}\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/Inputs/test4_run0.json", "content": "{\n \"context\": {\n \"date\": \"2016-08-02 17:44:46\",\n \"num_cpus\": 4,\n \"mhz_per_cpu\": 4228,\n \"cpu_scaling_enabled\": false,\n \"library_build_type\": \"release\"\n },\n \"benchmarks\": [\n {\n \"name\": \"whocares\",\n \"run_type\": \"aggregate\",\n \"aggregate_name\": \"zz\",\n \"aggregate_unit\": \"percentage\",\n \"iterations\": 1000,\n \"real_time\": 0.01,\n \"cpu_time\": 0.10,\n \"time_unit\": \"ns\"\n }\n ]\n}\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/Inputs/test4_run1.json", "content": "{\n \"context\": {\n \"date\": \"2016-08-02 17:44:46\",\n \"num_cpus\": 4,\n \"mhz_per_cpu\": 4228,\n \"cpu_scaling_enabled\": false,\n \"library_build_type\": \"release\"\n },\n \"benchmarks\": [\n {\n \"name\": \"whocares\",\n \"run_type\": \"aggregate\",\n \"aggregate_name\": \"zz\",\n \"aggregate_unit\": \"percentage\",\n \"iterations\": 1000,\n \"real_time\": 0.005,\n \"cpu_time\": 0.15,\n \"time_unit\": \"ns\"\n }\n ]\n}\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/__init__.py", "content": "\"\"\"Google Benchmark tooling\"\"\"\n\n__author__ = 'Eric Fiselier'\n__email__ = 'eric@efcs.ca'\n__versioninfo__ = (0, 5, 0)\n__version__ = '.'.join(str(v) for v in __versioninfo__) + 'dev'\n\n__all__ = []\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/report.py", "content": "\"\"\"report.py - Utilities for reporting statistics about benchmark results\n\"\"\"\n\nimport unittest\nimport os\nimport re\nimport copy\nimport random\n\nfrom scipy.stats import mannwhitneyu, gmean\nfrom numpy import array\n\n\nclass BenchmarkColor(object):\n def __init__(self, name, code):\n self.name = name\n self.code = code\n\n def __repr__(self):\n return '%s%r' % (self.__class__.__name__,\n (self.name, self.code))\n\n def __format__(self, format):\n return self.code\n\n\n# Benchmark Colors Enumeration\nBC_NONE = BenchmarkColor('NONE', '')\nBC_MAGENTA = BenchmarkColor('MAGENTA', '\\033[95m')\nBC_CYAN = BenchmarkColor('CYAN', '\\033[96m')\nBC_OKBLUE = BenchmarkColor('OKBLUE', '\\033[94m')\nBC_OKGREEN = BenchmarkColor('OKGREEN', '\\033[32m')\nBC_HEADER = BenchmarkColor('HEADER', '\\033[92m')\nBC_WARNING = BenchmarkColor('WARNING', '\\033[93m')\nBC_WHITE = BenchmarkColor('WHITE', '\\033[97m')\nBC_FAIL = BenchmarkColor('FAIL', '\\033[91m')\nBC_ENDC = BenchmarkColor('ENDC', '\\033[0m')\nBC_BOLD = BenchmarkColor('BOLD', '\\033[1m')\nBC_UNDERLINE = BenchmarkColor('UNDERLINE', '\\033[4m')\n\nUTEST_MIN_REPETITIONS = 2\nUTEST_OPTIMAL_REPETITIONS = 9 # Lowest reasonable number, More is better.\nUTEST_COL_NAME = \"_pvalue\"\n\n_TIME_UNIT_TO_SECONDS_MULTIPLIER = {\n \"s\": 1.0,\n \"ms\": 1e-3,\n \"us\": 1e-6,\n \"ns\": 1e-9,\n}\n\n\ndef color_format(use_color, fmt_str, *args, **kwargs):\n \"\"\"\n Return the result of 'fmt_str.format(*args, **kwargs)' after transforming\n 'args' and 'kwargs' according to the value of 'use_color'. If 'use_color'\n is False then all color codes in 'args' and 'kwargs' are replaced with\n the empty string.\n \"\"\"\n assert use_color is True or use_color is False\n if not use_color:\n args = [arg if not isinstance(arg, BenchmarkColor) else BC_NONE\n for arg in args]\n kwargs = {key: arg if not isinstance(arg, BenchmarkColor) else BC_NONE\n for key, arg in kwargs.items()}\n return fmt_str.format(*args, **kwargs)\n\n\ndef find_longest_name(benchmark_list):\n \"\"\"\n Return the length of the longest benchmark name in a given list of\n benchmark JSON objects\n \"\"\"\n longest_name = 1\n for bc in benchmark_list:\n if len(bc['name']) > longest_name:\n longest_name = len(bc['name'])\n return longest_name\n\n\ndef calculate_change(old_val, new_val):\n \"\"\"\n Return a float representing the decimal change between old_val and new_val.\n \"\"\"\n if old_val == 0 and new_val == 0:\n return 0.0\n if old_val == 0:\n return float(new_val - old_val) / (float(old_val + new_val) / 2)\n return float(new_val - old_val) / abs(old_val)\n\n\ndef filter_benchmark(json_orig, family, replacement=\"\"):\n \"\"\"\n Apply a filter to the json, and only leave the 'family' of benchmarks.\n \"\"\"\n regex = re.compile(family)\n filtered = {}\n filtered['benchmarks'] = []\n for be in json_orig['benchmarks']:\n if not regex.search(be['name']):\n continue\n filteredbench = copy.deepcopy(be) # Do NOT modify the old name!\n filteredbench['name'] = regex.sub(replacement, filteredbench['name'])\n filtered['benchmarks'].append(filteredbench)\n return filtered\n\n\ndef get_unique_benchmark_names(json):\n \"\"\"\n While *keeping* the order, give all the unique 'names' used for benchmarks.\n \"\"\"\n seen = set()\n uniqued = [x['name'] for x in json['benchmarks']\n if x['name'] not in seen and\n (seen.add(x['name']) or True)]\n return uniqued\n\n\ndef intersect(list1, list2):\n \"\"\"\n Given two lists, get a new list consisting of the elements only contained\n in *both of the input lists*, while preserving the ordering.\n \"\"\"\n return [x for x in list1 if x in list2]\n\n\ndef is_potentially_comparable_benchmark(x):\n return ('time_unit' in x and 'real_time' in x and 'cpu_time' in x)\n\n\ndef partition_benchmarks(json1, json2):\n \"\"\"\n While preserving the ordering, find benchmarks with the same names in\n both of the inputs, and group them.\n (i.e. partition/filter into groups with common name)\n \"\"\"\n json1_unique_names = get_unique_benchmark_names(json1)\n json2_unique_names = get_unique_benchmark_names(json2)\n names = intersect(json1_unique_names, json2_unique_names)\n partitions = []\n for name in names:\n time_unit = None\n # Pick the time unit from the first entry of the lhs benchmark.\n # We should be careful not to crash with unexpected input.\n for x in json1['benchmarks']:\n if (x['name'] == name and is_potentially_comparable_benchmark(x)):\n time_unit = x['time_unit']\n break\n if time_unit is None:\n continue\n # Filter by name and time unit.\n # All the repetitions are assumed to be comparable.\n lhs = [x for x in json1['benchmarks'] if x['name'] == name and\n x['time_unit'] == time_unit]\n rhs = [x for x in json2['benchmarks'] if x['name'] == name and\n x['time_unit'] == time_unit]\n partitions.append([lhs, rhs])\n return partitions\n\n\ndef get_timedelta_field_as_seconds(benchmark, field_name):\n \"\"\"\n Get value of field_name field of benchmark, which is time with time unit\n time_unit, as time in seconds.\n \"\"\"\n timedelta = benchmark[field_name]\n time_unit = benchmark.get('time_unit', 's')\n return timedelta * _TIME_UNIT_TO_SECONDS_MULTIPLIER.get(time_unit)\n\n\ndef calculate_geomean(json):\n \"\"\"\n Extract all real/cpu times from all the benchmarks as seconds,\n and calculate their geomean.\n \"\"\"\n times = []\n for benchmark in json['benchmarks']:\n if 'run_type' in benchmark and benchmark['run_type'] == 'aggregate':\n continue\n times.append([get_timedelta_field_as_seconds(benchmark, 'real_time'),\n get_timedelta_field_as_seconds(benchmark, 'cpu_time')])\n return gmean(times) if times else array([])\n\n\ndef extract_field(partition, field_name):\n # The count of elements may be different. We want *all* of them.\n lhs = [x[field_name] for x in partition[0]]\n rhs = [x[field_name] for x in partition[1]]\n return [lhs, rhs]\n\n\ndef calc_utest(timings_cpu, timings_time):\n min_rep_cnt = min(len(timings_time[0]),\n len(timings_time[1]),\n len(timings_cpu[0]),\n len(timings_cpu[1]))\n\n # Does *everything* has at least UTEST_MIN_REPETITIONS repetitions?\n if min_rep_cnt < UTEST_MIN_REPETITIONS:\n return False, None, None\n\n time_pvalue = mannwhitneyu(\n timings_time[0], timings_time[1], alternative='two-sided').pvalue\n cpu_pvalue = mannwhitneyu(\n timings_cpu[0], timings_cpu[1], alternative='two-sided').pvalue\n\n return (min_rep_cnt >= UTEST_OPTIMAL_REPETITIONS), cpu_pvalue, time_pvalue\n\n\ndef print_utest(bc_name, utest, utest_alpha, first_col_width, use_color=True):\n def get_utest_color(pval):\n return BC_FAIL if pval >= utest_alpha else BC_OKGREEN\n\n # Check if we failed miserably with minimum required repetitions for utest\n if not utest['have_optimal_repetitions'] and utest['cpu_pvalue'] is None and utest['time_pvalue'] is None:\n return []\n\n dsc = \"U Test, Repetitions: {} vs {}\".format(\n utest['nr_of_repetitions'], utest['nr_of_repetitions_other'])\n dsc_color = BC_OKGREEN\n\n # We still got some results to show but issue a warning about it.\n if not utest['have_optimal_repetitions']:\n dsc_color = BC_WARNING\n dsc += \". WARNING: Results unreliable! {}+ repetitions recommended.\".format(\n UTEST_OPTIMAL_REPETITIONS)\n\n special_str = \"{}{:<{}s}{endc}{}{:16.4f}{endc}{}{:16.4f}{endc}{} {}\"\n\n return [color_format(use_color,\n special_str,\n BC_HEADER,\n \"{}{}\".format(bc_name, UTEST_COL_NAME),\n first_col_width,\n get_utest_color(\n utest['time_pvalue']), utest['time_pvalue'],\n get_utest_color(\n utest['cpu_pvalue']), utest['cpu_pvalue'],\n dsc_color, dsc,\n endc=BC_ENDC)]\n\n\ndef get_difference_report(\n json1,\n json2,\n utest=False):\n \"\"\"\n Calculate and report the difference between each test of two benchmarks\n runs specified as 'json1' and 'json2'. Output is another json containing\n relevant details for each test run.\n \"\"\"\n assert utest is True or utest is False\n\n diff_report = []\n partitions = partition_benchmarks(json1, json2)\n for partition in partitions:\n benchmark_name = partition[0][0]['name']\n label = partition[0][0]['label'] if 'label' in partition[0][0] else ''\n time_unit = partition[0][0]['time_unit']\n measurements = []\n utest_results = {}\n # Careful, we may have different repetition count.\n for i in range(min(len(partition[0]), len(partition[1]))):\n bn = partition[0][i]\n other_bench = partition[1][i]\n measurements.append({\n 'real_time': bn['real_time'],\n 'cpu_time': bn['cpu_time'],\n 'real_time_other': other_bench['real_time'],\n 'cpu_time_other': other_bench['cpu_time'],\n 'time': calculate_change(bn['real_time'], other_bench['real_time']),\n 'cpu': calculate_change(bn['cpu_time'], other_bench['cpu_time'])\n })\n\n # After processing the whole partition, if requested, do the U test.\n if utest:\n timings_cpu = extract_field(partition, 'cpu_time')\n timings_time = extract_field(partition, 'real_time')\n have_optimal_repetitions, cpu_pvalue, time_pvalue = calc_utest(\n timings_cpu, timings_time)\n if cpu_pvalue and time_pvalue:\n utest_results = {\n 'have_optimal_repetitions': have_optimal_repetitions,\n 'cpu_pvalue': cpu_pvalue,\n 'time_pvalue': time_pvalue,\n 'nr_of_repetitions': len(timings_cpu[0]),\n 'nr_of_repetitions_other': len(timings_cpu[1])\n }\n\n # Store only if we had any measurements for given benchmark.\n # E.g. partition_benchmarks will filter out the benchmarks having\n # time units which are not compatible with other time units in the\n # benchmark suite.\n if measurements:\n run_type = partition[0][0]['run_type'] if 'run_type' in partition[0][0] else ''\n aggregate_name = partition[0][0]['aggregate_name'] if run_type == 'aggregate' and 'aggregate_name' in partition[0][0] else ''\n diff_report.append({\n 'name': benchmark_name,\n 'label': label,\n 'measurements': measurements,\n 'time_unit': time_unit,\n 'run_type': run_type,\n 'aggregate_name': aggregate_name,\n 'utest': utest_results\n })\n\n lhs_gmean = calculate_geomean(json1)\n rhs_gmean = calculate_geomean(json2)\n if lhs_gmean.any() and rhs_gmean.any():\n diff_report.append({\n 'name': 'OVERALL_GEOMEAN',\n 'label': '',\n 'measurements': [{\n 'real_time': lhs_gmean[0],\n 'cpu_time': lhs_gmean[1],\n 'real_time_other': rhs_gmean[0],\n 'cpu_time_other': rhs_gmean[1],\n 'time': calculate_change(lhs_gmean[0], rhs_gmean[0]),\n 'cpu': calculate_change(lhs_gmean[1], rhs_gmean[1])\n }],\n 'time_unit': 's',\n 'run_type': 'aggregate',\n 'aggregate_name': 'geomean',\n 'utest': {}\n })\n\n return diff_report\n\n\ndef print_difference_report(\n json_diff_report,\n include_aggregates_only=False,\n utest=False,\n utest_alpha=0.05,\n use_color=True):\n \"\"\"\n Calculate and report the difference between each test of two benchmarks\n runs specified as 'json1' and 'json2'.\n \"\"\"\n assert utest is True or utest is False\n\n def get_color(res):\n if res > 0.05:\n return BC_FAIL\n elif res > -0.07:\n return BC_WHITE\n else:\n return BC_CYAN\n\n first_col_width = find_longest_name(json_diff_report)\n first_col_width = max(\n first_col_width,\n len('Benchmark'))\n first_col_width += len(UTEST_COL_NAME)\n first_line = \"{:<{}s}Time CPU Time Old Time New CPU Old CPU New\".format(\n 'Benchmark', 12 + first_col_width)\n output_strs = [first_line, '-' * len(first_line)]\n\n fmt_str = \"{}{:<{}s}{endc}{}{:+16.4f}{endc}{}{:+16.4f}{endc}{:14.0f}{:14.0f}{endc}{:14.0f}{:14.0f}\"\n for benchmark in json_diff_report:\n # *If* we were asked to only include aggregates,\n # and if it is non-aggregate, then don't print it.\n if not include_aggregates_only or not 'run_type' in benchmark or benchmark['run_type'] == 'aggregate':\n for measurement in benchmark['measurements']:\n output_strs += [color_format(use_color,\n fmt_str,\n BC_HEADER,\n benchmark['name'],\n first_col_width,\n get_color(measurement['time']),\n measurement['time'],\n get_color(measurement['cpu']),\n measurement['cpu'],\n measurement['real_time'],\n measurement['real_time_other'],\n measurement['cpu_time'],\n measurement['cpu_time_other'],\n endc=BC_ENDC)]\n\n # After processing the measurements, if requested and\n # if applicable (e.g. u-test exists for given benchmark),\n # print the U test.\n if utest and benchmark['utest']:\n output_strs += print_utest(benchmark['name'],\n benchmark['utest'],\n utest_alpha=utest_alpha,\n first_col_width=first_col_width,\n use_color=use_color)\n\n return output_strs\n\n\n###############################################################################\n# Unit tests\n\n\nclass TestGetUniqueBenchmarkNames(unittest.TestCase):\n def load_results(self):\n import json\n testInputs = os.path.join(\n os.path.dirname(\n os.path.realpath(__file__)),\n 'Inputs')\n testOutput = os.path.join(testInputs, 'test3_run0.json')\n with open(testOutput, 'r') as f:\n json = json.load(f)\n return json\n\n def test_basic(self):\n expect_lines = [\n 'BM_One',\n 'BM_Two',\n 'short', # These two are not sorted\n 'medium', # These two are not sorted\n ]\n json = self.load_results()\n output_lines = get_unique_benchmark_names(json)\n print(\"\\n\")\n print(\"\\n\".join(output_lines))\n self.assertEqual(len(output_lines), len(expect_lines))\n for i in range(0, len(output_lines)):\n self.assertEqual(expect_lines[i], output_lines[i])\n\n\nclass TestReportDifference(unittest.TestCase):\n @classmethod\n def setUpClass(cls):\n def load_results():\n import json\n testInputs = os.path.join(\n os.path.dirname(\n os.path.realpath(__file__)),\n 'Inputs')\n testOutput1 = os.path.join(testInputs, 'test1_run1.json')\n testOutput2 = os.path.join(testInputs, 'test1_run2.json')\n with open(testOutput1, 'r') as f:\n json1 = json.load(f)\n with open(testOutput2, 'r') as f:\n json2 = json.load(f)\n return json1, json2\n\n json1, json2 = load_results()\n cls.json_diff_report = get_difference_report(json1, json2)\n\n def test_json_diff_report_pretty_printing(self):\n expect_lines = [\n ['BM_SameTimes', '+0.0000', '+0.0000', '10', '10', '10', '10'],\n ['BM_2xFaster', '-0.5000', '-0.5000', '50', '25', '50', '25'],\n ['BM_2xSlower', '+1.0000', '+1.0000', '50', '100', '50', '100'],\n ['BM_1PercentFaster', '-0.0100', '-0.0100', '100', '99', '100', '99'],\n ['BM_1PercentSlower', '+0.0100', '+0.0100', '100', '101', '100', '101'],\n ['BM_10PercentFaster', '-0.1000', '-0.1000', '100', '90', '100', '90'],\n ['BM_10PercentSlower', '+0.1000', '+0.1000', '100', '110', '100', '110'],\n ['BM_100xSlower', '+99.0000', '+99.0000',\n '100', '10000', '100', '10000'],\n ['BM_100xFaster', '-0.9900', '-0.9900',\n '10000', '100', '10000', '100'],\n ['BM_10PercentCPUToTime', '+0.1000',\n '-0.1000', '100', '110', '100', '90'],\n ['BM_ThirdFaster', '-0.3333', '-0.3334', '100', '67', '100', '67'],\n ['BM_NotBadTimeUnit', '-0.9000', '+0.2000', '0', '0', '0', '1'],\n ['BM_hasLabel', '+0.0000', '+0.0000', '1', '1', '1', '1'],\n ['OVERALL_GEOMEAN', '-0.8113', '-0.7779', '0', '0', '0', '0']\n ]\n output_lines_with_header = print_difference_report(\n self.json_diff_report, use_color=False)\n output_lines = output_lines_with_header[2:]\n print(\"\\n\")\n print(\"\\n\".join(output_lines_with_header))\n self.assertEqual(len(output_lines), len(expect_lines))\n for i in range(0, len(output_lines)):\n parts = [x for x in output_lines[i].split(' ') if x]\n self.assertEqual(len(parts), 7)\n self.assertEqual(expect_lines[i], parts)\n\n def test_json_diff_report_output(self):\n expected_output = [\n {\n 'name': 'BM_SameTimes',\n 'label': '',\n 'measurements': [{'time': 0.0000, 'cpu': 0.0000,\n 'real_time': 10, 'real_time_other': 10,\n 'cpu_time': 10, 'cpu_time_other': 10}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_2xFaster',\n 'label': '',\n 'measurements': [{'time': -0.5000, 'cpu': -0.5000,\n 'real_time': 50, 'real_time_other': 25,\n 'cpu_time': 50, 'cpu_time_other': 25}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_2xSlower',\n 'label': '',\n 'measurements': [{'time': 1.0000, 'cpu': 1.0000,\n 'real_time': 50, 'real_time_other': 100,\n 'cpu_time': 50, 'cpu_time_other': 100}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_1PercentFaster',\n 'label': '',\n 'measurements': [{'time': -0.0100, 'cpu': -0.0100,\n 'real_time': 100, 'real_time_other': 98.9999999,\n 'cpu_time': 100, 'cpu_time_other': 98.9999999}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_1PercentSlower',\n 'label': '',\n 'measurements': [{'time': 0.0100, 'cpu': 0.0100,\n 'real_time': 100, 'real_time_other': 101,\n 'cpu_time': 100, 'cpu_time_other': 101}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_10PercentFaster',\n 'label': '',\n 'measurements': [{'time': -0.1000, 'cpu': -0.1000,\n 'real_time': 100, 'real_time_other': 90,\n 'cpu_time': 100, 'cpu_time_other': 90}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_10PercentSlower',\n 'label': '',\n 'measurements': [{'time': 0.1000, 'cpu': 0.1000,\n 'real_time': 100, 'real_time_other': 110,\n 'cpu_time': 100, 'cpu_time_other': 110}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_100xSlower',\n 'label': '',\n 'measurements': [{'time': 99.0000, 'cpu': 99.0000,\n 'real_time': 100, 'real_time_other': 10000,\n 'cpu_time': 100, 'cpu_time_other': 10000}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_100xFaster',\n 'label': '',\n 'measurements': [{'time': -0.9900, 'cpu': -0.9900,\n 'real_time': 10000, 'real_time_other': 100,\n 'cpu_time': 10000, 'cpu_time_other': 100}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_10PercentCPUToTime',\n 'label': '',\n 'measurements': [{'time': 0.1000, 'cpu': -0.1000,\n 'real_time': 100, 'real_time_other': 110,\n 'cpu_time': 100, 'cpu_time_other': 90}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_ThirdFaster',\n 'label': '',\n 'measurements': [{'time': -0.3333, 'cpu': -0.3334,\n 'real_time': 100, 'real_time_other': 67,\n 'cpu_time': 100, 'cpu_time_other': 67}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'BM_NotBadTimeUnit',\n 'label': '',\n 'measurements': [{'time': -0.9000, 'cpu': 0.2000,\n 'real_time': 0.4, 'real_time_other': 0.04,\n 'cpu_time': 0.5, 'cpu_time_other': 0.6}],\n 'time_unit': 's',\n 'utest': {}\n },\n {\n 'name': 'BM_hasLabel',\n 'label': 'a label',\n 'measurements': [{'time': 0.0000, 'cpu': 0.0000,\n 'real_time': 1, 'real_time_other': 1,\n 'cpu_time': 1, 'cpu_time_other': 1}],\n 'time_unit': 's',\n 'utest': {}\n },\n {\n 'name': 'OVERALL_GEOMEAN',\n 'label': '',\n 'measurements': [{'real_time': 3.1622776601683826e-06, 'cpu_time': 3.2130844755623912e-06,\n 'real_time_other': 1.9768988699420897e-07, 'cpu_time_other': 2.397447755209533e-07,\n 'time': -0.8112976497120911, 'cpu': -0.7778551721181174}],\n 'time_unit': 's',\n 'run_type': 'aggregate',\n 'aggregate_name': 'geomean', 'utest': {}\n },\n ]\n self.assertEqual(len(self.json_diff_report), len(expected_output))\n for out, expected in zip(\n self.json_diff_report, expected_output):\n self.assertEqual(out['name'], expected['name'])\n self.assertEqual(out['label'], expected['label'])\n self.assertEqual(out['time_unit'], expected['time_unit'])\n assert_utest(self, out, expected)\n assert_measurements(self, out, expected)\n\n\nclass TestReportDifferenceBetweenFamilies(unittest.TestCase):\n @classmethod\n def setUpClass(cls):\n def load_result():\n import json\n testInputs = os.path.join(\n os.path.dirname(\n os.path.realpath(__file__)),\n 'Inputs')\n testOutput = os.path.join(testInputs, 'test2_run.json')\n with open(testOutput, 'r') as f:\n json = json.load(f)\n return json\n\n json = load_result()\n json1 = filter_benchmark(json, \"BM_Z.ro\", \".\")\n json2 = filter_benchmark(json, \"BM_O.e\", \".\")\n cls.json_diff_report = get_difference_report(json1, json2)\n\n def test_json_diff_report_pretty_printing(self):\n expect_lines = [\n ['.', '-0.5000', '-0.5000', '10', '5', '10', '5'],\n ['./4', '-0.5000', '-0.5000', '40', '20', '40', '20'],\n ['Prefix/.', '-0.5000', '-0.5000', '20', '10', '20', '10'],\n ['Prefix/./3', '-0.5000', '-0.5000', '30', '15', '30', '15'],\n ['OVERALL_GEOMEAN', '-0.5000', '-0.5000', '0', '0', '0', '0']\n ]\n output_lines_with_header = print_difference_report(\n self.json_diff_report, use_color=False)\n output_lines = output_lines_with_header[2:]\n print(\"\\n\")\n print(\"\\n\".join(output_lines_with_header))\n self.assertEqual(len(output_lines), len(expect_lines))\n for i in range(0, len(output_lines)):\n parts = [x for x in output_lines[i].split(' ') if x]\n self.assertEqual(len(parts), 7)\n self.assertEqual(expect_lines[i], parts)\n\n def test_json_diff_report(self):\n expected_output = [\n {\n 'name': u'.',\n 'measurements': [{'time': -0.5, 'cpu': -0.5, 'real_time': 10, 'real_time_other': 5, 'cpu_time': 10, 'cpu_time_other': 5}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': u'./4',\n 'measurements': [{'time': -0.5, 'cpu': -0.5, 'real_time': 40, 'real_time_other': 20, 'cpu_time': 40, 'cpu_time_other': 20}],\n 'time_unit': 'ns',\n 'utest': {},\n },\n {\n 'name': u'Prefix/.',\n 'measurements': [{'time': -0.5, 'cpu': -0.5, 'real_time': 20, 'real_time_other': 10, 'cpu_time': 20, 'cpu_time_other': 10}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': u'Prefix/./3',\n 'measurements': [{'time': -0.5, 'cpu': -0.5, 'real_time': 30, 'real_time_other': 15, 'cpu_time': 30, 'cpu_time_other': 15}],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'OVERALL_GEOMEAN',\n 'measurements': [{'real_time': 2.213363839400641e-08, 'cpu_time': 2.213363839400641e-08,\n 'real_time_other': 1.1066819197003185e-08, 'cpu_time_other': 1.1066819197003185e-08,\n 'time': -0.5000000000000009, 'cpu': -0.5000000000000009}],\n 'time_unit': 's',\n 'run_type': 'aggregate',\n 'aggregate_name': 'geomean',\n 'utest': {}\n }\n ]\n self.assertEqual(len(self.json_diff_report), len(expected_output))\n for out, expected in zip(\n self.json_diff_report, expected_output):\n self.assertEqual(out['name'], expected['name'])\n self.assertEqual(out['time_unit'], expected['time_unit'])\n assert_utest(self, out, expected)\n assert_measurements(self, out, expected)\n\n\nclass TestReportDifferenceWithUTest(unittest.TestCase):\n @classmethod\n def setUpClass(cls):\n def load_results():\n import json\n testInputs = os.path.join(\n os.path.dirname(\n os.path.realpath(__file__)),\n 'Inputs')\n testOutput1 = os.path.join(testInputs, 'test3_run0.json')\n testOutput2 = os.path.join(testInputs, 'test3_run1.json')\n with open(testOutput1, 'r') as f:\n json1 = json.load(f)\n with open(testOutput2, 'r') as f:\n json2 = json.load(f)\n return json1, json2\n\n json1, json2 = load_results()\n cls.json_diff_report = get_difference_report(\n json1, json2, utest=True)\n\n def test_json_diff_report_pretty_printing(self):\n expect_lines = [\n ['BM_One', '-0.1000', '+0.1000', '10', '9', '100', '110'],\n ['BM_Two', '+0.1111', '-0.0111', '9', '10', '90', '89'],\n ['BM_Two', '-0.1250', '-0.1628', '8', '7', '86', '72'],\n ['BM_Two_pvalue',\n '1.0000',\n '0.6667',\n 'U',\n 'Test,',\n 'Repetitions:',\n '2',\n 'vs',\n '2.',\n 'WARNING:',\n 'Results',\n 'unreliable!',\n '9+',\n 'repetitions',\n 'recommended.'],\n ['short', '-0.1250', '-0.0625', '8', '7', '80', '75'],\n ['short', '-0.4325', '-0.1351', '8', '5', '77', '67'],\n ['short_pvalue',\n '0.7671',\n '0.2000',\n 'U',\n 'Test,',\n 'Repetitions:',\n '2',\n 'vs',\n '3.',\n 'WARNING:',\n 'Results',\n 'unreliable!',\n '9+',\n 'repetitions',\n 'recommended.'],\n ['medium', '-0.3750', '-0.3375', '8', '5', '80', '53'],\n ['OVERALL_GEOMEAN', '+1.6405', '-0.6985', '0', '0', '0', '0']\n ]\n output_lines_with_header = print_difference_report(\n self.json_diff_report, utest=True, utest_alpha=0.05, use_color=False)\n output_lines = output_lines_with_header[2:]\n print(\"\\n\")\n print(\"\\n\".join(output_lines_with_header))\n self.assertEqual(len(output_lines), len(expect_lines))\n for i in range(0, len(output_lines)):\n parts = [x for x in output_lines[i].split(' ') if x]\n self.assertEqual(expect_lines[i], parts)\n\n def test_json_diff_report_pretty_printing_aggregates_only(self):\n expect_lines = [\n ['BM_One', '-0.1000', '+0.1000', '10', '9', '100', '110'],\n ['BM_Two_pvalue',\n '1.0000',\n '0.6667',\n 'U',\n 'Test,',\n 'Repetitions:',\n '2',\n 'vs',\n '2.',\n 'WARNING:',\n 'Results',\n 'unreliable!',\n '9+',\n 'repetitions',\n 'recommended.'],\n ['short', '-0.1250', '-0.0625', '8', '7', '80', '75'],\n ['short', '-0.4325', '-0.1351', '8', '5', '77', '67'],\n ['short_pvalue',\n '0.7671',\n '0.2000',\n 'U',\n 'Test,',\n 'Repetitions:',\n '2',\n 'vs',\n '3.',\n 'WARNING:',\n 'Results',\n 'unreliable!',\n '9+',\n 'repetitions',\n 'recommended.'],\n ['OVERALL_GEOMEAN', '+1.6405', '-0.6985', '0', '0', '0', '0']\n ]\n output_lines_with_header = print_difference_report(\n self.json_diff_report, include_aggregates_only=True, utest=True, utest_alpha=0.05, use_color=False)\n output_lines = output_lines_with_header[2:]\n print(\"\\n\")\n print(\"\\n\".join(output_lines_with_header))\n self.assertEqual(len(output_lines), len(expect_lines))\n for i in range(0, len(output_lines)):\n parts = [x for x in output_lines[i].split(' ') if x]\n self.assertEqual(expect_lines[i], parts)\n\n def test_json_diff_report(self):\n expected_output = [\n {\n 'name': u'BM_One',\n 'measurements': [\n {'time': -0.1,\n 'cpu': 0.1,\n 'real_time': 10,\n 'real_time_other': 9,\n 'cpu_time': 100,\n 'cpu_time_other': 110}\n ],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': u'BM_Two',\n 'measurements': [\n {'time': 0.1111111111111111,\n 'cpu': -0.011111111111111112,\n 'real_time': 9,\n 'real_time_other': 10,\n 'cpu_time': 90,\n 'cpu_time_other': 89},\n {'time': -0.125, 'cpu': -0.16279069767441862, 'real_time': 8,\n 'real_time_other': 7, 'cpu_time': 86, 'cpu_time_other': 72}\n ],\n 'time_unit': 'ns',\n 'utest': {\n 'have_optimal_repetitions': False, 'cpu_pvalue': 0.6666666666666666, 'time_pvalue': 1.0\n }\n },\n {\n 'name': u'short',\n 'measurements': [\n {'time': -0.125,\n 'cpu': -0.0625,\n 'real_time': 8,\n 'real_time_other': 7,\n 'cpu_time': 80,\n 'cpu_time_other': 75},\n {'time': -0.4325,\n 'cpu': -0.13506493506493514,\n 'real_time': 8,\n 'real_time_other': 4.54,\n 'cpu_time': 77,\n 'cpu_time_other': 66.6}\n ],\n 'time_unit': 'ns',\n 'utest': {\n 'have_optimal_repetitions': False, 'cpu_pvalue': 0.2, 'time_pvalue': 0.7670968684102772\n }\n },\n {\n 'name': u'medium',\n 'measurements': [\n {'time': -0.375,\n 'cpu': -0.3375,\n 'real_time': 8,\n 'real_time_other': 5,\n 'cpu_time': 80,\n 'cpu_time_other': 53}\n ],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': 'OVERALL_GEOMEAN',\n 'measurements': [{'real_time': 8.48528137423858e-09, 'cpu_time': 8.441336246629233e-08,\n 'real_time_other': 2.2405267593145244e-08, 'cpu_time_other': 2.5453661413660466e-08,\n 'time': 1.6404861082353634, 'cpu': -0.6984640740519662}],\n 'time_unit': 's',\n 'run_type': 'aggregate',\n 'aggregate_name': 'geomean',\n 'utest': {}\n }\n ]\n self.assertEqual(len(self.json_diff_report), len(expected_output))\n for out, expected in zip(\n self.json_diff_report, expected_output):\n self.assertEqual(out['name'], expected['name'])\n self.assertEqual(out['time_unit'], expected['time_unit'])\n assert_utest(self, out, expected)\n assert_measurements(self, out, expected)\n\n\nclass TestReportDifferenceWithUTestWhileDisplayingAggregatesOnly(\n unittest.TestCase):\n @classmethod\n def setUpClass(cls):\n def load_results():\n import json\n testInputs = os.path.join(\n os.path.dirname(\n os.path.realpath(__file__)),\n 'Inputs')\n testOutput1 = os.path.join(testInputs, 'test3_run0.json')\n testOutput2 = os.path.join(testInputs, 'test3_run1.json')\n with open(testOutput1, 'r') as f:\n json1 = json.load(f)\n with open(testOutput2, 'r') as f:\n json2 = json.load(f)\n return json1, json2\n\n json1, json2 = load_results()\n cls.json_diff_report = get_difference_report(\n json1, json2, utest=True)\n\n def test_json_diff_report_pretty_printing(self):\n expect_lines = [\n ['BM_One', '-0.1000', '+0.1000', '10', '9', '100', '110'],\n ['BM_Two', '+0.1111', '-0.0111', '9', '10', '90', '89'],\n ['BM_Two', '-0.1250', '-0.1628', '8', '7', '86', '72'],\n ['BM_Two_pvalue',\n '1.0000',\n '0.6667',\n 'U',\n 'Test,',\n 'Repetitions:',\n '2',\n 'vs',\n '2.',\n 'WARNING:',\n 'Results',\n 'unreliable!',\n '9+',\n 'repetitions',\n 'recommended.'],\n ['short', '-0.1250', '-0.0625', '8', '7', '80', '75'],\n ['short', '-0.4325', '-0.1351', '8', '5', '77', '67'],\n ['short_pvalue',\n '0.7671',\n '0.2000',\n 'U',\n 'Test,',\n 'Repetitions:',\n '2',\n 'vs',\n '3.',\n 'WARNING:',\n 'Results',\n 'unreliable!',\n '9+',\n 'repetitions',\n 'recommended.'],\n ['medium', '-0.3750', '-0.3375', '8', '5', '80', '53'],\n ['OVERALL_GEOMEAN', '+1.6405', '-0.6985', '0', '0', '0', '0']\n ]\n output_lines_with_header = print_difference_report(\n self.json_diff_report,\n utest=True, utest_alpha=0.05, use_color=False)\n output_lines = output_lines_with_header[2:]\n print(\"\\n\")\n print(\"\\n\".join(output_lines_with_header))\n self.assertEqual(len(output_lines), len(expect_lines))\n for i in range(0, len(output_lines)):\n parts = [x for x in output_lines[i].split(' ') if x]\n self.assertEqual(expect_lines[i], parts)\n\n def test_json_diff_report(self):\n expected_output = [\n {\n 'name': u'BM_One',\n 'measurements': [\n {'time': -0.1,\n 'cpu': 0.1,\n 'real_time': 10,\n 'real_time_other': 9,\n 'cpu_time': 100,\n 'cpu_time_other': 110}\n ],\n 'time_unit': 'ns',\n 'utest': {}\n },\n {\n 'name': u'BM_Two',\n 'measurements': [\n {'time': 0.1111111111111111,\n 'cpu': -0.011111111111111112,\n 'real_time': 9,\n 'real_time_other': 10,\n 'cpu_time': 90,\n 'cpu_time_other': 89},\n {'time': -0.125, 'cpu': -0.16279069767441862, 'real_time': 8,\n 'real_time_other': 7, 'cpu_time': 86, 'cpu_time_other': 72}\n ],\n 'time_unit': 'ns',\n 'utest': {\n 'have_optimal_repetitions': False, 'cpu_pvalue': 0.6666666666666666, 'time_pvalue': 1.0\n }\n },\n {\n 'name': u'short',\n 'measurements': [\n {'time': -0.125,\n 'cpu': -0.0625,\n 'real_time': 8,\n 'real_time_other': 7,\n 'cpu_time': 80,\n 'cpu_time_other': 75},\n {'time': -0.4325,\n 'cpu': -0.13506493506493514,\n 'real_time': 8,\n 'real_time_other': 4.54,\n 'cpu_time': 77,\n 'cpu_time_other': 66.6}\n ],\n 'time_unit': 'ns',\n 'utest': {\n 'have_optimal_repetitions': False, 'cpu_pvalue': 0.2, 'time_pvalue': 0.7670968684102772\n }\n },\n {\n 'name': u'medium',\n 'measurements': [\n {'real_time_other': 5,\n 'cpu_time': 80,\n 'time': -0.375,\n 'real_time': 8,\n 'cpu_time_other': 53,\n 'cpu': -0.3375\n }\n ],\n 'utest': {},\n 'time_unit': u'ns',\n 'aggregate_name': ''\n },\n {\n 'name': 'OVERALL_GEOMEAN',\n 'measurements': [{'real_time': 8.48528137423858e-09, 'cpu_time': 8.441336246629233e-08,\n 'real_time_other': 2.2405267593145244e-08, 'cpu_time_other': 2.5453661413660466e-08,\n 'time': 1.6404861082353634, 'cpu': -0.6984640740519662}],\n 'time_unit': 's',\n 'run_type': 'aggregate',\n 'aggregate_name': 'geomean',\n 'utest': {}\n }\n ]\n self.assertEqual(len(self.json_diff_report), len(expected_output))\n for out, expected in zip(\n self.json_diff_report, expected_output):\n self.assertEqual(out['name'], expected['name'])\n self.assertEqual(out['time_unit'], expected['time_unit'])\n assert_utest(self, out, expected)\n assert_measurements(self, out, expected)\n\n\nclass TestReportDifferenceForPercentageAggregates(\n unittest.TestCase):\n @classmethod\n def setUpClass(cls):\n def load_results():\n import json\n testInputs = os.path.join(\n os.path.dirname(\n os.path.realpath(__file__)),\n 'Inputs')\n testOutput1 = os.path.join(testInputs, 'test4_run0.json')\n testOutput2 = os.path.join(testInputs, 'test4_run1.json')\n with open(testOutput1, 'r') as f:\n json1 = json.load(f)\n with open(testOutput2, 'r') as f:\n json2 = json.load(f)\n return json1, json2\n\n json1, json2 = load_results()\n cls.json_diff_report = get_difference_report(\n json1, json2, utest=True)\n\n def test_json_diff_report_pretty_printing(self):\n expect_lines = [\n ['whocares', '-0.5000', '+0.5000', '0', '0', '0', '0']\n ]\n output_lines_with_header = print_difference_report(\n self.json_diff_report,\n utest=True, utest_alpha=0.05, use_color=False)\n output_lines = output_lines_with_header[2:]\n print(\"\\n\")\n print(\"\\n\".join(output_lines_with_header))\n self.assertEqual(len(output_lines), len(expect_lines))\n for i in range(0, len(output_lines)):\n parts = [x for x in output_lines[i].split(' ') if x]\n self.assertEqual(expect_lines[i], parts)\n\n def test_json_diff_report(self):\n expected_output = [\n {\n 'name': u'whocares',\n 'measurements': [\n {'time': -0.5,\n 'cpu': 0.5,\n 'real_time': 0.01,\n 'real_time_other': 0.005,\n 'cpu_time': 0.10,\n 'cpu_time_other': 0.15}\n ],\n 'time_unit': 'ns',\n 'utest': {}\n }\n ]\n self.assertEqual(len(self.json_diff_report), len(expected_output))\n for out, expected in zip(\n self.json_diff_report, expected_output):\n self.assertEqual(out['name'], expected['name'])\n self.assertEqual(out['time_unit'], expected['time_unit'])\n assert_utest(self, out, expected)\n assert_measurements(self, out, expected)\n\n\nclass TestReportSorting(unittest.TestCase):\n @classmethod\n def setUpClass(cls):\n def load_result():\n import json\n testInputs = os.path.join(\n os.path.dirname(\n os.path.realpath(__file__)),\n 'Inputs')\n testOutput = os.path.join(testInputs, 'test4_run.json')\n with open(testOutput, 'r') as f:\n json = json.load(f)\n return json\n\n cls.json = load_result()\n\n def test_json_diff_report_pretty_printing(self):\n import util\n\n expected_names = [\n \"99 family 0 instance 0 repetition 0\",\n \"98 family 0 instance 0 repetition 1\",\n \"97 family 0 instance 0 aggregate\",\n \"96 family 0 instance 1 repetition 0\",\n \"95 family 0 instance 1 repetition 1\",\n \"94 family 0 instance 1 aggregate\",\n \"93 family 1 instance 0 repetition 0\",\n \"92 family 1 instance 0 repetition 1\",\n \"91 family 1 instance 0 aggregate\",\n \"90 family 1 instance 1 repetition 0\",\n \"89 family 1 instance 1 repetition 1\",\n \"88 family 1 instance 1 aggregate\"\n ]\n\n for n in range(len(self.json['benchmarks']) ** 2):\n random.shuffle(self.json['benchmarks'])\n sorted_benchmarks = util.sort_benchmark_results(self.json)[\n 'benchmarks']\n self.assertEqual(len(expected_names), len(sorted_benchmarks))\n for out, expected in zip(sorted_benchmarks, expected_names):\n self.assertEqual(out['name'], expected)\n\n\ndef assert_utest(unittest_instance, lhs, rhs):\n if lhs['utest']:\n unittest_instance.assertAlmostEqual(\n lhs['utest']['cpu_pvalue'],\n rhs['utest']['cpu_pvalue'])\n unittest_instance.assertAlmostEqual(\n lhs['utest']['time_pvalue'],\n rhs['utest']['time_pvalue'])\n unittest_instance.assertEqual(\n lhs['utest']['have_optimal_repetitions'],\n rhs['utest']['have_optimal_repetitions'])\n else:\n # lhs is empty. assert if rhs is not.\n unittest_instance.assertEqual(lhs['utest'], rhs['utest'])\n\n\ndef assert_measurements(unittest_instance, lhs, rhs):\n for m1, m2 in zip(lhs['measurements'], rhs['measurements']):\n unittest_instance.assertEqual(m1['real_time'], m2['real_time'])\n unittest_instance.assertEqual(m1['cpu_time'], m2['cpu_time'])\n # m1['time'] and m1['cpu'] hold values which are being calculated,\n # and therefore we must use almost-equal pattern.\n unittest_instance.assertAlmostEqual(m1['time'], m2['time'], places=4)\n unittest_instance.assertAlmostEqual(m1['cpu'], m2['cpu'], places=4)\n\n\nif __name__ == '__main__':\n unittest.main()\n\n# vim: tabstop=4 expandtab shiftwidth=4 softtabstop=4\n# kate: tab-width: 4; replace-tabs on; indent-width 4; tab-indents: off;\n# kate: indent-mode python; remove-trailing-spaces modified;\n" }, { "path": "3rd/benchmark-1.8.2/tools/gbench/util.py", "content": "\"\"\"util.py - General utilities for running, loading, and processing benchmarks\n\"\"\"\nimport json\nimport os\nimport re\nimport subprocess\nimport sys\nimport tempfile\n\n\n# Input file type enumeration\nIT_Invalid = 0\nIT_JSON = 1\nIT_Executable = 2\n\n_num_magic_bytes = 2 if sys.platform.startswith('win') else 4\n\n\ndef is_executable_file(filename):\n \"\"\"\n Return 'True' if 'filename' names a valid file which is likely\n an executable. A file is considered an executable if it starts with the\n magic bytes for a EXE, Mach O, or ELF file.\n \"\"\"\n if not os.path.isfile(filename):\n return False\n with open(filename, mode='rb') as f:\n magic_bytes = f.read(_num_magic_bytes)\n if sys.platform == 'darwin':\n return magic_bytes in [\n b'\\xfe\\xed\\xfa\\xce', # MH_MAGIC\n b'\\xce\\xfa\\xed\\xfe', # MH_CIGAM\n b'\\xfe\\xed\\xfa\\xcf', # MH_MAGIC_64\n b'\\xcf\\xfa\\xed\\xfe', # MH_CIGAM_64\n b'\\xca\\xfe\\xba\\xbe', # FAT_MAGIC\n b'\\xbe\\xba\\xfe\\xca' # FAT_CIGAM\n ]\n elif sys.platform.startswith('win'):\n return magic_bytes == b'MZ'\n else:\n return magic_bytes == b'\\x7FELF'\n\n\ndef is_json_file(filename):\n \"\"\"\n Returns 'True' if 'filename' names a valid JSON output file.\n 'False' otherwise.\n \"\"\"\n try:\n with open(filename, 'r') as f:\n json.load(f)\n return True\n except BaseException:\n pass\n return False\n\n\ndef classify_input_file(filename):\n \"\"\"\n Return a tuple (type, msg) where 'type' specifies the classified type\n of 'filename'. If 'type' is 'IT_Invalid' then 'msg' is a human readable\n string representing the error.\n \"\"\"\n ftype = IT_Invalid\n err_msg = None\n if not os.path.exists(filename):\n err_msg = \"'%s' does not exist\" % filename\n elif not os.path.isfile(filename):\n err_msg = \"'%s' does not name a file\" % filename\n elif is_executable_file(filename):\n ftype = IT_Executable\n elif is_json_file(filename):\n ftype = IT_JSON\n else:\n err_msg = \"'%s' does not name a valid benchmark executable or JSON file\" % filename\n return ftype, err_msg\n\n\ndef check_input_file(filename):\n \"\"\"\n Classify the file named by 'filename' and return the classification.\n If the file is classified as 'IT_Invalid' print an error message and exit\n the program.\n \"\"\"\n ftype, msg = classify_input_file(filename)\n if ftype == IT_Invalid:\n print(\"Invalid input file: %s\" % msg)\n sys.exit(1)\n return ftype\n\n\ndef find_benchmark_flag(prefix, benchmark_flags):\n \"\"\"\n Search the specified list of flags for a flag matching `` and\n if it is found return the arg it specifies. If specified more than once the\n last value is returned. If the flag is not found None is returned.\n \"\"\"\n assert prefix.startswith('--') and prefix.endswith('=')\n result = None\n for f in benchmark_flags:\n if f.startswith(prefix):\n result = f[len(prefix):]\n return result\n\n\ndef remove_benchmark_flags(prefix, benchmark_flags):\n \"\"\"\n Return a new list containing the specified benchmark_flags except those\n with the specified prefix.\n \"\"\"\n assert prefix.startswith('--') and prefix.endswith('=')\n return [f for f in benchmark_flags if not f.startswith(prefix)]\n\n\ndef load_benchmark_results(fname, benchmark_filter):\n \"\"\"\n Read benchmark output from a file and return the JSON object.\n\n Apply benchmark_filter, a regular expression, with nearly the same\n semantics of the --benchmark_filter argument. May be None.\n Note: the Python regular expression engine is used instead of the\n one used by the C++ code, which may produce different results\n in complex cases.\n\n REQUIRES: 'fname' names a file containing JSON benchmark output.\n \"\"\"\n def benchmark_wanted(benchmark):\n if benchmark_filter is None:\n return True\n name = benchmark.get('run_name', None) or benchmark['name']\n if re.search(benchmark_filter, name):\n return True\n return False\n\n with open(fname, 'r') as f:\n results = json.load(f)\n if 'benchmarks' in results:\n results['benchmarks'] = list(filter(benchmark_wanted,\n results['benchmarks']))\n return results\n\n\ndef sort_benchmark_results(result):\n benchmarks = result['benchmarks']\n\n # From inner key to the outer key!\n benchmarks = sorted(\n benchmarks, key=lambda benchmark: benchmark['repetition_index'] if 'repetition_index' in benchmark else -1)\n benchmarks = sorted(\n benchmarks, key=lambda benchmark: 1 if 'run_type' in benchmark and benchmark['run_type'] == \"aggregate\" else 0)\n benchmarks = sorted(\n benchmarks, key=lambda benchmark: benchmark['per_family_instance_index'] if 'per_family_instance_index' in benchmark else -1)\n benchmarks = sorted(\n benchmarks, key=lambda benchmark: benchmark['family_index'] if 'family_index' in benchmark else -1)\n\n result['benchmarks'] = benchmarks\n return result\n\n\ndef run_benchmark(exe_name, benchmark_flags):\n \"\"\"\n Run a benchmark specified by 'exe_name' with the specified\n 'benchmark_flags'. The benchmark is run directly as a subprocess to preserve\n real time console output.\n RETURNS: A JSON object representing the benchmark output\n \"\"\"\n output_name = find_benchmark_flag('--benchmark_out=',\n benchmark_flags)\n is_temp_output = False\n if output_name is None:\n is_temp_output = True\n thandle, output_name = tempfile.mkstemp()\n os.close(thandle)\n benchmark_flags = list(benchmark_flags) + \\\n ['--benchmark_out=%s' % output_name]\n\n cmd = [exe_name] + benchmark_flags\n print(\"RUNNING: %s\" % ' '.join(cmd))\n exitCode = subprocess.call(cmd)\n if exitCode != 0:\n print('TEST FAILED...')\n sys.exit(exitCode)\n json_res = load_benchmark_results(output_name, None)\n if is_temp_output:\n os.unlink(output_name)\n return json_res\n\n\ndef run_or_load_benchmark(filename, benchmark_flags):\n \"\"\"\n Get the results for a specified benchmark. If 'filename' specifies\n an executable benchmark then the results are generated by running the\n benchmark. Otherwise 'filename' must name a valid JSON output file,\n which is loaded and the result returned.\n \"\"\"\n ftype = check_input_file(filename)\n if ftype == IT_JSON:\n benchmark_filter = find_benchmark_flag('--benchmark_filter=',\n benchmark_flags)\n return load_benchmark_results(filename, benchmark_filter)\n if ftype == IT_Executable:\n return run_benchmark(filename, benchmark_flags)\n raise ValueError('Unknown file type %s' % ftype)\n" }, { "path": "3rd/benchmark-1.8.2/tools/libpfm.BUILD.bazel", "content": "# Build rule for libpfm, which is required to collect performance counters for\n# BENCHMARK_ENABLE_LIBPFM builds.\n\nload(\"@rules_foreign_cc//foreign_cc:defs.bzl\", \"make\")\n\nfilegroup(\n name = \"pfm_srcs\",\n srcs = glob([\"**\"]),\n)\n\nmake(\n name = \"libpfm\",\n lib_source = \":pfm_srcs\",\n lib_name = \"libpfm\",\n copts = [\n \"-Wno-format-truncation\",\n \"-Wno-use-after-free\",\n ],\n visibility = [\n \"//visibility:public\",\n ],\n)\n" }, { "path": "3rd/benchmark-1.8.2/tools/requirements.txt", "content": "numpy == 1.25\nscipy == 1.5.4\n" }, { "path": "3rd/benchmark-1.8.2/tools/strip_asm.py", "content": "#!/usr/bin/env python3\n\n\"\"\"\nstrip_asm.py - Cleanup ASM output for the specified file\n\"\"\"\n\nfrom argparse import ArgumentParser\nimport sys\nimport os\nimport re\n\ndef find_used_labels(asm):\n found = set()\n label_re = re.compile(\"\\s*j[a-z]+\\s+\\.L([a-zA-Z0-9][a-zA-Z0-9_]*)\")\n for l in asm.splitlines():\n m = label_re.match(l)\n if m:\n found.add('.L%s' % m.group(1))\n return found\n\n\ndef normalize_labels(asm):\n decls = set()\n label_decl = re.compile(\"^[.]{0,1}L([a-zA-Z0-9][a-zA-Z0-9_]*)(?=:)\")\n for l in asm.splitlines():\n m = label_decl.match(l)\n if m:\n decls.add(m.group(0))\n if len(decls) == 0:\n return asm\n needs_dot = next(iter(decls))[0] != '.'\n if not needs_dot:\n return asm\n for ld in decls:\n asm = re.sub(\"(^|\\s+)\" + ld + \"(?=:|\\s)\", '\\\\1.' + ld, asm)\n return asm\n\n\ndef transform_labels(asm):\n asm = normalize_labels(asm)\n used_decls = find_used_labels(asm)\n new_asm = ''\n label_decl = re.compile(\"^\\.L([a-zA-Z0-9][a-zA-Z0-9_]*)(?=:)\")\n for l in asm.splitlines():\n m = label_decl.match(l)\n if not m or m.group(0) in used_decls:\n new_asm += l\n new_asm += '\\n'\n return new_asm\n\n\ndef is_identifier(tk):\n if len(tk) == 0:\n return False\n first = tk[0]\n if not first.isalpha() and first != '_':\n return False\n for i in range(1, len(tk)):\n c = tk[i]\n if not c.isalnum() and c != '_':\n return False\n return True\n\ndef process_identifiers(l):\n \"\"\"\n process_identifiers - process all identifiers and modify them to have\n consistent names across all platforms; specifically across ELF and MachO.\n For example, MachO inserts an additional understore at the beginning of\n names. This function removes that.\n \"\"\"\n parts = re.split(r'([a-zA-Z0-9_]+)', l)\n new_line = ''\n for tk in parts:\n if is_identifier(tk):\n if tk.startswith('__Z'):\n tk = tk[1:]\n elif tk.startswith('_') and len(tk) > 1 and \\\n tk[1].isalpha() and tk[1] != 'Z':\n tk = tk[1:]\n new_line += tk\n return new_line\n\n\ndef process_asm(asm):\n \"\"\"\n Strip the ASM of unwanted directives and lines\n \"\"\"\n new_contents = ''\n asm = transform_labels(asm)\n\n # TODO: Add more things we want to remove\n discard_regexes = [\n re.compile(\"\\s+\\..*$\"), # directive\n re.compile(\"\\s*#(NO_APP|APP)$\"), #inline ASM\n re.compile(\"\\s*#.*$\"), # comment line\n re.compile(\"\\s*\\.globa?l\\s*([.a-zA-Z_][a-zA-Z0-9$_.]*)\"), #global directive\n re.compile(\"\\s*\\.(string|asciz|ascii|[1248]?byte|short|word|long|quad|value|zero)\"),\n ]\n keep_regexes = [\n\n ]\n fn_label_def = re.compile(\"^[a-zA-Z_][a-zA-Z0-9_.]*:\")\n for l in asm.splitlines():\n # Remove Mach-O attribute\n l = l.replace('@GOTPCREL', '')\n add_line = True\n for reg in discard_regexes:\n if reg.match(l) is not None:\n add_line = False\n break\n for reg in keep_regexes:\n if reg.match(l) is not None:\n add_line = True\n break\n if add_line:\n if fn_label_def.match(l) and len(new_contents) != 0:\n new_contents += '\\n'\n l = process_identifiers(l)\n new_contents += l\n new_contents += '\\n'\n return new_contents\n\ndef main():\n parser = ArgumentParser(\n description='generate a stripped assembly file')\n parser.add_argument(\n 'input', metavar='input', type=str, nargs=1,\n help='An input assembly file')\n parser.add_argument(\n 'out', metavar='output', type=str, nargs=1,\n help='The output file')\n args, unknown_args = parser.parse_known_args()\n input = args.input[0]\n output = args.out[0]\n if not os.path.isfile(input):\n print((\"ERROR: input file '%s' does not exist\") % input)\n sys.exit(1)\n contents = None\n with open(input, 'r') as f:\n contents = f.read()\n new_contents = process_asm(contents)\n with open(output, 'w') as f:\n f.write(new_contents)\n\n\nif __name__ == '__main__':\n main()\n\n# vim: tabstop=4 expandtab shiftwidth=4 softtabstop=4\n# kate: tab-width: 4; replace-tabs on; indent-width 4; tab-indents: off;\n# kate: indent-mode python; remove-trailing-spaces modified;\n" }, { "path": "3rd/googletest-1.12.1/.clang-format", "content": "# Run manually to reformat a file:\n# clang-format -i --style=file \nLanguage: Cpp\nBasedOnStyle: Google\n" }, { "path": "3rd/googletest-1.12.1/.github/ISSUE_TEMPLATE/00-bug_report.md", "content": "---\nname: Bug report\nabout: Create a report to help us improve\ntitle: ''\nlabels: 'bug'\nassignees: ''\n---\n\n**Describe the bug**\n\nInclude a clear and concise description of what the problem is, including what\nyou expected to happen, and what actually happened.\n\n**Steps to reproduce the bug**\n\nIt's important that we are able to reproduce the problem that you are\nexperiencing. Please provide all code and relevant steps to reproduce the\nproblem, including your `BUILD`/`CMakeLists.txt` file and build commands. Links\nto a GitHub branch or [godbolt.org](https://godbolt.org/) that demonstrate the\nproblem are also helpful.\n\n**Does the bug persist in the most recent commit?**\n\nWe recommend using the latest commit in the master branch in your projects.\n\n**What operating system and version are you using?**\n\nIf you are using a Linux distribution please include the name and version of the\ndistribution as well.\n\n**What compiler and version are you using?**\n\nPlease include the output of `gcc -v` or `clang -v`, or the equivalent for your\ncompiler.\n\n**What build system are you using?**\n\nPlease include the output of `bazel --version` or `cmake --version`, or the\nequivalent for your build system.\n\n**Additional context**\n\nAdd any other context about the problem here.\n" }, { "path": "3rd/googletest-1.12.1/.github/ISSUE_TEMPLATE/10-feature_request.md", "content": "---\nname: Feature request\nabout: Propose a new feature\ntitle: ''\nlabels: 'enhancement'\nassignees: ''\n---\n\n**Does the feature exist in the most recent commit?**\n\nWe recommend using the latest commit from GitHub in your projects.\n\n**Why do we need this feature?**\n\nIdeally, explain why a combination of existing features cannot be used instead.\n\n**Describe the proposal**\n\nInclude a detailed description of the feature, with usage examples.\n\n**Is the feature specific to an operating system, compiler, or build system version?**\n\nIf it is, please specify which versions.\n\n" }, { "path": "3rd/googletest-1.12.1/.github/ISSUE_TEMPLATE/config.yml", "content": "blank_issues_enabled: false\n" }, { "path": "3rd/googletest-1.12.1/.github/workflows/gtest-ci.yml", "content": "name: ci\n\non:\n push:\n pull_request:\n\njobs:\n Linux:\n runs-on: ubuntu-latest\n steps:\n\n - uses: actions/checkout@v2\n with:\n fetch-depth: 0\n\n - name: Tests\n run: bazel test --test_output=errors //...\n\n MacOs:\n runs-on: macos-latest\n steps:\n\n - uses: actions/checkout@v2\n with:\n fetch-depth: 0\n\n - name: Tests\n run: bazel test --test_output=errors //...\n\n\n Windows:\n runs-on: windows-latest\n steps:\n\n - uses: actions/checkout@v2\n with:\n fetch-depth: 0\n\n - name: Tests\n run: bazel test --test_output=errors //...\n" }, { "path": "3rd/googletest-1.12.1/.gitignore", "content": "# Ignore CI build directory\nbuild/\nxcuserdata\ncmake-build-debug/\n.idea/\nbazel-bin\nbazel-genfiles\nbazel-googletest\nbazel-out\nbazel-testlogs\n# python\n*.pyc\n\n# Visual Studio files\n.vs\n*.sdf\n*.opensdf\n*.VC.opendb\n*.suo\n*.user\n_ReSharper.Caches/\nWin32-Debug/\nWin32-Release/\nx64-Debug/\nx64-Release/\n\n# Ignore autoconf / automake files\nMakefile.in\naclocal.m4\nconfigure\nbuild-aux/\nautom4te.cache/\ngoogletest/m4/libtool.m4\ngoogletest/m4/ltoptions.m4\ngoogletest/m4/ltsugar.m4\ngoogletest/m4/ltversion.m4\ngoogletest/m4/lt~obsolete.m4\ngooglemock/m4\n\n# Ignore generated directories.\ngooglemock/fused-src/\ngoogletest/fused-src/\n\n# macOS files\n.DS_Store\ngoogletest/.DS_Store\ngoogletest/xcode/.DS_Store\n\n# Ignore cmake generated directories and files.\nCMakeFiles\nCTestTestfile.cmake\nMakefile\ncmake_install.cmake\ngooglemock/CMakeFiles\ngooglemock/CTestTestfile.cmake\ngooglemock/Makefile\ngooglemock/cmake_install.cmake\ngooglemock/gtest\n/bin\n/googlemock/gmock.dir\n/googlemock/gmock_main.dir\n/googlemock/RUN_TESTS.vcxproj.filters\n/googlemock/RUN_TESTS.vcxproj\n/googlemock/INSTALL.vcxproj.filters\n/googlemock/INSTALL.vcxproj\n/googlemock/gmock_main.vcxproj.filters\n/googlemock/gmock_main.vcxproj\n/googlemock/gmock.vcxproj.filters\n/googlemock/gmock.vcxproj\n/googlemock/gmock.sln\n/googlemock/ALL_BUILD.vcxproj.filters\n/googlemock/ALL_BUILD.vcxproj\n/lib\n/Win32\n/ZERO_CHECK.vcxproj.filters\n/ZERO_CHECK.vcxproj\n/RUN_TESTS.vcxproj.filters\n/RUN_TESTS.vcxproj\n/INSTALL.vcxproj.filters\n/INSTALL.vcxproj\n/googletest-distribution.sln\n/CMakeCache.txt\n/ALL_BUILD.vcxproj.filters\n/ALL_BUILD.vcxproj\n" }, { "path": "3rd/googletest-1.12.1/BUILD.bazel", "content": "# Copyright 2017 Google Inc.\n# All Rights Reserved.\n#\n#\n# Redistribution and use in source and binary forms, with or without\n# modification, are permitted provided that the following conditions are\n# met:\n#\n# * Redistributions of source code must retain the above copyright\n# notice, this list of conditions and the following disclaimer.\n# * Redistributions in binary form must reproduce the above\n# copyright notice, this list of conditions and the following disclaimer\n# in the documentation and/or other materials provided with the\n# distribution.\n# * Neither the name of Google Inc. nor the names of its\n# contributors may be used to endorse or promote products derived from\n# this software without specific prior written permission.\n#\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n# \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n#\n# Bazel Build for Google C++ Testing Framework(Google Test)\n\npackage(default_visibility = [\"//visibility:public\"])\n\nlicenses([\"notice\"])\n\nexports_files([\"LICENSE\"])\n\nconfig_setting(\n name = \"qnx\",\n constraint_values = [\"@platforms//os:qnx\"],\n)\n\nconfig_setting(\n name = \"windows\",\n constraint_values = [\"@platforms//os:windows\"],\n)\n\nconfig_setting(\n name = \"freebsd\",\n constraint_values = [\"@platforms//os:freebsd\"],\n)\n\nconfig_setting(\n name = \"openbsd\",\n constraint_values = [\"@platforms//os:openbsd\"],\n)\n\nconfig_setting(\n name = \"msvc_compiler\",\n flag_values = {\n \"@bazel_tools//tools/cpp:compiler\": \"msvc-cl\",\n },\n visibility = [\":__subpackages__\"],\n)\n\nconfig_setting(\n name = \"has_absl\",\n values = {\"define\": \"absl=1\"},\n)\n\n# Library that defines the FRIEND_TEST macro.\ncc_library(\n name = \"gtest_prod\",\n hdrs = [\"googletest/include/gtest/gtest_prod.h\"],\n includes = [\"googletest/include\"],\n)\n\n# Google Test including Google Mock\ncc_library(\n name = \"gtest\",\n srcs = glob(\n include = [\n \"googletest/src/*.cc\",\n \"googletest/src/*.h\",\n \"googletest/include/gtest/**/*.h\",\n \"googlemock/src/*.cc\",\n \"googlemock/include/gmock/**/*.h\",\n ],\n exclude = [\n \"googletest/src/gtest-all.cc\",\n \"googletest/src/gtest_main.cc\",\n \"googlemock/src/gmock-all.cc\",\n \"googlemock/src/gmock_main.cc\",\n ],\n ),\n hdrs = glob([\n \"googletest/include/gtest/*.h\",\n \"googlemock/include/gmock/*.h\",\n ]),\n copts = select({\n \":qnx\": [],\n \":windows\": [],\n \"//conditions:default\": [\"-pthread\"],\n }),\n defines = select({\n \":has_absl\": [\"GTEST_HAS_ABSL=1\"],\n \"//conditions:default\": [],\n }),\n features = select({\n \":windows\": [\"windows_export_all_symbols\"],\n \"//conditions:default\": [],\n }),\n includes = [\n \"googlemock\",\n \"googlemock/include\",\n \"googletest\",\n \"googletest/include\",\n ],\n linkopts = select({\n \":qnx\": [\"-lregex\"],\n \":windows\": [],\n \":freebsd\": [\n \"-lm\",\n \"-pthread\",\n ],\n \":openbsd\": [\n \"-lm\",\n \"-pthread\",\n ],\n \"//conditions:default\": [\"-pthread\"],\n }),\n deps = select({\n \":has_absl\": [\n \"@com_google_absl//absl/debugging:failure_signal_handler\",\n \"@com_google_absl//absl/debugging:stacktrace\",\n \"@com_google_absl//absl/debugging:symbolize\",\n \"@com_google_absl//absl/flags:flag\",\n \"@com_google_absl//absl/flags:parse\",\n \"@com_google_absl//absl/flags:reflection\",\n \"@com_google_absl//absl/flags:usage\",\n \"@com_google_absl//absl/strings\",\n \"@com_google_absl//absl/types:any\",\n \"@com_google_absl//absl/types:optional\",\n \"@com_google_absl//absl/types:variant\",\n \"@com_googlesource_code_re2//:re2\",\n ],\n \"//conditions:default\": [],\n }),\n)\n\ncc_library(\n name = \"gtest_main\",\n srcs = [\"googlemock/src/gmock_main.cc\"],\n features = select({\n \":windows\": [\"windows_export_all_symbols\"],\n \"//conditions:default\": [],\n }),\n deps = [\":gtest\"],\n)\n\n# The following rules build samples of how to use gTest.\ncc_library(\n name = \"gtest_sample_lib\",\n srcs = [\n \"googletest/samples/sample1.cc\",\n \"googletest/samples/sample2.cc\",\n \"googletest/samples/sample4.cc\",\n ],\n hdrs = [\n \"googletest/samples/prime_tables.h\",\n \"googletest/samples/sample1.h\",\n \"googletest/samples/sample2.h\",\n \"googletest/samples/sample3-inl.h\",\n \"googletest/samples/sample4.h\",\n ],\n features = select({\n \":windows\": [\"windows_export_all_symbols\"],\n \"//conditions:default\": [],\n }),\n)\n\ncc_test(\n name = \"gtest_samples\",\n size = \"small\",\n # All Samples except:\n # sample9 (main)\n # sample10 (main and takes a command line option and needs to be separate)\n srcs = [\n \"googletest/samples/sample1_unittest.cc\",\n \"googletest/samples/sample2_unittest.cc\",\n \"googletest/samples/sample3_unittest.cc\",\n \"googletest/samples/sample4_unittest.cc\",\n \"googletest/samples/sample5_unittest.cc\",\n \"googletest/samples/sample6_unittest.cc\",\n \"googletest/samples/sample7_unittest.cc\",\n \"googletest/samples/sample8_unittest.cc\",\n ],\n linkstatic = 0,\n deps = [\n \"gtest_sample_lib\",\n \":gtest_main\",\n ],\n)\n\ncc_test(\n name = \"sample9_unittest\",\n size = \"small\",\n srcs = [\"googletest/samples/sample9_unittest.cc\"],\n deps = [\":gtest\"],\n)\n\ncc_test(\n name = \"sample10_unittest\",\n size = \"small\",\n srcs = [\"googletest/samples/sample10_unittest.cc\"],\n deps = [\":gtest\"],\n)\n" }, { "path": "3rd/googletest-1.12.1/CMakeLists.txt", "content": "# Note: CMake support is community-based. The maintainers do not use CMake\n# internally.\n\ncmake_minimum_required(VERSION 3.5)\n\nif (POLICY CMP0048)\n cmake_policy(SET CMP0048 NEW)\nendif (POLICY CMP0048)\n\nif (POLICY CMP0077)\n cmake_policy(SET CMP0077 NEW)\nendif (POLICY CMP0077)\n\nproject(googletest-distribution)\nset(GOOGLETEST_VERSION 1.12.1)\n\nif(NOT CYGWIN AND NOT MSYS AND NOT ${CMAKE_SYSTEM_NAME} STREQUAL QNX)\n set(CMAKE_CXX_EXTENSIONS OFF)\nendif()\n\nenable_testing()\n\ninclude(CMakeDependentOption)\ninclude(GNUInstallDirs)\n\n#Note that googlemock target already builds googletest\noption(BUILD_GMOCK \"Builds the googlemock subproject\" ON)\noption(INSTALL_GTEST \"Enable installation of googletest. (Projects embedding googletest may want to turn this OFF.)\" ON)\n\nif(BUILD_GMOCK)\n add_subdirectory( googlemock )\nelse()\n add_subdirectory( googletest )\nendif()\n" }, { "path": "3rd/googletest-1.12.1/CONTRIBUTING.md", "content": "# How to become a contributor and submit your own code\n\n## Contributor License Agreements\n\nWe'd love to accept your patches! Before we can take them, we have to jump a\ncouple of legal hurdles.\n\nPlease fill out either the individual or corporate Contributor License Agreement\n(CLA).\n\n* If you are an individual writing original source code and you're sure you\n own the intellectual property, then you'll need to sign an\n [individual CLA](https://developers.google.com/open-source/cla/individual).\n* If you work for a company that wants to allow you to contribute your work,\n then you'll need to sign a\n [corporate CLA](https://developers.google.com/open-source/cla/corporate).\n\nFollow either of the two links above to access the appropriate CLA and\ninstructions for how to sign and return it. Once we receive it, we'll be able to\naccept your pull requests.\n\n## Are you a Googler?\n\nIf you are a Googler, please make an attempt to submit an internal contribution\nrather than a GitHub Pull Request. If you are not able to submit internally, a\nPR is acceptable as an alternative.\n\n## Contributing A Patch\n\n1. Submit an issue describing your proposed change to the\n [issue tracker](https://github.com/google/googletest/issues).\n2. Please don't mix more than one logical change per submittal, because it\n makes the history hard to follow. If you want to make a change that doesn't\n have a corresponding issue in the issue tracker, please create one.\n3. Also, coordinate with team members that are listed on the issue in question.\n This ensures that work isn't being duplicated and communicating your plan\n early also generally leads to better patches.\n4. If your proposed change is accepted, and you haven't already done so, sign a\n Contributor License Agreement\n ([see details above](#contributor-license-agreements)).\n5. Fork the desired repo, develop and test your code changes.\n6. Ensure that your code adheres to the existing style in the sample to which\n you are contributing.\n7. Ensure that your code has an appropriate set of unit tests which all pass.\n8. Submit a pull request.\n\n## The Google Test and Google Mock Communities\n\nThe Google Test community exists primarily through the\n[discussion group](http://groups.google.com/group/googletestframework) and the\nGitHub repository. Likewise, the Google Mock community exists primarily through\ntheir own [discussion group](http://groups.google.com/group/googlemock). You are\ndefinitely encouraged to contribute to the discussion and you can also help us\nto keep the effectiveness of the group high by following and promoting the\nguidelines listed here.\n\n### Please Be Friendly\n\nShowing courtesy and respect to others is a vital part of the Google culture,\nand we strongly encourage everyone participating in Google Test development to\njoin us in accepting nothing less. Of course, being courteous is not the same as\nfailing to constructively disagree with each other, but it does mean that we\nshould be respectful of each other when enumerating the 42 technical reasons\nthat a particular proposal may not be the best choice. There's never a reason to\nbe antagonistic or dismissive toward anyone who is sincerely trying to\ncontribute to a discussion.\n\nSure, C++ testing is serious business and all that, but it's also a lot of fun.\nLet's keep it that way. Let's strive to be one of the friendliest communities in\nall of open source.\n\nAs always, discuss Google Test in the official GoogleTest discussion group. You\ndon't have to actually submit code in order to sign up. Your participation\nitself is a valuable contribution.\n\n## Style\n\nTo keep the source consistent, readable, diffable and easy to merge, we use a\nfairly rigid coding style, as defined by the\n[google-styleguide](https://github.com/google/styleguide) project. All patches\nwill be expected to conform to the style outlined\n[here](https://google.github.io/styleguide/cppguide.html). Use\n[.clang-format](https://github.com/google/googletest/blob/master/.clang-format)\nto check your formatting.\n\n## Requirements for Contributors\n\nIf you plan to contribute a patch, you need to build Google Test, Google Mock,\nand their own tests from a git checkout, which has further requirements:\n\n* [Python](https://www.python.org/) v2.3 or newer (for running some of the\n tests and re-generating certain source files from templates)\n* [CMake](https://cmake.org/) v2.8.12 or newer\n\n## Developing Google Test and Google Mock\n\nThis section discusses how to make your own changes to the Google Test project.\n\n### Testing Google Test and Google Mock Themselves\n\nTo make sure your changes work as intended and don't break existing\nfunctionality, you'll want to compile and run Google Test and GoogleMock's own\ntests. For that you can use CMake:\n\n mkdir mybuild\n cd mybuild\n cmake -Dgtest_build_tests=ON -Dgmock_build_tests=ON ${GTEST_REPO_DIR}\n\nTo choose between building only Google Test or Google Mock, you may modify your\ncmake command to be one of each\n\n cmake -Dgtest_build_tests=ON ${GTEST_DIR} # sets up Google Test tests\n cmake -Dgmock_build_tests=ON ${GMOCK_DIR} # sets up Google Mock tests\n\nMake sure you have Python installed, as some of Google Test's tests are written\nin Python. If the cmake command complains about not being able to find Python\n(`Could NOT find PythonInterp (missing: PYTHON_EXECUTABLE)`), try telling it\nexplicitly where your Python executable can be found:\n\n cmake -DPYTHON_EXECUTABLE=path/to/python ...\n\nNext, you can build Google Test and / or Google Mock and all desired tests. On\n\\*nix, this is usually done by\n\n make\n\nTo run the tests, do\n\n make test\n\nAll tests should pass.\n" }, { "path": "3rd/googletest-1.12.1/CONTRIBUTORS", "content": "# This file contains a list of people who've made non-trivial\n# contribution to the Google C++ Testing Framework project. People\n# who commit code to the project are encouraged to add their names\n# here. Please keep the list sorted by first names.\n\nAjay Joshi \nBalázs Dán \nBenoit Sigoure \nBharat Mediratta \nBogdan Piloca \nChandler Carruth \nChris Prince \nChris Taylor \nDan Egnor \nDave MacLachlan \nDavid Anderson \nDean Sturtevant\nEric Roman \nGene Volovich \nHady Zalek \nHal Burch \nJeffrey Yasskin \nJim Keller \nJoe Walnes \nJon Wray \nJói Sigurðsson \nKeir Mierle \nKeith Ray \nKenton Varda \nKostya Serebryany \nKrystian Kuzniarek \nLev Makhlis\nManuel Klimek \nMario Tanev \nMark Paskin\nMarkus Heule \nMartijn Vels \nMatthew Simmons \nMika Raento \nMike Bland \nMiklós Fazekas \nNeal Norwitz \nNermin Ozkiranartli \nOwen Carlsen \nPaneendra Ba \nPasi Valminen \nPatrick Hanna \nPatrick Riley \nPaul Menage \nPeter Kaminski \nPiotr Kaminski \nPreston Jackson \nRainer Klaffenboeck \nRuss Cox \nRuss Rufer \nSean Mcafee \nSigurður Ásgeirsson \nSverre Sundsdal \nSzymon Sobik \nTakeshi Yoshino \nTracy Bialik \nVadim Berman \nVlad Losev \nWolfgang Klier \nZhanyong Wan \n" }, { "path": "3rd/googletest-1.12.1/LICENSE", "content": "Copyright 2008, Google Inc.\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "3rd/googletest-1.12.1/README.md", "content": "# GoogleTest\n\n### Announcements\n\n#### Live at Head\n\nGoogleTest now follows the\n[Abseil Live at Head philosophy](https://abseil.io/about/philosophy#upgrade-support).\nWe recommend\n[updating to the latest commit in the `main` branch as often as possible](https://github.com/abseil/abseil-cpp/blob/master/FAQ.md#what-is-live-at-head-and-how-do-i-do-it).\n\n#### Documentation Updates\n\nOur documentation is now live on GitHub Pages at\nhttps://google.github.io/googletest/. We recommend browsing the documentation on\nGitHub Pages rather than directly in the repository.\n\n#### Release 1.11.0\n\n[Release 1.11.0](https://github.com/google/googletest/releases/tag/release-1.11.0)\nis now available.\n\n#### Coming Soon\n\n* We are planning to take a dependency on\n [Abseil](https://github.com/abseil/abseil-cpp).\n* More documentation improvements are planned.\n\n## Welcome to **GoogleTest**, Google's C++ test framework!\n\nThis repository is a merger of the formerly separate GoogleTest and GoogleMock\nprojects. These were so closely related that it makes sense to maintain and\nrelease them together.\n\n### Getting Started\n\nSee the [GoogleTest User's Guide](https://google.github.io/googletest/) for\ndocumentation. We recommend starting with the\n[GoogleTest Primer](https://google.github.io/googletest/primer.html).\n\nMore information about building GoogleTest can be found at\n[googletest/README.md](googletest/README.md).\n\n## Features\n\n* An [xUnit](https://en.wikipedia.org/wiki/XUnit) test framework.\n* Test discovery.\n* A rich set of assertions.\n* User-defined assertions.\n* Death tests.\n* Fatal and non-fatal failures.\n* Value-parameterized tests.\n* Type-parameterized tests.\n* Various options for running the tests.\n* XML test report generation.\n\n## Supported Platforms\n\nGoogleTest requires a codebase and compiler compliant with the C++11 standard or\nnewer.\n\nThe GoogleTest code is officially supported on the following platforms.\nOperating systems or tools not listed below are community-supported. For\ncommunity-supported platforms, patches that do not complicate the code may be\nconsidered.\n\nIf you notice any problems on your platform, please file an issue on the\n[GoogleTest GitHub Issue Tracker](https://github.com/google/googletest/issues).\nPull requests containing fixes are welcome!\n\n### Operating Systems\n\n* Linux\n* macOS\n* Windows\n\n### Compilers\n\n* gcc 5.0+\n* clang 5.0+\n* MSVC 2015+\n\n**macOS users:** Xcode 9.3+ provides clang 5.0+.\n\n### Build Systems\n\n* [Bazel](https://bazel.build/)\n* [CMake](https://cmake.org/)\n\n**Note:** Bazel is the build system used by the team internally and in tests.\nCMake is supported on a best-effort basis and by the community.\n\n## Who Is Using GoogleTest?\n\nIn addition to many internal projects at Google, GoogleTest is also used by the\nfollowing notable projects:\n\n* The [Chromium projects](http://www.chromium.org/) (behind the Chrome browser\n and Chrome OS).\n* The [LLVM](http://llvm.org/) compiler.\n* [Protocol Buffers](https://github.com/google/protobuf), Google's data\n interchange format.\n* The [OpenCV](http://opencv.org/) computer vision library.\n\n## Related Open Source Projects\n\n[GTest Runner](https://github.com/nholthaus/gtest-runner) is a Qt5 based\nautomated test-runner and Graphical User Interface with powerful features for\nWindows and Linux platforms.\n\n[GoogleTest UI](https://github.com/ospector/gtest-gbar) is a test runner that\nruns your test binary, allows you to track its progress via a progress bar, and\ndisplays a list of test failures. Clicking on one shows failure text. GoogleTest\nUI is written in C#.\n\n[GTest TAP Listener](https://github.com/kinow/gtest-tap-listener) is an event\nlistener for GoogleTest that implements the\n[TAP protocol](https://en.wikipedia.org/wiki/Test_Anything_Protocol) for test\nresult output. If your test runner understands TAP, you may find it useful.\n\n[gtest-parallel](https://github.com/google/gtest-parallel) is a test runner that\nruns tests from your binary in parallel to provide significant speed-up.\n\n[GoogleTest Adapter](https://marketplace.visualstudio.com/items?itemName=DavidSchuldenfrei.gtest-adapter)\nis a VS Code extension allowing to view GoogleTest in a tree view and run/debug\nyour tests.\n\n[C++ TestMate](https://github.com/matepek/vscode-catch2-test-adapter) is a VS\nCode extension allowing to view GoogleTest in a tree view and run/debug your\ntests.\n\n[Cornichon](https://pypi.org/project/cornichon/) is a small Gherkin DSL parser\nthat generates stub code for GoogleTest.\n\n## Contributing Changes\n\nPlease read\n[`CONTRIBUTING.md`](https://github.com/google/googletest/blob/master/CONTRIBUTING.md)\nfor details on how to contribute to this project.\n\nHappy testing!\n" }, { "path": "3rd/googletest-1.12.1/WORKSPACE", "content": "workspace(name = \"com_google_googletest\")\n\nload(\"@bazel_tools//tools/build_defs/repo:http.bzl\", \"http_archive\")\n\nhttp_archive(\n name = \"com_google_absl\",\n sha256 = \"1a1745b5ee81392f5ea4371a4ca41e55d446eeaee122903b2eaffbd8a3b67a2b\",\n strip_prefix = \"abseil-cpp-01cc6567cff77738e416a7ddc17de2d435a780ce\",\n urls = [\"https://github.com/abseil/abseil-cpp/archive/01cc6567cff77738e416a7ddc17de2d435a780ce.zip\"], # 2022-06-21T19:28:27Z\n)\n\n# Note this must use a commit from the `abseil` branch of the RE2 project.\n# https://github.com/google/re2/tree/abseil\nhttp_archive(\n name = \"com_googlesource_code_re2\",\n sha256 = \"0a890c2aa0bb05b2ce906a15efb520d0f5ad4c7d37b8db959c43772802991887\",\n strip_prefix = \"re2-a427f10b9fb4622dd6d8643032600aa1b50fbd12\",\n urls = [\"https://github.com/google/re2/archive/a427f10b9fb4622dd6d8643032600aa1b50fbd12.zip\"], # 2022-06-09\n)\n\nhttp_archive(\n name = \"rules_python\",\n sha256 = \"0b460f17771258341528753b1679335b629d1d25e3af28eda47d009c103a6e15\",\n strip_prefix = \"rules_python-aef17ad72919d184e5edb7abf61509eb78e57eda\",\n urls = [\"https://github.com/bazelbuild/rules_python/archive/aef17ad72919d184e5edb7abf61509eb78e57eda.zip\"], # 2022-06-21T23:44:47Z\n)\n\nhttp_archive(\n name = \"bazel_skylib\",\n urls = [\"https://github.com/bazelbuild/bazel-skylib/releases/download/1.2.1/bazel-skylib-1.2.1.tar.gz\"],\n sha256 = \"f7be3474d42aae265405a592bb7da8e171919d74c16f082a5457840f06054728\",\n)\n\nhttp_archive(\n name = \"platforms\",\n sha256 = \"a879ea428c6d56ab0ec18224f976515948822451473a80d06c2e50af0bbe5121\",\n strip_prefix = \"platforms-da5541f26b7de1dc8e04c075c99df5351742a4a2\",\n urls = [\"https://github.com/bazelbuild/platforms/archive/da5541f26b7de1dc8e04c075c99df5351742a4a2.zip\"], # 2022-05-27\n)\n" }, { "path": "3rd/googletest-1.12.1/ci/linux-presubmit.sh", "content": "#!/bin/bash\n#\n# Copyright 2020, Google Inc.\n# All rights reserved.\n#\n# Redistribution and use in source and binary forms, with or without\n# modification, are permitted provided that the following conditions are\n# met:\n#\n# * Redistributions of source code must retain the above copyright\n# notice, this list of conditions and the following disclaimer.\n# * Redistributions in binary form must reproduce the above\n# copyright notice, this list of conditions and the following disclaimer\n# in the documentation and/or other materials provided with the\n# distribution.\n# * Neither the name of Google Inc. nor the names of its\n# contributors may be used to endorse or promote products derived from\n# this software without specific prior written permission.\n#\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n# \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nset -euox pipefail\n\nreadonly LINUX_LATEST_CONTAINER=\"gcr.io/google.com/absl-177019/linux_hybrid-latest:20220217\"\nreadonly LINUX_GCC_FLOOR_CONTAINER=\"gcr.io/google.com/absl-177019/linux_gcc-floor:20220621\"\n\nif [[ -z ${GTEST_ROOT:-} ]]; then\n GTEST_ROOT=\"$(realpath $(dirname ${0})/..)\"\nfi\n\nif [[ -z ${STD:-} ]]; then\n STD=\"c++11 c++14 c++17 c++20\"\nfi\n\n# Test the CMake build\nfor cc in /usr/local/bin/gcc /opt/llvm/clang/bin/clang; do\n for cmake_off_on in OFF ON; do\n time docker run \\\n --volume=\"${GTEST_ROOT}:/src:ro\" \\\n --tmpfs=\"/build:exec\" \\\n --workdir=\"/build\" \\\n --rm \\\n --env=\"CC=${cc}\" \\\n --env=\"CXX_FLAGS=\\\"-Werror -Wdeprecated\\\"\" \\\n ${LINUX_LATEST_CONTAINER} \\\n /bin/bash -c \"\n cmake /src \\\n -DCMAKE_CXX_STANDARD=11 \\\n -Dgtest_build_samples=ON \\\n -Dgtest_build_tests=ON \\\n -Dgmock_build_tests=ON \\\n -Dcxx_no_exception=${cmake_off_on} \\\n -Dcxx_no_rtti=${cmake_off_on} && \\\n make -j$(nproc) && \\\n ctest -j$(nproc) --output-on-failure\"\n done\ndone\n\n# Do one test with an older version of GCC\ntime docker run \\\n --volume=\"${GTEST_ROOT}:/src:ro\" \\\n --workdir=\"/src\" \\\n --rm \\\n --env=\"CC=/usr/local/bin/gcc\" \\\n ${LINUX_GCC_FLOOR_CONTAINER} \\\n /usr/local/bin/bazel test ... \\\n --copt=\"-Wall\" \\\n --copt=\"-Werror\" \\\n --copt=\"-Wuninitialized\" \\\n --copt=\"-Wno-error=pragmas\" \\\n --distdir=\"/bazel-distdir\" \\\n --keep_going \\\n --show_timestamps \\\n --test_output=errors\n\n# Test GCC\nfor std in ${STD}; do\n for absl in 0 1; do\n time docker run \\\n --volume=\"${GTEST_ROOT}:/src:ro\" \\\n --workdir=\"/src\" \\\n --rm \\\n --env=\"CC=/usr/local/bin/gcc\" \\\n --env=\"BAZEL_CXXOPTS=-std=${std}\" \\\n ${LINUX_LATEST_CONTAINER} \\\n /usr/local/bin/bazel test ... \\\n --copt=\"-Wall\" \\\n --copt=\"-Werror\" \\\n --copt=\"-Wuninitialized\" \\\n --define=\"absl=${absl}\" \\\n --distdir=\"/bazel-distdir\" \\\n --keep_going \\\n --show_timestamps \\\n --test_output=errors\n done\ndone\n\n# Test Clang\nfor std in ${STD}; do\n for absl in 0 1; do\n time docker run \\\n --volume=\"${GTEST_ROOT}:/src:ro\" \\\n --workdir=\"/src\" \\\n --rm \\\n --env=\"CC=/opt/llvm/clang/bin/clang\" \\\n --env=\"BAZEL_CXXOPTS=-std=${std}\" \\\n ${LINUX_LATEST_CONTAINER} \\\n /usr/local/bin/bazel test ... \\\n --copt=\"--gcc-toolchain=/usr/local\" \\\n --copt=\"-Wall\" \\\n --copt=\"-Werror\" \\\n --copt=\"-Wuninitialized\" \\\n --define=\"absl=${absl}\" \\\n --distdir=\"/bazel-distdir\" \\\n --keep_going \\\n --linkopt=\"--gcc-toolchain=/usr/local\" \\\n --show_timestamps \\\n --test_output=errors\n done\ndone\n" }, { "path": "3rd/googletest-1.12.1/ci/macos-presubmit.sh", "content": "#!/bin/bash\n#\n# Copyright 2020, Google Inc.\n# All rights reserved.\n#\n# Redistribution and use in source and binary forms, with or without\n# modification, are permitted provided that the following conditions are\n# met:\n#\n# * Redistributions of source code must retain the above copyright\n# notice, this list of conditions and the following disclaimer.\n# * Redistributions in binary form must reproduce the above\n# copyright notice, this list of conditions and the following disclaimer\n# in the documentation and/or other materials provided with the\n# distribution.\n# * Neither the name of Google Inc. nor the names of its\n# contributors may be used to endorse or promote products derived from\n# this software without specific prior written permission.\n#\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n# \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nset -euox pipefail\n\nif [[ -z ${GTEST_ROOT:-} ]]; then\n GTEST_ROOT=\"$(realpath $(dirname ${0})/..)\"\nfi\n\n# Test the CMake build\nfor cmake_off_on in OFF ON; do\n BUILD_DIR=$(mktemp -d build_dir.XXXXXXXX)\n cd ${BUILD_DIR}\n time cmake ${GTEST_ROOT} \\\n -DCMAKE_CXX_STANDARD=11 \\\n -Dgtest_build_samples=ON \\\n -Dgtest_build_tests=ON \\\n -Dgmock_build_tests=ON \\\n -Dcxx_no_exception=${cmake_off_on} \\\n -Dcxx_no_rtti=${cmake_off_on}\n time make\n time ctest -j$(nproc) --output-on-failure\ndone\n\n# Test the Bazel build\n\n# If we are running on Kokoro, check for a versioned Bazel binary.\nKOKORO_GFILE_BAZEL_BIN=\"bazel-3.7.0-darwin-x86_64\"\nif [[ ${KOKORO_GFILE_DIR:-} ]] && [[ -f ${KOKORO_GFILE_DIR}/${KOKORO_GFILE_BAZEL_BIN} ]]; then\n BAZEL_BIN=\"${KOKORO_GFILE_DIR}/${KOKORO_GFILE_BAZEL_BIN}\"\n chmod +x ${BAZEL_BIN}\nelse\n BAZEL_BIN=\"bazel\"\nfi\n\ncd ${GTEST_ROOT}\nfor absl in 0 1; do\n ${BAZEL_BIN} test ... \\\n --copt=\"-Wall\" \\\n --copt=\"-Werror\" \\\n --define=\"absl=${absl}\" \\\n --keep_going \\\n --show_timestamps \\\n --test_output=errors\ndone\n" }, { "path": "3rd/googletest-1.12.1/docs/_config.yml", "content": "title: GoogleTest\n" }, { "path": "3rd/googletest-1.12.1/docs/_data/navigation.yml", "content": "nav:\n- section: \"Get Started\"\n items:\n - title: \"Supported Platforms\"\n url: \"/platforms.html\"\n - title: \"Quickstart: Bazel\"\n url: \"/quickstart-bazel.html\"\n - title: \"Quickstart: CMake\"\n url: \"/quickstart-cmake.html\"\n- section: \"Guides\"\n items:\n - title: \"GoogleTest Primer\"\n url: \"/primer.html\"\n - title: \"Advanced Topics\"\n url: \"/advanced.html\"\n - title: \"Mocking for Dummies\"\n url: \"/gmock_for_dummies.html\"\n - title: \"Mocking Cookbook\"\n url: \"/gmock_cook_book.html\"\n - title: \"Mocking Cheat Sheet\"\n url: \"/gmock_cheat_sheet.html\"\n- section: \"References\"\n items:\n - title: \"Testing Reference\"\n url: \"/reference/testing.html\"\n - title: \"Mocking Reference\"\n url: \"/reference/mocking.html\"\n - title: \"Assertions\"\n url: \"/reference/assertions.html\"\n - title: \"Matchers\"\n url: \"/reference/matchers.html\"\n - title: \"Actions\"\n url: \"/reference/actions.html\"\n - title: \"Testing FAQ\"\n url: \"/faq.html\"\n - title: \"Mocking FAQ\"\n url: \"/gmock_faq.html\"\n - title: \"Code Samples\"\n url: \"/samples.html\"\n - title: \"Using pkg-config\"\n url: \"/pkgconfig.html\"\n - title: \"Community Documentation\"\n url: \"/community_created_documentation.html\"\n" }, { "path": "3rd/googletest-1.12.1/docs/_layouts/default.html", "content": "\n\n \n \n \n \n\n{% seo %}\n \n \n \n \n \n \n
\n
\n {{ content }}\n
\n
\n GoogleTest ·\n GitHub Repository ·\n License ·\n Privacy Policy\n
\n
\n \n \n \n\n" }, { "path": "3rd/googletest-1.12.1/docs/_sass/main.scss", "content": "// Styles for GoogleTest docs website on GitHub Pages.\n// Color variables are defined in\n// https://github.com/pages-themes/primer/tree/master/_sass/primer-support/lib/variables\n\n$sidebar-width: 260px;\n\nbody {\n display: flex;\n margin: 0;\n}\n\n.sidebar {\n background: $black;\n color: $text-white;\n flex-shrink: 0;\n height: 100vh;\n overflow: auto;\n position: sticky;\n top: 0;\n width: $sidebar-width;\n}\n\n.sidebar h1 {\n font-size: 1.5em;\n}\n\n.sidebar h2 {\n color: $gray-light;\n font-size: 0.8em;\n font-weight: normal;\n margin-bottom: 0.8em;\n padding-left: 2.5em;\n text-transform: uppercase;\n}\n\n.sidebar .header {\n background: $black;\n padding: 2em;\n position: sticky;\n top: 0;\n width: 100%;\n}\n\n.sidebar .header a {\n color: $text-white;\n text-decoration: none;\n}\n\n.sidebar .nav-toggle {\n display: none;\n}\n\n.sidebar .expander {\n cursor: pointer;\n display: none;\n height: 3em;\n position: absolute;\n right: 1em;\n top: 1.5em;\n width: 3em;\n}\n\n.sidebar .expander .arrow {\n border: solid $white;\n border-width: 0 3px 3px 0;\n display: block;\n height: 0.7em;\n margin: 1em auto;\n transform: rotate(45deg);\n transition: transform 0.5s;\n width: 0.7em;\n}\n\n.sidebar nav {\n width: 100%;\n}\n\n.sidebar nav ul {\n list-style-type: none;\n margin-bottom: 1em;\n padding: 0;\n\n &:last-child {\n margin-bottom: 2em;\n }\n\n a {\n text-decoration: none;\n }\n\n li {\n color: $text-white;\n padding-left: 2em;\n text-decoration: none;\n }\n\n li.active {\n background: $border-gray-darker;\n font-weight: bold;\n }\n\n li:hover {\n background: $border-gray-darker;\n }\n}\n\n.main {\n background-color: $bg-gray;\n width: calc(100% - #{$sidebar-width});\n}\n\n.main .main-inner {\n background-color: $white;\n padding: 2em;\n}\n\n.main .footer {\n margin: 0;\n padding: 2em;\n}\n\n.main table th {\n text-align: left;\n}\n\n.main .callout {\n border-left: 0.25em solid $white;\n padding: 1em;\n\n a {\n text-decoration: underline;\n }\n\n &.important {\n background-color: $bg-yellow-light;\n border-color: $bg-yellow;\n color: $black;\n }\n\n &.note {\n background-color: $bg-blue-light;\n border-color: $text-blue;\n color: $text-blue;\n }\n\n &.tip {\n background-color: $green-000;\n border-color: $green-700;\n color: $green-700;\n }\n\n &.warning {\n background-color: $red-000;\n border-color: $text-red;\n color: $text-red;\n }\n}\n\n.main .good pre {\n background-color: $bg-green-light;\n}\n\n.main .bad pre {\n background-color: $red-000;\n}\n\n@media all and (max-width: 768px) {\n body {\n flex-direction: column;\n }\n\n .sidebar {\n height: auto;\n position: relative;\n width: 100%;\n }\n\n .sidebar .expander {\n display: block;\n }\n\n .sidebar nav {\n height: 0;\n overflow: hidden;\n }\n\n .sidebar .nav-toggle:checked {\n & ~ nav {\n height: auto;\n }\n\n & + .expander .arrow {\n transform: rotate(-135deg);\n }\n }\n\n .main {\n width: 100%;\n }\n}\n" }, { "path": "3rd/googletest-1.12.1/docs/advanced.md", "content": "# Advanced googletest Topics\n\n## Introduction\n\nNow that you have read the [googletest Primer](primer.md) and learned how to\nwrite tests using googletest, it's time to learn some new tricks. This document\nwill show you more assertions as well as how to construct complex failure\nmessages, propagate fatal failures, reuse and speed up your test fixtures, and\nuse various flags with your tests.\n\n## More Assertions\n\nThis section covers some less frequently used, but still significant,\nassertions.\n\n### Explicit Success and Failure\n\nSee [Explicit Success and Failure](reference/assertions.md#success-failure) in\nthe Assertions Reference.\n\n### Exception Assertions\n\nSee [Exception Assertions](reference/assertions.md#exceptions) in the Assertions\nReference.\n\n### Predicate Assertions for Better Error Messages\n\nEven though googletest has a rich set of assertions, they can never be complete,\nas it's impossible (nor a good idea) to anticipate all scenarios a user might\nrun into. Therefore, sometimes a user has to use `EXPECT_TRUE()` to check a\ncomplex expression, for lack of a better macro. This has the problem of not\nshowing you the values of the parts of the expression, making it hard to\nunderstand what went wrong. As a workaround, some users choose to construct the\nfailure message by themselves, streaming it into `EXPECT_TRUE()`. However, this\nis awkward especially when the expression has side-effects or is expensive to\nevaluate.\n\ngoogletest gives you three different options to solve this problem:\n\n#### Using an Existing Boolean Function\n\nIf you already have a function or functor that returns `bool` (or a type that\ncan be implicitly converted to `bool`), you can use it in a *predicate\nassertion* to get the function arguments printed for free. See\n[`EXPECT_PRED*`](reference/assertions.md#EXPECT_PRED) in the Assertions\nReference for details.\n\n#### Using a Function That Returns an AssertionResult\n\nWhile `EXPECT_PRED*()` and friends are handy for a quick job, the syntax is not\nsatisfactory: you have to use different macros for different arities, and it\nfeels more like Lisp than C++. The `::testing::AssertionResult` class solves\nthis problem.\n\nAn `AssertionResult` object represents the result of an assertion (whether it's\na success or a failure, and an associated message). You can create an\n`AssertionResult` using one of these factory functions:\n\n```c++\nnamespace testing {\n\n// Returns an AssertionResult object to indicate that an assertion has\n// succeeded.\nAssertionResult AssertionSuccess();\n\n// Returns an AssertionResult object to indicate that an assertion has\n// failed.\nAssertionResult AssertionFailure();\n\n}\n```\n\nYou can then use the `<<` operator to stream messages to the `AssertionResult`\nobject.\n\nTo provide more readable messages in Boolean assertions (e.g. `EXPECT_TRUE()`),\nwrite a predicate function that returns `AssertionResult` instead of `bool`. For\nexample, if you define `IsEven()` as:\n\n```c++\ntesting::AssertionResult IsEven(int n) {\n if ((n % 2) == 0)\n return testing::AssertionSuccess();\n else\n return testing::AssertionFailure() << n << \" is odd\";\n}\n```\n\ninstead of:\n\n```c++\nbool IsEven(int n) {\n return (n % 2) == 0;\n}\n```\n\nthe failed assertion `EXPECT_TRUE(IsEven(Fib(4)))` will print:\n\n```none\nValue of: IsEven(Fib(4))\n Actual: false (3 is odd)\nExpected: true\n```\n\ninstead of a more opaque\n\n```none\nValue of: IsEven(Fib(4))\n Actual: false\nExpected: true\n```\n\nIf you want informative messages in `EXPECT_FALSE` and `ASSERT_FALSE` as well\n(one third of Boolean assertions in the Google code base are negative ones), and\nare fine with making the predicate slower in the success case, you can supply a\nsuccess message:\n\n```c++\ntesting::AssertionResult IsEven(int n) {\n if ((n % 2) == 0)\n return testing::AssertionSuccess() << n << \" is even\";\n else\n return testing::AssertionFailure() << n << \" is odd\";\n}\n```\n\nThen the statement `EXPECT_FALSE(IsEven(Fib(6)))` will print\n\n```none\n Value of: IsEven(Fib(6))\n Actual: true (8 is even)\n Expected: false\n```\n\n#### Using a Predicate-Formatter\n\nIf you find the default message generated by\n[`EXPECT_PRED*`](reference/assertions.md#EXPECT_PRED) and\n[`EXPECT_TRUE`](reference/assertions.md#EXPECT_TRUE) unsatisfactory, or some\narguments to your predicate do not support streaming to `ostream`, you can\ninstead use *predicate-formatter assertions* to *fully* customize how the\nmessage is formatted. See\n[`EXPECT_PRED_FORMAT*`](reference/assertions.md#EXPECT_PRED_FORMAT) in the\nAssertions Reference for details.\n\n### Floating-Point Comparison\n\nSee [Floating-Point Comparison](reference/assertions.md#floating-point) in the\nAssertions Reference.\n\n#### Floating-Point Predicate-Format Functions\n\nSome floating-point operations are useful, but not that often used. In order to\navoid an explosion of new macros, we provide them as predicate-format functions\nthat can be used in the predicate assertion macro\n[`EXPECT_PRED_FORMAT2`](reference/assertions.md#EXPECT_PRED_FORMAT), for\nexample:\n\n```c++\nusing ::testing::FloatLE;\nusing ::testing::DoubleLE;\n...\nEXPECT_PRED_FORMAT2(FloatLE, val1, val2);\nEXPECT_PRED_FORMAT2(DoubleLE, val1, val2);\n```\n\nThe above code verifies that `val1` is less than, or approximately equal to,\n`val2`.\n\n### Asserting Using gMock Matchers\n\nSee [`EXPECT_THAT`](reference/assertions.md#EXPECT_THAT) in the Assertions\nReference.\n\n### More String Assertions\n\n(Please read the [previous](#asserting-using-gmock-matchers) section first if\nyou haven't.)\n\nYou can use the gMock [string matchers](reference/matchers.md#string-matchers)\nwith [`EXPECT_THAT`](reference/assertions.md#EXPECT_THAT) to do more string\ncomparison tricks (sub-string, prefix, suffix, regular expression, and etc). For\nexample,\n\n```c++\nusing ::testing::HasSubstr;\nusing ::testing::MatchesRegex;\n...\n ASSERT_THAT(foo_string, HasSubstr(\"needle\"));\n EXPECT_THAT(bar_string, MatchesRegex(\"\\\\w*\\\\d+\"));\n```\n\n### Windows HRESULT assertions\n\nSee [Windows HRESULT Assertions](reference/assertions.md#HRESULT) in the\nAssertions Reference.\n\n### Type Assertions\n\nYou can call the function\n\n```c++\n::testing::StaticAssertTypeEq();\n```\n\nto assert that types `T1` and `T2` are the same. The function does nothing if\nthe assertion is satisfied. If the types are different, the function call will\nfail to compile, the compiler error message will say that `T1 and T2 are not the\nsame type` and most likely (depending on the compiler) show you the actual\nvalues of `T1` and `T2`. This is mainly useful inside template code.\n\n**Caveat**: When used inside a member function of a class template or a function\ntemplate, `StaticAssertTypeEq()` is effective only if the function is\ninstantiated. For example, given:\n\n```c++\ntemplate class Foo {\n public:\n void Bar() { testing::StaticAssertTypeEq(); }\n};\n```\n\nthe code:\n\n```c++\nvoid Test1() { Foo foo; }\n```\n\nwill not generate a compiler error, as `Foo::Bar()` is never actually\ninstantiated. Instead, you need:\n\n```c++\nvoid Test2() { Foo foo; foo.Bar(); }\n```\n\nto cause a compiler error.\n\n### Assertion Placement\n\nYou can use assertions in any C++ function. In particular, it doesn't have to be\na method of the test fixture class. The one constraint is that assertions that\ngenerate a fatal failure (`FAIL*` and `ASSERT_*`) can only be used in\nvoid-returning functions. This is a consequence of Google's not using\nexceptions. By placing it in a non-void function you'll get a confusing compile\nerror like `\"error: void value not ignored as it ought to be\"` or `\"cannot\ninitialize return object of type 'bool' with an rvalue of type 'void'\"` or\n`\"error: no viable conversion from 'void' to 'string'\"`.\n\nIf you need to use fatal assertions in a function that returns non-void, one\noption is to make the function return the value in an out parameter instead. For\nexample, you can rewrite `T2 Foo(T1 x)` to `void Foo(T1 x, T2* result)`. You\nneed to make sure that `*result` contains some sensible value even when the\nfunction returns prematurely. As the function now returns `void`, you can use\nany assertion inside of it.\n\nIf changing the function's type is not an option, you should just use assertions\nthat generate non-fatal failures, such as `ADD_FAILURE*` and `EXPECT_*`.\n\n{: .callout .note}\nNOTE: Constructors and destructors are not considered void-returning functions,\naccording to the C++ language specification, and so you may not use fatal\nassertions in them; you'll get a compilation error if you try. Instead, either\ncall `abort` and crash the entire test executable, or put the fatal assertion in\na `SetUp`/`TearDown` function; see\n[constructor/destructor vs. `SetUp`/`TearDown`](faq.md#CtorVsSetUp)\n\n{: .callout .warning}\nWARNING: A fatal assertion in a helper function (private void-returning method)\ncalled from a constructor or destructor does not terminate the current test, as\nyour intuition might suggest: it merely returns from the constructor or\ndestructor early, possibly leaving your object in a partially-constructed or\npartially-destructed state! You almost certainly want to `abort` or use\n`SetUp`/`TearDown` instead.\n\n## Skipping test execution\n\nRelated to the assertions `SUCCEED()` and `FAIL()`, you can prevent further test\nexecution at runtime with the `GTEST_SKIP()` macro. This is useful when you need\nto check for preconditions of the system under test during runtime and skip\ntests in a meaningful way.\n\n`GTEST_SKIP()` can be used in individual test cases or in the `SetUp()` methods\nof classes derived from either `::testing::Environment` or `::testing::Test`.\nFor example:\n\n```c++\nTEST(SkipTest, DoesSkip) {\n GTEST_SKIP() << \"Skipping single test\";\n EXPECT_EQ(0, 1); // Won't fail; it won't be executed\n}\n\nclass SkipFixture : public ::testing::Test {\n protected:\n void SetUp() override {\n GTEST_SKIP() << \"Skipping all tests for this fixture\";\n }\n};\n\n// Tests for SkipFixture won't be executed.\nTEST_F(SkipFixture, SkipsOneTest) {\n EXPECT_EQ(5, 7); // Won't fail\n}\n```\n\nAs with assertion macros, you can stream a custom message into `GTEST_SKIP()`.\n\n## Teaching googletest How to Print Your Values\n\nWhen a test assertion such as `EXPECT_EQ` fails, googletest prints the argument\nvalues to help you debug. It does this using a user-extensible value printer.\n\nThis printer knows how to print built-in C++ types, native arrays, STL\ncontainers, and any type that supports the `<<` operator. For other types, it\nprints the raw bytes in the value and hopes that you the user can figure it out.\n\nAs mentioned earlier, the printer is *extensible*. That means you can teach it\nto do a better job at printing your particular type than to dump the bytes. To\ndo that, define `<<` for your type:\n\n```c++\n#include \n\nnamespace foo {\n\nclass Bar { // We want googletest to be able to print instances of this.\n...\n // Create a free inline friend function.\n friend std::ostream& operator<<(std::ostream& os, const Bar& bar) {\n return os << bar.DebugString(); // whatever needed to print bar to os\n }\n};\n\n// If you can't declare the function in the class it's important that the\n// << operator is defined in the SAME namespace that defines Bar. C++'s look-up\n// rules rely on that.\nstd::ostream& operator<<(std::ostream& os, const Bar& bar) {\n return os << bar.DebugString(); // whatever needed to print bar to os\n}\n\n} // namespace foo\n```\n\nSometimes, this might not be an option: your team may consider it bad style to\nhave a `<<` operator for `Bar`, or `Bar` may already have a `<<` operator that\ndoesn't do what you want (and you cannot change it). If so, you can instead\ndefine a `PrintTo()` function like this:\n\n```c++\n#include \n\nnamespace foo {\n\nclass Bar {\n ...\n friend void PrintTo(const Bar& bar, std::ostream* os) {\n *os << bar.DebugString(); // whatever needed to print bar to os\n }\n};\n\n// If you can't declare the function in the class it's important that PrintTo()\n// is defined in the SAME namespace that defines Bar. C++'s look-up rules rely\n// on that.\nvoid PrintTo(const Bar& bar, std::ostream* os) {\n *os << bar.DebugString(); // whatever needed to print bar to os\n}\n\n} // namespace foo\n```\n\nIf you have defined both `<<` and `PrintTo()`, the latter will be used when\ngoogletest is concerned. This allows you to customize how the value appears in\ngoogletest's output without affecting code that relies on the behavior of its\n`<<` operator.\n\nIf you want to print a value `x` using googletest's value printer yourself, just\ncall `::testing::PrintToString(x)`, which returns an `std::string`:\n\n```c++\nvector > bar_ints = GetBarIntVector();\n\nEXPECT_TRUE(IsCorrectBarIntVector(bar_ints))\n << \"bar_ints = \" << testing::PrintToString(bar_ints);\n```\n\n## Death Tests\n\nIn many applications, there are assertions that can cause application failure if\na condition is not met. These consistency checks, which ensure that the program\nis in a known good state, are there to fail at the earliest possible time after\nsome program state is corrupted. If the assertion checks the wrong condition,\nthen the program may proceed in an erroneous state, which could lead to memory\ncorruption, security holes, or worse. Hence it is vitally important to test that\nsuch assertion statements work as expected.\n\nSince these precondition checks cause the processes to die, we call such tests\n_death tests_. More generally, any test that checks that a program terminates\n(except by throwing an exception) in an expected fashion is also a death test.\n\nNote that if a piece of code throws an exception, we don't consider it \"death\"\nfor the purpose of death tests, as the caller of the code could catch the\nexception and avoid the crash. If you want to verify exceptions thrown by your\ncode, see [Exception Assertions](#ExceptionAssertions).\n\nIf you want to test `EXPECT_*()/ASSERT_*()` failures in your test code, see\n[\"Catching\" Failures](#catching-failures).\n\n### How to Write a Death Test\n\nGoogleTest provides assertion macros to support death tests. See\n[Death Assertions](reference/assertions.md#death) in the Assertions Reference\nfor details.\n\nTo write a death test, simply use one of the macros inside your test function.\nFor example,\n\n```c++\nTEST(MyDeathTest, Foo) {\n // This death test uses a compound statement.\n ASSERT_DEATH({\n int n = 5;\n Foo(&n);\n }, \"Error on line .* of Foo()\");\n}\n\nTEST(MyDeathTest, NormalExit) {\n EXPECT_EXIT(NormalExit(), testing::ExitedWithCode(0), \"Success\");\n}\n\nTEST(MyDeathTest, KillProcess) {\n EXPECT_EXIT(KillProcess(), testing::KilledBySignal(SIGKILL),\n \"Sending myself unblockable signal\");\n}\n```\n\nverifies that:\n\n* calling `Foo(5)` causes the process to die with the given error message,\n* calling `NormalExit()` causes the process to print `\"Success\"` to stderr and\n exit with exit code 0, and\n* calling `KillProcess()` kills the process with signal `SIGKILL`.\n\nThe test function body may contain other assertions and statements as well, if\nnecessary.\n\nNote that a death test only cares about three things:\n\n1. does `statement` abort or exit the process?\n2. (in the case of `ASSERT_EXIT` and `EXPECT_EXIT`) does the exit status\n satisfy `predicate`? Or (in the case of `ASSERT_DEATH` and `EXPECT_DEATH`)\n is the exit status non-zero? And\n3. does the stderr output match `matcher`?\n\nIn particular, if `statement` generates an `ASSERT_*` or `EXPECT_*` failure, it\nwill **not** cause the death test to fail, as googletest assertions don't abort\nthe process.\n\n### Death Test Naming\n\n{: .callout .important}\nIMPORTANT: We strongly recommend you to follow the convention of naming your\n**test suite** (not test) `*DeathTest` when it contains a death test, as\ndemonstrated in the above example. The\n[Death Tests And Threads](#death-tests-and-threads) section below explains why.\n\nIf a test fixture class is shared by normal tests and death tests, you can use\n`using` or `typedef` to introduce an alias for the fixture class and avoid\nduplicating its code:\n\n```c++\nclass FooTest : public testing::Test { ... };\n\nusing FooDeathTest = FooTest;\n\nTEST_F(FooTest, DoesThis) {\n // normal test\n}\n\nTEST_F(FooDeathTest, DoesThat) {\n // death test\n}\n```\n\n### Regular Expression Syntax\n\nWhen built with Bazel and using Abseil, googletest uses the\n[RE2](https://github.com/google/re2/wiki/Syntax) syntax. Otherwise, for POSIX\nsystems (Linux, Cygwin, Mac), googletest uses the\n[POSIX extended regular expression](http://www.opengroup.org/onlinepubs/009695399/basedefs/xbd_chap09.html#tag_09_04)\nsyntax. To learn about POSIX syntax, you may want to read this\n[Wikipedia entry](http://en.wikipedia.org/wiki/Regular_expression#POSIX_Extended_Regular_Expressions).\n\nOn Windows, googletest uses its own simple regular expression implementation. It\nlacks many features. For example, we don't support union (`\"x|y\"`), grouping\n(`\"(xy)\"`), brackets (`\"[xy]\"`), and repetition count (`\"x{5,7}\"`), among\nothers. Below is what we do support (`A` denotes a literal character, period\n(`.`), or a single `\\\\ ` escape sequence; `x` and `y` denote regular\nexpressions.):\n\nExpression | Meaning\n---------- | --------------------------------------------------------------\n`c` | matches any literal character `c`\n`\\\\d` | matches any decimal digit\n`\\\\D` | matches any character that's not a decimal digit\n`\\\\f` | matches `\\f`\n`\\\\n` | matches `\\n`\n`\\\\r` | matches `\\r`\n`\\\\s` | matches any ASCII whitespace, including `\\n`\n`\\\\S` | matches any character that's not a whitespace\n`\\\\t` | matches `\\t`\n`\\\\v` | matches `\\v`\n`\\\\w` | matches any letter, `_`, or decimal digit\n`\\\\W` | matches any character that `\\\\w` doesn't match\n`\\\\c` | matches any literal character `c`, which must be a punctuation\n`.` | matches any single character except `\\n`\n`A?` | matches 0 or 1 occurrences of `A`\n`A*` | matches 0 or many occurrences of `A`\n`A+` | matches 1 or many occurrences of `A`\n`^` | matches the beginning of a string (not that of each line)\n`$` | matches the end of a string (not that of each line)\n`xy` | matches `x` followed by `y`\n\nTo help you determine which capability is available on your system, googletest\ndefines macros to govern which regular expression it is using. The macros are:\n`GTEST_USES_SIMPLE_RE=1` or `GTEST_USES_POSIX_RE=1`. If you want your death\ntests to work in all cases, you can either `#if` on these macros or use the more\nlimited syntax only.\n\n### How It Works\n\nSee [Death Assertions](reference/assertions.md#death) in the Assertions\nReference.\n\n### Death Tests And Threads\n\nThe reason for the two death test styles has to do with thread safety. Due to\nwell-known problems with forking in the presence of threads, death tests should\nbe run in a single-threaded context. Sometimes, however, it isn't feasible to\narrange that kind of environment. For example, statically-initialized modules\nmay start threads before main is ever reached. Once threads have been created,\nit may be difficult or impossible to clean them up.\n\ngoogletest has three features intended to raise awareness of threading issues.\n\n1. A warning is emitted if multiple threads are running when a death test is\n encountered.\n2. Test suites with a name ending in \"DeathTest\" are run before all other\n tests.\n3. It uses `clone()` instead of `fork()` to spawn the child process on Linux\n (`clone()` is not available on Cygwin and Mac), as `fork()` is more likely\n to cause the child to hang when the parent process has multiple threads.\n\nIt's perfectly fine to create threads inside a death test statement; they are\nexecuted in a separate process and cannot affect the parent.\n\n### Death Test Styles\n\nThe \"threadsafe\" death test style was introduced in order to help mitigate the\nrisks of testing in a possibly multithreaded environment. It trades increased\ntest execution time (potentially dramatically so) for improved thread safety.\n\nThe automated testing framework does not set the style flag. You can choose a\nparticular style of death tests by setting the flag programmatically:\n\n```c++\nGTEST_FLAG_SET(death_test_style, \"threadsafe\")\n```\n\nYou can do this in `main()` to set the style for all death tests in the binary,\nor in individual tests. Recall that flags are saved before running each test and\nrestored afterwards, so you need not do that yourself. For example:\n\n```c++\nint main(int argc, char** argv) {\n testing::InitGoogleTest(&argc, argv);\n GTEST_FLAG_SET(death_test_style, \"fast\");\n return RUN_ALL_TESTS();\n}\n\nTEST(MyDeathTest, TestOne) {\n GTEST_FLAG_SET(death_test_style, \"threadsafe\");\n // This test is run in the \"threadsafe\" style:\n ASSERT_DEATH(ThisShouldDie(), \"\");\n}\n\nTEST(MyDeathTest, TestTwo) {\n // This test is run in the \"fast\" style:\n ASSERT_DEATH(ThisShouldDie(), \"\");\n}\n```\n\n### Caveats\n\nThe `statement` argument of `ASSERT_EXIT()` can be any valid C++ statement. If\nit leaves the current function via a `return` statement or by throwing an\nexception, the death test is considered to have failed. Some googletest macros\nmay return from the current function (e.g. `ASSERT_TRUE()`), so be sure to avoid\nthem in `statement`.\n\nSince `statement` runs in the child process, any in-memory side effect (e.g.\nmodifying a variable, releasing memory, etc) it causes will *not* be observable\nin the parent process. In particular, if you release memory in a death test,\nyour program will fail the heap check as the parent process will never see the\nmemory reclaimed. To solve this problem, you can\n\n1. try not to free memory in a death test;\n2. free the memory again in the parent process; or\n3. do not use the heap checker in your program.\n\nDue to an implementation detail, you cannot place multiple death test assertions\non the same line; otherwise, compilation will fail with an unobvious error\nmessage.\n\nDespite the improved thread safety afforded by the \"threadsafe\" style of death\ntest, thread problems such as deadlock are still possible in the presence of\nhandlers registered with `pthread_atfork(3)`.\n\n## Using Assertions in Sub-routines\n\n{: .callout .note}\nNote: If you want to put a series of test assertions in a subroutine to check\nfor a complex condition, consider using\n[a custom GMock matcher](gmock_cook_book.md#NewMatchers) instead. This lets you\nprovide a more readable error message in case of failure and avoid all of the\nissues described below.\n\n### Adding Traces to Assertions\n\nIf a test sub-routine is called from several places, when an assertion inside it\nfails, it can be hard to tell which invocation of the sub-routine the failure is\nfrom. You can alleviate this problem using extra logging or custom failure\nmessages, but that usually clutters up your tests. A better solution is to use\nthe `SCOPED_TRACE` macro or the `ScopedTrace` utility:\n\n```c++\nSCOPED_TRACE(message);\n```\n\n```c++\nScopedTrace trace(\"file_path\", line_number, message);\n```\n\nwhere `message` can be anything streamable to `std::ostream`. `SCOPED_TRACE`\nmacro will cause the current file name, line number, and the given message to be\nadded in every failure message. `ScopedTrace` accepts explicit file name and\nline number in arguments, which is useful for writing test helpers. The effect\nwill be undone when the control leaves the current lexical scope.\n\nFor example,\n\n```c++\n10: void Sub1(int n) {\n11: EXPECT_EQ(Bar(n), 1);\n12: EXPECT_EQ(Bar(n + 1), 2);\n13: }\n14:\n15: TEST(FooTest, Bar) {\n16: {\n17: SCOPED_TRACE(\"A\"); // This trace point will be included in\n18: // every failure in this scope.\n19: Sub1(1);\n20: }\n21: // Now it won't.\n22: Sub1(9);\n23: }\n```\n\ncould result in messages like these:\n\n```none\npath/to/foo_test.cc:11: Failure\nValue of: Bar(n)\nExpected: 1\n Actual: 2\nGoogle Test trace:\npath/to/foo_test.cc:17: A\n\npath/to/foo_test.cc:12: Failure\nValue of: Bar(n + 1)\nExpected: 2\n Actual: 3\n```\n\nWithout the trace, it would've been difficult to know which invocation of\n`Sub1()` the two failures come from respectively. (You could add an extra\nmessage to each assertion in `Sub1()` to indicate the value of `n`, but that's\ntedious.)\n\nSome tips on using `SCOPED_TRACE`:\n\n1. With a suitable message, it's often enough to use `SCOPED_TRACE` at the\n beginning of a sub-routine, instead of at each call site.\n2. When calling sub-routines inside a loop, make the loop iterator part of the\n message in `SCOPED_TRACE` such that you can know which iteration the failure\n is from.\n3. Sometimes the line number of the trace point is enough for identifying the\n particular invocation of a sub-routine. In this case, you don't have to\n choose a unique message for `SCOPED_TRACE`. You can simply use `\"\"`.\n4. You can use `SCOPED_TRACE` in an inner scope when there is one in the outer\n scope. In this case, all active trace points will be included in the failure\n messages, in reverse order they are encountered.\n5. The trace dump is clickable in Emacs - hit `return` on a line number and\n you'll be taken to that line in the source file!\n\n### Propagating Fatal Failures\n\nA common pitfall when using `ASSERT_*` and `FAIL*` is not understanding that\nwhen they fail they only abort the _current function_, not the entire test. For\nexample, the following test will segfault:\n\n```c++\nvoid Subroutine() {\n // Generates a fatal failure and aborts the current function.\n ASSERT_EQ(1, 2);\n\n // The following won't be executed.\n ...\n}\n\nTEST(FooTest, Bar) {\n Subroutine(); // The intended behavior is for the fatal failure\n // in Subroutine() to abort the entire test.\n\n // The actual behavior: the function goes on after Subroutine() returns.\n int* p = nullptr;\n *p = 3; // Segfault!\n}\n```\n\nTo alleviate this, googletest provides three different solutions. You could use\neither exceptions, the `(ASSERT|EXPECT)_NO_FATAL_FAILURE` assertions or the\n`HasFatalFailure()` function. They are described in the following two\nsubsections.\n\n#### Asserting on Subroutines with an exception\n\nThe following code can turn ASSERT-failure into an exception:\n\n```c++\nclass ThrowListener : public testing::EmptyTestEventListener {\n void OnTestPartResult(const testing::TestPartResult& result) override {\n if (result.type() == testing::TestPartResult::kFatalFailure) {\n throw testing::AssertionException(result);\n }\n }\n};\nint main(int argc, char** argv) {\n ...\n testing::UnitTest::GetInstance()->listeners().Append(new ThrowListener);\n return RUN_ALL_TESTS();\n}\n```\n\nThis listener should be added after other listeners if you have any, otherwise\nthey won't see failed `OnTestPartResult`.\n\n#### Asserting on Subroutines\n\nAs shown above, if your test calls a subroutine that has an `ASSERT_*` failure\nin it, the test will continue after the subroutine returns. This may not be what\nyou want.\n\nOften people want fatal failures to propagate like exceptions. For that\ngoogletest offers the following macros:\n\nFatal assertion | Nonfatal assertion | Verifies\n------------------------------------- | ------------------------------------- | --------\n`ASSERT_NO_FATAL_FAILURE(statement);` | `EXPECT_NO_FATAL_FAILURE(statement);` | `statement` doesn't generate any new fatal failures in the current thread.\n\nOnly failures in the thread that executes the assertion are checked to determine\nthe result of this type of assertions. If `statement` creates new threads,\nfailures in these threads are ignored.\n\nExamples:\n\n```c++\nASSERT_NO_FATAL_FAILURE(Foo());\n\nint i;\nEXPECT_NO_FATAL_FAILURE({\n i = Bar();\n});\n```\n\nAssertions from multiple threads are currently not supported on Windows.\n\n#### Checking for Failures in the Current Test\n\n`HasFatalFailure()` in the `::testing::Test` class returns `true` if an\nassertion in the current test has suffered a fatal failure. This allows\nfunctions to catch fatal failures in a sub-routine and return early.\n\n```c++\nclass Test {\n public:\n ...\n static bool HasFatalFailure();\n};\n```\n\nThe typical usage, which basically simulates the behavior of a thrown exception,\nis:\n\n```c++\nTEST(FooTest, Bar) {\n Subroutine();\n // Aborts if Subroutine() had a fatal failure.\n if (HasFatalFailure()) return;\n\n // The following won't be executed.\n ...\n}\n```\n\nIf `HasFatalFailure()` is used outside of `TEST()` , `TEST_F()` , or a test\nfixture, you must add the `::testing::Test::` prefix, as in:\n\n```c++\nif (testing::Test::HasFatalFailure()) return;\n```\n\nSimilarly, `HasNonfatalFailure()` returns `true` if the current test has at\nleast one non-fatal failure, and `HasFailure()` returns `true` if the current\ntest has at least one failure of either kind.\n\n## Logging Additional Information\n\nIn your test code, you can call `RecordProperty(\"key\", value)` to log additional\ninformation, where `value` can be either a string or an `int`. The *last* value\nrecorded for a key will be emitted to the\n[XML output](#generating-an-xml-report) if you specify one. For example, the\ntest\n\n```c++\nTEST_F(WidgetUsageTest, MinAndMaxWidgets) {\n RecordProperty(\"MaximumWidgets\", ComputeMaxUsage());\n RecordProperty(\"MinimumWidgets\", ComputeMinUsage());\n}\n```\n\nwill output XML like this:\n\n```xml\n ...\n \n ...\n```\n\n{: .callout .note}\n> NOTE:\n>\n> * `RecordProperty()` is a static member of the `Test` class. Therefore it\n> needs to be prefixed with `::testing::Test::` if used outside of the\n> `TEST` body and the test fixture class.\n> * *`key`* must be a valid XML attribute name, and cannot conflict with the\n> ones already used by googletest (`name`, `status`, `time`, `classname`,\n> `type_param`, and `value_param`).\n> * Calling `RecordProperty()` outside of the lifespan of a test is allowed.\n> If it's called outside of a test but between a test suite's\n> `SetUpTestSuite()` and `TearDownTestSuite()` methods, it will be\n> attributed to the XML element for the test suite. If it's called outside\n> of all test suites (e.g. in a test environment), it will be attributed to\n> the top-level XML element.\n\n## Sharing Resources Between Tests in the Same Test Suite\n\ngoogletest creates a new test fixture object for each test in order to make\ntests independent and easier to debug. However, sometimes tests use resources\nthat are expensive to set up, making the one-copy-per-test model prohibitively\nexpensive.\n\nIf the tests don't change the resource, there's no harm in their sharing a\nsingle resource copy. So, in addition to per-test set-up/tear-down, googletest\nalso supports per-test-suite set-up/tear-down. To use it:\n\n1. In your test fixture class (say `FooTest` ), declare as `static` some member\n variables to hold the shared resources.\n2. Outside your test fixture class (typically just below it), define those\n member variables, optionally giving them initial values.\n3. In the same test fixture class, define a `static void SetUpTestSuite()`\n function (remember not to spell it as **`SetupTestSuite`** with a small\n `u`!) to set up the shared resources and a `static void TearDownTestSuite()`\n function to tear them down.\n\nThat's it! googletest automatically calls `SetUpTestSuite()` before running the\n*first test* in the `FooTest` test suite (i.e. before creating the first\n`FooTest` object), and calls `TearDownTestSuite()` after running the *last test*\nin it (i.e. after deleting the last `FooTest` object). In between, the tests can\nuse the shared resources.\n\nRemember that the test order is undefined, so your code can't depend on a test\npreceding or following another. Also, the tests must either not modify the state\nof any shared resource, or, if they do modify the state, they must restore the\nstate to its original value before passing control to the next test.\n\nNote that `SetUpTestSuite()` may be called multiple times for a test fixture\nclass that has derived classes, so you should not expect code in the function\nbody to be run only once. Also, derived classes still have access to shared\nresources defined as static members, so careful consideration is needed when\nmanaging shared resources to avoid memory leaks.\n\nHere's an example of per-test-suite set-up and tear-down:\n\n```c++\nclass FooTest : public testing::Test {\n protected:\n // Per-test-suite set-up.\n // Called before the first test in this test suite.\n // Can be omitted if not needed.\n static void SetUpTestSuite() {\n // Avoid reallocating static objects if called in subclasses of FooTest.\n if (shared_resource_ == nullptr) {\n shared_resource_ = new ...;\n }\n }\n\n // Per-test-suite tear-down.\n // Called after the last test in this test suite.\n // Can be omitted if not needed.\n static void TearDownTestSuite() {\n delete shared_resource_;\n shared_resource_ = nullptr;\n }\n\n // You can define per-test set-up logic as usual.\n void SetUp() override { ... }\n\n // You can define per-test tear-down logic as usual.\n void TearDown() override { ... }\n\n // Some expensive resource shared by all tests.\n static T* shared_resource_;\n};\n\nT* FooTest::shared_resource_ = nullptr;\n\nTEST_F(FooTest, Test1) {\n ... you can refer to shared_resource_ here ...\n}\n\nTEST_F(FooTest, Test2) {\n ... you can refer to shared_resource_ here ...\n}\n```\n\n{: .callout .note}\nNOTE: Though the above code declares `SetUpTestSuite()` protected, it may\nsometimes be necessary to declare it public, such as when using it with\n`TEST_P`.\n\n## Global Set-Up and Tear-Down\n\nJust as you can do set-up and tear-down at the test level and the test suite\nlevel, you can also do it at the test program level. Here's how.\n\nFirst, you subclass the `::testing::Environment` class to define a test\nenvironment, which knows how to set-up and tear-down:\n\n```c++\nclass Environment : public ::testing::Environment {\n public:\n ~Environment() override {}\n\n // Override this to define how to set up the environment.\n void SetUp() override {}\n\n // Override this to define how to tear down the environment.\n void TearDown() override {}\n};\n```\n\nThen, you register an instance of your environment class with googletest by\ncalling the `::testing::AddGlobalTestEnvironment()` function:\n\n```c++\nEnvironment* AddGlobalTestEnvironment(Environment* env);\n```\n\nNow, when `RUN_ALL_TESTS()` is called, it first calls the `SetUp()` method of\neach environment object, then runs the tests if none of the environments\nreported fatal failures and `GTEST_SKIP()` was not called. `RUN_ALL_TESTS()`\nalways calls `TearDown()` with each environment object, regardless of whether or\nnot the tests were run.\n\nIt's OK to register multiple environment objects. In this suite, their `SetUp()`\nwill be called in the order they are registered, and their `TearDown()` will be\ncalled in the reverse order.\n\nNote that googletest takes ownership of the registered environment objects.\nTherefore **do not delete them** by yourself.\n\nYou should call `AddGlobalTestEnvironment()` before `RUN_ALL_TESTS()` is called,\nprobably in `main()`. If you use `gtest_main`, you need to call this before\n`main()` starts for it to take effect. One way to do this is to define a global\nvariable like this:\n\n```c++\ntesting::Environment* const foo_env =\n testing::AddGlobalTestEnvironment(new FooEnvironment);\n```\n\nHowever, we strongly recommend you to write your own `main()` and call\n`AddGlobalTestEnvironment()` there, as relying on initialization of global\nvariables makes the code harder to read and may cause problems when you register\nmultiple environments from different translation units and the environments have\ndependencies among them (remember that the compiler doesn't guarantee the order\nin which global variables from different translation units are initialized).\n\n## Value-Parameterized Tests\n\n*Value-parameterized tests* allow you to test your code with different\nparameters without writing multiple copies of the same test. This is useful in a\nnumber of situations, for example:\n\n* You have a piece of code whose behavior is affected by one or more\n command-line flags. You want to make sure your code performs correctly for\n various values of those flags.\n* You want to test different implementations of an OO interface.\n* You want to test your code over various inputs (a.k.a. data-driven testing).\n This feature is easy to abuse, so please exercise your good sense when doing\n it!\n\n### How to Write Value-Parameterized Tests\n\nTo write value-parameterized tests, first you should define a fixture class. It\nmust be derived from both `testing::Test` and `testing::WithParamInterface`\n(the latter is a pure interface), where `T` is the type of your parameter\nvalues. For convenience, you can just derive the fixture class from\n`testing::TestWithParam`, which itself is derived from both `testing::Test`\nand `testing::WithParamInterface`. `T` can be any copyable type. If it's a\nraw pointer, you are responsible for managing the lifespan of the pointed\nvalues.\n\n{: .callout .note}\nNOTE: If your test fixture defines `SetUpTestSuite()` or `TearDownTestSuite()`\nthey must be declared **public** rather than **protected** in order to use\n`TEST_P`.\n\n```c++\nclass FooTest :\n public testing::TestWithParam {\n // You can implement all the usual fixture class members here.\n // To access the test parameter, call GetParam() from class\n // TestWithParam.\n};\n\n// Or, when you want to add parameters to a pre-existing fixture class:\nclass BaseTest : public testing::Test {\n ...\n};\nclass BarTest : public BaseTest,\n public testing::WithParamInterface {\n ...\n};\n```\n\nThen, use the `TEST_P` macro to define as many test patterns using this fixture\nas you want. The `_P` suffix is for \"parameterized\" or \"pattern\", whichever you\nprefer to think.\n\n```c++\nTEST_P(FooTest, DoesBlah) {\n // Inside a test, access the test parameter with the GetParam() method\n // of the TestWithParam class:\n EXPECT_TRUE(foo.Blah(GetParam()));\n ...\n}\n\nTEST_P(FooTest, HasBlahBlah) {\n ...\n}\n```\n\nFinally, you can use the `INSTANTIATE_TEST_SUITE_P` macro to instantiate the\ntest suite with any set of parameters you want. GoogleTest defines a number of\nfunctions for generating test parameters—see details at\n[`INSTANTIATE_TEST_SUITE_P`](reference/testing.md#INSTANTIATE_TEST_SUITE_P) in\nthe Testing Reference.\n\nFor example, the following statement will instantiate tests from the `FooTest`\ntest suite each with parameter values `\"meeny\"`, `\"miny\"`, and `\"moe\"` using the\n[`Values`](reference/testing.md#param-generators) parameter generator:\n\n```c++\nINSTANTIATE_TEST_SUITE_P(MeenyMinyMoe,\n FooTest,\n testing::Values(\"meeny\", \"miny\", \"moe\"));\n```\n\n{: .callout .note}\nNOTE: The code above must be placed at global or namespace scope, not at\nfunction scope.\n\nThe first argument to `INSTANTIATE_TEST_SUITE_P` is a unique name for the\ninstantiation of the test suite. The next argument is the name of the test\npattern, and the last is the\n[parameter generator](reference/testing.md#param-generators).\n\nYou can instantiate a test pattern more than once, so to distinguish different\ninstances of the pattern, the instantiation name is added as a prefix to the\nactual test suite name. Remember to pick unique prefixes for different\ninstantiations. The tests from the instantiation above will have these names:\n\n* `MeenyMinyMoe/FooTest.DoesBlah/0` for `\"meeny\"`\n* `MeenyMinyMoe/FooTest.DoesBlah/1` for `\"miny\"`\n* `MeenyMinyMoe/FooTest.DoesBlah/2` for `\"moe\"`\n* `MeenyMinyMoe/FooTest.HasBlahBlah/0` for `\"meeny\"`\n* `MeenyMinyMoe/FooTest.HasBlahBlah/1` for `\"miny\"`\n* `MeenyMinyMoe/FooTest.HasBlahBlah/2` for `\"moe\"`\n\nYou can use these names in [`--gtest_filter`](#running-a-subset-of-the-tests).\n\nThe following statement will instantiate all tests from `FooTest` again, each\nwith parameter values `\"cat\"` and `\"dog\"` using the\n[`ValuesIn`](reference/testing.md#param-generators) parameter generator:\n\n```c++\nconst char* pets[] = {\"cat\", \"dog\"};\nINSTANTIATE_TEST_SUITE_P(Pets, FooTest, testing::ValuesIn(pets));\n```\n\nThe tests from the instantiation above will have these names:\n\n* `Pets/FooTest.DoesBlah/0` for `\"cat\"`\n* `Pets/FooTest.DoesBlah/1` for `\"dog\"`\n* `Pets/FooTest.HasBlahBlah/0` for `\"cat\"`\n* `Pets/FooTest.HasBlahBlah/1` for `\"dog\"`\n\nPlease note that `INSTANTIATE_TEST_SUITE_P` will instantiate *all* tests in the\ngiven test suite, whether their definitions come before or *after* the\n`INSTANTIATE_TEST_SUITE_P` statement.\n\nAdditionally, by default, every `TEST_P` without a corresponding\n`INSTANTIATE_TEST_SUITE_P` causes a failing test in test suite\n`GoogleTestVerification`. If you have a test suite where that omission is not an\nerror, for example it is in a library that may be linked in for other reasons or\nwhere the list of test cases is dynamic and may be empty, then this check can be\nsuppressed by tagging the test suite:\n\n```c++\nGTEST_ALLOW_UNINSTANTIATED_PARAMETERIZED_TEST(FooTest);\n```\n\nYou can see [sample7_unittest.cc] and [sample8_unittest.cc] for more examples.\n\n[sample7_unittest.cc]: https://github.com/google/googletest/blob/master/googletest/samples/sample7_unittest.cc \"Parameterized Test example\"\n[sample8_unittest.cc]: https://github.com/google/googletest/blob/master/googletest/samples/sample8_unittest.cc \"Parameterized Test example with multiple parameters\"\n\n### Creating Value-Parameterized Abstract Tests\n\nIn the above, we define and instantiate `FooTest` in the *same* source file.\nSometimes you may want to define value-parameterized tests in a library and let\nother people instantiate them later. This pattern is known as *abstract tests*.\nAs an example of its application, when you are designing an interface you can\nwrite a standard suite of abstract tests (perhaps using a factory function as\nthe test parameter) that all implementations of the interface are expected to\npass. When someone implements the interface, they can instantiate your suite to\nget all the interface-conformance tests for free.\n\nTo define abstract tests, you should organize your code like this:\n\n1. Put the definition of the parameterized test fixture class (e.g. `FooTest`)\n in a header file, say `foo_param_test.h`. Think of this as *declaring* your\n abstract tests.\n2. Put the `TEST_P` definitions in `foo_param_test.cc`, which includes\n `foo_param_test.h`. Think of this as *implementing* your abstract tests.\n\nOnce they are defined, you can instantiate them by including `foo_param_test.h`,\ninvoking `INSTANTIATE_TEST_SUITE_P()`, and depending on the library target that\ncontains `foo_param_test.cc`. You can instantiate the same abstract test suite\nmultiple times, possibly in different source files.\n\n### Specifying Names for Value-Parameterized Test Parameters\n\nThe optional last argument to `INSTANTIATE_TEST_SUITE_P()` allows the user to\nspecify a function or functor that generates custom test name suffixes based on\nthe test parameters. The function should accept one argument of type\n`testing::TestParamInfo`, and return `std::string`.\n\n`testing::PrintToStringParamName` is a builtin test suffix generator that\nreturns the value of `testing::PrintToString(GetParam())`. It does not work for\n`std::string` or C strings.\n\n{: .callout .note}\nNOTE: test names must be non-empty, unique, and may only contain ASCII\nalphanumeric characters. In particular, they\n[should not contain underscores](faq.md#why-should-test-suite-names-and-test-names-not-contain-underscore)\n\n```c++\nclass MyTestSuite : public testing::TestWithParam {};\n\nTEST_P(MyTestSuite, MyTest)\n{\n std::cout << \"Example Test Param: \" << GetParam() << std::endl;\n}\n\nINSTANTIATE_TEST_SUITE_P(MyGroup, MyTestSuite, testing::Range(0, 10),\n testing::PrintToStringParamName());\n```\n\nProviding a custom functor allows for more control over test parameter name\ngeneration, especially for types where the automatic conversion does not\ngenerate helpful parameter names (e.g. strings as demonstrated above). The\nfollowing example illustrates this for multiple parameters, an enumeration type\nand a string, and also demonstrates how to combine generators. It uses a lambda\nfor conciseness:\n\n```c++\nenum class MyType { MY_FOO = 0, MY_BAR = 1 };\n\nclass MyTestSuite : public testing::TestWithParam> {\n};\n\nINSTANTIATE_TEST_SUITE_P(\n MyGroup, MyTestSuite,\n testing::Combine(\n testing::Values(MyType::MY_FOO, MyType::MY_BAR),\n testing::Values(\"A\", \"B\")),\n [](const testing::TestParamInfo& info) {\n std::string name = absl::StrCat(\n std::get<0>(info.param) == MyType::MY_FOO ? \"Foo\" : \"Bar\",\n std::get<1>(info.param));\n absl::c_replace_if(name, [](char c) { return !std::isalnum(c); }, '_');\n return name;\n });\n```\n\n## Typed Tests\n\nSuppose you have multiple implementations of the same interface and want to make\nsure that all of them satisfy some common requirements. Or, you may have defined\nseveral types that are supposed to conform to the same \"concept\" and you want to\nverify it. In both cases, you want the same test logic repeated for different\ntypes.\n\nWhile you can write one `TEST` or `TEST_F` for each type you want to test (and\nyou may even factor the test logic into a function template that you invoke from\nthe `TEST`), it's tedious and doesn't scale: if you want `m` tests over `n`\ntypes, you'll end up writing `m*n` `TEST`s.\n\n*Typed tests* allow you to repeat the same test logic over a list of types. You\nonly need to write the test logic once, although you must know the type list\nwhen writing typed tests. Here's how you do it:\n\nFirst, define a fixture class template. It should be parameterized by a type.\nRemember to derive it from `::testing::Test`:\n\n```c++\ntemplate \nclass FooTest : public testing::Test {\n public:\n ...\n using List = std::list;\n static T shared_;\n T value_;\n};\n```\n\nNext, associate a list of types with the test suite, which will be repeated for\neach type in the list:\n\n```c++\nusing MyTypes = ::testing::Types;\nTYPED_TEST_SUITE(FooTest, MyTypes);\n```\n\nThe type alias (`using` or `typedef`) is necessary for the `TYPED_TEST_SUITE`\nmacro to parse correctly. Otherwise the compiler will think that each comma in\nthe type list introduces a new macro argument.\n\nThen, use `TYPED_TEST()` instead of `TEST_F()` to define a typed test for this\ntest suite. You can repeat this as many times as you want:\n\n```c++\nTYPED_TEST(FooTest, DoesBlah) {\n // Inside a test, refer to the special name TypeParam to get the type\n // parameter. Since we are inside a derived class template, C++ requires\n // us to visit the members of FooTest via 'this'.\n TypeParam n = this->value_;\n\n // To visit static members of the fixture, add the 'TestFixture::'\n // prefix.\n n += TestFixture::shared_;\n\n // To refer to typedefs in the fixture, add the 'typename TestFixture::'\n // prefix. The 'typename' is required to satisfy the compiler.\n typename TestFixture::List values;\n\n values.push_back(n);\n ...\n}\n\nTYPED_TEST(FooTest, HasPropertyA) { ... }\n```\n\nYou can see [sample6_unittest.cc] for a complete example.\n\n[sample6_unittest.cc]: https://github.com/google/googletest/blob/master/googletest/samples/sample6_unittest.cc \"Typed Test example\"\n\n## Type-Parameterized Tests\n\n*Type-parameterized tests* are like typed tests, except that they don't require\nyou to know the list of types ahead of time. Instead, you can define the test\nlogic first and instantiate it with different type lists later. You can even\ninstantiate it more than once in the same program.\n\nIf you are designing an interface or concept, you can define a suite of\ntype-parameterized tests to verify properties that any valid implementation of\nthe interface/concept should have. Then, the author of each implementation can\njust instantiate the test suite with their type to verify that it conforms to\nthe requirements, without having to write similar tests repeatedly. Here's an\nexample:\n\nFirst, define a fixture class template, as we did with typed tests:\n\n```c++\ntemplate \nclass FooTest : public testing::Test {\n void DoSomethingInteresting();\n ...\n};\n```\n\nNext, declare that you will define a type-parameterized test suite:\n\n```c++\nTYPED_TEST_SUITE_P(FooTest);\n```\n\nThen, use `TYPED_TEST_P()` to define a type-parameterized test. You can repeat\nthis as many times as you want:\n\n```c++\nTYPED_TEST_P(FooTest, DoesBlah) {\n // Inside a test, refer to TypeParam to get the type parameter.\n TypeParam n = 0;\n\n // You will need to use `this` explicitly to refer to fixture members.\n this->DoSomethingInteresting()\n ...\n}\n\nTYPED_TEST_P(FooTest, HasPropertyA) { ... }\n```\n\nNow the tricky part: you need to register all test patterns using the\n`REGISTER_TYPED_TEST_SUITE_P` macro before you can instantiate them. The first\nargument of the macro is the test suite name; the rest are the names of the\ntests in this test suite:\n\n```c++\nREGISTER_TYPED_TEST_SUITE_P(FooTest,\n DoesBlah, HasPropertyA);\n```\n\nFinally, you are free to instantiate the pattern with the types you want. If you\nput the above code in a header file, you can `#include` it in multiple C++\nsource files and instantiate it multiple times.\n\n```c++\nusing MyTypes = ::testing::Types;\nINSTANTIATE_TYPED_TEST_SUITE_P(My, FooTest, MyTypes);\n```\n\nTo distinguish different instances of the pattern, the first argument to the\n`INSTANTIATE_TYPED_TEST_SUITE_P` macro is a prefix that will be added to the\nactual test suite name. Remember to pick unique prefixes for different\ninstances.\n\nIn the special case where the type list contains only one type, you can write\nthat type directly without `::testing::Types<...>`, like this:\n\n```c++\nINSTANTIATE_TYPED_TEST_SUITE_P(My, FooTest, int);\n```\n\nYou can see [sample6_unittest.cc] for a complete example.\n\n## Testing Private Code\n\nIf you change your software's internal implementation, your tests should not\nbreak as long as the change is not observable by users. Therefore, **per the\nblack-box testing principle, most of the time you should test your code through\nits public interfaces.**\n\n**If you still find yourself needing to test internal implementation code,\nconsider if there's a better design.** The desire to test internal\nimplementation is often a sign that the class is doing too much. Consider\nextracting an implementation class, and testing it. Then use that implementation\nclass in the original class.\n\nIf you absolutely have to test non-public interface code though, you can. There\nare two cases to consider:\n\n* Static functions ( *not* the same as static member functions!) or unnamed\n namespaces, and\n* Private or protected class members\n\nTo test them, we use the following special techniques:\n\n* Both static functions and definitions/declarations in an unnamed namespace\n are only visible within the same translation unit. To test them, you can\n `#include` the entire `.cc` file being tested in your `*_test.cc` file.\n (#including `.cc` files is not a good way to reuse code - you should not do\n this in production code!)\n\n However, a better approach is to move the private code into the\n `foo::internal` namespace, where `foo` is the namespace your project\n normally uses, and put the private declarations in a `*-internal.h` file.\n Your production `.cc` files and your tests are allowed to include this\n internal header, but your clients are not. This way, you can fully test your\n internal implementation without leaking it to your clients.\n\n* Private class members are only accessible from within the class or by\n friends. To access a class' private members, you can declare your test\n fixture as a friend to the class and define accessors in your fixture. Tests\n using the fixture can then access the private members of your production\n class via the accessors in the fixture. Note that even though your fixture\n is a friend to your production class, your tests are not automatically\n friends to it, as they are technically defined in sub-classes of the\n fixture.\n\n Another way to test private members is to refactor them into an\n implementation class, which is then declared in a `*-internal.h` file. Your\n clients aren't allowed to include this header but your tests can. Such is\n called the\n [Pimpl](https://www.gamedev.net/articles/programming/general-and-gameplay-programming/the-c-pimpl-r1794/)\n (Private Implementation) idiom.\n\n Or, you can declare an individual test as a friend of your class by adding\n this line in the class body:\n\n ```c++\n FRIEND_TEST(TestSuiteName, TestName);\n ```\n\n For example,\n\n ```c++\n // foo.h\n class Foo {\n ...\n private:\n FRIEND_TEST(FooTest, BarReturnsZeroOnNull);\n\n int Bar(void* x);\n };\n\n // foo_test.cc\n ...\n TEST(FooTest, BarReturnsZeroOnNull) {\n Foo foo;\n EXPECT_EQ(foo.Bar(NULL), 0); // Uses Foo's private member Bar().\n }\n ```\n\n Pay special attention when your class is defined in a namespace. If you want\n your test fixtures and tests to be friends of your class, then they must be\n defined in the exact same namespace (no anonymous or inline namespaces).\n\n For example, if the code to be tested looks like:\n\n ```c++\n namespace my_namespace {\n\n class Foo {\n friend class FooTest;\n FRIEND_TEST(FooTest, Bar);\n FRIEND_TEST(FooTest, Baz);\n ... definition of the class Foo ...\n };\n\n } // namespace my_namespace\n ```\n\n Your test code should be something like:\n\n ```c++\n namespace my_namespace {\n\n class FooTest : public testing::Test {\n protected:\n ...\n };\n\n TEST_F(FooTest, Bar) { ... }\n TEST_F(FooTest, Baz) { ... }\n\n } // namespace my_namespace\n ```\n\n## \"Catching\" Failures\n\nIf you are building a testing utility on top of googletest, you'll want to test\nyour utility. What framework would you use to test it? googletest, of course.\n\nThe challenge is to verify that your testing utility reports failures correctly.\nIn frameworks that report a failure by throwing an exception, you could catch\nthe exception and assert on it. But googletest doesn't use exceptions, so how do\nwe test that a piece of code generates an expected failure?\n\n`\"gtest/gtest-spi.h\"` contains some constructs to do this.\nAfter #including this header, you can use\n\n```c++\n EXPECT_FATAL_FAILURE(statement, substring);\n```\n\nto assert that `statement` generates a fatal (e.g. `ASSERT_*`) failure in the\ncurrent thread whose message contains the given `substring`, or use\n\n```c++\n EXPECT_NONFATAL_FAILURE(statement, substring);\n```\n\nif you are expecting a non-fatal (e.g. `EXPECT_*`) failure.\n\nOnly failures in the current thread are checked to determine the result of this\ntype of expectations. If `statement` creates new threads, failures in these\nthreads are also ignored. If you want to catch failures in other threads as\nwell, use one of the following macros instead:\n\n```c++\n EXPECT_FATAL_FAILURE_ON_ALL_THREADS(statement, substring);\n EXPECT_NONFATAL_FAILURE_ON_ALL_THREADS(statement, substring);\n```\n\n{: .callout .note}\nNOTE: Assertions from multiple threads are currently not supported on Windows.\n\nFor technical reasons, there are some caveats:\n\n1. You cannot stream a failure message to either macro.\n\n2. `statement` in `EXPECT_FATAL_FAILURE{_ON_ALL_THREADS}()` cannot reference\n local non-static variables or non-static members of `this` object.\n\n3. `statement` in `EXPECT_FATAL_FAILURE{_ON_ALL_THREADS}()` cannot return a\n value.\n\n## Registering tests programmatically\n\nThe `TEST` macros handle the vast majority of all use cases, but there are few\nwhere runtime registration logic is required. For those cases, the framework\nprovides the `::testing::RegisterTest` that allows callers to register arbitrary\ntests dynamically.\n\nThis is an advanced API only to be used when the `TEST` macros are insufficient.\nThe macros should be preferred when possible, as they avoid most of the\ncomplexity of calling this function.\n\nIt provides the following signature:\n\n```c++\ntemplate \nTestInfo* RegisterTest(const char* test_suite_name, const char* test_name,\n const char* type_param, const char* value_param,\n const char* file, int line, Factory factory);\n```\n\nThe `factory` argument is a factory callable (move-constructible) object or\nfunction pointer that creates a new instance of the Test object. It handles\nownership to the caller. The signature of the callable is `Fixture*()`, where\n`Fixture` is the test fixture class for the test. All tests registered with the\nsame `test_suite_name` must return the same fixture type. This is checked at\nruntime.\n\nThe framework will infer the fixture class from the factory and will call the\n`SetUpTestSuite` and `TearDownTestSuite` for it.\n\nMust be called before `RUN_ALL_TESTS()` is invoked, otherwise behavior is\nundefined.\n\nUse case example:\n\n```c++\nclass MyFixture : public testing::Test {\n public:\n // All of these optional, just like in regular macro usage.\n static void SetUpTestSuite() { ... }\n static void TearDownTestSuite() { ... }\n void SetUp() override { ... }\n void TearDown() override { ... }\n};\n\nclass MyTest : public MyFixture {\n public:\n explicit MyTest(int data) : data_(data) {}\n void TestBody() override { ... }\n\n private:\n int data_;\n};\n\nvoid RegisterMyTests(const std::vector& values) {\n for (int v : values) {\n testing::RegisterTest(\n \"MyFixture\", (\"Test\" + std::to_string(v)).c_str(), nullptr,\n std::to_string(v).c_str(),\n __FILE__, __LINE__,\n // Important to use the fixture type as the return type here.\n [=]() -> MyFixture* { return new MyTest(v); });\n }\n}\n...\nint main(int argc, char** argv) {\n testing::InitGoogleTest(&argc, argv);\n std::vector values_to_test = LoadValuesFromConfig();\n RegisterMyTests(values_to_test);\n ...\n return RUN_ALL_TESTS();\n}\n```\n\n## Getting the Current Test's Name\n\nSometimes a function may need to know the name of the currently running test.\nFor example, you may be using the `SetUp()` method of your test fixture to set\nthe golden file name based on which test is running. The\n[`TestInfo`](reference/testing.md#TestInfo) class has this information.\n\nTo obtain a `TestInfo` object for the currently running test, call\n`current_test_info()` on the [`UnitTest`](reference/testing.md#UnitTest)\nsingleton object:\n\n```c++\n // Gets information about the currently running test.\n // Do NOT delete the returned object - it's managed by the UnitTest class.\n const testing::TestInfo* const test_info =\n testing::UnitTest::GetInstance()->current_test_info();\n\n printf(\"We are in test %s of test suite %s.\\n\",\n test_info->name(),\n test_info->test_suite_name());\n```\n\n`current_test_info()` returns a null pointer if no test is running. In\nparticular, you cannot find the test suite name in `SetUpTestSuite()`,\n`TearDownTestSuite()` (where you know the test suite name implicitly), or\nfunctions called from them.\n\n## Extending googletest by Handling Test Events\n\ngoogletest provides an **event listener API** to let you receive notifications\nabout the progress of a test program and test failures. The events you can\nlisten to include the start and end of the test program, a test suite, or a test\nmethod, among others. You may use this API to augment or replace the standard\nconsole output, replace the XML output, or provide a completely different form\nof output, such as a GUI or a database. You can also use test events as\ncheckpoints to implement a resource leak checker, for example.\n\n### Defining Event Listeners\n\nTo define a event listener, you subclass either\n[`testing::TestEventListener`](reference/testing.md#TestEventListener) or\n[`testing::EmptyTestEventListener`](reference/testing.md#EmptyTestEventListener)\nThe former is an (abstract) interface, where *each pure virtual method can be\noverridden to handle a test event* (For example, when a test starts, the\n`OnTestStart()` method will be called.). The latter provides an empty\nimplementation of all methods in the interface, such that a subclass only needs\nto override the methods it cares about.\n\nWhen an event is fired, its context is passed to the handler function as an\nargument. The following argument types are used:\n\n* UnitTest reflects the state of the entire test program,\n* TestSuite has information about a test suite, which can contain one or more\n tests,\n* TestInfo contains the state of a test, and\n* TestPartResult represents the result of a test assertion.\n\nAn event handler function can examine the argument it receives to find out\ninteresting information about the event and the test program's state.\n\nHere's an example:\n\n```c++\n class MinimalistPrinter : public testing::EmptyTestEventListener {\n // Called before a test starts.\n void OnTestStart(const testing::TestInfo& test_info) override {\n printf(\"*** Test %s.%s starting.\\n\",\n test_info.test_suite_name(), test_info.name());\n }\n\n // Called after a failed assertion or a SUCCESS().\n void OnTestPartResult(const testing::TestPartResult& test_part_result) override {\n printf(\"%s in %s:%d\\n%s\\n\",\n test_part_result.failed() ? \"*** Failure\" : \"Success\",\n test_part_result.file_name(),\n test_part_result.line_number(),\n test_part_result.summary());\n }\n\n // Called after a test ends.\n void OnTestEnd(const testing::TestInfo& test_info) override {\n printf(\"*** Test %s.%s ending.\\n\",\n test_info.test_suite_name(), test_info.name());\n }\n };\n```\n\n### Using Event Listeners\n\nTo use the event listener you have defined, add an instance of it to the\ngoogletest event listener list (represented by class\n[`TestEventListeners`](reference/testing.md#TestEventListeners) - note the \"s\"\nat the end of the name) in your `main()` function, before calling\n`RUN_ALL_TESTS()`:\n\n```c++\nint main(int argc, char** argv) {\n testing::InitGoogleTest(&argc, argv);\n // Gets hold of the event listener list.\n testing::TestEventListeners& listeners =\n testing::UnitTest::GetInstance()->listeners();\n // Adds a listener to the end. googletest takes the ownership.\n listeners.Append(new MinimalistPrinter);\n return RUN_ALL_TESTS();\n}\n```\n\nThere's only one problem: the default test result printer is still in effect, so\nits output will mingle with the output from your minimalist printer. To suppress\nthe default printer, just release it from the event listener list and delete it.\nYou can do so by adding one line:\n\n```c++\n ...\n delete listeners.Release(listeners.default_result_printer());\n listeners.Append(new MinimalistPrinter);\n return RUN_ALL_TESTS();\n```\n\nNow, sit back and enjoy a completely different output from your tests. For more\ndetails, see [sample9_unittest.cc].\n\n[sample9_unittest.cc]: https://github.com/google/googletest/blob/master/googletest/samples/sample9_unittest.cc \"Event listener example\"\n\nYou may append more than one listener to the list. When an `On*Start()` or\n`OnTestPartResult()` event is fired, the listeners will receive it in the order\nthey appear in the list (since new listeners are added to the end of the list,\nthe default text printer and the default XML generator will receive the event\nfirst). An `On*End()` event will be received by the listeners in the *reverse*\norder. This allows output by listeners added later to be framed by output from\nlisteners added earlier.\n\n### Generating Failures in Listeners\n\nYou may use failure-raising macros (`EXPECT_*()`, `ASSERT_*()`, `FAIL()`, etc)\nwhen processing an event. There are some restrictions:\n\n1. You cannot generate any failure in `OnTestPartResult()` (otherwise it will\n cause `OnTestPartResult()` to be called recursively).\n2. A listener that handles `OnTestPartResult()` is not allowed to generate any\n failure.\n\nWhen you add listeners to the listener list, you should put listeners that\nhandle `OnTestPartResult()` *before* listeners that can generate failures. This\nensures that failures generated by the latter are attributed to the right test\nby the former.\n\nSee [sample10_unittest.cc] for an example of a failure-raising listener.\n\n[sample10_unittest.cc]: https://github.com/google/googletest/blob/master/googletest/samples/sample10_unittest.cc \"Failure-raising listener example\"\n\n## Running Test Programs: Advanced Options\n\ngoogletest test programs are ordinary executables. Once built, you can run them\ndirectly and affect their behavior via the following environment variables\nand/or command line flags. For the flags to work, your programs must call\n`::testing::InitGoogleTest()` before calling `RUN_ALL_TESTS()`.\n\nTo see a list of supported flags and their usage, please run your test program\nwith the `--help` flag. You can also use `-h`, `-?`, or `/?` for short.\n\nIf an option is specified both by an environment variable and by a flag, the\nlatter takes precedence.\n\n### Selecting Tests\n\n#### Listing Test Names\n\nSometimes it is necessary to list the available tests in a program before\nrunning them so that a filter may be applied if needed. Including the flag\n`--gtest_list_tests` overrides all other flags and lists tests in the following\nformat:\n\n```none\nTestSuite1.\n TestName1\n TestName2\nTestSuite2.\n TestName\n```\n\nNone of the tests listed are actually run if the flag is provided. There is no\ncorresponding environment variable for this flag.\n\n#### Running a Subset of the Tests\n\nBy default, a googletest program runs all tests the user has defined. Sometimes,\nyou want to run only a subset of the tests (e.g. for debugging or quickly\nverifying a change). If you set the `GTEST_FILTER` environment variable or the\n`--gtest_filter` flag to a filter string, googletest will only run the tests\nwhose full names (in the form of `TestSuiteName.TestName`) match the filter.\n\nThe format of a filter is a '`:`'-separated list of wildcard patterns (called\nthe *positive patterns*) optionally followed by a '`-`' and another\n'`:`'-separated pattern list (called the *negative patterns*). A test matches\nthe filter if and only if it matches any of the positive patterns but does not\nmatch any of the negative patterns.\n\nA pattern may contain `'*'` (matches any string) or `'?'` (matches any single\ncharacter). For convenience, the filter `'*-NegativePatterns'` can be also\nwritten as `'-NegativePatterns'`.\n\nFor example:\n\n* `./foo_test` Has no flag, and thus runs all its tests.\n* `./foo_test --gtest_filter=*` Also runs everything, due to the single\n match-everything `*` value.\n* `./foo_test --gtest_filter=FooTest.*` Runs everything in test suite\n `FooTest` .\n* `./foo_test --gtest_filter=*Null*:*Constructor*` Runs any test whose full\n name contains either `\"Null\"` or `\"Constructor\"` .\n* `./foo_test --gtest_filter=-*DeathTest.*` Runs all non-death tests.\n* `./foo_test --gtest_filter=FooTest.*-FooTest.Bar` Runs everything in test\n suite `FooTest` except `FooTest.Bar`.\n* `./foo_test --gtest_filter=FooTest.*:BarTest.*-FooTest.Bar:BarTest.Foo` Runs\n everything in test suite `FooTest` except `FooTest.Bar` and everything in\n test suite `BarTest` except `BarTest.Foo`.\n\n#### Stop test execution upon first failure\n\nBy default, a googletest program runs all tests the user has defined. In some\ncases (e.g. iterative test development & execution) it may be desirable stop\ntest execution upon first failure (trading improved latency for completeness).\nIf `GTEST_FAIL_FAST` environment variable or `--gtest_fail_fast` flag is set,\nthe test runner will stop execution as soon as the first test failure is found.\n\n#### Temporarily Disabling Tests\n\nIf you have a broken test that you cannot fix right away, you can add the\n`DISABLED_` prefix to its name. This will exclude it from execution. This is\nbetter than commenting out the code or using `#if 0`, as disabled tests are\nstill compiled (and thus won't rot).\n\nIf you need to disable all tests in a test suite, you can either add `DISABLED_`\nto the front of the name of each test, or alternatively add it to the front of\nthe test suite name.\n\nFor example, the following tests won't be run by googletest, even though they\nwill still be compiled:\n\n```c++\n// Tests that Foo does Abc.\nTEST(FooTest, DISABLED_DoesAbc) { ... }\n\nclass DISABLED_BarTest : public testing::Test { ... };\n\n// Tests that Bar does Xyz.\nTEST_F(DISABLED_BarTest, DoesXyz) { ... }\n```\n\n{: .callout .note}\nNOTE: This feature should only be used for temporary pain-relief. You still have\nto fix the disabled tests at a later date. As a reminder, googletest will print\na banner warning you if a test program contains any disabled tests.\n\n{: .callout .tip}\nTIP: You can easily count the number of disabled tests you have using\n`grep`. This number can be used as a metric for\nimproving your test quality.\n\n#### Temporarily Enabling Disabled Tests\n\nTo include disabled tests in test execution, just invoke the test program with\nthe `--gtest_also_run_disabled_tests` flag or set the\n`GTEST_ALSO_RUN_DISABLED_TESTS` environment variable to a value other than `0`.\nYou can combine this with the `--gtest_filter` flag to further select which\ndisabled tests to run.\n\n### Repeating the Tests\n\nOnce in a while you'll run into a test whose result is hit-or-miss. Perhaps it\nwill fail only 1% of the time, making it rather hard to reproduce the bug under\na debugger. This can be a major source of frustration.\n\nThe `--gtest_repeat` flag allows you to repeat all (or selected) test methods in\na program many times. Hopefully, a flaky test will eventually fail and give you\na chance to debug. Here's how to use it:\n\n```none\n$ foo_test --gtest_repeat=1000\nRepeat foo_test 1000 times and don't stop at failures.\n\n$ foo_test --gtest_repeat=-1\nA negative count means repeating forever.\n\n$ foo_test --gtest_repeat=1000 --gtest_break_on_failure\nRepeat foo_test 1000 times, stopping at the first failure. This\nis especially useful when running under a debugger: when the test\nfails, it will drop into the debugger and you can then inspect\nvariables and stacks.\n\n$ foo_test --gtest_repeat=1000 --gtest_filter=FooBar.*\nRepeat the tests whose name matches the filter 1000 times.\n```\n\nIf your test program contains\n[global set-up/tear-down](#global-set-up-and-tear-down) code, it will be\nrepeated in each iteration as well, as the flakiness may be in it. You can also\nspecify the repeat count by setting the `GTEST_REPEAT` environment variable.\n\n### Shuffling the Tests\n\nYou can specify the `--gtest_shuffle` flag (or set the `GTEST_SHUFFLE`\nenvironment variable to `1`) to run the tests in a program in a random order.\nThis helps to reveal bad dependencies between tests.\n\nBy default, googletest uses a random seed calculated from the current time.\nTherefore you'll get a different order every time. The console output includes\nthe random seed value, such that you can reproduce an order-related test failure\nlater. To specify the random seed explicitly, use the `--gtest_random_seed=SEED`\nflag (or set the `GTEST_RANDOM_SEED` environment variable), where `SEED` is an\ninteger in the range [0, 99999]. The seed value 0 is special: it tells\ngoogletest to do the default behavior of calculating the seed from the current\ntime.\n\nIf you combine this with `--gtest_repeat=N`, googletest will pick a different\nrandom seed and re-shuffle the tests in each iteration.\n\n### Distributing Test Functions to Multiple Machines\n\nIf you have more than one machine you can use to run a test program, you might\nwant to run the test functions in parallel and get the result faster. We call\nthis technique *sharding*, where each machine is called a *shard*.\n\nGoogleTest is compatible with test sharding. To take advantage of this feature,\nyour test runner (not part of GoogleTest) needs to do the following:\n\n1. Allocate a number of machines (shards) to run the tests.\n1. On each shard, set the `GTEST_TOTAL_SHARDS` environment variable to the total\n number of shards. It must be the same for all shards.\n1. On each shard, set the `GTEST_SHARD_INDEX` environment variable to the index\n of the shard. Different shards must be assigned different indices, which\n must be in the range `[0, GTEST_TOTAL_SHARDS - 1]`.\n1. Run the same test program on all shards. When GoogleTest sees the above two\n environment variables, it will select a subset of the test functions to run.\n Across all shards, each test function in the program will be run exactly\n once.\n1. Wait for all shards to finish, then collect and report the results.\n\nYour project may have tests that were written without GoogleTest and thus don't\nunderstand this protocol. In order for your test runner to figure out which test\nsupports sharding, it can set the environment variable `GTEST_SHARD_STATUS_FILE`\nto a non-existent file path. If a test program supports sharding, it will create\nthis file to acknowledge that fact; otherwise it will not create it. The actual\ncontents of the file are not important at this time, although we may put some\nuseful information in it in the future.\n\nHere's an example to make it clear. Suppose you have a test program `foo_test`\nthat contains the following 5 test functions:\n\n```\nTEST(A, V)\nTEST(A, W)\nTEST(B, X)\nTEST(B, Y)\nTEST(B, Z)\n```\n\nSuppose you have 3 machines at your disposal. To run the test functions in\nparallel, you would set `GTEST_TOTAL_SHARDS` to 3 on all machines, and set\n`GTEST_SHARD_INDEX` to 0, 1, and 2 on the machines respectively. Then you would\nrun the same `foo_test` on each machine.\n\nGoogleTest reserves the right to change how the work is distributed across the\nshards, but here's one possible scenario:\n\n* Machine #0 runs `A.V` and `B.X`.\n* Machine #1 runs `A.W` and `B.Y`.\n* Machine #2 runs `B.Z`.\n\n### Controlling Test Output\n\n#### Colored Terminal Output\n\ngoogletest can use colors in its terminal output to make it easier to spot the\nimportant information:\n\n
...\n[----------] 1 test from FooTest\n[ RUN      ] FooTest.DoesAbc\n[       OK ] FooTest.DoesAbc\n[----------] 2 tests from BarTest\n[ RUN      ] BarTest.HasXyzProperty\n[       OK ] BarTest.HasXyzProperty\n[ RUN      ] BarTest.ReturnsTrueOnSuccess\n... some error messages ...\n[   FAILED ] BarTest.ReturnsTrueOnSuccess\n...\n[==========] 30 tests from 14 test suites ran.\n[   PASSED ] 28 tests.\n[   FAILED ] 2 tests, listed below:\n[   FAILED ] BarTest.ReturnsTrueOnSuccess\n[   FAILED ] AnotherTest.DoesXyz\n\n 2 FAILED TESTS\n
\n\nYou can set the `GTEST_COLOR` environment variable or the `--gtest_color`\ncommand line flag to `yes`, `no`, or `auto` (the default) to enable colors,\ndisable colors, or let googletest decide. When the value is `auto`, googletest\nwill use colors if and only if the output goes to a terminal and (on non-Windows\nplatforms) the `TERM` environment variable is set to `xterm` or `xterm-color`.\n\n#### Suppressing test passes\n\nBy default, googletest prints 1 line of output for each test, indicating if it\npassed or failed. To show only test failures, run the test program with\n`--gtest_brief=1`, or set the GTEST_BRIEF environment variable to `1`.\n\n#### Suppressing the Elapsed Time\n\nBy default, googletest prints the time it takes to run each test. To disable\nthat, run the test program with the `--gtest_print_time=0` command line flag, or\nset the GTEST_PRINT_TIME environment variable to `0`.\n\n#### Suppressing UTF-8 Text Output\n\nIn case of assertion failures, googletest prints expected and actual values of\ntype `string` both as hex-encoded strings as well as in readable UTF-8 text if\nthey contain valid non-ASCII UTF-8 characters. If you want to suppress the UTF-8\ntext because, for example, you don't have an UTF-8 compatible output medium, run\nthe test program with `--gtest_print_utf8=0` or set the `GTEST_PRINT_UTF8`\nenvironment variable to `0`.\n\n#### Generating an XML Report\n\ngoogletest can emit a detailed XML report to a file in addition to its normal\ntextual output. The report contains the duration of each test, and thus can help\nyou identify slow tests.\n\nTo generate the XML report, set the `GTEST_OUTPUT` environment variable or the\n`--gtest_output` flag to the string `\"xml:path_to_output_file\"`, which will\ncreate the file at the given location. You can also just use the string `\"xml\"`,\nin which case the output can be found in the `test_detail.xml` file in the\ncurrent directory.\n\nIf you specify a directory (for example, `\"xml:output/directory/\"` on Linux or\n`\"xml:output\\directory\\\"` on Windows), googletest will create the XML file in\nthat directory, named after the test executable (e.g. `foo_test.xml` for test\nprogram `foo_test` or `foo_test.exe`). If the file already exists (perhaps left\nover from a previous run), googletest will pick a different name (e.g.\n`foo_test_1.xml`) to avoid overwriting it.\n\nThe report is based on the `junitreport` Ant task. Since that format was\noriginally intended for Java, a little interpretation is required to make it\napply to googletest tests, as shown here:\n\n```xml\n\n \n \n \n \n \n \n \n\n```\n\n* The root `` element corresponds to the entire test program.\n* `` elements correspond to googletest test suites.\n* `` elements correspond to googletest test functions.\n\nFor instance, the following program\n\n```c++\nTEST(MathTest, Addition) { ... }\nTEST(MathTest, Subtraction) { ... }\nTEST(LogicTest, NonContradiction) { ... }\n```\n\ncould generate this report:\n\n```xml\n\n\n \n \n ...\n ...\n \n \n \n \n \n \n \n \n\n```\n\nThings to note:\n\n* The `tests` attribute of a `` or `` element tells how\n many test functions the googletest program or test suite contains, while the\n `failures` attribute tells how many of them failed.\n\n* The `time` attribute expresses the duration of the test, test suite, or\n entire test program in seconds.\n\n* The `timestamp` attribute records the local date and time of the test\n execution.\n\n* The `file` and `line` attributes record the source file location, where the\n test was defined.\n\n* Each `` element corresponds to a single failed googletest\n assertion.\n\n#### Generating a JSON Report\n\ngoogletest can also emit a JSON report as an alternative format to XML. To\ngenerate the JSON report, set the `GTEST_OUTPUT` environment variable or the\n`--gtest_output` flag to the string `\"json:path_to_output_file\"`, which will\ncreate the file at the given location. You can also just use the string\n`\"json\"`, in which case the output can be found in the `test_detail.json` file\nin the current directory.\n\nThe report format conforms to the following JSON Schema:\n\n```json\n{\n \"$schema\": \"http://json-schema.org/schema#\",\n \"type\": \"object\",\n \"definitions\": {\n \"TestCase\": {\n \"type\": \"object\",\n \"properties\": {\n \"name\": { \"type\": \"string\" },\n \"tests\": { \"type\": \"integer\" },\n \"failures\": { \"type\": \"integer\" },\n \"disabled\": { \"type\": \"integer\" },\n \"time\": { \"type\": \"string\" },\n \"testsuite\": {\n \"type\": \"array\",\n \"items\": {\n \"$ref\": \"#/definitions/TestInfo\"\n }\n }\n }\n },\n \"TestInfo\": {\n \"type\": \"object\",\n \"properties\": {\n \"name\": { \"type\": \"string\" },\n \"file\": { \"type\": \"string\" },\n \"line\": { \"type\": \"integer\" },\n \"status\": {\n \"type\": \"string\",\n \"enum\": [\"RUN\", \"NOTRUN\"]\n },\n \"time\": { \"type\": \"string\" },\n \"classname\": { \"type\": \"string\" },\n \"failures\": {\n \"type\": \"array\",\n \"items\": {\n \"$ref\": \"#/definitions/Failure\"\n }\n }\n }\n },\n \"Failure\": {\n \"type\": \"object\",\n \"properties\": {\n \"failures\": { \"type\": \"string\" },\n \"type\": { \"type\": \"string\" }\n }\n }\n },\n \"properties\": {\n \"tests\": { \"type\": \"integer\" },\n \"failures\": { \"type\": \"integer\" },\n \"disabled\": { \"type\": \"integer\" },\n \"errors\": { \"type\": \"integer\" },\n \"timestamp\": {\n \"type\": \"string\",\n \"format\": \"date-time\"\n },\n \"time\": { \"type\": \"string\" },\n \"name\": { \"type\": \"string\" },\n \"testsuites\": {\n \"type\": \"array\",\n \"items\": {\n \"$ref\": \"#/definitions/TestCase\"\n }\n }\n }\n}\n```\n\nThe report uses the format that conforms to the following Proto3 using the\n[JSON encoding](https://developers.google.com/protocol-buffers/docs/proto3#json):\n\n```proto\nsyntax = \"proto3\";\n\npackage googletest;\n\nimport \"google/protobuf/timestamp.proto\";\nimport \"google/protobuf/duration.proto\";\n\nmessage UnitTest {\n int32 tests = 1;\n int32 failures = 2;\n int32 disabled = 3;\n int32 errors = 4;\n google.protobuf.Timestamp timestamp = 5;\n google.protobuf.Duration time = 6;\n string name = 7;\n repeated TestCase testsuites = 8;\n}\n\nmessage TestCase {\n string name = 1;\n int32 tests = 2;\n int32 failures = 3;\n int32 disabled = 4;\n int32 errors = 5;\n google.protobuf.Duration time = 6;\n repeated TestInfo testsuite = 7;\n}\n\nmessage TestInfo {\n string name = 1;\n string file = 6;\n int32 line = 7;\n enum Status {\n RUN = 0;\n NOTRUN = 1;\n }\n Status status = 2;\n google.protobuf.Duration time = 3;\n string classname = 4;\n message Failure {\n string failures = 1;\n string type = 2;\n }\n repeated Failure failures = 5;\n}\n```\n\nFor instance, the following program\n\n```c++\nTEST(MathTest, Addition) { ... }\nTEST(MathTest, Subtraction) { ... }\nTEST(LogicTest, NonContradiction) { ... }\n```\n\ncould generate this report:\n\n```json\n{\n \"tests\": 3,\n \"failures\": 1,\n \"errors\": 0,\n \"time\": \"0.035s\",\n \"timestamp\": \"2011-10-31T18:52:42Z\",\n \"name\": \"AllTests\",\n \"testsuites\": [\n {\n \"name\": \"MathTest\",\n \"tests\": 2,\n \"failures\": 1,\n \"errors\": 0,\n \"time\": \"0.015s\",\n \"testsuite\": [\n {\n \"name\": \"Addition\",\n \"file\": \"test.cpp\",\n \"line\": 1,\n \"status\": \"RUN\",\n \"time\": \"0.007s\",\n \"classname\": \"\",\n \"failures\": [\n {\n \"message\": \"Value of: add(1, 1)\\n Actual: 3\\nExpected: 2\",\n \"type\": \"\"\n },\n {\n \"message\": \"Value of: add(1, -1)\\n Actual: 1\\nExpected: 0\",\n \"type\": \"\"\n }\n ]\n },\n {\n \"name\": \"Subtraction\",\n \"file\": \"test.cpp\",\n \"line\": 2,\n \"status\": \"RUN\",\n \"time\": \"0.005s\",\n \"classname\": \"\"\n }\n ]\n },\n {\n \"name\": \"LogicTest\",\n \"tests\": 1,\n \"failures\": 0,\n \"errors\": 0,\n \"time\": \"0.005s\",\n \"testsuite\": [\n {\n \"name\": \"NonContradiction\",\n \"file\": \"test.cpp\",\n \"line\": 3,\n \"status\": \"RUN\",\n \"time\": \"0.005s\",\n \"classname\": \"\"\n }\n ]\n }\n ]\n}\n```\n\n{: .callout .important}\nIMPORTANT: The exact format of the JSON document is subject to change.\n\n### Controlling How Failures Are Reported\n\n#### Detecting Test Premature Exit\n\nGoogle Test implements the _premature-exit-file_ protocol for test runners to\ncatch any kind of unexpected exits of test programs. Upon start, Google Test\ncreates the file which will be automatically deleted after all work has been\nfinished. Then, the test runner can check if this file exists. In case the file\nremains undeleted, the inspected test has exited prematurely.\n\nThis feature is enabled only if the `TEST_PREMATURE_EXIT_FILE` environment\nvariable has been set.\n\n#### Turning Assertion Failures into Break-Points\n\nWhen running test programs under a debugger, it's very convenient if the\ndebugger can catch an assertion failure and automatically drop into interactive\nmode. googletest's *break-on-failure* mode supports this behavior.\n\nTo enable it, set the `GTEST_BREAK_ON_FAILURE` environment variable to a value\nother than `0`. Alternatively, you can use the `--gtest_break_on_failure`\ncommand line flag.\n\n#### Disabling Catching Test-Thrown Exceptions\n\ngoogletest can be used either with or without exceptions enabled. If a test\nthrows a C++ exception or (on Windows) a structured exception (SEH), by default\ngoogletest catches it, reports it as a test failure, and continues with the next\ntest method. This maximizes the coverage of a test run. Also, on Windows an\nuncaught exception will cause a pop-up window, so catching the exceptions allows\nyou to run the tests automatically.\n\nWhen debugging the test failures, however, you may instead want the exceptions\nto be handled by the debugger, such that you can examine the call stack when an\nexception is thrown. To achieve that, set the `GTEST_CATCH_EXCEPTIONS`\nenvironment variable to `0`, or use the `--gtest_catch_exceptions=0` flag when\nrunning the tests.\n\n### Sanitizer Integration\n\nThe\n[Undefined Behavior Sanitizer](https://clang.llvm.org/docs/UndefinedBehaviorSanitizer.html),\n[Address Sanitizer](https://github.com/google/sanitizers/wiki/AddressSanitizer),\nand\n[Thread Sanitizer](https://github.com/google/sanitizers/wiki/ThreadSanitizerCppManual)\nall provide weak functions that you can override to trigger explicit failures\nwhen they detect sanitizer errors, such as creating a reference from `nullptr`.\nTo override these functions, place definitions for them in a source file that\nyou compile as part of your main binary:\n\n```\nextern \"C\" {\nvoid __ubsan_on_report() {\n FAIL() << \"Encountered an undefined behavior sanitizer error\";\n}\nvoid __asan_on_error() {\n FAIL() << \"Encountered an address sanitizer error\";\n}\nvoid __tsan_on_report() {\n FAIL() << \"Encountered a thread sanitizer error\";\n}\n} // extern \"C\"\n```\n\nAfter compiling your project with one of the sanitizers enabled, if a particular\ntest triggers a sanitizer error, googletest will report that it failed.\n" }, { "path": "3rd/googletest-1.12.1/docs/assets/css/style.scss", "content": "---\n---\n\n@import \"jekyll-theme-primer\";\n@import \"main\";\n" }, { "path": "3rd/googletest-1.12.1/docs/community_created_documentation.md", "content": "# Community-Created Documentation\n\nThe following is a list, in no particular order, of links to documentation\ncreated by the Googletest community.\n\n* [Googlemock Insights](https://github.com/ElectricRCAircraftGuy/eRCaGuy_dotfiles/blob/master/googletest/insights.md),\n by [ElectricRCAircraftGuy](https://github.com/ElectricRCAircraftGuy)\n" }, { "path": "3rd/googletest-1.12.1/docs/faq.md", "content": "# GoogleTest FAQ\n\n## Why should test suite names and test names not contain underscore?\n\n{: .callout .note}\nNote: GoogleTest reserves underscore (`_`) for special purpose keywords, such as\n[the `DISABLED_` prefix](advanced.md#temporarily-disabling-tests), in addition\nto the following rationale.\n\nUnderscore (`_`) is special, as C++ reserves the following to be used by the\ncompiler and the standard library:\n\n1. any identifier that starts with an `_` followed by an upper-case letter, and\n2. any identifier that contains two consecutive underscores (i.e. `__`)\n *anywhere* in its name.\n\nUser code is *prohibited* from using such identifiers.\n\nNow let's look at what this means for `TEST` and `TEST_F`.\n\nCurrently `TEST(TestSuiteName, TestName)` generates a class named\n`TestSuiteName_TestName_Test`. What happens if `TestSuiteName` or `TestName`\ncontains `_`?\n\n1. If `TestSuiteName` starts with an `_` followed by an upper-case letter (say,\n `_Foo`), we end up with `_Foo_TestName_Test`, which is reserved and thus\n invalid.\n2. If `TestSuiteName` ends with an `_` (say, `Foo_`), we get\n `Foo__TestName_Test`, which is invalid.\n3. If `TestName` starts with an `_` (say, `_Bar`), we get\n `TestSuiteName__Bar_Test`, which is invalid.\n4. If `TestName` ends with an `_` (say, `Bar_`), we get\n `TestSuiteName_Bar__Test`, which is invalid.\n\nSo clearly `TestSuiteName` and `TestName` cannot start or end with `_`\n(Actually, `TestSuiteName` can start with `_` -- as long as the `_` isn't\nfollowed by an upper-case letter. But that's getting complicated. So for\nsimplicity we just say that it cannot start with `_`.).\n\nIt may seem fine for `TestSuiteName` and `TestName` to contain `_` in the\nmiddle. However, consider this:\n\n```c++\nTEST(Time, Flies_Like_An_Arrow) { ... }\nTEST(Time_Flies, Like_An_Arrow) { ... }\n```\n\nNow, the two `TEST`s will both generate the same class\n(`Time_Flies_Like_An_Arrow_Test`). That's not good.\n\nSo for simplicity, we just ask the users to avoid `_` in `TestSuiteName` and\n`TestName`. The rule is more constraining than necessary, but it's simple and\neasy to remember. It also gives GoogleTest some wiggle room in case its\nimplementation needs to change in the future.\n\nIf you violate the rule, there may not be immediate consequences, but your test\nmay (just may) break with a new compiler (or a new version of the compiler you\nare using) or with a new version of GoogleTest. Therefore it's best to follow\nthe rule.\n\n## Why does GoogleTest support `EXPECT_EQ(NULL, ptr)` and `ASSERT_EQ(NULL, ptr)` but not `EXPECT_NE(NULL, ptr)` and `ASSERT_NE(NULL, ptr)`?\n\nFirst of all, you can use `nullptr` with each of these macros, e.g.\n`EXPECT_EQ(ptr, nullptr)`, `EXPECT_NE(ptr, nullptr)`, `ASSERT_EQ(ptr, nullptr)`,\n`ASSERT_NE(ptr, nullptr)`. This is the preferred syntax in the style guide\nbecause `nullptr` does not have the type problems that `NULL` does.\n\nDue to some peculiarity of C++, it requires some non-trivial template meta\nprogramming tricks to support using `NULL` as an argument of the `EXPECT_XX()`\nand `ASSERT_XX()` macros. Therefore we only do it where it's most needed\n(otherwise we make the implementation of GoogleTest harder to maintain and more\nerror-prone than necessary).\n\nHistorically, the `EXPECT_EQ()` macro took the *expected* value as its first\nargument and the *actual* value as the second, though this argument order is now\ndiscouraged. It was reasonable that someone wanted\nto write `EXPECT_EQ(NULL, some_expression)`, and this indeed was requested\nseveral times. Therefore we implemented it.\n\nThe need for `EXPECT_NE(NULL, ptr)` wasn't nearly as strong. When the assertion\nfails, you already know that `ptr` must be `NULL`, so it doesn't add any\ninformation to print `ptr` in this case. That means `EXPECT_TRUE(ptr != NULL)`\nworks just as well.\n\nIf we were to support `EXPECT_NE(NULL, ptr)`, for consistency we'd have to\nsupport `EXPECT_NE(ptr, NULL)` as well. This means using the template meta\nprogramming tricks twice in the implementation, making it even harder to\nunderstand and maintain. We believe the benefit doesn't justify the cost.\n\nFinally, with the growth of the gMock matcher library, we are encouraging people\nto use the unified `EXPECT_THAT(value, matcher)` syntax more often in tests. One\nsignificant advantage of the matcher approach is that matchers can be easily\ncombined to form new matchers, while the `EXPECT_NE`, etc, macros cannot be\neasily combined. Therefore we want to invest more in the matchers than in the\n`EXPECT_XX()` macros.\n\n## I need to test that different implementations of an interface satisfy some common requirements. Should I use typed tests or value-parameterized tests?\n\nFor testing various implementations of the same interface, either typed tests or\nvalue-parameterized tests can get it done. It's really up to you the user to\ndecide which is more convenient for you, depending on your particular case. Some\nrough guidelines:\n\n* Typed tests can be easier to write if instances of the different\n implementations can be created the same way, modulo the type. For example,\n if all these implementations have a public default constructor (such that\n you can write `new TypeParam`), or if their factory functions have the same\n form (e.g. `CreateInstance()`).\n* Value-parameterized tests can be easier to write if you need different code\n patterns to create different implementations' instances, e.g. `new Foo` vs\n `new Bar(5)`. To accommodate for the differences, you can write factory\n function wrappers and pass these function pointers to the tests as their\n parameters.\n* When a typed test fails, the default output includes the name of the type,\n which can help you quickly identify which implementation is wrong.\n Value-parameterized tests only show the number of the failed iteration by\n default. You will need to define a function that returns the iteration name\n and pass it as the third parameter to INSTANTIATE_TEST_SUITE_P to have more\n useful output.\n* When using typed tests, you need to make sure you are testing against the\n interface type, not the concrete types (in other words, you want to make\n sure `implicit_cast(my_concrete_impl)` works, not just that\n `my_concrete_impl` works). It's less likely to make mistakes in this area\n when using value-parameterized tests.\n\nI hope I didn't confuse you more. :-) If you don't mind, I'd suggest you to give\nboth approaches a try. Practice is a much better way to grasp the subtle\ndifferences between the two tools. Once you have some concrete experience, you\ncan much more easily decide which one to use the next time.\n\n## I got some run-time errors about invalid proto descriptors when using `ProtocolMessageEquals`. Help!\n\n{: .callout .note}\n**Note:** `ProtocolMessageEquals` and `ProtocolMessageEquiv` are *deprecated*\nnow. Please use `EqualsProto`, etc instead.\n\n`ProtocolMessageEquals` and `ProtocolMessageEquiv` were redefined recently and\nare now less tolerant of invalid protocol buffer definitions. In particular, if\nyou have a `foo.proto` that doesn't fully qualify the type of a protocol message\nit references (e.g. `message` where it should be `message`), you\nwill now get run-time errors like:\n\n```\n... descriptor.cc:...] Invalid proto descriptor for file \"path/to/foo.proto\":\n... descriptor.cc:...] blah.MyMessage.my_field: \".Bar\" is not defined.\n```\n\nIf you see this, your `.proto` file is broken and needs to be fixed by making\nthe types fully qualified. The new definition of `ProtocolMessageEquals` and\n`ProtocolMessageEquiv` just happen to reveal your bug.\n\n## My death test modifies some state, but the change seems lost after the death test finishes. Why?\n\nDeath tests (`EXPECT_DEATH`, etc) are executed in a sub-process s.t. the\nexpected crash won't kill the test program (i.e. the parent process). As a\nresult, any in-memory side effects they incur are observable in their respective\nsub-processes, but not in the parent process. You can think of them as running\nin a parallel universe, more or less.\n\nIn particular, if you use mocking and the death test statement invokes some mock\nmethods, the parent process will think the calls have never occurred. Therefore,\nyou may want to move your `EXPECT_CALL` statements inside the `EXPECT_DEATH`\nmacro.\n\n## EXPECT_EQ(htonl(blah), blah_blah) generates weird compiler errors in opt mode. Is this a GoogleTest bug?\n\nActually, the bug is in `htonl()`.\n\nAccording to `'man htonl'`, `htonl()` is a *function*, which means it's valid to\nuse `htonl` as a function pointer. However, in opt mode `htonl()` is defined as\na *macro*, which breaks this usage.\n\nWorse, the macro definition of `htonl()` uses a `gcc` extension and is *not*\nstandard C++. That hacky implementation has some ad hoc limitations. In\nparticular, it prevents you from writing `Foo()`, where `Foo`\nis a template that has an integral argument.\n\nThe implementation of `EXPECT_EQ(a, b)` uses `sizeof(... a ...)` inside a\ntemplate argument, and thus doesn't compile in opt mode when `a` contains a call\nto `htonl()`. It is difficult to make `EXPECT_EQ` bypass the `htonl()` bug, as\nthe solution must work with different compilers on various platforms.\n\n## The compiler complains about \"undefined references\" to some static const member variables, but I did define them in the class body. What's wrong?\n\nIf your class has a static data member:\n\n```c++\n// foo.h\nclass Foo {\n ...\n static const int kBar = 100;\n};\n```\n\nYou also need to define it *outside* of the class body in `foo.cc`:\n\n```c++\nconst int Foo::kBar; // No initializer here.\n```\n\nOtherwise your code is **invalid C++**, and may break in unexpected ways. In\nparticular, using it in GoogleTest comparison assertions (`EXPECT_EQ`, etc) will\ngenerate an \"undefined reference\" linker error. The fact that \"it used to work\"\ndoesn't mean it's valid. It just means that you were lucky. :-)\n\nIf the declaration of the static data member is `constexpr` then it is\nimplicitly an `inline` definition, and a separate definition in `foo.cc` is not\nneeded:\n\n```c++\n// foo.h\nclass Foo {\n ...\n static constexpr int kBar = 100; // Defines kBar, no need to do it in foo.cc.\n};\n```\n\n## Can I derive a test fixture from another?\n\nYes.\n\nEach test fixture has a corresponding and same named test suite. This means only\none test suite can use a particular fixture. Sometimes, however, multiple test\ncases may want to use the same or slightly different fixtures. For example, you\nmay want to make sure that all of a GUI library's test suites don't leak\nimportant system resources like fonts and brushes.\n\nIn GoogleTest, you share a fixture among test suites by putting the shared logic\nin a base test fixture, then deriving from that base a separate fixture for each\ntest suite that wants to use this common logic. You then use `TEST_F()` to write\ntests using each derived fixture.\n\nTypically, your code looks like this:\n\n```c++\n// Defines a base test fixture.\nclass BaseTest : public ::testing::Test {\n protected:\n ...\n};\n\n// Derives a fixture FooTest from BaseTest.\nclass FooTest : public BaseTest {\n protected:\n void SetUp() override {\n BaseTest::SetUp(); // Sets up the base fixture first.\n ... additional set-up work ...\n }\n\n void TearDown() override {\n ... clean-up work for FooTest ...\n BaseTest::TearDown(); // Remember to tear down the base fixture\n // after cleaning up FooTest!\n }\n\n ... functions and variables for FooTest ...\n};\n\n// Tests that use the fixture FooTest.\nTEST_F(FooTest, Bar) { ... }\nTEST_F(FooTest, Baz) { ... }\n\n... additional fixtures derived from BaseTest ...\n```\n\nIf necessary, you can continue to derive test fixtures from a derived fixture.\nGoogleTest has no limit on how deep the hierarchy can be.\n\nFor a complete example using derived test fixtures, see\n[sample5_unittest.cc](https://github.com/google/googletest/blob/master/googletest/samples/sample5_unittest.cc).\n\n## My compiler complains \"void value not ignored as it ought to be.\" What does this mean?\n\nYou're probably using an `ASSERT_*()` in a function that doesn't return `void`.\n`ASSERT_*()` can only be used in `void` functions, due to exceptions being\ndisabled by our build system. Please see more details\n[here](advanced.md#assertion-placement).\n\n## My death test hangs (or seg-faults). How do I fix it?\n\nIn GoogleTest, death tests are run in a child process and the way they work is\ndelicate. To write death tests you really need to understand how they work—see\nthe details at [Death Assertions](reference/assertions.md#death) in the\nAssertions Reference.\n\nIn particular, death tests don't like having multiple threads in the parent\nprocess. So the first thing you can try is to eliminate creating threads outside\nof `EXPECT_DEATH()`. For example, you may want to use mocks or fake objects\ninstead of real ones in your tests.\n\nSometimes this is impossible as some library you must use may be creating\nthreads before `main()` is even reached. In this case, you can try to minimize\nthe chance of conflicts by either moving as many activities as possible inside\n`EXPECT_DEATH()` (in the extreme case, you want to move everything inside), or\nleaving as few things as possible in it. Also, you can try to set the death test\nstyle to `\"threadsafe\"`, which is safer but slower, and see if it helps.\n\nIf you go with thread-safe death tests, remember that they rerun the test\nprogram from the beginning in the child process. Therefore make sure your\nprogram can run side-by-side with itself and is deterministic.\n\nIn the end, this boils down to good concurrent programming. You have to make\nsure that there are no race conditions or deadlocks in your program. No silver\nbullet - sorry!\n\n## Should I use the constructor/destructor of the test fixture or SetUp()/TearDown()? {#CtorVsSetUp}\n\nThe first thing to remember is that GoogleTest does **not** reuse the same test\nfixture object across multiple tests. For each `TEST_F`, GoogleTest will create\na **fresh** test fixture object, immediately call `SetUp()`, run the test body,\ncall `TearDown()`, and then delete the test fixture object.\n\nWhen you need to write per-test set-up and tear-down logic, you have the choice\nbetween using the test fixture constructor/destructor or `SetUp()/TearDown()`.\nThe former is usually preferred, as it has the following benefits:\n\n* By initializing a member variable in the constructor, we have the option to\n make it `const`, which helps prevent accidental changes to its value and\n makes the tests more obviously correct.\n* In case we need to subclass the test fixture class, the subclass'\n constructor is guaranteed to call the base class' constructor *first*, and\n the subclass' destructor is guaranteed to call the base class' destructor\n *afterward*. With `SetUp()/TearDown()`, a subclass may make the mistake of\n forgetting to call the base class' `SetUp()/TearDown()` or call them at the\n wrong time.\n\nYou may still want to use `SetUp()/TearDown()` in the following cases:\n\n* C++ does not allow virtual function calls in constructors and destructors.\n You can call a method declared as virtual, but it will not use dynamic\n dispatch. It will use the definition from the class the constructor of which\n is currently executing. This is because calling a virtual method before the\n derived class constructor has a chance to run is very dangerous - the\n virtual method might operate on uninitialized data. Therefore, if you need\n to call a method that will be overridden in a derived class, you have to use\n `SetUp()/TearDown()`.\n* In the body of a constructor (or destructor), it's not possible to use the\n `ASSERT_xx` macros. Therefore, if the set-up operation could cause a fatal\n test failure that should prevent the test from running, it's necessary to\n use `abort` and abort the whole test\n executable, or to use `SetUp()` instead of a constructor.\n* If the tear-down operation could throw an exception, you must use\n `TearDown()` as opposed to the destructor, as throwing in a destructor leads\n to undefined behavior and usually will kill your program right away. Note\n that many standard libraries (like STL) may throw when exceptions are\n enabled in the compiler. Therefore you should prefer `TearDown()` if you\n want to write portable tests that work with or without exceptions.\n* The GoogleTest team is considering making the assertion macros throw on\n platforms where exceptions are enabled (e.g. Windows, Mac OS, and Linux\n client-side), which will eliminate the need for the user to propagate\n failures from a subroutine to its caller. Therefore, you shouldn't use\n GoogleTest assertions in a destructor if your code could run on such a\n platform.\n\n## The compiler complains \"no matching function to call\" when I use ASSERT_PRED*. How do I fix it?\n\nSee details for [`EXPECT_PRED*`](reference/assertions.md#EXPECT_PRED) in the\nAssertions Reference.\n\n## My compiler complains about \"ignoring return value\" when I call RUN_ALL_TESTS(). Why?\n\nSome people had been ignoring the return value of `RUN_ALL_TESTS()`. That is,\ninstead of\n\n```c++\n return RUN_ALL_TESTS();\n```\n\nthey write\n\n```c++\n RUN_ALL_TESTS();\n```\n\nThis is **wrong and dangerous**. The testing services needs to see the return\nvalue of `RUN_ALL_TESTS()` in order to determine if a test has passed. If your\n`main()` function ignores it, your test will be considered successful even if it\nhas a GoogleTest assertion failure. Very bad.\n\nWe have decided to fix this (thanks to Michael Chastain for the idea). Now, your\ncode will no longer be able to ignore `RUN_ALL_TESTS()` when compiled with\n`gcc`. If you do so, you'll get a compiler error.\n\nIf you see the compiler complaining about you ignoring the return value of\n`RUN_ALL_TESTS()`, the fix is simple: just make sure its value is used as the\nreturn value of `main()`.\n\nBut how could we introduce a change that breaks existing tests? Well, in this\ncase, the code was already broken in the first place, so we didn't break it. :-)\n\n## My compiler complains that a constructor (or destructor) cannot return a value. What's going on?\n\nDue to a peculiarity of C++, in order to support the syntax for streaming\nmessages to an `ASSERT_*`, e.g.\n\n```c++\n ASSERT_EQ(1, Foo()) << \"blah blah\" << foo;\n```\n\nwe had to give up using `ASSERT*` and `FAIL*` (but not `EXPECT*` and\n`ADD_FAILURE*`) in constructors and destructors. The workaround is to move the\ncontent of your constructor/destructor to a private void member function, or\nswitch to `EXPECT_*()` if that works. This\n[section](advanced.md#assertion-placement) in the user's guide explains it.\n\n## My SetUp() function is not called. Why?\n\nC++ is case-sensitive. Did you spell it as `Setup()`?\n\nSimilarly, sometimes people spell `SetUpTestSuite()` as `SetupTestSuite()` and\nwonder why it's never called.\n\n## I have several test suites which share the same test fixture logic, do I have to define a new test fixture class for each of them? This seems pretty tedious.\n\nYou don't have to. Instead of\n\n```c++\nclass FooTest : public BaseTest {};\n\nTEST_F(FooTest, Abc) { ... }\nTEST_F(FooTest, Def) { ... }\n\nclass BarTest : public BaseTest {};\n\nTEST_F(BarTest, Abc) { ... }\nTEST_F(BarTest, Def) { ... }\n```\n\nyou can simply `typedef` the test fixtures:\n\n```c++\ntypedef BaseTest FooTest;\n\nTEST_F(FooTest, Abc) { ... }\nTEST_F(FooTest, Def) { ... }\n\ntypedef BaseTest BarTest;\n\nTEST_F(BarTest, Abc) { ... }\nTEST_F(BarTest, Def) { ... }\n```\n\n## GoogleTest output is buried in a whole bunch of LOG messages. What do I do?\n\nThe GoogleTest output is meant to be a concise and human-friendly report. If\nyour test generates textual output itself, it will mix with the GoogleTest\noutput, making it hard to read. However, there is an easy solution to this\nproblem.\n\nSince `LOG` messages go to stderr, we decided to let GoogleTest output go to\nstdout. This way, you can easily separate the two using redirection. For\nexample:\n\n```shell\n$ ./my_test > gtest_output.txt\n```\n\n## Why should I prefer test fixtures over global variables?\n\nThere are several good reasons:\n\n1. It's likely your test needs to change the states of its global variables.\n This makes it difficult to keep side effects from escaping one test and\n contaminating others, making debugging difficult. By using fixtures, each\n test has a fresh set of variables that's different (but with the same\n names). Thus, tests are kept independent of each other.\n2. Global variables pollute the global namespace.\n3. Test fixtures can be reused via subclassing, which cannot be done easily\n with global variables. This is useful if many test suites have something in\n common.\n\n## What can the statement argument in ASSERT_DEATH() be?\n\n`ASSERT_DEATH(statement, matcher)` (or any death assertion macro) can be used\nwherever *`statement`* is valid. So basically *`statement`* can be any C++\nstatement that makes sense in the current context. In particular, it can\nreference global and/or local variables, and can be:\n\n* a simple function call (often the case),\n* a complex expression, or\n* a compound statement.\n\nSome examples are shown here:\n\n```c++\n// A death test can be a simple function call.\nTEST(MyDeathTest, FunctionCall) {\n ASSERT_DEATH(Xyz(5), \"Xyz failed\");\n}\n\n// Or a complex expression that references variables and functions.\nTEST(MyDeathTest, ComplexExpression) {\n const bool c = Condition();\n ASSERT_DEATH((c ? Func1(0) : object2.Method(\"test\")),\n \"(Func1|Method) failed\");\n}\n\n// Death assertions can be used anywhere in a function. In\n// particular, they can be inside a loop.\nTEST(MyDeathTest, InsideLoop) {\n // Verifies that Foo(0), Foo(1), ..., and Foo(4) all die.\n for (int i = 0; i < 5; i++) {\n EXPECT_DEATH_M(Foo(i), \"Foo has \\\\d+ errors\",\n ::testing::Message() << \"where i is \" << i);\n }\n}\n\n// A death assertion can contain a compound statement.\nTEST(MyDeathTest, CompoundStatement) {\n // Verifies that at lease one of Bar(0), Bar(1), ..., and\n // Bar(4) dies.\n ASSERT_DEATH({\n for (int i = 0; i < 5; i++) {\n Bar(i);\n }\n },\n \"Bar has \\\\d+ errors\");\n}\n```\n\n## I have a fixture class `FooTest`, but `TEST_F(FooTest, Bar)` gives me error ``\"no matching function for call to `FooTest::FooTest()'\"``. Why?\n\nGoogleTest needs to be able to create objects of your test fixture class, so it\nmust have a default constructor. Normally the compiler will define one for you.\nHowever, there are cases where you have to define your own:\n\n* If you explicitly declare a non-default constructor for class `FooTest`\n (`DISALLOW_EVIL_CONSTRUCTORS()` does this), then you need to define a\n default constructor, even if it would be empty.\n* If `FooTest` has a const non-static data member, then you have to define the\n default constructor *and* initialize the const member in the initializer\n list of the constructor. (Early versions of `gcc` doesn't force you to\n initialize the const member. It's a bug that has been fixed in `gcc 4`.)\n\n## Why does ASSERT_DEATH complain about previous threads that were already joined?\n\nWith the Linux pthread library, there is no turning back once you cross the line\nfrom a single thread to multiple threads. The first time you create a thread, a\nmanager thread is created in addition, so you get 3, not 2, threads. Later when\nthe thread you create joins the main thread, the thread count decrements by 1,\nbut the manager thread will never be killed, so you still have 2 threads, which\nmeans you cannot safely run a death test.\n\nThe new NPTL thread library doesn't suffer from this problem, as it doesn't\ncreate a manager thread. However, if you don't control which machine your test\nruns on, you shouldn't depend on this.\n\n## Why does GoogleTest require the entire test suite, instead of individual tests, to be named *DeathTest when it uses ASSERT_DEATH?\n\nGoogleTest does not interleave tests from different test suites. That is, it\nruns all tests in one test suite first, and then runs all tests in the next test\nsuite, and so on. GoogleTest does this because it needs to set up a test suite\nbefore the first test in it is run, and tear it down afterwards. Splitting up\nthe test case would require multiple set-up and tear-down processes, which is\ninefficient and makes the semantics unclean.\n\nIf we were to determine the order of tests based on test name instead of test\ncase name, then we would have a problem with the following situation:\n\n```c++\nTEST_F(FooTest, AbcDeathTest) { ... }\nTEST_F(FooTest, Uvw) { ... }\n\nTEST_F(BarTest, DefDeathTest) { ... }\nTEST_F(BarTest, Xyz) { ... }\n```\n\nSince `FooTest.AbcDeathTest` needs to run before `BarTest.Xyz`, and we don't\ninterleave tests from different test suites, we need to run all tests in the\n`FooTest` case before running any test in the `BarTest` case. This contradicts\nwith the requirement to run `BarTest.DefDeathTest` before `FooTest.Uvw`.\n\n## But I don't like calling my entire test suite \\*DeathTest when it contains both death tests and non-death tests. What do I do?\n\nYou don't have to, but if you like, you may split up the test suite into\n`FooTest` and `FooDeathTest`, where the names make it clear that they are\nrelated:\n\n```c++\nclass FooTest : public ::testing::Test { ... };\n\nTEST_F(FooTest, Abc) { ... }\nTEST_F(FooTest, Def) { ... }\n\nusing FooDeathTest = FooTest;\n\nTEST_F(FooDeathTest, Uvw) { ... EXPECT_DEATH(...) ... }\nTEST_F(FooDeathTest, Xyz) { ... ASSERT_DEATH(...) ... }\n```\n\n## GoogleTest prints the LOG messages in a death test's child process only when the test fails. How can I see the LOG messages when the death test succeeds?\n\nPrinting the LOG messages generated by the statement inside `EXPECT_DEATH()`\nmakes it harder to search for real problems in the parent's log. Therefore,\nGoogleTest only prints them when the death test has failed.\n\nIf you really need to see such LOG messages, a workaround is to temporarily\nbreak the death test (e.g. by changing the regex pattern it is expected to\nmatch). Admittedly, this is a hack. We'll consider a more permanent solution\nafter the fork-and-exec-style death tests are implemented.\n\n## The compiler complains about `no match for 'operator<<'` when I use an assertion. What gives?\n\nIf you use a user-defined type `FooType` in an assertion, you must make sure\nthere is an `std::ostream& operator<<(std::ostream&, const FooType&)` function\ndefined such that we can print a value of `FooType`.\n\nIn addition, if `FooType` is declared in a name space, the `<<` operator also\nneeds to be defined in the *same* name space. See\n[Tip of the Week #49](http://abseil.io/tips/49) for details.\n\n## How do I suppress the memory leak messages on Windows?\n\nSince the statically initialized GoogleTest singleton requires allocations on\nthe heap, the Visual C++ memory leak detector will report memory leaks at the\nend of the program run. The easiest way to avoid this is to use the\n`_CrtMemCheckpoint` and `_CrtMemDumpAllObjectsSince` calls to not report any\nstatically initialized heap objects. See MSDN for more details and additional\nheap check/debug routines.\n\n## How can my code detect if it is running in a test?\n\nIf you write code that sniffs whether it's running in a test and does different\nthings accordingly, you are leaking test-only logic into production code and\nthere is no easy way to ensure that the test-only code paths aren't run by\nmistake in production. Such cleverness also leads to\n[Heisenbugs](https://en.wikipedia.org/wiki/Heisenbug). Therefore we strongly\nadvise against the practice, and GoogleTest doesn't provide a way to do it.\n\nIn general, the recommended way to cause the code to behave differently under\ntest is [Dependency Injection](http://en.wikipedia.org/wiki/Dependency_injection). You can inject\ndifferent functionality from the test and from the production code. Since your\nproduction code doesn't link in the for-test logic at all (the\n[`testonly`](http://docs.bazel.build/versions/master/be/common-definitions.html#common.testonly) attribute for BUILD targets helps to ensure\nthat), there is no danger in accidentally running it.\n\nHowever, if you *really*, *really*, *really* have no choice, and if you follow\nthe rule of ending your test program names with `_test`, you can use the\n*horrible* hack of sniffing your executable name (`argv[0]` in `main()`) to know\nwhether the code is under test.\n\n## How do I temporarily disable a test?\n\nIf you have a broken test that you cannot fix right away, you can add the\n`DISABLED_` prefix to its name. This will exclude it from execution. This is\nbetter than commenting out the code or using `#if 0`, as disabled tests are\nstill compiled (and thus won't rot).\n\nTo include disabled tests in test execution, just invoke the test program with\nthe `--gtest_also_run_disabled_tests` flag.\n\n## Is it OK if I have two separate `TEST(Foo, Bar)` test methods defined in different namespaces?\n\nYes.\n\nThe rule is **all test methods in the same test suite must use the same fixture\nclass.** This means that the following is **allowed** because both tests use the\nsame fixture class (`::testing::Test`).\n\n```c++\nnamespace foo {\nTEST(CoolTest, DoSomething) {\n SUCCEED();\n}\n} // namespace foo\n\nnamespace bar {\nTEST(CoolTest, DoSomething) {\n SUCCEED();\n}\n} // namespace bar\n```\n\nHowever, the following code is **not allowed** and will produce a runtime error\nfrom GoogleTest because the test methods are using different test fixture\nclasses with the same test suite name.\n\n```c++\nnamespace foo {\nclass CoolTest : public ::testing::Test {}; // Fixture foo::CoolTest\nTEST_F(CoolTest, DoSomething) {\n SUCCEED();\n}\n} // namespace foo\n\nnamespace bar {\nclass CoolTest : public ::testing::Test {}; // Fixture: bar::CoolTest\nTEST_F(CoolTest, DoSomething) {\n SUCCEED();\n}\n} // namespace bar\n```\n" }, { "path": "3rd/googletest-1.12.1/docs/gmock_cheat_sheet.md", "content": "# gMock Cheat Sheet\n\n## Defining a Mock Class\n\n### Mocking a Normal Class {#MockClass}\n\nGiven\n\n```cpp\nclass Foo {\n public:\n virtual ~Foo();\n virtual int GetSize() const = 0;\n virtual string Describe(const char* name) = 0;\n virtual string Describe(int type) = 0;\n virtual bool Process(Bar elem, int count) = 0;\n};\n```\n\n(note that `~Foo()` **must** be virtual) we can define its mock as\n\n```cpp\n#include \"gmock/gmock.h\"\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(int, GetSize, (), (const, override));\n MOCK_METHOD(string, Describe, (const char* name), (override));\n MOCK_METHOD(string, Describe, (int type), (override));\n MOCK_METHOD(bool, Process, (Bar elem, int count), (override));\n};\n```\n\nTo create a \"nice\" mock, which ignores all uninteresting calls, a \"naggy\" mock,\nwhich warns on all uninteresting calls, or a \"strict\" mock, which treats them as\nfailures:\n\n```cpp\nusing ::testing::NiceMock;\nusing ::testing::NaggyMock;\nusing ::testing::StrictMock;\n\nNiceMock nice_foo; // The type is a subclass of MockFoo.\nNaggyMock naggy_foo; // The type is a subclass of MockFoo.\nStrictMock strict_foo; // The type is a subclass of MockFoo.\n```\n\n{: .callout .note}\n**Note:** A mock object is currently naggy by default. We may make it nice by\ndefault in the future.\n\n### Mocking a Class Template {#MockTemplate}\n\nClass templates can be mocked just like any class.\n\nTo mock\n\n```cpp\ntemplate \nclass StackInterface {\n public:\n virtual ~StackInterface();\n virtual int GetSize() const = 0;\n virtual void Push(const Elem& x) = 0;\n};\n```\n\n(note that all member functions that are mocked, including `~StackInterface()`\n**must** be virtual).\n\n```cpp\ntemplate \nclass MockStack : public StackInterface {\n public:\n MOCK_METHOD(int, GetSize, (), (const, override));\n MOCK_METHOD(void, Push, (const Elem& x), (override));\n};\n```\n\n### Specifying Calling Conventions for Mock Functions\n\nIf your mock function doesn't use the default calling convention, you can\nspecify it by adding `Calltype(convention)` to `MOCK_METHOD`'s 4th parameter.\nFor example,\n\n```cpp\n MOCK_METHOD(bool, Foo, (int n), (Calltype(STDMETHODCALLTYPE)));\n MOCK_METHOD(int, Bar, (double x, double y),\n (const, Calltype(STDMETHODCALLTYPE)));\n```\n\nwhere `STDMETHODCALLTYPE` is defined by `` on Windows.\n\n## Using Mocks in Tests {#UsingMocks}\n\nThe typical work flow is:\n\n1. Import the gMock names you need to use. All gMock symbols are in the\n `testing` namespace unless they are macros or otherwise noted.\n2. Create the mock objects.\n3. Optionally, set the default actions of the mock objects.\n4. Set your expectations on the mock objects (How will they be called? What\n will they do?).\n5. Exercise code that uses the mock objects; if necessary, check the result\n using googletest assertions.\n6. When a mock object is destructed, gMock automatically verifies that all\n expectations on it have been satisfied.\n\nHere's an example:\n\n```cpp\nusing ::testing::Return; // #1\n\nTEST(BarTest, DoesThis) {\n MockFoo foo; // #2\n\n ON_CALL(foo, GetSize()) // #3\n .WillByDefault(Return(1));\n // ... other default actions ...\n\n EXPECT_CALL(foo, Describe(5)) // #4\n .Times(3)\n .WillRepeatedly(Return(\"Category 5\"));\n // ... other expectations ...\n\n EXPECT_EQ(MyProductionFunction(&foo), \"good\"); // #5\n} // #6\n```\n\n## Setting Default Actions {#OnCall}\n\ngMock has a **built-in default action** for any function that returns `void`,\n`bool`, a numeric value, or a pointer. In C++11, it will additionally returns\nthe default-constructed value, if one exists for the given type.\n\nTo customize the default action for functions with return type `T`, use\n[`DefaultValue`](reference/mocking.md#DefaultValue). For example:\n\n```cpp\n // Sets the default action for return type std::unique_ptr to\n // creating a new Buzz every time.\n DefaultValue>::SetFactory(\n [] { return MakeUnique(AccessLevel::kInternal); });\n\n // When this fires, the default action of MakeBuzz() will run, which\n // will return a new Buzz object.\n EXPECT_CALL(mock_buzzer_, MakeBuzz(\"hello\")).Times(AnyNumber());\n\n auto buzz1 = mock_buzzer_.MakeBuzz(\"hello\");\n auto buzz2 = mock_buzzer_.MakeBuzz(\"hello\");\n EXPECT_NE(buzz1, nullptr);\n EXPECT_NE(buzz2, nullptr);\n EXPECT_NE(buzz1, buzz2);\n\n // Resets the default action for return type std::unique_ptr,\n // to avoid interfere with other tests.\n DefaultValue>::Clear();\n```\n\nTo customize the default action for a particular method of a specific mock\nobject, use [`ON_CALL`](reference/mocking.md#ON_CALL). `ON_CALL` has a similar\nsyntax to `EXPECT_CALL`, but it is used for setting default behaviors when you\ndo not require that the mock method is called. See\n[Knowing When to Expect](gmock_cook_book.md#UseOnCall) for a more detailed\ndiscussion.\n\n## Setting Expectations {#ExpectCall}\n\nSee [`EXPECT_CALL`](reference/mocking.md#EXPECT_CALL) in the Mocking Reference.\n\n## Matchers {#MatcherList}\n\nSee the [Matchers Reference](reference/matchers.md).\n\n## Actions {#ActionList}\n\nSee the [Actions Reference](reference/actions.md).\n\n## Cardinalities {#CardinalityList}\n\nSee the [`Times` clause](reference/mocking.md#EXPECT_CALL.Times) of\n`EXPECT_CALL` in the Mocking Reference.\n\n## Expectation Order\n\nBy default, expectations can be matched in *any* order. If some or all\nexpectations must be matched in a given order, you can use the\n[`After` clause](reference/mocking.md#EXPECT_CALL.After) or\n[`InSequence` clause](reference/mocking.md#EXPECT_CALL.InSequence) of\n`EXPECT_CALL`, or use an [`InSequence` object](reference/mocking.md#InSequence).\n\n## Verifying and Resetting a Mock\n\ngMock will verify the expectations on a mock object when it is destructed, or\nyou can do it earlier:\n\n```cpp\nusing ::testing::Mock;\n...\n// Verifies and removes the expectations on mock_obj;\n// returns true if and only if successful.\nMock::VerifyAndClearExpectations(&mock_obj);\n...\n// Verifies and removes the expectations on mock_obj;\n// also removes the default actions set by ON_CALL();\n// returns true if and only if successful.\nMock::VerifyAndClear(&mock_obj);\n```\n\nDo not set new expectations after verifying and clearing a mock after its use.\nSetting expectations after code that exercises the mock has undefined behavior.\nSee [Using Mocks in Tests](gmock_for_dummies.md#using-mocks-in-tests) for more\ninformation.\n\nYou can also tell gMock that a mock object can be leaked and doesn't need to be\nverified:\n\n```cpp\nMock::AllowLeak(&mock_obj);\n```\n\n## Mock Classes\n\ngMock defines a convenient mock class template\n\n```cpp\nclass MockFunction {\n public:\n MOCK_METHOD(R, Call, (A1, ..., An));\n};\n```\n\nSee this [recipe](gmock_cook_book.md#UsingCheckPoints) for one application of\nit.\n\n## Flags\n\n| Flag | Description |\n| :----------------------------- | :---------------------------------------- |\n| `--gmock_catch_leaked_mocks=0` | Don't report leaked mock objects as failures. |\n| `--gmock_verbose=LEVEL` | Sets the default verbosity level (`info`, `warning`, or `error`) of Google Mock messages. |\n" }, { "path": "3rd/googletest-1.12.1/docs/gmock_cook_book.md", "content": "# gMock Cookbook\n\nYou can find recipes for using gMock here. If you haven't yet, please read\n[the dummy guide](gmock_for_dummies.md) first to make sure you understand the\nbasics.\n\n{: .callout .note}\n**Note:** gMock lives in the `testing` name space. For readability, it is\nrecommended to write `using ::testing::Foo;` once in your file before using the\nname `Foo` defined by gMock. We omit such `using` statements in this section for\nbrevity, but you should do it in your own code.\n\n## Creating Mock Classes\n\nMock classes are defined as normal classes, using the `MOCK_METHOD` macro to\ngenerate mocked methods. The macro gets 3 or 4 parameters:\n\n```cpp\nclass MyMock {\n public:\n MOCK_METHOD(ReturnType, MethodName, (Args...));\n MOCK_METHOD(ReturnType, MethodName, (Args...), (Specs...));\n};\n```\n\nThe first 3 parameters are simply the method declaration, split into 3 parts.\nThe 4th parameter accepts a closed list of qualifiers, which affect the\ngenerated method:\n\n* **`const`** - Makes the mocked method a `const` method. Required if\n overriding a `const` method.\n* **`override`** - Marks the method with `override`. Recommended if overriding\n a `virtual` method.\n* **`noexcept`** - Marks the method with `noexcept`. Required if overriding a\n `noexcept` method.\n* **`Calltype(...)`** - Sets the call type for the method (e.g. to\n `STDMETHODCALLTYPE`), useful in Windows.\n* **`ref(...)`** - Marks the method with the reference qualification\n specified. Required if overriding a method that has reference\n qualifications. Eg `ref(&)` or `ref(&&)`.\n\n### Dealing with unprotected commas\n\nUnprotected commas, i.e. commas which are not surrounded by parentheses, prevent\n`MOCK_METHOD` from parsing its arguments correctly:\n\n{: .bad}\n```cpp\nclass MockFoo {\n public:\n MOCK_METHOD(std::pair, GetPair, ()); // Won't compile!\n MOCK_METHOD(bool, CheckMap, (std::map, bool)); // Won't compile!\n};\n```\n\nSolution 1 - wrap with parentheses:\n\n{: .good}\n```cpp\nclass MockFoo {\n public:\n MOCK_METHOD((std::pair), GetPair, ());\n MOCK_METHOD(bool, CheckMap, ((std::map), bool));\n};\n```\n\nNote that wrapping a return or argument type with parentheses is, in general,\ninvalid C++. `MOCK_METHOD` removes the parentheses.\n\nSolution 2 - define an alias:\n\n{: .good}\n```cpp\nclass MockFoo {\n public:\n using BoolAndInt = std::pair;\n MOCK_METHOD(BoolAndInt, GetPair, ());\n using MapIntDouble = std::map;\n MOCK_METHOD(bool, CheckMap, (MapIntDouble, bool));\n};\n```\n\n### Mocking Private or Protected Methods\n\nYou must always put a mock method definition (`MOCK_METHOD`) in a `public:`\nsection of the mock class, regardless of the method being mocked being `public`,\n`protected`, or `private` in the base class. This allows `ON_CALL` and\n`EXPECT_CALL` to reference the mock function from outside of the mock class.\n(Yes, C++ allows a subclass to change the access level of a virtual function in\nthe base class.) Example:\n\n```cpp\nclass Foo {\n public:\n ...\n virtual bool Transform(Gadget* g) = 0;\n\n protected:\n virtual void Resume();\n\n private:\n virtual int GetTimeOut();\n};\n\nclass MockFoo : public Foo {\n public:\n ...\n MOCK_METHOD(bool, Transform, (Gadget* g), (override));\n\n // The following must be in the public section, even though the\n // methods are protected or private in the base class.\n MOCK_METHOD(void, Resume, (), (override));\n MOCK_METHOD(int, GetTimeOut, (), (override));\n};\n```\n\n### Mocking Overloaded Methods\n\nYou can mock overloaded functions as usual. No special attention is required:\n\n```cpp\nclass Foo {\n ...\n\n // Must be virtual as we'll inherit from Foo.\n virtual ~Foo();\n\n // Overloaded on the types and/or numbers of arguments.\n virtual int Add(Element x);\n virtual int Add(int times, Element x);\n\n // Overloaded on the const-ness of this object.\n virtual Bar& GetBar();\n virtual const Bar& GetBar() const;\n};\n\nclass MockFoo : public Foo {\n ...\n MOCK_METHOD(int, Add, (Element x), (override));\n MOCK_METHOD(int, Add, (int times, Element x), (override));\n\n MOCK_METHOD(Bar&, GetBar, (), (override));\n MOCK_METHOD(const Bar&, GetBar, (), (const, override));\n};\n```\n\n{: .callout .note}\n**Note:** if you don't mock all versions of the overloaded method, the compiler\nwill give you a warning about some methods in the base class being hidden. To\nfix that, use `using` to bring them in scope:\n\n```cpp\nclass MockFoo : public Foo {\n ...\n using Foo::Add;\n MOCK_METHOD(int, Add, (Element x), (override));\n // We don't want to mock int Add(int times, Element x);\n ...\n};\n```\n\n### Mocking Class Templates\n\nYou can mock class templates just like any class.\n\n```cpp\ntemplate \nclass StackInterface {\n ...\n // Must be virtual as we'll inherit from StackInterface.\n virtual ~StackInterface();\n\n virtual int GetSize() const = 0;\n virtual void Push(const Elem& x) = 0;\n};\n\ntemplate \nclass MockStack : public StackInterface {\n ...\n MOCK_METHOD(int, GetSize, (), (override));\n MOCK_METHOD(void, Push, (const Elem& x), (override));\n};\n```\n\n### Mocking Non-virtual Methods {#MockingNonVirtualMethods}\n\ngMock can mock non-virtual functions to be used in Hi-perf dependency injection.\n\nIn this case, instead of sharing a common base class with the real class, your\nmock class will be *unrelated* to the real class, but contain methods with the\nsame signatures. The syntax for mocking non-virtual methods is the *same* as\nmocking virtual methods (just don't add `override`):\n\n```cpp\n// A simple packet stream class. None of its members is virtual.\nclass ConcretePacketStream {\n public:\n void AppendPacket(Packet* new_packet);\n const Packet* GetPacket(size_t packet_number) const;\n size_t NumberOfPackets() const;\n ...\n};\n\n// A mock packet stream class. It inherits from no other, but defines\n// GetPacket() and NumberOfPackets().\nclass MockPacketStream {\n public:\n MOCK_METHOD(const Packet*, GetPacket, (size_t packet_number), (const));\n MOCK_METHOD(size_t, NumberOfPackets, (), (const));\n ...\n};\n```\n\nNote that the mock class doesn't define `AppendPacket()`, unlike the real class.\nThat's fine as long as the test doesn't need to call it.\n\nNext, you need a way to say that you want to use `ConcretePacketStream` in\nproduction code, and use `MockPacketStream` in tests. Since the functions are\nnot virtual and the two classes are unrelated, you must specify your choice at\n*compile time* (as opposed to run time).\n\nOne way to do it is to templatize your code that needs to use a packet stream.\nMore specifically, you will give your code a template type argument for the type\nof the packet stream. In production, you will instantiate your template with\n`ConcretePacketStream` as the type argument. In tests, you will instantiate the\nsame template with `MockPacketStream`. For example, you may write:\n\n```cpp\ntemplate \nvoid CreateConnection(PacketStream* stream) { ... }\n\ntemplate \nclass PacketReader {\n public:\n void ReadPackets(PacketStream* stream, size_t packet_num);\n};\n```\n\nThen you can use `CreateConnection()` and\n`PacketReader` in production code, and use\n`CreateConnection()` and `PacketReader` in\ntests.\n\n```cpp\n MockPacketStream mock_stream;\n EXPECT_CALL(mock_stream, ...)...;\n .. set more expectations on mock_stream ...\n PacketReader reader(&mock_stream);\n ... exercise reader ...\n```\n\n### Mocking Free Functions\n\nIt is not possible to directly mock a free function (i.e. a C-style function or\na static method). If you need to, you can rewrite your code to use an interface\n(abstract class).\n\nInstead of calling a free function (say, `OpenFile`) directly, introduce an\ninterface for it and have a concrete subclass that calls the free function:\n\n```cpp\nclass FileInterface {\n public:\n ...\n virtual bool Open(const char* path, const char* mode) = 0;\n};\n\nclass File : public FileInterface {\n public:\n ...\n bool Open(const char* path, const char* mode) override {\n return OpenFile(path, mode);\n }\n};\n```\n\nYour code should talk to `FileInterface` to open a file. Now it's easy to mock\nout the function.\n\nThis may seem like a lot of hassle, but in practice you often have multiple\nrelated functions that you can put in the same interface, so the per-function\nsyntactic overhead will be much lower.\n\nIf you are concerned about the performance overhead incurred by virtual\nfunctions, and profiling confirms your concern, you can combine this with the\nrecipe for [mocking non-virtual methods](#MockingNonVirtualMethods).\n\n### Old-Style `MOCK_METHODn` Macros\n\nBefore the generic `MOCK_METHOD` macro\n[was introduced in 2018](https://github.com/google/googletest/commit/c5f08bf91944ce1b19bcf414fa1760e69d20afc2),\nmocks where created using a family of macros collectively called `MOCK_METHODn`.\nThese macros are still supported, though migration to the new `MOCK_METHOD` is\nrecommended.\n\nThe macros in the `MOCK_METHODn` family differ from `MOCK_METHOD`:\n\n* The general structure is `MOCK_METHODn(MethodName, ReturnType(Args))`,\n instead of `MOCK_METHOD(ReturnType, MethodName, (Args))`.\n* The number `n` must equal the number of arguments.\n* When mocking a const method, one must use `MOCK_CONST_METHODn`.\n* When mocking a class template, the macro name must be suffixed with `_T`.\n* In order to specify the call type, the macro name must be suffixed with\n `_WITH_CALLTYPE`, and the call type is the first macro argument.\n\nOld macros and their new equivalents:\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 \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
Simple
OldMOCK_METHOD1(Foo, bool(int))
NewMOCK_METHOD(bool, Foo, (int))
Const Method
OldMOCK_CONST_METHOD1(Foo, bool(int))
NewMOCK_METHOD(bool, Foo, (int), (const))
Method in a Class Template
OldMOCK_METHOD1_T(Foo, bool(int))
NewMOCK_METHOD(bool, Foo, (int))
Const Method in a Class Template
OldMOCK_CONST_METHOD1_T(Foo, bool(int))
NewMOCK_METHOD(bool, Foo, (int), (const))
Method with Call Type
OldMOCK_METHOD1_WITH_CALLTYPE(STDMETHODCALLTYPE, Foo, bool(int))
NewMOCK_METHOD(bool, Foo, (int), (Calltype(STDMETHODCALLTYPE)))
Const Method with Call Type
OldMOCK_CONST_METHOD1_WITH_CALLTYPE(STDMETHODCALLTYPE, Foo, bool(int))
NewMOCK_METHOD(bool, Foo, (int), (const, Calltype(STDMETHODCALLTYPE)))
Method with Call Type in a Class Template
OldMOCK_METHOD1_T_WITH_CALLTYPE(STDMETHODCALLTYPE, Foo, bool(int))
NewMOCK_METHOD(bool, Foo, (int), (Calltype(STDMETHODCALLTYPE)))
Const Method with Call Type in a Class Template
OldMOCK_CONST_METHOD1_T_WITH_CALLTYPE(STDMETHODCALLTYPE, Foo, bool(int))
NewMOCK_METHOD(bool, Foo, (int), (const, Calltype(STDMETHODCALLTYPE)))
\n\n### The Nice, the Strict, and the Naggy {#NiceStrictNaggy}\n\nIf a mock method has no `EXPECT_CALL` spec but is called, we say that it's an\n\"uninteresting call\", and the default action (which can be specified using\n`ON_CALL()`) of the method will be taken. Currently, an uninteresting call will\nalso by default cause gMock to print a warning.\n\nHowever, sometimes you may want to ignore these uninteresting calls, and\nsometimes you may want to treat them as errors. gMock lets you make the decision\non a per-mock-object basis.\n\nSuppose your test uses a mock class `MockFoo`:\n\n```cpp\nTEST(...) {\n MockFoo mock_foo;\n EXPECT_CALL(mock_foo, DoThis());\n ... code that uses mock_foo ...\n}\n```\n\nIf a method of `mock_foo` other than `DoThis()` is called, you will get a\nwarning. However, if you rewrite your test to use `NiceMock` instead,\nyou can suppress the warning:\n\n```cpp\nusing ::testing::NiceMock;\n\nTEST(...) {\n NiceMock mock_foo;\n EXPECT_CALL(mock_foo, DoThis());\n ... code that uses mock_foo ...\n}\n```\n\n`NiceMock` is a subclass of `MockFoo`, so it can be used wherever\n`MockFoo` is accepted.\n\nIt also works if `MockFoo`'s constructor takes some arguments, as\n`NiceMock` \"inherits\" `MockFoo`'s constructors:\n\n```cpp\nusing ::testing::NiceMock;\n\nTEST(...) {\n NiceMock mock_foo(5, \"hi\"); // Calls MockFoo(5, \"hi\").\n EXPECT_CALL(mock_foo, DoThis());\n ... code that uses mock_foo ...\n}\n```\n\nThe usage of `StrictMock` is similar, except that it makes all uninteresting\ncalls failures:\n\n```cpp\nusing ::testing::StrictMock;\n\nTEST(...) {\n StrictMock mock_foo;\n EXPECT_CALL(mock_foo, DoThis());\n ... code that uses mock_foo ...\n\n // The test will fail if a method of mock_foo other than DoThis()\n // is called.\n}\n```\n\n{: .callout .note}\nNOTE: `NiceMock` and `StrictMock` only affects *uninteresting* calls (calls of\n*methods* with no expectations); they do not affect *unexpected* calls (calls of\nmethods with expectations, but they don't match). See\n[Understanding Uninteresting vs Unexpected Calls](#uninteresting-vs-unexpected).\n\nThere are some caveats though (sadly they are side effects of C++'s\nlimitations):\n\n1. `NiceMock` and `StrictMock` only work for mock methods\n defined using the `MOCK_METHOD` macro **directly** in the `MockFoo` class.\n If a mock method is defined in a **base class** of `MockFoo`, the \"nice\" or\n \"strict\" modifier may not affect it, depending on the compiler. In\n particular, nesting `NiceMock` and `StrictMock` (e.g.\n `NiceMock >`) is **not** supported.\n2. `NiceMock` and `StrictMock` may not work correctly if the\n destructor of `MockFoo` is not virtual. We would like to fix this, but it\n requires cleaning up existing tests.\n\nFinally, you should be **very cautious** about when to use naggy or strict\nmocks, as they tend to make tests more brittle and harder to maintain. When you\nrefactor your code without changing its externally visible behavior, ideally you\nshouldn't need to update any tests. If your code interacts with a naggy mock,\nhowever, you may start to get spammed with warnings as the result of your\nchange. Worse, if your code interacts with a strict mock, your tests may start\nto fail and you'll be forced to fix them. Our general recommendation is to use\nnice mocks (not yet the default) most of the time, use naggy mocks (the current\ndefault) when developing or debugging tests, and use strict mocks only as the\nlast resort.\n\n### Simplifying the Interface without Breaking Existing Code {#SimplerInterfaces}\n\nSometimes a method has a long list of arguments that is mostly uninteresting.\nFor example:\n\n```cpp\nclass LogSink {\n public:\n ...\n virtual void send(LogSeverity severity, const char* full_filename,\n const char* base_filename, int line,\n const struct tm* tm_time,\n const char* message, size_t message_len) = 0;\n};\n```\n\nThis method's argument list is lengthy and hard to work with (the `message`\nargument is not even 0-terminated). If we mock it as is, using the mock will be\nawkward. If, however, we try to simplify this interface, we'll need to fix all\nclients depending on it, which is often infeasible.\n\nThe trick is to redispatch the method in the mock class:\n\n```cpp\nclass ScopedMockLog : public LogSink {\n public:\n ...\n void send(LogSeverity severity, const char* full_filename,\n const char* base_filename, int line, const tm* tm_time,\n const char* message, size_t message_len) override {\n // We are only interested in the log severity, full file name, and\n // log message.\n Log(severity, full_filename, std::string(message, message_len));\n }\n\n // Implements the mock method:\n //\n // void Log(LogSeverity severity,\n // const string& file_path,\n // const string& message);\n MOCK_METHOD(void, Log,\n (LogSeverity severity, const string& file_path,\n const string& message));\n};\n```\n\nBy defining a new mock method with a trimmed argument list, we make the mock\nclass more user-friendly.\n\nThis technique may also be applied to make overloaded methods more amenable to\nmocking. For example, when overloads have been used to implement default\narguments:\n\n```cpp\nclass MockTurtleFactory : public TurtleFactory {\n public:\n Turtle* MakeTurtle(int length, int weight) override { ... }\n Turtle* MakeTurtle(int length, int weight, int speed) override { ... }\n\n // the above methods delegate to this one:\n MOCK_METHOD(Turtle*, DoMakeTurtle, ());\n};\n```\n\nThis allows tests that don't care which overload was invoked to avoid specifying\nargument matchers:\n\n```cpp\nON_CALL(factory, DoMakeTurtle)\n .WillByDefault(Return(MakeMockTurtle()));\n```\n\n### Alternative to Mocking Concrete Classes\n\nOften you may find yourself using classes that don't implement interfaces. In\norder to test your code that uses such a class (let's call it `Concrete`), you\nmay be tempted to make the methods of `Concrete` virtual and then mock it.\n\nTry not to do that.\n\nMaking a non-virtual function virtual is a big decision. It creates an extension\npoint where subclasses can tweak your class' behavior. This weakens your control\non the class because now it's harder to maintain the class invariants. You\nshould make a function virtual only when there is a valid reason for a subclass\nto override it.\n\nMocking concrete classes directly is problematic as it creates a tight coupling\nbetween the class and the tests - any small change in the class may invalidate\nyour tests and make test maintenance a pain.\n\nTo avoid such problems, many programmers have been practicing \"coding to\ninterfaces\": instead of talking to the `Concrete` class, your code would define\nan interface and talk to it. Then you implement that interface as an adaptor on\ntop of `Concrete`. In tests, you can easily mock that interface to observe how\nyour code is doing.\n\nThis technique incurs some overhead:\n\n* You pay the cost of virtual function calls (usually not a problem).\n* There is more abstraction for the programmers to learn.\n\nHowever, it can also bring significant benefits in addition to better\ntestability:\n\n* `Concrete`'s API may not fit your problem domain very well, as you may not\n be the only client it tries to serve. By designing your own interface, you\n have a chance to tailor it to your need - you may add higher-level\n functionalities, rename stuff, etc instead of just trimming the class. This\n allows you to write your code (user of the interface) in a more natural way,\n which means it will be more readable, more maintainable, and you'll be more\n productive.\n* If `Concrete`'s implementation ever has to change, you don't have to rewrite\n everywhere it is used. Instead, you can absorb the change in your\n implementation of the interface, and your other code and tests will be\n insulated from this change.\n\nSome people worry that if everyone is practicing this technique, they will end\nup writing lots of redundant code. This concern is totally understandable.\nHowever, there are two reasons why it may not be the case:\n\n* Different projects may need to use `Concrete` in different ways, so the best\n interfaces for them will be different. Therefore, each of them will have its\n own domain-specific interface on top of `Concrete`, and they will not be the\n same code.\n* If enough projects want to use the same interface, they can always share it,\n just like they have been sharing `Concrete`. You can check in the interface\n and the adaptor somewhere near `Concrete` (perhaps in a `contrib`\n sub-directory) and let many projects use it.\n\nYou need to weigh the pros and cons carefully for your particular problem, but\nI'd like to assure you that the Java community has been practicing this for a\nlong time and it's a proven effective technique applicable in a wide variety of\nsituations. :-)\n\n### Delegating Calls to a Fake {#DelegatingToFake}\n\nSome times you have a non-trivial fake implementation of an interface. For\nexample:\n\n```cpp\nclass Foo {\n public:\n virtual ~Foo() {}\n virtual char DoThis(int n) = 0;\n virtual void DoThat(const char* s, int* p) = 0;\n};\n\nclass FakeFoo : public Foo {\n public:\n char DoThis(int n) override {\n return (n > 0) ? '+' :\n (n < 0) ? '-' : '0';\n }\n\n void DoThat(const char* s, int* p) override {\n *p = strlen(s);\n }\n};\n```\n\nNow you want to mock this interface such that you can set expectations on it.\nHowever, you also want to use `FakeFoo` for the default behavior, as duplicating\nit in the mock object is, well, a lot of work.\n\nWhen you define the mock class using gMock, you can have it delegate its default\naction to a fake class you already have, using this pattern:\n\n```cpp\nclass MockFoo : public Foo {\n public:\n // Normal mock method definitions using gMock.\n MOCK_METHOD(char, DoThis, (int n), (override));\n MOCK_METHOD(void, DoThat, (const char* s, int* p), (override));\n\n // Delegates the default actions of the methods to a FakeFoo object.\n // This must be called *before* the custom ON_CALL() statements.\n void DelegateToFake() {\n ON_CALL(*this, DoThis).WillByDefault([this](int n) {\n return fake_.DoThis(n);\n });\n ON_CALL(*this, DoThat).WillByDefault([this](const char* s, int* p) {\n fake_.DoThat(s, p);\n });\n }\n\n private:\n FakeFoo fake_; // Keeps an instance of the fake in the mock.\n};\n```\n\nWith that, you can use `MockFoo` in your tests as usual. Just remember that if\nyou don't explicitly set an action in an `ON_CALL()` or `EXPECT_CALL()`, the\nfake will be called upon to do it.:\n\n```cpp\nusing ::testing::_;\n\nTEST(AbcTest, Xyz) {\n MockFoo foo;\n\n foo.DelegateToFake(); // Enables the fake for delegation.\n\n // Put your ON_CALL(foo, ...)s here, if any.\n\n // No action specified, meaning to use the default action.\n EXPECT_CALL(foo, DoThis(5));\n EXPECT_CALL(foo, DoThat(_, _));\n\n int n = 0;\n EXPECT_EQ('+', foo.DoThis(5)); // FakeFoo::DoThis() is invoked.\n foo.DoThat(\"Hi\", &n); // FakeFoo::DoThat() is invoked.\n EXPECT_EQ(2, n);\n}\n```\n\n**Some tips:**\n\n* If you want, you can still override the default action by providing your own\n `ON_CALL()` or using `.WillOnce()` / `.WillRepeatedly()` in `EXPECT_CALL()`.\n* In `DelegateToFake()`, you only need to delegate the methods whose fake\n implementation you intend to use.\n\n* The general technique discussed here works for overloaded methods, but\n you'll need to tell the compiler which version you mean. To disambiguate a\n mock function (the one you specify inside the parentheses of `ON_CALL()`),\n use [this technique](#SelectOverload); to disambiguate a fake function (the\n one you place inside `Invoke()`), use a `static_cast` to specify the\n function's type. For instance, if class `Foo` has methods `char DoThis(int\n n)` and `bool DoThis(double x) const`, and you want to invoke the latter,\n you need to write `Invoke(&fake_, static_cast(&FakeFoo::DoThis))` instead of `Invoke(&fake_, &FakeFoo::DoThis)`\n (The strange-looking thing inside the angled brackets of `static_cast` is\n the type of a function pointer to the second `DoThis()` method.).\n\n* Having to mix a mock and a fake is often a sign of something gone wrong.\n Perhaps you haven't got used to the interaction-based way of testing yet. Or\n perhaps your interface is taking on too many roles and should be split up.\n Therefore, **don't abuse this**. We would only recommend to do it as an\n intermediate step when you are refactoring your code.\n\nRegarding the tip on mixing a mock and a fake, here's an example on why it may\nbe a bad sign: Suppose you have a class `System` for low-level system\noperations. In particular, it does file and I/O operations. And suppose you want\nto test how your code uses `System` to do I/O, and you just want the file\noperations to work normally. If you mock out the entire `System` class, you'll\nhave to provide a fake implementation for the file operation part, which\nsuggests that `System` is taking on too many roles.\n\nInstead, you can define a `FileOps` interface and an `IOOps` interface and split\n`System`'s functionalities into the two. Then you can mock `IOOps` without\nmocking `FileOps`.\n\n### Delegating Calls to a Real Object\n\nWhen using testing doubles (mocks, fakes, stubs, and etc), sometimes their\nbehaviors will differ from those of the real objects. This difference could be\neither intentional (as in simulating an error such that you can test the error\nhandling code) or unintentional. If your mocks have different behaviors than the\nreal objects by mistake, you could end up with code that passes the tests but\nfails in production.\n\nYou can use the *delegating-to-real* technique to ensure that your mock has the\nsame behavior as the real object while retaining the ability to validate calls.\nThis technique is very similar to the [delegating-to-fake](#DelegatingToFake)\ntechnique, the difference being that we use a real object instead of a fake.\nHere's an example:\n\n```cpp\nusing ::testing::AtLeast;\n\nclass MockFoo : public Foo {\n public:\n MockFoo() {\n // By default, all calls are delegated to the real object.\n ON_CALL(*this, DoThis).WillByDefault([this](int n) {\n return real_.DoThis(n);\n });\n ON_CALL(*this, DoThat).WillByDefault([this](const char* s, int* p) {\n real_.DoThat(s, p);\n });\n ...\n }\n MOCK_METHOD(char, DoThis, ...);\n MOCK_METHOD(void, DoThat, ...);\n ...\n private:\n Foo real_;\n};\n\n...\n MockFoo mock;\n EXPECT_CALL(mock, DoThis())\n .Times(3);\n EXPECT_CALL(mock, DoThat(\"Hi\"))\n .Times(AtLeast(1));\n ... use mock in test ...\n```\n\nWith this, gMock will verify that your code made the right calls (with the right\narguments, in the right order, called the right number of times, etc), and a\nreal object will answer the calls (so the behavior will be the same as in\nproduction). This gives you the best of both worlds.\n\n### Delegating Calls to a Parent Class\n\nIdeally, you should code to interfaces, whose methods are all pure virtual. In\nreality, sometimes you do need to mock a virtual method that is not pure (i.e,\nit already has an implementation). For example:\n\n```cpp\nclass Foo {\n public:\n virtual ~Foo();\n\n virtual void Pure(int n) = 0;\n virtual int Concrete(const char* str) { ... }\n};\n\nclass MockFoo : public Foo {\n public:\n // Mocking a pure method.\n MOCK_METHOD(void, Pure, (int n), (override));\n // Mocking a concrete method. Foo::Concrete() is shadowed.\n MOCK_METHOD(int, Concrete, (const char* str), (override));\n};\n```\n\nSometimes you may want to call `Foo::Concrete()` instead of\n`MockFoo::Concrete()`. Perhaps you want to do it as part of a stub action, or\nperhaps your test doesn't need to mock `Concrete()` at all (but it would be\noh-so painful to have to define a new mock class whenever you don't need to mock\none of its methods).\n\nYou can call `Foo::Concrete()` inside an action by:\n\n```cpp\n...\n EXPECT_CALL(foo, Concrete).WillOnce([&foo](const char* str) {\n return foo.Foo::Concrete(str);\n });\n```\n\nor tell the mock object that you don't want to mock `Concrete()`:\n\n```cpp\n...\n ON_CALL(foo, Concrete).WillByDefault([&foo](const char* str) {\n return foo.Foo::Concrete(str);\n });\n```\n\n(Why don't we just write `{ return foo.Concrete(str); }`? If you do that,\n`MockFoo::Concrete()` will be called (and cause an infinite recursion) since\n`Foo::Concrete()` is virtual. That's just how C++ works.)\n\n## Using Matchers\n\n### Matching Argument Values Exactly\n\nYou can specify exactly which arguments a mock method is expecting:\n\n```cpp\nusing ::testing::Return;\n...\n EXPECT_CALL(foo, DoThis(5))\n .WillOnce(Return('a'));\n EXPECT_CALL(foo, DoThat(\"Hello\", bar));\n```\n\n### Using Simple Matchers\n\nYou can use matchers to match arguments that have a certain property:\n\n```cpp\nusing ::testing::NotNull;\nusing ::testing::Return;\n...\n EXPECT_CALL(foo, DoThis(Ge(5))) // The argument must be >= 5.\n .WillOnce(Return('a'));\n EXPECT_CALL(foo, DoThat(\"Hello\", NotNull()));\n // The second argument must not be NULL.\n```\n\nA frequently used matcher is `_`, which matches anything:\n\n```cpp\n EXPECT_CALL(foo, DoThat(_, NotNull()));\n```\n\n### Combining Matchers {#CombiningMatchers}\n\nYou can build complex matchers from existing ones using `AllOf()`,\n`AllOfArray()`, `AnyOf()`, `AnyOfArray()` and `Not()`:\n\n```cpp\nusing ::testing::AllOf;\nusing ::testing::Gt;\nusing ::testing::HasSubstr;\nusing ::testing::Ne;\nusing ::testing::Not;\n...\n // The argument must be > 5 and != 10.\n EXPECT_CALL(foo, DoThis(AllOf(Gt(5),\n Ne(10))));\n\n // The first argument must not contain sub-string \"blah\".\n EXPECT_CALL(foo, DoThat(Not(HasSubstr(\"blah\")),\n NULL));\n```\n\nMatchers are function objects, and parametrized matchers can be composed just\nlike any other function. However because their types can be long and rarely\nprovide meaningful information, it can be easier to express them with C++14\ngeneric lambdas to avoid specifying types. For example,\n\n```cpp\nusing ::testing::Contains;\nusing ::testing::Property;\n\ninline constexpr auto HasFoo = [](const auto& f) {\n return Property(&MyClass::foo, Contains(f));\n};\n...\n EXPECT_THAT(x, HasFoo(\"blah\"));\n```\n\n### Casting Matchers {#SafeMatcherCast}\n\ngMock matchers are statically typed, meaning that the compiler can catch your\nmistake if you use a matcher of the wrong type (for example, if you use `Eq(5)`\nto match a `string` argument). Good for you!\n\nSometimes, however, you know what you're doing and want the compiler to give you\nsome slack. One example is that you have a matcher for `long` and the argument\nyou want to match is `int`. While the two types aren't exactly the same, there\nis nothing really wrong with using a `Matcher` to match an `int` - after\nall, we can first convert the `int` argument to a `long` losslessly before\ngiving it to the matcher.\n\nTo support this need, gMock gives you the `SafeMatcherCast(m)` function. It\ncasts a matcher `m` to type `Matcher`. To ensure safety, gMock checks that\n(let `U` be the type `m` accepts :\n\n1. Type `T` can be *implicitly* cast to type `U`;\n2. When both `T` and `U` are built-in arithmetic types (`bool`, integers, and\n floating-point numbers), the conversion from `T` to `U` is not lossy (in\n other words, any value representable by `T` can also be represented by `U`);\n and\n3. When `U` is a reference, `T` must also be a reference (as the underlying\n matcher may be interested in the address of the `U` value).\n\nThe code won't compile if any of these conditions isn't met.\n\nHere's one example:\n\n```cpp\nusing ::testing::SafeMatcherCast;\n\n// A base class and a child class.\nclass Base { ... };\nclass Derived : public Base { ... };\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(void, DoThis, (Derived* derived), (override));\n};\n\n...\n MockFoo foo;\n // m is a Matcher we got from somewhere.\n EXPECT_CALL(foo, DoThis(SafeMatcherCast(m)));\n```\n\nIf you find `SafeMatcherCast(m)` too limiting, you can use a similar function\n`MatcherCast(m)`. The difference is that `MatcherCast` works as long as you\ncan `static_cast` type `T` to type `U`.\n\n`MatcherCast` essentially lets you bypass C++'s type system (`static_cast` isn't\nalways safe as it could throw away information, for example), so be careful not\nto misuse/abuse it.\n\n### Selecting Between Overloaded Functions {#SelectOverload}\n\nIf you expect an overloaded function to be called, the compiler may need some\nhelp on which overloaded version it is.\n\nTo disambiguate functions overloaded on the const-ness of this object, use the\n`Const()` argument wrapper.\n\n```cpp\nusing ::testing::ReturnRef;\n\nclass MockFoo : public Foo {\n ...\n MOCK_METHOD(Bar&, GetBar, (), (override));\n MOCK_METHOD(const Bar&, GetBar, (), (const, override));\n};\n\n...\n MockFoo foo;\n Bar bar1, bar2;\n EXPECT_CALL(foo, GetBar()) // The non-const GetBar().\n .WillOnce(ReturnRef(bar1));\n EXPECT_CALL(Const(foo), GetBar()) // The const GetBar().\n .WillOnce(ReturnRef(bar2));\n```\n\n(`Const()` is defined by gMock and returns a `const` reference to its argument.)\n\nTo disambiguate overloaded functions with the same number of arguments but\ndifferent argument types, you may need to specify the exact type of a matcher,\neither by wrapping your matcher in `Matcher()`, or using a matcher whose\ntype is fixed (`TypedEq`, `An()`, etc):\n\n```cpp\nusing ::testing::An;\nusing ::testing::Matcher;\nusing ::testing::TypedEq;\n\nclass MockPrinter : public Printer {\n public:\n MOCK_METHOD(void, Print, (int n), (override));\n MOCK_METHOD(void, Print, (char c), (override));\n};\n\nTEST(PrinterTest, Print) {\n MockPrinter printer;\n\n EXPECT_CALL(printer, Print(An())); // void Print(int);\n EXPECT_CALL(printer, Print(Matcher(Lt(5)))); // void Print(int);\n EXPECT_CALL(printer, Print(TypedEq('a'))); // void Print(char);\n\n printer.Print(3);\n printer.Print(6);\n printer.Print('a');\n}\n```\n\n### Performing Different Actions Based on the Arguments\n\nWhen a mock method is called, the *last* matching expectation that's still\nactive will be selected (think \"newer overrides older\"). So, you can make a\nmethod do different things depending on its argument values like this:\n\n```cpp\nusing ::testing::_;\nusing ::testing::Lt;\nusing ::testing::Return;\n...\n // The default case.\n EXPECT_CALL(foo, DoThis(_))\n .WillRepeatedly(Return('b'));\n // The more specific case.\n EXPECT_CALL(foo, DoThis(Lt(5)))\n .WillRepeatedly(Return('a'));\n```\n\nNow, if `foo.DoThis()` is called with a value less than 5, `'a'` will be\nreturned; otherwise `'b'` will be returned.\n\n### Matching Multiple Arguments as a Whole\n\nSometimes it's not enough to match the arguments individually. For example, we\nmay want to say that the first argument must be less than the second argument.\nThe `With()` clause allows us to match all arguments of a mock function as a\nwhole. For example,\n\n```cpp\nusing ::testing::_;\nusing ::testing::Ne;\nusing ::testing::Lt;\n...\n EXPECT_CALL(foo, InRange(Ne(0), _))\n .With(Lt());\n```\n\nsays that the first argument of `InRange()` must not be 0, and must be less than\nthe second argument.\n\nThe expression inside `With()` must be a matcher of type `Matcher>`, where `A1`, ..., `An` are the types of the function arguments.\n\nYou can also write `AllArgs(m)` instead of `m` inside `.With()`. The two forms\nare equivalent, but `.With(AllArgs(Lt()))` is more readable than `.With(Lt())`.\n\nYou can use `Args(m)` to match the `n` selected arguments (as a\ntuple) against `m`. For example,\n\n```cpp\nusing ::testing::_;\nusing ::testing::AllOf;\nusing ::testing::Args;\nusing ::testing::Lt;\n...\n EXPECT_CALL(foo, Blah)\n .With(AllOf(Args<0, 1>(Lt()), Args<1, 2>(Lt())));\n```\n\nsays that `Blah` will be called with arguments `x`, `y`, and `z` where `x < y <\nz`. Note that in this example, it wasn't necessary to specify the positional\nmatchers.\n\nAs a convenience and example, gMock provides some matchers for 2-tuples,\nincluding the `Lt()` matcher above. See\n[Multi-argument Matchers](reference/matchers.md#MultiArgMatchers) for the\ncomplete list.\n\nNote that if you want to pass the arguments to a predicate of your own (e.g.\n`.With(Args<0, 1>(Truly(&MyPredicate)))`), that predicate MUST be written to\ntake a `std::tuple` as its argument; gMock will pass the `n` selected arguments\nas *one* single tuple to the predicate.\n\n### Using Matchers as Predicates\n\nHave you noticed that a matcher is just a fancy predicate that also knows how to\ndescribe itself? Many existing algorithms take predicates as arguments (e.g.\nthose defined in STL's `` header), and it would be a shame if gMock\nmatchers were not allowed to participate.\n\nLuckily, you can use a matcher where a unary predicate functor is expected by\nwrapping it inside the `Matches()` function. For example,\n\n```cpp\n#include \n#include \n\nusing ::testing::Matches;\nusing ::testing::Ge;\n\nvector v;\n...\n// How many elements in v are >= 10?\nconst int count = count_if(v.begin(), v.end(), Matches(Ge(10)));\n```\n\nSince you can build complex matchers from simpler ones easily using gMock, this\ngives you a way to conveniently construct composite predicates (doing the same\nusing STL's `` header is just painful). For example, here's a\npredicate that's satisfied by any number that is >= 0, <= 100, and != 50:\n\n```cpp\nusing testing::AllOf;\nusing testing::Ge;\nusing testing::Le;\nusing testing::Matches;\nusing testing::Ne;\n...\nMatches(AllOf(Ge(0), Le(100), Ne(50)))\n```\n\n### Using Matchers in googletest Assertions\n\nSee [`EXPECT_THAT`](reference/assertions.md#EXPECT_THAT) in the Assertions\nReference.\n\n### Using Predicates as Matchers\n\ngMock provides a set of built-in matchers for matching arguments with expected\nvalues—see the [Matchers Reference](reference/matchers.md) for more information.\nIn case you find the built-in set lacking, you can use an arbitrary unary\npredicate function or functor as a matcher - as long as the predicate accepts a\nvalue of the type you want. You do this by wrapping the predicate inside the\n`Truly()` function, for example:\n\n```cpp\nusing ::testing::Truly;\n\nint IsEven(int n) { return (n % 2) == 0 ? 1 : 0; }\n...\n // Bar() must be called with an even number.\n EXPECT_CALL(foo, Bar(Truly(IsEven)));\n```\n\nNote that the predicate function / functor doesn't have to return `bool`. It\nworks as long as the return value can be used as the condition in in statement\n`if (condition) ...`.\n\n### Matching Arguments that Are Not Copyable\n\nWhen you do an `EXPECT_CALL(mock_obj, Foo(bar))`, gMock saves away a copy of\n`bar`. When `Foo()` is called later, gMock compares the argument to `Foo()` with\nthe saved copy of `bar`. This way, you don't need to worry about `bar` being\nmodified or destroyed after the `EXPECT_CALL()` is executed. The same is true\nwhen you use matchers like `Eq(bar)`, `Le(bar)`, and so on.\n\nBut what if `bar` cannot be copied (i.e. has no copy constructor)? You could\ndefine your own matcher function or callback and use it with `Truly()`, as the\nprevious couple of recipes have shown. Or, you may be able to get away from it\nif you can guarantee that `bar` won't be changed after the `EXPECT_CALL()` is\nexecuted. Just tell gMock that it should save a reference to `bar`, instead of a\ncopy of it. Here's how:\n\n```cpp\nusing ::testing::Eq;\nusing ::testing::Lt;\n...\n // Expects that Foo()'s argument == bar.\n EXPECT_CALL(mock_obj, Foo(Eq(std::ref(bar))));\n\n // Expects that Foo()'s argument < bar.\n EXPECT_CALL(mock_obj, Foo(Lt(std::ref(bar))));\n```\n\nRemember: if you do this, don't change `bar` after the `EXPECT_CALL()`, or the\nresult is undefined.\n\n### Validating a Member of an Object\n\nOften a mock function takes a reference to object as an argument. When matching\nthe argument, you may not want to compare the entire object against a fixed\nobject, as that may be over-specification. Instead, you may need to validate a\ncertain member variable or the result of a certain getter method of the object.\nYou can do this with `Field()` and `Property()`. More specifically,\n\n```cpp\nField(&Foo::bar, m)\n```\n\nis a matcher that matches a `Foo` object whose `bar` member variable satisfies\nmatcher `m`.\n\n```cpp\nProperty(&Foo::baz, m)\n```\n\nis a matcher that matches a `Foo` object whose `baz()` method returns a value\nthat satisfies matcher `m`.\n\nFor example:\n\n| Expression | Description |\n| :--------------------------- | :--------------------------------------- |\n| `Field(&Foo::number, Ge(3))` | Matches `x` where `x.number >= 3`. |\n| `Property(&Foo::name, StartsWith(\"John \"))` | Matches `x` where `x.name()` starts with `\"John \"`. |\n\nNote that in `Property(&Foo::baz, ...)`, method `baz()` must take no argument\nand be declared as `const`. Don't use `Property()` against member functions that\nyou do not own, because taking addresses of functions is fragile and generally\nnot part of the contract of the function.\n\n`Field()` and `Property()` can also match plain pointers to objects. For\ninstance,\n\n```cpp\nusing ::testing::Field;\nusing ::testing::Ge;\n...\nField(&Foo::number, Ge(3))\n```\n\nmatches a plain pointer `p` where `p->number >= 3`. If `p` is `NULL`, the match\nwill always fail regardless of the inner matcher.\n\nWhat if you want to validate more than one members at the same time? Remember\nthat there are [`AllOf()` and `AllOfArray()`](#CombiningMatchers).\n\nFinally `Field()` and `Property()` provide overloads that take the field or\nproperty names as the first argument to include it in the error message. This\ncan be useful when creating combined matchers.\n\n```cpp\nusing ::testing::AllOf;\nusing ::testing::Field;\nusing ::testing::Matcher;\nusing ::testing::SafeMatcherCast;\n\nMatcher IsFoo(const Foo& foo) {\n return AllOf(Field(\"some_field\", &Foo::some_field, foo.some_field),\n Field(\"other_field\", &Foo::other_field, foo.other_field),\n Field(\"last_field\", &Foo::last_field, foo.last_field));\n}\n```\n\n### Validating the Value Pointed to by a Pointer Argument\n\nC++ functions often take pointers as arguments. You can use matchers like\n`IsNull()`, `NotNull()`, and other comparison matchers to match a pointer, but\nwhat if you want to make sure the value *pointed to* by the pointer, instead of\nthe pointer itself, has a certain property? Well, you can use the `Pointee(m)`\nmatcher.\n\n`Pointee(m)` matches a pointer if and only if `m` matches the value the pointer\npoints to. For example:\n\n```cpp\nusing ::testing::Ge;\nusing ::testing::Pointee;\n...\n EXPECT_CALL(foo, Bar(Pointee(Ge(3))));\n```\n\nexpects `foo.Bar()` to be called with a pointer that points to a value greater\nthan or equal to 3.\n\nOne nice thing about `Pointee()` is that it treats a `NULL` pointer as a match\nfailure, so you can write `Pointee(m)` instead of\n\n```cpp\nusing ::testing::AllOf;\nusing ::testing::NotNull;\nusing ::testing::Pointee;\n...\n AllOf(NotNull(), Pointee(m))\n```\n\nwithout worrying that a `NULL` pointer will crash your test.\n\nAlso, did we tell you that `Pointee()` works with both raw pointers **and**\nsmart pointers (`std::unique_ptr`, `std::shared_ptr`, etc)?\n\nWhat if you have a pointer to pointer? You guessed it - you can use nested\n`Pointee()` to probe deeper inside the value. For example,\n`Pointee(Pointee(Lt(3)))` matches a pointer that points to a pointer that points\nto a number less than 3 (what a mouthful...).\n\n### Defining a Custom Matcher Class {#CustomMatcherClass}\n\nMost matchers can be simply defined using [the MATCHER* macros](#NewMatchers),\nwhich are terse and flexible, and produce good error messages. However, these\nmacros are not very explicit about the interfaces they create and are not always\nsuitable, especially for matchers that will be widely reused.\n\nFor more advanced cases, you may need to define your own matcher class. A custom\nmatcher allows you to test a specific invariant property of that object. Let's\ntake a look at how to do so.\n\nImagine you have a mock function that takes an object of type `Foo`, which has\nan `int bar()` method and an `int baz()` method. You want to constrain that the\nargument's `bar()` value plus its `baz()` value is a given number. (This is an\ninvariant.) Here's how we can write and use a matcher class to do so:\n\n```cpp\nclass BarPlusBazEqMatcher {\n public:\n using is_gtest_matcher = void;\n\n explicit BarPlusBazEqMatcher(int expected_sum)\n : expected_sum_(expected_sum) {}\n\n bool MatchAndExplain(const Foo& foo,\n std::ostream* /* listener */) const {\n return (foo.bar() + foo.baz()) == expected_sum_;\n }\n\n void DescribeTo(std::ostream* os) const {\n *os << \"bar() + baz() equals \" << expected_sum_;\n }\n\n void DescribeNegationTo(std::ostream* os) const {\n *os << \"bar() + baz() does not equal \" << expected_sum_;\n }\n private:\n const int expected_sum_;\n};\n\n::testing::Matcher BarPlusBazEq(int expected_sum) {\n return BarPlusBazEqMatcher(expected_sum);\n}\n\n...\n Foo foo;\n EXPECT_CALL(foo, BarPlusBazEq(5))...;\n```\n\n### Matching Containers\n\nSometimes an STL container (e.g. list, vector, map, ...) is passed to a mock\nfunction and you may want to validate it. Since most STL containers support the\n`==` operator, you can write `Eq(expected_container)` or simply\n`expected_container` to match a container exactly.\n\nSometimes, though, you may want to be more flexible (for example, the first\nelement must be an exact match, but the second element can be any positive\nnumber, and so on). Also, containers used in tests often have a small number of\nelements, and having to define the expected container out-of-line is a bit of a\nhassle.\n\nYou can use the `ElementsAre()` or `UnorderedElementsAre()` matcher in such\ncases:\n\n```cpp\nusing ::testing::_;\nusing ::testing::ElementsAre;\nusing ::testing::Gt;\n...\n MOCK_METHOD(void, Foo, (const vector& numbers), (override));\n...\n EXPECT_CALL(mock, Foo(ElementsAre(1, Gt(0), _, 5)));\n```\n\nThe above matcher says that the container must have 4 elements, which must be 1,\ngreater than 0, anything, and 5 respectively.\n\nIf you instead write:\n\n```cpp\nusing ::testing::_;\nusing ::testing::Gt;\nusing ::testing::UnorderedElementsAre;\n...\n MOCK_METHOD(void, Foo, (const vector& numbers), (override));\n...\n EXPECT_CALL(mock, Foo(UnorderedElementsAre(1, Gt(0), _, 5)));\n```\n\nIt means that the container must have 4 elements, which (under some permutation)\nmust be 1, greater than 0, anything, and 5 respectively.\n\nAs an alternative you can place the arguments in a C-style array and use\n`ElementsAreArray()` or `UnorderedElementsAreArray()` instead:\n\n```cpp\nusing ::testing::ElementsAreArray;\n...\n // ElementsAreArray accepts an array of element values.\n const int expected_vector1[] = {1, 5, 2, 4, ...};\n EXPECT_CALL(mock, Foo(ElementsAreArray(expected_vector1)));\n\n // Or, an array of element matchers.\n Matcher expected_vector2[] = {1, Gt(2), _, 3, ...};\n EXPECT_CALL(mock, Foo(ElementsAreArray(expected_vector2)));\n```\n\nIn case the array needs to be dynamically created (and therefore the array size\ncannot be inferred by the compiler), you can give `ElementsAreArray()` an\nadditional argument to specify the array size:\n\n```cpp\nusing ::testing::ElementsAreArray;\n...\n int* const expected_vector3 = new int[count];\n ... fill expected_vector3 with values ...\n EXPECT_CALL(mock, Foo(ElementsAreArray(expected_vector3, count)));\n```\n\nUse `Pair` when comparing maps or other associative containers.\n\n{% raw %}\n\n```cpp\nusing testing::ElementsAre;\nusing testing::Pair;\n...\n std::map m = {{\"a\", 1}, {\"b\", 2}, {\"c\", 3}};\n EXPECT_THAT(m, ElementsAre(Pair(\"a\", 1), Pair(\"b\", 2), Pair(\"c\", 3)));\n```\n\n{% endraw %}\n\n**Tips:**\n\n* `ElementsAre*()` can be used to match *any* container that implements the\n STL iterator pattern (i.e. it has a `const_iterator` type and supports\n `begin()/end()`), not just the ones defined in STL. It will even work with\n container types yet to be written - as long as they follows the above\n pattern.\n* You can use nested `ElementsAre*()` to match nested (multi-dimensional)\n containers.\n* If the container is passed by pointer instead of by reference, just write\n `Pointee(ElementsAre*(...))`.\n* The order of elements *matters* for `ElementsAre*()`. If you are using it\n with containers whose element order are undefined (e.g. `hash_map`) you\n should use `WhenSorted` around `ElementsAre`.\n\n### Sharing Matchers\n\nUnder the hood, a gMock matcher object consists of a pointer to a ref-counted\nimplementation object. Copying matchers is allowed and very efficient, as only\nthe pointer is copied. When the last matcher that references the implementation\nobject dies, the implementation object will be deleted.\n\nTherefore, if you have some complex matcher that you want to use again and\nagain, there is no need to build it every time. Just assign it to a matcher\nvariable and use that variable repeatedly! For example,\n\n```cpp\nusing ::testing::AllOf;\nusing ::testing::Gt;\nusing ::testing::Le;\nusing ::testing::Matcher;\n...\n Matcher in_range = AllOf(Gt(5), Le(10));\n ... use in_range as a matcher in multiple EXPECT_CALLs ...\n```\n\n### Matchers must have no side-effects {#PureMatchers}\n\n{: .callout .warning}\nWARNING: gMock does not guarantee when or how many times a matcher will be\ninvoked. Therefore, all matchers must be *purely functional*: they cannot have\nany side effects, and the match result must not depend on anything other than\nthe matcher's parameters and the value being matched.\n\nThis requirement must be satisfied no matter how a matcher is defined (e.g., if\nit is one of the standard matchers, or a custom matcher). In particular, a\nmatcher can never call a mock function, as that will affect the state of the\nmock object and gMock.\n\n## Setting Expectations\n\n### Knowing When to Expect {#UseOnCall}\n\n**`ON_CALL`** is likely the *single most under-utilized construct* in gMock.\n\nThere are basically two constructs for defining the behavior of a mock object:\n`ON_CALL` and `EXPECT_CALL`. The difference? `ON_CALL` defines what happens when\na mock method is called, but doesn't imply any expectation on the method\nbeing called. `EXPECT_CALL` not only defines the behavior, but also sets an\nexpectation that the method will be called with the given arguments, for the\ngiven number of times (and *in the given order* when you specify the order\ntoo).\n\nSince `EXPECT_CALL` does more, isn't it better than `ON_CALL`? Not really. Every\n`EXPECT_CALL` adds a constraint on the behavior of the code under test. Having\nmore constraints than necessary is *baaad* - even worse than not having enough\nconstraints.\n\nThis may be counter-intuitive. How could tests that verify more be worse than\ntests that verify less? Isn't verification the whole point of tests?\n\nThe answer lies in *what* a test should verify. **A good test verifies the\ncontract of the code.** If a test over-specifies, it doesn't leave enough\nfreedom to the implementation. As a result, changing the implementation without\nbreaking the contract (e.g. refactoring and optimization), which should be\nperfectly fine to do, can break such tests. Then you have to spend time fixing\nthem, only to see them broken again the next time the implementation is changed.\n\nKeep in mind that one doesn't have to verify more than one property in one test.\nIn fact, **it's a good style to verify only one thing in one test.** If you do\nthat, a bug will likely break only one or two tests instead of dozens (which\ncase would you rather debug?). If you are also in the habit of giving tests\ndescriptive names that tell what they verify, you can often easily guess what's\nwrong just from the test log itself.\n\nSo use `ON_CALL` by default, and only use `EXPECT_CALL` when you actually intend\nto verify that the call is made. For example, you may have a bunch of `ON_CALL`s\nin your test fixture to set the common mock behavior shared by all tests in the\nsame group, and write (scarcely) different `EXPECT_CALL`s in different `TEST_F`s\nto verify different aspects of the code's behavior. Compared with the style\nwhere each `TEST` has many `EXPECT_CALL`s, this leads to tests that are more\nresilient to implementational changes (and thus less likely to require\nmaintenance) and makes the intent of the tests more obvious (so they are easier\nto maintain when you do need to maintain them).\n\nIf you are bothered by the \"Uninteresting mock function call\" message printed\nwhen a mock method without an `EXPECT_CALL` is called, you may use a `NiceMock`\ninstead to suppress all such messages for the mock object, or suppress the\nmessage for specific methods by adding `EXPECT_CALL(...).Times(AnyNumber())`. DO\nNOT suppress it by blindly adding an `EXPECT_CALL(...)`, or you'll have a test\nthat's a pain to maintain.\n\n### Ignoring Uninteresting Calls\n\nIf you are not interested in how a mock method is called, just don't say\nanything about it. In this case, if the method is ever called, gMock will\nperform its default action to allow the test program to continue. If you are not\nhappy with the default action taken by gMock, you can override it using\n`DefaultValue::Set()` (described [here](#DefaultValue)) or `ON_CALL()`.\n\nPlease note that once you expressed interest in a particular mock method (via\n`EXPECT_CALL()`), all invocations to it must match some expectation. If this\nfunction is called but the arguments don't match any `EXPECT_CALL()` statement,\nit will be an error.\n\n### Disallowing Unexpected Calls\n\nIf a mock method shouldn't be called at all, explicitly say so:\n\n```cpp\nusing ::testing::_;\n...\n EXPECT_CALL(foo, Bar(_))\n .Times(0);\n```\n\nIf some calls to the method are allowed, but the rest are not, just list all the\nexpected calls:\n\n```cpp\nusing ::testing::AnyNumber;\nusing ::testing::Gt;\n...\n EXPECT_CALL(foo, Bar(5));\n EXPECT_CALL(foo, Bar(Gt(10)))\n .Times(AnyNumber());\n```\n\nA call to `foo.Bar()` that doesn't match any of the `EXPECT_CALL()` statements\nwill be an error.\n\n### Understanding Uninteresting vs Unexpected Calls {#uninteresting-vs-unexpected}\n\n*Uninteresting* calls and *unexpected* calls are different concepts in gMock.\n*Very* different.\n\nA call `x.Y(...)` is **uninteresting** if there's *not even a single*\n`EXPECT_CALL(x, Y(...))` set. In other words, the test isn't interested in the\n`x.Y()` method at all, as evident in that the test doesn't care to say anything\nabout it.\n\nA call `x.Y(...)` is **unexpected** if there are *some* `EXPECT_CALL(x,\nY(...))`s set, but none of them matches the call. Put another way, the test is\ninterested in the `x.Y()` method (therefore it explicitly sets some\n`EXPECT_CALL` to verify how it's called); however, the verification fails as the\ntest doesn't expect this particular call to happen.\n\n**An unexpected call is always an error,** as the code under test doesn't behave\nthe way the test expects it to behave.\n\n**By default, an uninteresting call is not an error,** as it violates no\nconstraint specified by the test. (gMock's philosophy is that saying nothing\nmeans there is no constraint.) However, it leads to a warning, as it *might*\nindicate a problem (e.g. the test author might have forgotten to specify a\nconstraint).\n\nIn gMock, `NiceMock` and `StrictMock` can be used to make a mock class \"nice\" or\n\"strict\". How does this affect uninteresting calls and unexpected calls?\n\nA **nice mock** suppresses uninteresting call *warnings*. It is less chatty than\nthe default mock, but otherwise is the same. If a test fails with a default\nmock, it will also fail using a nice mock instead. And vice versa. Don't expect\nmaking a mock nice to change the test's result.\n\nA **strict mock** turns uninteresting call warnings into errors. So making a\nmock strict may change the test's result.\n\nLet's look at an example:\n\n```cpp\nTEST(...) {\n NiceMock mock_registry;\n EXPECT_CALL(mock_registry, GetDomainOwner(\"google.com\"))\n .WillRepeatedly(Return(\"Larry Page\"));\n\n // Use mock_registry in code under test.\n ... &mock_registry ...\n}\n```\n\nThe sole `EXPECT_CALL` here says that all calls to `GetDomainOwner()` must have\n`\"google.com\"` as the argument. If `GetDomainOwner(\"yahoo.com\")` is called, it\nwill be an unexpected call, and thus an error. *Having a nice mock doesn't\nchange the severity of an unexpected call.*\n\nSo how do we tell gMock that `GetDomainOwner()` can be called with some other\narguments as well? The standard technique is to add a \"catch all\" `EXPECT_CALL`:\n\n```cpp\n EXPECT_CALL(mock_registry, GetDomainOwner(_))\n .Times(AnyNumber()); // catches all other calls to this method.\n EXPECT_CALL(mock_registry, GetDomainOwner(\"google.com\"))\n .WillRepeatedly(Return(\"Larry Page\"));\n```\n\nRemember that `_` is the wildcard matcher that matches anything. With this, if\n`GetDomainOwner(\"google.com\")` is called, it will do what the second\n`EXPECT_CALL` says; if it is called with a different argument, it will do what\nthe first `EXPECT_CALL` says.\n\nNote that the order of the two `EXPECT_CALL`s is important, as a newer\n`EXPECT_CALL` takes precedence over an older one.\n\nFor more on uninteresting calls, nice mocks, and strict mocks, read\n[\"The Nice, the Strict, and the Naggy\"](#NiceStrictNaggy).\n\n### Ignoring Uninteresting Arguments {#ParameterlessExpectations}\n\nIf your test doesn't care about the parameters (it only cares about the number\nor order of calls), you can often simply omit the parameter list:\n\n```cpp\n // Expect foo.Bar( ... ) twice with any arguments.\n EXPECT_CALL(foo, Bar).Times(2);\n\n // Delegate to the given method whenever the factory is invoked.\n ON_CALL(foo_factory, MakeFoo)\n .WillByDefault(&BuildFooForTest);\n```\n\nThis functionality is only available when a method is not overloaded; to prevent\nunexpected behavior it is a compilation error to try to set an expectation on a\nmethod where the specific overload is ambiguous. You can work around this by\nsupplying a [simpler mock interface](#SimplerInterfaces) than the mocked class\nprovides.\n\nThis pattern is also useful when the arguments are interesting, but match logic\nis substantially complex. You can leave the argument list unspecified and use\nSaveArg actions to [save the values for later verification](#SaveArgVerify). If\nyou do that, you can easily differentiate calling the method the wrong number of\ntimes from calling it with the wrong arguments.\n\n### Expecting Ordered Calls {#OrderedCalls}\n\nAlthough an `EXPECT_CALL()` statement defined later takes precedence when gMock\ntries to match a function call with an expectation, by default calls don't have\nto happen in the order `EXPECT_CALL()` statements are written. For example, if\nthe arguments match the matchers in the second `EXPECT_CALL()`, but not those in\nthe first and third, then the second expectation will be used.\n\nIf you would rather have all calls occur in the order of the expectations, put\nthe `EXPECT_CALL()` statements in a block where you define a variable of type\n`InSequence`:\n\n```cpp\nusing ::testing::_;\nusing ::testing::InSequence;\n\n {\n InSequence s;\n\n EXPECT_CALL(foo, DoThis(5));\n EXPECT_CALL(bar, DoThat(_))\n .Times(2);\n EXPECT_CALL(foo, DoThis(6));\n }\n```\n\nIn this example, we expect a call to `foo.DoThis(5)`, followed by two calls to\n`bar.DoThat()` where the argument can be anything, which are in turn followed by\na call to `foo.DoThis(6)`. If a call occurred out-of-order, gMock will report an\nerror.\n\n### Expecting Partially Ordered Calls {#PartialOrder}\n\nSometimes requiring everything to occur in a predetermined order can lead to\nbrittle tests. For example, we may care about `A` occurring before both `B` and\n`C`, but aren't interested in the relative order of `B` and `C`. In this case,\nthe test should reflect our real intent, instead of being overly constraining.\n\ngMock allows you to impose an arbitrary DAG (directed acyclic graph) on the\ncalls. One way to express the DAG is to use the\n[`After` clause](reference/mocking.md#EXPECT_CALL.After) of `EXPECT_CALL`.\n\nAnother way is via the `InSequence()` clause (not the same as the `InSequence`\nclass), which we borrowed from jMock 2. It's less flexible than `After()`, but\nmore convenient when you have long chains of sequential calls, as it doesn't\nrequire you to come up with different names for the expectations in the chains.\nHere's how it works:\n\nIf we view `EXPECT_CALL()` statements as nodes in a graph, and add an edge from\nnode A to node B wherever A must occur before B, we can get a DAG. We use the\nterm \"sequence\" to mean a directed path in this DAG. Now, if we decompose the\nDAG into sequences, we just need to know which sequences each `EXPECT_CALL()`\nbelongs to in order to be able to reconstruct the original DAG.\n\nSo, to specify the partial order on the expectations we need to do two things:\nfirst to define some `Sequence` objects, and then for each `EXPECT_CALL()` say\nwhich `Sequence` objects it is part of.\n\nExpectations in the same sequence must occur in the order they are written. For\nexample,\n\n```cpp\nusing ::testing::Sequence;\n...\n Sequence s1, s2;\n\n EXPECT_CALL(foo, A())\n .InSequence(s1, s2);\n EXPECT_CALL(bar, B())\n .InSequence(s1);\n EXPECT_CALL(bar, C())\n .InSequence(s2);\n EXPECT_CALL(foo, D())\n .InSequence(s2);\n```\n\nspecifies the following DAG (where `s1` is `A -> B`, and `s2` is `A -> C -> D`):\n\n```text\n +---> B\n |\n A ---|\n |\n +---> C ---> D\n```\n\nThis means that A must occur before B and C, and C must occur before D. There's\nno restriction about the order other than these.\n\n### Controlling When an Expectation Retires\n\nWhen a mock method is called, gMock only considers expectations that are still\nactive. An expectation is active when created, and becomes inactive (aka\n*retires*) when a call that has to occur later has occurred. For example, in\n\n```cpp\nusing ::testing::_;\nusing ::testing::Sequence;\n...\n Sequence s1, s2;\n\n EXPECT_CALL(log, Log(WARNING, _, \"File too large.\")) // #1\n .Times(AnyNumber())\n .InSequence(s1, s2);\n EXPECT_CALL(log, Log(WARNING, _, \"Data set is empty.\")) // #2\n .InSequence(s1);\n EXPECT_CALL(log, Log(WARNING, _, \"User not found.\")) // #3\n .InSequence(s2);\n```\n\nas soon as either #2 or #3 is matched, #1 will retire. If a warning `\"File too\nlarge.\"` is logged after this, it will be an error.\n\nNote that an expectation doesn't retire automatically when it's saturated. For\nexample,\n\n```cpp\nusing ::testing::_;\n...\n EXPECT_CALL(log, Log(WARNING, _, _)); // #1\n EXPECT_CALL(log, Log(WARNING, _, \"File too large.\")); // #2\n```\n\nsays that there will be exactly one warning with the message `\"File too\nlarge.\"`. If the second warning contains this message too, #2 will match again\nand result in an upper-bound-violated error.\n\nIf this is not what you want, you can ask an expectation to retire as soon as it\nbecomes saturated:\n\n```cpp\nusing ::testing::_;\n...\n EXPECT_CALL(log, Log(WARNING, _, _)); // #1\n EXPECT_CALL(log, Log(WARNING, _, \"File too large.\")) // #2\n .RetiresOnSaturation();\n```\n\nHere #2 can be used only once, so if you have two warnings with the message\n`\"File too large.\"`, the first will match #2 and the second will match #1 -\nthere will be no error.\n\n## Using Actions\n\n### Returning References from Mock Methods\n\nIf a mock function's return type is a reference, you need to use `ReturnRef()`\ninstead of `Return()` to return a result:\n\n```cpp\nusing ::testing::ReturnRef;\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(Bar&, GetBar, (), (override));\n};\n...\n MockFoo foo;\n Bar bar;\n EXPECT_CALL(foo, GetBar())\n .WillOnce(ReturnRef(bar));\n...\n```\n\n### Returning Live Values from Mock Methods\n\nThe `Return(x)` action saves a copy of `x` when the action is created, and\nalways returns the same value whenever it's executed. Sometimes you may want to\ninstead return the *live* value of `x` (i.e. its value at the time when the\naction is *executed*.). Use either `ReturnRef()` or `ReturnPointee()` for this\npurpose.\n\nIf the mock function's return type is a reference, you can do it using\n`ReturnRef(x)`, as shown in the previous recipe (\"Returning References from Mock\nMethods\"). However, gMock doesn't let you use `ReturnRef()` in a mock function\nwhose return type is not a reference, as doing that usually indicates a user\nerror. So, what shall you do?\n\nThough you may be tempted, DO NOT use `std::ref()`:\n\n```cpp\nusing testing::Return;\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(int, GetValue, (), (override));\n};\n...\n int x = 0;\n MockFoo foo;\n EXPECT_CALL(foo, GetValue())\n .WillRepeatedly(Return(std::ref(x))); // Wrong!\n x = 42;\n EXPECT_EQ(42, foo.GetValue());\n```\n\nUnfortunately, it doesn't work here. The above code will fail with error:\n\n```text\nValue of: foo.GetValue()\n Actual: 0\nExpected: 42\n```\n\nThe reason is that `Return(*value*)` converts `value` to the actual return type\nof the mock function at the time when the action is *created*, not when it is\n*executed*. (This behavior was chosen for the action to be safe when `value` is\na proxy object that references some temporary objects.) As a result,\n`std::ref(x)` is converted to an `int` value (instead of a `const int&`) when\nthe expectation is set, and `Return(std::ref(x))` will always return 0.\n\n`ReturnPointee(pointer)` was provided to solve this problem specifically. It\nreturns the value pointed to by `pointer` at the time the action is *executed*:\n\n```cpp\nusing testing::ReturnPointee;\n...\n int x = 0;\n MockFoo foo;\n EXPECT_CALL(foo, GetValue())\n .WillRepeatedly(ReturnPointee(&x)); // Note the & here.\n x = 42;\n EXPECT_EQ(42, foo.GetValue()); // This will succeed now.\n```\n\n### Combining Actions\n\nWant to do more than one thing when a function is called? That's fine. `DoAll()`\nallow you to do sequence of actions every time. Only the return value of the\nlast action in the sequence will be used.\n\n```cpp\nusing ::testing::_;\nusing ::testing::DoAll;\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(bool, Bar, (int n), (override));\n};\n...\n EXPECT_CALL(foo, Bar(_))\n .WillOnce(DoAll(action_1,\n action_2,\n ...\n action_n));\n```\n\n### Verifying Complex Arguments {#SaveArgVerify}\n\nIf you want to verify that a method is called with a particular argument but the\nmatch criteria is complex, it can be difficult to distinguish between\ncardinality failures (calling the method the wrong number of times) and argument\nmatch failures. Similarly, if you are matching multiple parameters, it may not\nbe easy to distinguishing which argument failed to match. For example:\n\n```cpp\n // Not ideal: this could fail because of a problem with arg1 or arg2, or maybe\n // just the method wasn't called.\n EXPECT_CALL(foo, SendValues(_, ElementsAre(1, 4, 4, 7), EqualsProto( ... )));\n```\n\nYou can instead save the arguments and test them individually:\n\n```cpp\n EXPECT_CALL(foo, SendValues)\n .WillOnce(DoAll(SaveArg<1>(&actual_array), SaveArg<2>(&actual_proto)));\n ... run the test\n EXPECT_THAT(actual_array, ElementsAre(1, 4, 4, 7));\n EXPECT_THAT(actual_proto, EqualsProto( ... ));\n```\n\n### Mocking Side Effects {#MockingSideEffects}\n\nSometimes a method exhibits its effect not via returning a value but via side\neffects. For example, it may change some global state or modify an output\nargument. To mock side effects, in general you can define your own action by\nimplementing `::testing::ActionInterface`.\n\nIf all you need to do is to change an output argument, the built-in\n`SetArgPointee()` action is convenient:\n\n```cpp\nusing ::testing::_;\nusing ::testing::SetArgPointee;\n\nclass MockMutator : public Mutator {\n public:\n MOCK_METHOD(void, Mutate, (bool mutate, int* value), (override));\n ...\n}\n...\n MockMutator mutator;\n EXPECT_CALL(mutator, Mutate(true, _))\n .WillOnce(SetArgPointee<1>(5));\n```\n\nIn this example, when `mutator.Mutate()` is called, we will assign 5 to the\n`int` variable pointed to by argument #1 (0-based).\n\n`SetArgPointee()` conveniently makes an internal copy of the value you pass to\nit, removing the need to keep the value in scope and alive. The implication\nhowever is that the value must have a copy constructor and assignment operator.\n\nIf the mock method also needs to return a value as well, you can chain\n`SetArgPointee()` with `Return()` using `DoAll()`, remembering to put the\n`Return()` statement last:\n\n```cpp\nusing ::testing::_;\nusing ::testing::DoAll;\nusing ::testing::Return;\nusing ::testing::SetArgPointee;\n\nclass MockMutator : public Mutator {\n public:\n ...\n MOCK_METHOD(bool, MutateInt, (int* value), (override));\n}\n...\n MockMutator mutator;\n EXPECT_CALL(mutator, MutateInt(_))\n .WillOnce(DoAll(SetArgPointee<0>(5),\n Return(true)));\n```\n\nNote, however, that if you use the `ReturnOKWith()` method, it will override the\nvalues provided by `SetArgPointee()` in the response parameters of your function\ncall.\n\nIf the output argument is an array, use the `SetArrayArgument(first, last)`\naction instead. It copies the elements in source range `[first, last)` to the\narray pointed to by the `N`-th (0-based) argument:\n\n```cpp\nusing ::testing::NotNull;\nusing ::testing::SetArrayArgument;\n\nclass MockArrayMutator : public ArrayMutator {\n public:\n MOCK_METHOD(void, Mutate, (int* values, int num_values), (override));\n ...\n}\n...\n MockArrayMutator mutator;\n int values[5] = {1, 2, 3, 4, 5};\n EXPECT_CALL(mutator, Mutate(NotNull(), 5))\n .WillOnce(SetArrayArgument<0>(values, values + 5));\n```\n\nThis also works when the argument is an output iterator:\n\n```cpp\nusing ::testing::_;\nusing ::testing::SetArrayArgument;\n\nclass MockRolodex : public Rolodex {\n public:\n MOCK_METHOD(void, GetNames, (std::back_insert_iterator>),\n (override));\n ...\n}\n...\n MockRolodex rolodex;\n vector names = {\"George\", \"John\", \"Thomas\"};\n EXPECT_CALL(rolodex, GetNames(_))\n .WillOnce(SetArrayArgument<0>(names.begin(), names.end()));\n```\n\n### Changing a Mock Object's Behavior Based on the State\n\nIf you expect a call to change the behavior of a mock object, you can use\n`::testing::InSequence` to specify different behaviors before and after the\ncall:\n\n```cpp\nusing ::testing::InSequence;\nusing ::testing::Return;\n\n...\n {\n InSequence seq;\n EXPECT_CALL(my_mock, IsDirty())\n .WillRepeatedly(Return(true));\n EXPECT_CALL(my_mock, Flush());\n EXPECT_CALL(my_mock, IsDirty())\n .WillRepeatedly(Return(false));\n }\n my_mock.FlushIfDirty();\n```\n\nThis makes `my_mock.IsDirty()` return `true` before `my_mock.Flush()` is called\nand return `false` afterwards.\n\nIf the behavior change is more complex, you can store the effects in a variable\nand make a mock method get its return value from that variable:\n\n```cpp\nusing ::testing::_;\nusing ::testing::SaveArg;\nusing ::testing::Return;\n\nACTION_P(ReturnPointee, p) { return *p; }\n...\n int previous_value = 0;\n EXPECT_CALL(my_mock, GetPrevValue)\n .WillRepeatedly(ReturnPointee(&previous_value));\n EXPECT_CALL(my_mock, UpdateValue)\n .WillRepeatedly(SaveArg<0>(&previous_value));\n my_mock.DoSomethingToUpdateValue();\n```\n\nHere `my_mock.GetPrevValue()` will always return the argument of the last\n`UpdateValue()` call.\n\n### Setting the Default Value for a Return Type {#DefaultValue}\n\nIf a mock method's return type is a built-in C++ type or pointer, by default it\nwill return 0 when invoked. Also, in C++ 11 and above, a mock method whose\nreturn type has a default constructor will return a default-constructed value by\ndefault. You only need to specify an action if this default value doesn't work\nfor you.\n\nSometimes, you may want to change this default value, or you may want to specify\na default value for types gMock doesn't know about. You can do this using the\n`::testing::DefaultValue` class template:\n\n```cpp\nusing ::testing::DefaultValue;\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(Bar, CalculateBar, (), (override));\n};\n\n\n...\n Bar default_bar;\n // Sets the default return value for type Bar.\n DefaultValue::Set(default_bar);\n\n MockFoo foo;\n\n // We don't need to specify an action here, as the default\n // return value works for us.\n EXPECT_CALL(foo, CalculateBar());\n\n foo.CalculateBar(); // This should return default_bar.\n\n // Unsets the default return value.\n DefaultValue::Clear();\n```\n\nPlease note that changing the default value for a type can make your tests hard\nto understand. We recommend you to use this feature judiciously. For example,\nyou may want to make sure the `Set()` and `Clear()` calls are right next to the\ncode that uses your mock.\n\n### Setting the Default Actions for a Mock Method\n\nYou've learned how to change the default value of a given type. However, this\nmay be too coarse for your purpose: perhaps you have two mock methods with the\nsame return type and you want them to have different behaviors. The `ON_CALL()`\nmacro allows you to customize your mock's behavior at the method level:\n\n```cpp\nusing ::testing::_;\nusing ::testing::AnyNumber;\nusing ::testing::Gt;\nusing ::testing::Return;\n...\n ON_CALL(foo, Sign(_))\n .WillByDefault(Return(-1));\n ON_CALL(foo, Sign(0))\n .WillByDefault(Return(0));\n ON_CALL(foo, Sign(Gt(0)))\n .WillByDefault(Return(1));\n\n EXPECT_CALL(foo, Sign(_))\n .Times(AnyNumber());\n\n foo.Sign(5); // This should return 1.\n foo.Sign(-9); // This should return -1.\n foo.Sign(0); // This should return 0.\n```\n\nAs you may have guessed, when there are more than one `ON_CALL()` statements,\nthe newer ones in the order take precedence over the older ones. In other words,\nthe **last** one that matches the function arguments will be used. This matching\norder allows you to set up the common behavior in a mock object's constructor or\nthe test fixture's set-up phase and specialize the mock's behavior later.\n\nNote that both `ON_CALL` and `EXPECT_CALL` have the same \"later statements take\nprecedence\" rule, but they don't interact. That is, `EXPECT_CALL`s have their\nown precedence order distinct from the `ON_CALL` precedence order.\n\n### Using Functions/Methods/Functors/Lambdas as Actions {#FunctionsAsActions}\n\nIf the built-in actions don't suit you, you can use an existing callable\n(function, `std::function`, method, functor, lambda) as an action.\n\n```cpp\nusing ::testing::_; using ::testing::Invoke;\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(int, Sum, (int x, int y), (override));\n MOCK_METHOD(bool, ComplexJob, (int x), (override));\n};\n\nint CalculateSum(int x, int y) { return x + y; }\nint Sum3(int x, int y, int z) { return x + y + z; }\n\nclass Helper {\n public:\n bool ComplexJob(int x);\n};\n\n...\n MockFoo foo;\n Helper helper;\n EXPECT_CALL(foo, Sum(_, _))\n .WillOnce(&CalculateSum)\n .WillRepeatedly(Invoke(NewPermanentCallback(Sum3, 1)));\n EXPECT_CALL(foo, ComplexJob(_))\n .WillOnce(Invoke(&helper, &Helper::ComplexJob))\n .WillOnce([] { return true; })\n .WillRepeatedly([](int x) { return x > 0; });\n\n foo.Sum(5, 6); // Invokes CalculateSum(5, 6).\n foo.Sum(2, 3); // Invokes Sum3(1, 2, 3).\n foo.ComplexJob(10); // Invokes helper.ComplexJob(10).\n foo.ComplexJob(-1); // Invokes the inline lambda.\n```\n\nThe only requirement is that the type of the function, etc must be *compatible*\nwith the signature of the mock function, meaning that the latter's arguments (if\nit takes any) can be implicitly converted to the corresponding arguments of the\nformer, and the former's return type can be implicitly converted to that of the\nlatter. So, you can invoke something whose type is *not* exactly the same as the\nmock function, as long as it's safe to do so - nice, huh?\n\nNote that:\n\n* The action takes ownership of the callback and will delete it when the\n action itself is destructed.\n* If the type of a callback is derived from a base callback type `C`, you need\n to implicitly cast it to `C` to resolve the overloading, e.g.\n\n ```cpp\n using ::testing::Invoke;\n ...\n ResultCallback* is_ok = ...;\n ... Invoke(is_ok) ...; // This works.\n\n BlockingClosure* done = new BlockingClosure;\n ... Invoke(implicit_cast(done)) ...; // The cast is necessary.\n ```\n\n### Using Functions with Extra Info as Actions\n\nThe function or functor you call using `Invoke()` must have the same number of\narguments as the mock function you use it for. Sometimes you may have a function\nthat takes more arguments, and you are willing to pass in the extra arguments\nyourself to fill the gap. You can do this in gMock using callbacks with\npre-bound arguments. Here's an example:\n\n```cpp\nusing ::testing::Invoke;\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(char, DoThis, (int n), (override));\n};\n\nchar SignOfSum(int x, int y) {\n const int sum = x + y;\n return (sum > 0) ? '+' : (sum < 0) ? '-' : '0';\n}\n\nTEST_F(FooTest, Test) {\n MockFoo foo;\n\n EXPECT_CALL(foo, DoThis(2))\n .WillOnce(Invoke(NewPermanentCallback(SignOfSum, 5)));\n EXPECT_EQ('+', foo.DoThis(2)); // Invokes SignOfSum(5, 2).\n}\n```\n\n### Invoking a Function/Method/Functor/Lambda/Callback Without Arguments\n\n`Invoke()` passes the mock function's arguments to the function, etc being\ninvoked such that the callee has the full context of the call to work with. If\nthe invoked function is not interested in some or all of the arguments, it can\nsimply ignore them.\n\nYet, a common pattern is that a test author wants to invoke a function without\nthe arguments of the mock function. She could do that using a wrapper function\nthat throws away the arguments before invoking an underlining nullary function.\nNeedless to say, this can be tedious and obscures the intent of the test.\n\nThere are two solutions to this problem. First, you can pass any callable of\nzero args as an action. Alternatively, use `InvokeWithoutArgs()`, which is like\n`Invoke()` except that it doesn't pass the mock function's arguments to the\ncallee. Here's an example of each:\n\n```cpp\nusing ::testing::_;\nusing ::testing::InvokeWithoutArgs;\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(bool, ComplexJob, (int n), (override));\n};\n\nbool Job1() { ... }\nbool Job2(int n, char c) { ... }\n\n...\n MockFoo foo;\n EXPECT_CALL(foo, ComplexJob(_))\n .WillOnce([] { Job1(); });\n .WillOnce(InvokeWithoutArgs(NewPermanentCallback(Job2, 5, 'a')));\n\n foo.ComplexJob(10); // Invokes Job1().\n foo.ComplexJob(20); // Invokes Job2(5, 'a').\n```\n\nNote that:\n\n* The action takes ownership of the callback and will delete it when the\n action itself is destructed.\n* If the type of a callback is derived from a base callback type `C`, you need\n to implicitly cast it to `C` to resolve the overloading, e.g.\n\n ```cpp\n using ::testing::InvokeWithoutArgs;\n ...\n ResultCallback* is_ok = ...;\n ... InvokeWithoutArgs(is_ok) ...; // This works.\n\n BlockingClosure* done = ...;\n ... InvokeWithoutArgs(implicit_cast(done)) ...;\n // The cast is necessary.\n ```\n\n### Invoking an Argument of the Mock Function\n\nSometimes a mock function will receive a function pointer, a functor (in other\nwords, a \"callable\") as an argument, e.g.\n\n```cpp\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(bool, DoThis, (int n, (ResultCallback1* callback)),\n (override));\n};\n```\n\nand you may want to invoke this callable argument:\n\n```cpp\nusing ::testing::_;\n...\n MockFoo foo;\n EXPECT_CALL(foo, DoThis(_, _))\n .WillOnce(...);\n // Will execute callback->Run(5), where callback is the\n // second argument DoThis() receives.\n```\n\n{: .callout .note}\nNOTE: The section below is legacy documentation from before C++ had lambdas:\n\nArghh, you need to refer to a mock function argument but C++ has no lambda\n(yet), so you have to define your own action. :-( Or do you really?\n\nWell, gMock has an action to solve *exactly* this problem:\n\n```cpp\nInvokeArgument(arg_1, arg_2, ..., arg_m)\n```\n\nwill invoke the `N`-th (0-based) argument the mock function receives, with\n`arg_1`, `arg_2`, ..., and `arg_m`. No matter if the argument is a function\npointer, a functor, or a callback. gMock handles them all.\n\nWith that, you could write:\n\n```cpp\nusing ::testing::_;\nusing ::testing::InvokeArgument;\n...\n EXPECT_CALL(foo, DoThis(_, _))\n .WillOnce(InvokeArgument<1>(5));\n // Will execute callback->Run(5), where callback is the\n // second argument DoThis() receives.\n```\n\nWhat if the callable takes an argument by reference? No problem - just wrap it\ninside `std::ref()`:\n\n```cpp\n ...\n MOCK_METHOD(bool, Bar,\n ((ResultCallback2* callback)),\n (override));\n ...\n using ::testing::_;\n using ::testing::InvokeArgument;\n ...\n MockFoo foo;\n Helper helper;\n ...\n EXPECT_CALL(foo, Bar(_))\n .WillOnce(InvokeArgument<0>(5, std::ref(helper)));\n // std::ref(helper) guarantees that a reference to helper, not a copy of\n // it, will be passed to the callback.\n```\n\nWhat if the callable takes an argument by reference and we do **not** wrap the\nargument in `std::ref()`? Then `InvokeArgument()` will *make a copy* of the\nargument, and pass a *reference to the copy*, instead of a reference to the\noriginal value, to the callable. This is especially handy when the argument is a\ntemporary value:\n\n```cpp\n ...\n MOCK_METHOD(bool, DoThat, (bool (*f)(const double& x, const string& s)),\n (override));\n ...\n using ::testing::_;\n using ::testing::InvokeArgument;\n ...\n MockFoo foo;\n ...\n EXPECT_CALL(foo, DoThat(_))\n .WillOnce(InvokeArgument<0>(5.0, string(\"Hi\")));\n // Will execute (*f)(5.0, string(\"Hi\")), where f is the function pointer\n // DoThat() receives. Note that the values 5.0 and string(\"Hi\") are\n // temporary and dead once the EXPECT_CALL() statement finishes. Yet\n // it's fine to perform this action later, since a copy of the values\n // are kept inside the InvokeArgument action.\n```\n\n### Ignoring an Action's Result\n\nSometimes you have an action that returns *something*, but you need an action\nthat returns `void` (perhaps you want to use it in a mock function that returns\n`void`, or perhaps it needs to be used in `DoAll()` and it's not the last in the\nlist). `IgnoreResult()` lets you do that. For example:\n\n```cpp\nusing ::testing::_;\nusing ::testing::DoAll;\nusing ::testing::IgnoreResult;\nusing ::testing::Return;\n\nint Process(const MyData& data);\nstring DoSomething();\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(void, Abc, (const MyData& data), (override));\n MOCK_METHOD(bool, Xyz, (), (override));\n};\n\n ...\n MockFoo foo;\n EXPECT_CALL(foo, Abc(_))\n // .WillOnce(Invoke(Process));\n // The above line won't compile as Process() returns int but Abc() needs\n // to return void.\n .WillOnce(IgnoreResult(Process));\n EXPECT_CALL(foo, Xyz())\n .WillOnce(DoAll(IgnoreResult(DoSomething),\n // Ignores the string DoSomething() returns.\n Return(true)));\n```\n\nNote that you **cannot** use `IgnoreResult()` on an action that already returns\n`void`. Doing so will lead to ugly compiler errors.\n\n### Selecting an Action's Arguments {#SelectingArgs}\n\nSay you have a mock function `Foo()` that takes seven arguments, and you have a\ncustom action that you want to invoke when `Foo()` is called. Trouble is, the\ncustom action only wants three arguments:\n\n```cpp\nusing ::testing::_;\nusing ::testing::Invoke;\n...\n MOCK_METHOD(bool, Foo,\n (bool visible, const string& name, int x, int y,\n (const map>), double& weight, double min_weight,\n double max_wight));\n...\nbool IsVisibleInQuadrant1(bool visible, int x, int y) {\n return visible && x >= 0 && y >= 0;\n}\n...\n EXPECT_CALL(mock, Foo)\n .WillOnce(Invoke(IsVisibleInQuadrant1)); // Uh, won't compile. :-(\n```\n\nTo please the compiler God, you need to define an \"adaptor\" that has the same\nsignature as `Foo()` and calls the custom action with the right arguments:\n\n```cpp\nusing ::testing::_;\nusing ::testing::Invoke;\n...\nbool MyIsVisibleInQuadrant1(bool visible, const string& name, int x, int y,\n const map, double>& weight,\n double min_weight, double max_wight) {\n return IsVisibleInQuadrant1(visible, x, y);\n}\n...\n EXPECT_CALL(mock, Foo)\n .WillOnce(Invoke(MyIsVisibleInQuadrant1)); // Now it works.\n```\n\nBut isn't this awkward?\n\ngMock provides a generic *action adaptor*, so you can spend your time minding\nmore important business than writing your own adaptors. Here's the syntax:\n\n```cpp\nWithArgs(action)\n```\n\ncreates an action that passes the arguments of the mock function at the given\nindices (0-based) to the inner `action` and performs it. Using `WithArgs`, our\noriginal example can be written as:\n\n```cpp\nusing ::testing::_;\nusing ::testing::Invoke;\nusing ::testing::WithArgs;\n...\n EXPECT_CALL(mock, Foo)\n .WillOnce(WithArgs<0, 2, 3>(Invoke(IsVisibleInQuadrant1))); // No need to define your own adaptor.\n```\n\nFor better readability, gMock also gives you:\n\n* `WithoutArgs(action)` when the inner `action` takes *no* argument, and\n* `WithArg(action)` (no `s` after `Arg`) when the inner `action` takes\n *one* argument.\n\nAs you may have realized, `InvokeWithoutArgs(...)` is just syntactic sugar for\n`WithoutArgs(Invoke(...))`.\n\nHere are more tips:\n\n* The inner action used in `WithArgs` and friends does not have to be\n `Invoke()` -- it can be anything.\n* You can repeat an argument in the argument list if necessary, e.g.\n `WithArgs<2, 3, 3, 5>(...)`.\n* You can change the order of the arguments, e.g. `WithArgs<3, 2, 1>(...)`.\n* The types of the selected arguments do *not* have to match the signature of\n the inner action exactly. It works as long as they can be implicitly\n converted to the corresponding arguments of the inner action. For example,\n if the 4-th argument of the mock function is an `int` and `my_action` takes\n a `double`, `WithArg<4>(my_action)` will work.\n\n### Ignoring Arguments in Action Functions\n\nThe [selecting-an-action's-arguments](#SelectingArgs) recipe showed us one way\nto make a mock function and an action with incompatible argument lists fit\ntogether. The downside is that wrapping the action in `WithArgs<...>()` can get\ntedious for people writing the tests.\n\nIf you are defining a function (or method, functor, lambda, callback) to be used\nwith `Invoke*()`, and you are not interested in some of its arguments, an\nalternative to `WithArgs` is to declare the uninteresting arguments as `Unused`.\nThis makes the definition less cluttered and less fragile in case the types of\nthe uninteresting arguments change. It could also increase the chance the action\nfunction can be reused. For example, given\n\n```cpp\n public:\n MOCK_METHOD(double, Foo, double(const string& label, double x, double y),\n (override));\n MOCK_METHOD(double, Bar, (int index, double x, double y), (override));\n```\n\ninstead of\n\n```cpp\nusing ::testing::_;\nusing ::testing::Invoke;\n\ndouble DistanceToOriginWithLabel(const string& label, double x, double y) {\n return sqrt(x*x + y*y);\n}\ndouble DistanceToOriginWithIndex(int index, double x, double y) {\n return sqrt(x*x + y*y);\n}\n...\n EXPECT_CALL(mock, Foo(\"abc\", _, _))\n .WillOnce(Invoke(DistanceToOriginWithLabel));\n EXPECT_CALL(mock, Bar(5, _, _))\n .WillOnce(Invoke(DistanceToOriginWithIndex));\n```\n\nyou could write\n\n```cpp\nusing ::testing::_;\nusing ::testing::Invoke;\nusing ::testing::Unused;\n\ndouble DistanceToOrigin(Unused, double x, double y) {\n return sqrt(x*x + y*y);\n}\n...\n EXPECT_CALL(mock, Foo(\"abc\", _, _))\n .WillOnce(Invoke(DistanceToOrigin));\n EXPECT_CALL(mock, Bar(5, _, _))\n .WillOnce(Invoke(DistanceToOrigin));\n```\n\n### Sharing Actions\n\nJust like matchers, a gMock action object consists of a pointer to a ref-counted\nimplementation object. Therefore copying actions is also allowed and very\nefficient. When the last action that references the implementation object dies,\nthe implementation object will be deleted.\n\nIf you have some complex action that you want to use again and again, you may\nnot have to build it from scratch every time. If the action doesn't have an\ninternal state (i.e. if it always does the same thing no matter how many times\nit has been called), you can assign it to an action variable and use that\nvariable repeatedly. For example:\n\n```cpp\nusing ::testing::Action;\nusing ::testing::DoAll;\nusing ::testing::Return;\nusing ::testing::SetArgPointee;\n...\n Action set_flag = DoAll(SetArgPointee<0>(5),\n Return(true));\n ... use set_flag in .WillOnce() and .WillRepeatedly() ...\n```\n\nHowever, if the action has its own state, you may be surprised if you share the\naction object. Suppose you have an action factory `IncrementCounter(init)` which\ncreates an action that increments and returns a counter whose initial value is\n`init`, using two actions created from the same expression and using a shared\naction will exhibit different behaviors. Example:\n\n```cpp\n EXPECT_CALL(foo, DoThis())\n .WillRepeatedly(IncrementCounter(0));\n EXPECT_CALL(foo, DoThat())\n .WillRepeatedly(IncrementCounter(0));\n foo.DoThis(); // Returns 1.\n foo.DoThis(); // Returns 2.\n foo.DoThat(); // Returns 1 - Blah() uses a different\n // counter than Bar()'s.\n```\n\nversus\n\n```cpp\nusing ::testing::Action;\n...\n Action increment = IncrementCounter(0);\n EXPECT_CALL(foo, DoThis())\n .WillRepeatedly(increment);\n EXPECT_CALL(foo, DoThat())\n .WillRepeatedly(increment);\n foo.DoThis(); // Returns 1.\n foo.DoThis(); // Returns 2.\n foo.DoThat(); // Returns 3 - the counter is shared.\n```\n\n### Testing Asynchronous Behavior\n\nOne oft-encountered problem with gMock is that it can be hard to test\nasynchronous behavior. Suppose you had a `EventQueue` class that you wanted to\ntest, and you created a separate `EventDispatcher` interface so that you could\neasily mock it out. However, the implementation of the class fired all the\nevents on a background thread, which made test timings difficult. You could just\ninsert `sleep()` statements and hope for the best, but that makes your test\nbehavior nondeterministic. A better way is to use gMock actions and\n`Notification` objects to force your asynchronous test to behave synchronously.\n\n```cpp\nclass MockEventDispatcher : public EventDispatcher {\n MOCK_METHOD(bool, DispatchEvent, (int32), (override));\n};\n\nTEST(EventQueueTest, EnqueueEventTest) {\n MockEventDispatcher mock_event_dispatcher;\n EventQueue event_queue(&mock_event_dispatcher);\n\n const int32 kEventId = 321;\n absl::Notification done;\n EXPECT_CALL(mock_event_dispatcher, DispatchEvent(kEventId))\n .WillOnce([&done] { done.Notify(); });\n\n event_queue.EnqueueEvent(kEventId);\n done.WaitForNotification();\n}\n```\n\nIn the example above, we set our normal gMock expectations, but then add an\nadditional action to notify the `Notification` object. Now we can just call\n`Notification::WaitForNotification()` in the main thread to wait for the\nasynchronous call to finish. After that, our test suite is complete and we can\nsafely exit.\n\n{: .callout .note}\nNote: this example has a downside: namely, if the expectation is not satisfied,\nour test will run forever. It will eventually time-out and fail, but it will\ntake longer and be slightly harder to debug. To alleviate this problem, you can\nuse `WaitForNotificationWithTimeout(ms)` instead of `WaitForNotification()`.\n\n## Misc Recipes on Using gMock\n\n### Mocking Methods That Use Move-Only Types\n\nC++11 introduced *move-only types*. A move-only-typed value can be moved from\none object to another, but cannot be copied. `std::unique_ptr` is probably\nthe most commonly used move-only type.\n\nMocking a method that takes and/or returns move-only types presents some\nchallenges, but nothing insurmountable. This recipe shows you how you can do it.\nNote that the support for move-only method arguments was only introduced to\ngMock in April 2017; in older code, you may find more complex\n[workarounds](#LegacyMoveOnly) for lack of this feature.\n\nLet’s say we are working on a fictional project that lets one post and share\nsnippets called “buzzes”. Your code uses these types:\n\n```cpp\nenum class AccessLevel { kInternal, kPublic };\n\nclass Buzz {\n public:\n explicit Buzz(AccessLevel access) { ... }\n ...\n};\n\nclass Buzzer {\n public:\n virtual ~Buzzer() {}\n virtual std::unique_ptr MakeBuzz(StringPiece text) = 0;\n virtual bool ShareBuzz(std::unique_ptr buzz, int64_t timestamp) = 0;\n ...\n};\n```\n\nA `Buzz` object represents a snippet being posted. A class that implements the\n`Buzzer` interface is capable of creating and sharing `Buzz`es. Methods in\n`Buzzer` may return a `unique_ptr` or take a `unique_ptr`. Now we\nneed to mock `Buzzer` in our tests.\n\nTo mock a method that accepts or returns move-only types, you just use the\nfamiliar `MOCK_METHOD` syntax as usual:\n\n```cpp\nclass MockBuzzer : public Buzzer {\n public:\n MOCK_METHOD(std::unique_ptr, MakeBuzz, (StringPiece text), (override));\n MOCK_METHOD(bool, ShareBuzz, (std::unique_ptr buzz, int64_t timestamp),\n (override));\n};\n```\n\nNow that we have the mock class defined, we can use it in tests. In the\nfollowing code examples, we assume that we have defined a `MockBuzzer` object\nnamed `mock_buzzer_`:\n\n```cpp\n MockBuzzer mock_buzzer_;\n```\n\nFirst let’s see how we can set expectations on the `MakeBuzz()` method, which\nreturns a `unique_ptr`.\n\nAs usual, if you set an expectation without an action (i.e. the `.WillOnce()` or\n`.WillRepeatedly()` clause), when that expectation fires, the default action for\nthat method will be taken. Since `unique_ptr<>` has a default constructor that\nreturns a null `unique_ptr`, that’s what you’ll get if you don’t specify an\naction:\n\n```cpp\n // Use the default action.\n EXPECT_CALL(mock_buzzer_, MakeBuzz(\"hello\"));\n\n // Triggers the previous EXPECT_CALL.\n EXPECT_EQ(nullptr, mock_buzzer_.MakeBuzz(\"hello\"));\n```\n\nIf you are not happy with the default action, you can tweak it as usual; see\n[Setting Default Actions](#OnCall).\n\nIf you just need to return a pre-defined move-only value, you can use the\n`Return(ByMove(...))` action:\n\n```cpp\n // When this fires, the unique_ptr<> specified by ByMove(...) will\n // be returned.\n EXPECT_CALL(mock_buzzer_, MakeBuzz(\"world\"))\n .WillOnce(Return(ByMove(MakeUnique(AccessLevel::kInternal))));\n\n EXPECT_NE(nullptr, mock_buzzer_.MakeBuzz(\"world\"));\n```\n\nNote that `ByMove()` is essential here - if you drop it, the code won’t compile.\n\nQuiz time! What do you think will happen if a `Return(ByMove(...))` action is\nperformed more than once (e.g. you write `...\n.WillRepeatedly(Return(ByMove(...)));`)? Come think of it, after the first time\nthe action runs, the source value will be consumed (since it’s a move-only\nvalue), so the next time around, there’s no value to move from -- you’ll get a\nrun-time error that `Return(ByMove(...))` can only be run once.\n\nIf you need your mock method to do more than just moving a pre-defined value,\nremember that you can always use a lambda or a callable object, which can do\npretty much anything you want:\n\n```cpp\n EXPECT_CALL(mock_buzzer_, MakeBuzz(\"x\"))\n .WillRepeatedly([](StringPiece text) {\n return MakeUnique(AccessLevel::kInternal);\n });\n\n EXPECT_NE(nullptr, mock_buzzer_.MakeBuzz(\"x\"));\n EXPECT_NE(nullptr, mock_buzzer_.MakeBuzz(\"x\"));\n```\n\nEvery time this `EXPECT_CALL` fires, a new `unique_ptr` will be created\nand returned. You cannot do this with `Return(ByMove(...))`.\n\nThat covers returning move-only values; but how do we work with methods\naccepting move-only arguments? The answer is that they work normally, although\nsome actions will not compile when any of method's arguments are move-only. You\ncan always use `Return`, or a [lambda or functor](#FunctionsAsActions):\n\n```cpp\n using ::testing::Unused;\n\n EXPECT_CALL(mock_buzzer_, ShareBuzz(NotNull(), _)).WillOnce(Return(true));\n EXPECT_TRUE(mock_buzzer_.ShareBuzz(MakeUnique(AccessLevel::kInternal)),\n 0);\n\n EXPECT_CALL(mock_buzzer_, ShareBuzz(_, _)).WillOnce(\n [](std::unique_ptr buzz, Unused) { return buzz != nullptr; });\n EXPECT_FALSE(mock_buzzer_.ShareBuzz(nullptr, 0));\n```\n\nMany built-in actions (`WithArgs`, `WithoutArgs`,`DeleteArg`, `SaveArg`, ...)\ncould in principle support move-only arguments, but the support for this is not\nimplemented yet. If this is blocking you, please file a bug.\n\nA few actions (e.g. `DoAll`) copy their arguments internally, so they can never\nwork with non-copyable objects; you'll have to use functors instead.\n\n#### Legacy workarounds for move-only types {#LegacyMoveOnly}\n\nSupport for move-only function arguments was only introduced to gMock in April\nof 2017. In older code, you may encounter the following workaround for the lack\nof this feature (it is no longer necessary - we're including it just for\nreference):\n\n```cpp\nclass MockBuzzer : public Buzzer {\n public:\n MOCK_METHOD(bool, DoShareBuzz, (Buzz* buzz, Time timestamp));\n bool ShareBuzz(std::unique_ptr buzz, Time timestamp) override {\n return DoShareBuzz(buzz.get(), timestamp);\n }\n};\n```\n\nThe trick is to delegate the `ShareBuzz()` method to a mock method (let’s call\nit `DoShareBuzz()`) that does not take move-only parameters. Then, instead of\nsetting expectations on `ShareBuzz()`, you set them on the `DoShareBuzz()` mock\nmethod:\n\n```cpp\n MockBuzzer mock_buzzer_;\n EXPECT_CALL(mock_buzzer_, DoShareBuzz(NotNull(), _));\n\n // When one calls ShareBuzz() on the MockBuzzer like this, the call is\n // forwarded to DoShareBuzz(), which is mocked. Therefore this statement\n // will trigger the above EXPECT_CALL.\n mock_buzzer_.ShareBuzz(MakeUnique(AccessLevel::kInternal), 0);\n```\n\n### Making the Compilation Faster\n\nBelieve it or not, the *vast majority* of the time spent on compiling a mock\nclass is in generating its constructor and destructor, as they perform\nnon-trivial tasks (e.g. verification of the expectations). What's more, mock\nmethods with different signatures have different types and thus their\nconstructors/destructors need to be generated by the compiler separately. As a\nresult, if you mock many different types of methods, compiling your mock class\ncan get really slow.\n\nIf you are experiencing slow compilation, you can move the definition of your\nmock class' constructor and destructor out of the class body and into a `.cc`\nfile. This way, even if you `#include` your mock class in N files, the compiler\nonly needs to generate its constructor and destructor once, resulting in a much\nfaster compilation.\n\nLet's illustrate the idea using an example. Here's the definition of a mock\nclass before applying this recipe:\n\n```cpp\n// File mock_foo.h.\n...\nclass MockFoo : public Foo {\n public:\n // Since we don't declare the constructor or the destructor,\n // the compiler will generate them in every translation unit\n // where this mock class is used.\n\n MOCK_METHOD(int, DoThis, (), (override));\n MOCK_METHOD(bool, DoThat, (const char* str), (override));\n ... more mock methods ...\n};\n```\n\nAfter the change, it would look like:\n\n```cpp\n// File mock_foo.h.\n...\nclass MockFoo : public Foo {\n public:\n // The constructor and destructor are declared, but not defined, here.\n MockFoo();\n virtual ~MockFoo();\n\n MOCK_METHOD(int, DoThis, (), (override));\n MOCK_METHOD(bool, DoThat, (const char* str), (override));\n ... more mock methods ...\n};\n```\n\nand\n\n```cpp\n// File mock_foo.cc.\n#include \"path/to/mock_foo.h\"\n\n// The definitions may appear trivial, but the functions actually do a\n// lot of things through the constructors/destructors of the member\n// variables used to implement the mock methods.\nMockFoo::MockFoo() {}\nMockFoo::~MockFoo() {}\n```\n\n### Forcing a Verification\n\nWhen it's being destroyed, your friendly mock object will automatically verify\nthat all expectations on it have been satisfied, and will generate googletest\nfailures if not. This is convenient as it leaves you with one less thing to\nworry about. That is, unless you are not sure if your mock object will be\ndestroyed.\n\nHow could it be that your mock object won't eventually be destroyed? Well, it\nmight be created on the heap and owned by the code you are testing. Suppose\nthere's a bug in that code and it doesn't delete the mock object properly - you\ncould end up with a passing test when there's actually a bug.\n\nUsing a heap checker is a good idea and can alleviate the concern, but its\nimplementation is not 100% reliable. So, sometimes you do want to *force* gMock\nto verify a mock object before it is (hopefully) destructed. You can do this\nwith `Mock::VerifyAndClearExpectations(&mock_object)`:\n\n```cpp\nTEST(MyServerTest, ProcessesRequest) {\n using ::testing::Mock;\n\n MockFoo* const foo = new MockFoo;\n EXPECT_CALL(*foo, ...)...;\n // ... other expectations ...\n\n // server now owns foo.\n MyServer server(foo);\n server.ProcessRequest(...);\n\n // In case that server's destructor will forget to delete foo,\n // this will verify the expectations anyway.\n Mock::VerifyAndClearExpectations(foo);\n} // server is destroyed when it goes out of scope here.\n```\n\n{: .callout .tip}\n**Tip:** The `Mock::VerifyAndClearExpectations()` function returns a `bool` to\nindicate whether the verification was successful (`true` for yes), so you can\nwrap that function call inside a `ASSERT_TRUE()` if there is no point going\nfurther when the verification has failed.\n\nDo not set new expectations after verifying and clearing a mock after its use.\nSetting expectations after code that exercises the mock has undefined behavior.\nSee [Using Mocks in Tests](gmock_for_dummies.md#using-mocks-in-tests) for more\ninformation.\n\n### Using Checkpoints {#UsingCheckPoints}\n\nSometimes you might want to test a mock object's behavior in phases whose sizes\nare each manageable, or you might want to set more detailed expectations about\nwhich API calls invoke which mock functions.\n\nA technique you can use is to put the expectations in a sequence and insert\ncalls to a dummy \"checkpoint\" function at specific places. Then you can verify\nthat the mock function calls do happen at the right time. For example, if you\nare exercising the code:\n\n```cpp\n Foo(1);\n Foo(2);\n Foo(3);\n```\n\nand want to verify that `Foo(1)` and `Foo(3)` both invoke `mock.Bar(\"a\")`, but\n`Foo(2)` doesn't invoke anything, you can write:\n\n```cpp\nusing ::testing::MockFunction;\n\nTEST(FooTest, InvokesBarCorrectly) {\n MyMock mock;\n // Class MockFunction has exactly one mock method. It is named\n // Call() and has type F.\n MockFunction check;\n {\n InSequence s;\n\n EXPECT_CALL(mock, Bar(\"a\"));\n EXPECT_CALL(check, Call(\"1\"));\n EXPECT_CALL(check, Call(\"2\"));\n EXPECT_CALL(mock, Bar(\"a\"));\n }\n Foo(1);\n check.Call(\"1\");\n Foo(2);\n check.Call(\"2\");\n Foo(3);\n}\n```\n\nThe expectation spec says that the first `Bar(\"a\")` call must happen before\ncheckpoint \"1\", the second `Bar(\"a\")` call must happen after checkpoint \"2\", and\nnothing should happen between the two checkpoints. The explicit checkpoints make\nit clear which `Bar(\"a\")` is called by which call to `Foo()`.\n\n### Mocking Destructors\n\nSometimes you want to make sure a mock object is destructed at the right time,\ne.g. after `bar->A()` is called but before `bar->B()` is called. We already know\nthat you can specify constraints on the [order](#OrderedCalls) of mock function\ncalls, so all we need to do is to mock the destructor of the mock function.\n\nThis sounds simple, except for one problem: a destructor is a special function\nwith special syntax and special semantics, and the `MOCK_METHOD` macro doesn't\nwork for it:\n\n```cpp\nMOCK_METHOD(void, ~MockFoo, ()); // Won't compile!\n```\n\nThe good news is that you can use a simple pattern to achieve the same effect.\nFirst, add a mock function `Die()` to your mock class and call it in the\ndestructor, like this:\n\n```cpp\nclass MockFoo : public Foo {\n ...\n // Add the following two lines to the mock class.\n MOCK_METHOD(void, Die, ());\n ~MockFoo() override { Die(); }\n};\n```\n\n(If the name `Die()` clashes with an existing symbol, choose another name.) Now,\nwe have translated the problem of testing when a `MockFoo` object dies to\ntesting when its `Die()` method is called:\n\n```cpp\n MockFoo* foo = new MockFoo;\n MockBar* bar = new MockBar;\n ...\n {\n InSequence s;\n\n // Expects *foo to die after bar->A() and before bar->B().\n EXPECT_CALL(*bar, A());\n EXPECT_CALL(*foo, Die());\n EXPECT_CALL(*bar, B());\n }\n```\n\nAnd that's that.\n\n### Using gMock and Threads {#UsingThreads}\n\nIn a **unit** test, it's best if you could isolate and test a piece of code in a\nsingle-threaded context. That avoids race conditions and dead locks, and makes\ndebugging your test much easier.\n\nYet most programs are multi-threaded, and sometimes to test something we need to\npound on it from more than one thread. gMock works for this purpose too.\n\nRemember the steps for using a mock:\n\n1. Create a mock object `foo`.\n2. Set its default actions and expectations using `ON_CALL()` and\n `EXPECT_CALL()`.\n3. The code under test calls methods of `foo`.\n4. Optionally, verify and reset the mock.\n5. Destroy the mock yourself, or let the code under test destroy it. The\n destructor will automatically verify it.\n\nIf you follow the following simple rules, your mocks and threads can live\nhappily together:\n\n* Execute your *test code* (as opposed to the code being tested) in *one*\n thread. This makes your test easy to follow.\n* Obviously, you can do step #1 without locking.\n* When doing step #2 and #5, make sure no other thread is accessing `foo`.\n Obvious too, huh?\n* #3 and #4 can be done either in one thread or in multiple threads - anyway\n you want. gMock takes care of the locking, so you don't have to do any -\n unless required by your test logic.\n\nIf you violate the rules (for example, if you set expectations on a mock while\nanother thread is calling its methods), you get undefined behavior. That's not\nfun, so don't do it.\n\ngMock guarantees that the action for a mock function is done in the same thread\nthat called the mock function. For example, in\n\n```cpp\n EXPECT_CALL(mock, Foo(1))\n .WillOnce(action1);\n EXPECT_CALL(mock, Foo(2))\n .WillOnce(action2);\n```\n\nif `Foo(1)` is called in thread 1 and `Foo(2)` is called in thread 2, gMock will\nexecute `action1` in thread 1 and `action2` in thread 2.\n\ngMock does *not* impose a sequence on actions performed in different threads\n(doing so may create deadlocks as the actions may need to cooperate). This means\nthat the execution of `action1` and `action2` in the above example *may*\ninterleave. If this is a problem, you should add proper synchronization logic to\n`action1` and `action2` to make the test thread-safe.\n\nAlso, remember that `DefaultValue` is a global resource that potentially\naffects *all* living mock objects in your program. Naturally, you won't want to\nmess with it from multiple threads or when there still are mocks in action.\n\n### Controlling How Much Information gMock Prints\n\nWhen gMock sees something that has the potential of being an error (e.g. a mock\nfunction with no expectation is called, a.k.a. an uninteresting call, which is\nallowed but perhaps you forgot to explicitly ban the call), it prints some\nwarning messages, including the arguments of the function, the return value, and\nthe stack trace. Hopefully this will remind you to take a look and see if there\nis indeed a problem.\n\nSometimes you are confident that your tests are correct and may not appreciate\nsuch friendly messages. Some other times, you are debugging your tests or\nlearning about the behavior of the code you are testing, and wish you could\nobserve every mock call that happens (including argument values, the return\nvalue, and the stack trace). Clearly, one size doesn't fit all.\n\nYou can control how much gMock tells you using the `--gmock_verbose=LEVEL`\ncommand-line flag, where `LEVEL` is a string with three possible values:\n\n* `info`: gMock will print all informational messages, warnings, and errors\n (most verbose). At this setting, gMock will also log any calls to the\n `ON_CALL/EXPECT_CALL` macros. It will include a stack trace in\n \"uninteresting call\" warnings.\n* `warning`: gMock will print both warnings and errors (less verbose); it will\n omit the stack traces in \"uninteresting call\" warnings. This is the default.\n* `error`: gMock will print errors only (least verbose).\n\nAlternatively, you can adjust the value of that flag from within your tests like\nso:\n\n```cpp\n ::testing::FLAGS_gmock_verbose = \"error\";\n```\n\nIf you find gMock printing too many stack frames with its informational or\nwarning messages, remember that you can control their amount with the\n`--gtest_stack_trace_depth=max_depth` flag.\n\nNow, judiciously use the right flag to enable gMock serve you better!\n\n### Gaining Super Vision into Mock Calls\n\nYou have a test using gMock. It fails: gMock tells you some expectations aren't\nsatisfied. However, you aren't sure why: Is there a typo somewhere in the\nmatchers? Did you mess up the order of the `EXPECT_CALL`s? Or is the code under\ntest doing something wrong? How can you find out the cause?\n\nWon't it be nice if you have X-ray vision and can actually see the trace of all\n`EXPECT_CALL`s and mock method calls as they are made? For each call, would you\nlike to see its actual argument values and which `EXPECT_CALL` gMock thinks it\nmatches? If you still need some help to figure out who made these calls, how\nabout being able to see the complete stack trace at each mock call?\n\nYou can unlock this power by running your test with the `--gmock_verbose=info`\nflag. For example, given the test program:\n\n```cpp\n#include \"gmock/gmock.h\"\n\nusing testing::_;\nusing testing::HasSubstr;\nusing testing::Return;\n\nclass MockFoo {\n public:\n MOCK_METHOD(void, F, (const string& x, const string& y));\n};\n\nTEST(Foo, Bar) {\n MockFoo mock;\n EXPECT_CALL(mock, F(_, _)).WillRepeatedly(Return());\n EXPECT_CALL(mock, F(\"a\", \"b\"));\n EXPECT_CALL(mock, F(\"c\", HasSubstr(\"d\")));\n\n mock.F(\"a\", \"good\");\n mock.F(\"a\", \"b\");\n}\n```\n\nif you run it with `--gmock_verbose=info`, you will see this output:\n\n```shell\n[ RUN ] Foo.Bar\n\nfoo_test.cc:14: EXPECT_CALL(mock, F(_, _)) invoked\nStack trace: ...\n\nfoo_test.cc:15: EXPECT_CALL(mock, F(\"a\", \"b\")) invoked\nStack trace: ...\n\nfoo_test.cc:16: EXPECT_CALL(mock, F(\"c\", HasSubstr(\"d\"))) invoked\nStack trace: ...\n\nfoo_test.cc:14: Mock function call matches EXPECT_CALL(mock, F(_, _))...\n Function call: F(@0x7fff7c8dad40\"a\",@0x7fff7c8dad10\"good\")\nStack trace: ...\n\nfoo_test.cc:15: Mock function call matches EXPECT_CALL(mock, F(\"a\", \"b\"))...\n Function call: F(@0x7fff7c8dada0\"a\",@0x7fff7c8dad70\"b\")\nStack trace: ...\n\nfoo_test.cc:16: Failure\nActual function call count doesn't match EXPECT_CALL(mock, F(\"c\", HasSubstr(\"d\")))...\n Expected: to be called once\n Actual: never called - unsatisfied and active\n[ FAILED ] Foo.Bar\n```\n\nSuppose the bug is that the `\"c\"` in the third `EXPECT_CALL` is a typo and\nshould actually be `\"a\"`. With the above message, you should see that the actual\n`F(\"a\", \"good\")` call is matched by the first `EXPECT_CALL`, not the third as\nyou thought. From that it should be obvious that the third `EXPECT_CALL` is\nwritten wrong. Case solved.\n\nIf you are interested in the mock call trace but not the stack traces, you can\ncombine `--gmock_verbose=info` with `--gtest_stack_trace_depth=0` on the test\ncommand line.\n\n### Running Tests in Emacs\n\nIf you build and run your tests in Emacs using the `M-x google-compile` command\n(as many googletest users do), the source file locations of gMock and googletest\nerrors will be highlighted. Just press `` on one of them and you'll be\ntaken to the offending line. Or, you can just type `C-x`` to jump to the next\nerror.\n\nTo make it even easier, you can add the following lines to your `~/.emacs` file:\n\n```text\n(global-set-key \"\\M-m\" 'google-compile) ; m is for make\n(global-set-key [M-down] 'next-error)\n(global-set-key [M-up] '(lambda () (interactive) (next-error -1)))\n```\n\nThen you can type `M-m` to start a build (if you want to run the test as well,\njust make sure `foo_test.run` or `runtests` is in the build command you supply\nafter typing `M-m`), or `M-up`/`M-down` to move back and forth between errors.\n\n## Extending gMock\n\n### Writing New Matchers Quickly {#NewMatchers}\n\n{: .callout .warning}\nWARNING: gMock does not guarantee when or how many times a matcher will be\ninvoked. Therefore, all matchers must be functionally pure. See\n[this section](#PureMatchers) for more details.\n\nThe `MATCHER*` family of macros can be used to define custom matchers easily.\nThe syntax:\n\n```cpp\nMATCHER(name, description_string_expression) { statements; }\n```\n\nwill define a matcher with the given name that executes the statements, which\nmust return a `bool` to indicate if the match succeeds. Inside the statements,\nyou can refer to the value being matched by `arg`, and refer to its type by\n`arg_type`.\n\nThe *description string* is a `string`-typed expression that documents what the\nmatcher does, and is used to generate the failure message when the match fails.\nIt can (and should) reference the special `bool` variable `negation`, and should\nevaluate to the description of the matcher when `negation` is `false`, or that\nof the matcher's negation when `negation` is `true`.\n\nFor convenience, we allow the description string to be empty (`\"\"`), in which\ncase gMock will use the sequence of words in the matcher name as the\ndescription.\n\nFor example:\n\n```cpp\nMATCHER(IsDivisibleBy7, \"\") { return (arg % 7) == 0; }\n```\n\nallows you to write\n\n```cpp\n // Expects mock_foo.Bar(n) to be called where n is divisible by 7.\n EXPECT_CALL(mock_foo, Bar(IsDivisibleBy7()));\n```\n\nor,\n\n```cpp\n using ::testing::Not;\n ...\n // Verifies that a value is divisible by 7 and the other is not.\n EXPECT_THAT(some_expression, IsDivisibleBy7());\n EXPECT_THAT(some_other_expression, Not(IsDivisibleBy7()));\n```\n\nIf the above assertions fail, they will print something like:\n\n```shell\n Value of: some_expression\n Expected: is divisible by 7\n Actual: 27\n ...\n Value of: some_other_expression\n Expected: not (is divisible by 7)\n Actual: 21\n```\n\nwhere the descriptions `\"is divisible by 7\"` and `\"not (is divisible by 7)\"` are\nautomatically calculated from the matcher name `IsDivisibleBy7`.\n\nAs you may have noticed, the auto-generated descriptions (especially those for\nthe negation) may not be so great. You can always override them with a `string`\nexpression of your own:\n\n```cpp\nMATCHER(IsDivisibleBy7,\n absl::StrCat(negation ? \"isn't\" : \"is\", \" divisible by 7\")) {\n return (arg % 7) == 0;\n}\n```\n\nOptionally, you can stream additional information to a hidden argument named\n`result_listener` to explain the match result. For example, a better definition\nof `IsDivisibleBy7` is:\n\n```cpp\nMATCHER(IsDivisibleBy7, \"\") {\n if ((arg % 7) == 0)\n return true;\n\n *result_listener << \"the remainder is \" << (arg % 7);\n return false;\n}\n```\n\nWith this definition, the above assertion will give a better message:\n\n```shell\n Value of: some_expression\n Expected: is divisible by 7\n Actual: 27 (the remainder is 6)\n```\n\nYou should let `MatchAndExplain()` print *any additional information* that can\nhelp a user understand the match result. Note that it should explain why the\nmatch succeeds in case of a success (unless it's obvious) - this is useful when\nthe matcher is used inside `Not()`. There is no need to print the argument value\nitself, as gMock already prints it for you.\n\n{: .callout .note}\nNOTE: The type of the value being matched (`arg_type`) is determined by the\ncontext in which you use the matcher and is supplied to you by the compiler, so\nyou don't need to worry about declaring it (nor can you). This allows the\nmatcher to be polymorphic. For example, `IsDivisibleBy7()` can be used to match\nany type where the value of `(arg % 7) == 0` can be implicitly converted to a\n`bool`. In the `Bar(IsDivisibleBy7())` example above, if method `Bar()` takes an\n`int`, `arg_type` will be `int`; if it takes an `unsigned long`, `arg_type` will\nbe `unsigned long`; and so on.\n\n### Writing New Parameterized Matchers Quickly\n\nSometimes you'll want to define a matcher that has parameters. For that you can\nuse the macro:\n\n```cpp\nMATCHER_P(name, param_name, description_string) { statements; }\n```\n\nwhere the description string can be either `\"\"` or a `string` expression that\nreferences `negation` and `param_name`.\n\nFor example:\n\n```cpp\nMATCHER_P(HasAbsoluteValue, value, \"\") { return abs(arg) == value; }\n```\n\nwill allow you to write:\n\n```cpp\n EXPECT_THAT(Blah(\"a\"), HasAbsoluteValue(n));\n```\n\nwhich may lead to this message (assuming `n` is 10):\n\n```shell\n Value of: Blah(\"a\")\n Expected: has absolute value 10\n Actual: -9\n```\n\nNote that both the matcher description and its parameter are printed, making the\nmessage human-friendly.\n\nIn the matcher definition body, you can write `foo_type` to reference the type\nof a parameter named `foo`. For example, in the body of\n`MATCHER_P(HasAbsoluteValue, value)` above, you can write `value_type` to refer\nto the type of `value`.\n\ngMock also provides `MATCHER_P2`, `MATCHER_P3`, ..., up to `MATCHER_P10` to\nsupport multi-parameter matchers:\n\n```cpp\nMATCHER_Pk(name, param_1, ..., param_k, description_string) { statements; }\n```\n\nPlease note that the custom description string is for a particular *instance* of\nthe matcher, where the parameters have been bound to actual values. Therefore\nusually you'll want the parameter values to be part of the description. gMock\nlets you do that by referencing the matcher parameters in the description string\nexpression.\n\nFor example,\n\n```cpp\nusing ::testing::PrintToString;\nMATCHER_P2(InClosedRange, low, hi,\n absl::StrFormat(\"%s in range [%s, %s]\", negation ? \"isn't\" : \"is\",\n PrintToString(low), PrintToString(hi))) {\n return low <= arg && arg <= hi;\n}\n...\nEXPECT_THAT(3, InClosedRange(4, 6));\n```\n\nwould generate a failure that contains the message:\n\n```shell\n Expected: is in range [4, 6]\n```\n\nIf you specify `\"\"` as the description, the failure message will contain the\nsequence of words in the matcher name followed by the parameter values printed\nas a tuple. For example,\n\n```cpp\n MATCHER_P2(InClosedRange, low, hi, \"\") { ... }\n ...\n EXPECT_THAT(3, InClosedRange(4, 6));\n```\n\nwould generate a failure that contains the text:\n\n```shell\n Expected: in closed range (4, 6)\n```\n\nFor the purpose of typing, you can view\n\n```cpp\nMATCHER_Pk(Foo, p1, ..., pk, description_string) { ... }\n```\n\nas shorthand for\n\n```cpp\ntemplate \nFooMatcherPk\nFoo(p1_type p1, ..., pk_type pk) { ... }\n```\n\nWhen you write `Foo(v1, ..., vk)`, the compiler infers the types of the\nparameters `v1`, ..., and `vk` for you. If you are not happy with the result of\nthe type inference, you can specify the types by explicitly instantiating the\ntemplate, as in `Foo(5, false)`. As said earlier, you don't get to\n(or need to) specify `arg_type` as that's determined by the context in which the\nmatcher is used.\n\nYou can assign the result of expression `Foo(p1, ..., pk)` to a variable of type\n`FooMatcherPk`. This can be useful when composing\nmatchers. Matchers that don't have a parameter or have only one parameter have\nspecial types: you can assign `Foo()` to a `FooMatcher`-typed variable, and\nassign `Foo(p)` to a `FooMatcherP`-typed variable.\n\nWhile you can instantiate a matcher template with reference types, passing the\nparameters by pointer usually makes your code more readable. If, however, you\nstill want to pass a parameter by reference, be aware that in the failure\nmessage generated by the matcher you will see the value of the referenced object\nbut not its address.\n\nYou can overload matchers with different numbers of parameters:\n\n```cpp\nMATCHER_P(Blah, a, description_string_1) { ... }\nMATCHER_P2(Blah, a, b, description_string_2) { ... }\n```\n\nWhile it's tempting to always use the `MATCHER*` macros when defining a new\nmatcher, you should also consider implementing the matcher interface directly\ninstead (see the recipes that follow), especially if you need to use the matcher\na lot. While these approaches require more work, they give you more control on\nthe types of the value being matched and the matcher parameters, which in\ngeneral leads to better compiler error messages that pay off in the long run.\nThey also allow overloading matchers based on parameter types (as opposed to\njust based on the number of parameters).\n\n### Writing New Monomorphic Matchers\n\nA matcher of argument type `T` implements the matcher interface for `T` and does\ntwo things: it tests whether a value of type `T` matches the matcher, and can\ndescribe what kind of values it matches. The latter ability is used for\ngenerating readable error messages when expectations are violated.\n\nA matcher of `T` must declare a typedef like:\n\n```cpp\nusing is_gtest_matcher = void;\n```\n\nand supports the following operations:\n\n```cpp\n// Match a value and optionally explain into an ostream.\nbool matched = matcher.MatchAndExplain(value, maybe_os);\n// where `value` is of type `T` and\n// `maybe_os` is of type `std::ostream*`, where it can be null if the caller\n// is not interested in there textual explanation.\n\nmatcher.DescribeTo(os);\nmatcher.DescribeNegationTo(os);\n// where `os` is of type `std::ostream*`.\n```\n\nIf you need a custom matcher but `Truly()` is not a good option (for example,\nyou may not be happy with the way `Truly(predicate)` describes itself, or you\nmay want your matcher to be polymorphic as `Eq(value)` is), you can define a\nmatcher to do whatever you want in two steps: first implement the matcher\ninterface, and then define a factory function to create a matcher instance. The\nsecond step is not strictly needed but it makes the syntax of using the matcher\nnicer.\n\nFor example, you can define a matcher to test whether an `int` is divisible by 7\nand then use it like this:\n\n```cpp\nusing ::testing::Matcher;\n\nclass DivisibleBy7Matcher {\n public:\n using is_gtest_matcher = void;\n\n bool MatchAndExplain(int n, std::ostream*) const {\n return (n % 7) == 0;\n }\n\n void DescribeTo(std::ostream* os) const {\n *os << \"is divisible by 7\";\n }\n\n void DescribeNegationTo(std::ostream* os) const {\n *os << \"is not divisible by 7\";\n }\n};\n\nMatcher DivisibleBy7() {\n return DivisibleBy7Matcher();\n}\n\n...\n EXPECT_CALL(foo, Bar(DivisibleBy7()));\n```\n\nYou may improve the matcher message by streaming additional information to the\n`os` argument in `MatchAndExplain()`:\n\n```cpp\nclass DivisibleBy7Matcher {\n public:\n bool MatchAndExplain(int n, std::ostream* os) const {\n const int remainder = n % 7;\n if (remainder != 0 && os != nullptr) {\n *os << \"the remainder is \" << remainder;\n }\n return remainder == 0;\n }\n ...\n};\n```\n\nThen, `EXPECT_THAT(x, DivisibleBy7());` may generate a message like this:\n\n```shell\nValue of: x\nExpected: is divisible by 7\n Actual: 23 (the remainder is 2)\n```\n\n{: .callout .tip}\nTip: for convenience, `MatchAndExplain()` can take a `MatchResultListener*`\ninstead of `std::ostream*`.\n\n### Writing New Polymorphic Matchers\n\nExpanding what we learned above to *polymorphic* matchers is now just as simple\nas adding templates in the right place.\n\n```cpp\n\nclass NotNullMatcher {\n public:\n using is_gtest_matcher = void;\n\n // To implement a polymorphic matcher, we just need to make MatchAndExplain a\n // template on its first argument.\n\n // In this example, we want to use NotNull() with any pointer, so\n // MatchAndExplain() accepts a pointer of any type as its first argument.\n // In general, you can define MatchAndExplain() as an ordinary method or\n // a method template, or even overload it.\n template \n bool MatchAndExplain(T* p, std::ostream*) const {\n return p != nullptr;\n }\n\n // Describes the property of a value matching this matcher.\n void DescribeTo(std::ostream* os) const { *os << \"is not NULL\"; }\n\n // Describes the property of a value NOT matching this matcher.\n void DescribeNegationTo(std::ostream* os) const { *os << \"is NULL\"; }\n};\n\nNotNullMatcher NotNull() {\n return NotNullMatcher();\n}\n\n...\n\n EXPECT_CALL(foo, Bar(NotNull())); // The argument must be a non-NULL pointer.\n```\n\n### Legacy Matcher Implementation\n\nDefining matchers used to be somewhat more complicated, in which it required\nseveral supporting classes and virtual functions. To implement a matcher for\ntype `T` using the legacy API you have to derive from `MatcherInterface` and\ncall `MakeMatcher` to construct the object.\n\nThe interface looks like this:\n\n```cpp\nclass MatchResultListener {\n public:\n ...\n // Streams x to the underlying ostream; does nothing if the ostream\n // is NULL.\n template \n MatchResultListener& operator<<(const T& x);\n\n // Returns the underlying ostream.\n std::ostream* stream();\n};\n\ntemplate \nclass MatcherInterface {\n public:\n virtual ~MatcherInterface();\n\n // Returns true if and only if the matcher matches x; also explains the match\n // result to 'listener'.\n virtual bool MatchAndExplain(T x, MatchResultListener* listener) const = 0;\n\n // Describes this matcher to an ostream.\n virtual void DescribeTo(std::ostream* os) const = 0;\n\n // Describes the negation of this matcher to an ostream.\n virtual void DescribeNegationTo(std::ostream* os) const;\n};\n```\n\nFortunately, most of the time you can define a polymorphic matcher easily with\nthe help of `MakePolymorphicMatcher()`. Here's how you can define `NotNull()` as\nan example:\n\n```cpp\nusing ::testing::MakePolymorphicMatcher;\nusing ::testing::MatchResultListener;\nusing ::testing::PolymorphicMatcher;\n\nclass NotNullMatcher {\n public:\n // To implement a polymorphic matcher, first define a COPYABLE class\n // that has three members MatchAndExplain(), DescribeTo(), and\n // DescribeNegationTo(), like the following.\n\n // In this example, we want to use NotNull() with any pointer, so\n // MatchAndExplain() accepts a pointer of any type as its first argument.\n // In general, you can define MatchAndExplain() as an ordinary method or\n // a method template, or even overload it.\n template \n bool MatchAndExplain(T* p,\n MatchResultListener* /* listener */) const {\n return p != NULL;\n }\n\n // Describes the property of a value matching this matcher.\n void DescribeTo(std::ostream* os) const { *os << \"is not NULL\"; }\n\n // Describes the property of a value NOT matching this matcher.\n void DescribeNegationTo(std::ostream* os) const { *os << \"is NULL\"; }\n};\n\n// To construct a polymorphic matcher, pass an instance of the class\n// to MakePolymorphicMatcher(). Note the return type.\nPolymorphicMatcher NotNull() {\n return MakePolymorphicMatcher(NotNullMatcher());\n}\n\n...\n\n EXPECT_CALL(foo, Bar(NotNull())); // The argument must be a non-NULL pointer.\n```\n\n{: .callout .note}\n**Note:** Your polymorphic matcher class does **not** need to inherit from\n`MatcherInterface` or any other class, and its methods do **not** need to be\nvirtual.\n\nLike in a monomorphic matcher, you may explain the match result by streaming\nadditional information to the `listener` argument in `MatchAndExplain()`.\n\n### Writing New Cardinalities\n\nA cardinality is used in `Times()` to tell gMock how many times you expect a\ncall to occur. It doesn't have to be exact. For example, you can say\n`AtLeast(5)` or `Between(2, 4)`.\n\nIf the [built-in set](gmock_cheat_sheet.md#CardinalityList) of cardinalities\ndoesn't suit you, you are free to define your own by implementing the following\ninterface (in namespace `testing`):\n\n```cpp\nclass CardinalityInterface {\n public:\n virtual ~CardinalityInterface();\n\n // Returns true if and only if call_count calls will satisfy this cardinality.\n virtual bool IsSatisfiedByCallCount(int call_count) const = 0;\n\n // Returns true if and only if call_count calls will saturate this\n // cardinality.\n virtual bool IsSaturatedByCallCount(int call_count) const = 0;\n\n // Describes self to an ostream.\n virtual void DescribeTo(std::ostream* os) const = 0;\n};\n```\n\nFor example, to specify that a call must occur even number of times, you can\nwrite\n\n```cpp\nusing ::testing::Cardinality;\nusing ::testing::CardinalityInterface;\nusing ::testing::MakeCardinality;\n\nclass EvenNumberCardinality : public CardinalityInterface {\n public:\n bool IsSatisfiedByCallCount(int call_count) const override {\n return (call_count % 2) == 0;\n }\n\n bool IsSaturatedByCallCount(int call_count) const override {\n return false;\n }\n\n void DescribeTo(std::ostream* os) const {\n *os << \"called even number of times\";\n }\n};\n\nCardinality EvenNumber() {\n return MakeCardinality(new EvenNumberCardinality);\n}\n\n...\n EXPECT_CALL(foo, Bar(3))\n .Times(EvenNumber());\n```\n\n### Writing New Actions {#QuickNewActions}\n\nIf the built-in actions don't work for you, you can easily define your own one.\nAll you need is a call operator with a signature compatible with the mocked\nfunction. So you can use a lambda:\n\n```\nMockFunction mock;\nEXPECT_CALL(mock, Call).WillOnce([](const int input) { return input * 7; });\nEXPECT_EQ(14, mock.AsStdFunction()(2));\n```\n\nOr a struct with a call operator (even a templated one):\n\n```\nstruct MultiplyBy {\n template \n T operator()(T arg) { return arg * multiplier; }\n\n int multiplier;\n};\n\n// Then use:\n// EXPECT_CALL(...).WillOnce(MultiplyBy{7});\n```\n\nIt's also fine for the callable to take no arguments, ignoring the arguments\nsupplied to the mock function:\n\n```\nMockFunction mock;\nEXPECT_CALL(mock, Call).WillOnce([] { return 17; });\nEXPECT_EQ(17, mock.AsStdFunction()(0));\n```\n\nWhen used with `WillOnce`, the callable can assume it will be called at most\nonce and is allowed to be a move-only type:\n\n```\n// An action that contains move-only types and has an &&-qualified operator,\n// demanding in the type system that it be called at most once. This can be\n// used with WillOnce, but the compiler will reject it if handed to\n// WillRepeatedly.\nstruct MoveOnlyAction {\n std::unique_ptr move_only_state;\n std::unique_ptr operator()() && { return std::move(move_only_state); }\n};\n\nMockFunction()> mock;\nEXPECT_CALL(mock, Call).WillOnce(MoveOnlyAction{std::make_unique(17)});\nEXPECT_THAT(mock.AsStdFunction()(), Pointee(Eq(17)));\n```\n\nMore generally, to use with a mock function whose signature is `R(Args...)` the\nobject can be anything convertible to `OnceAction` or\n`Action. The difference between the two is that `OnceAction` has\nweaker requirements (`Action` requires a copy-constructible input that can be\ncalled repeatedly whereas `OnceAction` requires only move-constructible and\nsupports `&&`-qualified call operators), but can be used only with `WillOnce`.\n`OnceAction` is typically relevant only when supporting move-only types or\nactions that want a type-system guarantee that they will be called at most once.\n\nTypically the `OnceAction` and `Action` templates need not be referenced\ndirectly in your actions: a struct or class with a call operator is sufficient,\nas in the examples above. But fancier polymorphic actions that need to know the\nspecific return type of the mock function can define templated conversion\noperators to make that possible. See `gmock-actions.h` for examples.\n\n#### Legacy macro-based Actions\n\nBefore C++11, the functor-based actions were not supported; the old way of\nwriting actions was through a set of `ACTION*` macros. We suggest to avoid them\nin new code; they hide a lot of logic behind the macro, potentially leading to\nharder-to-understand compiler errors. Nevertheless, we cover them here for\ncompleteness.\n\nBy writing\n\n```cpp\nACTION(name) { statements; }\n```\n\nin a namespace scope (i.e. not inside a class or function), you will define an\naction with the given name that executes the statements. The value returned by\n`statements` will be used as the return value of the action. Inside the\nstatements, you can refer to the K-th (0-based) argument of the mock function as\n`argK`. For example:\n\n```cpp\nACTION(IncrementArg1) { return ++(*arg1); }\n```\n\nallows you to write\n\n```cpp\n... WillOnce(IncrementArg1());\n```\n\nNote that you don't need to specify the types of the mock function arguments.\nRest assured that your code is type-safe though: you'll get a compiler error if\n`*arg1` doesn't support the `++` operator, or if the type of `++(*arg1)` isn't\ncompatible with the mock function's return type.\n\nAnother example:\n\n```cpp\nACTION(Foo) {\n (*arg2)(5);\n Blah();\n *arg1 = 0;\n return arg0;\n}\n```\n\ndefines an action `Foo()` that invokes argument #2 (a function pointer) with 5,\ncalls function `Blah()`, sets the value pointed to by argument #1 to 0, and\nreturns argument #0.\n\nFor more convenience and flexibility, you can also use the following pre-defined\nsymbols in the body of `ACTION`:\n\n`argK_type` | The type of the K-th (0-based) argument of the mock function\n:-------------- | :-----------------------------------------------------------\n`args` | All arguments of the mock function as a tuple\n`args_type` | The type of all arguments of the mock function as a tuple\n`return_type` | The return type of the mock function\n`function_type` | The type of the mock function\n\nFor example, when using an `ACTION` as a stub action for mock function:\n\n```cpp\nint DoSomething(bool flag, int* ptr);\n```\n\nwe have:\n\nPre-defined Symbol | Is Bound To\n------------------ | ---------------------------------\n`arg0` | the value of `flag`\n`arg0_type` | the type `bool`\n`arg1` | the value of `ptr`\n`arg1_type` | the type `int*`\n`args` | the tuple `(flag, ptr)`\n`args_type` | the type `std::tuple`\n`return_type` | the type `int`\n`function_type` | the type `int(bool, int*)`\n\n#### Legacy macro-based parameterized Actions\n\nSometimes you'll want to parameterize an action you define. For that we have\nanother macro\n\n```cpp\nACTION_P(name, param) { statements; }\n```\n\nFor example,\n\n```cpp\nACTION_P(Add, n) { return arg0 + n; }\n```\n\nwill allow you to write\n\n```cpp\n// Returns argument #0 + 5.\n... WillOnce(Add(5));\n```\n\nFor convenience, we use the term *arguments* for the values used to invoke the\nmock function, and the term *parameters* for the values used to instantiate an\naction.\n\nNote that you don't need to provide the type of the parameter either. Suppose\nthe parameter is named `param`, you can also use the gMock-defined symbol\n`param_type` to refer to the type of the parameter as inferred by the compiler.\nFor example, in the body of `ACTION_P(Add, n)` above, you can write `n_type` for\nthe type of `n`.\n\ngMock also provides `ACTION_P2`, `ACTION_P3`, and etc to support multi-parameter\nactions. For example,\n\n```cpp\nACTION_P2(ReturnDistanceTo, x, y) {\n double dx = arg0 - x;\n double dy = arg1 - y;\n return sqrt(dx*dx + dy*dy);\n}\n```\n\nlets you write\n\n```cpp\n... WillOnce(ReturnDistanceTo(5.0, 26.5));\n```\n\nYou can view `ACTION` as a degenerated parameterized action where the number of\nparameters is 0.\n\nYou can also easily define actions overloaded on the number of parameters:\n\n```cpp\nACTION_P(Plus, a) { ... }\nACTION_P2(Plus, a, b) { ... }\n```\n\n### Restricting the Type of an Argument or Parameter in an ACTION\n\nFor maximum brevity and reusability, the `ACTION*` macros don't ask you to\nprovide the types of the mock function arguments and the action parameters.\nInstead, we let the compiler infer the types for us.\n\nSometimes, however, we may want to be more explicit about the types. There are\nseveral tricks to do that. For example:\n\n```cpp\nACTION(Foo) {\n // Makes sure arg0 can be converted to int.\n int n = arg0;\n ... use n instead of arg0 here ...\n}\n\nACTION_P(Bar, param) {\n // Makes sure the type of arg1 is const char*.\n ::testing::StaticAssertTypeEq();\n\n // Makes sure param can be converted to bool.\n bool flag = param;\n}\n```\n\nwhere `StaticAssertTypeEq` is a compile-time assertion in googletest that\nverifies two types are the same.\n\n### Writing New Action Templates Quickly\n\nSometimes you want to give an action explicit template parameters that cannot be\ninferred from its value parameters. `ACTION_TEMPLATE()` supports that and can be\nviewed as an extension to `ACTION()` and `ACTION_P*()`.\n\nThe syntax:\n\n```cpp\nACTION_TEMPLATE(ActionName,\n HAS_m_TEMPLATE_PARAMS(kind1, name1, ..., kind_m, name_m),\n AND_n_VALUE_PARAMS(p1, ..., p_n)) { statements; }\n```\n\ndefines an action template that takes *m* explicit template parameters and *n*\nvalue parameters, where *m* is in [1, 10] and *n* is in [0, 10]. `name_i` is the\nname of the *i*-th template parameter, and `kind_i` specifies whether it's a\n`typename`, an integral constant, or a template. `p_i` is the name of the *i*-th\nvalue parameter.\n\nExample:\n\n```cpp\n// DuplicateArg(output) converts the k-th argument of the mock\n// function to type T and copies it to *output.\nACTION_TEMPLATE(DuplicateArg,\n // Note the comma between int and k:\n HAS_2_TEMPLATE_PARAMS(int, k, typename, T),\n AND_1_VALUE_PARAMS(output)) {\n *output = T(std::get(args));\n}\n```\n\nTo create an instance of an action template, write:\n\n```cpp\nActionName(v1, ..., v_n)\n```\n\nwhere the `t`s are the template arguments and the `v`s are the value arguments.\nThe value argument types are inferred by the compiler. For example:\n\n```cpp\nusing ::testing::_;\n...\n int n;\n EXPECT_CALL(mock, Foo).WillOnce(DuplicateArg<1, unsigned char>(&n));\n```\n\nIf you want to explicitly specify the value argument types, you can provide\nadditional template arguments:\n\n```cpp\nActionName(v1, ..., v_n)\n```\n\nwhere `u_i` is the desired type of `v_i`.\n\n`ACTION_TEMPLATE` and `ACTION`/`ACTION_P*` can be overloaded on the number of\nvalue parameters, but not on the number of template parameters. Without the\nrestriction, the meaning of the following is unclear:\n\n```cpp\n OverloadedAction(x);\n```\n\nAre we using a single-template-parameter action where `bool` refers to the type\nof `x`, or a two-template-parameter action where the compiler is asked to infer\nthe type of `x`?\n\n### Using the ACTION Object's Type\n\nIf you are writing a function that returns an `ACTION` object, you'll need to\nknow its type. The type depends on the macro used to define the action and the\nparameter types. The rule is relatively simple:\n\n\n| Given Definition | Expression | Has Type |\n| ----------------------------- | ------------------- | --------------------- |\n| `ACTION(Foo)` | `Foo()` | `FooAction` |\n| `ACTION_TEMPLATE(Foo, HAS_m_TEMPLATE_PARAMS(...), AND_0_VALUE_PARAMS())` | `Foo()` | `FooAction` |\n| `ACTION_P(Bar, param)` | `Bar(int_value)` | `BarActionP` |\n| `ACTION_TEMPLATE(Bar, HAS_m_TEMPLATE_PARAMS(...), AND_1_VALUE_PARAMS(p1))` | `Bar(int_value)` | `BarActionP` |\n| `ACTION_P2(Baz, p1, p2)` | `Baz(bool_value, int_value)` | `BazActionP2` |\n| `ACTION_TEMPLATE(Baz, HAS_m_TEMPLATE_PARAMS(...), AND_2_VALUE_PARAMS(p1, p2))` | `Baz(bool_value, int_value)` | `BazActionP2` |\n| ... | ... | ... |\n\n\nNote that we have to pick different suffixes (`Action`, `ActionP`, `ActionP2`,\nand etc) for actions with different numbers of value parameters, or the action\ndefinitions cannot be overloaded on the number of them.\n\n### Writing New Monomorphic Actions {#NewMonoActions}\n\nWhile the `ACTION*` macros are very convenient, sometimes they are\ninappropriate. For example, despite the tricks shown in the previous recipes,\nthey don't let you directly specify the types of the mock function arguments and\nthe action parameters, which in general leads to unoptimized compiler error\nmessages that can baffle unfamiliar users. They also don't allow overloading\nactions based on parameter types without jumping through some hoops.\n\nAn alternative to the `ACTION*` macros is to implement\n`::testing::ActionInterface`, where `F` is the type of the mock function in\nwhich the action will be used. For example:\n\n```cpp\ntemplate \nclass ActionInterface {\n public:\n virtual ~ActionInterface();\n\n // Performs the action. Result is the return type of function type\n // F, and ArgumentTuple is the tuple of arguments of F.\n //\n\n // For example, if F is int(bool, const string&), then Result would\n // be int, and ArgumentTuple would be std::tuple.\n virtual Result Perform(const ArgumentTuple& args) = 0;\n};\n```\n\n```cpp\nusing ::testing::_;\nusing ::testing::Action;\nusing ::testing::ActionInterface;\nusing ::testing::MakeAction;\n\ntypedef int IncrementMethod(int*);\n\nclass IncrementArgumentAction : public ActionInterface {\n public:\n int Perform(const std::tuple& args) override {\n int* p = std::get<0>(args); // Grabs the first argument.\n return *p++;\n }\n};\n\nAction IncrementArgument() {\n return MakeAction(new IncrementArgumentAction);\n}\n\n...\n EXPECT_CALL(foo, Baz(_))\n .WillOnce(IncrementArgument());\n\n int n = 5;\n foo.Baz(&n); // Should return 5 and change n to 6.\n```\n\n### Writing New Polymorphic Actions {#NewPolyActions}\n\nThe previous recipe showed you how to define your own action. This is all good,\nexcept that you need to know the type of the function in which the action will\nbe used. Sometimes that can be a problem. For example, if you want to use the\naction in functions with *different* types (e.g. like `Return()` and\n`SetArgPointee()`).\n\nIf an action can be used in several types of mock functions, we say it's\n*polymorphic*. The `MakePolymorphicAction()` function template makes it easy to\ndefine such an action:\n\n```cpp\nnamespace testing {\ntemplate \nPolymorphicAction MakePolymorphicAction(const Impl& impl);\n} // namespace testing\n```\n\nAs an example, let's define an action that returns the second argument in the\nmock function's argument list. The first step is to define an implementation\nclass:\n\n```cpp\nclass ReturnSecondArgumentAction {\n public:\n template \n Result Perform(const ArgumentTuple& args) const {\n // To get the i-th (0-based) argument, use std::get(args).\n return std::get<1>(args);\n }\n};\n```\n\nThis implementation class does *not* need to inherit from any particular class.\nWhat matters is that it must have a `Perform()` method template. This method\ntemplate takes the mock function's arguments as a tuple in a **single**\nargument, and returns the result of the action. It can be either `const` or not,\nbut must be invocable with exactly one template argument, which is the result\ntype. In other words, you must be able to call `Perform(args)` where `R` is\nthe mock function's return type and `args` is its arguments in a tuple.\n\nNext, we use `MakePolymorphicAction()` to turn an instance of the implementation\nclass into the polymorphic action we need. It will be convenient to have a\nwrapper for this:\n\n```cpp\nusing ::testing::MakePolymorphicAction;\nusing ::testing::PolymorphicAction;\n\nPolymorphicAction ReturnSecondArgument() {\n return MakePolymorphicAction(ReturnSecondArgumentAction());\n}\n```\n\nNow, you can use this polymorphic action the same way you use the built-in ones:\n\n```cpp\nusing ::testing::_;\n\nclass MockFoo : public Foo {\n public:\n MOCK_METHOD(int, DoThis, (bool flag, int n), (override));\n MOCK_METHOD(string, DoThat, (int x, const char* str1, const char* str2),\n (override));\n};\n\n ...\n MockFoo foo;\n EXPECT_CALL(foo, DoThis).WillOnce(ReturnSecondArgument());\n EXPECT_CALL(foo, DoThat).WillOnce(ReturnSecondArgument());\n ...\n foo.DoThis(true, 5); // Will return 5.\n foo.DoThat(1, \"Hi\", \"Bye\"); // Will return \"Hi\".\n```\n\n### Teaching gMock How to Print Your Values\n\nWhen an uninteresting or unexpected call occurs, gMock prints the argument\nvalues and the stack trace to help you debug. Assertion macros like\n`EXPECT_THAT` and `EXPECT_EQ` also print the values in question when the\nassertion fails. gMock and googletest do this using googletest's user-extensible\nvalue printer.\n\nThis printer knows how to print built-in C++ types, native arrays, STL\ncontainers, and any type that supports the `<<` operator. For other types, it\nprints the raw bytes in the value and hopes that you the user can figure it out.\n[The GoogleTest advanced guide](advanced.md#teaching-googletest-how-to-print-your-values)\nexplains how to extend the printer to do a better job at printing your\nparticular type than to dump the bytes.\n\n## Useful Mocks Created Using gMock\n\n\n\n\n### Mock std::function {#MockFunction}\n\n`std::function` is a general function type introduced in C++11. It is a\npreferred way of passing callbacks to new interfaces. Functions are copiable,\nand are not usually passed around by pointer, which makes them tricky to mock.\nBut fear not - `MockFunction` can help you with that.\n\n`MockFunction` has a mock method `Call()` with the signature:\n\n```cpp\n R Call(T1, ..., Tn);\n```\n\nIt also has a `AsStdFunction()` method, which creates a `std::function` proxy\nforwarding to Call:\n\n```cpp\n std::function AsStdFunction();\n```\n\nTo use `MockFunction`, first create `MockFunction` object and set up\nexpectations on its `Call` method. Then pass proxy obtained from\n`AsStdFunction()` to the code you are testing. For example:\n\n```cpp\nTEST(FooTest, RunsCallbackWithBarArgument) {\n // 1. Create a mock object.\n MockFunction mock_function;\n\n // 2. Set expectations on Call() method.\n EXPECT_CALL(mock_function, Call(\"bar\")).WillOnce(Return(1));\n\n // 3. Exercise code that uses std::function.\n Foo(mock_function.AsStdFunction());\n // Foo's signature can be either of:\n // void Foo(const std::function& fun);\n // void Foo(std::function fun);\n\n // 4. All expectations will be verified when mock_function\n // goes out of scope and is destroyed.\n}\n```\n\nRemember that function objects created with `AsStdFunction()` are just\nforwarders. If you create multiple of them, they will share the same set of\nexpectations.\n\nAlthough `std::function` supports unlimited number of arguments, `MockFunction`\nimplementation is limited to ten. If you ever hit that limit... well, your\ncallback has bigger problems than being mockable. :-)\n" }, { "path": "3rd/googletest-1.12.1/docs/gmock_faq.md", "content": "# Legacy gMock FAQ\n\n### When I call a method on my mock object, the method for the real object is invoked instead. What's the problem?\n\nIn order for a method to be mocked, it must be *virtual*, unless you use the\n[high-perf dependency injection technique](gmock_cook_book.md#MockingNonVirtualMethods).\n\n### Can I mock a variadic function?\n\nYou cannot mock a variadic function (i.e. a function taking ellipsis (`...`)\narguments) directly in gMock.\n\nThe problem is that in general, there is *no way* for a mock object to know how\nmany arguments are passed to the variadic method, and what the arguments' types\nare. Only the *author of the base class* knows the protocol, and we cannot look\ninto his or her head.\n\nTherefore, to mock such a function, the *user* must teach the mock object how to\nfigure out the number of arguments and their types. One way to do it is to\nprovide overloaded versions of the function.\n\nEllipsis arguments are inherited from C and not really a C++ feature. They are\nunsafe to use and don't work with arguments that have constructors or\ndestructors. Therefore we recommend to avoid them in C++ as much as possible.\n\n### MSVC gives me warning C4301 or C4373 when I define a mock method with a const parameter. Why?\n\nIf you compile this using Microsoft Visual C++ 2005 SP1:\n\n```cpp\nclass Foo {\n ...\n virtual void Bar(const int i) = 0;\n};\n\nclass MockFoo : public Foo {\n ...\n MOCK_METHOD(void, Bar, (const int i), (override));\n};\n```\n\nYou may get the following warning:\n\n```shell\nwarning C4301: 'MockFoo::Bar': overriding virtual function only differs from 'Foo::Bar' by const/volatile qualifier\n```\n\nThis is a MSVC bug. The same code compiles fine with gcc, for example. If you\nuse Visual C++ 2008 SP1, you would get the warning:\n\n```shell\nwarning C4373: 'MockFoo::Bar': virtual function overrides 'Foo::Bar', previous versions of the compiler did not override when parameters only differed by const/volatile qualifiers\n```\n\nIn C++, if you *declare* a function with a `const` parameter, the `const`\nmodifier is ignored. Therefore, the `Foo` base class above is equivalent to:\n\n```cpp\nclass Foo {\n ...\n virtual void Bar(int i) = 0; // int or const int? Makes no difference.\n};\n```\n\nIn fact, you can *declare* `Bar()` with an `int` parameter, and define it with a\n`const int` parameter. The compiler will still match them up.\n\nSince making a parameter `const` is meaningless in the method declaration, we\nrecommend to remove it in both `Foo` and `MockFoo`. That should workaround the\nVC bug.\n\nNote that we are talking about the *top-level* `const` modifier here. If the\nfunction parameter is passed by pointer or reference, declaring the pointee or\nreferee as `const` is still meaningful. For example, the following two\ndeclarations are *not* equivalent:\n\n```cpp\nvoid Bar(int* p); // Neither p nor *p is const.\nvoid Bar(const int* p); // p is not const, but *p is.\n```\n\n### I can't figure out why gMock thinks my expectations are not satisfied. What should I do?\n\nYou might want to run your test with `--gmock_verbose=info`. This flag lets\ngMock print a trace of every mock function call it receives. By studying the\ntrace, you'll gain insights on why the expectations you set are not met.\n\nIf you see the message \"The mock function has no default action set, and its\nreturn type has no default value set.\", then try\n[adding a default action](gmock_cheat_sheet.md#OnCall). Due to a known issue,\nunexpected calls on mocks without default actions don't print out a detailed\ncomparison between the actual arguments and the expected arguments.\n\n### My program crashed and `ScopedMockLog` spit out tons of messages. Is it a gMock bug?\n\ngMock and `ScopedMockLog` are likely doing the right thing here.\n\nWhen a test crashes, the failure signal handler will try to log a lot of\ninformation (the stack trace, and the address map, for example). The messages\nare compounded if you have many threads with depth stacks. When `ScopedMockLog`\nintercepts these messages and finds that they don't match any expectations, it\nprints an error for each of them.\n\nYou can learn to ignore the errors, or you can rewrite your expectations to make\nyour test more robust, for example, by adding something like:\n\n```cpp\nusing ::testing::AnyNumber;\nusing ::testing::Not;\n...\n // Ignores any log not done by us.\n EXPECT_CALL(log, Log(_, Not(EndsWith(\"/my_file.cc\")), _))\n .Times(AnyNumber());\n```\n\n### How can I assert that a function is NEVER called?\n\n```cpp\nusing ::testing::_;\n...\n EXPECT_CALL(foo, Bar(_))\n .Times(0);\n```\n\n### I have a failed test where gMock tells me TWICE that a particular expectation is not satisfied. Isn't this redundant?\n\nWhen gMock detects a failure, it prints relevant information (the mock function\narguments, the state of relevant expectations, and etc) to help the user debug.\nIf another failure is detected, gMock will do the same, including printing the\nstate of relevant expectations.\n\nSometimes an expectation's state didn't change between two failures, and you'll\nsee the same description of the state twice. They are however *not* redundant,\nas they refer to *different points in time*. The fact they are the same *is*\ninteresting information.\n\n### I get a heapcheck failure when using a mock object, but using a real object is fine. What can be wrong?\n\nDoes the class (hopefully a pure interface) you are mocking have a virtual\ndestructor?\n\nWhenever you derive from a base class, make sure its destructor is virtual.\nOtherwise Bad Things will happen. Consider the following code:\n\n```cpp\nclass Base {\n public:\n // Not virtual, but should be.\n ~Base() { ... }\n ...\n};\n\nclass Derived : public Base {\n public:\n ...\n private:\n std::string value_;\n};\n\n...\n Base* p = new Derived;\n ...\n delete p; // Surprise! ~Base() will be called, but ~Derived() will not\n // - value_ is leaked.\n```\n\nBy changing `~Base()` to virtual, `~Derived()` will be correctly called when\n`delete p` is executed, and the heap checker will be happy.\n\n### The \"newer expectations override older ones\" rule makes writing expectations awkward. Why does gMock do that?\n\nWhen people complain about this, often they are referring to code like:\n\n```cpp\nusing ::testing::Return;\n...\n // foo.Bar() should be called twice, return 1 the first time, and return\n // 2 the second time. However, I have to write the expectations in the\n // reverse order. This sucks big time!!!\n EXPECT_CALL(foo, Bar())\n .WillOnce(Return(2))\n .RetiresOnSaturation();\n EXPECT_CALL(foo, Bar())\n .WillOnce(Return(1))\n .RetiresOnSaturation();\n```\n\nThe problem, is that they didn't pick the **best** way to express the test's\nintent.\n\nBy default, expectations don't have to be matched in *any* particular order. If\nyou want them to match in a certain order, you need to be explicit. This is\ngMock's (and jMock's) fundamental philosophy: it's easy to accidentally\nover-specify your tests, and we want to make it harder to do so.\n\nThere are two better ways to write the test spec. You could either put the\nexpectations in sequence:\n\n```cpp\nusing ::testing::Return;\n...\n // foo.Bar() should be called twice, return 1 the first time, and return\n // 2 the second time. Using a sequence, we can write the expectations\n // in their natural order.\n {\n InSequence s;\n EXPECT_CALL(foo, Bar())\n .WillOnce(Return(1))\n .RetiresOnSaturation();\n EXPECT_CALL(foo, Bar())\n .WillOnce(Return(2))\n .RetiresOnSaturation();\n }\n```\n\nor you can put the sequence of actions in the same expectation:\n\n```cpp\nusing ::testing::Return;\n...\n // foo.Bar() should be called twice, return 1 the first time, and return\n // 2 the second time.\n EXPECT_CALL(foo, Bar())\n .WillOnce(Return(1))\n .WillOnce(Return(2))\n .RetiresOnSaturation();\n```\n\nBack to the original questions: why does gMock search the expectations (and\n`ON_CALL`s) from back to front? Because this allows a user to set up a mock's\nbehavior for the common case early (e.g. in the mock's constructor or the test\nfixture's set-up phase) and customize it with more specific rules later. If\ngMock searches from front to back, this very useful pattern won't be possible.\n\n### gMock prints a warning when a function without EXPECT_CALL is called, even if I have set its behavior using ON_CALL. Would it be reasonable not to show the warning in this case?\n\nWhen choosing between being neat and being safe, we lean toward the latter. So\nthe answer is that we think it's better to show the warning.\n\nOften people write `ON_CALL`s in the mock object's constructor or `SetUp()`, as\nthe default behavior rarely changes from test to test. Then in the test body\nthey set the expectations, which are often different for each test. Having an\n`ON_CALL` in the set-up part of a test doesn't mean that the calls are expected.\nIf there's no `EXPECT_CALL` and the method is called, it's possibly an error. If\nwe quietly let the call go through without notifying the user, bugs may creep in\nunnoticed.\n\nIf, however, you are sure that the calls are OK, you can write\n\n```cpp\nusing ::testing::_;\n...\n EXPECT_CALL(foo, Bar(_))\n .WillRepeatedly(...);\n```\n\ninstead of\n\n```cpp\nusing ::testing::_;\n...\n ON_CALL(foo, Bar(_))\n .WillByDefault(...);\n```\n\nThis tells gMock that you do expect the calls and no warning should be printed.\n\nAlso, you can control the verbosity by specifying `--gmock_verbose=error`. Other\nvalues are `info` and `warning`. If you find the output too noisy when\ndebugging, just choose a less verbose level.\n\n### How can I delete the mock function's argument in an action?\n\nIf your mock function takes a pointer argument and you want to delete that\nargument, you can use testing::DeleteArg() to delete the N'th (zero-indexed)\nargument:\n\n```cpp\nusing ::testing::_;\n ...\n MOCK_METHOD(void, Bar, (X* x, const Y& y));\n ...\n EXPECT_CALL(mock_foo_, Bar(_, _))\n .WillOnce(testing::DeleteArg<0>()));\n```\n\n### How can I perform an arbitrary action on a mock function's argument?\n\nIf you find yourself needing to perform some action that's not supported by\ngMock directly, remember that you can define your own actions using\n[`MakeAction()`](#NewMonoActions) or\n[`MakePolymorphicAction()`](#NewPolyActions), or you can write a stub function\nand invoke it using [`Invoke()`](#FunctionsAsActions).\n\n```cpp\nusing ::testing::_;\nusing ::testing::Invoke;\n ...\n MOCK_METHOD(void, Bar, (X* p));\n ...\n EXPECT_CALL(mock_foo_, Bar(_))\n .WillOnce(Invoke(MyAction(...)));\n```\n\n### My code calls a static/global function. Can I mock it?\n\nYou can, but you need to make some changes.\n\nIn general, if you find yourself needing to mock a static function, it's a sign\nthat your modules are too tightly coupled (and less flexible, less reusable,\nless testable, etc). You are probably better off defining a small interface and\ncall the function through that interface, which then can be easily mocked. It's\na bit of work initially, but usually pays for itself quickly.\n\nThis Google Testing Blog\n[post](https://testing.googleblog.com/2008/06/defeat-static-cling.html) says it\nexcellently. Check it out.\n\n### My mock object needs to do complex stuff. It's a lot of pain to specify the actions. gMock sucks!\n\nI know it's not a question, but you get an answer for free any way. :-)\n\nWith gMock, you can create mocks in C++ easily. And people might be tempted to\nuse them everywhere. Sometimes they work great, and sometimes you may find them,\nwell, a pain to use. So, what's wrong in the latter case?\n\nWhen you write a test without using mocks, you exercise the code and assert that\nit returns the correct value or that the system is in an expected state. This is\nsometimes called \"state-based testing\".\n\nMocks are great for what some call \"interaction-based\" testing: instead of\nchecking the system state at the very end, mock objects verify that they are\ninvoked the right way and report an error as soon as it arises, giving you a\nhandle on the precise context in which the error was triggered. This is often\nmore effective and economical to do than state-based testing.\n\nIf you are doing state-based testing and using a test double just to simulate\nthe real object, you are probably better off using a fake. Using a mock in this\ncase causes pain, as it's not a strong point for mocks to perform complex\nactions. If you experience this and think that mocks suck, you are just not\nusing the right tool for your problem. Or, you might be trying to solve the\nwrong problem. :-)\n\n### I got a warning \"Uninteresting function call encountered - default action taken..\" Should I panic?\n\nBy all means, NO! It's just an FYI. :-)\n\nWhat it means is that you have a mock function, you haven't set any expectations\non it (by gMock's rule this means that you are not interested in calls to this\nfunction and therefore it can be called any number of times), and it is called.\nThat's OK - you didn't say it's not OK to call the function!\n\nWhat if you actually meant to disallow this function to be called, but forgot to\nwrite `EXPECT_CALL(foo, Bar()).Times(0)`? While one can argue that it's the\nuser's fault, gMock tries to be nice and prints you a note.\n\nSo, when you see the message and believe that there shouldn't be any\nuninteresting calls, you should investigate what's going on. To make your life\neasier, gMock dumps the stack trace when an uninteresting call is encountered.\nFrom that you can figure out which mock function it is, and how it is called.\n\n### I want to define a custom action. Should I use Invoke() or implement the ActionInterface interface?\n\nEither way is fine - you want to choose the one that's more convenient for your\ncircumstance.\n\nUsually, if your action is for a particular function type, defining it using\n`Invoke()` should be easier; if your action can be used in functions of\ndifferent types (e.g. if you are defining `Return(*value*)`),\n`MakePolymorphicAction()` is easiest. Sometimes you want precise control on what\ntypes of functions the action can be used in, and implementing `ActionInterface`\nis the way to go here. See the implementation of `Return()` in `gmock-actions.h`\nfor an example.\n\n### I use SetArgPointee() in WillOnce(), but gcc complains about \"conflicting return type specified\". What does it mean?\n\nYou got this error as gMock has no idea what value it should return when the\nmock method is called. `SetArgPointee()` says what the side effect is, but\ndoesn't say what the return value should be. You need `DoAll()` to chain a\n`SetArgPointee()` with a `Return()` that provides a value appropriate to the API\nbeing mocked.\n\nSee this [recipe](gmock_cook_book.md#mocking-side-effects) for more details and\nan example.\n\n### I have a huge mock class, and Microsoft Visual C++ runs out of memory when compiling it. What can I do?\n\nWe've noticed that when the `/clr` compiler flag is used, Visual C++ uses 5~6\ntimes as much memory when compiling a mock class. We suggest to avoid `/clr`\nwhen compiling native C++ mocks.\n" }, { "path": "3rd/googletest-1.12.1/docs/gmock_for_dummies.md", "content": "# gMock for Dummies\n\n## What Is gMock?\n\nWhen you write a prototype or test, often it's not feasible or wise to rely on\nreal objects entirely. A **mock object** implements the same interface as a real\nobject (so it can be used as one), but lets you specify at run time how it will\nbe used and what it should do (which methods will be called? in which order? how\nmany times? with what arguments? what will they return? etc).\n\nIt is easy to confuse the term *fake objects* with mock objects. Fakes and mocks\nactually mean very different things in the Test-Driven Development (TDD)\ncommunity:\n\n* **Fake** objects have working implementations, but usually take some\n shortcut (perhaps to make the operations less expensive), which makes them\n not suitable for production. An in-memory file system would be an example of\n a fake.\n* **Mocks** are objects pre-programmed with *expectations*, which form a\n specification of the calls they are expected to receive.\n\nIf all this seems too abstract for you, don't worry - the most important thing\nto remember is that a mock allows you to check the *interaction* between itself\nand code that uses it. The difference between fakes and mocks shall become much\nclearer once you start to use mocks.\n\n**gMock** is a library (sometimes we also call it a \"framework\" to make it sound\ncool) for creating mock classes and using them. It does to C++ what\njMock/EasyMock does to Java (well, more or less).\n\nWhen using gMock,\n\n1. first, you use some simple macros to describe the interface you want to\n mock, and they will expand to the implementation of your mock class;\n2. next, you create some mock objects and specify its expectations and behavior\n using an intuitive syntax;\n3. then you exercise code that uses the mock objects. gMock will catch any\n violation to the expectations as soon as it arises.\n\n## Why gMock?\n\nWhile mock objects help you remove unnecessary dependencies in tests and make\nthem fast and reliable, using mocks manually in C++ is *hard*:\n\n* Someone has to implement the mocks. The job is usually tedious and\n error-prone. No wonder people go great distance to avoid it.\n* The quality of those manually written mocks is a bit, uh, unpredictable. You\n may see some really polished ones, but you may also see some that were\n hacked up in a hurry and have all sorts of ad hoc restrictions.\n* The knowledge you gained from using one mock doesn't transfer to the next\n one.\n\nIn contrast, Java and Python programmers have some fine mock frameworks (jMock,\nEasyMock, etc), which automate the creation of mocks. As a result, mocking is a\nproven effective technique and widely adopted practice in those communities.\nHaving the right tool absolutely makes the difference.\n\ngMock was built to help C++ programmers. It was inspired by jMock and EasyMock,\nbut designed with C++'s specifics in mind. It is your friend if any of the\nfollowing problems is bothering you:\n\n* You are stuck with a sub-optimal design and wish you had done more\n prototyping before it was too late, but prototyping in C++ is by no means\n \"rapid\".\n* Your tests are slow as they depend on too many libraries or use expensive\n resources (e.g. a database).\n* Your tests are brittle as some resources they use are unreliable (e.g. the\n network).\n* You want to test how your code handles a failure (e.g. a file checksum\n error), but it's not easy to cause one.\n* You need to make sure that your module interacts with other modules in the\n right way, but it's hard to observe the interaction; therefore you resort to\n observing the side effects at the end of the action, but it's awkward at\n best.\n* You want to \"mock out\" your dependencies, except that they don't have mock\n implementations yet; and, frankly, you aren't thrilled by some of those\n hand-written mocks.\n\nWe encourage you to use gMock as\n\n* a *design* tool, for it lets you experiment with your interface design early\n and often. More iterations lead to better designs!\n* a *testing* tool to cut your tests' outbound dependencies and probe the\n interaction between your module and its collaborators.\n\n## Getting Started\n\ngMock is bundled with googletest.\n\n## A Case for Mock Turtles\n\nLet's look at an example. Suppose you are developing a graphics program that\nrelies on a [LOGO](http://en.wikipedia.org/wiki/Logo_programming_language)-like\nAPI for drawing. How would you test that it does the right thing? Well, you can\nrun it and compare the screen with a golden screen snapshot, but let's admit it:\ntests like this are expensive to run and fragile (What if you just upgraded to a\nshiny new graphics card that has better anti-aliasing? Suddenly you have to\nupdate all your golden images.). It would be too painful if all your tests are\nlike this. Fortunately, you learned about\n[Dependency Injection](http://en.wikipedia.org/wiki/Dependency_injection) and know the right thing\nto do: instead of having your application talk to the system API directly, wrap\nthe API in an interface (say, `Turtle`) and code to that interface:\n\n```cpp\nclass Turtle {\n ...\n virtual ~Turtle() {}\n virtual void PenUp() = 0;\n virtual void PenDown() = 0;\n virtual void Forward(int distance) = 0;\n virtual void Turn(int degrees) = 0;\n virtual void GoTo(int x, int y) = 0;\n virtual int GetX() const = 0;\n virtual int GetY() const = 0;\n};\n```\n\n(Note that the destructor of `Turtle` **must** be virtual, as is the case for\n**all** classes you intend to inherit from - otherwise the destructor of the\nderived class will not be called when you delete an object through a base\npointer, and you'll get corrupted program states like memory leaks.)\n\nYou can control whether the turtle's movement will leave a trace using `PenUp()`\nand `PenDown()`, and control its movement using `Forward()`, `Turn()`, and\n`GoTo()`. Finally, `GetX()` and `GetY()` tell you the current position of the\nturtle.\n\nYour program will normally use a real implementation of this interface. In\ntests, you can use a mock implementation instead. This allows you to easily\ncheck what drawing primitives your program is calling, with what arguments, and\nin which order. Tests written this way are much more robust (they won't break\nbecause your new machine does anti-aliasing differently), easier to read and\nmaintain (the intent of a test is expressed in the code, not in some binary\nimages), and run *much, much faster*.\n\n## Writing the Mock Class\n\nIf you are lucky, the mocks you need to use have already been implemented by\nsome nice people. If, however, you find yourself in the position to write a mock\nclass, relax - gMock turns this task into a fun game! (Well, almost.)\n\n### How to Define It\n\nUsing the `Turtle` interface as example, here are the simple steps you need to\nfollow:\n\n* Derive a class `MockTurtle` from `Turtle`.\n* Take a *virtual* function of `Turtle` (while it's possible to\n [mock non-virtual methods using templates](gmock_cook_book.md#MockingNonVirtualMethods),\n it's much more involved).\n* In the `public:` section of the child class, write `MOCK_METHOD();`\n* Now comes the fun part: you take the function signature, cut-and-paste it\n into the macro, and add two commas - one between the return type and the\n name, another between the name and the argument list.\n* If you're mocking a const method, add a 4th parameter containing `(const)`\n (the parentheses are required).\n* Since you're overriding a virtual method, we suggest adding the `override`\n keyword. For const methods the 4th parameter becomes `(const, override)`,\n for non-const methods just `(override)`. This isn't mandatory.\n* Repeat until all virtual functions you want to mock are done. (It goes\n without saying that *all* pure virtual methods in your abstract class must\n be either mocked or overridden.)\n\nAfter the process, you should have something like:\n\n```cpp\n#include \"gmock/gmock.h\" // Brings in gMock.\n\nclass MockTurtle : public Turtle {\n public:\n ...\n MOCK_METHOD(void, PenUp, (), (override));\n MOCK_METHOD(void, PenDown, (), (override));\n MOCK_METHOD(void, Forward, (int distance), (override));\n MOCK_METHOD(void, Turn, (int degrees), (override));\n MOCK_METHOD(void, GoTo, (int x, int y), (override));\n MOCK_METHOD(int, GetX, (), (const, override));\n MOCK_METHOD(int, GetY, (), (const, override));\n};\n```\n\nYou don't need to define these mock methods somewhere else - the `MOCK_METHOD`\nmacro will generate the definitions for you. It's that simple!\n\n### Where to Put It\n\nWhen you define a mock class, you need to decide where to put its definition.\nSome people put it in a `_test.cc`. This is fine when the interface being mocked\n(say, `Foo`) is owned by the same person or team. Otherwise, when the owner of\n`Foo` changes it, your test could break. (You can't really expect `Foo`'s\nmaintainer to fix every test that uses `Foo`, can you?)\n\nGenerally, you should not mock classes you don't own. If you must mock such a\nclass owned by others, define the mock class in `Foo`'s Bazel package (usually\nthe same directory or a `testing` sub-directory), and put it in a `.h` and a\n`cc_library` with `testonly=True`. Then everyone can reference them from their\ntests. If `Foo` ever changes, there is only one copy of `MockFoo` to change, and\nonly tests that depend on the changed methods need to be fixed.\n\nAnother way to do it: you can introduce a thin layer `FooAdaptor` on top of\n`Foo` and code to this new interface. Since you own `FooAdaptor`, you can absorb\nchanges in `Foo` much more easily. While this is more work initially, carefully\nchoosing the adaptor interface can make your code easier to write and more\nreadable (a net win in the long run), as you can choose `FooAdaptor` to fit your\nspecific domain much better than `Foo` does.\n\n## Using Mocks in Tests\n\nOnce you have a mock class, using it is easy. The typical work flow is:\n\n1. Import the gMock names from the `testing` namespace such that you can use\n them unqualified (You only have to do it once per file). Remember that\n namespaces are a good idea.\n2. Create some mock objects.\n3. Specify your expectations on them (How many times will a method be called?\n With what arguments? What should it do? etc.).\n4. Exercise some code that uses the mocks; optionally, check the result using\n googletest assertions. If a mock method is called more than expected or with\n wrong arguments, you'll get an error immediately.\n5. When a mock is destructed, gMock will automatically check whether all\n expectations on it have been satisfied.\n\nHere's an example:\n\n```cpp\n#include \"path/to/mock-turtle.h\"\n#include \"gmock/gmock.h\"\n#include \"gtest/gtest.h\"\n\nusing ::testing::AtLeast; // #1\n\nTEST(PainterTest, CanDrawSomething) {\n MockTurtle turtle; // #2\n EXPECT_CALL(turtle, PenDown()) // #3\n .Times(AtLeast(1));\n\n Painter painter(&turtle); // #4\n\n EXPECT_TRUE(painter.DrawCircle(0, 0, 10)); // #5\n}\n```\n\nAs you might have guessed, this test checks that `PenDown()` is called at least\nonce. If the `painter` object didn't call this method, your test will fail with\na message like this:\n\n```text\npath/to/my_test.cc:119: Failure\nActual function call count doesn't match this expectation:\nActually: never called;\nExpected: called at least once.\nStack trace:\n...\n```\n\n**Tip 1:** If you run the test from an Emacs buffer, you can hit `` on\nthe line number to jump right to the failed expectation.\n\n**Tip 2:** If your mock objects are never deleted, the final verification won't\nhappen. Therefore it's a good idea to turn on the heap checker in your tests\nwhen you allocate mocks on the heap. You get that automatically if you use the\n`gtest_main` library already.\n\n**Important note:** gMock requires expectations to be set **before** the mock\nfunctions are called, otherwise the behavior is **undefined**. Do not alternate\nbetween calls to `EXPECT_CALL()` and calls to the mock functions, and do not set\nany expectations on a mock after passing the mock to an API.\n\nThis means `EXPECT_CALL()` should be read as expecting that a call will occur\n*in the future*, not that a call has occurred. Why does gMock work like that?\nWell, specifying the expectation beforehand allows gMock to report a violation\nas soon as it rises, when the context (stack trace, etc) is still available.\nThis makes debugging much easier.\n\nAdmittedly, this test is contrived and doesn't do much. You can easily achieve\nthe same effect without using gMock. However, as we shall reveal soon, gMock\nallows you to do *so much more* with the mocks.\n\n## Setting Expectations\n\nThe key to using a mock object successfully is to set the *right expectations*\non it. If you set the expectations too strict, your test will fail as the result\nof unrelated changes. If you set them too loose, bugs can slip through. You want\nto do it just right such that your test can catch exactly the kind of bugs you\nintend it to catch. gMock provides the necessary means for you to do it \"just\nright.\"\n\n### General Syntax\n\nIn gMock we use the `EXPECT_CALL()` macro to set an expectation on a mock\nmethod. The general syntax is:\n\n```cpp\nEXPECT_CALL(mock_object, method(matchers))\n .Times(cardinality)\n .WillOnce(action)\n .WillRepeatedly(action);\n```\n\nThe macro has two arguments: first the mock object, and then the method and its\narguments. Note that the two are separated by a comma (`,`), not a period (`.`).\n(Why using a comma? The answer is that it was necessary for technical reasons.)\nIf the method is not overloaded, the macro can also be called without matchers:\n\n```cpp\nEXPECT_CALL(mock_object, non-overloaded-method)\n .Times(cardinality)\n .WillOnce(action)\n .WillRepeatedly(action);\n```\n\nThis syntax allows the test writer to specify \"called with any arguments\"\nwithout explicitly specifying the number or types of arguments. To avoid\nunintended ambiguity, this syntax may only be used for methods that are not\noverloaded.\n\nEither form of the macro can be followed by some optional *clauses* that provide\nmore information about the expectation. We'll discuss how each clause works in\nthe coming sections.\n\nThis syntax is designed to make an expectation read like English. For example,\nyou can probably guess that\n\n```cpp\nusing ::testing::Return;\n...\nEXPECT_CALL(turtle, GetX())\n .Times(5)\n .WillOnce(Return(100))\n .WillOnce(Return(150))\n .WillRepeatedly(Return(200));\n```\n\nsays that the `turtle` object's `GetX()` method will be called five times, it\nwill return 100 the first time, 150 the second time, and then 200 every time.\nSome people like to call this style of syntax a Domain-Specific Language (DSL).\n\n{: .callout .note}\n**Note:** Why do we use a macro to do this? Well it serves two purposes: first\nit makes expectations easily identifiable (either by `grep` or by a human\nreader), and second it allows gMock to include the source file location of a\nfailed expectation in messages, making debugging easier.\n\n### Matchers: What Arguments Do We Expect?\n\nWhen a mock function takes arguments, we may specify what arguments we are\nexpecting, for example:\n\n```cpp\n// Expects the turtle to move forward by 100 units.\nEXPECT_CALL(turtle, Forward(100));\n```\n\nOftentimes you do not want to be too specific. Remember that talk about tests\nbeing too rigid? Over specification leads to brittle tests and obscures the\nintent of tests. Therefore we encourage you to specify only what's necessary—no\nmore, no less. If you aren't interested in the value of an argument, write `_`\nas the argument, which means \"anything goes\":\n\n```cpp\nusing ::testing::_;\n...\n// Expects that the turtle jumps to somewhere on the x=50 line.\nEXPECT_CALL(turtle, GoTo(50, _));\n```\n\n`_` is an instance of what we call **matchers**. A matcher is like a predicate\nand can test whether an argument is what we'd expect. You can use a matcher\ninside `EXPECT_CALL()` wherever a function argument is expected. `_` is a\nconvenient way of saying \"any value\".\n\nIn the above examples, `100` and `50` are also matchers; implicitly, they are\nthe same as `Eq(100)` and `Eq(50)`, which specify that the argument must be\nequal (using `operator==`) to the matcher argument. There are many\n[built-in matchers](reference/matchers.md) for common types (as well as\n[custom matchers](gmock_cook_book.md#NewMatchers)); for example:\n\n```cpp\nusing ::testing::Ge;\n...\n// Expects the turtle moves forward by at least 100.\nEXPECT_CALL(turtle, Forward(Ge(100)));\n```\n\nIf you don't care about *any* arguments, rather than specify `_` for each of\nthem you may instead omit the parameter list:\n\n```cpp\n// Expects the turtle to move forward.\nEXPECT_CALL(turtle, Forward);\n// Expects the turtle to jump somewhere.\nEXPECT_CALL(turtle, GoTo);\n```\n\nThis works for all non-overloaded methods; if a method is overloaded, you need\nto help gMock resolve which overload is expected by specifying the number of\narguments and possibly also the\n[types of the arguments](gmock_cook_book.md#SelectOverload).\n\n### Cardinalities: How Many Times Will It Be Called?\n\nThe first clause we can specify following an `EXPECT_CALL()` is `Times()`. We\ncall its argument a **cardinality** as it tells *how many times* the call should\noccur. It allows us to repeat an expectation many times without actually writing\nit as many times. More importantly, a cardinality can be \"fuzzy\", just like a\nmatcher can be. This allows a user to express the intent of a test exactly.\n\nAn interesting special case is when we say `Times(0)`. You may have guessed - it\nmeans that the function shouldn't be called with the given arguments at all, and\ngMock will report a googletest failure whenever the function is (wrongfully)\ncalled.\n\nWe've seen `AtLeast(n)` as an example of fuzzy cardinalities earlier. For the\nlist of built-in cardinalities you can use, see\n[here](gmock_cheat_sheet.md#CardinalityList).\n\nThe `Times()` clause can be omitted. **If you omit `Times()`, gMock will infer\nthe cardinality for you.** The rules are easy to remember:\n\n* If **neither** `WillOnce()` **nor** `WillRepeatedly()` is in the\n `EXPECT_CALL()`, the inferred cardinality is `Times(1)`.\n* If there are *n* `WillOnce()`'s but **no** `WillRepeatedly()`, where *n* >=\n 1, the cardinality is `Times(n)`.\n* If there are *n* `WillOnce()`'s and **one** `WillRepeatedly()`, where *n* >=\n 0, the cardinality is `Times(AtLeast(n))`.\n\n**Quick quiz:** what do you think will happen if a function is expected to be\ncalled twice but actually called four times?\n\n### Actions: What Should It Do?\n\nRemember that a mock object doesn't really have a working implementation? We as\nusers have to tell it what to do when a method is invoked. This is easy in\ngMock.\n\nFirst, if the return type of a mock function is a built-in type or a pointer,\nthe function has a **default action** (a `void` function will just return, a\n`bool` function will return `false`, and other functions will return 0). In\naddition, in C++ 11 and above, a mock function whose return type is\ndefault-constructible (i.e. has a default constructor) has a default action of\nreturning a default-constructed value. If you don't say anything, this behavior\nwill be used.\n\nSecond, if a mock function doesn't have a default action, or the default action\ndoesn't suit you, you can specify the action to be taken each time the\nexpectation matches using a series of `WillOnce()` clauses followed by an\noptional `WillRepeatedly()`. For example,\n\n```cpp\nusing ::testing::Return;\n...\nEXPECT_CALL(turtle, GetX())\n .WillOnce(Return(100))\n .WillOnce(Return(200))\n .WillOnce(Return(300));\n```\n\nsays that `turtle.GetX()` will be called *exactly three times* (gMock inferred\nthis from how many `WillOnce()` clauses we've written, since we didn't\nexplicitly write `Times()`), and will return 100, 200, and 300 respectively.\n\n```cpp\nusing ::testing::Return;\n...\nEXPECT_CALL(turtle, GetY())\n .WillOnce(Return(100))\n .WillOnce(Return(200))\n .WillRepeatedly(Return(300));\n```\n\nsays that `turtle.GetY()` will be called *at least twice* (gMock knows this as\nwe've written two `WillOnce()` clauses and a `WillRepeatedly()` while having no\nexplicit `Times()`), will return 100 and 200 respectively the first two times,\nand 300 from the third time on.\n\nOf course, if you explicitly write a `Times()`, gMock will not try to infer the\ncardinality itself. What if the number you specified is larger than there are\n`WillOnce()` clauses? Well, after all `WillOnce()`s are used up, gMock will do\nthe *default* action for the function every time (unless, of course, you have a\n`WillRepeatedly()`.).\n\nWhat can we do inside `WillOnce()` besides `Return()`? You can return a\nreference using `ReturnRef(`*`variable`*`)`, or invoke a pre-defined function,\namong [others](gmock_cook_book.md#using-actions).\n\n**Important note:** The `EXPECT_CALL()` statement evaluates the action clause\nonly once, even though the action may be performed many times. Therefore you\nmust be careful about side effects. The following may not do what you want:\n\n```cpp\nusing ::testing::Return;\n...\nint n = 100;\nEXPECT_CALL(turtle, GetX())\n .Times(4)\n .WillRepeatedly(Return(n++));\n```\n\nInstead of returning 100, 101, 102, ..., consecutively, this mock function will\nalways return 100 as `n++` is only evaluated once. Similarly, `Return(new Foo)`\nwill create a new `Foo` object when the `EXPECT_CALL()` is executed, and will\nreturn the same pointer every time. If you want the side effect to happen every\ntime, you need to define a custom action, which we'll teach in the\n[cook book](gmock_cook_book.md).\n\nTime for another quiz! What do you think the following means?\n\n```cpp\nusing ::testing::Return;\n...\nEXPECT_CALL(turtle, GetY())\n .Times(4)\n .WillOnce(Return(100));\n```\n\nObviously `turtle.GetY()` is expected to be called four times. But if you think\nit will return 100 every time, think twice! Remember that one `WillOnce()`\nclause will be consumed each time the function is invoked and the default action\nwill be taken afterwards. So the right answer is that `turtle.GetY()` will\nreturn 100 the first time, but **return 0 from the second time on**, as\nreturning 0 is the default action for `int` functions.\n\n### Using Multiple Expectations {#MultiExpectations}\n\nSo far we've only shown examples where you have a single expectation. More\nrealistically, you'll specify expectations on multiple mock methods which may be\nfrom multiple mock objects.\n\nBy default, when a mock method is invoked, gMock will search the expectations in\nthe **reverse order** they are defined, and stop when an active expectation that\nmatches the arguments is found (you can think of it as \"newer rules override\nolder ones.\"). If the matching expectation cannot take any more calls, you will\nget an upper-bound-violated failure. Here's an example:\n\n```cpp\nusing ::testing::_;\n...\nEXPECT_CALL(turtle, Forward(_)); // #1\nEXPECT_CALL(turtle, Forward(10)) // #2\n .Times(2);\n```\n\nIf `Forward(10)` is called three times in a row, the third time it will be an\nerror, as the last matching expectation (#2) has been saturated. If, however,\nthe third `Forward(10)` call is replaced by `Forward(20)`, then it would be OK,\nas now #1 will be the matching expectation.\n\n{: .callout .note}\n**Note:** Why does gMock search for a match in the *reverse* order of the\nexpectations? The reason is that this allows a user to set up the default\nexpectations in a mock object's constructor or the test fixture's set-up phase\nand then customize the mock by writing more specific expectations in the test\nbody. So, if you have two expectations on the same method, you want to put the\none with more specific matchers **after** the other, or the more specific rule\nwould be shadowed by the more general one that comes after it.\n\n{: .callout .tip}\n**Tip:** It is very common to start with a catch-all expectation for a method\nand `Times(AnyNumber())` (omitting arguments, or with `_` for all arguments, if\noverloaded). This makes any calls to the method expected. This is not necessary\nfor methods that are not mentioned at all (these are \"uninteresting\"), but is\nuseful for methods that have some expectations, but for which other calls are\nok. See\n[Understanding Uninteresting vs Unexpected Calls](gmock_cook_book.md#uninteresting-vs-unexpected).\n\n### Ordered vs Unordered Calls {#OrderedCalls}\n\nBy default, an expectation can match a call even though an earlier expectation\nhasn't been satisfied. In other words, the calls don't have to occur in the\norder the expectations are specified.\n\nSometimes, you may want all the expected calls to occur in a strict order. To\nsay this in gMock is easy:\n\n```cpp\nusing ::testing::InSequence;\n...\nTEST(FooTest, DrawsLineSegment) {\n ...\n {\n InSequence seq;\n\n EXPECT_CALL(turtle, PenDown());\n EXPECT_CALL(turtle, Forward(100));\n EXPECT_CALL(turtle, PenUp());\n }\n Foo();\n}\n```\n\nBy creating an object of type `InSequence`, all expectations in its scope are\nput into a *sequence* and have to occur *sequentially*. Since we are just\nrelying on the constructor and destructor of this object to do the actual work,\nits name is really irrelevant.\n\nIn this example, we test that `Foo()` calls the three expected functions in the\norder as written. If a call is made out-of-order, it will be an error.\n\n(What if you care about the relative order of some of the calls, but not all of\nthem? Can you specify an arbitrary partial order? The answer is ... yes! The\ndetails can be found [here](gmock_cook_book.md#OrderedCalls).)\n\n### All Expectations Are Sticky (Unless Said Otherwise) {#StickyExpectations}\n\nNow let's do a quick quiz to see how well you can use this mock stuff already.\nHow would you test that the turtle is asked to go to the origin *exactly twice*\n(you want to ignore any other instructions it receives)?\n\nAfter you've come up with your answer, take a look at ours and compare notes\n(solve it yourself first - don't cheat!):\n\n```cpp\nusing ::testing::_;\nusing ::testing::AnyNumber;\n...\nEXPECT_CALL(turtle, GoTo(_, _)) // #1\n .Times(AnyNumber());\nEXPECT_CALL(turtle, GoTo(0, 0)) // #2\n .Times(2);\n```\n\nSuppose `turtle.GoTo(0, 0)` is called three times. In the third time, gMock will\nsee that the arguments match expectation #2 (remember that we always pick the\nlast matching expectation). Now, since we said that there should be only two\nsuch calls, gMock will report an error immediately. This is basically what we've\ntold you in the [Using Multiple Expectations](#MultiExpectations) section above.\n\nThis example shows that **expectations in gMock are \"sticky\" by default**, in\nthe sense that they remain active even after we have reached their invocation\nupper bounds. This is an important rule to remember, as it affects the meaning\nof the spec, and is **different** to how it's done in many other mocking\nframeworks (Why'd we do that? Because we think our rule makes the common cases\neasier to express and understand.).\n\nSimple? Let's see if you've really understood it: what does the following code\nsay?\n\n```cpp\nusing ::testing::Return;\n...\nfor (int i = n; i > 0; i--) {\n EXPECT_CALL(turtle, GetX())\n .WillOnce(Return(10*i));\n}\n```\n\nIf you think it says that `turtle.GetX()` will be called `n` times and will\nreturn 10, 20, 30, ..., consecutively, think twice! The problem is that, as we\nsaid, expectations are sticky. So, the second time `turtle.GetX()` is called,\nthe last (latest) `EXPECT_CALL()` statement will match, and will immediately\nlead to an \"upper bound violated\" error - this piece of code is not very useful!\n\nOne correct way of saying that `turtle.GetX()` will return 10, 20, 30, ..., is\nto explicitly say that the expectations are *not* sticky. In other words, they\nshould *retire* as soon as they are saturated:\n\n```cpp\nusing ::testing::Return;\n...\nfor (int i = n; i > 0; i--) {\n EXPECT_CALL(turtle, GetX())\n .WillOnce(Return(10*i))\n .RetiresOnSaturation();\n}\n```\n\nAnd, there's a better way to do it: in this case, we expect the calls to occur\nin a specific order, and we line up the actions to match the order. Since the\norder is important here, we should make it explicit using a sequence:\n\n```cpp\nusing ::testing::InSequence;\nusing ::testing::Return;\n...\n{\n InSequence s;\n\n for (int i = 1; i <= n; i++) {\n EXPECT_CALL(turtle, GetX())\n .WillOnce(Return(10*i))\n .RetiresOnSaturation();\n }\n}\n```\n\nBy the way, the other situation where an expectation may *not* be sticky is when\nit's in a sequence - as soon as another expectation that comes after it in the\nsequence has been used, it automatically retires (and will never be used to\nmatch any call).\n\n### Uninteresting Calls\n\nA mock object may have many methods, and not all of them are that interesting.\nFor example, in some tests we may not care about how many times `GetX()` and\n`GetY()` get called.\n\nIn gMock, if you are not interested in a method, just don't say anything about\nit. If a call to this method occurs, you'll see a warning in the test output,\nbut it won't be a failure. This is called \"naggy\" behavior; to change, see\n[The Nice, the Strict, and the Naggy](gmock_cook_book.md#NiceStrictNaggy).\n" }, { "path": "3rd/googletest-1.12.1/docs/index.md", "content": "# GoogleTest User's Guide\n\n## Welcome to GoogleTest!\n\nGoogleTest is Google's C++ testing and mocking framework. This user's guide has\nthe following contents:\n\n* [GoogleTest Primer](primer.md) - Teaches you how to write simple tests using\n GoogleTest. Read this first if you are new to GoogleTest.\n* [GoogleTest Advanced](advanced.md) - Read this when you've finished the\n Primer and want to utilize GoogleTest to its full potential.\n* [GoogleTest Samples](samples.md) - Describes some GoogleTest samples.\n* [GoogleTest FAQ](faq.md) - Have a question? Want some tips? Check here\n first.\n* [Mocking for Dummies](gmock_for_dummies.md) - Teaches you how to create mock\n objects and use them in tests.\n* [Mocking Cookbook](gmock_cook_book.md) - Includes tips and approaches to\n common mocking use cases.\n* [Mocking Cheat Sheet](gmock_cheat_sheet.md) - A handy reference for\n matchers, actions, invariants, and more.\n* [Mocking FAQ](gmock_faq.md) - Contains answers to some mocking-specific\n questions.\n" }, { "path": "3rd/googletest-1.12.1/docs/pkgconfig.md", "content": "## Using GoogleTest from various build systems\n\nGoogleTest comes with pkg-config files that can be used to determine all\nnecessary flags for compiling and linking to GoogleTest (and GoogleMock).\nPkg-config is a standardised plain-text format containing\n\n* the includedir (-I) path\n* necessary macro (-D) definitions\n* further required flags (-pthread)\n* the library (-L) path\n* the library (-l) to link to\n\nAll current build systems support pkg-config in one way or another. For all\nexamples here we assume you want to compile the sample\n`samples/sample3_unittest.cc`.\n\n### CMake\n\nUsing `pkg-config` in CMake is fairly easy:\n\n```cmake\ncmake_minimum_required(VERSION 3.0)\n\ncmake_policy(SET CMP0048 NEW)\nproject(my_gtest_pkgconfig VERSION 0.0.1 LANGUAGES CXX)\n\nfind_package(PkgConfig)\npkg_search_module(GTEST REQUIRED gtest_main)\n\nadd_executable(testapp samples/sample3_unittest.cc)\ntarget_link_libraries(testapp ${GTEST_LDFLAGS})\ntarget_compile_options(testapp PUBLIC ${GTEST_CFLAGS})\n\ninclude(CTest)\nadd_test(first_and_only_test testapp)\n```\n\nIt is generally recommended that you use `target_compile_options` + `_CFLAGS`\nover `target_include_directories` + `_INCLUDE_DIRS` as the former includes not\njust -I flags (GoogleTest might require a macro indicating to internal headers\nthat all libraries have been compiled with threading enabled. In addition,\nGoogleTest might also require `-pthread` in the compiling step, and as such\nsplitting the pkg-config `Cflags` variable into include dirs and macros for\n`target_compile_definitions()` might still miss this). The same recommendation\ngoes for using `_LDFLAGS` over the more commonplace `_LIBRARIES`, which happens\nto discard `-L` flags and `-pthread`.\n\n### Help! pkg-config can't find GoogleTest!\n\nLet's say you have a `CMakeLists.txt` along the lines of the one in this\ntutorial and you try to run `cmake`. It is very possible that you get a failure\nalong the lines of:\n\n```\n-- Checking for one of the modules 'gtest_main'\nCMake Error at /usr/share/cmake/Modules/FindPkgConfig.cmake:640 (message):\n None of the required 'gtest_main' found\n```\n\nThese failures are common if you installed GoogleTest yourself and have not\nsourced it from a distro or other package manager. If so, you need to tell\npkg-config where it can find the `.pc` files containing the information. Say you\ninstalled GoogleTest to `/usr/local`, then it might be that the `.pc` files are\ninstalled under `/usr/local/lib64/pkgconfig`. If you set\n\n```\nexport PKG_CONFIG_PATH=/usr/local/lib64/pkgconfig\n```\n\npkg-config will also try to look in `PKG_CONFIG_PATH` to find `gtest_main.pc`.\n\n### Using pkg-config in a cross-compilation setting\n\nPkg-config can be used in a cross-compilation setting too. To do this, let's\nassume the final prefix of the cross-compiled installation will be `/usr`, and\nyour sysroot is `/home/MYUSER/sysroot`. Configure and install GTest using\n\n```\nmkdir build && cmake -DCMAKE_INSTALL_PREFIX=/usr ..\n```\n\nInstall into the sysroot using `DESTDIR`:\n\n```\nmake -j install DESTDIR=/home/MYUSER/sysroot\n```\n\nBefore we continue, it is recommended to **always** define the following two\nvariables for pkg-config in a cross-compilation setting:\n\n```\nexport PKG_CONFIG_ALLOW_SYSTEM_CFLAGS=yes\nexport PKG_CONFIG_ALLOW_SYSTEM_LIBS=yes\n```\n\notherwise `pkg-config` will filter `-I` and `-L` flags against standard prefixes\nsuch as `/usr` (see https://bugs.freedesktop.org/show_bug.cgi?id=28264#c3 for\nreasons why this stripping needs to occur usually).\n\nIf you look at the generated pkg-config file, it will look something like\n\n```\nlibdir=/usr/lib64\nincludedir=/usr/include\n\nName: gtest\nDescription: GoogleTest (without main() function)\nVersion: 1.11.0\nURL: https://github.com/google/googletest\nLibs: -L${libdir} -lgtest -lpthread\nCflags: -I${includedir} -DGTEST_HAS_PTHREAD=1 -lpthread\n```\n\nNotice that the sysroot is not included in `libdir` and `includedir`! If you try\nto run `pkg-config` with the correct\n`PKG_CONFIG_LIBDIR=/home/MYUSER/sysroot/usr/lib64/pkgconfig` against this `.pc`\nfile, you will get\n\n```\n$ pkg-config --cflags gtest\n-DGTEST_HAS_PTHREAD=1 -lpthread -I/usr/include\n$ pkg-config --libs gtest\n-L/usr/lib64 -lgtest -lpthread\n```\n\nwhich is obviously wrong and points to the `CBUILD` and not `CHOST` root. In\norder to use this in a cross-compilation setting, we need to tell pkg-config to\ninject the actual sysroot into `-I` and `-L` variables. Let us now tell\npkg-config about the actual sysroot\n\n```\nexport PKG_CONFIG_DIR=\nexport PKG_CONFIG_SYSROOT_DIR=/home/MYUSER/sysroot\nexport PKG_CONFIG_LIBDIR=${PKG_CONFIG_SYSROOT_DIR}/usr/lib64/pkgconfig\n```\n\nand running `pkg-config` again we get\n\n```\n$ pkg-config --cflags gtest\n-DGTEST_HAS_PTHREAD=1 -lpthread -I/home/MYUSER/sysroot/usr/include\n$ pkg-config --libs gtest\n-L/home/MYUSER/sysroot/usr/lib64 -lgtest -lpthread\n```\n\nwhich contains the correct sysroot now. For a more comprehensive guide to also\nincluding `${CHOST}` in build system calls, see the excellent tutorial by Diego\nElio Pettenò: \n" }, { "path": "3rd/googletest-1.12.1/docs/platforms.md", "content": "# Supported Platforms\n\nGoogleTest requires a codebase and compiler compliant with the C++11 standard or\nnewer.\n\nThe GoogleTest code is officially supported on the following platforms.\nOperating systems or tools not listed below are community-supported. For\ncommunity-supported platforms, patches that do not complicate the code may be\nconsidered.\n\nIf you notice any problems on your platform, please file an issue on the\n[GoogleTest GitHub Issue Tracker](https://github.com/google/googletest/issues).\nPull requests containing fixes are welcome!\n\n### Operating systems\n\n* Linux\n* macOS\n* Windows\n\n### Compilers\n\n* gcc 5.0+\n* clang 5.0+\n* MSVC 2015+\n\n**macOS users:** Xcode 9.3+ provides clang 5.0+.\n\n### Build systems\n\n* [Bazel](https://bazel.build/)\n* [CMake](https://cmake.org/)\n\nBazel is the build system used by the team internally and in tests. CMake is\nsupported on a best-effort basis and by the community.\n" }, { "path": "3rd/googletest-1.12.1/docs/primer.md", "content": "# Googletest Primer\n\n## Introduction: Why googletest?\n\n*googletest* helps you write better C++ tests.\n\ngoogletest is a testing framework developed by the Testing Technology team with\nGoogle's specific requirements and constraints in mind. Whether you work on\nLinux, Windows, or a Mac, if you write C++ code, googletest can help you. And it\nsupports *any* kind of tests, not just unit tests.\n\nSo what makes a good test, and how does googletest fit in? We believe:\n\n1. Tests should be *independent* and *repeatable*. It's a pain to debug a test\n that succeeds or fails as a result of other tests. googletest isolates the\n tests by running each of them on a different object. When a test fails,\n googletest allows you to run it in isolation for quick debugging.\n2. Tests should be well *organized* and reflect the structure of the tested\n code. googletest groups related tests into test suites that can share data\n and subroutines. This common pattern is easy to recognize and makes tests\n easy to maintain. Such consistency is especially helpful when people switch\n projects and start to work on a new code base.\n3. Tests should be *portable* and *reusable*. Google has a lot of code that is\n platform-neutral; its tests should also be platform-neutral. googletest\n works on different OSes, with different compilers, with or without\n exceptions, so googletest tests can work with a variety of configurations.\n4. When tests fail, they should provide as much *information* about the problem\n as possible. googletest doesn't stop at the first test failure. Instead, it\n only stops the current test and continues with the next. You can also set up\n tests that report non-fatal failures after which the current test continues.\n Thus, you can detect and fix multiple bugs in a single run-edit-compile\n cycle.\n5. The testing framework should liberate test writers from housekeeping chores\n and let them focus on the test *content*. googletest automatically keeps\n track of all tests defined, and doesn't require the user to enumerate them\n in order to run them.\n6. Tests should be *fast*. With googletest, you can reuse shared resources\n across tests and pay for the set-up/tear-down only once, without making\n tests depend on each other.\n\nSince googletest is based on the popular xUnit architecture, you'll feel right\nat home if you've used JUnit or PyUnit before. If not, it will take you about 10\nminutes to learn the basics and get started. So let's go!\n\n## Beware of the nomenclature\n\n{: .callout .note}\n_Note:_ There might be some confusion arising from different definitions of the\nterms _Test_, _Test Case_ and _Test Suite_, so beware of misunderstanding these.\n\nHistorically, googletest started to use the term _Test Case_ for grouping\nrelated tests, whereas current publications, including International Software\nTesting Qualifications Board ([ISTQB](http://www.istqb.org/)) materials and\nvarious textbooks on software quality, use the term\n_[Test Suite][istqb test suite]_ for this.\n\nThe related term _Test_, as it is used in googletest, corresponds to the term\n_[Test Case][istqb test case]_ of ISTQB and others.\n\nThe term _Test_ is commonly of broad enough sense, including ISTQB's definition\nof _Test Case_, so it's not much of a problem here. But the term _Test Case_ as\nwas used in Google Test is of contradictory sense and thus confusing.\n\ngoogletest recently started replacing the term _Test Case_ with _Test Suite_.\nThe preferred API is *TestSuite*. The older TestCase API is being slowly\ndeprecated and refactored away.\n\nSo please be aware of the different definitions of the terms:\n\n\nMeaning | googletest Term | [ISTQB](http://www.istqb.org/) Term\n:----------------------------------------------------------------------------------- | :---------------------- | :----------------------------------\nExercise a particular program path with specific input values and verify the results | [TEST()](#simple-tests) | [Test Case][istqb test case]\n\n\n[istqb test case]: http://glossary.istqb.org/en/search/test%20case\n[istqb test suite]: http://glossary.istqb.org/en/search/test%20suite\n\n## Basic Concepts\n\nWhen using googletest, you start by writing *assertions*, which are statements\nthat check whether a condition is true. An assertion's result can be *success*,\n*nonfatal failure*, or *fatal failure*. If a fatal failure occurs, it aborts the\ncurrent function; otherwise the program continues normally.\n\n*Tests* use assertions to verify the tested code's behavior. If a test crashes\nor has a failed assertion, then it *fails*; otherwise it *succeeds*.\n\nA *test suite* contains one or many tests. You should group your tests into test\nsuites that reflect the structure of the tested code. When multiple tests in a\ntest suite need to share common objects and subroutines, you can put them into a\n*test fixture* class.\n\nA *test program* can contain multiple test suites.\n\nWe'll now explain how to write a test program, starting at the individual\nassertion level and building up to tests and test suites.\n\n## Assertions\n\ngoogletest assertions are macros that resemble function calls. You test a class\nor function by making assertions about its behavior. When an assertion fails,\ngoogletest prints the assertion's source file and line number location, along\nwith a failure message. You may also supply a custom failure message which will\nbe appended to googletest's message.\n\nThe assertions come in pairs that test the same thing but have different effects\non the current function. `ASSERT_*` versions generate fatal failures when they\nfail, and **abort the current function**. `EXPECT_*` versions generate nonfatal\nfailures, which don't abort the current function. Usually `EXPECT_*` are\npreferred, as they allow more than one failure to be reported in a test.\nHowever, you should use `ASSERT_*` if it doesn't make sense to continue when the\nassertion in question fails.\n\nSince a failed `ASSERT_*` returns from the current function immediately,\npossibly skipping clean-up code that comes after it, it may cause a space leak.\nDepending on the nature of the leak, it may or may not be worth fixing - so keep\nthis in mind if you get a heap checker error in addition to assertion errors.\n\nTo provide a custom failure message, simply stream it into the macro using the\n`<<` operator or a sequence of such operators. See the following example, using\nthe [`ASSERT_EQ` and `EXPECT_EQ`](reference/assertions.md#EXPECT_EQ) macros to\nverify value equality:\n\n```c++\nASSERT_EQ(x.size(), y.size()) << \"Vectors x and y are of unequal length\";\n\nfor (int i = 0; i < x.size(); ++i) {\n EXPECT_EQ(x[i], y[i]) << \"Vectors x and y differ at index \" << i;\n}\n```\n\nAnything that can be streamed to an `ostream` can be streamed to an assertion\nmacro--in particular, C strings and `string` objects. If a wide string\n(`wchar_t*`, `TCHAR*` in `UNICODE` mode on Windows, or `std::wstring`) is\nstreamed to an assertion, it will be translated to UTF-8 when printed.\n\nGoogleTest provides a collection of assertions for verifying the behavior of\nyour code in various ways. You can check Boolean conditions, compare values\nbased on relational operators, verify string values, floating-point values, and\nmuch more. There are even assertions that enable you to verify more complex\nstates by providing custom predicates. For the complete list of assertions\nprovided by GoogleTest, see the [Assertions Reference](reference/assertions.md).\n\n## Simple Tests\n\nTo create a test:\n\n1. Use the `TEST()` macro to define and name a test function. These are\n ordinary C++ functions that don't return a value.\n2. In this function, along with any valid C++ statements you want to include,\n use the various googletest assertions to check values.\n3. The test's result is determined by the assertions; if any assertion in the\n test fails (either fatally or non-fatally), or if the test crashes, the\n entire test fails. Otherwise, it succeeds.\n\n```c++\nTEST(TestSuiteName, TestName) {\n ... test body ...\n}\n```\n\n`TEST()` arguments go from general to specific. The *first* argument is the name\nof the test suite, and the *second* argument is the test's name within the test\nsuite. Both names must be valid C++ identifiers, and they should not contain any\nunderscores (`_`). A test's *full name* consists of its containing test suite\nand its individual name. Tests from different test suites can have the same\nindividual name.\n\nFor example, let's take a simple integer function:\n\n```c++\nint Factorial(int n); // Returns the factorial of n\n```\n\nA test suite for this function might look like:\n\n```c++\n// Tests factorial of 0.\nTEST(FactorialTest, HandlesZeroInput) {\n EXPECT_EQ(Factorial(0), 1);\n}\n\n// Tests factorial of positive numbers.\nTEST(FactorialTest, HandlesPositiveInput) {\n EXPECT_EQ(Factorial(1), 1);\n EXPECT_EQ(Factorial(2), 2);\n EXPECT_EQ(Factorial(3), 6);\n EXPECT_EQ(Factorial(8), 40320);\n}\n```\n\ngoogletest groups the test results by test suites, so logically related tests\nshould be in the same test suite; in other words, the first argument to their\n`TEST()` should be the same. In the above example, we have two tests,\n`HandlesZeroInput` and `HandlesPositiveInput`, that belong to the same test\nsuite `FactorialTest`.\n\nWhen naming your test suites and tests, you should follow the same convention as\nfor\n[naming functions and classes](https://google.github.io/styleguide/cppguide.html#Function_Names).\n\n**Availability**: Linux, Windows, Mac.\n\n## Test Fixtures: Using the Same Data Configuration for Multiple Tests {#same-data-multiple-tests}\n\nIf you find yourself writing two or more tests that operate on similar data, you\ncan use a *test fixture*. This allows you to reuse the same configuration of\nobjects for several different tests.\n\nTo create a fixture:\n\n1. Derive a class from `::testing::Test` . Start its body with `protected:`, as\n we'll want to access fixture members from sub-classes.\n2. Inside the class, declare any objects you plan to use.\n3. If necessary, write a default constructor or `SetUp()` function to prepare\n the objects for each test. A common mistake is to spell `SetUp()` as\n **`Setup()`** with a small `u` - Use `override` in C++11 to make sure you\n spelled it correctly.\n4. If necessary, write a destructor or `TearDown()` function to release any\n resources you allocated in `SetUp()` . To learn when you should use the\n constructor/destructor and when you should use `SetUp()/TearDown()`, read\n the [FAQ](faq.md#CtorVsSetUp).\n5. If needed, define subroutines for your tests to share.\n\nWhen using a fixture, use `TEST_F()` instead of `TEST()` as it allows you to\naccess objects and subroutines in the test fixture:\n\n```c++\nTEST_F(TestFixtureName, TestName) {\n ... test body ...\n}\n```\n\nLike `TEST()`, the first argument is the test suite name, but for `TEST_F()`\nthis must be the name of the test fixture class. You've probably guessed: `_F`\nis for fixture.\n\nUnfortunately, the C++ macro system does not allow us to create a single macro\nthat can handle both types of tests. Using the wrong macro causes a compiler\nerror.\n\nAlso, you must first define a test fixture class before using it in a\n`TEST_F()`, or you'll get the compiler error \"`virtual outside class\ndeclaration`\".\n\nFor each test defined with `TEST_F()`, googletest will create a *fresh* test\nfixture at runtime, immediately initialize it via `SetUp()`, run the test, clean\nup by calling `TearDown()`, and then delete the test fixture. Note that\ndifferent tests in the same test suite have different test fixture objects, and\ngoogletest always deletes a test fixture before it creates the next one.\ngoogletest does **not** reuse the same test fixture for multiple tests. Any\nchanges one test makes to the fixture do not affect other tests.\n\nAs an example, let's write tests for a FIFO queue class named `Queue`, which has\nthe following interface:\n\n```c++\ntemplate // E is the element type.\nclass Queue {\n public:\n Queue();\n void Enqueue(const E& element);\n E* Dequeue(); // Returns NULL if the queue is empty.\n size_t size() const;\n ...\n};\n```\n\nFirst, define a fixture class. By convention, you should give it the name\n`FooTest` where `Foo` is the class being tested.\n\n```c++\nclass QueueTest : public ::testing::Test {\n protected:\n void SetUp() override {\n q1_.Enqueue(1);\n q2_.Enqueue(2);\n q2_.Enqueue(3);\n }\n\n // void TearDown() override {}\n\n Queue q0_;\n Queue q1_;\n Queue q2_;\n};\n```\n\nIn this case, `TearDown()` is not needed since we don't have to clean up after\neach test, other than what's already done by the destructor.\n\nNow we'll write tests using `TEST_F()` and this fixture.\n\n```c++\nTEST_F(QueueTest, IsEmptyInitially) {\n EXPECT_EQ(q0_.size(), 0);\n}\n\nTEST_F(QueueTest, DequeueWorks) {\n int* n = q0_.Dequeue();\n EXPECT_EQ(n, nullptr);\n\n n = q1_.Dequeue();\n ASSERT_NE(n, nullptr);\n EXPECT_EQ(*n, 1);\n EXPECT_EQ(q1_.size(), 0);\n delete n;\n\n n = q2_.Dequeue();\n ASSERT_NE(n, nullptr);\n EXPECT_EQ(*n, 2);\n EXPECT_EQ(q2_.size(), 1);\n delete n;\n}\n```\n\nThe above uses both `ASSERT_*` and `EXPECT_*` assertions. The rule of thumb is\nto use `EXPECT_*` when you want the test to continue to reveal more errors after\nthe assertion failure, and use `ASSERT_*` when continuing after failure doesn't\nmake sense. For example, the second assertion in the `Dequeue` test is\n`ASSERT_NE(n, nullptr)`, as we need to dereference the pointer `n` later, which\nwould lead to a segfault when `n` is `NULL`.\n\nWhen these tests run, the following happens:\n\n1. googletest constructs a `QueueTest` object (let's call it `t1`).\n2. `t1.SetUp()` initializes `t1`.\n3. The first test (`IsEmptyInitially`) runs on `t1`.\n4. `t1.TearDown()` cleans up after the test finishes.\n5. `t1` is destructed.\n6. The above steps are repeated on another `QueueTest` object, this time\n running the `DequeueWorks` test.\n\n**Availability**: Linux, Windows, Mac.\n\n## Invoking the Tests\n\n`TEST()` and `TEST_F()` implicitly register their tests with googletest. So,\nunlike with many other C++ testing frameworks, you don't have to re-list all\nyour defined tests in order to run them.\n\nAfter defining your tests, you can run them with `RUN_ALL_TESTS()`, which\nreturns `0` if all the tests are successful, or `1` otherwise. Note that\n`RUN_ALL_TESTS()` runs *all tests* in your link unit--they can be from different\ntest suites, or even different source files.\n\nWhen invoked, the `RUN_ALL_TESTS()` macro:\n\n* Saves the state of all googletest flags.\n\n* Creates a test fixture object for the first test.\n\n* Initializes it via `SetUp()`.\n\n* Runs the test on the fixture object.\n\n* Cleans up the fixture via `TearDown()`.\n\n* Deletes the fixture.\n\n* Restores the state of all googletest flags.\n\n* Repeats the above steps for the next test, until all tests have run.\n\nIf a fatal failure happens the subsequent steps will be skipped.\n\n{: .callout .important}\n> IMPORTANT: You must **not** ignore the return value of `RUN_ALL_TESTS()`, or\n> you will get a compiler error. The rationale for this design is that the\n> automated testing service determines whether a test has passed based on its\n> exit code, not on its stdout/stderr output; thus your `main()` function must\n> return the value of `RUN_ALL_TESTS()`.\n>\n> Also, you should call `RUN_ALL_TESTS()` only **once**. Calling it more than\n> once conflicts with some advanced googletest features (e.g., thread-safe\n> [death tests](advanced.md#death-tests)) and thus is not supported.\n\n**Availability**: Linux, Windows, Mac.\n\n## Writing the main() Function\n\nMost users should _not_ need to write their own `main` function and instead link\nwith `gtest_main` (as opposed to with `gtest`), which defines a suitable entry\npoint. See the end of this section for details. The remainder of this section\nshould only apply when you need to do something custom before the tests run that\ncannot be expressed within the framework of fixtures and test suites.\n\nIf you write your own `main` function, it should return the value of\n`RUN_ALL_TESTS()`.\n\nYou can start from this boilerplate:\n\n```c++\n#include \"this/package/foo.h\"\n\n#include \"gtest/gtest.h\"\n\nnamespace my {\nnamespace project {\nnamespace {\n\n// The fixture for testing class Foo.\nclass FooTest : public ::testing::Test {\n protected:\n // You can remove any or all of the following functions if their bodies would\n // be empty.\n\n FooTest() {\n // You can do set-up work for each test here.\n }\n\n ~FooTest() override {\n // You can do clean-up work that doesn't throw exceptions here.\n }\n\n // If the constructor and destructor are not enough for setting up\n // and cleaning up each test, you can define the following methods:\n\n void SetUp() override {\n // Code here will be called immediately after the constructor (right\n // before each test).\n }\n\n void TearDown() override {\n // Code here will be called immediately after each test (right\n // before the destructor).\n }\n\n // Class members declared here can be used by all tests in the test suite\n // for Foo.\n};\n\n// Tests that the Foo::Bar() method does Abc.\nTEST_F(FooTest, MethodBarDoesAbc) {\n const std::string input_filepath = \"this/package/testdata/myinputfile.dat\";\n const std::string output_filepath = \"this/package/testdata/myoutputfile.dat\";\n Foo f;\n EXPECT_EQ(f.Bar(input_filepath, output_filepath), 0);\n}\n\n// Tests that Foo does Xyz.\nTEST_F(FooTest, DoesXyz) {\n // Exercises the Xyz feature of Foo.\n}\n\n} // namespace\n} // namespace project\n} // namespace my\n\nint main(int argc, char **argv) {\n ::testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n```\n\nThe `::testing::InitGoogleTest()` function parses the command line for\ngoogletest flags, and removes all recognized flags. This allows the user to\ncontrol a test program's behavior via various flags, which we'll cover in the\n[AdvancedGuide](advanced.md). You **must** call this function before calling\n`RUN_ALL_TESTS()`, or the flags won't be properly initialized.\n\nOn Windows, `InitGoogleTest()` also works with wide strings, so it can be used\nin programs compiled in `UNICODE` mode as well.\n\nBut maybe you think that writing all those `main` functions is too much work? We\nagree with you completely, and that's why Google Test provides a basic\nimplementation of main(). If it fits your needs, then just link your test with\nthe `gtest_main` library and you are good to go.\n\n{: .callout .note}\nNOTE: `ParseGUnitFlags()` is deprecated in favor of `InitGoogleTest()`.\n\n## Known Limitations\n\n* Google Test is designed to be thread-safe. The implementation is thread-safe\n on systems where the `pthreads` library is available. It is currently\n _unsafe_ to use Google Test assertions from two threads concurrently on\n other systems (e.g. Windows). In most tests this is not an issue as usually\n the assertions are done in the main thread. If you want to help, you can\n volunteer to implement the necessary synchronization primitives in\n `gtest-port.h` for your platform.\n" }, { "path": "3rd/googletest-1.12.1/docs/quickstart-bazel.md", "content": "# Quickstart: Building with Bazel\n\nThis tutorial aims to get you up and running with GoogleTest using the Bazel\nbuild system. If you're using GoogleTest for the first time or need a refresher,\nwe recommend this tutorial as a starting point.\n\n## Prerequisites\n\nTo complete this tutorial, you'll need:\n\n* A compatible operating system (e.g. Linux, macOS, Windows).\n* A compatible C++ compiler that supports at least C++11.\n* [Bazel](https://bazel.build/), the preferred build system used by the\n GoogleTest team.\n\nSee [Supported Platforms](platforms.md) for more information about platforms\ncompatible with GoogleTest.\n\nIf you don't already have Bazel installed, see the\n[Bazel installation guide](https://docs.bazel.build/versions/main/install.html).\n\n{: .callout .note}\nNote: The terminal commands in this tutorial show a Unix shell prompt, but the\ncommands work on the Windows command line as well.\n\n## Set up a Bazel workspace\n\nA\n[Bazel workspace](https://docs.bazel.build/versions/main/build-ref.html#workspace)\nis a directory on your filesystem that you use to manage source files for the\nsoftware you want to build. Each workspace directory has a text file named\n`WORKSPACE` which may be empty, or may contain references to external\ndependencies required to build the outputs.\n\nFirst, create a directory for your workspace:\n\n```\n$ mkdir my_workspace && cd my_workspace\n```\n\nNext, you’ll create the `WORKSPACE` file to specify dependencies. A common and\nrecommended way to depend on GoogleTest is to use a\n[Bazel external dependency](https://docs.bazel.build/versions/main/external.html)\nvia the\n[`http_archive` rule](https://docs.bazel.build/versions/main/repo/http.html#http_archive).\nTo do this, in the root directory of your workspace (`my_workspace/`), create a\nfile named `WORKSPACE` with the following contents:\n\n```\nload(\"@bazel_tools//tools/build_defs/repo:http.bzl\", \"http_archive\")\n\nhttp_archive(\n name = \"com_google_googletest\",\n urls = [\"https://github.com/google/googletest/archive/609281088cfefc76f9d0ce82e1ff6c30cc3591e5.zip\"],\n strip_prefix = \"googletest-609281088cfefc76f9d0ce82e1ff6c30cc3591e5\",\n)\n```\n\nThe above configuration declares a dependency on GoogleTest which is downloaded\nas a ZIP archive from GitHub. In the above example,\n`609281088cfefc76f9d0ce82e1ff6c30cc3591e5` is the Git commit hash of the\nGoogleTest version to use; we recommend updating the hash often to point to the\nlatest version.\n\nNow you're ready to build C++ code that uses GoogleTest.\n\n## Create and run a binary\n\nWith your Bazel workspace set up, you can now use GoogleTest code within your\nown project.\n\nAs an example, create a file named `hello_test.cc` in your `my_workspace`\ndirectory with the following contents:\n\n```cpp\n#include \n\n// Demonstrate some basic assertions.\nTEST(HelloTest, BasicAssertions) {\n // Expect two strings not to be equal.\n EXPECT_STRNE(\"hello\", \"world\");\n // Expect equality.\n EXPECT_EQ(7 * 6, 42);\n}\n```\n\nGoogleTest provides [assertions](primer.md#assertions) that you use to test the\nbehavior of your code. The above sample includes the main GoogleTest header file\nand demonstrates some basic assertions.\n\nTo build the code, create a file named `BUILD` in the same directory with the\nfollowing contents:\n\n```\ncc_test(\n name = \"hello_test\",\n size = \"small\",\n srcs = [\"hello_test.cc\"],\n deps = [\"@com_google_googletest//:gtest_main\"],\n)\n```\n\nThis `cc_test` rule declares the C++ test binary you want to build, and links to\nGoogleTest (`//:gtest_main`) using the prefix you specified in the `WORKSPACE`\nfile (`@com_google_googletest`). For more information about Bazel `BUILD` files,\nsee the\n[Bazel C++ Tutorial](https://docs.bazel.build/versions/main/tutorial/cpp.html).\n\nNow you can build and run your test:\n\n
\nmy_workspace$ bazel test --test_output=all //:hello_test\nINFO: Analyzed target //:hello_test (26 packages loaded, 362 targets configured).\nINFO: Found 1 test target...\nINFO: From Testing //:hello_test:\n==================== Test output for //:hello_test:\nRunning main() from gmock_main.cc\n[==========] Running 1 test from 1 test suite.\n[----------] Global test environment set-up.\n[----------] 1 test from HelloTest\n[ RUN      ] HelloTest.BasicAssertions\n[       OK ] HelloTest.BasicAssertions (0 ms)\n[----------] 1 test from HelloTest (0 ms total)\n\n[----------] Global test environment tear-down\n[==========] 1 test from 1 test suite ran. (0 ms total)\n[  PASSED  ] 1 test.\n================================================================================\nTarget //:hello_test up-to-date:\n  bazel-bin/hello_test\nINFO: Elapsed time: 4.190s, Critical Path: 3.05s\nINFO: 27 processes: 8 internal, 19 linux-sandbox.\nINFO: Build completed successfully, 27 total actions\n//:hello_test                                                     PASSED in 0.1s\n\nINFO: Build completed successfully, 27 total actions\n
\n\nCongratulations! You've successfully built and run a test binary using\nGoogleTest.\n\n## Next steps\n\n* [Check out the Primer](primer.md) to start learning how to write simple\n tests.\n* [See the code samples](samples.md) for more examples showing how to use a\n variety of GoogleTest features.\n" }, { "path": "3rd/googletest-1.12.1/docs/quickstart-cmake.md", "content": "# Quickstart: Building with CMake\n\nThis tutorial aims to get you up and running with GoogleTest using CMake. If\nyou're using GoogleTest for the first time or need a refresher, we recommend\nthis tutorial as a starting point. If your project uses Bazel, see the\n[Quickstart for Bazel](quickstart-bazel.md) instead.\n\n## Prerequisites\n\nTo complete this tutorial, you'll need:\n\n* A compatible operating system (e.g. Linux, macOS, Windows).\n* A compatible C++ compiler that supports at least C++11.\n* [CMake](https://cmake.org/) and a compatible build tool for building the\n project.\n * Compatible build tools include\n [Make](https://www.gnu.org/software/make/),\n [Ninja](https://ninja-build.org/), and others - see\n [CMake Generators](https://cmake.org/cmake/help/latest/manual/cmake-generators.7.html)\n for more information.\n\nSee [Supported Platforms](platforms.md) for more information about platforms\ncompatible with GoogleTest.\n\nIf you don't already have CMake installed, see the\n[CMake installation guide](https://cmake.org/install).\n\n{: .callout .note}\nNote: The terminal commands in this tutorial show a Unix shell prompt, but the\ncommands work on the Windows command line as well.\n\n## Set up a project\n\nCMake uses a file named `CMakeLists.txt` to configure the build system for a\nproject. You'll use this file to set up your project and declare a dependency on\nGoogleTest.\n\nFirst, create a directory for your project:\n\n```\n$ mkdir my_project && cd my_project\n```\n\nNext, you'll create the `CMakeLists.txt` file and declare a dependency on\nGoogleTest. There are many ways to express dependencies in the CMake ecosystem;\nin this quickstart, you'll use the\n[`FetchContent` CMake module](https://cmake.org/cmake/help/latest/module/FetchContent.html).\nTo do this, in your project directory (`my_project`), create a file named\n`CMakeLists.txt` with the following contents:\n\n```cmake\ncmake_minimum_required(VERSION 3.14)\nproject(my_project)\n\n# GoogleTest requires at least C++11\nset(CMAKE_CXX_STANDARD 11)\n\ninclude(FetchContent)\nFetchContent_Declare(\n googletest\n URL https://github.com/google/googletest/archive/609281088cfefc76f9d0ce82e1ff6c30cc3591e5.zip\n)\n# For Windows: Prevent overriding the parent project's compiler/linker settings\nset(gtest_force_shared_crt ON CACHE BOOL \"\" FORCE)\nFetchContent_MakeAvailable(googletest)\n```\n\nThe above configuration declares a dependency on GoogleTest which is downloaded\nfrom GitHub. In the above example, `609281088cfefc76f9d0ce82e1ff6c30cc3591e5` is\nthe Git commit hash of the GoogleTest version to use; we recommend updating the\nhash often to point to the latest version.\n\nFor more information about how to create `CMakeLists.txt` files, see the\n[CMake Tutorial](https://cmake.org/cmake/help/latest/guide/tutorial/index.html).\n\n## Create and run a binary\n\nWith GoogleTest declared as a dependency, you can use GoogleTest code within\nyour own project.\n\nAs an example, create a file named `hello_test.cc` in your `my_project`\ndirectory with the following contents:\n\n```cpp\n#include \n\n// Demonstrate some basic assertions.\nTEST(HelloTest, BasicAssertions) {\n // Expect two strings not to be equal.\n EXPECT_STRNE(\"hello\", \"world\");\n // Expect equality.\n EXPECT_EQ(7 * 6, 42);\n}\n```\n\nGoogleTest provides [assertions](primer.md#assertions) that you use to test the\nbehavior of your code. The above sample includes the main GoogleTest header file\nand demonstrates some basic assertions.\n\nTo build the code, add the following to the end of your `CMakeLists.txt` file:\n\n```cmake\nenable_testing()\n\nadd_executable(\n hello_test\n hello_test.cc\n)\ntarget_link_libraries(\n hello_test\n gtest_main\n)\n\ninclude(GoogleTest)\ngtest_discover_tests(hello_test)\n```\n\nThe above configuration enables testing in CMake, declares the C++ test binary\nyou want to build (`hello_test`), and links it to GoogleTest (`gtest_main`). The\nlast two lines enable CMake's test runner to discover the tests included in the\nbinary, using the\n[`GoogleTest` CMake module](https://cmake.org/cmake/help/git-stage/module/GoogleTest.html).\n\nNow you can build and run your test:\n\n
\nmy_project$ cmake -S . -B build\n-- The C compiler identification is GNU 10.2.1\n-- The CXX compiler identification is GNU 10.2.1\n...\n-- Build files have been written to: .../my_project/build\n\nmy_project$ cmake --build build\nScanning dependencies of target gtest\n...\n[100%] Built target gmock_main\n\nmy_project$ cd build && ctest\nTest project .../my_project/build\n    Start 1: HelloTest.BasicAssertions\n1/1 Test #1: HelloTest.BasicAssertions ........   Passed    0.00 sec\n\n100% tests passed, 0 tests failed out of 1\n\nTotal Test time (real) =   0.01 sec\n
\n\nCongratulations! You've successfully built and run a test binary using\nGoogleTest.\n\n## Next steps\n\n* [Check out the Primer](primer.md) to start learning how to write simple\n tests.\n* [See the code samples](samples.md) for more examples showing how to use a\n variety of GoogleTest features.\n" }, { "path": "3rd/googletest-1.12.1/docs/reference/actions.md", "content": "# Actions Reference\n\n[**Actions**](../gmock_for_dummies.md#actions-what-should-it-do) specify what a\nmock function should do when invoked. This page lists the built-in actions\nprovided by GoogleTest. All actions are defined in the `::testing` namespace.\n\n## Returning a Value\n\n| Action | Description |\n| :-------------------------------- | :-------------------------------------------- |\n| `Return()` | Return from a `void` mock function. |\n| `Return(value)` | Return `value`. If the type of `value` is different to the mock function's return type, `value` is converted to the latter type at the time the expectation is set, not when the action is executed. |\n| `ReturnArg()` | Return the `N`-th (0-based) argument. |\n| `ReturnNew(a1, ..., ak)` | Return `new T(a1, ..., ak)`; a different object is created each time. |\n| `ReturnNull()` | Return a null pointer. |\n| `ReturnPointee(ptr)` | Return the value pointed to by `ptr`. |\n| `ReturnRef(variable)` | Return a reference to `variable`. |\n| `ReturnRefOfCopy(value)` | Return a reference to a copy of `value`; the copy lives as long as the action. |\n| `ReturnRoundRobin({a1, ..., ak})` | Each call will return the next `ai` in the list, starting at the beginning when the end of the list is reached. |\n\n## Side Effects\n\n| Action | Description |\n| :--------------------------------- | :-------------------------------------- |\n| `Assign(&variable, value)` | Assign `value` to variable. |\n| `DeleteArg()` | Delete the `N`-th (0-based) argument, which must be a pointer. |\n| `SaveArg(pointer)` | Save the `N`-th (0-based) argument to `*pointer`. |\n| `SaveArgPointee(pointer)` | Save the value pointed to by the `N`-th (0-based) argument to `*pointer`. |\n| `SetArgReferee(value)` | Assign `value` to the variable referenced by the `N`-th (0-based) argument. |\n| `SetArgPointee(value)` | Assign `value` to the variable pointed by the `N`-th (0-based) argument. |\n| `SetArgumentPointee(value)` | Same as `SetArgPointee(value)`. Deprecated. Will be removed in v1.7.0. |\n| `SetArrayArgument(first, last)` | Copies the elements in source range [`first`, `last`) to the array pointed to by the `N`-th (0-based) argument, which can be either a pointer or an iterator. The action does not take ownership of the elements in the source range. |\n| `SetErrnoAndReturn(error, value)` | Set `errno` to `error` and return `value`. |\n| `Throw(exception)` | Throws the given exception, which can be any copyable value. Available since v1.1.0. |\n\n## Using a Function, Functor, or Lambda as an Action\n\nIn the following, by \"callable\" we mean a free function, `std::function`,\nfunctor, or lambda.\n\n| Action | Description |\n| :---------------------------------- | :------------------------------------- |\n| `f` | Invoke `f` with the arguments passed to the mock function, where `f` is a callable. |\n| `Invoke(f)` | Invoke `f` with the arguments passed to the mock function, where `f` can be a global/static function or a functor. |\n| `Invoke(object_pointer, &class::method)` | Invoke the method on the object with the arguments passed to the mock function. |\n| `InvokeWithoutArgs(f)` | Invoke `f`, which can be a global/static function or a functor. `f` must take no arguments. |\n| `InvokeWithoutArgs(object_pointer, &class::method)` | Invoke the method on the object, which takes no arguments. |\n| `InvokeArgument(arg1, arg2, ..., argk)` | Invoke the mock function's `N`-th (0-based) argument, which must be a function or a functor, with the `k` arguments. |\n\nThe return value of the invoked function is used as the return value of the\naction.\n\nWhen defining a callable to be used with `Invoke*()`, you can declare any unused\nparameters as `Unused`:\n\n```cpp\nusing ::testing::Invoke;\ndouble Distance(Unused, double x, double y) { return sqrt(x*x + y*y); }\n...\nEXPECT_CALL(mock, Foo(\"Hi\", _, _)).WillOnce(Invoke(Distance));\n```\n\n`Invoke(callback)` and `InvokeWithoutArgs(callback)` take ownership of\n`callback`, which must be permanent. The type of `callback` must be a base\ncallback type instead of a derived one, e.g.\n\n```cpp\n BlockingClosure* done = new BlockingClosure;\n ... Invoke(done) ...; // This won't compile!\n\n Closure* done2 = new BlockingClosure;\n ... Invoke(done2) ...; // This works.\n```\n\nIn `InvokeArgument(...)`, if an argument needs to be passed by reference,\nwrap it inside `std::ref()`. For example,\n\n```cpp\nusing ::testing::InvokeArgument;\n...\nInvokeArgument<2>(5, string(\"Hi\"), std::ref(foo))\n```\n\ncalls the mock function's #2 argument, passing to it `5` and `string(\"Hi\")` by\nvalue, and `foo` by reference.\n\n## Default Action\n\n| Action | Description |\n| :------------ | :----------------------------------------------------- |\n| `DoDefault()` | Do the default action (specified by `ON_CALL()` or the built-in one). |\n\n{: .callout .note}\n**Note:** due to technical reasons, `DoDefault()` cannot be used inside a\ncomposite action - trying to do so will result in a run-time error.\n\n## Composite Actions\n\n| Action | Description |\n| :----------------------------- | :------------------------------------------ |\n| `DoAll(a1, a2, ..., an)` | Do all actions `a1` to `an` and return the result of `an` in each invocation. The first `n - 1` sub-actions must return void and will receive a readonly view of the arguments. |\n| `IgnoreResult(a)` | Perform action `a` and ignore its result. `a` must not return void. |\n| `WithArg(a)` | Pass the `N`-th (0-based) argument of the mock function to action `a` and perform it. |\n| `WithArgs(a)` | Pass the selected (0-based) arguments of the mock function to action `a` and perform it. |\n| `WithoutArgs(a)` | Perform action `a` without any arguments. |\n\n## Defining Actions\n\n| Macro | Description |\n| :--------------------------------- | :-------------------------------------- |\n| `ACTION(Sum) { return arg0 + arg1; }` | Defines an action `Sum()` to return the sum of the mock function's argument #0 and #1. |\n| `ACTION_P(Plus, n) { return arg0 + n; }` | Defines an action `Plus(n)` to return the sum of the mock function's argument #0 and `n`. |\n| `ACTION_Pk(Foo, p1, ..., pk) { statements; }` | Defines a parameterized action `Foo(p1, ..., pk)` to execute the given `statements`. |\n\nThe `ACTION*` macros cannot be used inside a function or class.\n" }, { "path": "3rd/googletest-1.12.1/docs/reference/assertions.md", "content": "# Assertions Reference\n\nThis page lists the assertion macros provided by GoogleTest for verifying code\nbehavior. To use them, include the header `gtest/gtest.h`.\n\nThe majority of the macros listed below come as a pair with an `EXPECT_` variant\nand an `ASSERT_` variant. Upon failure, `EXPECT_` macros generate nonfatal\nfailures and allow the current function to continue running, while `ASSERT_`\nmacros generate fatal failures and abort the current function.\n\nAll assertion macros support streaming a custom failure message into them with\nthe `<<` operator, for example:\n\n```cpp\nEXPECT_TRUE(my_condition) << \"My condition is not true\";\n```\n\nAnything that can be streamed to an `ostream` can be streamed to an assertion\nmacro—in particular, C strings and string objects. If a wide string (`wchar_t*`,\n`TCHAR*` in `UNICODE` mode on Windows, or `std::wstring`) is streamed to an\nassertion, it will be translated to UTF-8 when printed.\n\n## Explicit Success and Failure {#success-failure}\n\nThe assertions in this section generate a success or failure directly instead of\ntesting a value or expression. These are useful when control flow, rather than a\nBoolean expression, determines the test's success or failure, as shown by the\nfollowing example:\n\n```c++\nswitch(expression) {\n case 1:\n ... some checks ...\n case 2:\n ... some other checks ...\n default:\n FAIL() << \"We shouldn't get here.\";\n}\n```\n\n### SUCCEED {#SUCCEED}\n\n`SUCCEED()`\n\nGenerates a success. This *does not* make the overall test succeed. A test is\nconsidered successful only if none of its assertions fail during its execution.\n\nThe `SUCCEED` assertion is purely documentary and currently doesn't generate any\nuser-visible output. However, we may add `SUCCEED` messages to GoogleTest output\nin the future.\n\n### FAIL {#FAIL}\n\n`FAIL()`\n\nGenerates a fatal failure, which returns from the current function.\n\nCan only be used in functions that return `void`. See\n[Assertion Placement](../advanced.md#assertion-placement) for more information.\n\n### ADD_FAILURE {#ADD_FAILURE}\n\n`ADD_FAILURE()`\n\nGenerates a nonfatal failure, which allows the current function to continue\nrunning.\n\n### ADD_FAILURE_AT {#ADD_FAILURE_AT}\n\n`ADD_FAILURE_AT(`*`file_path`*`,`*`line_number`*`)`\n\nGenerates a nonfatal failure at the file and line number specified.\n\n## Generalized Assertion {#generalized}\n\nThe following assertion allows [matchers](matchers.md) to be used to verify\nvalues.\n\n### EXPECT_THAT {#EXPECT_THAT}\n\n`EXPECT_THAT(`*`value`*`,`*`matcher`*`)` \\\n`ASSERT_THAT(`*`value`*`,`*`matcher`*`)`\n\nVerifies that *`value`* matches the [matcher](matchers.md) *`matcher`*.\n\nFor example, the following code verifies that the string `value1` starts with\n`\"Hello\"`, `value2` matches a regular expression, and `value3` is between 5 and\n10:\n\n```cpp\n#include \"gmock/gmock.h\"\n\nusing ::testing::AllOf;\nusing ::testing::Gt;\nusing ::testing::Lt;\nusing ::testing::MatchesRegex;\nusing ::testing::StartsWith;\n\n...\nEXPECT_THAT(value1, StartsWith(\"Hello\"));\nEXPECT_THAT(value2, MatchesRegex(\"Line \\\\d+\"));\nASSERT_THAT(value3, AllOf(Gt(5), Lt(10)));\n```\n\nMatchers enable assertions of this form to read like English and generate\ninformative failure messages. For example, if the above assertion on `value1`\nfails, the resulting message will be similar to the following:\n\n```\nValue of: value1\n Actual: \"Hi, world!\"\nExpected: starts with \"Hello\"\n```\n\nGoogleTest provides a built-in library of matchers—see the\n[Matchers Reference](matchers.md). It is also possible to write your own\nmatchers—see [Writing New Matchers Quickly](../gmock_cook_book.md#NewMatchers).\nThe use of matchers makes `EXPECT_THAT` a powerful, extensible assertion.\n\n*The idea for this assertion was borrowed from Joe Walnes' Hamcrest project,\nwhich adds `assertThat()` to JUnit.*\n\n## Boolean Conditions {#boolean}\n\nThe following assertions test Boolean conditions.\n\n### EXPECT_TRUE {#EXPECT_TRUE}\n\n`EXPECT_TRUE(`*`condition`*`)` \\\n`ASSERT_TRUE(`*`condition`*`)`\n\nVerifies that *`condition`* is true.\n\n### EXPECT_FALSE {#EXPECT_FALSE}\n\n`EXPECT_FALSE(`*`condition`*`)` \\\n`ASSERT_FALSE(`*`condition`*`)`\n\nVerifies that *`condition`* is false.\n\n## Binary Comparison {#binary-comparison}\n\nThe following assertions compare two values. The value arguments must be\ncomparable by the assertion's comparison operator, otherwise a compiler error\nwill result.\n\nIf an argument supports the `<<` operator, it will be called to print the\nargument when the assertion fails. Otherwise, GoogleTest will attempt to print\nthem in the best way it can—see\n[Teaching GoogleTest How to Print Your Values](../advanced.md#teaching-googletest-how-to-print-your-values).\n\nArguments are always evaluated exactly once, so it's OK for the arguments to\nhave side effects. However, the argument evaluation order is undefined and\nprograms should not depend on any particular argument evaluation order.\n\nThese assertions work with both narrow and wide string objects (`string` and\n`wstring`).\n\nSee also the [Floating-Point Comparison](#floating-point) assertions to compare\nfloating-point numbers and avoid problems caused by rounding.\n\n### EXPECT_EQ {#EXPECT_EQ}\n\n`EXPECT_EQ(`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_EQ(`*`val1`*`,`*`val2`*`)`\n\nVerifies that *`val1`*`==`*`val2`*.\n\nDoes pointer equality on pointers. If used on two C strings, it tests if they\nare in the same memory location, not if they have the same value. Use\n[`EXPECT_STREQ`](#EXPECT_STREQ) to compare C strings (e.g. `const char*`) by\nvalue.\n\nWhen comparing a pointer to `NULL`, use `EXPECT_EQ(`*`ptr`*`, nullptr)` instead\nof `EXPECT_EQ(`*`ptr`*`, NULL)`.\n\n### EXPECT_NE {#EXPECT_NE}\n\n`EXPECT_NE(`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_NE(`*`val1`*`,`*`val2`*`)`\n\nVerifies that *`val1`*`!=`*`val2`*.\n\nDoes pointer equality on pointers. If used on two C strings, it tests if they\nare in different memory locations, not if they have different values. Use\n[`EXPECT_STRNE`](#EXPECT_STRNE) to compare C strings (e.g. `const char*`) by\nvalue.\n\nWhen comparing a pointer to `NULL`, use `EXPECT_NE(`*`ptr`*`, nullptr)` instead\nof `EXPECT_NE(`*`ptr`*`, NULL)`.\n\n### EXPECT_LT {#EXPECT_LT}\n\n`EXPECT_LT(`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_LT(`*`val1`*`,`*`val2`*`)`\n\nVerifies that *`val1`*`<`*`val2`*.\n\n### EXPECT_LE {#EXPECT_LE}\n\n`EXPECT_LE(`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_LE(`*`val1`*`,`*`val2`*`)`\n\nVerifies that *`val1`*`<=`*`val2`*.\n\n### EXPECT_GT {#EXPECT_GT}\n\n`EXPECT_GT(`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_GT(`*`val1`*`,`*`val2`*`)`\n\nVerifies that *`val1`*`>`*`val2`*.\n\n### EXPECT_GE {#EXPECT_GE}\n\n`EXPECT_GE(`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_GE(`*`val1`*`,`*`val2`*`)`\n\nVerifies that *`val1`*`>=`*`val2`*.\n\n## String Comparison {#c-strings}\n\nThe following assertions compare two **C strings**. To compare two `string`\nobjects, use [`EXPECT_EQ`](#EXPECT_EQ) or [`EXPECT_NE`](#EXPECT_NE) instead.\n\nThese assertions also accept wide C strings (`wchar_t*`). If a comparison of two\nwide strings fails, their values will be printed as UTF-8 narrow strings.\n\nTo compare a C string with `NULL`, use `EXPECT_EQ(`*`c_string`*`, nullptr)` or\n`EXPECT_NE(`*`c_string`*`, nullptr)`.\n\n### EXPECT_STREQ {#EXPECT_STREQ}\n\n`EXPECT_STREQ(`*`str1`*`,`*`str2`*`)` \\\n`ASSERT_STREQ(`*`str1`*`,`*`str2`*`)`\n\nVerifies that the two C strings *`str1`* and *`str2`* have the same contents.\n\n### EXPECT_STRNE {#EXPECT_STRNE}\n\n`EXPECT_STRNE(`*`str1`*`,`*`str2`*`)` \\\n`ASSERT_STRNE(`*`str1`*`,`*`str2`*`)`\n\nVerifies that the two C strings *`str1`* and *`str2`* have different contents.\n\n### EXPECT_STRCASEEQ {#EXPECT_STRCASEEQ}\n\n`EXPECT_STRCASEEQ(`*`str1`*`,`*`str2`*`)` \\\n`ASSERT_STRCASEEQ(`*`str1`*`,`*`str2`*`)`\n\nVerifies that the two C strings *`str1`* and *`str2`* have the same contents,\nignoring case.\n\n### EXPECT_STRCASENE {#EXPECT_STRCASENE}\n\n`EXPECT_STRCASENE(`*`str1`*`,`*`str2`*`)` \\\n`ASSERT_STRCASENE(`*`str1`*`,`*`str2`*`)`\n\nVerifies that the two C strings *`str1`* and *`str2`* have different contents,\nignoring case.\n\n## Floating-Point Comparison {#floating-point}\n\nThe following assertions compare two floating-point values.\n\nDue to rounding errors, it is very unlikely that two floating-point values will\nmatch exactly, so `EXPECT_EQ` is not suitable. In general, for floating-point\ncomparison to make sense, the user needs to carefully choose the error bound.\n\nGoogleTest also provides assertions that use a default error bound based on\nUnits in the Last Place (ULPs). To learn more about ULPs, see the article\n[Comparing Floating Point Numbers](https://randomascii.wordpress.com/2012/02/25/comparing-floating-point-numbers-2012-edition/).\n\n### EXPECT_FLOAT_EQ {#EXPECT_FLOAT_EQ}\n\n`EXPECT_FLOAT_EQ(`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_FLOAT_EQ(`*`val1`*`,`*`val2`*`)`\n\nVerifies that the two `float` values *`val1`* and *`val2`* are approximately\nequal, to within 4 ULPs from each other.\n\n### EXPECT_DOUBLE_EQ {#EXPECT_DOUBLE_EQ}\n\n`EXPECT_DOUBLE_EQ(`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_DOUBLE_EQ(`*`val1`*`,`*`val2`*`)`\n\nVerifies that the two `double` values *`val1`* and *`val2`* are approximately\nequal, to within 4 ULPs from each other.\n\n### EXPECT_NEAR {#EXPECT_NEAR}\n\n`EXPECT_NEAR(`*`val1`*`,`*`val2`*`,`*`abs_error`*`)` \\\n`ASSERT_NEAR(`*`val1`*`,`*`val2`*`,`*`abs_error`*`)`\n\nVerifies that the difference between *`val1`* and *`val2`* does not exceed the\nabsolute error bound *`abs_error`*.\n\n## Exception Assertions {#exceptions}\n\nThe following assertions verify that a piece of code throws, or does not throw,\nan exception. Usage requires exceptions to be enabled in the build environment.\n\nNote that the piece of code under test can be a compound statement, for example:\n\n```cpp\nEXPECT_NO_THROW({\n int n = 5;\n DoSomething(&n);\n});\n```\n\n### EXPECT_THROW {#EXPECT_THROW}\n\n`EXPECT_THROW(`*`statement`*`,`*`exception_type`*`)` \\\n`ASSERT_THROW(`*`statement`*`,`*`exception_type`*`)`\n\nVerifies that *`statement`* throws an exception of type *`exception_type`*.\n\n### EXPECT_ANY_THROW {#EXPECT_ANY_THROW}\n\n`EXPECT_ANY_THROW(`*`statement`*`)` \\\n`ASSERT_ANY_THROW(`*`statement`*`)`\n\nVerifies that *`statement`* throws an exception of any type.\n\n### EXPECT_NO_THROW {#EXPECT_NO_THROW}\n\n`EXPECT_NO_THROW(`*`statement`*`)` \\\n`ASSERT_NO_THROW(`*`statement`*`)`\n\nVerifies that *`statement`* does not throw any exception.\n\n## Predicate Assertions {#predicates}\n\nThe following assertions enable more complex predicates to be verified while\nprinting a more clear failure message than if `EXPECT_TRUE` were used alone.\n\n### EXPECT_PRED* {#EXPECT_PRED}\n\n`EXPECT_PRED1(`*`pred`*`,`*`val1`*`)` \\\n`EXPECT_PRED2(`*`pred`*`,`*`val1`*`,`*`val2`*`)` \\\n`EXPECT_PRED3(`*`pred`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`)` \\\n`EXPECT_PRED4(`*`pred`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`,`*`val4`*`)` \\\n`EXPECT_PRED5(`*`pred`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`,`*`val4`*`,`*`val5`*`)`\n\n`ASSERT_PRED1(`*`pred`*`,`*`val1`*`)` \\\n`ASSERT_PRED2(`*`pred`*`,`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_PRED3(`*`pred`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`)` \\\n`ASSERT_PRED4(`*`pred`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`,`*`val4`*`)` \\\n`ASSERT_PRED5(`*`pred`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`,`*`val4`*`,`*`val5`*`)`\n\nVerifies that the predicate *`pred`* returns `true` when passed the given values\nas arguments.\n\nThe parameter *`pred`* is a function or functor that accepts as many arguments\nas the corresponding macro accepts values. If *`pred`* returns `true` for the\ngiven arguments, the assertion succeeds, otherwise the assertion fails.\n\nWhen the assertion fails, it prints the value of each argument. Arguments are\nalways evaluated exactly once.\n\nAs an example, see the following code:\n\n```cpp\n// Returns true if m and n have no common divisors except 1.\nbool MutuallyPrime(int m, int n) { ... }\n...\nconst int a = 3;\nconst int b = 4;\nconst int c = 10;\n...\nEXPECT_PRED2(MutuallyPrime, a, b); // Succeeds\nEXPECT_PRED2(MutuallyPrime, b, c); // Fails\n```\n\nIn the above example, the first assertion succeeds, and the second fails with\nthe following message:\n\n```\nMutuallyPrime(b, c) is false, where\nb is 4\nc is 10\n```\n\nNote that if the given predicate is an overloaded function or a function\ntemplate, the assertion macro might not be able to determine which version to\nuse, and it might be necessary to explicitly specify the type of the function.\nFor example, for a Boolean function `IsPositive()` overloaded to take either a\nsingle `int` or `double` argument, it would be necessary to write one of the\nfollowing:\n\n```cpp\nEXPECT_PRED1(static_cast(IsPositive), 5);\nEXPECT_PRED1(static_cast(IsPositive), 3.14);\n```\n\nWriting simply `EXPECT_PRED1(IsPositive, 5);` would result in a compiler error.\nSimilarly, to use a template function, specify the template arguments:\n\n```cpp\ntemplate \nbool IsNegative(T x) {\n return x < 0;\n}\n...\nEXPECT_PRED1(IsNegative, -5); // Must specify type for IsNegative\n```\n\nIf a template has multiple parameters, wrap the predicate in parentheses so the\nmacro arguments are parsed correctly:\n\n```cpp\nASSERT_PRED2((MyPredicate), 5, 0);\n```\n\n### EXPECT_PRED_FORMAT* {#EXPECT_PRED_FORMAT}\n\n`EXPECT_PRED_FORMAT1(`*`pred_formatter`*`,`*`val1`*`)` \\\n`EXPECT_PRED_FORMAT2(`*`pred_formatter`*`,`*`val1`*`,`*`val2`*`)` \\\n`EXPECT_PRED_FORMAT3(`*`pred_formatter`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`)` \\\n`EXPECT_PRED_FORMAT4(`*`pred_formatter`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`,`*`val4`*`)`\n\\\n`EXPECT_PRED_FORMAT5(`*`pred_formatter`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`,`*`val4`*`,`*`val5`*`)`\n\n`ASSERT_PRED_FORMAT1(`*`pred_formatter`*`,`*`val1`*`)` \\\n`ASSERT_PRED_FORMAT2(`*`pred_formatter`*`,`*`val1`*`,`*`val2`*`)` \\\n`ASSERT_PRED_FORMAT3(`*`pred_formatter`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`)` \\\n`ASSERT_PRED_FORMAT4(`*`pred_formatter`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`,`*`val4`*`)`\n\\\n`ASSERT_PRED_FORMAT5(`*`pred_formatter`*`,`*`val1`*`,`*`val2`*`,`*`val3`*`,`*`val4`*`,`*`val5`*`)`\n\nVerifies that the predicate *`pred_formatter`* succeeds when passed the given\nvalues as arguments.\n\nThe parameter *`pred_formatter`* is a *predicate-formatter*, which is a function\nor functor with the signature:\n\n```cpp\ntesting::AssertionResult PredicateFormatter(const char* expr1,\n const char* expr2,\n ...\n const char* exprn,\n T1 val1,\n T2 val2,\n ...\n Tn valn);\n```\n\nwhere *`val1`*, *`val2`*, ..., *`valn`* are the values of the predicate\narguments, and *`expr1`*, *`expr2`*, ..., *`exprn`* are the corresponding\nexpressions as they appear in the source code. The types `T1`, `T2`, ..., `Tn`\ncan be either value types or reference types; if an argument has type `T`, it\ncan be declared as either `T` or `const T&`, whichever is appropriate. For more\nabout the return type `testing::AssertionResult`, see\n[Using a Function That Returns an AssertionResult](../advanced.md#using-a-function-that-returns-an-assertionresult).\n\nAs an example, see the following code:\n\n```cpp\n// Returns the smallest prime common divisor of m and n,\n// or 1 when m and n are mutually prime.\nint SmallestPrimeCommonDivisor(int m, int n) { ... }\n\n// Returns true if m and n have no common divisors except 1.\nbool MutuallyPrime(int m, int n) { ... }\n\n// A predicate-formatter for asserting that two integers are mutually prime.\ntesting::AssertionResult AssertMutuallyPrime(const char* m_expr,\n const char* n_expr,\n int m,\n int n) {\n if (MutuallyPrime(m, n)) return testing::AssertionSuccess();\n\n return testing::AssertionFailure() << m_expr << \" and \" << n_expr\n << \" (\" << m << \" and \" << n << \") are not mutually prime, \"\n << \"as they have a common divisor \" << SmallestPrimeCommonDivisor(m, n);\n}\n\n...\nconst int a = 3;\nconst int b = 4;\nconst int c = 10;\n...\nEXPECT_PRED_FORMAT2(AssertMutuallyPrime, a, b); // Succeeds\nEXPECT_PRED_FORMAT2(AssertMutuallyPrime, b, c); // Fails\n```\n\nIn the above example, the final assertion fails and the predicate-formatter\nproduces the following failure message:\n\n```\nb and c (4 and 10) are not mutually prime, as they have a common divisor 2\n```\n\n## Windows HRESULT Assertions {#HRESULT}\n\nThe following assertions test for `HRESULT` success or failure. For example:\n\n```cpp\nCComPtr shell;\nASSERT_HRESULT_SUCCEEDED(shell.CoCreateInstance(L\"Shell.Application\"));\nCComVariant empty;\nASSERT_HRESULT_SUCCEEDED(shell->ShellExecute(CComBSTR(url), empty, empty, empty, empty));\n```\n\nThe generated output contains the human-readable error message associated with\nthe returned `HRESULT` code.\n\n### EXPECT_HRESULT_SUCCEEDED {#EXPECT_HRESULT_SUCCEEDED}\n\n`EXPECT_HRESULT_SUCCEEDED(`*`expression`*`)` \\\n`ASSERT_HRESULT_SUCCEEDED(`*`expression`*`)`\n\nVerifies that *`expression`* is a success `HRESULT`.\n\n### EXPECT_HRESULT_FAILED {#EXPECT_HRESULT_FAILED}\n\n`EXPECT_HRESULT_FAILED(`*`expression`*`)` \\\n`EXPECT_HRESULT_FAILED(`*`expression`*`)`\n\nVerifies that *`expression`* is a failure `HRESULT`.\n\n## Death Assertions {#death}\n\nThe following assertions verify that a piece of code causes the process to\nterminate. For context, see [Death Tests](../advanced.md#death-tests).\n\nThese assertions spawn a new process and execute the code under test in that\nprocess. How that happens depends on the platform and the variable\n`::testing::GTEST_FLAG(death_test_style)`, which is initialized from the\ncommand-line flag `--gtest_death_test_style`.\n\n* On POSIX systems, `fork()` (or `clone()` on Linux) is used to spawn the\n child, after which:\n * If the variable's value is `\"fast\"`, the death test statement is\n immediately executed.\n * If the variable's value is `\"threadsafe\"`, the child process re-executes\n the unit test binary just as it was originally invoked, but with some\n extra flags to cause just the single death test under consideration to\n be run.\n* On Windows, the child is spawned using the `CreateProcess()` API, and\n re-executes the binary to cause just the single death test under\n consideration to be run - much like the `\"threadsafe\"` mode on POSIX.\n\nOther values for the variable are illegal and will cause the death test to fail.\nCurrently, the flag's default value is\n**`\"fast\"`**.\n\nIf the death test statement runs to completion without dying, the child process\nwill nonetheless terminate, and the assertion fails.\n\nNote that the piece of code under test can be a compound statement, for example:\n\n```cpp\nEXPECT_DEATH({\n int n = 5;\n DoSomething(&n);\n}, \"Error on line .* of DoSomething()\");\n```\n\n### EXPECT_DEATH {#EXPECT_DEATH}\n\n`EXPECT_DEATH(`*`statement`*`,`*`matcher`*`)` \\\n`ASSERT_DEATH(`*`statement`*`,`*`matcher`*`)`\n\nVerifies that *`statement`* causes the process to terminate with a nonzero exit\nstatus and produces `stderr` output that matches *`matcher`*.\n\nThe parameter *`matcher`* is either a [matcher](matchers.md) for a `const\nstd::string&`, or a regular expression (see\n[Regular Expression Syntax](../advanced.md#regular-expression-syntax))—a bare\nstring *`s`* (with no matcher) is treated as\n[`ContainsRegex(s)`](matchers.md#string-matchers), **not**\n[`Eq(s)`](matchers.md#generic-comparison).\n\nFor example, the following code verifies that calling `DoSomething(42)` causes\nthe process to die with an error message that contains the text `My error`:\n\n```cpp\nEXPECT_DEATH(DoSomething(42), \"My error\");\n```\n\n### EXPECT_DEATH_IF_SUPPORTED {#EXPECT_DEATH_IF_SUPPORTED}\n\n`EXPECT_DEATH_IF_SUPPORTED(`*`statement`*`,`*`matcher`*`)` \\\n`ASSERT_DEATH_IF_SUPPORTED(`*`statement`*`,`*`matcher`*`)`\n\nIf death tests are supported, behaves the same as\n[`EXPECT_DEATH`](#EXPECT_DEATH). Otherwise, verifies nothing.\n\n### EXPECT_DEBUG_DEATH {#EXPECT_DEBUG_DEATH}\n\n`EXPECT_DEBUG_DEATH(`*`statement`*`,`*`matcher`*`)` \\\n`ASSERT_DEBUG_DEATH(`*`statement`*`,`*`matcher`*`)`\n\nIn debug mode, behaves the same as [`EXPECT_DEATH`](#EXPECT_DEATH). When not in\ndebug mode (i.e. `NDEBUG` is defined), just executes *`statement`*.\n\n### EXPECT_EXIT {#EXPECT_EXIT}\n\n`EXPECT_EXIT(`*`statement`*`,`*`predicate`*`,`*`matcher`*`)` \\\n`ASSERT_EXIT(`*`statement`*`,`*`predicate`*`,`*`matcher`*`)`\n\nVerifies that *`statement`* causes the process to terminate with an exit status\nthat satisfies *`predicate`*, and produces `stderr` output that matches\n*`matcher`*.\n\nThe parameter *`predicate`* is a function or functor that accepts an `int` exit\nstatus and returns a `bool`. GoogleTest provides two predicates to handle common\ncases:\n\n```cpp\n// Returns true if the program exited normally with the given exit status code.\n::testing::ExitedWithCode(exit_code);\n\n// Returns true if the program was killed by the given signal.\n// Not available on Windows.\n::testing::KilledBySignal(signal_number);\n```\n\nThe parameter *`matcher`* is either a [matcher](matchers.md) for a `const\nstd::string&`, or a regular expression (see\n[Regular Expression Syntax](../advanced.md#regular-expression-syntax))—a bare\nstring *`s`* (with no matcher) is treated as\n[`ContainsRegex(s)`](matchers.md#string-matchers), **not**\n[`Eq(s)`](matchers.md#generic-comparison).\n\nFor example, the following code verifies that calling `NormalExit()` causes the\nprocess to print a message containing the text `Success` to `stderr` and exit\nwith exit status code 0:\n\n```cpp\nEXPECT_EXIT(NormalExit(), testing::ExitedWithCode(0), \"Success\");\n```\n" }, { "path": "3rd/googletest-1.12.1/docs/reference/matchers.md", "content": "# Matchers Reference\n\nA **matcher** matches a *single* argument. You can use it inside `ON_CALL()` or\n`EXPECT_CALL()`, or use it to validate a value directly using two macros:\n\n| Macro | Description |\n| :----------------------------------- | :------------------------------------ |\n| `EXPECT_THAT(actual_value, matcher)` | Asserts that `actual_value` matches `matcher`. |\n| `ASSERT_THAT(actual_value, matcher)` | The same as `EXPECT_THAT(actual_value, matcher)`, except that it generates a **fatal** failure. |\n\n{: .callout .warning}\n**WARNING:** Equality matching via `EXPECT_THAT(actual_value, expected_value)`\nis supported, however note that implicit conversions can cause surprising\nresults. For example, `EXPECT_THAT(some_bool, \"some string\")` will compile and\nmay pass unintentionally.\n\n**BEST PRACTICE:** Prefer to make the comparison explicit via\n`EXPECT_THAT(actual_value, Eq(expected_value))` or `EXPECT_EQ(actual_value,\nexpected_value)`.\n\nBuilt-in matchers (where `argument` is the function argument, e.g.\n`actual_value` in the example above, or when used in the context of\n`EXPECT_CALL(mock_object, method(matchers))`, the arguments of `method`) are\ndivided into several categories. All matchers are defined in the `::testing`\nnamespace unless otherwise noted.\n\n## Wildcard\n\nMatcher | Description\n:-------------------------- | :-----------------------------------------------\n`_` | `argument` can be any value of the correct type.\n`A()` or `An()` | `argument` can be any value of type `type`.\n\n## Generic Comparison\n\n| Matcher | Description |\n| :--------------------- | :-------------------------------------------------- |\n| `Eq(value)` or `value` | `argument == value` |\n| `Ge(value)` | `argument >= value` |\n| `Gt(value)` | `argument > value` |\n| `Le(value)` | `argument <= value` |\n| `Lt(value)` | `argument < value` |\n| `Ne(value)` | `argument != value` |\n| `IsFalse()` | `argument` evaluates to `false` in a Boolean context. |\n| `IsTrue()` | `argument` evaluates to `true` in a Boolean context. |\n| `IsNull()` | `argument` is a `NULL` pointer (raw or smart). |\n| `NotNull()` | `argument` is a non-null pointer (raw or smart). |\n| `Optional(m)` | `argument` is `optional<>` that contains a value matching `m`. (For testing whether an `optional<>` is set, check for equality with `nullopt`. You may need to use `Eq(nullopt)` if the inner type doesn't have `==`.)|\n| `VariantWith(m)` | `argument` is `variant<>` that holds the alternative of type T with a value matching `m`. |\n| `Ref(variable)` | `argument` is a reference to `variable`. |\n| `TypedEq(value)` | `argument` has type `type` and is equal to `value`. You may need to use this instead of `Eq(value)` when the mock function is overloaded. |\n\nExcept `Ref()`, these matchers make a *copy* of `value` in case it's modified or\ndestructed later. If the compiler complains that `value` doesn't have a public\ncopy constructor, try wrap it in `std::ref()`, e.g.\n`Eq(std::ref(non_copyable_value))`. If you do that, make sure\n`non_copyable_value` is not changed afterwards, or the meaning of your matcher\nwill be changed.\n\n`IsTrue` and `IsFalse` are useful when you need to use a matcher, or for types\nthat can be explicitly converted to Boolean, but are not implicitly converted to\nBoolean. In other cases, you can use the basic\n[`EXPECT_TRUE` and `EXPECT_FALSE`](assertions.md#boolean) assertions.\n\n## Floating-Point Matchers {#FpMatchers}\n\n| Matcher | Description |\n| :------------------------------- | :--------------------------------- |\n| `DoubleEq(a_double)` | `argument` is a `double` value approximately equal to `a_double`, treating two NaNs as unequal. |\n| `FloatEq(a_float)` | `argument` is a `float` value approximately equal to `a_float`, treating two NaNs as unequal. |\n| `NanSensitiveDoubleEq(a_double)` | `argument` is a `double` value approximately equal to `a_double`, treating two NaNs as equal. |\n| `NanSensitiveFloatEq(a_float)` | `argument` is a `float` value approximately equal to `a_float`, treating two NaNs as equal. |\n| `IsNan()` | `argument` is any floating-point type with a NaN value. |\n\nThe above matchers use ULP-based comparison (the same as used in googletest).\nThey automatically pick a reasonable error bound based on the absolute value of\nthe expected value. `DoubleEq()` and `FloatEq()` conform to the IEEE standard,\nwhich requires comparing two NaNs for equality to return false. The\n`NanSensitive*` version instead treats two NaNs as equal, which is often what a\nuser wants.\n\n| Matcher | Description |\n| :------------------------------------------------ | :----------------------- |\n| `DoubleNear(a_double, max_abs_error)` | `argument` is a `double` value close to `a_double` (absolute error <= `max_abs_error`), treating two NaNs as unequal. |\n| `FloatNear(a_float, max_abs_error)` | `argument` is a `float` value close to `a_float` (absolute error <= `max_abs_error`), treating two NaNs as unequal. |\n| `NanSensitiveDoubleNear(a_double, max_abs_error)` | `argument` is a `double` value close to `a_double` (absolute error <= `max_abs_error`), treating two NaNs as equal. |\n| `NanSensitiveFloatNear(a_float, max_abs_error)` | `argument` is a `float` value close to `a_float` (absolute error <= `max_abs_error`), treating two NaNs as equal. |\n\n## String Matchers\n\nThe `argument` can be either a C string or a C++ string object:\n\n| Matcher | Description |\n| :---------------------- | :------------------------------------------------- |\n| `ContainsRegex(string)` | `argument` matches the given regular expression. |\n| `EndsWith(suffix)` | `argument` ends with string `suffix`. |\n| `HasSubstr(string)` | `argument` contains `string` as a sub-string. |\n| `IsEmpty()` | `argument` is an empty string. |\n| `MatchesRegex(string)` | `argument` matches the given regular expression with the match starting at the first character and ending at the last character. |\n| `StartsWith(prefix)` | `argument` starts with string `prefix`. |\n| `StrCaseEq(string)` | `argument` is equal to `string`, ignoring case. |\n| `StrCaseNe(string)` | `argument` is not equal to `string`, ignoring case. |\n| `StrEq(string)` | `argument` is equal to `string`. |\n| `StrNe(string)` | `argument` is not equal to `string`. |\n| `WhenBase64Unescaped(m)` | `argument` is a base-64 escaped string whose unescaped string matches `m`. |\n\n`ContainsRegex()` and `MatchesRegex()` take ownership of the `RE` object. They\nuse the regular expression syntax defined\n[here](../advanced.md#regular-expression-syntax). All of these matchers, except\n`ContainsRegex()` and `MatchesRegex()` work for wide strings as well.\n\n## Container Matchers\n\nMost STL-style containers support `==`, so you can use `Eq(expected_container)`\nor simply `expected_container` to match a container exactly. If you want to\nwrite the elements in-line, match them more flexibly, or get more informative\nmessages, you can use:\n\n| Matcher | Description |\n| :---------------------------------------- | :------------------------------- |\n| `BeginEndDistanceIs(m)` | `argument` is a container whose `begin()` and `end()` iterators are separated by a number of increments matching `m`. E.g. `BeginEndDistanceIs(2)` or `BeginEndDistanceIs(Lt(2))`. For containers that define a `size()` method, `SizeIs(m)` may be more efficient. |\n| `ContainerEq(container)` | The same as `Eq(container)` except that the failure message also includes which elements are in one container but not the other. |\n| `Contains(e)` | `argument` contains an element that matches `e`, which can be either a value or a matcher. |\n| `Contains(e).Times(n)` | `argument` contains elements that match `e`, which can be either a value or a matcher, and the number of matches is `n`, which can be either a value or a matcher. Unlike the plain `Contains` and `Each` this allows to check for arbitrary occurrences including testing for absence with `Contains(e).Times(0)`. |\n| `Each(e)` | `argument` is a container where *every* element matches `e`, which can be either a value or a matcher. |\n| `ElementsAre(e0, e1, ..., en)` | `argument` has `n + 1` elements, where the *i*-th element matches `ei`, which can be a value or a matcher. |\n| `ElementsAreArray({e0, e1, ..., en})`, `ElementsAreArray(a_container)`, `ElementsAreArray(begin, end)`, `ElementsAreArray(array)`, or `ElementsAreArray(array, count)` | The same as `ElementsAre()` except that the expected element values/matchers come from an initializer list, STL-style container, iterator range, or C-style array. |\n| `IsEmpty()` | `argument` is an empty container (`container.empty()`). |\n| `IsSubsetOf({e0, e1, ..., en})`, `IsSubsetOf(a_container)`, `IsSubsetOf(begin, end)`, `IsSubsetOf(array)`, or `IsSubsetOf(array, count)` | `argument` matches `UnorderedElementsAre(x0, x1, ..., xk)` for some subset `{x0, x1, ..., xk}` of the expected matchers. |\n| `IsSupersetOf({e0, e1, ..., en})`, `IsSupersetOf(a_container)`, `IsSupersetOf(begin, end)`, `IsSupersetOf(array)`, or `IsSupersetOf(array, count)` | Some subset of `argument` matches `UnorderedElementsAre(`expected matchers`)`. |\n| `Pointwise(m, container)`, `Pointwise(m, {e0, e1, ..., en})` | `argument` contains the same number of elements as in `container`, and for all i, (the i-th element in `argument`, the i-th element in `container`) match `m`, which is a matcher on 2-tuples. E.g. `Pointwise(Le(), upper_bounds)` verifies that each element in `argument` doesn't exceed the corresponding element in `upper_bounds`. See more detail below. |\n| `SizeIs(m)` | `argument` is a container whose size matches `m`. E.g. `SizeIs(2)` or `SizeIs(Lt(2))`. |\n| `UnorderedElementsAre(e0, e1, ..., en)` | `argument` has `n + 1` elements, and under *some* permutation of the elements, each element matches an `ei` (for a different `i`), which can be a value or a matcher. |\n| `UnorderedElementsAreArray({e0, e1, ..., en})`, `UnorderedElementsAreArray(a_container)`, `UnorderedElementsAreArray(begin, end)`, `UnorderedElementsAreArray(array)`, or `UnorderedElementsAreArray(array, count)` | The same as `UnorderedElementsAre()` except that the expected element values/matchers come from an initializer list, STL-style container, iterator range, or C-style array. |\n| `UnorderedPointwise(m, container)`, `UnorderedPointwise(m, {e0, e1, ..., en})` | Like `Pointwise(m, container)`, but ignores the order of elements. |\n| `WhenSorted(m)` | When `argument` is sorted using the `<` operator, it matches container matcher `m`. E.g. `WhenSorted(ElementsAre(1, 2, 3))` verifies that `argument` contains elements 1, 2, and 3, ignoring order. |\n| `WhenSortedBy(comparator, m)` | The same as `WhenSorted(m)`, except that the given comparator instead of `<` is used to sort `argument`. E.g. `WhenSortedBy(std::greater(), ElementsAre(3, 2, 1))`. |\n\n**Notes:**\n\n* These matchers can also match:\n 1. a native array passed by reference (e.g. in `Foo(const int (&a)[5])`),\n and\n 2. an array passed as a pointer and a count (e.g. in `Bar(const T* buffer,\n int len)` -- see [Multi-argument Matchers](#MultiArgMatchers)).\n* The array being matched may be multi-dimensional (i.e. its elements can be\n arrays).\n* `m` in `Pointwise(m, ...)` and `UnorderedPointwise(m, ...)` should be a\n matcher for `::std::tuple` where `T` and `U` are the element type of\n the actual container and the expected container, respectively. For example,\n to compare two `Foo` containers where `Foo` doesn't support `operator==`,\n one might write:\n\n ```cpp\n MATCHER(FooEq, \"\") {\n return std::get<0>(arg).Equals(std::get<1>(arg));\n }\n ...\n EXPECT_THAT(actual_foos, Pointwise(FooEq(), expected_foos));\n ```\n\n## Member Matchers\n\n| Matcher | Description |\n| :------------------------------ | :----------------------------------------- |\n| `Field(&class::field, m)` | `argument.field` (or `argument->field` when `argument` is a plain pointer) matches matcher `m`, where `argument` is an object of type _class_. |\n| `Field(field_name, &class::field, m)` | The same as the two-parameter version, but provides a better error message. |\n| `Key(e)` | `argument.first` matches `e`, which can be either a value or a matcher. E.g. `Contains(Key(Le(5)))` can verify that a `map` contains a key `<= 5`. |\n| `Pair(m1, m2)` | `argument` is an `std::pair` whose `first` field matches `m1` and `second` field matches `m2`. |\n| `FieldsAre(m...)` | `argument` is a compatible object where each field matches piecewise with the matchers `m...`. A compatible object is any that supports the `std::tuple_size`+`get(obj)` protocol. In C++17 and up this also supports types compatible with structured bindings, like aggregates. |\n| `Property(&class::property, m)` | `argument.property()` (or `argument->property()` when `argument` is a plain pointer) matches matcher `m`, where `argument` is an object of type _class_. The method `property()` must take no argument and be declared as `const`. |\n| `Property(property_name, &class::property, m)` | The same as the two-parameter version, but provides a better error message.\n\n**Notes:**\n\n* You can use `FieldsAre()` to match any type that supports structured\n bindings, such as `std::tuple`, `std::pair`, `std::array`, and aggregate\n types. For example:\n\n ```cpp\n std::tuple my_tuple{7, \"hello world\"};\n EXPECT_THAT(my_tuple, FieldsAre(Ge(0), HasSubstr(\"hello\")));\n\n struct MyStruct {\n int value = 42;\n std::string greeting = \"aloha\";\n };\n MyStruct s;\n EXPECT_THAT(s, FieldsAre(42, \"aloha\"));\n ```\n\n* Don't use `Property()` against member functions that you do not own, because\n taking addresses of functions is fragile and generally not part of the\n contract of the function.\n\n## Matching the Result of a Function, Functor, or Callback\n\n| Matcher | Description |\n| :--------------- | :------------------------------------------------ |\n| `ResultOf(f, m)` | `f(argument)` matches matcher `m`, where `f` is a function or functor. |\n| `ResultOf(result_description, f, m)` | The same as the two-parameter version, but provides a better error message.\n\n## Pointer Matchers\n\n| Matcher | Description |\n| :------------------------ | :---------------------------------------------- |\n| `Address(m)` | the result of `std::addressof(argument)` matches `m`. |\n| `Pointee(m)` | `argument` (either a smart pointer or a raw pointer) points to a value that matches matcher `m`. |\n| `Pointer(m)` | `argument` (either a smart pointer or a raw pointer) contains a pointer that matches `m`. `m` will match against the raw pointer regardless of the type of `argument`. |\n| `WhenDynamicCastTo(m)` | when `argument` is passed through `dynamic_cast()`, it matches matcher `m`. |\n\n## Multi-argument Matchers {#MultiArgMatchers}\n\nTechnically, all matchers match a *single* value. A \"multi-argument\" matcher is\njust one that matches a *tuple*. The following matchers can be used to match a\ntuple `(x, y)`:\n\nMatcher | Description\n:------ | :----------\n`Eq()` | `x == y`\n`Ge()` | `x >= y`\n`Gt()` | `x > y`\n`Le()` | `x <= y`\n`Lt()` | `x < y`\n`Ne()` | `x != y`\n\nYou can use the following selectors to pick a subset of the arguments (or\nreorder them) to participate in the matching:\n\n| Matcher | Description |\n| :------------------------- | :---------------------------------------------- |\n| `AllArgs(m)` | Equivalent to `m`. Useful as syntactic sugar in `.With(AllArgs(m))`. |\n| `Args(m)` | The tuple of the `k` selected (using 0-based indices) arguments matches `m`, e.g. `Args<1, 2>(Eq())`. |\n\n## Composite Matchers\n\nYou can make a matcher from one or more other matchers:\n\n| Matcher | Description |\n| :------------------------------- | :-------------------------------------- |\n| `AllOf(m1, m2, ..., mn)` | `argument` matches all of the matchers `m1` to `mn`. |\n| `AllOfArray({m0, m1, ..., mn})`, `AllOfArray(a_container)`, `AllOfArray(begin, end)`, `AllOfArray(array)`, or `AllOfArray(array, count)` | The same as `AllOf()` except that the matchers come from an initializer list, STL-style container, iterator range, or C-style array. |\n| `AnyOf(m1, m2, ..., mn)` | `argument` matches at least one of the matchers `m1` to `mn`. |\n| `AnyOfArray({m0, m1, ..., mn})`, `AnyOfArray(a_container)`, `AnyOfArray(begin, end)`, `AnyOfArray(array)`, or `AnyOfArray(array, count)` | The same as `AnyOf()` except that the matchers come from an initializer list, STL-style container, iterator range, or C-style array. |\n| `Not(m)` | `argument` doesn't match matcher `m`. |\n| `Conditional(cond, m1, m2)` | Matches matcher `m1` if `cond` evaluates to true, else matches `m2`.|\n\n## Adapters for Matchers\n\n| Matcher | Description |\n| :---------------------- | :------------------------------------ |\n| `MatcherCast(m)` | casts matcher `m` to type `Matcher`. |\n| `SafeMatcherCast(m)` | [safely casts](../gmock_cook_book.md#SafeMatcherCast) matcher `m` to type `Matcher`. |\n| `Truly(predicate)` | `predicate(argument)` returns something considered by C++ to be true, where `predicate` is a function or functor. |\n\n`AddressSatisfies(callback)` and `Truly(callback)` take ownership of `callback`,\nwhich must be a permanent callback.\n\n## Using Matchers as Predicates {#MatchersAsPredicatesCheat}\n\n| Matcher | Description |\n| :---------------------------- | :------------------------------------------ |\n| `Matches(m)(value)` | evaluates to `true` if `value` matches `m`. You can use `Matches(m)` alone as a unary functor. |\n| `ExplainMatchResult(m, value, result_listener)` | evaluates to `true` if `value` matches `m`, explaining the result to `result_listener`. |\n| `Value(value, m)` | evaluates to `true` if `value` matches `m`. |\n\n## Defining Matchers\n\n| Macro | Description |\n| :----------------------------------- | :------------------------------------ |\n| `MATCHER(IsEven, \"\") { return (arg % 2) == 0; }` | Defines a matcher `IsEven()` to match an even number. |\n| `MATCHER_P(IsDivisibleBy, n, \"\") { *result_listener << \"where the remainder is \" << (arg % n); return (arg % n) == 0; }` | Defines a matcher `IsDivisibleBy(n)` to match a number divisible by `n`. |\n| `MATCHER_P2(IsBetween, a, b, absl::StrCat(negation ? \"isn't\" : \"is\", \" between \", PrintToString(a), \" and \", PrintToString(b))) { return a <= arg && arg <= b; }` | Defines a matcher `IsBetween(a, b)` to match a value in the range [`a`, `b`]. |\n\n**Notes:**\n\n1. The `MATCHER*` macros cannot be used inside a function or class.\n2. The matcher body must be *purely functional* (i.e. it cannot have any side\n effect, and the result must not depend on anything other than the value\n being matched and the matcher parameters).\n3. You can use `PrintToString(x)` to convert a value `x` of any type to a\n string.\n4. You can use `ExplainMatchResult()` in a custom matcher to wrap another\n matcher, for example:\n\n ```cpp\n MATCHER_P(NestedPropertyMatches, matcher, \"\") {\n return ExplainMatchResult(matcher, arg.nested().property(), result_listener);\n }\n ```\n" }, { "path": "3rd/googletest-1.12.1/docs/reference/mocking.md", "content": "# Mocking Reference\n\nThis page lists the facilities provided by GoogleTest for creating and working\nwith mock objects. To use them, include the header\n`gmock/gmock.h`.\n\n## Macros {#macros}\n\nGoogleTest defines the following macros for working with mocks.\n\n### MOCK_METHOD {#MOCK_METHOD}\n\n`MOCK_METHOD(`*`return_type`*`,`*`method_name`*`, (`*`args...`*`));` \\\n`MOCK_METHOD(`*`return_type`*`,`*`method_name`*`, (`*`args...`*`),\n(`*`specs...`*`));`\n\nDefines a mock method *`method_name`* with arguments `(`*`args...`*`)` and\nreturn type *`return_type`* within a mock class.\n\nThe parameters of `MOCK_METHOD` mirror the method declaration. The optional\nfourth parameter *`specs...`* is a comma-separated list of qualifiers. The\nfollowing qualifiers are accepted:\n\n| Qualifier | Meaning |\n| -------------------------- | -------------------------------------------- |\n| `const` | Makes the mocked method a `const` method. Required if overriding a `const` method. |\n| `override` | Marks the method with `override`. Recommended if overriding a `virtual` method. |\n| `noexcept` | Marks the method with `noexcept`. Required if overriding a `noexcept` method. |\n| `Calltype(`*`calltype`*`)` | Sets the call type for the method, for example `Calltype(STDMETHODCALLTYPE)`. Useful on Windows. |\n| `ref(`*`qualifier`*`)` | Marks the method with the given reference qualifier, for example `ref(&)` or `ref(&&)`. Required if overriding a method that has a reference qualifier. |\n\nNote that commas in arguments prevent `MOCK_METHOD` from parsing the arguments\ncorrectly if they are not appropriately surrounded by parentheses. See the\nfollowing example:\n\n```cpp\nclass MyMock {\n public:\n // The following 2 lines will not compile due to commas in the arguments:\n MOCK_METHOD(std::pair, GetPair, ()); // Error!\n MOCK_METHOD(bool, CheckMap, (std::map, bool)); // Error!\n\n // One solution - wrap arguments that contain commas in parentheses:\n MOCK_METHOD((std::pair), GetPair, ());\n MOCK_METHOD(bool, CheckMap, ((std::map), bool));\n\n // Another solution - use type aliases:\n using BoolAndInt = std::pair;\n MOCK_METHOD(BoolAndInt, GetPair, ());\n using MapIntDouble = std::map;\n MOCK_METHOD(bool, CheckMap, (MapIntDouble, bool));\n};\n```\n\n`MOCK_METHOD` must be used in the `public:` section of a mock class definition,\nregardless of whether the method being mocked is `public`, `protected`, or\n`private` in the base class.\n\n### EXPECT_CALL {#EXPECT_CALL}\n\n`EXPECT_CALL(`*`mock_object`*`,`*`method_name`*`(`*`matchers...`*`))`\n\nCreates an [expectation](../gmock_for_dummies.md#setting-expectations) that the\nmethod *`method_name`* of the object *`mock_object`* is called with arguments\nthat match the given matchers *`matchers...`*. `EXPECT_CALL` must precede any\ncode that exercises the mock object.\n\nThe parameter *`matchers...`* is a comma-separated list of\n[matchers](../gmock_for_dummies.md#matchers-what-arguments-do-we-expect) that\ncorrespond to each argument of the method *`method_name`*. The expectation will\napply only to calls of *`method_name`* whose arguments match all of the\nmatchers. If `(`*`matchers...`*`)` is omitted, the expectation behaves as if\neach argument's matcher were a [wildcard matcher (`_`)](matchers.md#wildcard).\nSee the [Matchers Reference](matchers.md) for a list of all built-in matchers.\n\nThe following chainable clauses can be used to modify the expectation, and they\nmust be used in the following order:\n\n```cpp\nEXPECT_CALL(mock_object, method_name(matchers...))\n .With(multi_argument_matcher) // Can be used at most once\n .Times(cardinality) // Can be used at most once\n .InSequence(sequences...) // Can be used any number of times\n .After(expectations...) // Can be used any number of times\n .WillOnce(action) // Can be used any number of times\n .WillRepeatedly(action) // Can be used at most once\n .RetiresOnSaturation(); // Can be used at most once\n```\n\nSee details for each modifier clause below.\n\n#### With {#EXPECT_CALL.With}\n\n`.With(`*`multi_argument_matcher`*`)`\n\nRestricts the expectation to apply only to mock function calls whose arguments\nas a whole match the multi-argument matcher *`multi_argument_matcher`*.\n\nGoogleTest passes all of the arguments as one tuple into the matcher. The\nparameter *`multi_argument_matcher`* must thus be a matcher of type\n`Matcher>`, where `A1, ..., An` are the types of the\nfunction arguments.\n\nFor example, the following code sets the expectation that\n`my_mock.SetPosition()` is called with any two arguments, the first argument\nbeing less than the second:\n\n```cpp\nusing ::testing::_;\nusing ::testing::Lt;\n...\nEXPECT_CALL(my_mock, SetPosition(_, _))\n .With(Lt());\n```\n\nGoogleTest provides some built-in matchers for 2-tuples, including the `Lt()`\nmatcher above. See [Multi-argument Matchers](matchers.md#MultiArgMatchers).\n\nThe `With` clause can be used at most once on an expectation and must be the\nfirst clause.\n\n#### Times {#EXPECT_CALL.Times}\n\n`.Times(`*`cardinality`*`)`\n\nSpecifies how many times the mock function call is expected.\n\nThe parameter *`cardinality`* represents the number of expected calls and can be\none of the following, all defined in the `::testing` namespace:\n\n| Cardinality | Meaning |\n| ------------------- | --------------------------------------------------- |\n| `AnyNumber()` | The function can be called any number of times. |\n| `AtLeast(n)` | The function call is expected at least *n* times. |\n| `AtMost(n)` | The function call is expected at most *n* times. |\n| `Between(m, n)` | The function call is expected between *m* and *n* times, inclusive. |\n| `Exactly(n)` or `n` | The function call is expected exactly *n* times. If *n* is 0, the call should never happen. |\n\nIf the `Times` clause is omitted, GoogleTest infers the cardinality as follows:\n\n* If neither [`WillOnce`](#EXPECT_CALL.WillOnce) nor\n [`WillRepeatedly`](#EXPECT_CALL.WillRepeatedly) are specified, the inferred\n cardinality is `Times(1)`.\n* If there are *n* `WillOnce` clauses and no `WillRepeatedly` clause, where\n *n* >= 1, the inferred cardinality is `Times(n)`.\n* If there are *n* `WillOnce` clauses and one `WillRepeatedly` clause, where\n *n* >= 0, the inferred cardinality is `Times(AtLeast(n))`.\n\nThe `Times` clause can be used at most once on an expectation.\n\n#### InSequence {#EXPECT_CALL.InSequence}\n\n`.InSequence(`*`sequences...`*`)`\n\nSpecifies that the mock function call is expected in a certain sequence.\n\nThe parameter *`sequences...`* is any number of [`Sequence`](#Sequence) objects.\nExpected calls assigned to the same sequence are expected to occur in the order\nthe expectations are declared.\n\nFor example, the following code sets the expectation that the `Reset()` method\nof `my_mock` is called before both `GetSize()` and `Describe()`, and `GetSize()`\nand `Describe()` can occur in any order relative to each other:\n\n```cpp\nusing ::testing::Sequence;\nSequence s1, s2;\n...\nEXPECT_CALL(my_mock, Reset())\n .InSequence(s1, s2);\nEXPECT_CALL(my_mock, GetSize())\n .InSequence(s1);\nEXPECT_CALL(my_mock, Describe())\n .InSequence(s2);\n```\n\nThe `InSequence` clause can be used any number of times on an expectation.\n\nSee also the [`InSequence` class](#InSequence).\n\n#### After {#EXPECT_CALL.After}\n\n`.After(`*`expectations...`*`)`\n\nSpecifies that the mock function call is expected to occur after one or more\nother calls.\n\nThe parameter *`expectations...`* can be up to five\n[`Expectation`](#Expectation) or [`ExpectationSet`](#ExpectationSet) objects.\nThe mock function call is expected to occur after all of the given expectations.\n\nFor example, the following code sets the expectation that the `Describe()`\nmethod of `my_mock` is called only after both `InitX()` and `InitY()` have been\ncalled.\n\n```cpp\nusing ::testing::Expectation;\n...\nExpectation init_x = EXPECT_CALL(my_mock, InitX());\nExpectation init_y = EXPECT_CALL(my_mock, InitY());\nEXPECT_CALL(my_mock, Describe())\n .After(init_x, init_y);\n```\n\nThe `ExpectationSet` object is helpful when the number of prerequisites for an\nexpectation is large or variable, for example:\n\n```cpp\nusing ::testing::ExpectationSet;\n...\nExpectationSet all_inits;\n// Collect all expectations of InitElement() calls\nfor (int i = 0; i < element_count; i++) {\n all_inits += EXPECT_CALL(my_mock, InitElement(i));\n}\nEXPECT_CALL(my_mock, Describe())\n .After(all_inits); // Expect Describe() call after all InitElement() calls\n```\n\nThe `After` clause can be used any number of times on an expectation.\n\n#### WillOnce {#EXPECT_CALL.WillOnce}\n\n`.WillOnce(`*`action`*`)`\n\nSpecifies the mock function's actual behavior when invoked, for a single\nmatching function call.\n\nThe parameter *`action`* represents the\n[action](../gmock_for_dummies.md#actions-what-should-it-do) that the function\ncall will perform. See the [Actions Reference](actions.md) for a list of\nbuilt-in actions.\n\nThe use of `WillOnce` implicitly sets a cardinality on the expectation when\n`Times` is not specified. See [`Times`](#EXPECT_CALL.Times).\n\nEach matching function call will perform the next action in the order declared.\nFor example, the following code specifies that `my_mock.GetNumber()` is expected\nto be called exactly 3 times and will return `1`, `2`, and `3` respectively on\nthe first, second, and third calls:\n\n```cpp\nusing ::testing::Return;\n...\nEXPECT_CALL(my_mock, GetNumber())\n .WillOnce(Return(1))\n .WillOnce(Return(2))\n .WillOnce(Return(3));\n```\n\nThe `WillOnce` clause can be used any number of times on an expectation. Unlike\n`WillRepeatedly`, the action fed to each `WillOnce` call will be called at most\nonce, so may be a move-only type and/or have an `&&`-qualified call operator.\n\n#### WillRepeatedly {#EXPECT_CALL.WillRepeatedly}\n\n`.WillRepeatedly(`*`action`*`)`\n\nSpecifies the mock function's actual behavior when invoked, for all subsequent\nmatching function calls. Takes effect after the actions specified in the\n[`WillOnce`](#EXPECT_CALL.WillOnce) clauses, if any, have been performed.\n\nThe parameter *`action`* represents the\n[action](../gmock_for_dummies.md#actions-what-should-it-do) that the function\ncall will perform. See the [Actions Reference](actions.md) for a list of\nbuilt-in actions.\n\nThe use of `WillRepeatedly` implicitly sets a cardinality on the expectation\nwhen `Times` is not specified. See [`Times`](#EXPECT_CALL.Times).\n\nIf any `WillOnce` clauses have been specified, matching function calls will\nperform those actions before the action specified by `WillRepeatedly`. See the\nfollowing example:\n\n```cpp\nusing ::testing::Return;\n...\nEXPECT_CALL(my_mock, GetName())\n .WillRepeatedly(Return(\"John Doe\")); // Return \"John Doe\" on all calls\n\nEXPECT_CALL(my_mock, GetNumber())\n .WillOnce(Return(42)) // Return 42 on the first call\n .WillRepeatedly(Return(7)); // Return 7 on all subsequent calls\n```\n\nThe `WillRepeatedly` clause can be used at most once on an expectation.\n\n#### RetiresOnSaturation {#EXPECT_CALL.RetiresOnSaturation}\n\n`.RetiresOnSaturation()`\n\nIndicates that the expectation will no longer be active after the expected\nnumber of matching function calls has been reached.\n\nThe `RetiresOnSaturation` clause is only meaningful for expectations with an\nupper-bounded cardinality. The expectation will *retire* (no longer match any\nfunction calls) after it has been *saturated* (the upper bound has been\nreached). See the following example:\n\n```cpp\nusing ::testing::_;\nusing ::testing::AnyNumber;\n...\nEXPECT_CALL(my_mock, SetNumber(_)) // Expectation 1\n .Times(AnyNumber());\nEXPECT_CALL(my_mock, SetNumber(7)) // Expectation 2\n .Times(2)\n .RetiresOnSaturation();\n```\n\nIn the above example, the first two calls to `my_mock.SetNumber(7)` match\nexpectation 2, which then becomes inactive and no longer matches any calls. A\nthird call to `my_mock.SetNumber(7)` would then match expectation 1. Without\n`RetiresOnSaturation()` on expectation 2, a third call to `my_mock.SetNumber(7)`\nwould match expectation 2 again, producing a failure since the limit of 2 calls\nwas exceeded.\n\nThe `RetiresOnSaturation` clause can be used at most once on an expectation and\nmust be the last clause.\n\n### ON_CALL {#ON_CALL}\n\n`ON_CALL(`*`mock_object`*`,`*`method_name`*`(`*`matchers...`*`))`\n\nDefines what happens when the method *`method_name`* of the object\n*`mock_object`* is called with arguments that match the given matchers\n*`matchers...`*. Requires a modifier clause to specify the method's behavior.\n*Does not* set any expectations that the method will be called.\n\nThe parameter *`matchers...`* is a comma-separated list of\n[matchers](../gmock_for_dummies.md#matchers-what-arguments-do-we-expect) that\ncorrespond to each argument of the method *`method_name`*. The `ON_CALL`\nspecification will apply only to calls of *`method_name`* whose arguments match\nall of the matchers. If `(`*`matchers...`*`)` is omitted, the behavior is as if\neach argument's matcher were a [wildcard matcher (`_`)](matchers.md#wildcard).\nSee the [Matchers Reference](matchers.md) for a list of all built-in matchers.\n\nThe following chainable clauses can be used to set the method's behavior, and\nthey must be used in the following order:\n\n```cpp\nON_CALL(mock_object, method_name(matchers...))\n .With(multi_argument_matcher) // Can be used at most once\n .WillByDefault(action); // Required\n```\n\nSee details for each modifier clause below.\n\n#### With {#ON_CALL.With}\n\n`.With(`*`multi_argument_matcher`*`)`\n\nRestricts the specification to only mock function calls whose arguments as a\nwhole match the multi-argument matcher *`multi_argument_matcher`*.\n\nGoogleTest passes all of the arguments as one tuple into the matcher. The\nparameter *`multi_argument_matcher`* must thus be a matcher of type\n`Matcher>`, where `A1, ..., An` are the types of the\nfunction arguments.\n\nFor example, the following code sets the default behavior when\n`my_mock.SetPosition()` is called with any two arguments, the first argument\nbeing less than the second:\n\n```cpp\nusing ::testing::_;\nusing ::testing::Lt;\nusing ::testing::Return;\n...\nON_CALL(my_mock, SetPosition(_, _))\n .With(Lt())\n .WillByDefault(Return(true));\n```\n\nGoogleTest provides some built-in matchers for 2-tuples, including the `Lt()`\nmatcher above. See [Multi-argument Matchers](matchers.md#MultiArgMatchers).\n\nThe `With` clause can be used at most once with each `ON_CALL` statement.\n\n#### WillByDefault {#ON_CALL.WillByDefault}\n\n`.WillByDefault(`*`action`*`)`\n\nSpecifies the default behavior of a matching mock function call.\n\nThe parameter *`action`* represents the\n[action](../gmock_for_dummies.md#actions-what-should-it-do) that the function\ncall will perform. See the [Actions Reference](actions.md) for a list of\nbuilt-in actions.\n\nFor example, the following code specifies that by default, a call to\n`my_mock.Greet()` will return `\"hello\"`:\n\n```cpp\nusing ::testing::Return;\n...\nON_CALL(my_mock, Greet())\n .WillByDefault(Return(\"hello\"));\n```\n\nThe action specified by `WillByDefault` is superseded by the actions specified\non a matching `EXPECT_CALL` statement, if any. See the\n[`WillOnce`](#EXPECT_CALL.WillOnce) and\n[`WillRepeatedly`](#EXPECT_CALL.WillRepeatedly) clauses of `EXPECT_CALL`.\n\nThe `WillByDefault` clause must be used exactly once with each `ON_CALL`\nstatement.\n\n## Classes {#classes}\n\nGoogleTest defines the following classes for working with mocks.\n\n### DefaultValue {#DefaultValue}\n\n`::testing::DefaultValue`\n\nAllows a user to specify the default value for a type `T` that is both copyable\nand publicly destructible (i.e. anything that can be used as a function return\ntype). For mock functions with a return type of `T`, this default value is\nreturned from function calls that do not specify an action.\n\nProvides the static methods `Set()`, `SetFactory()`, and `Clear()` to manage the\ndefault value:\n\n```cpp\n// Sets the default value to be returned. T must be copy constructible.\nDefaultValue::Set(value);\n\n// Sets a factory. Will be invoked on demand. T must be move constructible.\nT MakeT();\nDefaultValue::SetFactory(&MakeT);\n\n// Unsets the default value.\nDefaultValue::Clear();\n```\n\n### NiceMock {#NiceMock}\n\n`::testing::NiceMock`\n\nRepresents a mock object that suppresses warnings on\n[uninteresting calls](../gmock_cook_book.md#uninteresting-vs-unexpected). The\ntemplate parameter `T` is any mock class, except for another `NiceMock`,\n`NaggyMock`, or `StrictMock`.\n\nUsage of `NiceMock` is analogous to usage of `T`. `NiceMock` is a subclass\nof `T`, so it can be used wherever an object of type `T` is accepted. In\naddition, `NiceMock` can be constructed with any arguments that a constructor\nof `T` accepts.\n\nFor example, the following code suppresses warnings on the mock `my_mock` of\ntype `MockClass` if a method other than `DoSomething()` is called:\n\n```cpp\nusing ::testing::NiceMock;\n...\nNiceMock my_mock(\"some\", \"args\");\nEXPECT_CALL(my_mock, DoSomething());\n... code that uses my_mock ...\n```\n\n`NiceMock` only works for mock methods defined using the `MOCK_METHOD` macro\ndirectly in the definition of class `T`. If a mock method is defined in a base\nclass of `T`, a warning might still be generated.\n\n`NiceMock` might not work correctly if the destructor of `T` is not virtual.\n\n### NaggyMock {#NaggyMock}\n\n`::testing::NaggyMock`\n\nRepresents a mock object that generates warnings on\n[uninteresting calls](../gmock_cook_book.md#uninteresting-vs-unexpected). The\ntemplate parameter `T` is any mock class, except for another `NiceMock`,\n`NaggyMock`, or `StrictMock`.\n\nUsage of `NaggyMock` is analogous to usage of `T`. `NaggyMock` is a\nsubclass of `T`, so it can be used wherever an object of type `T` is accepted.\nIn addition, `NaggyMock` can be constructed with any arguments that a\nconstructor of `T` accepts.\n\nFor example, the following code generates warnings on the mock `my_mock` of type\n`MockClass` if a method other than `DoSomething()` is called:\n\n```cpp\nusing ::testing::NaggyMock;\n...\nNaggyMock my_mock(\"some\", \"args\");\nEXPECT_CALL(my_mock, DoSomething());\n... code that uses my_mock ...\n```\n\nMock objects of type `T` by default behave the same way as `NaggyMock`.\n\n### StrictMock {#StrictMock}\n\n`::testing::StrictMock`\n\nRepresents a mock object that generates test failures on\n[uninteresting calls](../gmock_cook_book.md#uninteresting-vs-unexpected). The\ntemplate parameter `T` is any mock class, except for another `NiceMock`,\n`NaggyMock`, or `StrictMock`.\n\nUsage of `StrictMock` is analogous to usage of `T`. `StrictMock` is a\nsubclass of `T`, so it can be used wherever an object of type `T` is accepted.\nIn addition, `StrictMock` can be constructed with any arguments that a\nconstructor of `T` accepts.\n\nFor example, the following code generates a test failure on the mock `my_mock`\nof type `MockClass` if a method other than `DoSomething()` is called:\n\n```cpp\nusing ::testing::StrictMock;\n...\nStrictMock my_mock(\"some\", \"args\");\nEXPECT_CALL(my_mock, DoSomething());\n... code that uses my_mock ...\n```\n\n`StrictMock` only works for mock methods defined using the `MOCK_METHOD`\nmacro directly in the definition of class `T`. If a mock method is defined in a\nbase class of `T`, a failure might not be generated.\n\n`StrictMock` might not work correctly if the destructor of `T` is not\nvirtual.\n\n### Sequence {#Sequence}\n\n`::testing::Sequence`\n\nRepresents a chronological sequence of expectations. See the\n[`InSequence`](#EXPECT_CALL.InSequence) clause of `EXPECT_CALL` for usage.\n\n### InSequence {#InSequence}\n\n`::testing::InSequence`\n\nAn object of this type causes all expectations encountered in its scope to be\nput in an anonymous sequence.\n\nThis allows more convenient expression of multiple expectations in a single\nsequence:\n\n```cpp\nusing ::testing::InSequence;\n{\n InSequence seq;\n\n // The following are expected to occur in the order declared.\n EXPECT_CALL(...);\n EXPECT_CALL(...);\n ...\n EXPECT_CALL(...);\n}\n```\n\nThe name of the `InSequence` object does not matter.\n\n### Expectation {#Expectation}\n\n`::testing::Expectation`\n\nRepresents a mock function call expectation as created by\n[`EXPECT_CALL`](#EXPECT_CALL):\n\n```cpp\nusing ::testing::Expectation;\nExpectation my_expectation = EXPECT_CALL(...);\n```\n\nUseful for specifying sequences of expectations; see the\n[`After`](#EXPECT_CALL.After) clause of `EXPECT_CALL`.\n\n### ExpectationSet {#ExpectationSet}\n\n`::testing::ExpectationSet`\n\nRepresents a set of mock function call expectations.\n\nUse the `+=` operator to add [`Expectation`](#Expectation) objects to the set:\n\n```cpp\nusing ::testing::ExpectationSet;\nExpectationSet my_expectations;\nmy_expectations += EXPECT_CALL(...);\n```\n\nUseful for specifying sequences of expectations; see the\n[`After`](#EXPECT_CALL.After) clause of `EXPECT_CALL`.\n" }, { "path": "3rd/googletest-1.12.1/docs/reference/testing.md", "content": "# Testing Reference\n\n\n\nThis page lists the facilities provided by GoogleTest for writing test programs.\nTo use them, include the header `gtest/gtest.h`.\n\n## Macros\n\nGoogleTest defines the following macros for writing tests.\n\n### TEST {#TEST}\n\n
\nTEST(TestSuiteName, TestName) {\n  ... statements ...\n}\n
\n\nDefines an individual test named *`TestName`* in the test suite\n*`TestSuiteName`*, consisting of the given statements.\n\nBoth arguments *`TestSuiteName`* and *`TestName`* must be valid C++ identifiers\nand must not contain underscores (`_`). Tests in different test suites can have\nthe same individual name.\n\nThe statements within the test body can be any code under test.\n[Assertions](assertions.md) used within the test body determine the outcome of\nthe test.\n\n### TEST_F {#TEST_F}\n\n
\nTEST_F(TestFixtureName, TestName) {\n  ... statements ...\n}\n
\n\nDefines an individual test named *`TestName`* that uses the test fixture class\n*`TestFixtureName`*. The test suite name is *`TestFixtureName`*.\n\nBoth arguments *`TestFixtureName`* and *`TestName`* must be valid C++\nidentifiers and must not contain underscores (`_`). *`TestFixtureName`* must be\nthe name of a test fixture class—see\n[Test Fixtures](../primer.md#same-data-multiple-tests).\n\nThe statements within the test body can be any code under test.\n[Assertions](assertions.md) used within the test body determine the outcome of\nthe test.\n\n### TEST_P {#TEST_P}\n\n
\nTEST_P(TestFixtureName, TestName) {\n  ... statements ...\n}\n
\n\nDefines an individual value-parameterized test named *`TestName`* that uses the\ntest fixture class *`TestFixtureName`*. The test suite name is\n*`TestFixtureName`*.\n\nBoth arguments *`TestFixtureName`* and *`TestName`* must be valid C++\nidentifiers and must not contain underscores (`_`). *`TestFixtureName`* must be\nthe name of a value-parameterized test fixture class—see\n[Value-Parameterized Tests](../advanced.md#value-parameterized-tests).\n\nThe statements within the test body can be any code under test. Within the test\nbody, the test parameter can be accessed with the `GetParam()` function (see\n[`WithParamInterface`](#WithParamInterface)). For example:\n\n```cpp\nTEST_P(MyTestSuite, DoesSomething) {\n ...\n EXPECT_TRUE(DoSomething(GetParam()));\n ...\n}\n```\n\n[Assertions](assertions.md) used within the test body determine the outcome of\nthe test.\n\nSee also [`INSTANTIATE_TEST_SUITE_P`](#INSTANTIATE_TEST_SUITE_P).\n\n### INSTANTIATE_TEST_SUITE_P {#INSTANTIATE_TEST_SUITE_P}\n\n`INSTANTIATE_TEST_SUITE_P(`*`InstantiationName`*`,`*`TestSuiteName`*`,`*`param_generator`*`)`\n\\\n`INSTANTIATE_TEST_SUITE_P(`*`InstantiationName`*`,`*`TestSuiteName`*`,`*`param_generator`*`,`*`name_generator`*`)`\n\nInstantiates the value-parameterized test suite *`TestSuiteName`* (defined with\n[`TEST_P`](#TEST_P)).\n\nThe argument *`InstantiationName`* is a unique name for the instantiation of the\ntest suite, to distinguish between multiple instantiations. In test output, the\ninstantiation name is added as a prefix to the test suite name\n*`TestSuiteName`*.\n\nThe argument *`param_generator`* is one of the following GoogleTest-provided\nfunctions that generate the test parameters, all defined in the `::testing`\nnamespace:\n\n\n\n| Parameter Generator | Behavior |\n| ------------------- | ---------------------------------------------------- |\n| `Range(begin, end [, step])` | Yields values `{begin, begin+step, begin+step+step, ...}`. The values do not include `end`. `step` defaults to 1. |\n| `Values(v1, v2, ..., vN)` | Yields values `{v1, v2, ..., vN}`. |\n| `ValuesIn(container)` or `ValuesIn(begin,end)` | Yields values from a C-style array, an STL-style container, or an iterator range `[begin, end)`. |\n| `Bool()` | Yields sequence `{false, true}`. |\n| `Combine(g1, g2, ..., gN)` | Yields as `std::tuple` *n*-tuples all combinations (Cartesian product) of the values generated by the given *n* generators `g1`, `g2`, ..., `gN`. |\n\nThe optional last argument *`name_generator`* is a function or functor that\ngenerates custom test name suffixes based on the test parameters. The function\nmust accept an argument of type\n[`TestParamInfo`](#TestParamInfo) and return a `std::string`.\nThe test name suffix can only contain alphanumeric characters and underscores.\nGoogleTest provides [`PrintToStringParamName`](#PrintToStringParamName), or a\ncustom function can be used for more control:\n\n```cpp\nINSTANTIATE_TEST_SUITE_P(\n MyInstantiation, MyTestSuite,\n ::testing::Values(...),\n [](const ::testing::TestParamInfo& info) {\n // Can use info.param here to generate the test suffix\n std::string name = ...\n return name;\n });\n```\n\nFor more information, see\n[Value-Parameterized Tests](../advanced.md#value-parameterized-tests).\n\nSee also\n[`GTEST_ALLOW_UNINSTANTIATED_PARAMETERIZED_TEST`](#GTEST_ALLOW_UNINSTANTIATED_PARAMETERIZED_TEST).\n\n### TYPED_TEST_SUITE {#TYPED_TEST_SUITE}\n\n`TYPED_TEST_SUITE(`*`TestFixtureName`*`,`*`Types`*`)`\n\nDefines a typed test suite based on the test fixture *`TestFixtureName`*. The\ntest suite name is *`TestFixtureName`*.\n\nThe argument *`TestFixtureName`* is a fixture class template, parameterized by a\ntype, for example:\n\n```cpp\ntemplate \nclass MyFixture : public ::testing::Test {\n public:\n ...\n using List = std::list;\n static T shared_;\n T value_;\n};\n```\n\nThe argument *`Types`* is a [`Types`](#Types) object representing the list of\ntypes to run the tests on, for example:\n\n```cpp\nusing MyTypes = ::testing::Types;\nTYPED_TEST_SUITE(MyFixture, MyTypes);\n```\n\nThe type alias (`using` or `typedef`) is necessary for the `TYPED_TEST_SUITE`\nmacro to parse correctly.\n\nSee also [`TYPED_TEST`](#TYPED_TEST) and\n[Typed Tests](../advanced.md#typed-tests) for more information.\n\n### TYPED_TEST {#TYPED_TEST}\n\n
\nTYPED_TEST(TestSuiteName, TestName) {\n  ... statements ...\n}\n
\n\nDefines an individual typed test named *`TestName`* in the typed test suite\n*`TestSuiteName`*. The test suite must be defined with\n[`TYPED_TEST_SUITE`](#TYPED_TEST_SUITE).\n\nWithin the test body, the special name `TypeParam` refers to the type parameter,\nand `TestFixture` refers to the fixture class. See the following example:\n\n```cpp\nTYPED_TEST(MyFixture, Example) {\n // Inside a test, refer to the special name TypeParam to get the type\n // parameter. Since we are inside a derived class template, C++ requires\n // us to visit the members of MyFixture via 'this'.\n TypeParam n = this->value_;\n\n // To visit static members of the fixture, add the 'TestFixture::'\n // prefix.\n n += TestFixture::shared_;\n\n // To refer to typedefs in the fixture, add the 'typename TestFixture::'\n // prefix. The 'typename' is required to satisfy the compiler.\n typename TestFixture::List values;\n\n values.push_back(n);\n ...\n}\n```\n\nFor more information, see [Typed Tests](../advanced.md#typed-tests).\n\n### TYPED_TEST_SUITE_P {#TYPED_TEST_SUITE_P}\n\n`TYPED_TEST_SUITE_P(`*`TestFixtureName`*`)`\n\nDefines a type-parameterized test suite based on the test fixture\n*`TestFixtureName`*. The test suite name is *`TestFixtureName`*.\n\nThe argument *`TestFixtureName`* is a fixture class template, parameterized by a\ntype. See [`TYPED_TEST_SUITE`](#TYPED_TEST_SUITE) for an example.\n\nSee also [`TYPED_TEST_P`](#TYPED_TEST_P) and\n[Type-Parameterized Tests](../advanced.md#type-parameterized-tests) for more\ninformation.\n\n### TYPED_TEST_P {#TYPED_TEST_P}\n\n
\nTYPED_TEST_P(TestSuiteName, TestName) {\n  ... statements ...\n}\n
\n\nDefines an individual type-parameterized test named *`TestName`* in the\ntype-parameterized test suite *`TestSuiteName`*. The test suite must be defined\nwith [`TYPED_TEST_SUITE_P`](#TYPED_TEST_SUITE_P).\n\nWithin the test body, the special name `TypeParam` refers to the type parameter,\nand `TestFixture` refers to the fixture class. See [`TYPED_TEST`](#TYPED_TEST)\nfor an example.\n\nSee also [`REGISTER_TYPED_TEST_SUITE_P`](#REGISTER_TYPED_TEST_SUITE_P) and\n[Type-Parameterized Tests](../advanced.md#type-parameterized-tests) for more\ninformation.\n\n### REGISTER_TYPED_TEST_SUITE_P {#REGISTER_TYPED_TEST_SUITE_P}\n\n`REGISTER_TYPED_TEST_SUITE_P(`*`TestSuiteName`*`,`*`TestNames...`*`)`\n\nRegisters the type-parameterized tests *`TestNames...`* of the test suite\n*`TestSuiteName`*. The test suite and tests must be defined with\n[`TYPED_TEST_SUITE_P`](#TYPED_TEST_SUITE_P) and [`TYPED_TEST_P`](#TYPED_TEST_P).\n\nFor example:\n\n```cpp\n// Define the test suite and tests.\nTYPED_TEST_SUITE_P(MyFixture);\nTYPED_TEST_P(MyFixture, HasPropertyA) { ... }\nTYPED_TEST_P(MyFixture, HasPropertyB) { ... }\n\n// Register the tests in the test suite.\nREGISTER_TYPED_TEST_SUITE_P(MyFixture, HasPropertyA, HasPropertyB);\n```\n\nSee also [`INSTANTIATE_TYPED_TEST_SUITE_P`](#INSTANTIATE_TYPED_TEST_SUITE_P) and\n[Type-Parameterized Tests](../advanced.md#type-parameterized-tests) for more\ninformation.\n\n### INSTANTIATE_TYPED_TEST_SUITE_P {#INSTANTIATE_TYPED_TEST_SUITE_P}\n\n`INSTANTIATE_TYPED_TEST_SUITE_P(`*`InstantiationName`*`,`*`TestSuiteName`*`,`*`Types`*`)`\n\nInstantiates the type-parameterized test suite *`TestSuiteName`*. The test suite\nmust be registered with\n[`REGISTER_TYPED_TEST_SUITE_P`](#REGISTER_TYPED_TEST_SUITE_P).\n\nThe argument *`InstantiationName`* is a unique name for the instantiation of the\ntest suite, to distinguish between multiple instantiations. In test output, the\ninstantiation name is added as a prefix to the test suite name\n*`TestSuiteName`*.\n\nThe argument *`Types`* is a [`Types`](#Types) object representing the list of\ntypes to run the tests on, for example:\n\n```cpp\nusing MyTypes = ::testing::Types;\nINSTANTIATE_TYPED_TEST_SUITE_P(MyInstantiation, MyFixture, MyTypes);\n```\n\nThe type alias (`using` or `typedef`) is necessary for the\n`INSTANTIATE_TYPED_TEST_SUITE_P` macro to parse correctly.\n\nFor more information, see\n[Type-Parameterized Tests](../advanced.md#type-parameterized-tests).\n\n### FRIEND_TEST {#FRIEND_TEST}\n\n`FRIEND_TEST(`*`TestSuiteName`*`,`*`TestName`*`)`\n\nWithin a class body, declares an individual test as a friend of the class,\nenabling the test to access private class members.\n\nIf the class is defined in a namespace, then in order to be friends of the\nclass, test fixtures and tests must be defined in the exact same namespace,\nwithout inline or anonymous namespaces.\n\nFor example, if the class definition looks like the following:\n\n```cpp\nnamespace my_namespace {\n\nclass MyClass {\n friend class MyClassTest;\n FRIEND_TEST(MyClassTest, HasPropertyA);\n FRIEND_TEST(MyClassTest, HasPropertyB);\n ... definition of class MyClass ...\n};\n\n} // namespace my_namespace\n```\n\nThen the test code should look like:\n\n```cpp\nnamespace my_namespace {\n\nclass MyClassTest : public ::testing::Test {\n ...\n};\n\nTEST_F(MyClassTest, HasPropertyA) { ... }\nTEST_F(MyClassTest, HasPropertyB) { ... }\n\n} // namespace my_namespace\n```\n\nSee [Testing Private Code](../advanced.md#testing-private-code) for more\ninformation.\n\n### SCOPED_TRACE {#SCOPED_TRACE}\n\n`SCOPED_TRACE(`*`message`*`)`\n\nCauses the current file name, line number, and the given message *`message`* to\nbe added to the failure message for each assertion failure that occurs in the\nscope.\n\nFor more information, see\n[Adding Traces to Assertions](../advanced.md#adding-traces-to-assertions).\n\nSee also the [`ScopedTrace` class](#ScopedTrace).\n\n### GTEST_SKIP {#GTEST_SKIP}\n\n`GTEST_SKIP()`\n\nPrevents further test execution at runtime.\n\nCan be used in individual test cases or in the `SetUp()` methods of test\nenvironments or test fixtures (classes derived from the\n[`Environment`](#Environment) or [`Test`](#Test) classes). If used in a global\ntest environment `SetUp()` method, it skips all tests in the test program. If\nused in a test fixture `SetUp()` method, it skips all tests in the corresponding\ntest suite.\n\nSimilar to assertions, `GTEST_SKIP` allows streaming a custom message into it.\n\nSee [Skipping Test Execution](../advanced.md#skipping-test-execution) for more\ninformation.\n\n### GTEST_ALLOW_UNINSTANTIATED_PARAMETERIZED_TEST {#GTEST_ALLOW_UNINSTANTIATED_PARAMETERIZED_TEST}\n\n`GTEST_ALLOW_UNINSTANTIATED_PARAMETERIZED_TEST(`*`TestSuiteName`*`)`\n\nAllows the value-parameterized test suite *`TestSuiteName`* to be\nuninstantiated.\n\nBy default, every [`TEST_P`](#TEST_P) call without a corresponding\n[`INSTANTIATE_TEST_SUITE_P`](#INSTANTIATE_TEST_SUITE_P) call causes a failing\ntest in the test suite `GoogleTestVerification`.\n`GTEST_ALLOW_UNINSTANTIATED_PARAMETERIZED_TEST` suppresses this failure for the\ngiven test suite.\n\n## Classes and types\n\nGoogleTest defines the following classes and types to help with writing tests.\n\n### AssertionResult {#AssertionResult}\n\n`::testing::AssertionResult`\n\nA class for indicating whether an assertion was successful.\n\nWhen the assertion wasn't successful, the `AssertionResult` object stores a\nnon-empty failure message that can be retrieved with the object's `message()`\nmethod.\n\nTo create an instance of this class, use one of the factory functions\n[`AssertionSuccess()`](#AssertionSuccess) or\n[`AssertionFailure()`](#AssertionFailure).\n\n### AssertionException {#AssertionException}\n\n`::testing::AssertionException`\n\nException which can be thrown from\n[`TestEventListener::OnTestPartResult`](#TestEventListener::OnTestPartResult).\n\n### EmptyTestEventListener {#EmptyTestEventListener}\n\n`::testing::EmptyTestEventListener`\n\nProvides an empty implementation of all methods in the\n[`TestEventListener`](#TestEventListener) interface, such that a subclass only\nneeds to override the methods it cares about.\n\n### Environment {#Environment}\n\n`::testing::Environment`\n\nRepresents a global test environment. See\n[Global Set-Up and Tear-Down](../advanced.md#global-set-up-and-tear-down).\n\n#### Protected Methods {#Environment-protected}\n\n##### SetUp {#Environment::SetUp}\n\n`virtual void Environment::SetUp()`\n\nOverride this to define how to set up the environment.\n\n##### TearDown {#Environment::TearDown}\n\n`virtual void Environment::TearDown()`\n\nOverride this to define how to tear down the environment.\n\n### ScopedTrace {#ScopedTrace}\n\n`::testing::ScopedTrace`\n\nAn instance of this class causes a trace to be included in every test failure\nmessage generated by code in the scope of the lifetime of the `ScopedTrace`\ninstance. The effect is undone with the destruction of the instance.\n\nThe `ScopedTrace` constructor has the following form:\n\n```cpp\ntemplate \nScopedTrace(const char* file, int line, const T& message)\n```\n\nExample usage:\n\n```cpp\n::testing::ScopedTrace trace(\"file.cc\", 123, \"message\");\n```\n\nThe resulting trace includes the given source file path and line number, and the\ngiven message. The `message` argument can be anything streamable to\n`std::ostream`.\n\nSee also [`SCOPED_TRACE`](#SCOPED_TRACE).\n\n### Test {#Test}\n\n`::testing::Test`\n\nThe abstract class that all tests inherit from. `Test` is not copyable.\n\n#### Public Methods {#Test-public}\n\n##### SetUpTestSuite {#Test::SetUpTestSuite}\n\n`static void Test::SetUpTestSuite()`\n\nPerforms shared setup for all tests in the test suite. GoogleTest calls\n`SetUpTestSuite()` before running the first test in the test suite.\n\n##### TearDownTestSuite {#Test::TearDownTestSuite}\n\n`static void Test::TearDownTestSuite()`\n\nPerforms shared teardown for all tests in the test suite. GoogleTest calls\n`TearDownTestSuite()` after running the last test in the test suite.\n\n##### HasFatalFailure {#Test::HasFatalFailure}\n\n`static bool Test::HasFatalFailure()`\n\nReturns true if and only if the current test has a fatal failure.\n\n##### HasNonfatalFailure {#Test::HasNonfatalFailure}\n\n`static bool Test::HasNonfatalFailure()`\n\nReturns true if and only if the current test has a nonfatal failure.\n\n##### HasFailure {#Test::HasFailure}\n\n`static bool Test::HasFailure()`\n\nReturns true if and only if the current test has any failure, either fatal or\nnonfatal.\n\n##### IsSkipped {#Test::IsSkipped}\n\n`static bool Test::IsSkipped()`\n\nReturns true if and only if the current test was skipped.\n\n##### RecordProperty {#Test::RecordProperty}\n\n`static void Test::RecordProperty(const std::string& key, const std::string&\nvalue)` \\\n`static void Test::RecordProperty(const std::string& key, int value)`\n\nLogs a property for the current test, test suite, or entire invocation of the\ntest program. Only the last value for a given key is logged.\n\nThe key must be a valid XML attribute name, and cannot conflict with the ones\nalready used by GoogleTest (`name`, `file`, `line`, `status`, `time`,\n`classname`, `type_param`, and `value_param`).\n\n`RecordProperty` is `public static` so it can be called from utility functions\nthat are not members of the test fixture.\n\nCalls to `RecordProperty` made during the lifespan of the test (from the moment\nits constructor starts to the moment its destructor finishes) are output in XML\nas attributes of the `` element. Properties recorded from a fixture's\n`SetUpTestSuite` or `TearDownTestSuite` methods are logged as attributes of the\ncorresponding `` element. Calls to `RecordProperty` made in the\nglobal context (before or after invocation of `RUN_ALL_TESTS` or from the\n`SetUp`/`TearDown` methods of registered `Environment` objects) are output as\nattributes of the `` element.\n\n#### Protected Methods {#Test-protected}\n\n##### SetUp {#Test::SetUp}\n\n`virtual void Test::SetUp()`\n\nOverride this to perform test fixture setup. GoogleTest calls `SetUp()` before\nrunning each individual test.\n\n##### TearDown {#Test::TearDown}\n\n`virtual void Test::TearDown()`\n\nOverride this to perform test fixture teardown. GoogleTest calls `TearDown()`\nafter running each individual test.\n\n### TestWithParam {#TestWithParam}\n\n`::testing::TestWithParam`\n\nA convenience class which inherits from both [`Test`](#Test) and\n[`WithParamInterface`](#WithParamInterface).\n\n### TestSuite {#TestSuite}\n\nRepresents a test suite. `TestSuite` is not copyable.\n\n#### Public Methods {#TestSuite-public}\n\n##### name {#TestSuite::name}\n\n`const char* TestSuite::name() const`\n\nGets the name of the test suite.\n\n##### type_param {#TestSuite::type_param}\n\n`const char* TestSuite::type_param() const`\n\nReturns the name of the parameter type, or `NULL` if this is not a typed or\ntype-parameterized test suite. See [Typed Tests](../advanced.md#typed-tests) and\n[Type-Parameterized Tests](../advanced.md#type-parameterized-tests).\n\n##### should_run {#TestSuite::should_run}\n\n`bool TestSuite::should_run() const`\n\nReturns true if any test in this test suite should run.\n\n##### successful_test_count {#TestSuite::successful_test_count}\n\n`int TestSuite::successful_test_count() const`\n\nGets the number of successful tests in this test suite.\n\n##### skipped_test_count {#TestSuite::skipped_test_count}\n\n`int TestSuite::skipped_test_count() const`\n\nGets the number of skipped tests in this test suite.\n\n##### failed_test_count {#TestSuite::failed_test_count}\n\n`int TestSuite::failed_test_count() const`\n\nGets the number of failed tests in this test suite.\n\n##### reportable_disabled_test_count {#TestSuite::reportable_disabled_test_count}\n\n`int TestSuite::reportable_disabled_test_count() const`\n\nGets the number of disabled tests that will be reported in the XML report.\n\n##### disabled_test_count {#TestSuite::disabled_test_count}\n\n`int TestSuite::disabled_test_count() const`\n\nGets the number of disabled tests in this test suite.\n\n##### reportable_test_count {#TestSuite::reportable_test_count}\n\n`int TestSuite::reportable_test_count() const`\n\nGets the number of tests to be printed in the XML report.\n\n##### test_to_run_count {#TestSuite::test_to_run_count}\n\n`int TestSuite::test_to_run_count() const`\n\nGet the number of tests in this test suite that should run.\n\n##### total_test_count {#TestSuite::total_test_count}\n\n`int TestSuite::total_test_count() const`\n\nGets the number of all tests in this test suite.\n\n##### Passed {#TestSuite::Passed}\n\n`bool TestSuite::Passed() const`\n\nReturns true if and only if the test suite passed.\n\n##### Failed {#TestSuite::Failed}\n\n`bool TestSuite::Failed() const`\n\nReturns true if and only if the test suite failed.\n\n##### elapsed_time {#TestSuite::elapsed_time}\n\n`TimeInMillis TestSuite::elapsed_time() const`\n\nReturns the elapsed time, in milliseconds.\n\n##### start_timestamp {#TestSuite::start_timestamp}\n\n`TimeInMillis TestSuite::start_timestamp() const`\n\nGets the time of the test suite start, in ms from the start of the UNIX epoch.\n\n##### GetTestInfo {#TestSuite::GetTestInfo}\n\n`const TestInfo* TestSuite::GetTestInfo(int i) const`\n\nReturns the [`TestInfo`](#TestInfo) for the `i`-th test among all the tests. `i`\ncan range from 0 to `total_test_count() - 1`. If `i` is not in that range,\nreturns `NULL`.\n\n##### ad_hoc_test_result {#TestSuite::ad_hoc_test_result}\n\n`const TestResult& TestSuite::ad_hoc_test_result() const`\n\nReturns the [`TestResult`](#TestResult) that holds test properties recorded\nduring execution of `SetUpTestSuite` and `TearDownTestSuite`.\n\n### TestInfo {#TestInfo}\n\n`::testing::TestInfo`\n\nStores information about a test.\n\n#### Public Methods {#TestInfo-public}\n\n##### test_suite_name {#TestInfo::test_suite_name}\n\n`const char* TestInfo::test_suite_name() const`\n\nReturns the test suite name.\n\n##### name {#TestInfo::name}\n\n`const char* TestInfo::name() const`\n\nReturns the test name.\n\n##### type_param {#TestInfo::type_param}\n\n`const char* TestInfo::type_param() const`\n\nReturns the name of the parameter type, or `NULL` if this is not a typed or\ntype-parameterized test. See [Typed Tests](../advanced.md#typed-tests) and\n[Type-Parameterized Tests](../advanced.md#type-parameterized-tests).\n\n##### value_param {#TestInfo::value_param}\n\n`const char* TestInfo::value_param() const`\n\nReturns the text representation of the value parameter, or `NULL` if this is not\na value-parameterized test. See\n[Value-Parameterized Tests](../advanced.md#value-parameterized-tests).\n\n##### file {#TestInfo::file}\n\n`const char* TestInfo::file() const`\n\nReturns the file name where this test is defined.\n\n##### line {#TestInfo::line}\n\n`int TestInfo::line() const`\n\nReturns the line where this test is defined.\n\n##### is_in_another_shard {#TestInfo::is_in_another_shard}\n\n`bool TestInfo::is_in_another_shard() const`\n\nReturns true if this test should not be run because it's in another shard.\n\n##### should_run {#TestInfo::should_run}\n\n`bool TestInfo::should_run() const`\n\nReturns true if this test should run, that is if the test is not disabled (or it\nis disabled but the `also_run_disabled_tests` flag has been specified) and its\nfull name matches the user-specified filter.\n\nGoogleTest allows the user to filter the tests by their full names. Only the\ntests that match the filter will run. See\n[Running a Subset of the Tests](../advanced.md#running-a-subset-of-the-tests)\nfor more information.\n\n##### is_reportable {#TestInfo::is_reportable}\n\n`bool TestInfo::is_reportable() const`\n\nReturns true if and only if this test will appear in the XML report.\n\n##### result {#TestInfo::result}\n\n`const TestResult* TestInfo::result() const`\n\nReturns the result of the test. See [`TestResult`](#TestResult).\n\n### TestParamInfo {#TestParamInfo}\n\n`::testing::TestParamInfo`\n\nDescribes a parameter to a value-parameterized test. The type `T` is the type of\nthe parameter.\n\nContains the fields `param` and `index` which hold the value of the parameter\nand its integer index respectively.\n\n### UnitTest {#UnitTest}\n\n`::testing::UnitTest`\n\nThis class contains information about the test program.\n\n`UnitTest` is a singleton class. The only instance is created when\n`UnitTest::GetInstance()` is first called. This instance is never deleted.\n\n`UnitTest` is not copyable.\n\n#### Public Methods {#UnitTest-public}\n\n##### GetInstance {#UnitTest::GetInstance}\n\n`static UnitTest* UnitTest::GetInstance()`\n\nGets the singleton `UnitTest` object. The first time this method is called, a\n`UnitTest` object is constructed and returned. Consecutive calls will return the\nsame object.\n\n##### original_working_dir {#UnitTest::original_working_dir}\n\n`const char* UnitTest::original_working_dir() const`\n\nReturns the working directory when the first [`TEST()`](#TEST) or\n[`TEST_F()`](#TEST_F) was executed. The `UnitTest` object owns the string.\n\n##### current_test_suite {#UnitTest::current_test_suite}\n\n`const TestSuite* UnitTest::current_test_suite() const`\n\nReturns the [`TestSuite`](#TestSuite) object for the test that's currently\nrunning, or `NULL` if no test is running.\n\n##### current_test_info {#UnitTest::current_test_info}\n\n`const TestInfo* UnitTest::current_test_info() const`\n\nReturns the [`TestInfo`](#TestInfo) object for the test that's currently\nrunning, or `NULL` if no test is running.\n\n##### random_seed {#UnitTest::random_seed}\n\n`int UnitTest::random_seed() const`\n\nReturns the random seed used at the start of the current test run.\n\n##### successful_test_suite_count {#UnitTest::successful_test_suite_count}\n\n`int UnitTest::successful_test_suite_count() const`\n\nGets the number of successful test suites.\n\n##### failed_test_suite_count {#UnitTest::failed_test_suite_count}\n\n`int UnitTest::failed_test_suite_count() const`\n\nGets the number of failed test suites.\n\n##### total_test_suite_count {#UnitTest::total_test_suite_count}\n\n`int UnitTest::total_test_suite_count() const`\n\nGets the number of all test suites.\n\n##### test_suite_to_run_count {#UnitTest::test_suite_to_run_count}\n\n`int UnitTest::test_suite_to_run_count() const`\n\nGets the number of all test suites that contain at least one test that should\nrun.\n\n##### successful_test_count {#UnitTest::successful_test_count}\n\n`int UnitTest::successful_test_count() const`\n\nGets the number of successful tests.\n\n##### skipped_test_count {#UnitTest::skipped_test_count}\n\n`int UnitTest::skipped_test_count() const`\n\nGets the number of skipped tests.\n\n##### failed_test_count {#UnitTest::failed_test_count}\n\n`int UnitTest::failed_test_count() const`\n\nGets the number of failed tests.\n\n##### reportable_disabled_test_count {#UnitTest::reportable_disabled_test_count}\n\n`int UnitTest::reportable_disabled_test_count() const`\n\nGets the number of disabled tests that will be reported in the XML report.\n\n##### disabled_test_count {#UnitTest::disabled_test_count}\n\n`int UnitTest::disabled_test_count() const`\n\nGets the number of disabled tests.\n\n##### reportable_test_count {#UnitTest::reportable_test_count}\n\n`int UnitTest::reportable_test_count() const`\n\nGets the number of tests to be printed in the XML report.\n\n##### total_test_count {#UnitTest::total_test_count}\n\n`int UnitTest::total_test_count() const`\n\nGets the number of all tests.\n\n##### test_to_run_count {#UnitTest::test_to_run_count}\n\n`int UnitTest::test_to_run_count() const`\n\nGets the number of tests that should run.\n\n##### start_timestamp {#UnitTest::start_timestamp}\n\n`TimeInMillis UnitTest::start_timestamp() const`\n\nGets the time of the test program start, in ms from the start of the UNIX epoch.\n\n##### elapsed_time {#UnitTest::elapsed_time}\n\n`TimeInMillis UnitTest::elapsed_time() const`\n\nGets the elapsed time, in milliseconds.\n\n##### Passed {#UnitTest::Passed}\n\n`bool UnitTest::Passed() const`\n\nReturns true if and only if the unit test passed (i.e. all test suites passed).\n\n##### Failed {#UnitTest::Failed}\n\n`bool UnitTest::Failed() const`\n\nReturns true if and only if the unit test failed (i.e. some test suite failed or\nsomething outside of all tests failed).\n\n##### GetTestSuite {#UnitTest::GetTestSuite}\n\n`const TestSuite* UnitTest::GetTestSuite(int i) const`\n\nGets the [`TestSuite`](#TestSuite) object for the `i`-th test suite among all\nthe test suites. `i` can range from 0 to `total_test_suite_count() - 1`. If `i`\nis not in that range, returns `NULL`.\n\n##### ad_hoc_test_result {#UnitTest::ad_hoc_test_result}\n\n`const TestResult& UnitTest::ad_hoc_test_result() const`\n\nReturns the [`TestResult`](#TestResult) containing information on test failures\nand properties logged outside of individual test suites.\n\n##### listeners {#UnitTest::listeners}\n\n`TestEventListeners& UnitTest::listeners()`\n\nReturns the list of event listeners that can be used to track events inside\nGoogleTest. See [`TestEventListeners`](#TestEventListeners).\n\n### TestEventListener {#TestEventListener}\n\n`::testing::TestEventListener`\n\nThe interface for tracing execution of tests. The methods below are listed in\nthe order the corresponding events are fired.\n\n#### Public Methods {#TestEventListener-public}\n\n##### OnTestProgramStart {#TestEventListener::OnTestProgramStart}\n\n`virtual void TestEventListener::OnTestProgramStart(const UnitTest& unit_test)`\n\nFired before any test activity starts.\n\n##### OnTestIterationStart {#TestEventListener::OnTestIterationStart}\n\n`virtual void TestEventListener::OnTestIterationStart(const UnitTest& unit_test,\nint iteration)`\n\nFired before each iteration of tests starts. There may be more than one\niteration if `GTEST_FLAG(repeat)` is set. `iteration` is the iteration index,\nstarting from 0.\n\n##### OnEnvironmentsSetUpStart {#TestEventListener::OnEnvironmentsSetUpStart}\n\n`virtual void TestEventListener::OnEnvironmentsSetUpStart(const UnitTest&\nunit_test)`\n\nFired before environment set-up for each iteration of tests starts.\n\n##### OnEnvironmentsSetUpEnd {#TestEventListener::OnEnvironmentsSetUpEnd}\n\n`virtual void TestEventListener::OnEnvironmentsSetUpEnd(const UnitTest&\nunit_test)`\n\nFired after environment set-up for each iteration of tests ends.\n\n##### OnTestSuiteStart {#TestEventListener::OnTestSuiteStart}\n\n`virtual void TestEventListener::OnTestSuiteStart(const TestSuite& test_suite)`\n\nFired before the test suite starts.\n\n##### OnTestStart {#TestEventListener::OnTestStart}\n\n`virtual void TestEventListener::OnTestStart(const TestInfo& test_info)`\n\nFired before the test starts.\n\n##### OnTestPartResult {#TestEventListener::OnTestPartResult}\n\n`virtual void TestEventListener::OnTestPartResult(const TestPartResult&\ntest_part_result)`\n\nFired after a failed assertion or a `SUCCEED()` invocation. If you want to throw\nan exception from this function to skip to the next test, it must be an\n[`AssertionException`](#AssertionException) or inherited from it.\n\n##### OnTestEnd {#TestEventListener::OnTestEnd}\n\n`virtual void TestEventListener::OnTestEnd(const TestInfo& test_info)`\n\nFired after the test ends.\n\n##### OnTestSuiteEnd {#TestEventListener::OnTestSuiteEnd}\n\n`virtual void TestEventListener::OnTestSuiteEnd(const TestSuite& test_suite)`\n\nFired after the test suite ends.\n\n##### OnEnvironmentsTearDownStart {#TestEventListener::OnEnvironmentsTearDownStart}\n\n`virtual void TestEventListener::OnEnvironmentsTearDownStart(const UnitTest&\nunit_test)`\n\nFired before environment tear-down for each iteration of tests starts.\n\n##### OnEnvironmentsTearDownEnd {#TestEventListener::OnEnvironmentsTearDownEnd}\n\n`virtual void TestEventListener::OnEnvironmentsTearDownEnd(const UnitTest&\nunit_test)`\n\nFired after environment tear-down for each iteration of tests ends.\n\n##### OnTestIterationEnd {#TestEventListener::OnTestIterationEnd}\n\n`virtual void TestEventListener::OnTestIterationEnd(const UnitTest& unit_test,\nint iteration)`\n\nFired after each iteration of tests finishes.\n\n##### OnTestProgramEnd {#TestEventListener::OnTestProgramEnd}\n\n`virtual void TestEventListener::OnTestProgramEnd(const UnitTest& unit_test)`\n\nFired after all test activities have ended.\n\n### TestEventListeners {#TestEventListeners}\n\n`::testing::TestEventListeners`\n\nLets users add listeners to track events in GoogleTest.\n\n#### Public Methods {#TestEventListeners-public}\n\n##### Append {#TestEventListeners::Append}\n\n`void TestEventListeners::Append(TestEventListener* listener)`\n\nAppends an event listener to the end of the list. GoogleTest assumes ownership\nof the listener (i.e. it will delete the listener when the test program\nfinishes).\n\n##### Release {#TestEventListeners::Release}\n\n`TestEventListener* TestEventListeners::Release(TestEventListener* listener)`\n\nRemoves the given event listener from the list and returns it. It then becomes\nthe caller's responsibility to delete the listener. Returns `NULL` if the\nlistener is not found in the list.\n\n##### default_result_printer {#TestEventListeners::default_result_printer}\n\n`TestEventListener* TestEventListeners::default_result_printer() const`\n\nReturns the standard listener responsible for the default console output. Can be\nremoved from the listeners list to shut down default console output. Note that\nremoving this object from the listener list with\n[`Release()`](#TestEventListeners::Release) transfers its ownership to the\ncaller and makes this function return `NULL` the next time.\n\n##### default_xml_generator {#TestEventListeners::default_xml_generator}\n\n`TestEventListener* TestEventListeners::default_xml_generator() const`\n\nReturns the standard listener responsible for the default XML output controlled\nby the `--gtest_output=xml` flag. Can be removed from the listeners list by\nusers who want to shut down the default XML output controlled by this flag and\nsubstitute it with custom one. Note that removing this object from the listener\nlist with [`Release()`](#TestEventListeners::Release) transfers its ownership to\nthe caller and makes this function return `NULL` the next time.\n\n### TestPartResult {#TestPartResult}\n\n`::testing::TestPartResult`\n\nA copyable object representing the result of a test part (i.e. an assertion or\nan explicit `FAIL()`, `ADD_FAILURE()`, or `SUCCESS()`).\n\n#### Public Methods {#TestPartResult-public}\n\n##### type {#TestPartResult::type}\n\n`Type TestPartResult::type() const`\n\nGets the outcome of the test part.\n\nThe return type `Type` is an enum defined as follows:\n\n```cpp\nenum Type {\n kSuccess, // Succeeded.\n kNonFatalFailure, // Failed but the test can continue.\n kFatalFailure, // Failed and the test should be terminated.\n kSkip // Skipped.\n};\n```\n\n##### file_name {#TestPartResult::file_name}\n\n`const char* TestPartResult::file_name() const`\n\nGets the name of the source file where the test part took place, or `NULL` if\nit's unknown.\n\n##### line_number {#TestPartResult::line_number}\n\n`int TestPartResult::line_number() const`\n\nGets the line in the source file where the test part took place, or `-1` if it's\nunknown.\n\n##### summary {#TestPartResult::summary}\n\n`const char* TestPartResult::summary() const`\n\nGets the summary of the failure message.\n\n##### message {#TestPartResult::message}\n\n`const char* TestPartResult::message() const`\n\nGets the message associated with the test part.\n\n##### skipped {#TestPartResult::skipped}\n\n`bool TestPartResult::skipped() const`\n\nReturns true if and only if the test part was skipped.\n\n##### passed {#TestPartResult::passed}\n\n`bool TestPartResult::passed() const`\n\nReturns true if and only if the test part passed.\n\n##### nonfatally_failed {#TestPartResult::nonfatally_failed}\n\n`bool TestPartResult::nonfatally_failed() const`\n\nReturns true if and only if the test part non-fatally failed.\n\n##### fatally_failed {#TestPartResult::fatally_failed}\n\n`bool TestPartResult::fatally_failed() const`\n\nReturns true if and only if the test part fatally failed.\n\n##### failed {#TestPartResult::failed}\n\n`bool TestPartResult::failed() const`\n\nReturns true if and only if the test part failed.\n\n### TestProperty {#TestProperty}\n\n`::testing::TestProperty`\n\nA copyable object representing a user-specified test property which can be\noutput as a key/value string pair.\n\n#### Public Methods {#TestProperty-public}\n\n##### key {#key}\n\n`const char* key() const`\n\nGets the user-supplied key.\n\n##### value {#value}\n\n`const char* value() const`\n\nGets the user-supplied value.\n\n##### SetValue {#SetValue}\n\n`void SetValue(const std::string& new_value)`\n\nSets a new value, overriding the previous one.\n\n### TestResult {#TestResult}\n\n`::testing::TestResult`\n\nContains information about the result of a single test.\n\n`TestResult` is not copyable.\n\n#### Public Methods {#TestResult-public}\n\n##### total_part_count {#TestResult::total_part_count}\n\n`int TestResult::total_part_count() const`\n\nGets the number of all test parts. This is the sum of the number of successful\ntest parts and the number of failed test parts.\n\n##### test_property_count {#TestResult::test_property_count}\n\n`int TestResult::test_property_count() const`\n\nReturns the number of test properties.\n\n##### Passed {#TestResult::Passed}\n\n`bool TestResult::Passed() const`\n\nReturns true if and only if the test passed (i.e. no test part failed).\n\n##### Skipped {#TestResult::Skipped}\n\n`bool TestResult::Skipped() const`\n\nReturns true if and only if the test was skipped.\n\n##### Failed {#TestResult::Failed}\n\n`bool TestResult::Failed() const`\n\nReturns true if and only if the test failed.\n\n##### HasFatalFailure {#TestResult::HasFatalFailure}\n\n`bool TestResult::HasFatalFailure() const`\n\nReturns true if and only if the test fatally failed.\n\n##### HasNonfatalFailure {#TestResult::HasNonfatalFailure}\n\n`bool TestResult::HasNonfatalFailure() const`\n\nReturns true if and only if the test has a non-fatal failure.\n\n##### elapsed_time {#TestResult::elapsed_time}\n\n`TimeInMillis TestResult::elapsed_time() const`\n\nReturns the elapsed time, in milliseconds.\n\n##### start_timestamp {#TestResult::start_timestamp}\n\n`TimeInMillis TestResult::start_timestamp() const`\n\nGets the time of the test case start, in ms from the start of the UNIX epoch.\n\n##### GetTestPartResult {#TestResult::GetTestPartResult}\n\n`const TestPartResult& TestResult::GetTestPartResult(int i) const`\n\nReturns the [`TestPartResult`](#TestPartResult) for the `i`-th test part result\namong all the results. `i` can range from 0 to `total_part_count() - 1`. If `i`\nis not in that range, aborts the program.\n\n##### GetTestProperty {#TestResult::GetTestProperty}\n\n`const TestProperty& TestResult::GetTestProperty(int i) const`\n\nReturns the [`TestProperty`](#TestProperty) object for the `i`-th test property.\n`i` can range from 0 to `test_property_count() - 1`. If `i` is not in that\nrange, aborts the program.\n\n### TimeInMillis {#TimeInMillis}\n\n`::testing::TimeInMillis`\n\nAn integer type representing time in milliseconds.\n\n### Types {#Types}\n\n`::testing::Types`\n\nRepresents a list of types for use in typed tests and type-parameterized tests.\n\nThe template argument `T...` can be any number of types, for example:\n\n```\n::testing::Types\n```\n\nSee [Typed Tests](../advanced.md#typed-tests) and\n[Type-Parameterized Tests](../advanced.md#type-parameterized-tests) for more\ninformation.\n\n### WithParamInterface {#WithParamInterface}\n\n`::testing::WithParamInterface`\n\nThe pure interface class that all value-parameterized tests inherit from.\n\nA value-parameterized test fixture class must inherit from both [`Test`](#Test)\nand `WithParamInterface`. In most cases that just means inheriting from\n[`TestWithParam`](#TestWithParam), but more complicated test hierarchies may\nneed to inherit from `Test` and `WithParamInterface` at different levels.\n\nThis interface defines the type alias `ParamType` for the parameter type `T` and\nhas support for accessing the test parameter value via the `GetParam()` method:\n\n```\nstatic const ParamType& GetParam()\n```\n\nFor more information, see\n[Value-Parameterized Tests](../advanced.md#value-parameterized-tests).\n\n## Functions\n\nGoogleTest defines the following functions to help with writing and running\ntests.\n\n### InitGoogleTest {#InitGoogleTest}\n\n`void ::testing::InitGoogleTest(int* argc, char** argv)` \\\n`void ::testing::InitGoogleTest(int* argc, wchar_t** argv)` \\\n`void ::testing::InitGoogleTest()`\n\nInitializes GoogleTest. This must be called before calling\n[`RUN_ALL_TESTS()`](#RUN_ALL_TESTS). In particular, it parses the command line\nfor the flags that GoogleTest recognizes. Whenever a GoogleTest flag is seen, it\nis removed from `argv`, and `*argc` is decremented.\n\nNo value is returned. Instead, the GoogleTest flag variables are updated.\n\nThe `InitGoogleTest(int* argc, wchar_t** argv)` overload can be used in Windows\nprograms compiled in `UNICODE` mode.\n\nThe argument-less `InitGoogleTest()` overload can be used on Arduino/embedded\nplatforms where there is no `argc`/`argv`.\n\n### AddGlobalTestEnvironment {#AddGlobalTestEnvironment}\n\n`Environment* ::testing::AddGlobalTestEnvironment(Environment* env)`\n\nAdds a test environment to the test program. Must be called before\n[`RUN_ALL_TESTS()`](#RUN_ALL_TESTS) is called. See\n[Global Set-Up and Tear-Down](../advanced.md#global-set-up-and-tear-down) for\nmore information.\n\nSee also [`Environment`](#Environment).\n\n### RegisterTest {#RegisterTest}\n\n```cpp\ntemplate \nTestInfo* ::testing::RegisterTest(const char* test_suite_name, const char* test_name,\n const char* type_param, const char* value_param,\n const char* file, int line, Factory factory)\n```\n\nDynamically registers a test with the framework.\n\nThe `factory` argument is a factory callable (move-constructible) object or\nfunction pointer that creates a new instance of the `Test` object. It handles\nownership to the caller. The signature of the callable is `Fixture*()`, where\n`Fixture` is the test fixture class for the test. All tests registered with the\nsame `test_suite_name` must return the same fixture type. This is checked at\nruntime.\n\nThe framework will infer the fixture class from the factory and will call the\n`SetUpTestSuite` and `TearDownTestSuite` methods for it.\n\nMust be called before [`RUN_ALL_TESTS()`](#RUN_ALL_TESTS) is invoked, otherwise\nbehavior is undefined.\n\nSee\n[Registering tests programmatically](../advanced.md#registering-tests-programmatically)\nfor more information.\n\n### RUN_ALL_TESTS {#RUN_ALL_TESTS}\n\n`int RUN_ALL_TESTS()`\n\nUse this function in `main()` to run all tests. It returns `0` if all tests are\nsuccessful, or `1` otherwise.\n\n`RUN_ALL_TESTS()` should be invoked after the command line has been parsed by\n[`InitGoogleTest()`](#InitGoogleTest).\n\nThis function was formerly a macro; thus, it is in the global namespace and has\nan all-caps name.\n\n### AssertionSuccess {#AssertionSuccess}\n\n`AssertionResult ::testing::AssertionSuccess()`\n\nCreates a successful assertion result. See\n[`AssertionResult`](#AssertionResult).\n\n### AssertionFailure {#AssertionFailure}\n\n`AssertionResult ::testing::AssertionFailure()`\n\nCreates a failed assertion result. Use the `<<` operator to store a failure\nmessage:\n\n```cpp\n::testing::AssertionFailure() << \"My failure message\";\n```\n\nSee [`AssertionResult`](#AssertionResult).\n\n### StaticAssertTypeEq {#StaticAssertTypeEq}\n\n`::testing::StaticAssertTypeEq()`\n\nCompile-time assertion for type equality. Compiles if and only if `T1` and `T2`\nare the same type. The value it returns is irrelevant.\n\nSee [Type Assertions](../advanced.md#type-assertions) for more information.\n\n### PrintToString {#PrintToString}\n\n`std::string ::testing::PrintToString(x)`\n\nPrints any value `x` using GoogleTest's value printer.\n\nSee\n[Teaching GoogleTest How to Print Your Values](../advanced.md#teaching-googletest-how-to-print-your-values)\nfor more information.\n\n### PrintToStringParamName {#PrintToStringParamName}\n\n`std::string ::testing::PrintToStringParamName(TestParamInfo& info)`\n\nA built-in parameterized test name generator which returns the result of\n[`PrintToString`](#PrintToString) called on `info.param`. Does not work when the\ntest parameter is a `std::string` or C string. See\n[Specifying Names for Value-Parameterized Test Parameters](../advanced.md#specifying-names-for-value-parameterized-test-parameters)\nfor more information.\n\nSee also [`TestParamInfo`](#TestParamInfo) and\n[`INSTANTIATE_TEST_SUITE_P`](#INSTANTIATE_TEST_SUITE_P).\n" }, { "path": "3rd/googletest-1.12.1/docs/samples.md", "content": "# Googletest Samples\n\nIf you're like us, you'd like to look at\n[googletest samples.](https://github.com/google/googletest/tree/master/googletest/samples)\nThe sample directory has a number of well-commented samples showing how to use a\nvariety of googletest features.\n\n* Sample #1 shows the basic steps of using googletest to test C++ functions.\n* Sample #2 shows a more complex unit test for a class with multiple member\n functions.\n* Sample #3 uses a test fixture.\n* Sample #4 teaches you how to use googletest and `googletest.h` together to\n get the best of both libraries.\n* Sample #5 puts shared testing logic in a base test fixture, and reuses it in\n derived fixtures.\n* Sample #6 demonstrates type-parameterized tests.\n* Sample #7 teaches the basics of value-parameterized tests.\n* Sample #8 shows using `Combine()` in value-parameterized tests.\n* Sample #9 shows use of the listener API to modify Google Test's console\n output and the use of its reflection API to inspect test results.\n* Sample #10 shows use of the listener API to implement a primitive memory\n leak checker.\n" }, { "path": "3rd/googletest-1.12.1/googlemock/CMakeLists.txt", "content": "########################################################################\n# Note: CMake support is community-based. The maintainers do not use CMake\n# internally.\n#\n# CMake build script for Google Mock.\n#\n# To run the tests for Google Mock itself on Linux, use 'make test' or\n# ctest. You can select which tests to run using 'ctest -R regex'.\n# For more options, run 'ctest --help'.\n\noption(gmock_build_tests \"Build all of Google Mock's own tests.\" OFF)\n\n# A directory to find Google Test sources.\nif (EXISTS \"${CMAKE_CURRENT_SOURCE_DIR}/gtest/CMakeLists.txt\")\n set(gtest_dir gtest)\nelse()\n set(gtest_dir ../googletest)\nendif()\n\n# Defines pre_project_set_up_hermetic_build() and set_up_hermetic_build().\ninclude(\"${gtest_dir}/cmake/hermetic_build.cmake\" OPTIONAL)\n\nif (COMMAND pre_project_set_up_hermetic_build)\n # Google Test also calls hermetic setup functions from add_subdirectory,\n # although its changes will not affect things at the current scope.\n pre_project_set_up_hermetic_build()\nendif()\n\n########################################################################\n#\n# Project-wide settings\n\n# Name of the project.\n#\n# CMake files in this project can refer to the root source directory\n# as ${gmock_SOURCE_DIR} and to the root binary directory as\n# ${gmock_BINARY_DIR}.\n# Language \"C\" is required for find_package(Threads).\ncmake_minimum_required(VERSION 3.5)\ncmake_policy(SET CMP0048 NEW)\nproject(gmock VERSION ${GOOGLETEST_VERSION} LANGUAGES CXX C)\n\nif (COMMAND set_up_hermetic_build)\n set_up_hermetic_build()\nendif()\n\n# Instructs CMake to process Google Test's CMakeLists.txt and add its\n# targets to the current scope. We are placing Google Test's binary\n# directory in a subdirectory of our own as VC compilation may break\n# if they are the same (the default).\nadd_subdirectory(\"${gtest_dir}\" \"${gmock_BINARY_DIR}/${gtest_dir}\")\n\n\n# These commands only run if this is the main project\nif(CMAKE_PROJECT_NAME STREQUAL \"gmock\" OR CMAKE_PROJECT_NAME STREQUAL \"googletest-distribution\")\n # BUILD_SHARED_LIBS is a standard CMake variable, but we declare it here to\n # make it prominent in the GUI.\n option(BUILD_SHARED_LIBS \"Build shared libraries (DLLs).\" OFF)\nelse()\n mark_as_advanced(gmock_build_tests)\nendif()\n\n# Although Google Test's CMakeLists.txt calls this function, the\n# changes there don't affect the current scope. Therefore we have to\n# call it again here.\nconfig_compiler_and_linker() # from ${gtest_dir}/cmake/internal_utils.cmake\n\n# Adds Google Mock's and Google Test's header directories to the search path.\nset(gmock_build_include_dirs\n \"${gmock_SOURCE_DIR}/include\"\n \"${gmock_SOURCE_DIR}\"\n \"${gtest_SOURCE_DIR}/include\"\n # This directory is needed to build directly from Google Test sources.\n \"${gtest_SOURCE_DIR}\")\ninclude_directories(${gmock_build_include_dirs})\n\n########################################################################\n#\n# Defines the gmock & gmock_main libraries. User tests should link\n# with one of them.\n\n# Google Mock libraries. We build them using more strict warnings than what\n# are used for other targets, to ensure that Google Mock can be compiled by\n# a user aggressive about warnings.\nif (MSVC)\n cxx_library(gmock\n \"${cxx_strict}\"\n \"${gtest_dir}/src/gtest-all.cc\"\n src/gmock-all.cc)\n\n cxx_library(gmock_main\n \"${cxx_strict}\"\n \"${gtest_dir}/src/gtest-all.cc\"\n src/gmock-all.cc\n src/gmock_main.cc)\nelse()\n cxx_library(gmock \"${cxx_strict}\" src/gmock-all.cc)\n target_link_libraries(gmock PUBLIC gtest)\n set_target_properties(gmock PROPERTIES VERSION ${GOOGLETEST_VERSION})\n cxx_library(gmock_main \"${cxx_strict}\" src/gmock_main.cc)\n target_link_libraries(gmock_main PUBLIC gmock)\n set_target_properties(gmock_main PROPERTIES VERSION ${GOOGLETEST_VERSION})\nendif()\n# If the CMake version supports it, attach header directory information\n# to the targets for when we are part of a parent build (ie being pulled\n# in via add_subdirectory() rather than being a standalone build).\nif (DEFINED CMAKE_VERSION AND NOT \"${CMAKE_VERSION}\" VERSION_LESS \"2.8.11\")\n string(REPLACE \";\" \"$\" dirs \"${gmock_build_include_dirs}\")\n target_include_directories(gmock SYSTEM INTERFACE\n \"$\"\n \"$/${CMAKE_INSTALL_INCLUDEDIR}>\")\n target_include_directories(gmock_main SYSTEM INTERFACE\n \"$\"\n \"$/${CMAKE_INSTALL_INCLUDEDIR}>\")\nendif()\n\n########################################################################\n#\n# Install rules\ninstall_project(gmock gmock_main)\n\n########################################################################\n#\n# Google Mock's own tests.\n#\n# You can skip this section if you aren't interested in testing\n# Google Mock itself.\n#\n# The tests are not built by default. To build them, set the\n# gmock_build_tests option to ON. You can do it by running ccmake\n# or specifying the -Dgmock_build_tests=ON flag when running cmake.\n\nif (gmock_build_tests)\n # This must be set in the root directory for the tests to be run by\n # 'make test' or ctest.\n enable_testing()\n\n if (MINGW OR CYGWIN)\n if (CMAKE_VERSION VERSION_LESS \"2.8.12\")\n add_compile_options(\"-Wa,-mbig-obj\")\n else()\n add_definitions(\"-Wa,-mbig-obj\")\n endif()\n endif()\n\n ############################################################\n # C++ tests built with standard compiler flags.\n\n cxx_test(gmock-actions_test gmock_main)\n cxx_test(gmock-cardinalities_test gmock_main)\n cxx_test(gmock_ex_test gmock_main)\n cxx_test(gmock-function-mocker_test gmock_main)\n cxx_test(gmock-internal-utils_test gmock_main)\n cxx_test(gmock-matchers-arithmetic_test gmock_main)\n cxx_test(gmock-matchers-comparisons_test gmock_main)\n cxx_test(gmock-matchers-containers_test gmock_main)\n cxx_test(gmock-matchers-misc_test gmock_main)\n cxx_test(gmock-more-actions_test gmock_main)\n cxx_test(gmock-nice-strict_test gmock_main)\n cxx_test(gmock-port_test gmock_main)\n cxx_test(gmock-spec-builders_test gmock_main)\n cxx_test(gmock_link_test gmock_main test/gmock_link2_test.cc)\n cxx_test(gmock_test gmock_main)\n\n if (DEFINED GTEST_HAS_PTHREAD)\n cxx_test(gmock_stress_test gmock)\n endif()\n\n # gmock_all_test is commented to save time building and running tests.\n # Uncomment if necessary.\n # cxx_test(gmock_all_test gmock_main)\n\n ############################################################\n # C++ tests built with non-standard compiler flags.\n\n if (MSVC)\n cxx_library(gmock_main_no_exception \"${cxx_no_exception}\"\n \"${gtest_dir}/src/gtest-all.cc\" src/gmock-all.cc src/gmock_main.cc)\n\n cxx_library(gmock_main_no_rtti \"${cxx_no_rtti}\"\n \"${gtest_dir}/src/gtest-all.cc\" src/gmock-all.cc src/gmock_main.cc)\n\n else()\n cxx_library(gmock_main_no_exception \"${cxx_no_exception}\" src/gmock_main.cc)\n target_link_libraries(gmock_main_no_exception PUBLIC gmock)\n\n cxx_library(gmock_main_no_rtti \"${cxx_no_rtti}\" src/gmock_main.cc)\n target_link_libraries(gmock_main_no_rtti PUBLIC gmock)\n endif()\n cxx_test_with_flags(gmock-more-actions_no_exception_test \"${cxx_no_exception}\"\n gmock_main_no_exception test/gmock-more-actions_test.cc)\n\n cxx_test_with_flags(gmock_no_rtti_test \"${cxx_no_rtti}\"\n gmock_main_no_rtti test/gmock-spec-builders_test.cc)\n\n cxx_shared_library(shared_gmock_main \"${cxx_default}\"\n \"${gtest_dir}/src/gtest-all.cc\" src/gmock-all.cc src/gmock_main.cc)\n\n # Tests that a binary can be built with Google Mock as a shared library. On\n # some system configurations, it may not possible to run the binary without\n # knowing more details about the system configurations. We do not try to run\n # this binary. To get a more robust shared library coverage, configure with\n # -DBUILD_SHARED_LIBS=ON.\n cxx_executable_with_flags(shared_gmock_test_ \"${cxx_default}\"\n shared_gmock_main test/gmock-spec-builders_test.cc)\n set_target_properties(shared_gmock_test_\n PROPERTIES\n COMPILE_DEFINITIONS \"GTEST_LINKED_AS_SHARED_LIBRARY=1\")\n\n ############################################################\n # Python tests.\n\n cxx_executable(gmock_leak_test_ test gmock_main)\n py_test(gmock_leak_test)\n\n cxx_executable(gmock_output_test_ test gmock)\n py_test(gmock_output_test)\nendif()\n" }, { "path": "3rd/googletest-1.12.1/googlemock/README.md", "content": "# Googletest Mocking (gMock) Framework\n\n### Overview\n\nGoogle's framework for writing and using C++ mock classes. It can help you\nderive better designs of your system and write better tests.\n\nIt is inspired by:\n\n* [jMock](http://www.jmock.org/)\n* [EasyMock](http://www.easymock.org/)\n* [Hamcrest](http://code.google.com/p/hamcrest/)\n\nIt is designed with C++'s specifics in mind.\n\ngMock:\n\n- Provides a declarative syntax for defining mocks.\n- Can define partial (hybrid) mocks, which are a cross of real and mock\n objects.\n- Handles functions of arbitrary types and overloaded functions.\n- Comes with a rich set of matchers for validating function arguments.\n- Uses an intuitive syntax for controlling the behavior of a mock.\n- Does automatic verification of expectations (no record-and-replay needed).\n- Allows arbitrary (partial) ordering constraints on function calls to be\n expressed.\n- Lets a user extend it by defining new matchers and actions.\n- Does not use exceptions.\n- Is easy to learn and use.\n\nDetails and examples can be found here:\n\n* [gMock for Dummies](https://google.github.io/googletest/gmock_for_dummies.html)\n* [Legacy gMock FAQ](https://google.github.io/googletest/gmock_faq.html)\n* [gMock Cookbook](https://google.github.io/googletest/gmock_cook_book.html)\n* [gMock Cheat Sheet](https://google.github.io/googletest/gmock_cheat_sheet.html)\n\nGoogleMock is a part of\n[GoogleTest C++ testing framework](http://github.com/google/googletest/) and a\nsubject to the same requirements.\n" }, { "path": "3rd/googletest-1.12.1/googlemock/cmake/gmock.pc.in", "content": "libdir=@CMAKE_INSTALL_FULL_LIBDIR@\nincludedir=@CMAKE_INSTALL_FULL_INCLUDEDIR@\n\nName: gmock\nDescription: GoogleMock (without main() function)\nVersion: @PROJECT_VERSION@\nURL: https://github.com/google/googletest\nRequires: gtest = @PROJECT_VERSION@\nLibs: -L${libdir} -lgmock @CMAKE_THREAD_LIBS_INIT@\nCflags: -I${includedir} @GTEST_HAS_PTHREAD_MACRO@\n" }, { "path": "3rd/googletest-1.12.1/googlemock/cmake/gmock_main.pc.in", "content": "libdir=@CMAKE_INSTALL_FULL_LIBDIR@\nincludedir=@CMAKE_INSTALL_FULL_INCLUDEDIR@\n\nName: gmock_main\nDescription: GoogleMock (with main() function)\nVersion: @PROJECT_VERSION@\nURL: https://github.com/google/googletest\nRequires: gmock = @PROJECT_VERSION@\nLibs: -L${libdir} -lgmock_main @CMAKE_THREAD_LIBS_INIT@\nCflags: -I${includedir} @GTEST_HAS_PTHREAD_MACRO@\n" }, { "path": "3rd/googletest-1.12.1/googlemock/docs/README.md", "content": "# Content Moved\n\nWe are working on updates to the GoogleTest documentation, which has moved to\nthe top-level [docs](../../docs) directory.\n" }, { "path": "3rd/googletest-1.12.1/googlemock/include/gmock/gmock-actions.h", "content": "// Copyright 2007, Google Inc.\n// All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Google Mock - a framework for writing C++ mock classes.\n//\n// The ACTION* family of macros can be used in a namespace scope to\n// define custom actions easily. The syntax:\n//\n// ACTION(name) { statements; }\n//\n// will define an action with the given name that executes the\n// statements. The value returned by the statements will be used as\n// the return value of the action. Inside the statements, you can\n// refer to the K-th (0-based) argument of the mock function by\n// 'argK', and refer to its type by 'argK_type'. For example:\n//\n// ACTION(IncrementArg1) {\n// arg1_type temp = arg1;\n// return ++(*temp);\n// }\n//\n// allows you to write\n//\n// ...WillOnce(IncrementArg1());\n//\n// You can also refer to the entire argument tuple and its type by\n// 'args' and 'args_type', and refer to the mock function type and its\n// return type by 'function_type' and 'return_type'.\n//\n// Note that you don't need to specify the types of the mock function\n// arguments. However rest assured that your code is still type-safe:\n// you'll get a compiler error if *arg1 doesn't support the ++\n// operator, or if the type of ++(*arg1) isn't compatible with the\n// mock function's return type, for example.\n//\n// Sometimes you'll want to parameterize the action. For that you can use\n// another macro:\n//\n// ACTION_P(name, param_name) { statements; }\n//\n// For example:\n//\n// ACTION_P(Add, n) { return arg0 + n; }\n//\n// will allow you to write:\n//\n// ...WillOnce(Add(5));\n//\n// Note that you don't need to provide the type of the parameter\n// either. If you need to reference the type of a parameter named\n// 'foo', you can write 'foo_type'. For example, in the body of\n// ACTION_P(Add, n) above, you can write 'n_type' to refer to the type\n// of 'n'.\n//\n// We also provide ACTION_P2, ACTION_P3, ..., up to ACTION_P10 to support\n// multi-parameter actions.\n//\n// For the purpose of typing, you can view\n//\n// ACTION_Pk(Foo, p1, ..., pk) { ... }\n//\n// as shorthand for\n//\n// template \n// FooActionPk Foo(p1_type p1, ..., pk_type pk) { ... }\n//\n// In particular, you can provide the template type arguments\n// explicitly when invoking Foo(), as in Foo(5, false);\n// although usually you can rely on the compiler to infer the types\n// for you automatically. You can assign the result of expression\n// Foo(p1, ..., pk) to a variable of type FooActionPk. This can be useful when composing actions.\n//\n// You can also overload actions with different numbers of parameters:\n//\n// ACTION_P(Plus, a) { ... }\n// ACTION_P2(Plus, a, b) { ... }\n//\n// While it's tempting to always use the ACTION* macros when defining\n// a new action, you should also consider implementing ActionInterface\n// or using MakePolymorphicAction() instead, especially if you need to\n// use the action a lot. While these approaches require more work,\n// they give you more control on the types of the mock function\n// arguments and the action parameters, which in general leads to\n// better compiler error messages that pay off in the long run. They\n// also allow overloading actions based on parameter types (as opposed\n// to just based on the number of parameters).\n//\n// CAVEAT:\n//\n// ACTION*() can only be used in a namespace scope as templates cannot be\n// declared inside of a local class.\n// Users can, however, define any local functors (e.g. a lambda) that\n// can be used as actions.\n//\n// MORE INFORMATION:\n//\n// To learn more about using these macros, please search for 'ACTION' on\n// https://github.com/google/googletest/blob/master/docs/gmock_cook_book.md\n\n// IWYU pragma: private, include \"gmock/gmock.h\"\n// IWYU pragma: friend gmock/.*\n\n#ifndef GOOGLEMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_\n#define GOOGLEMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_\n\n#ifndef _WIN32_WCE\n#include \n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"gmock/internal/gmock-internal-utils.h\"\n#include \"gmock/internal/gmock-port.h\"\n#include \"gmock/internal/gmock-pp.h\"\n\n#ifdef _MSC_VER\n#pragma warning(push)\n#pragma warning(disable : 4100)\n#endif\n\nnamespace testing {\n\n// To implement an action Foo, define:\n// 1. a class FooAction that implements the ActionInterface interface, and\n// 2. a factory function that creates an Action object from a\n// const FooAction*.\n//\n// The two-level delegation design follows that of Matcher, providing\n// consistency for extension developers. It also eases ownership\n// management as Action objects can now be copied like plain values.\n\nnamespace internal {\n\n// BuiltInDefaultValueGetter::Get() returns a\n// default-constructed T value. BuiltInDefaultValueGetter::Get() crashes with an error.\n//\n// This primary template is used when kDefaultConstructible is true.\ntemplate \nstruct BuiltInDefaultValueGetter {\n static T Get() { return T(); }\n};\ntemplate \nstruct BuiltInDefaultValueGetter {\n static T Get() {\n Assert(false, __FILE__, __LINE__,\n \"Default action undefined for the function return type.\");\n return internal::Invalid();\n // The above statement will never be reached, but is required in\n // order for this function to compile.\n }\n};\n\n// BuiltInDefaultValue::Get() returns the \"built-in\" default value\n// for type T, which is NULL when T is a raw pointer type, 0 when T is\n// a numeric type, false when T is bool, or \"\" when T is string or\n// std::string. In addition, in C++11 and above, it turns a\n// default-constructed T value if T is default constructible. For any\n// other type T, the built-in default T value is undefined, and the\n// function will abort the process.\ntemplate \nclass BuiltInDefaultValue {\n public:\n // This function returns true if and only if type T has a built-in default\n // value.\n static bool Exists() { return ::std::is_default_constructible::value; }\n\n static T Get() {\n return BuiltInDefaultValueGetter<\n T, ::std::is_default_constructible::value>::Get();\n }\n};\n\n// This partial specialization says that we use the same built-in\n// default value for T and const T.\ntemplate \nclass BuiltInDefaultValue {\n public:\n static bool Exists() { return BuiltInDefaultValue::Exists(); }\n static T Get() { return BuiltInDefaultValue::Get(); }\n};\n\n// This partial specialization defines the default values for pointer\n// types.\ntemplate \nclass BuiltInDefaultValue {\n public:\n static bool Exists() { return true; }\n static T* Get() { return nullptr; }\n};\n\n// The following specializations define the default values for\n// specific types we care about.\n#define GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(type, value) \\\n template <> \\\n class BuiltInDefaultValue { \\\n public: \\\n static bool Exists() { return true; } \\\n static type Get() { return value; } \\\n }\n\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(void, ); // NOLINT\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(::std::string, \"\");\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(bool, false);\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned char, '\\0');\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed char, '\\0');\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(char, '\\0');\n\n// There's no need for a default action for signed wchar_t, as that\n// type is the same as wchar_t for gcc, and invalid for MSVC.\n//\n// There's also no need for a default action for unsigned wchar_t, as\n// that type is the same as unsigned int for gcc, and invalid for\n// MSVC.\n#if GMOCK_WCHAR_T_IS_NATIVE_\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(wchar_t, 0U); // NOLINT\n#endif\n\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned short, 0U); // NOLINT\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed short, 0); // NOLINT\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned int, 0U);\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed int, 0);\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned long, 0UL); // NOLINT\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed long, 0L); // NOLINT\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(unsigned long long, 0); // NOLINT\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(signed long long, 0); // NOLINT\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(float, 0);\nGMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_(double, 0);\n\n#undef GMOCK_DEFINE_DEFAULT_ACTION_FOR_RETURN_TYPE_\n\n// Partial implementations of metaprogramming types from the standard library\n// not available in C++11.\n\ntemplate \nstruct negation\n // NOLINTNEXTLINE\n : std::integral_constant {};\n\n// Base case: with zero predicates the answer is always true.\ntemplate \nstruct conjunction : std::true_type {};\n\n// With a single predicate, the answer is that predicate.\ntemplate \nstruct conjunction : P1 {};\n\n// With multiple predicates the answer is the first predicate if that is false,\n// and we recurse otherwise.\ntemplate \nstruct conjunction\n : std::conditional, P1>::type {};\n\ntemplate \nstruct disjunction : std::false_type {};\n\ntemplate \nstruct disjunction : P1 {};\n\ntemplate \nstruct disjunction\n // NOLINTNEXTLINE\n : std::conditional, P1>::type {};\n\ntemplate \nusing void_t = void;\n\n// Detects whether an expression of type `From` can be implicitly converted to\n// `To` according to [conv]. In C++17, [conv]/3 defines this as follows:\n//\n// An expression e can be implicitly converted to a type T if and only if\n// the declaration T t=e; is well-formed, for some invented temporary\n// variable t ([dcl.init]).\n//\n// [conv]/2 implies we can use function argument passing to detect whether this\n// initialization is valid.\n//\n// Note that this is distinct from is_convertible, which requires this be valid:\n//\n// To test() {\n// return declval();\n// }\n//\n// In particular, is_convertible doesn't give the correct answer when `To` and\n// `From` are the same non-moveable type since `declval` will be an rvalue\n// reference, defeating the guaranteed copy elision that would otherwise make\n// this function work.\n//\n// REQUIRES: `From` is not cv void.\ntemplate \nstruct is_implicitly_convertible {\n private:\n // A function that accepts a parameter of type T. This can be called with type\n // U successfully only if U is implicitly convertible to T.\n template \n static void Accept(T);\n\n // A function that creates a value of type T.\n template \n static T Make();\n\n // An overload be selected when implicit conversion from T to To is possible.\n template (Make()))>\n static std::true_type TestImplicitConversion(int);\n\n // A fallback overload selected in all other cases.\n template \n static std::false_type TestImplicitConversion(...);\n\n public:\n using type = decltype(TestImplicitConversion(0));\n static constexpr bool value = type::value;\n};\n\n// Like std::invoke_result_t from C++17, but works only for objects with call\n// operators (not e.g. member function pointers, which we don't need specific\n// support for in OnceAction because std::function deals with them).\ntemplate \nusing call_result_t = decltype(std::declval()(std::declval()...));\n\ntemplate \nstruct is_callable_r_impl : std::false_type {};\n\n// Specialize the struct for those template arguments where call_result_t is\n// well-formed. When it's not, the generic template above is chosen, resulting\n// in std::false_type.\ntemplate \nstruct is_callable_r_impl>, R, F, Args...>\n : std::conditional<\n std::is_void::value, //\n std::true_type, //\n is_implicitly_convertible, R>>::type {};\n\n// Like std::is_invocable_r from C++17, but works only for objects with call\n// operators. See the note on call_result_t.\ntemplate \nusing is_callable_r = is_callable_r_impl;\n\n// Like std::as_const from C++17.\ntemplate \ntypename std::add_const::type& as_const(T& t) {\n return t;\n}\n\n} // namespace internal\n\n// Specialized for function types below.\ntemplate \nclass OnceAction;\n\n// An action that can only be used once.\n//\n// This is accepted by WillOnce, which doesn't require the underlying action to\n// be copy-constructible (only move-constructible), and promises to invoke it as\n// an rvalue reference. This allows the action to work with move-only types like\n// std::move_only_function in a type-safe manner.\n//\n// For example:\n//\n// // Assume we have some API that needs to accept a unique pointer to some\n// // non-copyable object Foo.\n// void AcceptUniquePointer(std::unique_ptr foo);\n//\n// // We can define an action that provides a Foo to that API. Because It\n// // has to give away its unique pointer, it must not be called more than\n// // once, so its call operator is &&-qualified.\n// struct ProvideFoo {\n// std::unique_ptr foo;\n//\n// void operator()() && {\n// AcceptUniquePointer(std::move(Foo));\n// }\n// };\n//\n// // This action can be used with WillOnce.\n// EXPECT_CALL(mock, Call)\n// .WillOnce(ProvideFoo{std::make_unique(...)});\n//\n// // But a call to WillRepeatedly will fail to compile. This is correct,\n// // since the action cannot correctly be used repeatedly.\n// EXPECT_CALL(mock, Call)\n// .WillRepeatedly(ProvideFoo{std::make_unique(...)});\n//\n// A less-contrived example would be an action that returns an arbitrary type,\n// whose &&-qualified call operator is capable of dealing with move-only types.\ntemplate \nclass OnceAction final {\n private:\n // True iff we can use the given callable type (or lvalue reference) directly\n // via StdFunctionAdaptor.\n template \n using IsDirectlyCompatible = internal::conjunction<\n // It must be possible to capture the callable in StdFunctionAdaptor.\n std::is_constructible::type, Callable>,\n // The callable must be compatible with our signature.\n internal::is_callable_r::type,\n Args...>>;\n\n // True iff we can use the given callable type via StdFunctionAdaptor once we\n // ignore incoming arguments.\n template \n using IsCompatibleAfterIgnoringArguments = internal::conjunction<\n // It must be possible to capture the callable in a lambda.\n std::is_constructible::type, Callable>,\n // The callable must be invocable with zero arguments, returning something\n // convertible to Result.\n internal::is_callable_r::type>>;\n\n public:\n // Construct from a callable that is directly compatible with our mocked\n // signature: it accepts our function type's arguments and returns something\n // convertible to our result type.\n template ::type>>,\n IsDirectlyCompatible> //\n ::value,\n int>::type = 0>\n OnceAction(Callable&& callable) // NOLINT\n : function_(StdFunctionAdaptor::type>(\n {}, std::forward(callable))) {}\n\n // As above, but for a callable that ignores the mocked function's arguments.\n template ::type>>,\n // Exclude callables for which the overload above works.\n // We'd rather provide the arguments if possible.\n internal::negation>,\n IsCompatibleAfterIgnoringArguments>::value,\n int>::type = 0>\n OnceAction(Callable&& callable) // NOLINT\n // Call the constructor above with a callable\n // that ignores the input arguments.\n : OnceAction(IgnoreIncomingArguments::type>{\n std::forward(callable)}) {}\n\n // We are naturally copyable because we store only an std::function, but\n // semantically we should not be copyable.\n OnceAction(const OnceAction&) = delete;\n OnceAction& operator=(const OnceAction&) = delete;\n OnceAction(OnceAction&&) = default;\n\n // Invoke the underlying action callable with which we were constructed,\n // handing it the supplied arguments.\n Result Call(Args... args) && {\n return function_(std::forward(args)...);\n }\n\n private:\n // An adaptor that wraps a callable that is compatible with our signature and\n // being invoked as an rvalue reference so that it can be used as an\n // StdFunctionAdaptor. This throws away type safety, but that's fine because\n // this is only used by WillOnce, which we know calls at most once.\n //\n // Once we have something like std::move_only_function from C++23, we can do\n // away with this.\n template \n class StdFunctionAdaptor final {\n public:\n // A tag indicating that the (otherwise universal) constructor is accepting\n // the callable itself, instead of e.g. stealing calls for the move\n // constructor.\n struct CallableTag final {};\n\n template \n explicit StdFunctionAdaptor(CallableTag, F&& callable)\n : callable_(std::make_shared(std::forward(callable))) {}\n\n // Rather than explicitly returning Result, we return whatever the wrapped\n // callable returns. This allows for compatibility with existing uses like\n // the following, when the mocked function returns void:\n //\n // EXPECT_CALL(mock_fn_, Call)\n // .WillOnce([&] {\n // [...]\n // return 0;\n // });\n //\n // Such a callable can be turned into std::function. If we use an\n // explicit return type of Result here then it *doesn't* work with\n // std::function, because we'll get a \"void function should not return a\n // value\" error.\n //\n // We need not worry about incompatible result types because the SFINAE on\n // OnceAction already checks this for us. std::is_invocable_r_v itself makes\n // the same allowance for void result types.\n template \n internal::call_result_t operator()(\n ArgRefs&&... args) const {\n return std::move(*callable_)(std::forward(args)...);\n }\n\n private:\n // We must put the callable on the heap so that we are copyable, which\n // std::function needs.\n std::shared_ptr callable_;\n };\n\n // An adaptor that makes a callable that accepts zero arguments callable with\n // our mocked arguments.\n template \n struct IgnoreIncomingArguments {\n internal::call_result_t operator()(Args&&...) {\n return std::move(callable)();\n }\n\n Callable callable;\n };\n\n std::function function_;\n};\n\n// When an unexpected function call is encountered, Google Mock will\n// let it return a default value if the user has specified one for its\n// return type, or if the return type has a built-in default value;\n// otherwise Google Mock won't know what value to return and will have\n// to abort the process.\n//\n// The DefaultValue class allows a user to specify the\n// default value for a type T that is both copyable and publicly\n// destructible (i.e. anything that can be used as a function return\n// type). The usage is:\n//\n// // Sets the default value for type T to be foo.\n// DefaultValue::Set(foo);\ntemplate \nclass DefaultValue {\n public:\n // Sets the default value for type T; requires T to be\n // copy-constructable and have a public destructor.\n static void Set(T x) {\n delete producer_;\n producer_ = new FixedValueProducer(x);\n }\n\n // Provides a factory function to be called to generate the default value.\n // This method can be used even if T is only move-constructible, but it is not\n // limited to that case.\n typedef T (*FactoryFunction)();\n static void SetFactory(FactoryFunction factory) {\n delete producer_;\n producer_ = new FactoryValueProducer(factory);\n }\n\n // Unsets the default value for type T.\n static void Clear() {\n delete producer_;\n producer_ = nullptr;\n }\n\n // Returns true if and only if the user has set the default value for type T.\n static bool IsSet() { return producer_ != nullptr; }\n\n // Returns true if T has a default return value set by the user or there\n // exists a built-in default value.\n static bool Exists() {\n return IsSet() || internal::BuiltInDefaultValue::Exists();\n }\n\n // Returns the default value for type T if the user has set one;\n // otherwise returns the built-in default value. Requires that Exists()\n // is true, which ensures that the return value is well-defined.\n static T Get() {\n return producer_ == nullptr ? internal::BuiltInDefaultValue::Get()\n : producer_->Produce();\n }\n\n private:\n class ValueProducer {\n public:\n virtual ~ValueProducer() {}\n virtual T Produce() = 0;\n };\n\n class FixedValueProducer : public ValueProducer {\n public:\n explicit FixedValueProducer(T value) : value_(value) {}\n T Produce() override { return value_; }\n\n private:\n const T value_;\n FixedValueProducer(const FixedValueProducer&) = delete;\n FixedValueProducer& operator=(const FixedValueProducer&) = delete;\n };\n\n class FactoryValueProducer : public ValueProducer {\n public:\n explicit FactoryValueProducer(FactoryFunction factory)\n : factory_(factory) {}\n T Produce() override { return factory_(); }\n\n private:\n const FactoryFunction factory_;\n FactoryValueProducer(const FactoryValueProducer&) = delete;\n FactoryValueProducer& operator=(const FactoryValueProducer&) = delete;\n };\n\n static ValueProducer* producer_;\n};\n\n// This partial specialization allows a user to set default values for\n// reference types.\ntemplate \nclass DefaultValue {\n public:\n // Sets the default value for type T&.\n static void Set(T& x) { // NOLINT\n address_ = &x;\n }\n\n // Unsets the default value for type T&.\n static void Clear() { address_ = nullptr; }\n\n // Returns true if and only if the user has set the default value for type T&.\n static bool IsSet() { return address_ != nullptr; }\n\n // Returns true if T has a default return value set by the user or there\n // exists a built-in default value.\n static bool Exists() {\n return IsSet() || internal::BuiltInDefaultValue::Exists();\n }\n\n // Returns the default value for type T& if the user has set one;\n // otherwise returns the built-in default value if there is one;\n // otherwise aborts the process.\n static T& Get() {\n return address_ == nullptr ? internal::BuiltInDefaultValue::Get()\n : *address_;\n }\n\n private:\n static T* address_;\n};\n\n// This specialization allows DefaultValue::Get() to\n// compile.\ntemplate <>\nclass DefaultValue {\n public:\n static bool Exists() { return true; }\n static void Get() {}\n};\n\n// Points to the user-set default value for type T.\ntemplate \ntypename DefaultValue::ValueProducer* DefaultValue::producer_ = nullptr;\n\n// Points to the user-set default value for type T&.\ntemplate \nT* DefaultValue::address_ = nullptr;\n\n// Implement this interface to define an action for function type F.\ntemplate \nclass ActionInterface {\n public:\n typedef typename internal::Function::Result Result;\n typedef typename internal::Function::ArgumentTuple ArgumentTuple;\n\n ActionInterface() {}\n virtual ~ActionInterface() {}\n\n // Performs the action. This method is not const, as in general an\n // action can have side effects and be stateful. For example, a\n // get-the-next-element-from-the-collection action will need to\n // remember the current element.\n virtual Result Perform(const ArgumentTuple& args) = 0;\n\n private:\n ActionInterface(const ActionInterface&) = delete;\n ActionInterface& operator=(const ActionInterface&) = delete;\n};\n\ntemplate \nclass Action;\n\n// An Action is a copyable and IMMUTABLE (except by assignment)\n// object that represents an action to be taken when a mock function of type\n// R(Args...) is called. The implementation of Action is just a\n// std::shared_ptr to const ActionInterface. Don't inherit from Action! You\n// can view an object implementing ActionInterface as a concrete action\n// (including its current state), and an Action object as a handle to it.\ntemplate \nclass Action {\n private:\n using F = R(Args...);\n\n // Adapter class to allow constructing Action from a legacy ActionInterface.\n // New code should create Actions from functors instead.\n struct ActionAdapter {\n // Adapter must be copyable to satisfy std::function requirements.\n ::std::shared_ptr> impl_;\n\n template \n typename internal::Function::Result operator()(InArgs&&... args) {\n return impl_->Perform(\n ::std::forward_as_tuple(::std::forward(args)...));\n }\n };\n\n template \n using IsCompatibleFunctor = std::is_constructible, G>;\n\n public:\n typedef typename internal::Function::Result Result;\n typedef typename internal::Function::ArgumentTuple ArgumentTuple;\n\n // Constructs a null Action. Needed for storing Action objects in\n // STL containers.\n Action() {}\n\n // Construct an Action from a specified callable.\n // This cannot take std::function directly, because then Action would not be\n // directly constructible from lambda (it would require two conversions).\n template <\n typename G,\n typename = typename std::enable_if, std::is_constructible,\n G>>::value>::type>\n Action(G&& fun) { // NOLINT\n Init(::std::forward(fun), IsCompatibleFunctor());\n }\n\n // Constructs an Action from its implementation.\n explicit Action(ActionInterface* impl)\n : fun_(ActionAdapter{::std::shared_ptr>(impl)}) {}\n\n // This constructor allows us to turn an Action object into an\n // Action, as long as F's arguments can be implicitly converted\n // to Func's and Func's return type can be implicitly converted to F's.\n template \n Action(const Action& action) // NOLINT\n : fun_(action.fun_) {}\n\n // Returns true if and only if this is the DoDefault() action.\n bool IsDoDefault() const { return fun_ == nullptr; }\n\n // Performs the action. Note that this method is const even though\n // the corresponding method in ActionInterface is not. The reason\n // is that a const Action means that it cannot be re-bound to\n // another concrete action, not that the concrete action it binds to\n // cannot change state. (Think of the difference between a const\n // pointer and a pointer to const.)\n Result Perform(ArgumentTuple args) const {\n if (IsDoDefault()) {\n internal::IllegalDoDefault(__FILE__, __LINE__);\n }\n return internal::Apply(fun_, ::std::move(args));\n }\n\n // An action can be used as a OnceAction, since it's obviously safe to call it\n // once.\n operator OnceAction() const { // NOLINT\n // Return a OnceAction-compatible callable that calls Perform with the\n // arguments it is provided. We could instead just return fun_, but then\n // we'd need to handle the IsDoDefault() case separately.\n struct OA {\n Action action;\n\n R operator()(Args... args) && {\n return action.Perform(\n std::forward_as_tuple(std::forward(args)...));\n }\n };\n\n return OA{*this};\n }\n\n private:\n template \n friend class Action;\n\n template \n void Init(G&& g, ::std::true_type) {\n fun_ = ::std::forward(g);\n }\n\n template \n void Init(G&& g, ::std::false_type) {\n fun_ = IgnoreArgs::type>{::std::forward(g)};\n }\n\n template \n struct IgnoreArgs {\n template \n Result operator()(const InArgs&...) const {\n return function_impl();\n }\n\n FunctionImpl function_impl;\n };\n\n // fun_ is an empty function if and only if this is the DoDefault() action.\n ::std::function fun_;\n};\n\n// The PolymorphicAction class template makes it easy to implement a\n// polymorphic action (i.e. an action that can be used in mock\n// functions of than one type, e.g. Return()).\n//\n// To define a polymorphic action, a user first provides a COPYABLE\n// implementation class that has a Perform() method template:\n//\n// class FooAction {\n// public:\n// template \n// Result Perform(const ArgumentTuple& args) const {\n// // Processes the arguments and returns a result, using\n// // std::get(args) to get the N-th (0-based) argument in the tuple.\n// }\n// ...\n// };\n//\n// Then the user creates the polymorphic action using\n// MakePolymorphicAction(object) where object has type FooAction. See\n// the definition of Return(void) and SetArgumentPointee(value) for\n// complete examples.\ntemplate \nclass PolymorphicAction {\n public:\n explicit PolymorphicAction(const Impl& impl) : impl_(impl) {}\n\n template \n operator Action() const {\n return Action(new MonomorphicImpl(impl_));\n }\n\n private:\n template \n class MonomorphicImpl : public ActionInterface {\n public:\n typedef typename internal::Function::Result Result;\n typedef typename internal::Function::ArgumentTuple ArgumentTuple;\n\n explicit MonomorphicImpl(const Impl& impl) : impl_(impl) {}\n\n Result Perform(const ArgumentTuple& args) override {\n return impl_.template Perform(args);\n }\n\n private:\n Impl impl_;\n };\n\n Impl impl_;\n};\n\n// Creates an Action from its implementation and returns it. The\n// created Action object owns the implementation.\ntemplate \nAction MakeAction(ActionInterface* impl) {\n return Action(impl);\n}\n\n// Creates a polymorphic action from its implementation. This is\n// easier to use than the PolymorphicAction constructor as it\n// doesn't require you to explicitly write the template argument, e.g.\n//\n// MakePolymorphicAction(foo);\n// vs\n// PolymorphicAction(foo);\ntemplate \ninline PolymorphicAction MakePolymorphicAction(const Impl& impl) {\n return PolymorphicAction(impl);\n}\n\nnamespace internal {\n\n// Helper struct to specialize ReturnAction to execute a move instead of a copy\n// on return. Useful for move-only types, but could be used on any type.\ntemplate \nstruct ByMoveWrapper {\n explicit ByMoveWrapper(T value) : payload(std::move(value)) {}\n T payload;\n};\n\n// The general implementation of Return(R). Specializations follow below.\ntemplate \nclass ReturnAction final {\n public:\n explicit ReturnAction(R value) : value_(std::move(value)) {}\n\n template >, //\n negation>, //\n std::is_convertible, //\n std::is_move_constructible>::value>::type>\n operator OnceAction() && { // NOLINT\n return Impl(std::move(value_));\n }\n\n template >, //\n negation>, //\n std::is_convertible, //\n std::is_copy_constructible>::value>::type>\n operator Action() const { // NOLINT\n return Impl(value_);\n }\n\n private:\n // Implements the Return(x) action for a mock function that returns type U.\n template \n class Impl final {\n public:\n // The constructor used when the return value is allowed to move from the\n // input value (i.e. we are converting to OnceAction).\n explicit Impl(R&& input_value)\n : state_(new State(std::move(input_value))) {}\n\n // The constructor used when the return value is not allowed to move from\n // the input value (i.e. we are converting to Action).\n explicit Impl(const R& input_value) : state_(new State(input_value)) {}\n\n U operator()() && { return std::move(state_->value); }\n U operator()() const& { return state_->value; }\n\n private:\n // We put our state on the heap so that the compiler-generated copy/move\n // constructors work correctly even when U is a reference-like type. This is\n // necessary only because we eagerly create State::value (see the note on\n // that symbol for details). If we instead had only the input value as a\n // member then the default constructors would work fine.\n //\n // For example, when R is std::string and U is std::string_view, value is a\n // reference to the string backed by input_value. The copy constructor would\n // copy both, so that we wind up with a new input_value object (with the\n // same contents) and a reference to the *old* input_value object rather\n // than the new one.\n struct State {\n explicit State(const R& input_value_in)\n : input_value(input_value_in),\n // Make an implicit conversion to Result before initializing the U\n // object we store, avoiding calling any explicit constructor of U\n // from R.\n //\n // This simulates the language rules: a function with return type U\n // that does `return R()` requires R to be implicitly convertible to\n // U, and uses that path for the conversion, even U Result has an\n // explicit constructor from R.\n value(ImplicitCast_(internal::as_const(input_value))) {}\n\n // As above, but for the case where we're moving from the ReturnAction\n // object because it's being used as a OnceAction.\n explicit State(R&& input_value_in)\n : input_value(std::move(input_value_in)),\n // For the same reason as above we make an implicit conversion to U\n // before initializing the value.\n //\n // Unlike above we provide the input value as an rvalue to the\n // implicit conversion because this is a OnceAction: it's fine if it\n // wants to consume the input value.\n value(ImplicitCast_(std::move(input_value))) {}\n\n // A copy of the value originally provided by the user. We retain this in\n // addition to the value of the mock function's result type below in case\n // the latter is a reference-like type. See the std::string_view example\n // in the documentation on Return.\n R input_value;\n\n // The value we actually return, as the type returned by the mock function\n // itself.\n //\n // We eagerly initialize this here, rather than lazily doing the implicit\n // conversion automatically each time Perform is called, for historical\n // reasons: in 2009-11, commit a070cbd91c (Google changelist 13540126)\n // made the Action conversion operator eagerly convert the R value to\n // U, but without keeping the R alive. This broke the use case discussed\n // in the documentation for Return, making reference-like types such as\n // std::string_view not safe to use as U where the input type R is a\n // value-like type such as std::string.\n //\n // The example the commit gave was not very clear, nor was the issue\n // thread (https://github.com/google/googlemock/issues/86), but it seems\n // the worry was about reference-like input types R that flatten to a\n // value-like type U when being implicitly converted. An example of this\n // is std::vector::reference, which is often a proxy type with an\n // reference to the underlying vector:\n //\n // // Helper method: have the mock function return bools according\n // // to the supplied script.\n // void SetActions(MockFunction& mock,\n // const std::vector& script) {\n // for (size_t i = 0; i < script.size(); ++i) {\n // EXPECT_CALL(mock, Call(i)).WillOnce(Return(script[i]));\n // }\n // }\n //\n // TEST(Foo, Bar) {\n // // Set actions using a temporary vector, whose operator[]\n // // returns proxy objects that references that will be\n // // dangling once the call to SetActions finishes and the\n // // vector is destroyed.\n // MockFunction mock;\n // SetActions(mock, {false, true});\n //\n // EXPECT_FALSE(mock.AsStdFunction()(0));\n // EXPECT_TRUE(mock.AsStdFunction()(1));\n // }\n //\n // This eager conversion helps with a simple case like this, but doesn't\n // fully make these types work in general. For example the following still\n // uses a dangling reference:\n //\n // TEST(Foo, Baz) {\n // MockFunction()> mock;\n //\n // // Return the same vector twice, and then the empty vector\n // // thereafter.\n // auto action = Return(std::initializer_list{\n // \"taco\", \"burrito\",\n // });\n //\n // EXPECT_CALL(mock, Call)\n // .WillOnce(action)\n // .WillOnce(action)\n // .WillRepeatedly(Return(std::vector{}));\n //\n // EXPECT_THAT(mock.AsStdFunction()(),\n // ElementsAre(\"taco\", \"burrito\"));\n // EXPECT_THAT(mock.AsStdFunction()(),\n // ElementsAre(\"taco\", \"burrito\"));\n // EXPECT_THAT(mock.AsStdFunction()(), IsEmpty());\n // }\n //\n U value;\n };\n\n const std::shared_ptr state_;\n };\n\n R value_;\n};\n\n// A specialization of ReturnAction when R is ByMoveWrapper for some T.\n//\n// This version applies the type system-defeating hack of moving from T even in\n// the const call operator, checking at runtime that it isn't called more than\n// once, since the user has declared their intent to do so by using ByMove.\ntemplate \nclass ReturnAction> final {\n public:\n explicit ReturnAction(ByMoveWrapper wrapper)\n : state_(new State(std::move(wrapper.payload))) {}\n\n T operator()() const {\n GTEST_CHECK_(!state_->called)\n << \"A ByMove() action must be performed at most once.\";\n\n state_->called = true;\n return std::move(state_->value);\n }\n\n private:\n // We store our state on the heap so that we are copyable as required by\n // Action, despite the fact that we are stateful and T may not be copyable.\n struct State {\n explicit State(T&& value_in) : value(std::move(value_in)) {}\n\n T value;\n bool called = false;\n };\n\n const std::shared_ptr state_;\n};\n\n// Implements the ReturnNull() action.\nclass ReturnNullAction {\n public:\n // Allows ReturnNull() to be used in any pointer-returning function. In C++11\n // this is enforced by returning nullptr, and in non-C++11 by asserting a\n // pointer type on compile time.\n template \n static Result Perform(const ArgumentTuple&) {\n return nullptr;\n }\n};\n\n// Implements the Return() action.\nclass ReturnVoidAction {\n public:\n // Allows Return() to be used in any void-returning function.\n template \n static void Perform(const ArgumentTuple&) {\n static_assert(std::is_void::value, \"Result should be void.\");\n }\n};\n\n// Implements the polymorphic ReturnRef(x) action, which can be used\n// in any function that returns a reference to the type of x,\n// regardless of the argument types.\ntemplate \nclass ReturnRefAction {\n public:\n // Constructs a ReturnRefAction object from the reference to be returned.\n explicit ReturnRefAction(T& ref) : ref_(ref) {} // NOLINT\n\n // This template type conversion operator allows ReturnRef(x) to be\n // used in ANY function that returns a reference to x's type.\n template \n operator Action() const {\n typedef typename Function::Result Result;\n // Asserts that the function return type is a reference. This\n // catches the user error of using ReturnRef(x) when Return(x)\n // should be used, and generates some helpful error message.\n static_assert(std::is_reference::value,\n \"use Return instead of ReturnRef to return a value\");\n return Action(new Impl(ref_));\n }\n\n private:\n // Implements the ReturnRef(x) action for a particular function type F.\n template \n class Impl : public ActionInterface {\n public:\n typedef typename Function::Result Result;\n typedef typename Function::ArgumentTuple ArgumentTuple;\n\n explicit Impl(T& ref) : ref_(ref) {} // NOLINT\n\n Result Perform(const ArgumentTuple&) override { return ref_; }\n\n private:\n T& ref_;\n };\n\n T& ref_;\n};\n\n// Implements the polymorphic ReturnRefOfCopy(x) action, which can be\n// used in any function that returns a reference to the type of x,\n// regardless of the argument types.\ntemplate \nclass ReturnRefOfCopyAction {\n public:\n // Constructs a ReturnRefOfCopyAction object from the reference to\n // be returned.\n explicit ReturnRefOfCopyAction(const T& value) : value_(value) {} // NOLINT\n\n // This template type conversion operator allows ReturnRefOfCopy(x) to be\n // used in ANY function that returns a reference to x's type.\n template \n operator Action() const {\n typedef typename Function::Result Result;\n // Asserts that the function return type is a reference. This\n // catches the user error of using ReturnRefOfCopy(x) when Return(x)\n // should be used, and generates some helpful error message.\n static_assert(std::is_reference::value,\n \"use Return instead of ReturnRefOfCopy to return a value\");\n return Action(new Impl(value_));\n }\n\n private:\n // Implements the ReturnRefOfCopy(x) action for a particular function type F.\n template \n class Impl : public ActionInterface {\n public:\n typedef typename Function::Result Result;\n typedef typename Function::ArgumentTuple ArgumentTuple;\n\n explicit Impl(const T& value) : value_(value) {} // NOLINT\n\n Result Perform(const ArgumentTuple&) override { return value_; }\n\n private:\n T value_;\n };\n\n const T value_;\n};\n\n// Implements the polymorphic ReturnRoundRobin(v) action, which can be\n// used in any function that returns the element_type of v.\ntemplate \nclass ReturnRoundRobinAction {\n public:\n explicit ReturnRoundRobinAction(std::vector values) {\n GTEST_CHECK_(!values.empty())\n << \"ReturnRoundRobin requires at least one element.\";\n state_->values = std::move(values);\n }\n\n template \n T operator()(Args&&...) const {\n return state_->Next();\n }\n\n private:\n struct State {\n T Next() {\n T ret_val = values[i++];\n if (i == values.size()) i = 0;\n return ret_val;\n }\n\n std::vector values;\n size_t i = 0;\n };\n std::shared_ptr state_ = std::make_shared();\n};\n\n// Implements the polymorphic DoDefault() action.\nclass DoDefaultAction {\n public:\n // This template type conversion operator allows DoDefault() to be\n // used in any function.\n template \n operator Action() const {\n return Action();\n } // NOLINT\n};\n\n// Implements the Assign action to set a given pointer referent to a\n// particular value.\ntemplate \nclass AssignAction {\n public:\n AssignAction(T1* ptr, T2 value) : ptr_(ptr), value_(value) {}\n\n template \n void Perform(const ArgumentTuple& /* args */) const {\n *ptr_ = value_;\n }\n\n private:\n T1* const ptr_;\n const T2 value_;\n};\n\n#if !GTEST_OS_WINDOWS_MOBILE\n\n// Implements the SetErrnoAndReturn action to simulate return from\n// various system calls and libc functions.\ntemplate \nclass SetErrnoAndReturnAction {\n public:\n SetErrnoAndReturnAction(int errno_value, T result)\n : errno_(errno_value), result_(result) {}\n template \n Result Perform(const ArgumentTuple& /* args */) const {\n errno = errno_;\n return result_;\n }\n\n private:\n const int errno_;\n const T result_;\n};\n\n#endif // !GTEST_OS_WINDOWS_MOBILE\n\n// Implements the SetArgumentPointee(x) action for any function\n// whose N-th argument (0-based) is a pointer to x's type.\ntemplate \nstruct SetArgumentPointeeAction {\n A value;\n\n template \n void operator()(const Args&... args) const {\n *::std::get(std::tie(args...)) = value;\n }\n};\n\n// Implements the Invoke(object_ptr, &Class::Method) action.\ntemplate \nstruct InvokeMethodAction {\n Class* const obj_ptr;\n const MethodPtr method_ptr;\n\n template \n auto operator()(Args&&... args) const\n -> decltype((obj_ptr->*method_ptr)(std::forward(args)...)) {\n return (obj_ptr->*method_ptr)(std::forward(args)...);\n }\n};\n\n// Implements the InvokeWithoutArgs(f) action. The template argument\n// FunctionImpl is the implementation type of f, which can be either a\n// function pointer or a functor. InvokeWithoutArgs(f) can be used as an\n// Action as long as f's type is compatible with F.\ntemplate \nstruct InvokeWithoutArgsAction {\n FunctionImpl function_impl;\n\n // Allows InvokeWithoutArgs(f) to be used as any action whose type is\n // compatible with f.\n template \n auto operator()(const Args&...) -> decltype(function_impl()) {\n return function_impl();\n }\n};\n\n// Implements the InvokeWithoutArgs(object_ptr, &Class::Method) action.\ntemplate \nstruct InvokeMethodWithoutArgsAction {\n Class* const obj_ptr;\n const MethodPtr method_ptr;\n\n using ReturnType =\n decltype((std::declval()->*std::declval())());\n\n template \n ReturnType operator()(const Args&...) const {\n return (obj_ptr->*method_ptr)();\n }\n};\n\n// Implements the IgnoreResult(action) action.\ntemplate \nclass IgnoreResultAction {\n public:\n explicit IgnoreResultAction(const A& action) : action_(action) {}\n\n template \n operator Action() const {\n // Assert statement belongs here because this is the best place to verify\n // conditions on F. It produces the clearest error messages\n // in most compilers.\n // Impl really belongs in this scope as a local class but can't\n // because MSVC produces duplicate symbols in different translation units\n // in this case. Until MS fixes that bug we put Impl into the class scope\n // and put the typedef both here (for use in assert statement) and\n // in the Impl class. But both definitions must be the same.\n typedef typename internal::Function::Result Result;\n\n // Asserts at compile time that F returns void.\n static_assert(std::is_void::value, \"Result type should be void.\");\n\n return Action(new Impl(action_));\n }\n\n private:\n template \n class Impl : public ActionInterface {\n public:\n typedef typename internal::Function::Result Result;\n typedef typename internal::Function::ArgumentTuple ArgumentTuple;\n\n explicit Impl(const A& action) : action_(action) {}\n\n void Perform(const ArgumentTuple& args) override {\n // Performs the action and ignores its result.\n action_.Perform(args);\n }\n\n private:\n // Type OriginalFunction is the same as F except that its return\n // type is IgnoredValue.\n typedef\n typename internal::Function::MakeResultIgnoredValue OriginalFunction;\n\n const Action action_;\n };\n\n const A action_;\n};\n\ntemplate \nstruct WithArgsAction {\n InnerAction inner_action;\n\n // The signature of the function as seen by the inner action, given an out\n // action with the given result and argument types.\n template \n using InnerSignature =\n R(typename std::tuple_element>::type...);\n\n // Rather than a call operator, we must define conversion operators to\n // particular action types. This is necessary for embedded actions like\n // DoDefault(), which rely on an action conversion operators rather than\n // providing a call operator because even with a particular set of arguments\n // they don't have a fixed return type.\n\n template >::type...)>>::value,\n int>::type = 0>\n operator OnceAction() && { // NOLINT\n struct OA {\n OnceAction> inner_action;\n\n R operator()(Args&&... args) && {\n return std::move(inner_action)\n .Call(std::get(\n std::forward_as_tuple(std::forward(args)...))...);\n }\n };\n\n return OA{std::move(inner_action)};\n }\n\n template >::type...)>>::value,\n int>::type = 0>\n operator Action() const { // NOLINT\n Action> converted(inner_action);\n\n return [converted](Args&&... args) -> R {\n return converted.Perform(std::forward_as_tuple(\n std::get(std::forward_as_tuple(std::forward(args)...))...));\n };\n }\n};\n\ntemplate \nclass DoAllAction;\n\n// Base case: only a single action.\ntemplate \nclass DoAllAction {\n public:\n struct UserConstructorTag {};\n\n template \n explicit DoAllAction(UserConstructorTag, T&& action)\n : final_action_(std::forward(action)) {}\n\n // Rather than a call operator, we must define conversion operators to\n // particular action types. This is necessary for embedded actions like\n // DoDefault(), which rely on an action conversion operators rather than\n // providing a call operator because even with a particular set of arguments\n // they don't have a fixed return type.\n\n template >::value,\n int>::type = 0>\n operator OnceAction() && { // NOLINT\n return std::move(final_action_);\n }\n\n template <\n typename R, typename... Args,\n typename std::enable_if<\n std::is_convertible>::value,\n int>::type = 0>\n operator Action() const { // NOLINT\n return final_action_;\n }\n\n private:\n FinalAction final_action_;\n};\n\n// Recursive case: support N actions by calling the initial action and then\n// calling through to the base class containing N-1 actions.\ntemplate \nclass DoAllAction\n : private DoAllAction {\n private:\n using Base = DoAllAction;\n\n // The type of reference that should be provided to an initial action for a\n // mocked function parameter of type T.\n //\n // There are two quirks here:\n //\n // * Unlike most forwarding functions, we pass scalars through by value.\n // This isn't strictly necessary because an lvalue reference would work\n // fine too and be consistent with other non-reference types, but it's\n // perhaps less surprising.\n //\n // For example if the mocked function has signature void(int), then it\n // might seem surprising for the user's initial action to need to be\n // convertible to Action. This is perhaps less\n // surprising for a non-scalar type where there may be a performance\n // impact, or it might even be impossible, to pass by value.\n //\n // * More surprisingly, `const T&` is often not a const reference type.\n // By the reference collapsing rules in C++17 [dcl.ref]/6, if T refers to\n // U& or U&& for some non-scalar type U, then InitialActionArgType is\n // U&. In other words, we may hand over a non-const reference.\n //\n // So for example, given some non-scalar type Obj we have the following\n // mappings:\n //\n // T InitialActionArgType\n // ------- -----------------------\n // Obj const Obj&\n // Obj& Obj&\n // Obj&& Obj&\n // const Obj const Obj&\n // const Obj& const Obj&\n // const Obj&& const Obj&\n //\n // In other words, the initial actions get a mutable view of an non-scalar\n // argument if and only if the mock function itself accepts a non-const\n // reference type. They are never given an rvalue reference to an\n // non-scalar type.\n //\n // This situation makes sense if you imagine use with a matcher that is\n // designed to write through a reference. For example, if the caller wants\n // to fill in a reference argument and then return a canned value:\n //\n // EXPECT_CALL(mock, Call)\n // .WillOnce(DoAll(SetArgReferee<0>(17), Return(19)));\n //\n template \n using InitialActionArgType =\n typename std::conditional::value, T, const T&>::type;\n\n public:\n struct UserConstructorTag {};\n\n template \n explicit DoAllAction(UserConstructorTag, T&& initial_action,\n U&&... other_actions)\n : Base({}, std::forward(other_actions)...),\n initial_action_(std::forward(initial_action)) {}\n\n template ...)>>,\n std::is_convertible>>::value,\n int>::type = 0>\n operator OnceAction() && { // NOLINT\n // Return an action that first calls the initial action with arguments\n // filtered through InitialActionArgType, then forwards arguments directly\n // to the base class to deal with the remaining actions.\n struct OA {\n OnceAction...)> initial_action;\n OnceAction remaining_actions;\n\n R operator()(Args... args) && {\n std::move(initial_action)\n .Call(static_cast>(args)...);\n\n return std::move(remaining_actions).Call(std::forward(args)...);\n }\n };\n\n return OA{\n std::move(initial_action_),\n std::move(static_cast(*this)),\n };\n }\n\n template <\n typename R, typename... Args,\n typename std::enable_if<\n conjunction<\n // Both the initial action and the rest must support conversion to\n // Action.\n std::is_convertible...)>>,\n std::is_convertible>>::value,\n int>::type = 0>\n operator Action() const { // NOLINT\n // Return an action that first calls the initial action with arguments\n // filtered through InitialActionArgType, then forwards arguments directly\n // to the base class to deal with the remaining actions.\n struct OA {\n Action...)> initial_action;\n Action remaining_actions;\n\n R operator()(Args... args) const {\n initial_action.Perform(std::forward_as_tuple(\n static_cast>(args)...));\n\n return remaining_actions.Perform(\n std::forward_as_tuple(std::forward(args)...));\n }\n };\n\n return OA{\n initial_action_,\n static_cast(*this),\n };\n }\n\n private:\n InitialAction initial_action_;\n};\n\ntemplate \nstruct ReturnNewAction {\n T* operator()() const {\n return internal::Apply(\n [](const Params&... unpacked_params) {\n return new T(unpacked_params...);\n },\n params);\n }\n std::tuple params;\n};\n\ntemplate \nstruct ReturnArgAction {\n template ::type>\n auto operator()(Args&&... args) const -> decltype(std::get(\n std::forward_as_tuple(std::forward(args)...))) {\n return std::get(std::forward_as_tuple(std::forward(args)...));\n }\n};\n\ntemplate \nstruct SaveArgAction {\n Ptr pointer;\n\n template \n void operator()(const Args&... args) const {\n *pointer = std::get(std::tie(args...));\n }\n};\n\ntemplate \nstruct SaveArgPointeeAction {\n Ptr pointer;\n\n template \n void operator()(const Args&... args) const {\n *pointer = *std::get(std::tie(args...));\n }\n};\n\ntemplate \nstruct SetArgRefereeAction {\n T value;\n\n template \n void operator()(Args&&... args) const {\n using argk_type =\n typename ::std::tuple_element>::type;\n static_assert(std::is_lvalue_reference::value,\n \"Argument must be a reference type.\");\n std::get(std::tie(args...)) = value;\n }\n};\n\ntemplate \nstruct SetArrayArgumentAction {\n I1 first;\n I2 last;\n\n template \n void operator()(const Args&... args) const {\n auto value = std::get(std::tie(args...));\n for (auto it = first; it != last; ++it, (void)++value) {\n *value = *it;\n }\n }\n};\n\ntemplate \nstruct DeleteArgAction {\n template \n void operator()(const Args&... args) const {\n delete std::get(std::tie(args...));\n }\n};\n\ntemplate \nstruct ReturnPointeeAction {\n Ptr pointer;\n template \n auto operator()(const Args&...) const -> decltype(*pointer) {\n return *pointer;\n }\n};\n\n#if GTEST_HAS_EXCEPTIONS\ntemplate \nstruct ThrowAction {\n T exception;\n // We use a conversion operator to adapt to any return type.\n template \n operator Action() const { // NOLINT\n T copy = exception;\n return [copy](Args...) -> R { throw copy; };\n }\n};\n#endif // GTEST_HAS_EXCEPTIONS\n\n} // namespace internal\n\n// An Unused object can be implicitly constructed from ANY value.\n// This is handy when defining actions that ignore some or all of the\n// mock function arguments. For example, given\n//\n// MOCK_METHOD3(Foo, double(const string& label, double x, double y));\n// MOCK_METHOD3(Bar, double(int index, double x, double y));\n//\n// instead of\n//\n// double DistanceToOriginWithLabel(const string& label, double x, double y) {\n// return sqrt(x*x + y*y);\n// }\n// double DistanceToOriginWithIndex(int index, double x, double y) {\n// return sqrt(x*x + y*y);\n// }\n// ...\n// EXPECT_CALL(mock, Foo(\"abc\", _, _))\n// .WillOnce(Invoke(DistanceToOriginWithLabel));\n// EXPECT_CALL(mock, Bar(5, _, _))\n// .WillOnce(Invoke(DistanceToOriginWithIndex));\n//\n// you could write\n//\n// // We can declare any uninteresting argument as Unused.\n// double DistanceToOrigin(Unused, double x, double y) {\n// return sqrt(x*x + y*y);\n// }\n// ...\n// EXPECT_CALL(mock, Foo(\"abc\", _, _)).WillOnce(Invoke(DistanceToOrigin));\n// EXPECT_CALL(mock, Bar(5, _, _)).WillOnce(Invoke(DistanceToOrigin));\ntypedef internal::IgnoredValue Unused;\n\n// Creates an action that does actions a1, a2, ..., sequentially in\n// each invocation. All but the last action will have a readonly view of the\n// arguments.\ntemplate \ninternal::DoAllAction::type...> DoAll(\n Action&&... action) {\n return internal::DoAllAction::type...>(\n {}, std::forward(action)...);\n}\n\n// WithArg(an_action) creates an action that passes the k-th\n// (0-based) argument of the mock function to an_action and performs\n// it. It adapts an action accepting one argument to one that accepts\n// multiple arguments. For convenience, we also provide\n// WithArgs(an_action) (defined below) as a synonym.\ntemplate \ninternal::WithArgsAction::type, k> WithArg(\n InnerAction&& action) {\n return {std::forward(action)};\n}\n\n// WithArgs(an_action) creates an action that passes\n// the selected arguments of the mock function to an_action and\n// performs it. It serves as an adaptor between actions with\n// different argument lists.\ntemplate \ninternal::WithArgsAction::type, k, ks...>\nWithArgs(InnerAction&& action) {\n return {std::forward(action)};\n}\n\n// WithoutArgs(inner_action) can be used in a mock function with a\n// non-empty argument list to perform inner_action, which takes no\n// argument. In other words, it adapts an action accepting no\n// argument to one that accepts (and ignores) arguments.\ntemplate \ninternal::WithArgsAction::type> WithoutArgs(\n InnerAction&& action) {\n return {std::forward(action)};\n}\n\n// Creates an action that returns a value.\n//\n// The returned type can be used with a mock function returning a non-void,\n// non-reference type U as follows:\n//\n// * If R is convertible to U and U is move-constructible, then the action can\n// be used with WillOnce.\n//\n// * If const R& is convertible to U and U is copy-constructible, then the\n// action can be used with both WillOnce and WillRepeatedly.\n//\n// The mock expectation contains the R value from which the U return value is\n// constructed (a move/copy of the argument to Return). This means that the R\n// value will survive at least until the mock object's expectations are cleared\n// or the mock object is destroyed, meaning that U can safely be a\n// reference-like type such as std::string_view:\n//\n// // The mock function returns a view of a copy of the string fed to\n// // Return. The view is valid even after the action is performed.\n// MockFunction mock;\n// EXPECT_CALL(mock, Call).WillOnce(Return(std::string(\"taco\")));\n// const std::string_view result = mock.AsStdFunction()();\n// EXPECT_EQ(\"taco\", result);\n//\ntemplate \ninternal::ReturnAction Return(R value) {\n return internal::ReturnAction(std::move(value));\n}\n\n// Creates an action that returns NULL.\ninline PolymorphicAction ReturnNull() {\n return MakePolymorphicAction(internal::ReturnNullAction());\n}\n\n// Creates an action that returns from a void function.\ninline PolymorphicAction Return() {\n return MakePolymorphicAction(internal::ReturnVoidAction());\n}\n\n// Creates an action that returns the reference to a variable.\ntemplate \ninline internal::ReturnRefAction ReturnRef(R& x) { // NOLINT\n return internal::ReturnRefAction(x);\n}\n\n// Prevent using ReturnRef on reference to temporary.\ntemplate \ninternal::ReturnRefAction ReturnRef(R&&) = delete;\n\n// Creates an action that returns the reference to a copy of the\n// argument. The copy is created when the action is constructed and\n// lives as long as the action.\ntemplate \ninline internal::ReturnRefOfCopyAction ReturnRefOfCopy(const R& x) {\n return internal::ReturnRefOfCopyAction(x);\n}\n\n// DEPRECATED: use Return(x) directly with WillOnce.\n//\n// Modifies the parent action (a Return() action) to perform a move of the\n// argument instead of a copy.\n// Return(ByMove()) actions can only be executed once and will assert this\n// invariant.\ntemplate \ninternal::ByMoveWrapper ByMove(R x) {\n return internal::ByMoveWrapper(std::move(x));\n}\n\n// Creates an action that returns an element of `vals`. Calling this action will\n// repeatedly return the next value from `vals` until it reaches the end and\n// will restart from the beginning.\ntemplate \ninternal::ReturnRoundRobinAction ReturnRoundRobin(std::vector vals) {\n return internal::ReturnRoundRobinAction(std::move(vals));\n}\n\n// Creates an action that returns an element of `vals`. Calling this action will\n// repeatedly return the next value from `vals` until it reaches the end and\n// will restart from the beginning.\ntemplate \ninternal::ReturnRoundRobinAction ReturnRoundRobin(\n std::initializer_list vals) {\n return internal::ReturnRoundRobinAction(std::vector(vals));\n}\n\n// Creates an action that does the default action for the give mock function.\ninline internal::DoDefaultAction DoDefault() {\n return internal::DoDefaultAction();\n}\n\n// Creates an action that sets the variable pointed by the N-th\n// (0-based) function argument to 'value'.\ntemplate \ninternal::SetArgumentPointeeAction SetArgPointee(T value) {\n return {std::move(value)};\n}\n\n// The following version is DEPRECATED.\ntemplate \ninternal::SetArgumentPointeeAction SetArgumentPointee(T value) {\n return {std::move(value)};\n}\n\n// Creates an action that sets a pointer referent to a given value.\ntemplate \nPolymorphicAction> Assign(T1* ptr, T2 val) {\n return MakePolymorphicAction(internal::AssignAction(ptr, val));\n}\n\n#if !GTEST_OS_WINDOWS_MOBILE\n\n// Creates an action that sets errno and returns the appropriate error.\ntemplate \nPolymorphicAction> SetErrnoAndReturn(\n int errval, T result) {\n return MakePolymorphicAction(\n internal::SetErrnoAndReturnAction(errval, result));\n}\n\n#endif // !GTEST_OS_WINDOWS_MOBILE\n\n// Various overloads for Invoke().\n\n// Legacy function.\n// Actions can now be implicitly constructed from callables. No need to create\n// wrapper objects.\n// This function exists for backwards compatibility.\ntemplate \ntypename std::decay::type Invoke(FunctionImpl&& function_impl) {\n return std::forward(function_impl);\n}\n\n// Creates an action that invokes the given method on the given object\n// with the mock function's arguments.\ntemplate \ninternal::InvokeMethodAction Invoke(Class* obj_ptr,\n MethodPtr method_ptr) {\n return {obj_ptr, method_ptr};\n}\n\n// Creates an action that invokes 'function_impl' with no argument.\ntemplate \ninternal::InvokeWithoutArgsAction::type>\nInvokeWithoutArgs(FunctionImpl function_impl) {\n return {std::move(function_impl)};\n}\n\n// Creates an action that invokes the given method on the given object\n// with no argument.\ntemplate \ninternal::InvokeMethodWithoutArgsAction InvokeWithoutArgs(\n Class* obj_ptr, MethodPtr method_ptr) {\n return {obj_ptr, method_ptr};\n}\n\n// Creates an action that performs an_action and throws away its\n// result. In other words, it changes the return type of an_action to\n// void. an_action MUST NOT return void, or the code won't compile.\ntemplate \ninline internal::IgnoreResultAction IgnoreResult(const A& an_action) {\n return internal::IgnoreResultAction(an_action);\n}\n\n// Creates a reference wrapper for the given L-value. If necessary,\n// you can explicitly specify the type of the reference. For example,\n// suppose 'derived' is an object of type Derived, ByRef(derived)\n// would wrap a Derived&. If you want to wrap a const Base& instead,\n// where Base is a base class of Derived, just write:\n//\n// ByRef(derived)\n//\n// N.B. ByRef is redundant with std::ref, std::cref and std::reference_wrapper.\n// However, it may still be used for consistency with ByMove().\ntemplate \ninline ::std::reference_wrapper ByRef(T& l_value) { // NOLINT\n return ::std::reference_wrapper(l_value);\n}\n\n// The ReturnNew(a1, a2, ..., a_k) action returns a pointer to a new\n// instance of type T, constructed on the heap with constructor arguments\n// a1, a2, ..., and a_k. The caller assumes ownership of the returned value.\ntemplate \ninternal::ReturnNewAction::type...> ReturnNew(\n Params&&... params) {\n return {std::forward_as_tuple(std::forward(params)...)};\n}\n\n// Action ReturnArg() returns the k-th argument of the mock function.\ntemplate \ninternal::ReturnArgAction ReturnArg() {\n return {};\n}\n\n// Action SaveArg(pointer) saves the k-th (0-based) argument of the\n// mock function to *pointer.\ntemplate \ninternal::SaveArgAction SaveArg(Ptr pointer) {\n return {pointer};\n}\n\n// Action SaveArgPointee(pointer) saves the value pointed to\n// by the k-th (0-based) argument of the mock function to *pointer.\ntemplate \ninternal::SaveArgPointeeAction SaveArgPointee(Ptr pointer) {\n return {pointer};\n}\n\n// Action SetArgReferee(value) assigns 'value' to the variable\n// referenced by the k-th (0-based) argument of the mock function.\ntemplate \ninternal::SetArgRefereeAction::type> SetArgReferee(\n T&& value) {\n return {std::forward(value)};\n}\n\n// Action SetArrayArgument(first, last) copies the elements in\n// source range [first, last) to the array pointed to by the k-th\n// (0-based) argument, which can be either a pointer or an\n// iterator. The action does not take ownership of the elements in the\n// source range.\ntemplate \ninternal::SetArrayArgumentAction SetArrayArgument(I1 first,\n I2 last) {\n return {first, last};\n}\n\n// Action DeleteArg() deletes the k-th (0-based) argument of the mock\n// function.\ntemplate \ninternal::DeleteArgAction DeleteArg() {\n return {};\n}\n\n// This action returns the value pointed to by 'pointer'.\ntemplate \ninternal::ReturnPointeeAction ReturnPointee(Ptr pointer) {\n return {pointer};\n}\n\n// Action Throw(exception) can be used in a mock function of any type\n// to throw the given exception. Any copyable value can be thrown.\n#if GTEST_HAS_EXCEPTIONS\ntemplate \ninternal::ThrowAction::type> Throw(T&& exception) {\n return {std::forward(exception)};\n}\n#endif // GTEST_HAS_EXCEPTIONS\n\nnamespace internal {\n\n// A macro from the ACTION* family (defined later in gmock-generated-actions.h)\n// defines an action that can be used in a mock function. Typically,\n// these actions only care about a subset of the arguments of the mock\n// function. For example, if such an action only uses the second\n// argument, it can be used in any mock function that takes >= 2\n// arguments where the type of the second argument is compatible.\n//\n// Therefore, the action implementation must be prepared to take more\n// arguments than it needs. The ExcessiveArg type is used to\n// represent those excessive arguments. In order to keep the compiler\n// error messages tractable, we define it in the testing namespace\n// instead of testing::internal. However, this is an INTERNAL TYPE\n// and subject to change without notice, so a user MUST NOT USE THIS\n// TYPE DIRECTLY.\nstruct ExcessiveArg {};\n\n// Builds an implementation of an Action<> for some particular signature, using\n// a class defined by an ACTION* macro.\ntemplate \nstruct ActionImpl;\n\ntemplate \nstruct ImplBase {\n struct Holder {\n // Allows each copy of the Action<> to get to the Impl.\n explicit operator const Impl&() const { return *ptr; }\n std::shared_ptr ptr;\n };\n using type = typename std::conditional::value,\n Impl, Holder>::type;\n};\n\ntemplate \nstruct ActionImpl : ImplBase::type {\n using Base = typename ImplBase::type;\n using function_type = R(Args...);\n using args_type = std::tuple;\n\n ActionImpl() = default; // Only defined if appropriate for Base.\n explicit ActionImpl(std::shared_ptr impl) : Base{std::move(impl)} {}\n\n R operator()(Args&&... arg) const {\n static constexpr size_t kMaxArgs =\n sizeof...(Args) <= 10 ? sizeof...(Args) : 10;\n return Apply(MakeIndexSequence{},\n MakeIndexSequence<10 - kMaxArgs>{},\n args_type{std::forward(arg)...});\n }\n\n template \n R Apply(IndexSequence, IndexSequence,\n const args_type& args) const {\n // Impl need not be specific to the signature of action being implemented;\n // only the implementing function body needs to have all of the specific\n // types instantiated. Up to 10 of the args that are provided by the\n // args_type get passed, followed by a dummy of unspecified type for the\n // remainder up to 10 explicit args.\n static constexpr ExcessiveArg kExcessArg{};\n return static_cast(*this)\n .template gmock_PerformImpl<\n /*function_type=*/function_type, /*return_type=*/R,\n /*args_type=*/args_type,\n /*argN_type=*/\n typename std::tuple_element::type...>(\n /*args=*/args, std::get(args)...,\n ((void)excess_id, kExcessArg)...);\n }\n};\n\n// Stores a default-constructed Impl as part of the Action<>'s\n// std::function<>. The Impl should be trivial to copy.\ntemplate \n::testing::Action MakeAction() {\n return ::testing::Action(ActionImpl());\n}\n\n// Stores just the one given instance of Impl.\ntemplate \n::testing::Action MakeAction(std::shared_ptr impl) {\n return ::testing::Action(ActionImpl(std::move(impl)));\n}\n\n#define GMOCK_INTERNAL_ARG_UNUSED(i, data, el) \\\n , const arg##i##_type& arg##i GTEST_ATTRIBUTE_UNUSED_\n#define GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_ \\\n const args_type& args GTEST_ATTRIBUTE_UNUSED_ GMOCK_PP_REPEAT( \\\n GMOCK_INTERNAL_ARG_UNUSED, , 10)\n\n#define GMOCK_INTERNAL_ARG(i, data, el) , const arg##i##_type& arg##i\n#define GMOCK_ACTION_ARG_TYPES_AND_NAMES_ \\\n const args_type& args GMOCK_PP_REPEAT(GMOCK_INTERNAL_ARG, , 10)\n\n#define GMOCK_INTERNAL_TEMPLATE_ARG(i, data, el) , typename arg##i##_type\n#define GMOCK_ACTION_TEMPLATE_ARGS_NAMES_ \\\n GMOCK_PP_TAIL(GMOCK_PP_REPEAT(GMOCK_INTERNAL_TEMPLATE_ARG, , 10))\n\n#define GMOCK_INTERNAL_TYPENAME_PARAM(i, data, param) , typename param##_type\n#define GMOCK_ACTION_TYPENAME_PARAMS_(params) \\\n GMOCK_PP_TAIL(GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_TYPENAME_PARAM, , params))\n\n#define GMOCK_INTERNAL_TYPE_PARAM(i, data, param) , param##_type\n#define GMOCK_ACTION_TYPE_PARAMS_(params) \\\n GMOCK_PP_TAIL(GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_TYPE_PARAM, , params))\n\n#define GMOCK_INTERNAL_TYPE_GVALUE_PARAM(i, data, param) \\\n , param##_type gmock_p##i\n#define GMOCK_ACTION_TYPE_GVALUE_PARAMS_(params) \\\n GMOCK_PP_TAIL(GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_TYPE_GVALUE_PARAM, , params))\n\n#define GMOCK_INTERNAL_GVALUE_PARAM(i, data, param) \\\n , std::forward(gmock_p##i)\n#define GMOCK_ACTION_GVALUE_PARAMS_(params) \\\n GMOCK_PP_TAIL(GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_GVALUE_PARAM, , params))\n\n#define GMOCK_INTERNAL_INIT_PARAM(i, data, param) \\\n , param(::std::forward(gmock_p##i))\n#define GMOCK_ACTION_INIT_PARAMS_(params) \\\n GMOCK_PP_TAIL(GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_INIT_PARAM, , params))\n\n#define GMOCK_INTERNAL_FIELD_PARAM(i, data, param) param##_type param;\n#define GMOCK_ACTION_FIELD_PARAMS_(params) \\\n GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_FIELD_PARAM, , params)\n\n#define GMOCK_INTERNAL_ACTION(name, full_name, params) \\\n template \\\n class full_name { \\\n public: \\\n explicit full_name(GMOCK_ACTION_TYPE_GVALUE_PARAMS_(params)) \\\n : impl_(std::make_shared( \\\n GMOCK_ACTION_GVALUE_PARAMS_(params))) {} \\\n full_name(const full_name&) = default; \\\n full_name(full_name&&) noexcept = default; \\\n template \\\n operator ::testing::Action() const { \\\n return ::testing::internal::MakeAction(impl_); \\\n } \\\n \\\n private: \\\n class gmock_Impl { \\\n public: \\\n explicit gmock_Impl(GMOCK_ACTION_TYPE_GVALUE_PARAMS_(params)) \\\n : GMOCK_ACTION_INIT_PARAMS_(params) {} \\\n template \\\n return_type gmock_PerformImpl(GMOCK_ACTION_ARG_TYPES_AND_NAMES_) const; \\\n GMOCK_ACTION_FIELD_PARAMS_(params) \\\n }; \\\n std::shared_ptr impl_; \\\n }; \\\n template \\\n inline full_name name( \\\n GMOCK_ACTION_TYPE_GVALUE_PARAMS_(params)) GTEST_MUST_USE_RESULT_; \\\n template \\\n inline full_name name( \\\n GMOCK_ACTION_TYPE_GVALUE_PARAMS_(params)) { \\\n return full_name( \\\n GMOCK_ACTION_GVALUE_PARAMS_(params)); \\\n } \\\n template \\\n template \\\n return_type \\\n full_name::gmock_Impl::gmock_PerformImpl( \\\n GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const\n\n} // namespace internal\n\n// Similar to GMOCK_INTERNAL_ACTION, but no bound parameters are stored.\n#define ACTION(name) \\\n class name##Action { \\\n public: \\\n explicit name##Action() noexcept {} \\\n name##Action(const name##Action&) noexcept {} \\\n template \\\n operator ::testing::Action() const { \\\n return ::testing::internal::MakeAction(); \\\n } \\\n \\\n private: \\\n class gmock_Impl { \\\n public: \\\n template \\\n return_type gmock_PerformImpl(GMOCK_ACTION_ARG_TYPES_AND_NAMES_) const; \\\n }; \\\n }; \\\n inline name##Action name() GTEST_MUST_USE_RESULT_; \\\n inline name##Action name() { return name##Action(); } \\\n template \\\n return_type name##Action::gmock_Impl::gmock_PerformImpl( \\\n GMOCK_ACTION_ARG_TYPES_AND_NAMES_UNUSED_) const\n\n#define ACTION_P(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP, (__VA_ARGS__))\n\n#define ACTION_P2(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP2, (__VA_ARGS__))\n\n#define ACTION_P3(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP3, (__VA_ARGS__))\n\n#define ACTION_P4(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP4, (__VA_ARGS__))\n\n#define ACTION_P5(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP5, (__VA_ARGS__))\n\n#define ACTION_P6(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP6, (__VA_ARGS__))\n\n#define ACTION_P7(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP7, (__VA_ARGS__))\n\n#define ACTION_P8(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP8, (__VA_ARGS__))\n\n#define ACTION_P9(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP9, (__VA_ARGS__))\n\n#define ACTION_P10(name, ...) \\\n GMOCK_INTERNAL_ACTION(name, name##ActionP10, (__VA_ARGS__))\n\n} // namespace testing\n\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n#endif // GOOGLEMOCK_INCLUDE_GMOCK_GMOCK_ACTIONS_H_\n" }, { "path": "3rd/googletest-1.12.1/googlemock/include/gmock/gmock-cardinalities.h", "content": "// Copyright 2007, Google Inc.\n// All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Google Mock - a framework for writing C++ mock classes.\n//\n// This file implements some commonly used cardinalities. More\n// cardinalities can be defined by the user implementing the\n// CardinalityInterface interface if necessary.\n\n// IWYU pragma: private, include \"gmock/gmock.h\"\n// IWYU pragma: friend gmock/.*\n\n#ifndef GOOGLEMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_\n#define GOOGLEMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_\n\n#include \n\n#include \n#include // NOLINT\n\n#include \"gmock/internal/gmock-port.h\"\n#include \"gtest/gtest.h\"\n\nGTEST_DISABLE_MSC_WARNINGS_PUSH_(4251 \\\n/* class A needs to have dll-interface to be used by clients of class B */)\n\nnamespace testing {\n\n// To implement a cardinality Foo, define:\n// 1. a class FooCardinality that implements the\n// CardinalityInterface interface, and\n// 2. a factory function that creates a Cardinality object from a\n// const FooCardinality*.\n//\n// The two-level delegation design follows that of Matcher, providing\n// consistency for extension developers. It also eases ownership\n// management as Cardinality objects can now be copied like plain values.\n\n// The implementation of a cardinality.\nclass CardinalityInterface {\n public:\n virtual ~CardinalityInterface() {}\n\n // Conservative estimate on the lower/upper bound of the number of\n // calls allowed.\n virtual int ConservativeLowerBound() const { return 0; }\n virtual int ConservativeUpperBound() const { return INT_MAX; }\n\n // Returns true if and only if call_count calls will satisfy this\n // cardinality.\n virtual bool IsSatisfiedByCallCount(int call_count) const = 0;\n\n // Returns true if and only if call_count calls will saturate this\n // cardinality.\n virtual bool IsSaturatedByCallCount(int call_count) const = 0;\n\n // Describes self to an ostream.\n virtual void DescribeTo(::std::ostream* os) const = 0;\n};\n\n// A Cardinality is a copyable and IMMUTABLE (except by assignment)\n// object that specifies how many times a mock function is expected to\n// be called. The implementation of Cardinality is just a std::shared_ptr\n// to const CardinalityInterface. Don't inherit from Cardinality!\nclass GTEST_API_ Cardinality {\n public:\n // Constructs a null cardinality. Needed for storing Cardinality\n // objects in STL containers.\n Cardinality() {}\n\n // Constructs a Cardinality from its implementation.\n explicit Cardinality(const CardinalityInterface* impl) : impl_(impl) {}\n\n // Conservative estimate on the lower/upper bound of the number of\n // calls allowed.\n int ConservativeLowerBound() const { return impl_->ConservativeLowerBound(); }\n int ConservativeUpperBound() const { return impl_->ConservativeUpperBound(); }\n\n // Returns true if and only if call_count calls will satisfy this\n // cardinality.\n bool IsSatisfiedByCallCount(int call_count) const {\n return impl_->IsSatisfiedByCallCount(call_count);\n }\n\n // Returns true if and only if call_count calls will saturate this\n // cardinality.\n bool IsSaturatedByCallCount(int call_count) const {\n return impl_->IsSaturatedByCallCount(call_count);\n }\n\n // Returns true if and only if call_count calls will over-saturate this\n // cardinality, i.e. exceed the maximum number of allowed calls.\n bool IsOverSaturatedByCallCount(int call_count) const {\n return impl_->IsSaturatedByCallCount(call_count) &&\n !impl_->IsSatisfiedByCallCount(call_count);\n }\n\n // Describes self to an ostream\n void DescribeTo(::std::ostream* os) const { impl_->DescribeTo(os); }\n\n // Describes the given actual call count to an ostream.\n static void DescribeActualCallCountTo(int actual_call_count,\n ::std::ostream* os);\n\n private:\n std::shared_ptr impl_;\n};\n\n// Creates a cardinality that allows at least n calls.\nGTEST_API_ Cardinality AtLeast(int n);\n\n// Creates a cardinality that allows at most n calls.\nGTEST_API_ Cardinality AtMost(int n);\n\n// Creates a cardinality that allows any number of calls.\nGTEST_API_ Cardinality AnyNumber();\n\n// Creates a cardinality that allows between min and max calls.\nGTEST_API_ Cardinality Between(int min, int max);\n\n// Creates a cardinality that allows exactly n calls.\nGTEST_API_ Cardinality Exactly(int n);\n\n// Creates a cardinality from its implementation.\ninline Cardinality MakeCardinality(const CardinalityInterface* c) {\n return Cardinality(c);\n}\n\n} // namespace testing\n\nGTEST_DISABLE_MSC_WARNINGS_POP_() // 4251\n\n#endif // GOOGLEMOCK_INCLUDE_GMOCK_GMOCK_CARDINALITIES_H_\n" }, { "path": "3rd/googletest-1.12.1/googlemock/include/gmock/gmock-function-mocker.h", "content": "// Copyright 2007, Google Inc.\n// All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Google Mock - a framework for writing C++ mock classes.\n//\n// This file implements MOCK_METHOD.\n\n// IWYU pragma: private, include \"gmock/gmock.h\"\n// IWYU pragma: friend gmock/.*\n\n#ifndef GOOGLEMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_FUNCTION_MOCKER_H_ // NOLINT\n#define GOOGLEMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_FUNCTION_MOCKER_H_ // NOLINT\n\n#include // IWYU pragma: keep\n#include // IWYU pragma: keep\n\n#include \"gmock/gmock-spec-builders.h\"\n#include \"gmock/internal/gmock-internal-utils.h\"\n#include \"gmock/internal/gmock-pp.h\"\n\nnamespace testing {\nnamespace internal {\ntemplate \nusing identity_t = T;\n\ntemplate \nstruct ThisRefAdjuster {\n template \n using AdjustT = typename std::conditional<\n std::is_const::type>::value,\n typename std::conditional::value,\n const T&, const T&&>::type,\n typename std::conditional::value, T&,\n T&&>::type>::type;\n\n template \n static AdjustT Adjust(const MockType& mock) {\n return static_cast>(const_cast(mock));\n }\n};\n\nconstexpr bool PrefixOf(const char* a, const char* b) {\n return *a == 0 || (*a == *b && internal::PrefixOf(a + 1, b + 1));\n}\n\ntemplate \nconstexpr bool StartsWith(const char (&prefix)[N], const char (&str)[M]) {\n return N <= M && internal::PrefixOf(prefix, str);\n}\n\ntemplate \nconstexpr bool EndsWith(const char (&suffix)[N], const char (&str)[M]) {\n return N <= M && internal::PrefixOf(suffix, str + M - N);\n}\n\ntemplate \nconstexpr bool Equals(const char (&a)[N], const char (&b)[M]) {\n return N == M && internal::PrefixOf(a, b);\n}\n\ntemplate \nconstexpr bool ValidateSpec(const char (&spec)[N]) {\n return internal::Equals(\"const\", spec) ||\n internal::Equals(\"override\", spec) ||\n internal::Equals(\"final\", spec) ||\n internal::Equals(\"noexcept\", spec) ||\n (internal::StartsWith(\"noexcept(\", spec) &&\n internal::EndsWith(\")\", spec)) ||\n internal::Equals(\"ref(&)\", spec) ||\n internal::Equals(\"ref(&&)\", spec) ||\n (internal::StartsWith(\"Calltype(\", spec) &&\n internal::EndsWith(\")\", spec));\n}\n\n} // namespace internal\n\n// The style guide prohibits \"using\" statements in a namespace scope\n// inside a header file. However, the FunctionMocker class template\n// is meant to be defined in the ::testing namespace. The following\n// line is just a trick for working around a bug in MSVC 8.0, which\n// cannot handle it if we define FunctionMocker in ::testing.\nusing internal::FunctionMocker;\n} // namespace testing\n\n#define MOCK_METHOD(...) \\\n GMOCK_PP_VARIADIC_CALL(GMOCK_INTERNAL_MOCK_METHOD_ARG_, __VA_ARGS__)\n\n#define GMOCK_INTERNAL_MOCK_METHOD_ARG_1(...) \\\n GMOCK_INTERNAL_WRONG_ARITY(__VA_ARGS__)\n\n#define GMOCK_INTERNAL_MOCK_METHOD_ARG_2(...) \\\n GMOCK_INTERNAL_WRONG_ARITY(__VA_ARGS__)\n\n#define GMOCK_INTERNAL_MOCK_METHOD_ARG_3(_Ret, _MethodName, _Args) \\\n GMOCK_INTERNAL_MOCK_METHOD_ARG_4(_Ret, _MethodName, _Args, ())\n\n#define GMOCK_INTERNAL_MOCK_METHOD_ARG_4(_Ret, _MethodName, _Args, _Spec) \\\n GMOCK_INTERNAL_ASSERT_PARENTHESIS(_Args); \\\n GMOCK_INTERNAL_ASSERT_PARENTHESIS(_Spec); \\\n GMOCK_INTERNAL_ASSERT_VALID_SIGNATURE( \\\n GMOCK_PP_NARG0 _Args, GMOCK_INTERNAL_SIGNATURE(_Ret, _Args)); \\\n GMOCK_INTERNAL_ASSERT_VALID_SPEC(_Spec) \\\n GMOCK_INTERNAL_MOCK_METHOD_IMPL( \\\n GMOCK_PP_NARG0 _Args, _MethodName, GMOCK_INTERNAL_HAS_CONST(_Spec), \\\n GMOCK_INTERNAL_HAS_OVERRIDE(_Spec), GMOCK_INTERNAL_HAS_FINAL(_Spec), \\\n GMOCK_INTERNAL_GET_NOEXCEPT_SPEC(_Spec), \\\n GMOCK_INTERNAL_GET_CALLTYPE_SPEC(_Spec), \\\n GMOCK_INTERNAL_GET_REF_SPEC(_Spec), \\\n (GMOCK_INTERNAL_SIGNATURE(_Ret, _Args)))\n\n#define GMOCK_INTERNAL_MOCK_METHOD_ARG_5(...) \\\n GMOCK_INTERNAL_WRONG_ARITY(__VA_ARGS__)\n\n#define GMOCK_INTERNAL_MOCK_METHOD_ARG_6(...) \\\n GMOCK_INTERNAL_WRONG_ARITY(__VA_ARGS__)\n\n#define GMOCK_INTERNAL_MOCK_METHOD_ARG_7(...) \\\n GMOCK_INTERNAL_WRONG_ARITY(__VA_ARGS__)\n\n#define GMOCK_INTERNAL_WRONG_ARITY(...) \\\n static_assert( \\\n false, \\\n \"MOCK_METHOD must be called with 3 or 4 arguments. _Ret, \" \\\n \"_MethodName, _Args and optionally _Spec. _Args and _Spec must be \" \\\n \"enclosed in parentheses. If _Ret is a type with unprotected commas, \" \\\n \"it must also be enclosed in parentheses.\")\n\n#define GMOCK_INTERNAL_ASSERT_PARENTHESIS(_Tuple) \\\n static_assert( \\\n GMOCK_PP_IS_ENCLOSED_PARENS(_Tuple), \\\n GMOCK_PP_STRINGIZE(_Tuple) \" should be enclosed in parentheses.\")\n\n#define GMOCK_INTERNAL_ASSERT_VALID_SIGNATURE(_N, ...) \\\n static_assert( \\\n std::is_function<__VA_ARGS__>::value, \\\n \"Signature must be a function type, maybe return type contains \" \\\n \"unprotected comma.\"); \\\n static_assert( \\\n ::testing::tuple_size::ArgumentTuple>::value == _N, \\\n \"This method does not take \" GMOCK_PP_STRINGIZE( \\\n _N) \" arguments. Parenthesize all types with unprotected commas.\")\n\n#define GMOCK_INTERNAL_ASSERT_VALID_SPEC(_Spec) \\\n GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_ASSERT_VALID_SPEC_ELEMENT, ~, _Spec)\n\n#define GMOCK_INTERNAL_MOCK_METHOD_IMPL(_N, _MethodName, _Constness, \\\n _Override, _Final, _NoexceptSpec, \\\n _CallType, _RefSpec, _Signature) \\\n typename ::testing::internal::Function::Result \\\n GMOCK_INTERNAL_EXPAND(_CallType) \\\n _MethodName(GMOCK_PP_REPEAT(GMOCK_INTERNAL_PARAMETER, _Signature, _N)) \\\n GMOCK_PP_IF(_Constness, const, ) _RefSpec _NoexceptSpec \\\n GMOCK_PP_IF(_Override, override, ) GMOCK_PP_IF(_Final, final, ) { \\\n GMOCK_MOCKER_(_N, _Constness, _MethodName) \\\n .SetOwnerAndName(this, #_MethodName); \\\n return GMOCK_MOCKER_(_N, _Constness, _MethodName) \\\n .Invoke(GMOCK_PP_REPEAT(GMOCK_INTERNAL_FORWARD_ARG, _Signature, _N)); \\\n } \\\n ::testing::MockSpec gmock_##_MethodName( \\\n GMOCK_PP_REPEAT(GMOCK_INTERNAL_MATCHER_PARAMETER, _Signature, _N)) \\\n GMOCK_PP_IF(_Constness, const, ) _RefSpec { \\\n GMOCK_MOCKER_(_N, _Constness, _MethodName).RegisterOwner(this); \\\n return GMOCK_MOCKER_(_N, _Constness, _MethodName) \\\n .With(GMOCK_PP_REPEAT(GMOCK_INTERNAL_MATCHER_ARGUMENT, , _N)); \\\n } \\\n ::testing::MockSpec gmock_##_MethodName( \\\n const ::testing::internal::WithoutMatchers&, \\\n GMOCK_PP_IF(_Constness, const, )::testing::internal::Function< \\\n GMOCK_PP_REMOVE_PARENS(_Signature)>*) const _RefSpec _NoexceptSpec { \\\n return ::testing::internal::ThisRefAdjuster::Adjust(*this) \\\n .gmock_##_MethodName(GMOCK_PP_REPEAT( \\\n GMOCK_INTERNAL_A_MATCHER_ARGUMENT, _Signature, _N)); \\\n } \\\n mutable ::testing::FunctionMocker \\\n GMOCK_MOCKER_(_N, _Constness, _MethodName)\n\n#define GMOCK_INTERNAL_EXPAND(...) __VA_ARGS__\n\n// Valid modifiers.\n#define GMOCK_INTERNAL_HAS_CONST(_Tuple) \\\n GMOCK_PP_HAS_COMMA(GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_DETECT_CONST, ~, _Tuple))\n\n#define GMOCK_INTERNAL_HAS_OVERRIDE(_Tuple) \\\n GMOCK_PP_HAS_COMMA( \\\n GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_DETECT_OVERRIDE, ~, _Tuple))\n\n#define GMOCK_INTERNAL_HAS_FINAL(_Tuple) \\\n GMOCK_PP_HAS_COMMA(GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_DETECT_FINAL, ~, _Tuple))\n\n#define GMOCK_INTERNAL_GET_NOEXCEPT_SPEC(_Tuple) \\\n GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_NOEXCEPT_SPEC_IF_NOEXCEPT, ~, _Tuple)\n\n#define GMOCK_INTERNAL_NOEXCEPT_SPEC_IF_NOEXCEPT(_i, _, _elem) \\\n GMOCK_PP_IF( \\\n GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_NOEXCEPT(_i, _, _elem)), \\\n _elem, )\n\n#define GMOCK_INTERNAL_GET_CALLTYPE_SPEC(_Tuple) \\\n GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_CALLTYPE_SPEC_IF_CALLTYPE, ~, _Tuple)\n\n#define GMOCK_INTERNAL_CALLTYPE_SPEC_IF_CALLTYPE(_i, _, _elem) \\\n GMOCK_PP_IF( \\\n GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_CALLTYPE(_i, _, _elem)), \\\n GMOCK_PP_CAT(GMOCK_INTERNAL_UNPACK_, _elem), )\n\n#define GMOCK_INTERNAL_GET_REF_SPEC(_Tuple) \\\n GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_REF_SPEC_IF_REF, ~, _Tuple)\n\n#define GMOCK_INTERNAL_REF_SPEC_IF_REF(_i, _, _elem) \\\n GMOCK_PP_IF(GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_REF(_i, _, _elem)), \\\n GMOCK_PP_CAT(GMOCK_INTERNAL_UNPACK_, _elem), )\n\n#ifdef GMOCK_INTERNAL_STRICT_SPEC_ASSERT\n#define GMOCK_INTERNAL_ASSERT_VALID_SPEC_ELEMENT(_i, _, _elem) \\\n static_assert( \\\n ::testing::internal::ValidateSpec(GMOCK_PP_STRINGIZE(_elem)), \\\n \"Token \\'\" GMOCK_PP_STRINGIZE( \\\n _elem) \"\\' cannot be recognized as a valid specification \" \\\n \"modifier. Is a ',' missing?\");\n#else\n#define GMOCK_INTERNAL_ASSERT_VALID_SPEC_ELEMENT(_i, _, _elem) \\\n static_assert( \\\n (GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_CONST(_i, _, _elem)) + \\\n GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_OVERRIDE(_i, _, _elem)) + \\\n GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_FINAL(_i, _, _elem)) + \\\n GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_NOEXCEPT(_i, _, _elem)) + \\\n GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_REF(_i, _, _elem)) + \\\n GMOCK_PP_HAS_COMMA(GMOCK_INTERNAL_DETECT_CALLTYPE(_i, _, _elem))) == 1, \\\n GMOCK_PP_STRINGIZE( \\\n _elem) \" cannot be recognized as a valid specification modifier.\");\n#endif // GMOCK_INTERNAL_STRICT_SPEC_ASSERT\n\n// Modifiers implementation.\n#define GMOCK_INTERNAL_DETECT_CONST(_i, _, _elem) \\\n GMOCK_PP_CAT(GMOCK_INTERNAL_DETECT_CONST_I_, _elem)\n\n#define GMOCK_INTERNAL_DETECT_CONST_I_const ,\n\n#define GMOCK_INTERNAL_DETECT_OVERRIDE(_i, _, _elem) \\\n GMOCK_PP_CAT(GMOCK_INTERNAL_DETECT_OVERRIDE_I_, _elem)\n\n#define GMOCK_INTERNAL_DETECT_OVERRIDE_I_override ,\n\n#define GMOCK_INTERNAL_DETECT_FINAL(_i, _, _elem) \\\n GMOCK_PP_CAT(GMOCK_INTERNAL_DETECT_FINAL_I_, _elem)\n\n#define GMOCK_INTERNAL_DETECT_FINAL_I_final ,\n\n#define GMOCK_INTERNAL_DETECT_NOEXCEPT(_i, _, _elem) \\\n GMOCK_PP_CAT(GMOCK_INTERNAL_DETECT_NOEXCEPT_I_, _elem)\n\n#define GMOCK_INTERNAL_DETECT_NOEXCEPT_I_noexcept ,\n\n#define GMOCK_INTERNAL_DETECT_REF(_i, _, _elem) \\\n GMOCK_PP_CAT(GMOCK_INTERNAL_DETECT_REF_I_, _elem)\n\n#define GMOCK_INTERNAL_DETECT_REF_I_ref ,\n\n#define GMOCK_INTERNAL_UNPACK_ref(x) x\n\n#define GMOCK_INTERNAL_DETECT_CALLTYPE(_i, _, _elem) \\\n GMOCK_PP_CAT(GMOCK_INTERNAL_DETECT_CALLTYPE_I_, _elem)\n\n#define GMOCK_INTERNAL_DETECT_CALLTYPE_I_Calltype ,\n\n#define GMOCK_INTERNAL_UNPACK_Calltype(...) __VA_ARGS__\n\n// Note: The use of `identity_t` here allows _Ret to represent return types that\n// would normally need to be specified in a different way. For example, a method\n// returning a function pointer must be written as\n//\n// fn_ptr_return_t (*method(method_args_t...))(fn_ptr_args_t...)\n//\n// But we only support placing the return type at the beginning. To handle this,\n// we wrap all calls in identity_t, so that a declaration will be expanded to\n//\n// identity_t method(method_args_t...)\n//\n// This allows us to work around the syntactic oddities of function/method\n// types.\n#define GMOCK_INTERNAL_SIGNATURE(_Ret, _Args) \\\n ::testing::internal::identity_t( \\\n GMOCK_PP_FOR_EACH(GMOCK_INTERNAL_GET_TYPE, _, _Args))\n\n#define GMOCK_INTERNAL_GET_TYPE(_i, _, _elem) \\\n GMOCK_PP_COMMA_IF(_i) \\\n GMOCK_PP_IF(GMOCK_PP_IS_BEGIN_PARENS(_elem), GMOCK_PP_REMOVE_PARENS, \\\n GMOCK_PP_IDENTITY) \\\n (_elem)\n\n#define GMOCK_INTERNAL_PARAMETER(_i, _Signature, _) \\\n GMOCK_PP_COMMA_IF(_i) \\\n GMOCK_INTERNAL_ARG_O(_i, GMOCK_PP_REMOVE_PARENS(_Signature)) \\\n gmock_a##_i\n\n#define GMOCK_INTERNAL_FORWARD_ARG(_i, _Signature, _) \\\n GMOCK_PP_COMMA_IF(_i) \\\n ::std::forward(gmock_a##_i)\n\n#define GMOCK_INTERNAL_MATCHER_PARAMETER(_i, _Signature, _) \\\n GMOCK_PP_COMMA_IF(_i) \\\n GMOCK_INTERNAL_MATCHER_O(_i, GMOCK_PP_REMOVE_PARENS(_Signature)) \\\n gmock_a##_i\n\n#define GMOCK_INTERNAL_MATCHER_ARGUMENT(_i, _1, _2) \\\n GMOCK_PP_COMMA_IF(_i) \\\n gmock_a##_i\n\n#define GMOCK_INTERNAL_A_MATCHER_ARGUMENT(_i, _Signature, _) \\\n GMOCK_PP_COMMA_IF(_i) \\\n ::testing::A()\n\n#define GMOCK_INTERNAL_ARG_O(_i, ...) \\\n typename ::testing::internal::Function<__VA_ARGS__>::template Arg<_i>::type\n\n#define GMOCK_INTERNAL_MATCHER_O(_i, ...) \\\n const ::testing::Matcher::template Arg<_i>::type>&\n\n#define MOCK_METHOD0(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 0, __VA_ARGS__)\n#define MOCK_METHOD1(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 1, __VA_ARGS__)\n#define MOCK_METHOD2(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 2, __VA_ARGS__)\n#define MOCK_METHOD3(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 3, __VA_ARGS__)\n#define MOCK_METHOD4(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 4, __VA_ARGS__)\n#define MOCK_METHOD5(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 5, __VA_ARGS__)\n#define MOCK_METHOD6(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 6, __VA_ARGS__)\n#define MOCK_METHOD7(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 7, __VA_ARGS__)\n#define MOCK_METHOD8(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 8, __VA_ARGS__)\n#define MOCK_METHOD9(m, ...) GMOCK_INTERNAL_MOCK_METHODN(, , m, 9, __VA_ARGS__)\n#define MOCK_METHOD10(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, , m, 10, __VA_ARGS__)\n\n#define MOCK_CONST_METHOD0(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 0, __VA_ARGS__)\n#define MOCK_CONST_METHOD1(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 1, __VA_ARGS__)\n#define MOCK_CONST_METHOD2(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 2, __VA_ARGS__)\n#define MOCK_CONST_METHOD3(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 3, __VA_ARGS__)\n#define MOCK_CONST_METHOD4(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 4, __VA_ARGS__)\n#define MOCK_CONST_METHOD5(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 5, __VA_ARGS__)\n#define MOCK_CONST_METHOD6(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 6, __VA_ARGS__)\n#define MOCK_CONST_METHOD7(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 7, __VA_ARGS__)\n#define MOCK_CONST_METHOD8(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 8, __VA_ARGS__)\n#define MOCK_CONST_METHOD9(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 9, __VA_ARGS__)\n#define MOCK_CONST_METHOD10(m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, , m, 10, __VA_ARGS__)\n\n#define MOCK_METHOD0_T(m, ...) MOCK_METHOD0(m, __VA_ARGS__)\n#define MOCK_METHOD1_T(m, ...) MOCK_METHOD1(m, __VA_ARGS__)\n#define MOCK_METHOD2_T(m, ...) MOCK_METHOD2(m, __VA_ARGS__)\n#define MOCK_METHOD3_T(m, ...) MOCK_METHOD3(m, __VA_ARGS__)\n#define MOCK_METHOD4_T(m, ...) MOCK_METHOD4(m, __VA_ARGS__)\n#define MOCK_METHOD5_T(m, ...) MOCK_METHOD5(m, __VA_ARGS__)\n#define MOCK_METHOD6_T(m, ...) MOCK_METHOD6(m, __VA_ARGS__)\n#define MOCK_METHOD7_T(m, ...) MOCK_METHOD7(m, __VA_ARGS__)\n#define MOCK_METHOD8_T(m, ...) MOCK_METHOD8(m, __VA_ARGS__)\n#define MOCK_METHOD9_T(m, ...) MOCK_METHOD9(m, __VA_ARGS__)\n#define MOCK_METHOD10_T(m, ...) MOCK_METHOD10(m, __VA_ARGS__)\n\n#define MOCK_CONST_METHOD0_T(m, ...) MOCK_CONST_METHOD0(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD1_T(m, ...) MOCK_CONST_METHOD1(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD2_T(m, ...) MOCK_CONST_METHOD2(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD3_T(m, ...) MOCK_CONST_METHOD3(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD4_T(m, ...) MOCK_CONST_METHOD4(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD5_T(m, ...) MOCK_CONST_METHOD5(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD6_T(m, ...) MOCK_CONST_METHOD6(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD7_T(m, ...) MOCK_CONST_METHOD7(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD8_T(m, ...) MOCK_CONST_METHOD8(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD9_T(m, ...) MOCK_CONST_METHOD9(m, __VA_ARGS__)\n#define MOCK_CONST_METHOD10_T(m, ...) MOCK_CONST_METHOD10(m, __VA_ARGS__)\n\n#define MOCK_METHOD0_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 0, __VA_ARGS__)\n#define MOCK_METHOD1_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 1, __VA_ARGS__)\n#define MOCK_METHOD2_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 2, __VA_ARGS__)\n#define MOCK_METHOD3_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 3, __VA_ARGS__)\n#define MOCK_METHOD4_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 4, __VA_ARGS__)\n#define MOCK_METHOD5_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 5, __VA_ARGS__)\n#define MOCK_METHOD6_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 6, __VA_ARGS__)\n#define MOCK_METHOD7_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 7, __VA_ARGS__)\n#define MOCK_METHOD8_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 8, __VA_ARGS__)\n#define MOCK_METHOD9_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 9, __VA_ARGS__)\n#define MOCK_METHOD10_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(, ct, m, 10, __VA_ARGS__)\n\n#define MOCK_CONST_METHOD0_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 0, __VA_ARGS__)\n#define MOCK_CONST_METHOD1_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 1, __VA_ARGS__)\n#define MOCK_CONST_METHOD2_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 2, __VA_ARGS__)\n#define MOCK_CONST_METHOD3_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 3, __VA_ARGS__)\n#define MOCK_CONST_METHOD4_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 4, __VA_ARGS__)\n#define MOCK_CONST_METHOD5_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 5, __VA_ARGS__)\n#define MOCK_CONST_METHOD6_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 6, __VA_ARGS__)\n#define MOCK_CONST_METHOD7_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 7, __VA_ARGS__)\n#define MOCK_CONST_METHOD8_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 8, __VA_ARGS__)\n#define MOCK_CONST_METHOD9_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 9, __VA_ARGS__)\n#define MOCK_CONST_METHOD10_WITH_CALLTYPE(ct, m, ...) \\\n GMOCK_INTERNAL_MOCK_METHODN(const, ct, m, 10, __VA_ARGS__)\n\n#define MOCK_METHOD0_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD0_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD1_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD1_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD2_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD2_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD3_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD3_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD4_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD4_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD5_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD5_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD6_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD6_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD7_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD7_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD8_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD8_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD9_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD9_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_METHOD10_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_METHOD10_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n\n#define MOCK_CONST_METHOD0_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD0_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD1_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD1_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD2_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD2_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD3_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD3_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD4_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD4_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD5_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD5_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD6_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD6_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD7_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD7_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD8_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD8_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD9_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD9_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n#define MOCK_CONST_METHOD10_T_WITH_CALLTYPE(ct, m, ...) \\\n MOCK_CONST_METHOD10_WITH_CALLTYPE(ct, m, __VA_ARGS__)\n\n#define GMOCK_INTERNAL_MOCK_METHODN(constness, ct, Method, args_num, ...) \\\n GMOCK_INTERNAL_ASSERT_VALID_SIGNATURE( \\\n args_num, ::testing::internal::identity_t<__VA_ARGS__>); \\\n GMOCK_INTERNAL_MOCK_METHOD_IMPL( \\\n args_num, Method, GMOCK_PP_NARG0(constness), 0, 0, , ct, , \\\n (::testing::internal::identity_t<__VA_ARGS__>))\n\n#define GMOCK_MOCKER_(arity, constness, Method) \\\n GTEST_CONCAT_TOKEN_(gmock##constness##arity##_##Method##_, __LINE__)\n\n#endif // GOOGLEMOCK_INCLUDE_GMOCK_INTERNAL_GMOCK_FUNCTION_MOCKER_H_\n" }, { "path": "3rd/googletest-1.12.1/googlemock/include/gmock/gmock-matchers.h", "content": "// Copyright 2007, Google Inc.\n// All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n// Google Mock - a framework for writing C++ mock classes.\n//\n// The MATCHER* family of macros can be used in a namespace scope to\n// define custom matchers easily.\n//\n// Basic Usage\n// ===========\n//\n// The syntax\n//\n// MATCHER(name, description_string) { statements; }\n//\n// defines a matcher with the given name that executes the statements,\n// which must return a bool to indicate if the match succeeds. Inside\n// the statements, you can refer to the value being matched by 'arg',\n// and refer to its type by 'arg_type'.\n//\n// The description string documents what the matcher does, and is used\n// to generate the failure message when the match fails. Since a\n// MATCHER() is usually defined in a header file shared by multiple\n// C++ source files, we require the description to be a C-string\n// literal to avoid possible side effects. It can be empty, in which\n// case we'll use the sequence of words in the matcher name as the\n// description.\n//\n// For example:\n//\n// MATCHER(IsEven, \"\") { return (arg % 2) == 0; }\n//\n// allows you to write\n//\n// // Expects mock_foo.Bar(n) to be called where n is even.\n// EXPECT_CALL(mock_foo, Bar(IsEven()));\n//\n// or,\n//\n// // Verifies that the value of some_expression is even.\n// EXPECT_THAT(some_expression, IsEven());\n//\n// If the above assertion fails, it will print something like:\n//\n// Value of: some_expression\n// Expected: is even\n// Actual: 7\n//\n// where the description \"is even\" is automatically calculated from the\n// matcher name IsEven.\n//\n// Argument Type\n// =============\n//\n// Note that the type of the value being matched (arg_type) is\n// determined by the context in which you use the matcher and is\n// supplied to you by the compiler, so you don't need to worry about\n// declaring it (nor can you). This allows the matcher to be\n// polymorphic. For example, IsEven() can be used to match any type\n// where the value of \"(arg % 2) == 0\" can be implicitly converted to\n// a bool. In the \"Bar(IsEven())\" example above, if method Bar()\n// takes an int, 'arg_type' will be int; if it takes an unsigned long,\n// 'arg_type' will be unsigned long; and so on.\n//\n// Parameterizing Matchers\n// =======================\n//\n// Sometimes you'll want to parameterize the matcher. For that you\n// can use another macro:\n//\n// MATCHER_P(name, param_name, description_string) { statements; }\n//\n// For example:\n//\n// MATCHER_P(HasAbsoluteValue, value, \"\") { return abs(arg) == value; }\n//\n// will allow you to write:\n//\n// EXPECT_THAT(Blah(\"a\"), HasAbsoluteValue(n));\n//\n// which may lead to this message (assuming n is 10):\n//\n// Value of: Blah(\"a\")\n// Expected: has absolute value 10\n// Actual: -9\n//\n// Note that both the matcher description and its parameter are\n// printed, making the message human-friendly.\n//\n// In the matcher definition body, you can write 'foo_type' to\n// reference the type of a parameter named 'foo'. For example, in the\n// body of MATCHER_P(HasAbsoluteValue, value) above, you can write\n// 'value_type' to refer to the type of 'value'.\n//\n// We also provide MATCHER_P2, MATCHER_P3, ..., up to MATCHER_P$n to\n// support multi-parameter matchers.\n//\n// Describing Parameterized Matchers\n// =================================\n//\n// The last argument to MATCHER*() is a string-typed expression. The\n// expression can reference all of the matcher's parameters and a\n// special bool-typed variable named 'negation'. When 'negation' is\n// false, the expression should evaluate to the matcher's description;\n// otherwise it should evaluate to the description of the negation of\n// the matcher. For example,\n//\n// using testing::PrintToString;\n//\n// MATCHER_P2(InClosedRange, low, hi,\n// std::string(negation ? \"is not\" : \"is\") + \" in range [\" +\n// PrintToString(low) + \", \" + PrintToString(hi) + \"]\") {\n// return low <= arg && arg <= hi;\n// }\n// ...\n// EXPECT_THAT(3, InClosedRange(4, 6));\n// EXPECT_THAT(3, Not(InClosedRange(2, 4)));\n//\n// would generate two failures that contain the text:\n//\n// Expected: is in range [4, 6]\n// ...\n// Expected: is not in range [2, 4]\n//\n// If you specify \"\" as the description, the failure message will\n// contain the sequence of words in the matcher name followed by the\n// parameter values printed as a tuple. For example,\n//\n// MATCHER_P2(InClosedRange, low, hi, \"\") { ... }\n// ...\n// EXPECT_THAT(3, InClosedRange(4, 6));\n// EXPECT_THAT(3, Not(InClosedRange(2, 4)));\n//\n// would generate two failures that contain the text:\n//\n// Expected: in closed range (4, 6)\n// ...\n// Expected: not (in closed range (2, 4))\n//\n// Types of Matcher Parameters\n// ===========================\n//\n// For the purpose of typing, you can view\n//\n// MATCHER_Pk(Foo, p1, ..., pk, description_string) { ... }\n//\n// as shorthand for\n//\n// template \n// FooMatcherPk\n// Foo(p1_type p1, ..., pk_type pk) { ... }\n//\n// When you write Foo(v1, ..., vk), the compiler infers the types of\n// the parameters v1, ..., and vk for you. If you are not happy with\n// the result of the type inference, you can specify the types by\n// explicitly instantiating the template, as in Foo(5,\n// false). As said earlier, you don't get to (or need to) specify\n// 'arg_type' as that's determined by the context in which the matcher\n// is used. You can assign the result of expression Foo(p1, ..., pk)\n// to a variable of type FooMatcherPk. This\n// can be useful when composing matchers.\n//\n// While you can instantiate a matcher template with reference types,\n// passing the parameters by pointer usually makes your code more\n// readable. If, however, you still want to pass a parameter by\n// reference, be aware that in the failure message generated by the\n// matcher you will see the value of the referenced object but not its\n// address.\n//\n// Explaining Match Results\n// ========================\n//\n// Sometimes the matcher description alone isn't enough to explain why\n// the match has failed or succeeded. For example, when expecting a\n// long string, it can be very helpful to also print the diff between\n// the expected string and the actual one. To achieve that, you can\n// optionally stream additional information to a special variable\n// named result_listener, whose type is a pointer to class\n// MatchResultListener:\n//\n// MATCHER_P(EqualsLongString, str, \"\") {\n// if (arg == str) return true;\n//\n// *result_listener << \"the difference: \"\n/// << DiffStrings(str, arg);\n// return false;\n// }\n//\n// Overloading Matchers\n// ====================\n//\n// You can overload matchers with different numbers of parameters:\n//\n// MATCHER_P(Blah, a, description_string1) { ... }\n// MATCHER_P2(Blah, a, b, description_string2) { ... }\n//\n// Caveats\n// =======\n//\n// When defining a new matcher, you should also consider implementing\n// MatcherInterface or using MakePolymorphicMatcher(). These\n// approaches require more work than the MATCHER* macros, but also\n// give you more control on the types of the value being matched and\n// the matcher parameters, which may leads to better compiler error\n// messages when the matcher is used wrong. They also allow\n// overloading matchers based on parameter types (as opposed to just\n// based on the number of parameters).\n//\n// MATCHER*() can only be used in a namespace scope as templates cannot be\n// declared inside of a local class.\n//\n// More Information\n// ================\n//\n// To learn more about using these macros, please search for 'MATCHER'\n// on\n// https://github.com/google/googletest/blob/master/docs/gmock_cook_book.md\n//\n// This file also implements some commonly used argument matchers. More\n// matchers can be defined by the user implementing the\n// MatcherInterface interface if necessary.\n//\n// See googletest/include/gtest/gtest-matchers.h for the definition of class\n// Matcher, class MatcherInterface, and others.\n\n// IWYU pragma: private, include \"gmock/gmock.h\"\n// IWYU pragma: friend gmock/.*\n\n#ifndef GOOGLEMOCK_INCLUDE_GMOCK_GMOCK_MATCHERS_H_\n#define GOOGLEMOCK_INCLUDE_GMOCK_GMOCK_MATCHERS_H_\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include // NOLINT\n#include \n#include \n#include \n#include \n#include \n\n#include \"gmock/internal/gmock-internal-utils.h\"\n#include \"gmock/internal/gmock-port.h\"\n#include \"gmock/internal/gmock-pp.h\"\n#include \"gtest/gtest.h\"\n\n// MSVC warning C5046 is new as of VS2017 version 15.8.\n#if defined(_MSC_VER) && _MSC_VER >= 1915\n#define GMOCK_MAYBE_5046_ 5046\n#else\n#define GMOCK_MAYBE_5046_\n#endif\n\nGTEST_DISABLE_MSC_WARNINGS_PUSH_(\n 4251 GMOCK_MAYBE_5046_ /* class A needs to have dll-interface to be used by\n clients of class B */\n /* Symbol involving type with internal linkage not defined */)\n\nnamespace testing {\n\n// To implement a matcher Foo for type T, define:\n// 1. a class FooMatcherImpl that implements the\n// MatcherInterface interface, and\n// 2. a factory function that creates a Matcher object from a\n// FooMatcherImpl*.\n//\n// The two-level delegation design makes it possible to allow a user\n// to write \"v\" instead of \"Eq(v)\" where a Matcher is expected, which\n// is impossible if we pass matchers by pointers. It also eases\n// ownership management as Matcher objects can now be copied like\n// plain values.\n\n// A match result listener that stores the explanation in a string.\nclass StringMatchResultListener : public MatchResultListener {\n public:\n StringMatchResultListener() : MatchResultListener(&ss_) {}\n\n // Returns the explanation accumulated so far.\n std::string str() const { return ss_.str(); }\n\n // Clears the explanation accumulated so far.\n void Clear() { ss_.str(\"\"); }\n\n private:\n ::std::stringstream ss_;\n\n StringMatchResultListener(const StringMatchResultListener&) = delete;\n StringMatchResultListener& operator=(const StringMatchResultListener&) =\n delete;\n};\n\n// Anything inside the 'internal' namespace IS INTERNAL IMPLEMENTATION\n// and MUST NOT BE USED IN USER CODE!!!\nnamespace internal {\n\n// The MatcherCastImpl class template is a helper for implementing\n// MatcherCast(). We need this helper in order to partially\n// specialize the implementation of MatcherCast() (C++ allows\n// class/struct templates to be partially specialized, but not\n// function templates.).\n\n// This general version is used when MatcherCast()'s argument is a\n// polymorphic matcher (i.e. something that can be converted to a\n// Matcher but is not one yet; for example, Eq(value)) or a value (for\n// example, \"hello\").\ntemplate \nclass MatcherCastImpl {\n public:\n static Matcher Cast(const M& polymorphic_matcher_or_value) {\n // M can be a polymorphic matcher, in which case we want to use\n // its conversion operator to create Matcher. Or it can be a value\n // that should be passed to the Matcher's constructor.\n //\n // We can't call Matcher(polymorphic_matcher_or_value) when M is a\n // polymorphic matcher because it'll be ambiguous if T has an implicit\n // constructor from M (this usually happens when T has an implicit\n // constructor from any type).\n //\n // It won't work to unconditionally implicit_cast\n // polymorphic_matcher_or_value to Matcher because it won't trigger\n // a user-defined conversion from M to T if one exists (assuming M is\n // a value).\n return CastImpl(polymorphic_matcher_or_value,\n std::is_convertible>{},\n std::is_convertible{});\n }\n\n private:\n template \n static Matcher CastImpl(const M& polymorphic_matcher_or_value,\n std::true_type /* convertible_to_matcher */,\n std::integral_constant) {\n // M is implicitly convertible to Matcher, which means that either\n // M is a polymorphic matcher or Matcher has an implicit constructor\n // from M. In both cases using the implicit conversion will produce a\n // matcher.\n //\n // Even if T has an implicit constructor from M, it won't be called because\n // creating Matcher would require a chain of two user-defined conversions\n // (first to create T from M and then to create Matcher from T).\n return polymorphic_matcher_or_value;\n }\n\n // M can't be implicitly converted to Matcher, so M isn't a polymorphic\n // matcher. It's a value of a type implicitly convertible to T. Use direct\n // initialization to create a matcher.\n static Matcher CastImpl(const M& value,\n std::false_type /* convertible_to_matcher */,\n std::true_type /* convertible_to_T */) {\n return Matcher(ImplicitCast_(value));\n }\n\n // M can't be implicitly converted to either Matcher or T. Attempt to use\n // polymorphic matcher Eq(value) in this case.\n //\n // Note that we first attempt to perform an implicit cast on the value and\n // only fall back to the polymorphic Eq() matcher afterwards because the\n // latter calls bool operator==(const Lhs& lhs, const Rhs& rhs) in the end\n // which might be undefined even when Rhs is implicitly convertible to Lhs\n // (e.g. std::pair vs. std::pair).\n //\n // We don't define this method inline as we need the declaration of Eq().\n static Matcher CastImpl(const M& value,\n std::false_type /* convertible_to_matcher */,\n std::false_type /* convertible_to_T */);\n};\n\n// This more specialized version is used when MatcherCast()'s argument\n// is already a Matcher. This only compiles when type T can be\n// statically converted to type U.\ntemplate \nclass MatcherCastImpl> {\n public:\n static Matcher Cast(const Matcher& source_matcher) {\n return Matcher(new Impl(source_matcher));\n }\n\n private:\n class Impl : public MatcherInterface {\n public:\n explicit Impl(const Matcher& source_matcher)\n : source_matcher_(source_matcher) {}\n\n // We delegate the matching logic to the source matcher.\n bool MatchAndExplain(T x, MatchResultListener* listener) const override {\n using FromType = typename std::remove_cv::type>::type>::type;\n using ToType = typename std::remove_cv::type>::type>::type;\n // Do not allow implicitly converting base*/& to derived*/&.\n static_assert(\n // Do not trigger if only one of them is a pointer. That implies a\n // regular conversion and not a down_cast.\n (std::is_pointer::type>::value !=\n std::is_pointer::type>::value) ||\n std::is_same::value ||\n !std::is_base_of::value,\n \"Can't implicitly convert from to \");\n\n // Do the cast to `U` explicitly if necessary.\n // Otherwise, let implicit conversions do the trick.\n using CastType =\n typename std::conditional::value,\n T&, U>::type;\n\n return source_matcher_.MatchAndExplain(static_cast(x),\n listener);\n }\n\n void DescribeTo(::std::ostream* os) const override {\n source_matcher_.DescribeTo(os);\n }\n\n void DescribeNegationTo(::std::ostream* os) const override {\n source_matcher_.DescribeNegationTo(os);\n }\n\n private:\n const Matcher source_matcher_;\n };\n};\n\n// This even more specialized version is used for efficiently casting\n// a matcher to its own type.\ntemplate \nclass MatcherCastImpl> {\n public:\n static Matcher Cast(const Matcher& matcher) { return matcher; }\n};\n\n// Template specialization for parameterless Matcher.\ntemplate \nclass MatcherBaseImpl {\n public:\n MatcherBaseImpl() = default;\n\n template \n operator ::testing::Matcher() const { // NOLINT(runtime/explicit)\n return ::testing::Matcher(new\n typename Derived::template gmock_Impl());\n }\n};\n\n// Template specialization for Matcher with parameters.\ntemplate
\n
\n

{{ site.title | default: \"Documentation\" }}

\n
\n \n \n \n