[ { "path": ".gitignore", "content": "## Ignore Visual Studio temporary files, build results, and\n## files generated by popular Visual Studio add-ons.\n##\n## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore\n\n# User-specific files\n*.rsuser\n*.suo\n*.user\n*.userosscache\n*.sln.docstates\n\n# User-specific files (MonoDevelop/Xamarin Studio)\n*.userprefs\n\n# Mono auto generated files\nmono_crash.*\n\n# Build results\n[Dd]ebug/\n[Dd]ebugPublic/\n[Rr]elease/\n[Rr]eleases/\n[Ww][Ii][Nn]32/\n[Aa][Rr][Mm]/\n[Aa][Rr][Mm]64/\nbld/\n[Bb]in/\n[Oo]bj/\n[Ll]og/\n[Ll]ogs/\n\n# Visual Studio 2015/2017 cache/options directory\n.vs/\n# Uncomment if you have tasks that create the project's static files in wwwroot\n#wwwroot/\n\n# Visual Studio 2017 auto generated files\nGenerated\\ Files/\n\n# MSTest test Results\n[Tt]est[Rr]esult*/\n[Bb]uild[Ll]og.*\n\n# NUnit\n*.VisualState.xml\nTestResult.xml\nnunit-*.xml\n\n# Build Results of an ATL Project\n[Dd]ebugPS/\n[Rr]eleasePS/\ndlldata.c\n\n# Benchmark Results\nBenchmarkDotNet.Artifacts/\n\n# .NET Core\nproject.lock.json\nproject.fragment.lock.json\nartifacts/\n\n# ASP.NET Scaffolding\nScaffoldingReadMe.txt\n\n# StyleCop\nStyleCopReport.xml\n\n# Files built by Visual Studio\n*_i.c\n*_p.c\n*_h.h\n*.ilk\n*.meta\n*.obj\n*.iobj\n*.pch\n*.pdb\n*.ipdb\n*.pgc\n*.pgd\n*.rsp\n*.sbr\n*.tlb\n*.tli\n*.tlh\n*.tmp\n*.tmp_proj\n*_wpftmp.csproj\n*.log\n*.vspscc\n*.vssscc\n.builds\n*.pidb\n*.svclog\n*.scc\n\n# Chutzpah Test files\n_Chutzpah*\n\n# Visual C++ cache files\nipch/\n*.aps\n*.ncb\n*.opendb\n*.opensdf\n*.sdf\n*.cachefile\n*.VC.db\n*.VC.VC.opendb\n\n# Visual Studio profiler\n*.psess\n*.vsp\n*.vspx\n*.sap\n\n# Visual Studio Trace Files\n*.e2e\n\n# TFS 2012 Local Workspace\n$tf/\n\n# Guidance Automation Toolkit\n*.gpState\n\n# ReSharper is a .NET coding add-in\n_ReSharper*/\n*.[Rr]e[Ss]harper\n*.DotSettings.user\n\n# TeamCity is a build add-in\n_TeamCity*\n\n# DotCover is a Code Coverage Tool\n*.dotCover\n\n# AxoCover is a Code Coverage Tool\n.axoCover/*\n!.axoCover/settings.json\n\n# Coverlet is a free, cross platform Code Coverage Tool\ncoverage*[.json, .xml, .info]\n\n# Visual Studio code coverage results\n*.coverage\n*.coveragexml\n\n# NCrunch\n_NCrunch_*\n.*crunch*.local.xml\nnCrunchTemp_*\n\n# MightyMoose\n*.mm.*\nAutoTest.Net/\n\n# Web workbench (sass)\n.sass-cache/\n\n# Installshield output folder\n[Ee]xpress/\n\n# DocProject is a documentation generator add-in\nDocProject/buildhelp/\nDocProject/Help/*.HxT\nDocProject/Help/*.HxC\nDocProject/Help/*.hhc\nDocProject/Help/*.hhk\nDocProject/Help/*.hhp\nDocProject/Help/Html2\nDocProject/Help/html\n\n# Click-Once directory\npublish/\n\n# Publish Web Output\n*.[Pp]ublish.xml\n*.azurePubxml\n# Note: Comment the next line if you want to checkin your web deploy settings,\n# but database connection strings (with potential passwords) will be unencrypted\n*.pubxml\n*.publishproj\n\n# Microsoft Azure Web App publish settings. Comment the next line if you want to\n# checkin your Azure Web App publish settings, but sensitive information contained\n# in these scripts will be unencrypted\nPublishScripts/\n\n# NuGet Packages\n*.nupkg\n# NuGet Symbol Packages\n*.snupkg\n# The packages folder can be ignored because of Package Restore\n**/[Pp]ackages/*\n# except build/, which is used as an MSBuild target.\n!**/[Pp]ackages/build/\n# Uncomment if necessary however generally it will be regenerated when needed\n#!**/[Pp]ackages/repositories.config\n# NuGet v3's project.json files produces more ignorable files\n*.nuget.props\n*.nuget.targets\n\n# Microsoft Azure Build Output\ncsx/\n*.build.csdef\n\n# Microsoft Azure Emulator\necf/\nrcf/\n\n# Windows Store app package directories and files\nAppPackages/\nBundleArtifacts/\nPackage.StoreAssociation.xml\n_pkginfo.txt\n*.appx\n*.appxbundle\n*.appxupload\n\n# Visual Studio cache files\n# files ending in .cache can be ignored\n*.[Cc]ache\n# but keep track of directories ending in .cache\n!?*.[Cc]ache/\n\n# Others\nClientBin/\n~$*\n*~\n*.dbmdl\n*.dbproj.schemaview\n*.jfm\n*.pfx\n*.publishsettings\norleans.codegen.cs\n\n# Including strong name files can present a security risk\n# (https://github.com/github/gitignore/pull/2483#issue-259490424)\n#*.snk\n\n# Since there are multiple workflows, uncomment next line to ignore bower_components\n# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)\n#bower_components/\n\n# RIA/Silverlight projects\nGenerated_Code/\n\n# Backup & report files from converting an old project file\n# to a newer Visual Studio version. Backup files are not needed,\n# because we have git ;-)\n_UpgradeReport_Files/\nBackup*/\nUpgradeLog*.XML\nUpgradeLog*.htm\nServiceFabricBackup/\n*.rptproj.bak\n\n# SQL Server files\n*.mdf\n*.ldf\n*.ndf\n\n# Business Intelligence projects\n*.rdl.data\n*.bim.layout\n*.bim_*.settings\n*.rptproj.rsuser\n*- [Bb]ackup.rdl\n*- [Bb]ackup ([0-9]).rdl\n*- [Bb]ackup ([0-9][0-9]).rdl\n\n# Microsoft Fakes\nFakesAssemblies/\n\n# GhostDoc plugin setting file\n*.GhostDoc.xml\n\n# Node.js Tools for Visual Studio\n.ntvs_analysis.dat\nnode_modules/\n\n# Visual Studio 6 build log\n*.plg\n\n# Visual Studio 6 workspace options file\n*.opt\n\n# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)\n*.vbw\n\n# Visual Studio LightSwitch build output\n**/*.HTMLClient/GeneratedArtifacts\n**/*.DesktopClient/GeneratedArtifacts\n**/*.DesktopClient/ModelManifest.xml\n**/*.Server/GeneratedArtifacts\n**/*.Server/ModelManifest.xml\n_Pvt_Extensions\n\n# Paket dependency manager\n.paket/paket.exe\npaket-files/\n\n# FAKE - F# Make\n.fake/\n\n# CodeRush personal settings\n.cr/personal\n\n# Python Tools for Visual Studio (PTVS)\n__pycache__/\n*.pyc\n\n# Cake - Uncomment if you are using it\n# tools/**\n# !tools/packages.config\n\n# Tabs Studio\n*.tss\n\n# Telerik's JustMock configuration file\n*.jmconfig\n\n# BizTalk build output\n*.btp.cs\n*.btm.cs\n*.odx.cs\n*.xsd.cs\n\n# OpenCover UI analysis results\nOpenCover/\n\n# Azure Stream Analytics local run output\nASALocalRun/\n\n# MSBuild Binary and Structured Log\n*.binlog\n\n# NVidia Nsight GPU debugger configuration file\n*.nvuser\n\n# MFractors (Xamarin productivity tool) working folder\n.mfractor/\n\n# Local History for Visual Studio\n.localhistory/\n\n# BeatPulse healthcheck temp database\nhealthchecksdb\n\n# Backup folder for Package Reference Convert tool in Visual Studio 2017\nMigrationBackup/\n\n# Ionide (cross platform F# VS Code tools) working folder\n.ionide/\n\n# Fody - auto-generated XML schema\nFodyWeavers.xsd\npepp.vcxproj\npepp.vcxproj.filters\n" }, { "path": "Main.cpp", "content": "#include \"VMPImportFixer.hpp\"\n\nbool IsFileArchX64(std::filesystem::path path, bool* parsed = nullptr);\n\ntemplate\nIVMPImportFixer* VifFactory_GenerateFixer(std::string_view vmpsn) noexcept\n{\n\treturn new VMPImportFixer(vmpsn);\n}\n\nint main(int argc, const char** argv)\n{\n\tlogger = spdlog::stdout_color_mt(\"console\");\n\tlogger->set_level(spdlog::level::debug);\n\tlogger->set_pattern(\"[%^%l%$] %v\");\n\n\tif (argc > 1)\n\t{\n\t\tstd::string_view sFilePathOrProc {};\n\t\tstd::string_view sTargetModule {};\n\t\tstd::string_view sVMPSectionName { \".vmp0\" };\n\t\tDWORD\t\t\t dwProcessId { 0ul };\n\n\t\t//\n\t\t// Parse out arguments\n\t\tfor (int i = 1; i < argc; ++i)\n\t\t{\n\t\t\tif (_stricmp(argv[i], \"-p\") == 0 && (i + 1) < argc)\n\t\t\t{\n\t\t\t\tconst char* szArg = argv[++i];\n\n\t\t\t\tif (szArg[0] != '\\'')\n\t\t\t\t{\n\t\t\t\t\tdwProcessId = std::atoi(szArg);\n\t\t\t\t\tif (dwProcessId == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tlogger->critical(\"Invalid process id '{}'\", szArg);\n\t\t\t\t\t\treturn EXIT_FAILURE;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstd::string sArgProc = std::string(szArg).substr(1, strlen(szArg) - 2);\n\t\t\t\t\tspdlog::stopwatch sw;\n\n\t\t\t\t\t//\n\t\t\t\t\t// Search for process with the name\n\t\t\t\t\twhile ((dwProcessId = VifSearchForProcess(sArgProc)) == static_cast(-1))\n\t\t\t\t\t{\n\t\t\t\t\t\tif (std::chrono::duration_cast(sw.elapsed()).count() > 10000)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlogger->critical(\"Timed out searching for process {}.\", sArgProc);\n\t\t\t\t\t\t\treturn EXIT_FAILURE;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(100));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (_stricmp(argv[i], \"-f\") == 0 && (i + 1) < argc && dwProcessId == 0)\n\t\t\t{\n\t\t\t\tsFilePathOrProc = argv[++i];\n\t\t\t}\n\n\t\t\tif (_stricmp(argv[i], \"-mod\") == 0 && (i + 1) < argc)\n\t\t\t{\n\t\t\t\tsTargetModule = argv[++i];\n\t\t\t}\n\n\t\t\tif (_stricmp(argv[i], \"-section\") == 0 && (i + 1) < argc)\n\t\t\t{\n\t\t\t\tsVMPSectionName = argv[++i];\n\t\t\t}\n\t\t}\n\n\t\tif (!sFilePathOrProc.empty() && std::filesystem::exists(sFilePathOrProc))\n\t\t{\n\t\t\tbool bWasParsed = false;\n\t\t\tbool bIsArchX64 = IsFileArchX64(sFilePathOrProc, &bWasParsed);\n\n\t\t\tif (bWasParsed)\n\t\t\t{\n\t\t\t\t//\n\t\t\t\t// TODO: Load DLL or process into memory (LoadLibraryEx/CreateProcess), unpack and fix IAT.\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (dwProcessId != 0)\n\t\t\t{\n\t\t\t\tIVMPImportFixer* pImportFixer = nullptr;\n\t\t\t\tHANDLE hProcess = OpenProcess(PROCESS_ALL_ACCESS, FALSE, dwProcessId);\n\t\t\t\tBOOL bIsWow64 = FALSE;\n\t\t\t\t\n\t\t\t\tif (hProcess == INVALID_HANDLE_VALUE)\n\t\t\t\t{\n\t\t\t\t\tlogger->critical(\"Unable to open a handle to the process!\");\n\t\t\t\t\treturn EXIT_FAILURE;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tIsWow64Process(hProcess, &bIsWow64);\n\n\t\t\t\tif (bIsWow64)\n\t\t\t\t\tpImportFixer = VifFactory_GenerateFixer<32>(sVMPSectionName);\n\t\t\t\telse\n\t\t\t\t\tpImportFixer = VifFactory_GenerateFixer<64>(sVMPSectionName);\n\n\t\t\t\tstd::filesystem::create_directories(\"dumps\");\n\n\t\t\t\tpImportFixer->DumpInMemory(hProcess, sTargetModule);\n\n\n\t\t\t\tdelete pImportFixer;\n\t\t\t\tpImportFixer = nullptr;\n\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t\t}\n\n\t\t\tlogger->critical(\"Invalid process!\");\n\t\t}\n\t}\n\telse\n\t{\n\t\tstd::cout << \"VMPImportFixer: Resolve import calls in a VMProtect'd binary (developed by github.com/mike1k)\" << std::endl;\n\t\tstd::cout <<\n\t\t\t\"Usage: \\tVMPImportFixer\\n -proc \\t(required) process name/process id\" <<\n\t\t\tstd::endl;\n\t\tstd::cout << \" -mod: \\t(optional) names of module to dump.\" << std::endl;\n\t\tstd::cout << \" -section: \\t(optional) VMP section name to use if changed from default (VMP allows custom names)\" << std::endl;\n\t\t\n\t\tstd::cout <<\n\t\t\t\"Example usages:\\n\"\n\t\t\t\"*\\tVMPImportFixer -p 'test.exe'\\n\" <<\n\t\t\t\"*\\tVMPImportFixer -p 123456 -mod vmp.dll -section .name0\\n\" <<\n\t\t\tstd::endl;\n\n\t\tstd::cout << std::endl;\n\t}\n\treturn EXIT_FAILURE;\n}\n\nbool IsFileArchX64(std::filesystem::path path, bool* parsed)\n{\n\tpepp::io::File file{ path.string(), pepp::io::FILE_BINARY | pepp::io::FILE_INPUT };\n\n\tif (file.GetSize() > 0)\n\t{\n\t\tstd::vector file_buf = file.Read();\n\n\t\tIMAGE_DOS_HEADER* dos = (IMAGE_DOS_HEADER*)file_buf.data();\n\t\t//\n\t\t// We don't need arch specific as FILE_HEADER is the second member and it is the same size on both archs.\n\t\tIMAGE_NT_HEADERS* nt = (IMAGE_NT_HEADERS*)(file_buf.data() + dos->e_lfanew);\n\n\t\tif (dos->e_magic == IMAGE_DOS_SIGNATURE)\n\t\t{\n\t\t\tif (nt->Signature == IMAGE_NT_SIGNATURE)\n\t\t\t{\n\t\t\t\tif (parsed)\n\t\t\t\t\t*parsed = true;\n\n\t\t\t\tif (nt->FileHeader.Machine == IMAGE_FILE_MACHINE_AMD64)\n\t\t\t\t{\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (parsed)\n\t\t*parsed = false;\n\n\treturn false;\n}\n\n" }, { "path": "README.md", "content": "# VMPImportFixer\n\nVMPImportFixer is a tool aimed to resolve import calls in a VMProtect'd (3.x) binary.\n\n# Information\n\nVMPImportFixer attempts to resolve all obfuscated API calls in a VMProtect'd binary. A binary which has VMProtect's \"Import Protection\" option enabled will have all it's `CALL NEAR` instructions replaced with near relative call instructions (see [ImportCallObfuscator](https://github.com/mike1k/ImportCallObfuscator) for a similar method of obfuscating imports).\n\nVMProtect usually has two different variations of import calls which seem to be chosen at random once the binary is protected. The first, being `push reg; call func`, and the other being `call func; ret/int3`.\n\n![call/int3](https://i.imgur.com/X15Aps6.png)\n![push/call](https://i.imgur.com/cgA8ecy.png)\n\nFollowing these calls lead into the VMProtect section, which, by default is named `.vmp0`. Each stub can vary in complexity and size, however the concept is generally the same. Through a series of arithmetic which is used to calculate the real import address, the final operation usually sets `[rsp]`/`[esp]` to the import address before the final RET instruction.\n\nBased on the variant of the call (`push reg; call func` or `call func; int3/ret`), the stub may increment the return address. This use of the extra byte and return address incrementing is used to break various decompilers from properly analyzing a function due to the decompiler not recognizing that the byte will be skipped over in runtime.\n\nWith this information combined, I decided to write a tool over the day that solves these calls. I was not happy with public implementations due to various reasons. One was closed-source, and seemed to be limited to a debugger, and the other lifts these stubs into a IL which seems impractical. I decided to go the emulation route as this trivially tackles the problem and supports both X86 and X86-64 flawlessly.\n\nVMPImportFixer is an all-in-one tool; it will support X86 processes regardless of being in a X64 context. This means that there is no need for architecture dependent versions of the binary.\n\n# Usage \n\n```\nUsage: VMPImportFixer\n -p (required) process name/process id\n -mod: (optional) name of module to dump.\n -section: (optional) VMP section name to use if changed from default (VMP allows custom names)\n```\n\n# Examples\n
\n Images\n\n* Before\n![b1](https://i.imgur.com/wzraZfe.png)\n* After\n![a1](https://i.imgur.com/E12Gnxc.png)\n\n* Before\n![b2](https://i.imgur.com/eKdCdtm.png)\n* After\n![a2](https://i.imgur.com/acPdGVt.png)\n
\n\n# TODO\n\n* Add support for loading binaries off the disk into a state where it can be monitored at specific stages (such as unpacking) then fixed.\n* Add relocation handling on X86 binaries.\n* Kernel support.\n\n# Dependencies\n* [pepp](https://github.com/mike1k/pepp)\n* [Unicorn](https://github.com/unicorn-engine/unicorn)\n* [Zydis](https://github.com/zyantific/zydis)\n* [spdlog](https://github.com/gabime/spdlog)\n\n# Credits\n\n[mrexodia](https://github.com/mrexodia) for his contribution to [HookHunter](https://github.com/mike1k/HookHunter) regarding `ReadMemory` inside the `Process` class.\n" }, { "path": "VIFTools.cpp", "content": "#include \"VMPImportFixer.hpp\"\n\nDWORD VifSearchForProcess(std::string_view process_name) noexcept\n{\n PROCESSENTRY32 pe32{};\n pe32.dwSize = sizeof pe32;\n\n vif::nt::ScopedHandle hSnapshot = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);\n if (static_cast(hSnapshot) == INVALID_HANDLE_VALUE)\n return -1;\n\n if (Process32First(hSnapshot, &pe32))\n {\n do\n {\n std::string_view this_proc = pe32.szExeFile;\n if (this_proc.find(process_name) != this_proc.npos && pe32.th32ProcessID != GetCurrentProcessId())\n return pe32.th32ProcessID;\n } while (Process32Next(hSnapshot, &pe32));\n }\n\n return static_cast(-1);\n}\n\nbool VifFindModuleInProcess(HANDLE hProc, std::string_view module_name, VIFModuleInformation_t* info)\n{\n HMODULE hMods[1024];\n DWORD cbNeeded;\n unsigned int i;\n\n if (!info)\n return false;\n\n if (EnumProcessModulesEx(hProc, hMods, sizeof(hMods), &cbNeeded, LIST_MODULES_ALL))\n {\n for (i = 0; i < (cbNeeded / sizeof(HMODULE)); i++)\n {\n TCHAR szModName[MAX_PATH];\n \n if (GetModuleFileNameEx(hProc, hMods[i], szModName,\n sizeof(szModName) / sizeof(TCHAR)))\n {\n MODULEINFO mdi{};\n GetModuleInformation(hProc, hMods[i], &mdi, sizeof mdi);\n\n info->module_path = szModName;\n\n if (info->module_path.find(module_name) != std::string::npos)\n {\n info->base_address = (std::uint64_t)hMods[i];\n info->module_size = mdi.SizeOfImage;\n }\n }\n }\n }\n\n return info->base_address != 0;\n}\n\nbool VifFindModulesInProcess(HANDLE hProc, std::vector& modules)\n{\n HMODULE hMods[1024];\n DWORD cbNeeded;\n unsigned int i;\n\n if (EnumProcessModulesEx(hProc, hMods, sizeof(hMods), &cbNeeded, LIST_MODULES_ALL))\n {\n for (i = 0; i < (cbNeeded / sizeof(HMODULE)); i++)\n {\n TCHAR szModName[MAX_PATH];\n\n // Get the full path to the module's file.\n if (GetModuleFileNameEx(hProc, hMods[i], szModName,\n sizeof(szModName) / sizeof(TCHAR)))\n {\n MODULEINFO info{};\n GetModuleInformation(hProc, hMods[i], &info, sizeof info);\n\n modules.emplace_back(szModName, (std::uint64_t)hMods[i], info.SizeOfImage);\n }\n }\n }\n\n return modules.size() > 0;\n}\n" }, { "path": "VIFTools.hpp", "content": "#pragma once\n\nstruct VIFModuleInformation_t\n{\n std::string module_path;\n std::uint64_t base_address;\n std::uint32_t module_size;\n};\n\n\nDWORD VifSearchForProcess(std::string_view process_name) noexcept;\nbool VifFindModuleInProcess(HANDLE hProc, std::string_view module_name, VIFModuleInformation_t* info);\nbool VifFindModulesInProcess(HANDLE hProc, std::vector& modules);\n\n" }, { "path": "VMPImportFixer.cpp", "content": "#include \"VMPImportFixer.hpp\"\n\n\n\nstd::shared_ptr logger;\n\n// Explicit templates.\ntemplate class VMPImportFixer<32>;\ntemplate class VMPImportFixer<64>;\n\nclass UnicornEngine\n{\n\tuc_engine* ptr;\npublic:\n\tUnicornEngine(uc_engine* eng) noexcept\n\t\t: ptr(eng)\n\t{}\n\n\t~UnicornEngine() noexcept\n\t{\n\t\tif (ptr)\n\t\t\tuc_close(ptr);\n\t}\n};\n\n\ntemplate\ninline void VMPImportFixer::DumpInMemory(HANDLE hProcess, std::string_view sModName)\n{\n\t//\n\t// Define types for the current mode.\n\tusing AddressType = pepp::detail::Image_t::Address_t;\n\tusing Address = pepp::Address;\n\n\tstatic constexpr uc_mode EMULATION_MODE = BitSize == 32 ? UC_MODE_32 : UC_MODE_64;\n\tstatic constexpr uc_x86_reg STACK_REGISTER = BitSize == 32 ? UC_X86_REG_ESP : UC_X86_REG_RSP;\n\tstatic ZydisMachineMode ZY_MACHINE_MODE = BitSize == 32 ? ZYDIS_MACHINE_MODE_LONG_COMPAT_32 : ZYDIS_MACHINE_MODE_LONG_64;\n\tstatic ZydisAddressWidth ZY_ADDRESS_WIDTH = BitSize == 32 ? ZYDIS_ADDRESS_WIDTH_32 : ZYDIS_ADDRESS_WIDTH_64;\n\n\t//\n\t// Initialize unicorn.\n\tuc_engine* uc{};\n\tuc_hook code_hook{};\n\tuc_err err = uc_open(UC_ARCH_X86, EMULATION_MODE, &uc);\n\tUnicornEngine _scoped_unicorn_free(uc);\n\n\tif (err != UC_ERR_OK)\n\t{\n\t\tlogger->critical(\"Unable to open Unicorn in X86-{} mode (err: {})\", BitSize, err);\n\t\treturn;\n\t}\n\n\tif (ZyanStatus zs; !ZYAN_SUCCESS((zs = ZydisDecoderInit(&m_decoder, ZY_MACHINE_MODE, ZY_ADDRESS_WIDTH))))\n\t{\n\t\tlogger->critical(\"Unable to initialize Zydis (err: {:X})\", BitSize, zs);\n\t\treturn;\n\t}\n\n\tvif::nt::Process proc(hProcess);\n\tpepp::Image* pTargetImg = nullptr;\n\t\n\n\tif (proc.handle() == INVALID_HANDLE_VALUE)\n\t{\n\t\treturn;\n\t}\n\n\n\tif (!VifFindModulesInProcess(hProcess, m_vecModuleList) || m_vecModuleList.empty())\n\t{\n\t\tlogger->critical(\"Unable to fetch module list from process.\");\n\t\treturn;\n\t}\n\n\tint Idx{}, mIdx{};\n\n\tfor (auto& mod : m_vecModuleList)\n\t{\n\t\tsize_t nLastSize = 0;\n\t\tstd::unique_ptr pModBuffer(new std::uint8_t[mod.module_size]{});\n\t\tMEMORY_BASIC_INFORMATION mbi{};\n\n\t\t//\n\t\t// Loop through the module's memory and insert into the buffer.\n\t\twhile (VirtualQueryEx(proc.handle(), (PVOID)(mod.base_address + nLastSize), &mbi, sizeof (mbi)))\n\t\t{\n\t\t\tif (proc.ReadMemory(mbi.BaseAddress, &pModBuffer.get()[nLastSize], mbi.RegionSize))\n\t\t\t\t; // logger->info(\"Read memory at {} with size {}\", mbi.BaseAddress, mbi.RegionSize);\n\t\t\telse\n\t\t\t\t// Log the faliure, but that is all. We will still try to parse.\n\t\t\t\tlogger->critical(\"Unable to read memory at {:X}\", (std::uintptr_t)mbi.BaseAddress);\n\n\t\t\tnLastSize += mbi.RegionSize;\n\n\t\t\tif (nLastSize >= mod.module_size)\n\t\t\t\tbreak;\n\t\t}\n\n\t\tlogger->info(\"Pushing module {} located @ 0x{:X}\", mod.module_path, mod.base_address);\n\n\t\tm_vecImageList.emplace_back(std::move(pepp::Image::FromRuntimeMemory(pModBuffer.get(), mod.module_size)));\n\n\t\tif (m_vecImageList.back().magic() != IMAGE_DOS_SIGNATURE)\n\t\t{\n\t\t\tlogger->error(\"Failed parsing image: {}\", mod.module_path);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!sModName.empty() && mod.module_path.find(sModName) != std::string::npos)\n\t\t\tmIdx = Idx;\n\n\t\t++Idx;\n\t}\n\n\tfor (auto &img : m_vecImageList)\n\t{\n\t\tif (!sModName.empty())\n\t\t\tpTargetImg = &m_vecImageList[mIdx];\n\n\t\tm_ImageMap[img.GetPEHeader().GetOptionalHeader().GetImageBase()] = &img;\n\t}\n\n\t//\n\t// If no target module is selected, we default to the base process.\n\tif (pTargetImg == nullptr)\n\t\tpTargetImg = &m_vecImageList.front();\n\n\n\tAddress uImageBase = pTargetImg->GetPEHeader().GetOptionalHeader().GetImageBase();\n\n\tlogger->info(\"Using base address: {:X}\", uImageBase.uintptr());\n\n\t//\n\t// By default, we scan the .text section by name. If the target binary for whatever reason\n\t// has another name other than .text for it's code section, you will need to change this.\n\tpepp::SectionHeader& secText = pTargetImg->GetSectionHeader(\".text\");\n\t\n\tif (secText.GetName() == \".dummy\")\n\t{\n\t\tlogger->critical(\"Unable to find .text section!\");\n\t\treturn;\n\t}\n\n\tlogger->info(\"Found .text section at virtual address {:X}\", secText.GetVirtualAddress());\n\n\tpepp::SectionHeader& secVMP = pTargetImg->GetSectionHeader(m_strVMPSectionName);\n\tif (secVMP.GetName() == \".dummy\")\n\t{\n\t\tlogger->critical(\"Unable to find {} section!\", secVMP.GetName());\n\t\treturn;\n\t}\n\n\tlogger->info(\"Found {} section at virtual address {:X}\", m_strVMPSectionName, secVMP.GetVirtualAddress());\n\n\t//\n\t// Find all call sequences in the .text section.\n\tstd::vector vecCallMatches = \n\t\tpTargetImg->FindBinarySequence(&secText, \"E8 ? ? ? ?\");\n\n\tif (vecCallMatches.empty())\n\t{\n\t\tlogger->critical(\"Unable to find any call/jmp sequences in the .text section!\");\n\t\treturn;\n\t}\n\n\t//\n // Map the .text and .vmp0 sections into the emulator memory (even more overhead, but necessary)\n\tAddress uMappedTextAddress = (uImageBase + secText.GetVirtualAddress());\n\tAddress uMappedTextSize = pepp::Align4kb(secText.GetVirtualSize() + 0x1000);\n\n\terr = uc_mem_map(uc, uMappedTextAddress.uintptr(), uMappedTextSize.uintptr(), UC_PROT_ALL);\n\tif (err != UC_ERR_OK)\n\t{\n\t\tlogger->critical(\"Could not map in .text section => uc_mem_map() failed with error: {}\", err);\n\t\treturn;\n\t}\n\n\terr = uc_mem_write(uc, uMappedTextAddress.uintptr(), &pTargetImg->buffer()[secText.GetVirtualAddress()], secText.GetVirtualSize());\n\tif (err != UC_ERR_OK)\n\t{\n\t\tlogger->critical(\"Could not map in .text section => uc_mem_write() failed with error: {}\", err);\n\t\treturn;\n\t}\n\n\tAddress uMappedVmpAddress = (uImageBase + secVMP.GetVirtualAddress());\n\tAddress uMappedVmpSize = pepp::Align4kb(secVMP.GetVirtualSize() + 0x1000);\n\n\terr = uc_mem_map(uc, uMappedVmpAddress.uintptr(), uMappedVmpSize.uintptr(), UC_PROT_ALL);\n\tif (err != UC_ERR_OK)\n\t{\n\t\tlogger->critical(\"Could not map in VMP section => uc_mem_map() failed with error: {}\", err);\n\t\treturn;\n\t}\n\n\terr = uc_mem_write(uc, uMappedVmpAddress.uintptr(), &pTargetImg->buffer()[secVMP.GetVirtualAddress()], secVMP.GetVirtualSize());\n\tif (err != UC_ERR_OK)\n\t{\n\t\tlogger->critical(\"Could not map in VMP section => uc_mem_write() failed with error: {}\", err);\n\t\treturn;\n\t}\n\n\t//\n // Write the stack address and registers\n\tauto STACK_SPACE = (uMappedVmpAddress.uintptr() + (uMappedVmpSize.uintptr() - 0x1000)) & -0x10;\n\tuc_reg_write(uc, STACK_REGISTER, &STACK_SPACE);\n\n\t//\n\t// Temp data to hold info about resolved imports..\n\tstatic std::pair ExpResolved{};\n\n\t//\n\t// We need to monitor every instruction that executes (since it seems like we cannot hook the \n\t// exact instruction we need (RET))\n\tauto VifCodeHook = +[](uc_engine* uc, uint64_t address, uint32_t size, void* user_data)\n\t{\n\t\tIVMPImportFixer* pUd = (IVMPImportFixer*)user_data;\n\n\t\tuint8_t insnbuf[0xf];\n\t\tuc_mem_read(uc, address, insnbuf, size);\n\n\t\tExpResolved.first.clear();\n\n\t\t//\n\t\t// Did we hit a RET?\n\t\tif (insnbuf[0] == 0xC3 || insnbuf[0] == 0xC2)\n\t\t{\n\t\t\t//\n\t\t\t// Real import address is stored in [sp reg]\n\t\t\tAddressType uImportAddress{};\n\t\t\tVIFModuleInformation_t mod{};\n\t\t\tpepp::ExportData_t exp{};\n\n\t\t\tuc_reg_read(uc, STACK_REGISTER, &uImportAddress);\n\t\t\tuc_mem_read(uc, uImportAddress, &uImportAddress, sizeof(uImportAddress));\n\n\t\t\tif (pUd->GetModuleFromAddress(uImportAddress, &mod))\n\t\t\t{\n\t\t\t\tif (!pUd->GetExportData(mod.base_address, uImportAddress - mod.base_address, &ExpResolved.second))\n\t\t\t\t{\n\t\t\t\t\tlogger->critical(\"Could not find export from address {:X}\", uImportAddress);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tExpResolved.first = std::filesystem::path(mod.module_path).filename().string();\n\n\t\t\t\t// logger->info(\"Resolved a call to {}!{}\", ExpResolved.first, ExpResolved.second.name);\n\t\t\t\t\n\t\t\t\t//\n\t\t\t\t// Stop emulation so we don't get a memory fetch error.\n\t\t\t\tuc_emu_stop(uc);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlogger->critical(\"Could not find module from address {:X}\", uImportAddress);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t};\n\n\n\tif ((err=uc_hook_add(uc,\n\t\t&code_hook,\n\t\tUC_HOOK_CODE,\n\t\tVifCodeHook,\n\t\tthis,\n\t\t1,\n\t\t0)) != UC_ERR_OK)\n\t{\n\t\tlogger->critical(\"Could not install a code hook: {}\", err);\n\t\treturn;\n\t}\n\n\t//\n\t// Locations of vmp import calls\n\tstd::vector> vecVmpImportCalls{};\n\t//\n\t// Cache of imports that were added.\n\tstd::unordered_map> mAddedImports;\n\n\tfor (auto match : vecCallMatches)\n\t{\n\t\tZydisDecodedInstruction insn{};\n\t\tstd::uint8_t* insnbuf = &pTargetImg->buffer()[match];\n\n\t\tif (DecodeInsn(insnbuf, insn))\n\t\t{\n\t\t\tAddressType uDestAddress \n\t\t\t\t= CalculateAbsoluteAddress((uImageBase.uintptr() + match), insn);\n\t\t\tif (uDestAddress == 0)\n\t\t\t\tcontinue;\n\n\t\t\tif (secVMP.HasVirtualAddress(uDestAddress - uImageBase.uintptr()))\n\t\t\t{\n\t\t\t\tlogger->info(\"Found call to {} in {} @ {:X} (call to {:X})\",\n\t\t\t\t\tm_strVMPSectionName,\n\t\t\t\t\t\".text\",\n\t\t\t\t\t(AddressType)(uImageBase + match).uintptr(),\n\t\t\t\t\tuDestAddress);\n\n\t\t\t\tvecVmpImportCalls.emplace_back((uint64_t)match, uDestAddress);\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (auto& address : vecVmpImportCalls)\n\t{\n\t\t//\n\t\t// Reset stack.\n\t\tuc_reg_write(uc, STACK_REGISTER, &STACK_SPACE);\n\n\t\t//\n\t\t// Write the return address as if we just entered a CALL.\n\t\tuintptr_t stackptr{};\n\t\tuintptr_t rtnaddress{ uImageBase.uintptr() + address.first.uintptr() + 5 };\n\n\t\tuc_reg_read(uc, STACK_REGISTER, &stackptr);\n\t\tuc_mem_write(uc, stackptr, &rtnaddress, sizeof(rtnaddress));\n\n\t\t// logger->info(\"Starting emulation @ {:X}\", address.second.uintptr());\n\n\t\t//\n\t\t// Begin emulation.\n\t\tuc_err uerr = uc_emu_start(uc, address.second.uintptr(), 0, 0, 0);\n\t\tif (uerr != UC_ERR_OK)\n\t\t{\n\t\t\tlogger->error(\"Emulation failed with error: {}\", uerr);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (ExpResolved.first.empty())\n\t\t{\n\t\t\tlogger->error(\"Failed to resolve import @ emu address {:X}\", address.second.uintptr());\n\t\t\tcontinue;\n\t\t}\n\n\t\tstd::uint32_t uImportRVA{};\n\t\tstd::uint64_t uImportVA{};\n\n\t\tif (mAddedImports.find(ExpResolved.first) != mAddedImports.end() && mAddedImports[ExpResolved.first][ExpResolved.second.name])\n\t\t{\n\t\t\tuImportRVA = mAddedImports[ExpResolved.first][ExpResolved.second.name];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (!pTargetImg->GetImportDirectory().HasModuleImport(ExpResolved.first, ExpResolved.second.name, &uImportRVA))\n\t\t\t\tpTargetImg->GetImportDirectory().AddModuleImport(ExpResolved.first, ExpResolved.second.name, &uImportRVA);\n\t\t\tmAddedImports[ExpResolved.first][ExpResolved.second.name] = uImportRVA;\n\t\t}\n\n\t\tuImportVA = uImageBase.uintptr() + uImportRVA;\n\n\t\tif (pTargetImg->buffer().deref(address.first.uintptr() + 5) == 0xcc ||\n\t\t\tpTargetImg->buffer().deref(address.first.uintptr() + 5) == 0xc3)\n\t\t{\n\t\t\tstd::uint8_t patch_buf[6];\n\t\t\tpatch_buf[0] = 0xff;\n\t\t\tpatch_buf[1] = 0x15;\n\t\t\tif constexpr (BitSize == 64)\n\t\t\t\t*(std::uint32_t*)(&patch_buf[2]) = (std::uint32_t)(uImportVA - (uImageBase.uintptr() + address.first.uintptr()) - 6);\n\t\t\telse\n\t\t\t{\n\t\t\t\t*(std::uint32_t*)(&patch_buf[2]) = (std::uint32_t)(uImportVA);\n\t\t\t}\n\t\t\t//\n\t\t\t// Patch in\n\t\t\tpTargetImg->buffer().copy_data(\n\t\t\t\taddress.first.uintptr(),\n\t\t\t\tpatch_buf,\n\t\t\t\tsizeof(patch_buf)\n\t\t\t);\n\n\t\t\tlogger->info(\"Patched import call @ 0x{:X} to {}!{}\",\n\t\t\t\taddress.first.uintptr(),\n\t\t\t\tExpResolved.first,\n\t\t\t\tExpResolved.second.name);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t//\n\t\t\t// push/call sequence\n\t\t\tstd::uint8_t patch_buf[6];\n\t\t\tpatch_buf[0] = 0xff;\n\t\t\tpatch_buf[1] = 0x15;\n\t\t\tif constexpr (BitSize == 64)\n\t\t\t\t*(std::uint32_t*)(&patch_buf[2]) = (std::uint32_t)(uImportVA - (uImageBase.uintptr() + (address.first.uintptr() - 1)) - 6);\n\t\t\telse\n\t\t\t\t*(std::uint32_t*)(&patch_buf[2]) = (std::uint32_t)(uImportVA);\n\n\t\t\t//\n\t\t\t// Patch in\n\t\t\tpTargetImg->buffer().copy_data(\n\t\t\t\taddress.first.uintptr() - 1,\n\t\t\t\tpatch_buf,\n\t\t\t\tsizeof(patch_buf)\n\t\t\t);\n\n\t\t\tlogger->info(\"Patched import call @ 0x{:X} to {}!{}\",\n\t\t\t\taddress.first.uintptr(),\n\t\t\t\tExpResolved.first,\n\t\t\t\tExpResolved.second.name);\n\t\t}\n\t}\n\n\tstd::string outpath = \"dumps/\";\n\tif (sModName.empty()) \n\t{\n\t\toutpath += std::filesystem::path(m_vecModuleList[0].module_path).filename().string() + \".fixed\";\n\t}\n\telse\n\t{\n\t\toutpath += std::string(sModName) + \".fixed\";\n\t}\n\n\tlogger->info(\"Finished, writing to {}\", outpath);\n\n\tpTargetImg->WriteToFile(outpath);\n}\n\ntemplate\nbool VMPImportFixer::DecodeInsn(pepp::Address<> address, ZydisDecodedInstruction& insn) const noexcept\n{\n\treturn ZYAN_SUCCESS(ZydisDecoderDecodeBuffer(&m_decoder, address.as_ptr(), 0xff, &insn));\n}\n\ntemplate\nstd::uintptr_t VMPImportFixer::CalculateAbsoluteAddress(std::uintptr_t runtime_address, ZydisDecodedInstruction& insn) const noexcept\n{\n\tstd::uintptr_t result{};\n\n\tif (ZYAN_SUCCESS(ZydisCalcAbsoluteAddress(&insn, &insn.operands[0], runtime_address, &result)))\n\t\treturn result;\n\n\treturn 0ull;\n}\n\ntemplate\nbool VMPImportFixer::GetModuleFromAddress(std::uintptr_t ptr, VIFModuleInformation_t* pmod)\n{\n\tif (m_vecModuleList.empty())\n\t\treturn false;\n\n\tfor (auto& mod : m_vecModuleList)\n\t{\n\t\tif (ptr >= mod.base_address && ptr <= mod.base_address + mod.module_size)\n\t\t{\n\t\t\t*pmod = mod;\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\ntemplate\nbool VMPImportFixer::GetExportData(std::uintptr_t mod, std::uintptr_t rva, pepp::ExportData_t* exp)\n{\n\tpepp::Image* pImage = m_ImageMap[mod];\n\tbool bFound = false;\n\n\tif (pImage)\n\t{\n\t\tpImage->GetExportDirectory().TraverseExports([&bFound, &exp, rva](pepp::ExportData_t* tmp)\n\t\t\t{\n\t\t\t\tif (tmp->rva == rva)\n\t\t\t\t{\n\t\t\t\t\t*exp = *tmp;\n\t\t\t\t\tbFound = true;\n\t\t\t\t}\n\t\t\t});\n\t}\n\n\treturn bFound;\n}\n" }, { "path": "VMPImportFixer.hpp", "content": "#pragma once\n\n//\n// Emulation engine.\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#pragma comment(lib, \"psapi.lib\")\n\n//! PE parsing and manipulation and some other utils.\n#include \"msc/Process.hpp\"\n#include \"msc/ScopedHandle.hpp\"\n#include \n\n//! Include Zydis disassembler\n#include \n#include \n#include \n\n//! Include spdlog\n#include \n#include \n#include \n#include \n#include \n\n#include \"VIFTools.hpp\"\n\nclass IVMPImportFixer\n{\npublic:\n\tvirtual ~IVMPImportFixer() = default;\n\tvirtual bool GetModuleFromAddress(std::uintptr_t ptr, VIFModuleInformation_t* mod) = 0;\n\tvirtual void DumpInMemory(HANDLE hProcess, std::string_view sModName) = 0;\n\tvirtual bool GetExportData(std::uintptr_t mod, std::uintptr_t rva, pepp::ExportData_t* exp) = 0;\n};\n\ntemplate\nclass VMPImportFixer : public pepp::msc::NonCopyable, public IVMPImportFixer\n{\npublic:\n\tVMPImportFixer(std::string_view vmpsn) noexcept;\n\t\n\tvoid DumpInMemory(HANDLE hProcess, std::string_view sModName) final override;\n\n\t//! Zydis disassemble an instruction.\n\tbool DecodeInsn(pepp::Address<> address, ZydisDecodedInstruction& insn) const noexcept;\n\tstd::uintptr_t CalculateAbsoluteAddress(std::uintptr_t runtime_address, ZydisDecodedInstruction& insn) const noexcept;\n\n\tbool GetModuleFromAddress(std::uintptr_t ptr, VIFModuleInformation_t* mod) final override;\n\tbool GetExportData(std::uintptr_t mod, std::uintptr_t rva, pepp::ExportData_t* exp) final override;\nprivate:\n\tZydisDecoder\t\t\t\t\t\tm_decoder;\n\tstd::string\t\t\t\t\t\t\tm_strVMPSectionName;\n\tstd::vector\tm_vecModuleList;\n\tstd::vector>\tm_vecImageList;\n\tstd::map, pepp::Image*> m_ImageMap;\n};\n\n\n\nextern std::shared_ptr logger;\n\ntemplate\ninline VMPImportFixer::VMPImportFixer(std::string_view vmpsn) noexcept\n\t: m_strVMPSectionName(vmpsn)\n{\n}\n\n\n" }, { "path": "VMPImportFixer.sln", "content": "\nMicrosoft Visual Studio Solution File, Format Version 12.00\n# Visual Studio Version 16\nVisualStudioVersion = 16.0.31321.278\nMinimumVisualStudioVersion = 10.0.40219.1\nProject(\"{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}\") = \"VMPImportFixer\", \"VMPImportFixer.vcxproj\", \"{701E6AB3-4569-476C-8F49-C9BEACA20247}\"\nEndProject\nGlobal\n\tGlobalSection(SolutionConfigurationPlatforms) = preSolution\n\t\tDebug|x64 = Debug|x64\n\t\tDebug|x86 = Debug|x86\n\t\tRelease|x64 = Release|x64\n\t\tRelease|x86 = Release|x86\n\tEndGlobalSection\n\tGlobalSection(ProjectConfigurationPlatforms) = postSolution\n\t\t{701E6AB3-4569-476C-8F49-C9BEACA20247}.Debug|x64.ActiveCfg = Debug|x64\n\t\t{701E6AB3-4569-476C-8F49-C9BEACA20247}.Debug|x64.Build.0 = Debug|x64\n\t\t{701E6AB3-4569-476C-8F49-C9BEACA20247}.Debug|x86.ActiveCfg = Debug|Win32\n\t\t{701E6AB3-4569-476C-8F49-C9BEACA20247}.Debug|x86.Build.0 = Debug|Win32\n\t\t{701E6AB3-4569-476C-8F49-C9BEACA20247}.Release|x64.ActiveCfg = Release|x64\n\t\t{701E6AB3-4569-476C-8F49-C9BEACA20247}.Release|x64.Build.0 = Release|x64\n\t\t{701E6AB3-4569-476C-8F49-C9BEACA20247}.Release|x86.ActiveCfg = Release|Win32\n\t\t{701E6AB3-4569-476C-8F49-C9BEACA20247}.Release|x86.Build.0 = Release|Win32\n\tEndGlobalSection\n\tGlobalSection(SolutionProperties) = preSolution\n\t\tHideSolutionNode = FALSE\n\tEndGlobalSection\n\tGlobalSection(ExtensibilityGlobals) = postSolution\n\t\tSolutionGuid = {21943CCC-6FAC-415F-9887-DF76EF36C965}\n\tEndGlobalSection\nEndGlobal\n" }, { "path": "VMPImportFixer.vcxproj", "content": "\n\n \n \n Debug\n Win32\n \n \n Release\n Win32\n \n \n Debug\n x64\n \n \n Release\n x64\n \n \n \n 16.0\n Win32Proj\n {701e6ab3-4569-476c-8f49-c9beaca20247}\n VMPImportFixer\n 10.0\n \n \n \n Application\n true\n v142\n Unicode\n \n \n Application\n false\n v142\n true\n MultiByte\n \n \n Application\n true\n v142\n Unicode\n \n \n Application\n false\n v142\n true\n MultiByte\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n true\n \n \n false\n $(ProjectDir)vendor;$(ProjectDir)vendor\\zydis\\include;$(ProjectDir)vendor\\zycore\\include;$(ProjectDir)vendor\\spdlog\\include;$(ProjectDir)vendor\\unicorn\\include\n $(ProjectDir)\\vendor\\zydis\\lib\\ReleaseX64;$(ProjectDir)vendor\\unicorn\\lib\\x64;$(LibraryPath)\n \n \n true\n \n \n false\n $(ProjectDir)vendor;$(ProjectDir)vendor\\zydis\\include;$(ProjectDir)vendor\\zycore\\include;$(ProjectDir)vendor\\spdlog\\include;$(ProjectDir)vendor\\unicorn\\include\n $(ProjectDir)\\vendor\\zydis\\lib\\ReleaseX64;$(ProjectDir)vendor\\unicorn\\lib\\x64;$(LibraryPath)\n \n \n \n Level3\n true\n WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)\n true\n \n \n Console\n true\n \n \n \n \n Level3\n true\n true\n true\n WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions);ZYCORE_STATIC_DEFINE;ZYDIS_STATIC_DEFINE;_CRT_SECURE_NO_WARNINGS\n true\n stdcpplatest\n stdc17\n \n \n Console\n true\n true\n true\n Zycore.lib;Zydis.lib;unicorn_static.lib;%(AdditionalDependencies)\n \n \n \n \n Level3\n true\n _DEBUG;_CONSOLE;%(PreprocessorDefinitions)\n true\n \n \n Console\n true\n \n \n \n \n Level3\n true\n true\n true\n NDEBUG;_CONSOLE;%(PreprocessorDefinitions);ZYCORE_STATIC_DEFINE;ZYDIS_STATIC_DEFINE;_CRT_SECURE_NO_WARNINGS\n true\n stdcpplatest\n stdc17\n \n \n Console\n true\n true\n true\n Zycore.lib;Zydis.lib;unicorn_static.lib;%(AdditionalDependencies)\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" }, { "path": "VMPImportFixer.vcxproj.filters", "content": "\n\n \n \n {4FC737F1-C7A5-4376-A066-2A32D752A2FF}\n cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx\n \n \n {93995380-89BD-4b04-88EB-625FBE52EBFB}\n h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd\n \n \n {67DA6AB6-F800-4c08-8B7A-83BB121AAD01}\n rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms\n \n \n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n Source Files\n \n \n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n" }, { "path": "msc/Process.cpp", "content": "#include \n#include \"Process.hpp\"\n\nusing namespace vif::nt;\n\nProcess::Process(std::uint32_t processId) noexcept\n\t: m_processId(processId)\n{\n}\n\nProcess::Process(HANDLE processHandle) noexcept\n\t: m_handle(processHandle), m_processId(GetProcessId(processHandle))\n{\n}\n\nbool Process::CreateHandle(std::uint32_t flags) noexcept\n{\n\tm_handle = OpenProcess(flags, FALSE, m_processId);\n\treturn m_handle != INVALID_HANDLE_VALUE;\n}\n\nbool Process::CreateHandle(std::uint32_t processId, std::uint32_t flags) noexcept\n{\n\tm_processId = processId;\n\tm_handle = OpenProcess(flags, FALSE, m_processId);\n\treturn m_handle != INVALID_HANDLE_VALUE;\n}\n\n// ReadProcessMemory will fail if the page has PAGE_NOACCESS or PAGE_GUARD, so try to change the protection and then read\nstatic bool ReadPage(HANDLE handle, LPVOID address, LPVOID buffer, std::size_t size, SIZE_T* bytesRead)\n{\n\tif (!ReadProcessMemory(handle, address, buffer, size, bytesRead))\n\t{\n\t\tDWORD oldProtect = 0;\n\t\tif (!VirtualProtectEx(handle, address, size, PAGE_READONLY, &oldProtect))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tauto result = !!ReadProcessMemory(handle, address, buffer, size, bytesRead);\n\t\tVirtualProtectEx(handle, address, size, oldProtect, &oldProtect);\n\t\treturn result;\n\t}\n\treturn true;\n}\n\nbool Process::ReadMemory(pepp::Address<> address, void* buffer, std::size_t size) noexcept\n{\n\tif (m_handle == INVALID_HANDLE_VALUE || !buffer || !size)\n\t\treturn false;\n\n\t// Read page-by-page to maximize the likelyhook of reading successfully\n\tstd::size_t bytesRead = 0;\n\tconstexpr std::uintptr_t PAGE_SIZE = 0x1000;\n\tstd::uintptr_t offset = 0;\n\tstd::uintptr_t requestedSize = size;\n\tstd::uintptr_t sizeLeftInFirstPage = PAGE_SIZE - (address.uintptr() & (PAGE_SIZE - 1));\n\tstd::uintptr_t readSize = min(sizeLeftInFirstPage, requestedSize);\n\n\twhile (readSize)\n\t{\n\t\tSIZE_T bytesReadSafe = 0;\n\t\tauto readSuccess = ReadPage(m_handle, (PVOID)(address.uintptr() + offset), (PBYTE)buffer + offset, readSize, &bytesReadSafe);\n\t\tbytesRead += bytesReadSafe;\n\t\tif (!readSuccess)\n\t\t\tbreak;\n\n\t\toffset += readSize;\n\t\trequestedSize -= readSize;\n\t\treadSize = min(PAGE_SIZE, requestedSize);\n\t}\n\n\tauto success = bytesRead == size;\n\tSetLastError(success ? ERROR_SUCCESS : ERROR_PARTIAL_COPY);\n\treturn success;\n}\n\nbool Process::WriteMemory(pepp::Address<> address, void* buffer, std::size_t size) noexcept\n{\n\tif (m_handle == INVALID_HANDLE_VALUE)\n\t\treturn false;\n\n\treturn static_cast(WriteProcessMemory(m_handle, address.as_ptr(), buffer, size, nullptr));\n}" }, { "path": "msc/Process.hpp", "content": "#pragma once\n\n#include \n#include \"ScopedHandle.hpp\"\n#include \n\nnamespace vif::nt\n{\n\tclass Process : pepp::msc::NonCopyable\n\t{\n\tpublic:\n\t\tProcess() = default;\n\t\tProcess(std::uint32_t processId) noexcept;\n\t\tProcess(HANDLE processHandle) noexcept;\n\n\n\t\t//! Create a handle to the process\n\t\t//! - returns true or false depending OpenProcess status\n\t\tbool CreateHandle(std::uint32_t flags) noexcept; \n\t\tbool CreateHandle(std::uint32_t processId, std::uint32_t flags) noexcept;\n\n\n\t\t//! Read memory\n\t\tbool ReadMemory(pepp::Address<> address, void* buffer, std::size_t size) noexcept;\n\n\t\t//! Write memory\n\t\tbool WriteMemory(pepp::Address<> address, void* buffer, std::size_t size) noexcept;\n\n\t\t//! Get handle pointer\n\t\tHANDLE handle() noexcept { return m_handle.handle(); }\n\n\tprivate:\n\t\tstd::uint16_t\t\t\tm_processId = 0;\n\t\tvif::nt::ScopedHandle\tm_handle;\n\t};\n}" }, { "path": "msc/ScopedHandle.hpp", "content": "#pragma once\n\n#include \n\nnamespace vif::nt\n{\n\tclass ScopedHandle : pepp::msc::NonCopyable\n\t{\n\t\tHANDLE m_handle = INVALID_HANDLE_VALUE;\n\n\tpublic:\n\t\tScopedHandle() = default;\n\n\n\t\tScopedHandle(HANDLE handle)\n\t\t\t: m_handle(handle ? handle : INVALID_HANDLE_VALUE)\n\t\t{\n\t\t}\n\n\t\t~ScopedHandle()\n\t\t{\n\t\t\tif (m_handle != INVALID_HANDLE_VALUE)\n\t\t\t\tCloseHandle(m_handle);\n\t\t}\n\n\t\toperator HANDLE () noexcept\n\t\t{\n\t\t\treturn m_handle;\n\t\t}\n\n\t\tHANDLE handle() noexcept\n\t\t{\n\t\t\treturn m_handle;\n\t\t}\n\n\t\tLPHANDLE lphandle() noexcept\n\t\t{\n\t\t\treturn &m_handle;\n\t\t}\n\n\t\tvoid operator=(HANDLE rhs) noexcept\n\t\t{\n\t\t\tif (m_handle != INVALID_HANDLE_VALUE)\n\t\t\t\tCloseHandle(m_handle);\n\n\t\t\tm_handle = rhs ? rhs : INVALID_HANDLE_VALUE;\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/ExportDirectory.cpp", "content": "#include \"PELibrary.hpp\"\n\nusing namespace pepp;\n\ntemplate class ExportDirectory<32>;\ntemplate class ExportDirectory<64>;\n\ntemplate\nExportData_t ExportDirectory::GetExport(std::uint32_t idx, bool demangle /*= true*/) const\n{\n\tif (!IsPresent())\n\t\treturn {};\n\n\tif (idx < GetNumberOfNames()) {\n\t\tstd::uint8_t* base{};\n\t\tstd::uint32_t funcAddresses{};\n\t\tstd::uint32_t funcNames{};\n\t\tstd::uint32_t funcOrdinals{};\n\t\tstd::uint32_t funcNamesOffset{};\n\t\tmem::ByteVector const* buffer{};\n\n\t\tfuncOrdinals = m_image->GetPEHeader().RvaToOffset(GetAddressOfNameOrdinals());\n\t\tuint16_t rlIdx = m_image->buffer().deref(funcOrdinals + (idx * sizeof uint16_t));\n\n\t\tfuncAddresses = m_image->GetPEHeader().RvaToOffset(GetAddressOfFunctions() + sizeof(std::uint32_t) * rlIdx);\n\t\tfuncNames = m_image->GetPEHeader().RvaToOffset(GetAddressOfNames() + sizeof(std::uint32_t) * idx);\n\t\tfuncNamesOffset = m_image->GetPEHeader().RvaToOffset(m_image->buffer().deref(funcNames));\n\n\n\t\tif (funcAddresses && funcNames && funcOrdinals)\n\t\t{\n\t\t\treturn \n\t\t\t{\n\t\t\t\t demangle ? DemangleName(m_image->buffer().as(funcNamesOffset)) : m_image->buffer().as(funcNamesOffset),\n\t\t\t\t m_image->buffer().deref(funcAddresses),\n\t\t\t\t rlIdx\n\t\t\t};\n\t\t}\n\t}\n\n\treturn {};\n}\n\ntemplate\nvoid ExportDirectory::TraverseExports(const std::function& cb_func)\n{\n\tfor (int i = 0; i < GetNumberOfNames(); i++)\n\t{\n\t\tExportData_t data = GetExport(i);\n\t\tif (data.rva != 0)\n\t\t\tcb_func(&data);\n\t}\n}\n\ntemplate\nbool ExportDirectory::IsPresent() const noexcept\n{\n\treturn m_image->GetPEHeader().GetOptionalHeader().GetDataDirectory(DIRECTORY_ENTRY_EXPORT).Size > 0;\n}\n\ntemplate\nvoid ExportDirectory::AddExport(std::string_view name, std::uint32_t rva)\n{\n\t// TODO\n}\n" }, { "path": "vendor/pepp/ExportDirectory.hpp", "content": "#pragma once\n\n#include \n\nnamespace pepp\n{\n\tstruct ExportData_t\n\t{\n\t\tstd::string name{};\n\t\tstd::uint32_t rva = 0;\n\t\tstd::uint32_t ordinal = 0xffffffff;\n\t};\n\n\ttemplate\n\tclass ExportDirectory : public pepp::msc::NonCopyable\n\t{\n\t\tfriend class Image<32>;\n\t\tfriend class Image<64>;\n\n\t\tImage*\t\t\t\t\t\t\tm_image;\n\t\tdetail::Image_t<>::ExportDirectory_t\t*m_base;\n\tpublic:\n\t\tExportData_t GetExport(std::uint32_t idx, bool demangle = true) const;\n\t\tvoid AddExport(std::string_view name, std::uint32_t rva);\n\t\tvoid TraverseExports(const std::function& cb_func);\n\t\tbool IsPresent() const noexcept;\n\n\t\tvoid SetNumberOfFunctions(std::uint32_t num) {\n\t\t\tm_base->NumberOfFunctions = num;\n\t\t}\n\n\t\tstd::uint32_t GetNumberOfFunctions() const {\n\t\t\treturn m_base->NumberOfFunctions;\n\t\t}\n\n\t\tvoid SetNumberOfNames(std::uint32_t num) {\n\t\t\tm_base->NumberOfNames = num;\n\t\t}\n\n\t\tstd::uint32_t GetNumberOfNames() const {\n\t\t\treturn m_base->NumberOfNames;\n\t\t}\n\n\t\tvoid SetCharacteristics(std::uint32_t chrs) {\n\t\t\tm_base->Characteristics = chrs;\n\t\t}\n\n\t\tstd::uint32_t GetCharacteristics() const {\n\t\t\treturn m_base->Characteristics;\n\t\t}\n\n\t\tvoid SetTimeDateStamp(std::uint32_t TimeDateStamp) {\n\t\t\tm_base->TimeDateStamp = TimeDateStamp;\n\t\t}\n\n\t\tstd::uint32_t GetTimeDateStamp() const {\n\t\t\treturn m_base->TimeDateStamp;\n\t\t}\n\n\t\tvoid SetAddressOfFunctions(std::uint32_t AddressOfFunctions) {\n\t\t\tm_base->AddressOfFunctions = AddressOfFunctions;\n\t\t}\n\n\t\tstd::uint32_t GetAddressOfFunctions() const {\n\t\t\treturn m_base->AddressOfFunctions;\n\t\t}\n\n\t\tvoid SetAddressOfNames(std::uint32_t AddressOfNames) {\n\t\t\tm_base->AddressOfNames = AddressOfNames;\n\t\t}\n\n\t\tstd::uint32_t GetAddressOfNames() const {\n\t\t\treturn m_base->AddressOfNames;\n\t\t}\n\n\t\tvoid SetAddressOfNameOrdinals(std::uint32_t AddressOfNamesOrdinals) {\n\t\t\tm_base->AddressOfNameOrdinals = AddressOfNamesOrdinals;\n\t\t}\n\n\t\tstd::uint32_t GetAddressOfNameOrdinals() const {\n\t\t\treturn m_base->AddressOfNameOrdinals;\n\t\t}\n\n\n\t\tconstexpr std::size_t size() const {\n\t\t\treturn sizeof(decltype(*m_base));\n\t\t}\n\n\tprivate:\n\t\t//! Setup the directory\n\t\tvoid _setup(Image* image) {\n\t\t\tm_image = image;\n\t\t\tm_base = reinterpret_cast(\n\t\t\t\t&image->base()[image->GetPEHeader().RvaToOffset(\n\t\t\t\t\timage->GetPEHeader().GetOptionalHeader().GetDataDirectory(DIRECTORY_ENTRY_EXPORT).VirtualAddress)]);\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/FileHeader.hpp", "content": "#pragma once\n\nnamespace pepp\n{\n\tenum class PEMachine\n\t{\n\t\tMACHINE_I386 = 0x14c,\n\t\tMACHINE_IA64 = 0x200,\n\t\tMACHINE_AMD64 = 0x8664\n\t};\n\n\tclass FileHeader : pepp::msc::NonCopyable\n\t{\n\t\tfriend class PEHeader<32>;\n\t\tfriend class PEHeader<64>;\n\n\t\tIMAGE_FILE_HEADER*\tm_base;\n\tpublic:\n\t\tFileHeader() \n\t\t{\n\t\t}\n\n\t\tvoid SetMachine(PEMachine machine) {\n\t\t\tm_base->Machine = static_cast(machine);\n\t\t}\n\n\t\tPEMachine GetMachine() const {\n\t\t\treturn static_cast(m_base->Machine);\n\t\t}\n\n\t\tvoid SetNumberOfSections(std::uint16_t numSections) {\n\t\t\tm_base->NumberOfSections = numSections;\n\t\t}\n\n\t\tstd::uint16_t GetNumberOfSections() const {\n\t\t\treturn m_base->NumberOfSections;\n\t\t}\n\n\t\tvoid SetTimeDateStamp(std::uint32_t dwTimeDateStamp) {\n\t\t\tm_base->TimeDateStamp = dwTimeDateStamp;\n\t\t}\n\n\t\tstd::uint32_t GetTimeDateStamp() const {\n\t\t\treturn m_base->TimeDateStamp;\n\t\t}\n\n\t\tvoid SetPointerToSymbolTable(std::uint32_t dwPointerToSymbolTable) {\n\t\t\tm_base->PointerToSymbolTable = dwPointerToSymbolTable;\n\t\t}\n\n\t\tstd::uint32_t GetPointerToSymbolTable() const {\n\t\t\treturn m_base->PointerToSymbolTable;\n\t\t}\n\n\t\tvoid SetNumberOfSymbols(std::uint32_t numSymbols) {\n\t\t\tm_base->NumberOfSymbols = numSymbols;\n\t\t}\n\n\t\tstd::uint32_t GetNumberOfSymbols() const {\n\t\t\treturn m_base->NumberOfSymbols;\n\t\t}\n\n\t\tvoid SetSizeOfOptionalHeader(std::uint16_t size) {\n\t\t\tm_base->SizeOfOptionalHeader = size;\n\t\t}\n\n\t\tstd::uint16_t GetSizeOfOptionalHeader() const {\n\t\t\treturn m_base->SizeOfOptionalHeader;\n\t\t}\n\n\t\tvoid SetCharacteristics(std::uint16_t chars) {\n\t\t\tm_base->Characteristics = chars;\n\t\t}\n\n\t\tstd::uint16_t GetCharacteristics() const {\n\t\t\treturn m_base->Characteristics;\n\t\t}\n\n\t\tIMAGE_FILE_HEADER* native() const {\n\t\t\treturn m_base;\n\t\t}\n\tprivate:\n\t\ttemplate\n\t\tvoid _setup(Image* image) {\n\t\t\tm_base = &image->GetPEHeader().native()->FileHeader;\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/Image.cpp", "content": "#include \"PELibrary.hpp\"\n#include \"PEUtil.hpp\"\n#include \n\nusing namespace pepp;\n\n// Explicit templates.\ntemplate class Image<32>;\ntemplate class Image<64>;\n\ntemplate\nImage::Image()\n{\n}\n\ntemplate\nImage::Image(const Image& rhs)\n\t: m_fileName(rhs.m_fileName)\n\t//, m_imageBuffer(std::move(rhs.m_imageBuffer)) -- bad\n\t, m_imageBuffer(rhs.m_imageBuffer)\n{\n\t// Ensure that the file was read.\n\tassert(m_imageBuffer.size() > 0);\n\n\t// Validate there is a valid MZ signature.\n\t_validate();\n}\n\ntemplate\nconstexpr PEMachine Image::GetMachine() const\n{\n\tif constexpr (bitsize == 32)\n\t\treturn PEMachine::MACHINE_I386;\n\n\treturn PEMachine::MACHINE_AMD64;\n}\n\n\ntemplate\nImage::Image(std::string_view filepath)\n\t: m_fileName(filepath)\n{\n\tio::File file(m_fileName, io::FILE_INPUT | io::FILE_BINARY);\n\n\tstd::vector data{ file.Read() };\n\n\tm_imageBuffer.resize(data.size());\n\tm_imageBuffer.copy_data(0, data.data(), data.size());\n\n\t// Ensure that the file was read.\n\tassert(m_imageBuffer.size() > 0);\n\n\t// Validate there is a valid MZ signature.\n\t_validate();\n}\n\ntemplate\nImage::Image(const void* data, std::size_t size)\n{\n\tm_imageBuffer.resize(size);\n\tstd::memcpy(&m_imageBuffer[0], data, size);\n\n\t// Validate there is a valid MZ signature.\n\t_validate();\n}\n\ntemplate\n[[nodiscard]] Image Image::FromRuntimeMemory(void* data, std::size_t size) noexcept\n{\n\tImage _r;\n\n\t_r.m_MZHeader = reinterpret_cast::MZHeader_t*>(data);\n\n\t// Valid MZ tag?\n\tassert(_r.magic() == IMAGE_DOS_SIGNATURE);\n\n\t// Setup the PE header data.\n\t_r.m_PEHeader._setup(&_r);\n\n\tassert(_r.m_PEHeader.IsTaggedPE());\n\n\t_r.m_imageBuffer.resize(size);\n\tstd::memcpy(&_r.m_imageBuffer[0], data, _r.m_imageBuffer.size());\n\n\t//\n\t// Okay just _validate now.\n\t_r._validate();\n\n\t//\n\t// It's runtime, so map it.\n\t_r.SetMapped(); \n\t_r._validate();\n\n\n\treturn _r;\n}\n\ntemplate\nbool Image::SetFromRuntimeMemory(void* data, std::size_t size) noexcept\n{\n\tm_MZHeader = reinterpret_cast::MZHeader_t*>(data);\n\n\t// Valid MZ tag?\n\tassert(magic() == IMAGE_DOS_SIGNATURE);\n\n\t// Setup the PE header data.\n\tm_PEHeader._setup(this);\n\n\tassert(m_PEHeader.IsTaggedPE());\n\n\tm_imageBuffer.resize(size);\n\tstd::memcpy(&m_imageBuffer[0], data, m_imageBuffer.size());\n\n\t//\n\t// Okay just _validate now.\n\t_validate();\n\n\t//\n\t// It's runtime, so map it.\n\tSetMapped();\n\t_validate();\n\n\n\treturn true;\n}\n\ntemplate\nbool Image::HasDataDirectory(PEDirectoryEntry entry)\n{\n\treturn GetPEHeader().GetOptionalHeader().GetDataDirectory(entry).Size > 0;\n}\n\ntemplate\nvoid Image::WriteToFile(std::string_view filepath)\n{\n\tio::File file(filepath, io::FILE_OUTPUT | io::FILE_BINARY);\n\tfile.Write(m_imageBuffer);\n}\n\ntemplate\nvoid Image::_validate()\n{\n\tm_MZHeader = reinterpret_cast::MZHeader_t*>(base());\n\n\t// Valid MZ tag?\n\tassert(magic() == IMAGE_DOS_SIGNATURE);\n\n\t// Setup the PE header data.\n\tm_PEHeader._setup(this);\n\n\tassert(m_PEHeader.IsTaggedPE());\n\n\t// Setup sections\n\tm_rawSectionHeaders = (m_PEHeader.m_PEHdr ? reinterpret_cast(IMAGE_FIRST_SECTION(m_PEHeader.m_PEHdr)) : nullptr);\n\n\tassert(m_rawSectionHeaders != nullptr);\n\n\t//\n\t// Ensure the Image class was constructed with the correct bitsize.\n\tif constexpr (bitsize == 32)\n\t{\n\t\tassert(m_PEHeader.GetOptionalHeader().GetMagic() == PEMagic::HDR_32);\n\t}\n\telse if constexpr (bitsize == 64)\n\t{\n\t\tassert(m_PEHeader.GetOptionalHeader().GetMagic() == PEMagic::HDR_64);\n\t}\n\n\t//\n\t// Setup export directory\n\tm_exportDirectory._setup(this);\n\t//\n\t// Setup import directory\n\tm_importDirectory._setup(this);\n\t//\n\t// Setup reloc directory\n\tm_relocDirectory._setup(this);\n}\n\ntemplate\nbool Image::AppendExport(std::string_view exportName, std::uint32_t rva)\n{\n\tGetExportDirectory().AddExport(exportName, rva);\n\treturn false;\n}\n\ntemplate\nbool Image::ExtendSection(std::string_view sectionName, std::uint32_t delta)\n{\n\tstd::uint32_t fileAlignment = GetPEHeader().GetOptionalHeader().GetFileAlignment();\n\tstd::uint32_t sectAlignment = GetPEHeader().GetOptionalHeader().GetSectionAlignment();\n\tif (fileAlignment == 0 || sectAlignment == 0 || delta == 0)\n\t\treturn false;\n\n\tSectionHeader& header = GetSectionHeader(sectionName);\n\n\tif (header.GetName() != \".dummy\")\n\t{\n\t\tstd::unique_ptr zero_buf(new uint8_t[delta]{});\n\n\n\t\theader.SetSizeOfRawData(header.GetSizeOfRawData() + delta);\n\t\theader.SetVirtualSize(header.GetVirtualSize() + delta);\n\n\t\tfor (int i = 0; i < MAX_DIRECTORY_COUNT; i++)\n\t\t{\n\t\t\tauto& dir = GetPEHeader().GetOptionalHeader().GetDataDirectory(i);\n\n\t\t\tif (dir.VirtualAddress == header.GetVirtualAddress())\n\t\t\t{\n\t\t\t\tdir.Size = header.GetVirtualSize();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t//\n\t\t// Update image size\n\t\tGetPEHeader().GetOptionalHeader().SetSizeOfImage(GetPEHeader().GetOptionalHeader().GetSizeOfImage() + delta);\n\n\t\t//\n\t\t// Fill in data\n\t\tbuffer().insert_data(header.GetPointerToRawData() + header.GetSizeOfRawData(), zero_buf.get(), delta);\n\n\t\t//\n\t\t// Re-validate the image/headers.\n\t\t_validate();\n\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\ntemplate\nstd::uint32_t Image::FindPadding(SectionHeader* s, std::uint8_t v, std::size_t n, std::uint32_t alignment)\n{\n\tbool bTraverseUp = s == nullptr;\n\tstd::uint32_t startOffset{};\n\n\tn = pepp::Align(n, alignment);\n\n\tif (s == nullptr)\n\t\ts = &m_rawSectionHeaders[GetNumberOfSections() - 1];\n\n\tstartOffset = s->GetPointerToRawData();\n\n\tstd::vector::iterator it = buffer().end();\n\n\tif (bTraverseUp)\n\t{\n\t\t//\n\t\tstd::vector tmpData(n, v);\n\n\t\tfor (std::uint32_t i = startOffset + s->GetSizeOfRawData(); i > n; i = Align(i - n, alignment))\n\t\t{\n\t\t\tif (memcmp(&buffer()[i - n], tmpData.data(), tmpData.size()) == 0)\n\t\t\t{\n\t\t\t\tit = buffer().begin() + (i - n);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tstd::vector tmpData(n, v);\n\n\t\tfor (std::uint32_t i = startOffset; i < startOffset + (buffer().size() - startOffset); i = Align(i + n, alignment))\n\t\t{\n\t\t\tif (memcmp(&buffer()[i], tmpData.data(), tmpData.size()) == 0)\n\t\t\t{\n\t\t\t\tit = buffer().begin() + (i);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\n\tif (it == buffer().end())\n\t\treturn -1;\n\n\treturn (std::uint32_t)std::distance(buffer().begin(), it);\n}\n\ntemplate\nstd::uint32_t Image::FindZeroPadding(SectionHeader* s, std::size_t n, std::uint32_t alignment)\n{\n\treturn FindPadding(s, 0x0, n, alignment);\n}\n\ntemplate\nstd::vector Image::FindBinarySequence(SectionHeader* s, std::string_view binary_seq) const\n{\n\tconstexpr auto ascii_to_byte = [](const char ch) [[msvc::forceinline]] {\n\t\t\t\tif (ch >= '0' && ch <= '9')\n\t\t\t\t\treturn std::uint8_t(ch - '0');\n\t\t\t\tif (ch >= 'A' && ch <= 'F')\n\t\t\t\t\treturn std::uint8_t(ch - 'A' + '\\n');\n\t\t\t\treturn std::uint8_t(ch - 'a' + '\\n');\n\t};\n\n\tstd::vector offsets{};\n\n\tif (s == nullptr)\n\t\ts = &m_rawSectionHeaders[GetNumberOfSections() - 1];\n\n\tstd::uint32_t start_offset = s->GetPointerToRawData();\n\tstd::uint32_t result = 0;\n\tstd::uint32_t match_count = 0;\n\n\tfor (std::uint32_t i = start_offset; i <= start_offset + s->GetSizeOfRawData(); ++i)\n\t{\n\t\tfor (int c = 0; c < binary_seq.size();)\n\t\t{\n\t\t\tif (binary_seq[c] == ' ')\n\t\t\t{\n\t\t\t\t++c;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (binary_seq[c] == '?')\n\t\t\t{\n\t\t\t\t++c;\n\t\t\t\t++match_count;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (buffer()[i + match_count++] != ((ascii_to_byte(binary_seq[c]) << 4) | ascii_to_byte(binary_seq[c + 1])))\n\t\t\t{\n\t\t\t\tresult = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tresult = i;\n\t\t\tc += 2;\n\t\t}\n\t\n\t\tif (result)\n\t\t{\n\t\t\toffsets.emplace_back(i);\n\t\t\ti += match_count - 1;\n\t\t}\n\n\t\t\n\t\tmatch_count = 0;\n\t\tresult = 0;\n\t}\n\n\treturn offsets;\n}\n\ntemplate\nstd::vector> Image::FindBinarySequences(SectionHeader* s, std::initializer_list> binary_seq) const\n{\n\tconstexpr auto ascii_to_byte = [](const char ch) [[msvc::forceinline]] {\n\t\t\t\tif (ch >= '0' && ch <= '9')\n\t\t\t\t\treturn std::uint8_t(ch - '0');\n\t\t\t\tif (ch >= 'A' && ch <= 'F')\n\t\t\t\t\treturn std::uint8_t(ch - 'A' + '\\n');\n\t\t\t\treturn std::uint8_t(ch - 'a' + '\\n');\n\t};\n\n\tstd::vector> offsets{};\n\n\tif (s == nullptr)\n\t\ts = &m_rawSectionHeaders[GetNumberOfSections() - 1];\n\n\tstd::uint32_t start_offset = s->GetPointerToRawData();\n\tstd::pair result{};\n\tstd::uint32_t match_count = 0;\n\n\tfor (std::uint32_t i = start_offset; i <= start_offset + s->GetSizeOfRawData(); ++i)\n\t{\n\t\tfor (auto const& seq : binary_seq)\n\t\t{\n\t\t\tfor (int c = 0; c < seq.second.size();)\n\t\t\t{\n\t\t\t\tif (seq.second[c] == ' ')\n\t\t\t\t{\n\t\t\t\t\t++c;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (seq.second[c] == '?')\n\t\t\t\t{\n\t\t\t\t\t++c;\n\t\t\t\t\t++match_count;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tstd::uint8_t _byte = ((ascii_to_byte(seq.second[c]) << 4) | ascii_to_byte(seq.second[c + 1]));\n\n\t\t\t\tif (buffer()[i + match_count++] != _byte)\n\t\t\t\t{\n\t\t\t\t\tresult = { 0,0 };\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tresult = {seq.first, i};\n\t\t\t\tc += 2;\n\t\t\t}\n\n\t\t\tif (result.second)\n\t\t\t{\n\t\t\t\toffsets.emplace_back(std::move(result));\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tmatch_count = 0;\n\t\t\tresult = { 0, 0 };\n\t\t}\n\n\t\ti += std::max(match_count - 1, 0);\n\t\tmatch_count = 0;\n\t}\n\n\treturn offsets;\n}\n\ntemplate\nbool Image::AppendSection(std::string_view section_name, std::uint32_t size, std::uint32_t chrs, SectionHeader* out)\n{\n\tstd::uint32_t fileAlignment = GetPEHeader().GetOptionalHeader().GetFileAlignment();\n\tstd::uint32_t sectAlignment = GetPEHeader().GetOptionalHeader().GetSectionAlignment();\n\tif (fileAlignment == 0 || sectAlignment == 0)\n\t\treturn false;\n\n\tstd::uint32_t alignedFileSize = Align(size, fileAlignment);\n\tstd::uint32_t alignedVirtSize = Align(size, sectAlignment);\n\n\t//\n\t// Build a section (these should be the only necessary values to fill)\n\tSectionHeader sec;\n\tsec.SetName(section_name);\n\tsec.SetSizeOfRawData(alignedFileSize);\n\tsec.SetVirtualSize(alignedVirtSize);\n\tsec.SetCharacteristics(chrs);\n\tsec.SetVirtualAddress(GetPEHeader().GetNextSectionRva());\n\tsec.SetPointerToRawData(GetPEHeader().GetNextSectionOffset());\n\n\t//\n\t// Update image size\n\tGetPEHeader().GetOptionalHeader().SetSizeOfImage(GetPEHeader().GetOptionalHeader().GetSizeOfImage() + sec.GetVirtualSize());\n\t//\n\t// Update number of sections.\n\tGetPEHeader().GetFileHeader().SetNumberOfSections(GetNumberOfSections() + 1);\n\n\t//\n\t// Fill in some temp data\n\tstd::vector section_data(sec.GetSizeOfRawData());\n\tstd::fill(section_data.begin(), section_data.end(), 0x0);\n\n\t//\n\t// Add it in the raw section header\n\tstd::memcpy(&m_rawSectionHeaders[GetNumberOfSections() - 1], &sec, sizeof(SectionHeader));\n\n\tif (out)\n\t\tstd::memcpy(out, &m_rawSectionHeaders[GetNumberOfSections() - 1], sizeof(SectionHeader));\n\n\t//\n\t// Finally, append it to the image buffer.\n\tbuffer().insert_data(sec.GetPointerToRawData(), section_data.data(), section_data.size());\n\n\t//\n\t// Re-validate the image/headers.\n\t_validate();\n\n\treturn true;\n}\n\n\ntemplate\nvoid pepp::Image::SetMapped() noexcept\n{\n\tfor (std::uint16_t i = 0; i < GetNumberOfSections(); ++i)\n\t{\n\t\tSectionHeader& sec = GetSectionHeader(i);\n\n\t\tsec.SetPointerToRawData(sec.GetVirtualAddress());\n\t\tsec.SetSizeOfRawData(sec.GetVirtualSize());\n\t}\n\n\tm_mem_mapped = true;\n}" }, { "path": "vendor/pepp/Image.hpp", "content": "#pragma once\n\nnamespace pepp\n{\n\ttemplate\n\tclass PEHeader;\n\tclass SectionHeader;\n\ttemplate\n\tclass ExportDirectory;\n\ttemplate\n\tclass ImportDirectory;\n\ttemplate\n\tclass RelocationDirectory;\n\tenum SectionCharacteristics;\n\tenum PEDirectoryEntry;\n\tenum class PEMachine;\n\n\tnamespace detail\n\t{\n\t\ttemplate\n\t\tstruct Image_t\n\t\t{\n\t\t\tusing MZHeader_t = IMAGE_DOS_HEADER;\n\t\t\tusing ImportDescriptor_t = IMAGE_IMPORT_DESCRIPTOR;\n\t\t\tusing BoundImportDescriptor_t = IMAGE_BOUND_IMPORT_DESCRIPTOR;\n\t\t\tusing ResourceDirectory_t = IMAGE_RESOURCE_DIRECTORY;\n\t\t\tusing ResourceDirectoryEntry_t = IMAGE_RESOURCE_DIRECTORY_ENTRY;\n\t\t\tusing SectionHeader_t = IMAGE_SECTION_HEADER;\n\t\t\tusing FileHeader_t = IMAGE_FILE_HEADER;\n\t\t\tusing DataDirectory_t = IMAGE_DATA_DIRECTORY;\n\t\t\tusing ExportDirectory_t = IMAGE_EXPORT_DIRECTORY;\n\t\t\tusing RelocationBase_t = IMAGE_BASE_RELOCATION;\n\t\t\tusing ImportAddressTable_t = std::uint32_t;\n\t\t};\n\n\t\ttemplate<> struct Image_t<64>\n\t\t{\n\t\t\tusing Header_t = IMAGE_NT_HEADERS64;\n\t\t\tusing TLSDirectory_t = IMAGE_TLS_DIRECTORY64;\n\t\t\tusing ThunkData_t = IMAGE_THUNK_DATA64;\n\t\t\tusing Address_t = std::uint64_t;\n\t\t\tusing OptionalHeader_t = IMAGE_OPTIONAL_HEADER64;\n\t\t};\n\n\t\ttemplate<> struct Image_t<32>\n\t\t{\n\t\t\tusing Header_t = IMAGE_NT_HEADERS32;\n\t\t\tusing TLSDirectory_t = IMAGE_TLS_DIRECTORY32;\n\t\t\tusing ThunkData_t = IMAGE_THUNK_DATA32;\n\t\t\tusing Address_t = std::uint32_t;\n\t\t\tusing OptionalHeader_t = IMAGE_OPTIONAL_HEADER32;\n\t\t};\n\t}\n\n\t/// \n\t//! class Image\n\t//! Used for runtime or static analysis/manipulating of PE files.\n\t/// \n\ttemplate\n\tclass Image : pepp::msc::NonCopyable\n\t{\n\t\tusing CPEHeader = const PEHeader;\n\t\tusing CExportDirectory = const ExportDirectory;\n\t\tusing CImportDirectory = const ImportDirectory;\n\n\tpublic:\n\n\t\t//! Publicize the detail::Image_t used by this image.\n\t\tusing ImageData_t = detail::Image_t;\n\n\t\tfriend class PEHeader;\n\n\t\tstatic_assert(bitsize == 32 || bitsize == 64, \"Invalid bitsize fed into PE::Image\");\n\tprivate:\t\n\t\tdetail::Image_t<>::MZHeader_t*\t\t\tm_MZHeader;\n\t\tstd::string\t\t\t\t\t\t\t\tm_fileName{};\n\t\tmem::ByteVector\t\t\t\t\t\t\tm_imageBuffer{};\n\t\tPEHeader\t\t\t\t\t\tm_PEHeader;\n\t\t//! Sections\n\t\tSectionHeader*\t\t\t\t\t\t\tm_rawSectionHeaders;\n\t\t//! Exports\n\t\tExportDirectory\t\t\t\tm_exportDirectory;\n\t\t//! Imports\n\t\tImportDirectory\t\t\t\tm_importDirectory;\n\t\t//! Relocations\n\t\tRelocationDirectory\t\t\tm_relocDirectory;\n\t\t//! Is image mapped? Rva2Offset becomes obsolete\n\t\tbool\t\t\t\t\t\t\t\t\tm_mem_mapped = false;\n\tpublic:\n\n\t\t//! Default ctor.\n\t\tImage();\n\n\t\t//! Used to construct a `class Image` via a existing file\n\t\tImage(std::string_view filepath);\n\t\t\n\t\t//! Used to construct a `class Image` via a memory buffer\n\t\tImage(const void* data, std::size_t size);\n\n\t\t//! Used to construct via another `class Image`\n\t\tImage(const Image& image);\n\n\t\t//! \n\t\t[[nodiscard]] static Image FromRuntimeMemory(void* data, std::size_t size) noexcept;\n\t\t//! \n\t\tbool SetFromRuntimeMemory(void* data, std::size_t size) noexcept;\n\n\t\t//! Get the start pointer of the buffer.\n\t\tstd::uint8_t* base() {\n\t\t\treturn m_imageBuffer.data();\n\t\t}\n\n\t\tmem::ByteVector& buffer() {\n\t\t\treturn m_imageBuffer;\n\t\t}\n\n\t\tconst mem::ByteVector& buffer() const {\n\t\t\treturn m_imageBuffer;\n\t\t}\n\n\t\t//! Magic number in the DOS header.\n\t\tstd::uint16_t magic() const {\n\t\t\treturn m_MZHeader->e_magic;\n\t\t}\n\n\t\t//! PEHeader wrapper\n\t\tclass PEHeader& GetPEHeader() {\n\t\t\treturn m_PEHeader;\n\t\t}\n\n\t\tclass ExportDirectory& GetExportDirectory() {\n\t\t\treturn m_exportDirectory;\n\t\t}\n\n\t\tclass ImportDirectory& GetImportDirectory() {\n\t\t\treturn m_importDirectory;\n\t\t}\n\n\t\tclass RelocationDirectory& GetRelocationDirectory() {\n\t\t\treturn m_relocDirectory;\n\t\t}\n\n\t\tconst PEHeader& GetPEHeader() const {\n\t\t\treturn m_PEHeader;\n\t\t}\n\n\t\tconst class ExportDirectory& GetExportDirectory() const {\n\t\t\treturn m_exportDirectory;\n\t\t}\n\n\t\tconst class ImportDirectory& GetImportDirectory() const {\n\t\t\treturn m_importDirectory;\n\t\t}\n\n\t\tconst class RelocationDirectory& GetRelocationDirectory() const {\n\t\t\treturn m_relocDirectory;\n\t\t}\n\n\t\t//! Native pointer\n\t\tdetail::Image_t<>::MZHeader_t* native() {\n\t\t\treturn m_MZHeader;\n\t\t}\n\n\t\t//! Write out changes to a new functional image.\n\t\t[[nodiscard]] Image Compile();\n\n\t\t//!\n\t\tvoid SetMapped() noexcept;\n\n\n\t\t//! Get PEMachine\n\t\tconstexpr PEMachine GetMachine() const;\n\n\t\t//! Is X64\n\t\tstatic constexpr unsigned int GetBitSize() { return bitsize; }\n\n\t\t//! Add a new section to the image\n\t\tbool AppendSection(std::string_view sectionName, std::uint32_t size, std::uint32_t chars, SectionHeader* out = nullptr);\n\n\t\t//! Extend an existing section (will break things depending on the section)\n\t\tbool ExtendSection(std::string_view sectionName, std::uint32_t delta);\n\n\t\t//! Append a new export\n\t\tbool AppendExport(std::string_view exportName, std::uint32_t rva);\n\n\t\t//! Find offset padding of value v with count n, starting at specified header or bottom of image if none specified\n\t\tstd::uint32_t FindPadding(SectionHeader* s, std::uint8_t v, std::size_t n, std::uint32_t alignment = 0);\n\n\t\t//! Find offset zero padding up to N bytes, starting at specified header or bottom of image if none specified\n\t\tstd::uint32_t FindZeroPadding(SectionHeader* s, std::size_t n, std::uint32_t alignment = 0);\n\n\t\t//! Find (wildcard acceptable) binary sequence\n\t\tstd::vector FindBinarySequence(SectionHeader* s, std::string_view binary_seq) const;\n\t\tstd::vector> FindBinarySequences(SectionHeader* s, std::initializer_list> binary_seq) const;\n\n\t\t//! Check if a data directory is \"present\"\n\t\t//! - Necessary before actually using the directory\n\t\t//! (e.g not all images will have a valid IMAGE_EXPORT_DIRECTORY)\n\t\tbool HasDataDirectory(PEDirectoryEntry entry);\n\n\t\t//! Write out to file\n\t\tvoid WriteToFile(std::string_view filepath);\n\n\t\t//! Wrappers\n\t\tSectionHeader& GetSectionHeader(std::uint16_t dwIndex) {\n\t\t\treturn m_PEHeader.GetSectionHeader(dwIndex);\n\t\t}\n\t\tSectionHeader& GetSectionHeader(std::string_view name) {\n\t\t\treturn m_PEHeader.GetSectionHeader(name);\n\t\t}\n\t\tSectionHeader& GetSectionHeaderFromVa(std::uint32_t va) {\n\t\t\treturn m_PEHeader.GetSectionHeaderFromVa(va);\n\t\t} \n\t\tSectionHeader& GetSectionHeaderFromOffset(std::uint32_t offset) {\n\t\t\treturn m_PEHeader.GetSectionHeaderFromOffset(offset);\n\t\t}\n\t\tstd::uint16_t GetNumberOfSections() const {\n\t\t\treturn m_PEHeader.GetFileHeader().GetNumberOfSections();\n\t\t}\n\n\t\tconstexpr auto GetWordSize() const {\n\t\t\treturn bitsize == 64 ? sizeof(std::uint64_t) : sizeof(std::uint32_t);\n\t\t}\n\n\tprivate:\n\t\t//! Setup internal objects/pointers and validate they are proper.\n\t\tvoid _validate();\n\t};\n\n\tusing Image64 = Image<64>;\n\tusing Image86 = Image<32>;\n\n\n\n}" }, { "path": "vendor/pepp/ImportDirectory.cpp", "content": "#include \"PELibrary.hpp\"\n\nusing namespace pepp;\n\n\n// Explicit templates.\ntemplate class ImportDirectory<32>;\ntemplate class ImportDirectory<64>;\n\ntemplate\nbool ImportDirectory::ImportsModule(std::string_view module, std::uint32_t* name_rva) const\n{\n\tauto descriptor = m_base;\n\tmem::ByteVector const* buffer = &m_image->buffer();\n\n\twhile (descriptor->FirstThunk != 0) {\n\t\tstd::uint32_t offset = m_image->GetPEHeader().RvaToOffset(descriptor->Name);\n\n\t\tstd::string_view modname = buffer->as(offset);\n\n\t\tif (_stricmp(modname.data(), module.data()) == 0)\n\t\t{\n\t\t\tif (name_rva)\n\t\t\t\t*name_rva = descriptor->Name;\n\n\t\t\treturn true;\n\t\t}\n\n\t\tdescriptor++;\n\t}\n\n\tif (name_rva)\n\t\t*name_rva = 0;\n\n\treturn false;\n}\n\ntemplate\nbool ImportDirectory::HasModuleImport(std::string_view module, std::string_view import, std::uint32_t* rva) const\n{\n\tauto descriptor = m_base;\n\tmem::ByteVector const* buffer = &m_image->buffer();\n\n\twhile (descriptor->Characteristics != 0) {\n\t\tstd::uint32_t offset = m_image->GetPEHeader().RvaToOffset(descriptor->Name);\n\n\t\tif (_stricmp(buffer->as(offset), module.data()) == 0)\n\t\t{\n\t\t\tstd::int32_t index = 0;\n\t\t\ttypename detail::Image_t::ThunkData_t* firstThunk =\n\t\t\t\tbuffer->as(m_image->GetPEHeader().RvaToOffset(descriptor->OriginalFirstThunk));\n\n\t\t\twhile (firstThunk->u1.AddressOfData)\n\t\t\t{\n\t\t\t\t//\n\t\t\t\t// TODO: Ordinals not handled here.\n\t\t\t\tif (IsImportOrdinal(firstThunk->u1.Ordinal))\n\t\t\t\t{\n\t\t\t\t\tindex++;\n\t\t\t\t\tfirstThunk++;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tIMAGE_IMPORT_BY_NAME* _imp =\n\t\t\t\t\tbuffer->as(m_image->GetPEHeader().RvaToOffset(firstThunk->u1.AddressOfData));\n\n\t\t\t\tif (import == _imp->Name)\n\t\t\t\t{\n\t\t\t\t\tif (rva)\n\t\t\t\t\t\t*rva = descriptor->FirstThunk + (index * m_image->GetWordSize());\n\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\n\t\t\t\tindex++;\n\t\t\t\tfirstThunk++;\n\t\t\t}\n\t\t}\n\n\t\tdescriptor++;\n\t}\n\n\tif (rva)\n\t\t*rva = 0;\n\n\treturn false;\n}\n\ntemplate\nvoid ImportDirectory::AddModuleImport(std::string_view module, std::string_view import, std::uint32_t* rva)\n{\n\t// TODO: Clean this up and optimize some things.\n\n\tauto descriptor = m_base;\n\tmem::ByteVector* buffer = &m_image->buffer();\n\n\tstd::unique_ptr descriptors;\n\tstd::uint32_t vsize = 0, rawsize = 0;\n\n\tvsize = m_image->GetPEHeader()\n\t\t.GetOptionalHeader()\n\t\t.GetDataDirectory(DIRECTORY_ENTRY_IMPORT).Size;\n\n\n\tdescriptors.reset(new uint8_t[vsize]);\n\tmemset(descriptors.get(), 0, vsize);\n\n\tSectionHeader newSec;\n\n\t//\n\t// Add in all the descriptors, so we can relocate them.\n\twhile (descriptor->Characteristics != 0)\n\t{\n\t\tstd::memcpy(&descriptors.get()[rawsize], descriptor, sizeof(*descriptor));\n\t\trawsize += sizeof detail::Image_t<>::ImportDescriptor_t;\n\n\t\tstd::memset(descriptor, 0x0, sizeof(*descriptor));\n\n\t\tdescriptor++;\n\t}\n\n\t//\n\t// For the null term.\n\trawsize += sizeof detail::Image_t<>::ImportDescriptor_t;\n\n\t//\n\t// Create a new section for the descriptors\n\tif (newSec = m_image->GetSectionHeader(\".pepp\"); newSec.GetName() == \".dummy\")\n\t{\n\t\t//\n\t\t// We split a new section into two portions\n\t\t// The first part contains IAT addresses, or IMAGE_IMPORT_BY_NAME structs.\n\t\t// The second part contains import descriptors\n\t\t// NOTE: The section size may need to be modified depending on how many imports need to be added\n\t\t// This is using quite a large section due to a IAT rebuilding tool I created previously.\n\t\tm_image->AppendSection(\n\t\t\t\".pepp\",\n\t\t\t20 * PAGE_SIZE,\n\t\t\tSCN_MEM_READ |\n\t\t\tSCN_MEM_WRITE | \n\t\t\tSCN_CNT_INITIALIZED_DATA |\n\t\t\tSCN_MEM_EXECUTE, &newSec);\n\n\t\tmemset(buffer->as(newSec.GetPointerToRawData()), 0xcc, newSec.GetSizeOfRawData());\n\n\t\tnewSec.SetPointerToRelocations(0);\n\t\tnewSec.SetPointerToLinenumbers(0);\n\t\tnewSec.SetNumberOfRelocations(0);\n\t\tnewSec.SetNumberOfLinenumbers(0);\n\n\t\t// Ghetto, needed for now.\n\t\tmemcpy(&m_image->GetSectionHeader(\".pepp\"), &newSec, sizeof newSec);\n\n\t\t//\n\t\t// Set the new base.\n\t\tm_base = reinterpret_cast(\n\t\t\t&m_image->base()[m_image->GetPEHeader().RvaToOffset(\n\t\t\t\tnewSec.GetVirtualAddress() + (10*PAGE_SIZE))]);\n\t}\n\n\t//\n\t// Fill in the original descriptors\n\tstd::memcpy(&buffer->at(newSec.GetPointerToRawData() + (10*PAGE_SIZE)), descriptors.get(), vsize);\n\n\t//\n\t// Set the new directory\n\tm_image->GetPEHeader()\n\t\t.GetOptionalHeader()\n\t\t.GetDataDirectory(DIRECTORY_ENTRY_IMPORT).VirtualAddress\n\t\t= newSec.GetVirtualAddress() + (10*PAGE_SIZE);\n\tm_image->GetPEHeader()\n\t\t.GetOptionalHeader()\n\t\t.GetDataDirectory(DIRECTORY_ENTRY_IMPORT).Size\n\t\t= vsize + sizeof detail::Image_t<>::ImportDescriptor_t;\n\n\tstd::uint32_t descriptor_offset = newSec.GetPointerToRawData() + (10*PAGE_SIZE) + vsize - sizeof(*descriptor);\n\tdescriptor = (decltype(descriptor)) & ((*buffer)[descriptor_offset]);\n\n\t//\n\t// Fill in default values, we don't use these\n\tdescriptor->ForwarderChain = 0;\n\tdescriptor->TimeDateStamp = 0;\n\n\t//\n\t// 1) Check if requested module already exists as string, and use that RVA\n\tstd::uint32_t name_rva = 0;\n\tstd::uint32_t tmp_offset = 0;\n\tstd::uint32_t iat_rva = 0;\n\tstd::uint32_t tmp_rva = 0;\n\tstd::uint32_t oft_offset = 0;\n\tstd::uint32_t oft_rva = 0;\n\n\tif (!ImportsModule(module, &name_rva))\n\t{\n\t\t// 2) If 1 isn't possible, add a section or extend the data section (hard)\n\t\t// and add in the module name manually\n\t\t// \t - set descriptor->Name to that rva\n\t\ttmp_offset = m_image->FindPadding(&newSec, 0xcc, module.size() + 1);\n\t\tname_rva = m_image->GetPEHeader().OffsetToRva(tmp_offset);\n\n\t\tstd::memcpy(buffer->as(tmp_offset), module.data(), module.size());\n\t\tbuffer->as(tmp_offset)[module.size()] = 0;\n\t}\n\n\tdescriptor->Name = name_rva;\n\n\tusing ImageThunkData_t = typename detail::Image_t::ThunkData_t;\n\n\tImageThunkData_t thunks[2];\n\n\t// 3) Add in FirstThunk\n\ttmp_offset = m_image->FindPadding(&newSec, 0xcc, sizeof(thunks), m_image->GetWordSize());\n\n\tiat_rva = m_image->GetPEHeader().OffsetToRva(tmp_offset);\n\n\t//\n\t// Fill in values so that it doesn't get taken up next time this function is called\n\t// Also, these need to be zero.\n\tmemset(buffer->as(tmp_offset), 0x00, sizeof(thunks));\n\n\tImageThunkData_t* firstThunk = m_image->buffer().as(tmp_offset);\n\tfirstThunk->u1.AddressOfData = iat_rva;\n\n\tdescriptor->FirstThunk = iat_rva;\n\tif (rva)\n\t\t*rva = iat_rva;\n\n\t// 4) Add in OriginalFirstThunk\n\ttmp_offset = m_image->FindPadding(&newSec, 0xcc, sizeof(thunks), m_image->GetWordSize());\n\t\n\ttmp_rva = m_image->GetPEHeader().OffsetToRva(tmp_offset);\n\n\t//\n\t// Fill in values so that it doesn't get taken up next time this function is called\n\t// Also, these need to be zero.\n\tmemset(buffer->as(tmp_offset), 0x00, sizeof(thunks));\n\n\toft_offset = m_image->FindPadding(&newSec, 0xcc, sizeof(std::uint16_t) + import.size() + 1, m_image->GetWordSize());\n\toft_rva = m_image->GetPEHeader().OffsetToRva(oft_offset);\n\t//\n\t// Copy in name to the oft rva\n\tIMAGE_IMPORT_BY_NAME* imp = buffer->as(oft_offset);\n\timp->Hint = 0x0000;\n\t\n\tmemcpy(&imp->Name[0], import.data(), import.size());\n\timp->Name[import.size()] = 0;\n\n\tImageThunkData_t* ogFirstThunk = m_image->buffer().as(tmp_offset);\n\togFirstThunk->u1.AddressOfData = oft_rva;\n\t(ogFirstThunk + 1)->u1.AddressOfData = 0;\n\n\tdescriptor->OriginalFirstThunk = tmp_rva;\n\n\t//\n\t// Finally null terminate\n\tmemset((descriptor + 1), 0, sizeof(decltype(*descriptor)));\n}\n\ntemplate\nvoid ImportDirectory::AddModuleImports(std::string_view module, std::initializer_list imports, std::uint32_t* rva)\n{\n\t// TODO: Clean this up and optimize some things.\n\n\tauto descriptor = m_base;\n\tmem::ByteVector* buffer = &m_image->buffer();\n\n\tstd::unique_ptr descriptors;\n\tstd::uint32_t vsize = 0, rawsize = 0;\n\n\tvsize = m_image->GetPEHeader()\n\t\t.GetOptionalHeader()\n\t\t.GetDataDirectory(DIRECTORY_ENTRY_IMPORT).Size;\n\n\n\tdescriptors.reset(new uint8_t[vsize]);\n\tmemset(descriptors.get(), 0, vsize);\n\n\tSectionHeader newSec;\n\n\t//\n\t// Add in all the descriptors, so we can relocate them.\n\twhile (descriptor->Characteristics != 0)\n\t{\n\t\tstd::memcpy(&descriptors.get()[rawsize], descriptor, sizeof(*descriptor));\n\t\trawsize += sizeof detail::Image_t<>::ImportDescriptor_t;\n\n\t\tstd::memset(descriptor, 0x0, sizeof(*descriptor));\n\n\t\tdescriptor++;\n\t}\n\n\t//\n\t// For the null term.\n\trawsize += sizeof detail::Image_t<>::ImportDescriptor_t;\n\n\t//\n\t// Create a new section for the descriptors\n\tif (newSec = m_image->GetSectionHeader(\".pepp\"); newSec.GetName() == \".dummy\")\n\t{\n\t\t//\n\t\t// We split a new section into two portions\n\t\t// The first part contains IAT addresses, or IMAGE_IMPORT_BY_NAME structs.\n\t\t// The second part contains import descriptors\n\t\tm_image->AppendSection(\n\t\t\t\".pepp\",\n\t\t\t2 * PAGE_SIZE,\n\t\t\tSCN_MEM_READ |\n\t\t\tSCN_MEM_WRITE |\n\t\t\tSCN_CNT_INITIALIZED_DATA |\n\t\t\tSCN_MEM_EXECUTE, &newSec);\n\n\t\tmemset(buffer->as(newSec.GetPointerToRawData()), 0xcc, newSec.GetSizeOfRawData());\n\n\t\tnewSec.SetPointerToRelocations(0);\n\t\tnewSec.SetPointerToLinenumbers(0);\n\t\tnewSec.SetNumberOfRelocations(0);\n\t\tnewSec.SetNumberOfLinenumbers(0);\n\n\t\t// Ghetto, needed for now.\n\t\tmemcpy(&m_image->GetSectionHeader(\".pepp\"), &newSec, sizeof newSec);\n\n\t\t//\n\t\t// Set the new base.\n\t\tm_base = reinterpret_cast(\n\t\t\t&m_image->base()[m_image->GetPEHeader().RvaToOffset(\n\t\t\t\tnewSec.GetVirtualAddress() + PAGE_SIZE)]);\n\t}\n\n\t//\n\t// Fill in the original descriptors\n\tstd::memcpy(&buffer->at(newSec.GetPointerToRawData() + PAGE_SIZE), descriptors.get(), vsize);\n\n\t//\n\t// Set the new directory\n\tm_image->GetPEHeader()\n\t\t.GetOptionalHeader()\n\t\t.GetDataDirectory(DIRECTORY_ENTRY_IMPORT).VirtualAddress\n\t\t= newSec.GetVirtualAddress() + PAGE_SIZE;\n\tm_image->GetPEHeader()\n\t\t.GetOptionalHeader()\n\t\t.GetDataDirectory(DIRECTORY_ENTRY_IMPORT).Size\n\t\t= vsize + sizeof detail::Image_t<>::ImportDescriptor_t;\n\n\tstd::uint32_t descriptor_offset = newSec.GetPointerToRawData() + PAGE_SIZE + vsize - sizeof(*descriptor);\n\tdescriptor = (decltype(descriptor)) & ((*buffer)[descriptor_offset]);\n\n\t//\n\t// Fill in default values, we don't use these\n\tdescriptor->ForwarderChain = 0;\n\tdescriptor->TimeDateStamp = 0;\n\n\t//\n\t// 1) Check if requested module already exists as string, and use that RVA\n\tstd::uint32_t name_rva = 0;\n\tstd::uint32_t tmp_offset = 0;\n\tstd::uint32_t iat_rva = 0;\n\tstd::uint32_t tmp_rva = 0;\n\tstd::uint32_t oft_offset = 0;\n\tstd::uint32_t oft_rva = 0;\n\n\tif (!ImportsModule(module, &name_rva))\n\t{\n\t\t// 2) If 1 isn't possible, add a section or extend the data section (hard)\n\t\t// and add in the module name manually\n\t\t// \t - set descriptor->Name to that rva\n\t\ttmp_offset = m_image->FindPadding(&newSec, 0xcc, module.size() + 1);\n\t\tname_rva = m_image->GetPEHeader().OffsetToRva(tmp_offset);\n\n\t\tstd::memcpy(buffer->as(tmp_offset), module.data(), module.size());\n\t\tbuffer->as(tmp_offset)[module.size()] = 0;\n\t}\n\n\tdescriptor->Name = name_rva;\n\n\tusing ImageThunkData_t = typename detail::Image_t::ThunkData_t;\n\n\n\tstd::size_t thunksize = (imports.size() + 1) * sizeof(ImageThunkData_t);\n\n\n\t// 3) Add in FirstThunk\n\ttmp_offset = m_image->FindPadding(&newSec, 0xcc, thunksize, m_image->GetWordSize());\n\tiat_rva = m_image->GetPEHeader().OffsetToRva(tmp_offset);\n\n\t//\n\t// Fill in values so that it doesn't get taken up next time this function is called\n\t// Also, these need to be zero.\n\tmemset(buffer->as(tmp_offset), 0x00, thunksize);\n\n\tImageThunkData_t* firstThunk = m_image->buffer().as(tmp_offset);\n\tfirstThunk->u1.AddressOfData = iat_rva;\n\n\tdescriptor->FirstThunk = iat_rva;\n\t\n\n\n\t// 4) Add in OriginalFirstThunk\n\ttmp_offset = m_image->FindPadding(&newSec, 0xcc, thunksize, m_image->GetWordSize());\n\ttmp_rva = m_image->GetPEHeader().OffsetToRva(tmp_offset);\n\n\t//\n\t// Fill in values so that it doesn't get taken up next time this function is called\n\t// Also, these need to be zero.\n\tmemset(buffer->as(tmp_offset), 0x00, thunksize);\n\n\n\tImageThunkData_t* ogFirstThunk = m_image->buffer().as(tmp_offset);\n\n\tint i = 0;\n\tfor (auto it = imports.begin(); it != imports.end(); it++)\n\t{\n\t\toft_offset = m_image->FindPadding(&newSec, 0xcc, sizeof(std::uint16_t) + it->size() + 1, m_image->GetWordSize());\n\t\toft_rva = m_image->GetPEHeader().OffsetToRva(oft_offset);\n\t\t//\n\t\t// Copy in name to the oft rva\n\t\tIMAGE_IMPORT_BY_NAME* imp = buffer->as(oft_offset);\n\t\timp->Hint = 0x0000;\n\n\t\tmemcpy(&imp->Name[0], it->data(), it->size());\n\t\timp->Name[it->size()] = '\\0';\n\n\t\tif (rva)\n\t\t\trva[i] = iat_rva + (m_image->GetWordSize() * i++);\n\n\t\togFirstThunk->u1.AddressOfData = oft_rva;\n\t\togFirstThunk++;\n\t}\n\n\t\n\togFirstThunk->u1.AddressOfData = 0;\n\tdescriptor->OriginalFirstThunk = tmp_rva;\n\n\t//\n\t// Finally null terminate\n\tmemset((descriptor + 1), 0, sizeof(decltype(*descriptor)));\n}\n\ntemplate\nvoid ImportDirectory::TraverseImports(const std::function& cb_func)\n{\n\tauto descriptor = m_base;\n\tmem::ByteVector const* buffer = &m_image->buffer();\n\n\twhile (descriptor->Characteristics != 0) {\n\t\tstd::uint32_t offset = m_image->GetPEHeader().RvaToOffset(descriptor->Name);\n\t\tconst char* module = buffer->as(offset);\n\t\tstd::int32_t index = 0;\n\t\ttypename detail::Image_t::ThunkData_t* firstThunk =\n\t\t\tbuffer->as(m_image->GetPEHeader().RvaToOffset(descriptor->OriginalFirstThunk));\n\n\t\tModuleImportData_t data{};\n\t\tdata.module_name_rva = descriptor->Name;\n\t\tdata.module_name = module;\n\t\tdata.import_rva = -1;\n\n\t\twhile (firstThunk->u1.AddressOfData)\n\t\t{\n\t\t\tIMAGE_IMPORT_BY_NAME* _imp =\n\t\t\t\tbuffer->as(m_image->GetPEHeader().RvaToOffset(firstThunk->u1.AddressOfData));\n\n\t\t\tif (IsImportOrdinal(firstThunk->u1.Ordinal))\n\t\t\t{\n\t\t\t\tdata.ordinal = true;\n\t\t\t\tdata.import_variant = (std::uint64_t)firstThunk->u1.Ordinal;\n\t\t\t\tdata.import_name_rva = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdata.import_variant = static_cast(_imp->Name);\n\t\t\t\tdata.import_name_rva = firstThunk->u1.AddressOfData + sizeof(std::uint16_t);\n\t\t\t}\n\n\t\t\tdata.import_rva = descriptor->FirstThunk + (index * m_image->GetWordSize());\n\n\t\t\t//\n\t\t\t// Call the callback\n\t\t\tcb_func(&data);\n\n\t\t\tindex++;\n\t\t\tfirstThunk++;\n\t\t}\n\n\t\tdescriptor++;\n\t}\n}\n\ntemplate\nvoid ImportDirectory::GetIATOffsets(std::uint32_t& begin, std::uint32_t& end) noexcept\n{\n\t//\n\t// Null out.\n\tbegin = end = 0;\n\n\tIMAGE_DATA_DIRECTORY const& iat = m_image->GetPEHeader().GetOptionalHeader().GetDataDirectory(IMAGE_DIRECTORY_ENTRY_IAT);\n\tif (iat.Size == 0)\n\t\treturn;\n\n\n\tbegin = m_image->GetPEHeader().RvaToOffset(iat.VirtualAddress);\n\tend = begin + iat.Size;\n}\n" }, { "path": "vendor/pepp/ImportDirectory.hpp", "content": "#pragma once\n\n#include \n#include \n#include \n\nnamespace pepp\n{\n\tstruct ModuleImportData_t\n\t{\n\t\tstd::uint32_t\t\t\t\t\t\t\t\tmodule_name_rva;\n\t\tstd::string\t\t\t\t\t\t\t\t\tmodule_name;\n\t\tstd::uint32_t\t\t\t\t\t\t\t\timport_name_rva;\n\t\tstd::variant\timport_variant;\n\t\tstd::uint32_t\t\t\t\t\t\t\t\timport_rva;\n\t\tbool\t\t\t\t\t\t\t\t\t\tordinal;\n\t};\n\n\tstatic constexpr auto IMPORT_ORDINAL_FLAG_32 = IMAGE_ORDINAL_FLAG32;\n\tstatic constexpr auto IMPORT_ORDINAL_FLAG_64 = IMAGE_ORDINAL_FLAG64;\n\n\ttemplate\n\tclass ImportDirectory : pepp::msc::NonCopyable\n\t{\n\t\tfriend class Image<32>;\n\t\tfriend class Image<64>;\n\n\t\tImage*\t\t\t\t\t\t\tm_image;\n\t\tdetail::Image_t<>::ImportDescriptor_t*\tm_base;\n\t\tdetail::Image_t<>::ImportAddressTable_t m_iat_base;\n\tpublic:\n\t\tImportDirectory() = default;\n\n\t\tbool ImportsModule(std::string_view module, std::uint32_t* name_rva = nullptr) const;\n\t\tbool HasModuleImport(std::string_view module, std::string_view import, std::uint32_t* rva = nullptr) const;\n\t\tvoid AddModuleImport(std::string_view module, std::string_view import, std::uint32_t* rva = nullptr);\n\t\tvoid AddModuleImports(std::string_view module, std::initializer_list imports, std::uint32_t* rva = nullptr);\n\t\tvoid TraverseImports(const std::function& cb_func);\n\n\t\tvoid SetCharacteristics(std::uint32_t chrs) {\n\t\t\tm_base->Characteristics = chrs;\n\t\t}\n\n\t\tstd::uint32_t GetCharacteristics() const {\n\t\t\treturn m_base->Characteristics;\n\t\t}\n\t\t\n\t\tvoid SetTimeDateStamp(std::uint32_t TimeDateStamp) {\n\t\t\tm_base->TimeDateStamp = TimeDateStamp;\n\t\t}\n\n\t\tstd::uint32_t GetTimeDateStamp() const {\n\t\t\treturn m_base->TimeDateStamp;\n\t\t}\n\n\t\t//! Util\n\t\ttemplate\n\t\tbool IsImportOrdinal(T ord) const requires pepp::msc::MemoryAddress {\n\t\t\tif constexpr (bitsize == 64)\n\t\t\t\treturn (ord & IMPORT_ORDINAL_FLAG_64) != 0;\n\t\t\treturn (ord & IMPORT_ORDINAL_FLAG_32) != 0;\n\t\t}\n\n\t\tvoid GetIATOffsets(std::uint32_t& begin, std::uint32_t& end) noexcept;\n\n\tprivate:\n\t\t//! Setup the directory\n\t\tvoid _setup(Image* image) {\n\t\t\tm_image = image;\n\t\t\tm_base = reinterpret_cast(\n\t\t\t\t&image->base()[image->GetPEHeader().RvaToOffset(\n\t\t\t\t\timage->GetPEHeader().GetOptionalHeader().GetDataDirectory(DIRECTORY_ENTRY_IMPORT).VirtualAddress)]);\t\t\n\t\t\tm_iat_base = reinterpret_cast(\n\t\t\t\t&image->base()[image->GetPEHeader().RvaToOffset(\n\t\t\t\t\timage->GetPEHeader().GetOptionalHeader().GetDataDirectory(DIRECTORY_ENTRY_IAT).VirtualAddress)]);\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/OptionalHeader.cpp", "content": "#include \"PELibrary.hpp\"\n\nusing namespace pepp;\n\n// Explicit templates.\ntemplate class OptionalHeader<32>;\ntemplate class OptionalHeader<64>;\n\ntemplate\ninline OptionalHeader::OptionalHeader()\n{\n}\n\ntemplate\nvoid OptionalHeader::SetMagic(PEMagic magic)\n{\n\tm_base->Magic = static_cast(magic);\n}\n\ntemplate\nPEMagic OptionalHeader::GetMagic() const\n{\n\treturn static_cast(m_base->Magic);\n}\n\n\ntemplate\nvoid OptionalHeader::SetImageBase(detail::Image_t::Address_t address)\n{\n\tm_base->ImageBase = address;\n}\n\ntemplate\ndetail::Image_t::Address_t OptionalHeader::GetImageBase() const\n{\n\treturn m_base->ImageBase;\n}\n\ntemplate\nvoid OptionalHeader::SetSizeOfImage(std::uint32_t size)\n{\n\tm_base->SizeOfImage = size;\n}\n\ntemplate\nstd::uint32_t OptionalHeader::GetSizeOfImage() const\n{\n\treturn m_base->SizeOfImage;\n}\n\ntemplate\nvoid OptionalHeader::SetSizeOfCode(std::uint32_t dwSize)\n{\n\tm_base->SizeOfCode = dwSize;\n}\n\ntemplate\nstd::uint32_t OptionalHeader::GetSizeOfCode() const\n{\n\treturn m_base->SizeOfCode;\n}\n\ntemplate\nvoid OptionalHeader::SetSizeOfInitializedData(std::uint32_t dwSize)\n{\n\tm_base->SizeOfInitializedData = dwSize;\n}\n\ntemplate\nstd::uint32_t OptionalHeader::GetSizeOfInitializedData() const\n{\n\treturn m_base->SizeOfInitializedData;\n}\n\ntemplate\nvoid OptionalHeader::SetSizeOfUninitializedData(std::uint32_t dwSize)\n{\n\tm_base->SizeOfUninitializedData = dwSize;\n}\n\ntemplate\nstd::uint32_t OptionalHeader::GetSizeOfUninitializedData() const\n{\n\treturn m_base->SizeOfUninitializedData;\n}\n\ntemplate\nvoid OptionalHeader::SetBaseOfCode(std::uint32_t dwBase)\n{\n\tm_base->BaseOfCode = dwBase;\n}\n\ntemplate\nstd::uint32_t OptionalHeader::GetBaseOfCode() const\n{\n\treturn m_base->BaseOfCode;\n}\n\ntemplate\nvoid OptionalHeader::SetAddressOfEntryPoint(std::uint32_t dwBase)\n{\n\tm_base->AddressOfEntryPoint = dwBase;\n}\n\ntemplate\nstd::uint32_t OptionalHeader::GetAddressOfEntryPoint() const\n{\n\treturn m_base->AddressOfEntryPoint;\n}\n\ntemplate\nstd::uint32_t OptionalHeader::GetFileAlignment() const\n{\n\treturn m_base->FileAlignment;\n}\n\ntemplate\nstd::uint32_t OptionalHeader::GetSectionAlignment() const\n{\n\treturn m_base->SectionAlignment;\n}\n\ntemplate\nbool OptionalHeader::HasRelocations() const\n{\n\treturn m_base->DataDirectory[DIRECTORY_ENTRY_BASERELOC].Size > 0;\n}\n" }, { "path": "vendor/pepp/OptionalHeader.hpp", "content": "#pragma once\n\nnamespace pepp\n{\n\tenum PEDirectoryEntry\n\t{\n\t\tDIRECTORY_ENTRY_EXPORT = 0, // Export Directory\n\t\tDIRECTORY_ENTRY_IMPORT = 1, // Import Directory\n\t\tDIRECTORY_ENTRY_RESOURCE = 2, // Resource Directory\n\t\tDIRECTORY_ENTRY_EXCEPTION = 3, // Exception Directory\n\t\tDIRECTORY_ENTRY_SECURITY = 4, // Security Directory\n\t\tDIRECTORY_ENTRY_BASERELOC = 5, // Base Relocation Table\n\t\tDIRECTORY_ENTRY_DEBUG = 6, // Debug Directory\n\t\tDIRECTORY_ENTRY_ARCHITECTURE = 7, // Architecture Specific Data\n\t\tDIRECTORY_ENTRY_GLOBALPTR = 8, // RVA of GP\n\t\tDIRECTORY_ENTRY_TLS = 9, // TLS Directory\n\t\tDIRECTORY_ENTRY_LOAD_CONFIG = 10, // Load Configuration Directory\n\t\tDIRECTORY_ENTRY_BOUND_IMPORT = 11, // Bound Import Directory in headers\n\t\tDIRECTORY_ENTRY_IAT = 12, // Import Address Table\n\t\tDIRECTORY_ENTRY_DELAY_IMPORT = 13, // Delay Load Import Descriptors\n\t\tDIRECTORY_ENTRY_COM_DESCRIPTOR = 14 // COM Runtime descriptor\n\t};\n\n\tenum class PEMagic\n\t{\n\t\tHDR_32 = 0x10b,\n\t\tHDR_64 = 0x20b,\n\t\tHDR_ROM = 0x107\n\t};\n\n\ttemplate\n\tclass OptionalHeader : pepp::msc::NonCopyable\n\t{\n\t\tfriend class PEHeader;\n\t\tfriend class Image;\n\n\t\tusing ImageData_t = detail::Image_t;\n\n\t\tImage*\t\t\t\t\tm_Image;\n\t\tImageData_t::OptionalHeader_t*\tm_base{ nullptr };\n\tpublic:\n\t\tOptionalHeader();\n\n\n\t\t//! Getter/setter for OptionalHeader.Magic\n\t\tvoid SetMagic(PEMagic magic);\n\t\tPEMagic GetMagic() const;\n\n\t\t//! Getter/setter for OptionalHeader.ImageBase\n\t\tvoid SetImageBase(detail::Image_t::Address_t address);\n\t\tdetail::Image_t::Address_t GetImageBase() const;\n\n\t\t//! Getter/setter for OptionalHeader.SizeOfImage\n\t\tvoid SetSizeOfImage(std::uint32_t size);\n\t\tstd::uint32_t GetSizeOfImage() const;\n\n\t\t//! Getter/setter for OptionalHeader.SizeOfCode\n\t\tvoid SetSizeOfCode(std::uint32_t dwSize);\n\t\tstd::uint32_t GetSizeOfCode() const;\n\n\t\t//! Getter/setter for OptionalHeader.SizeOfInitializedData\n\t\tvoid SetSizeOfInitializedData(std::uint32_t dwSize);\n\t\tstd::uint32_t GetSizeOfInitializedData() const;\n\n\t\t//! Getter/setter for OptionalHeader.SizeOfUninitializedData\n\t\tvoid SetSizeOfUninitializedData(std::uint32_t dwSize);\n\t\tstd::uint32_t GetSizeOfUninitializedData() const;\n\n\t\t//! Getter/setter for OptionalHeader.BaseOfCode\n\t\tvoid SetBaseOfCode(std::uint32_t dwBase);\n\t\tstd::uint32_t GetBaseOfCode() const;\n\n\t\t//! Getter/setter for OptionalHeader.AddressOfEntryPoint\n\t\tvoid SetAddressOfEntryPoint(std::uint32_t dwBase);\n\t\tstd::uint32_t GetAddressOfEntryPoint() const;\n\n\t\t//! Getter for OptionalHeader.FileAlignment\n\t\tstd::uint32_t GetFileAlignment() const;\n\n\t\t//! Getter for OptionalHeader.SectionAlignment\n\t\tstd::uint32_t GetSectionAlignment() const;\n\n\t\t//! Get data directory\n\t\tdetail::Image_t<>::DataDirectory_t& GetDataDirectory(int idx) const {\n\t\t\treturn m_base->DataDirectory[idx];\n\t\t}\n\n\t\t//! Calculate the number of directories present (not NumberOfRvaAndSizes)\n\t\tstd::uint32_t DirectoryCount() const {\n\t\t\tstd::uint32_t count{ 0ul };\n\t\t\tfor (int i = 0; i < MAX_DIRECTORY_COUNT; i++)\n\t\t\t{\n\t\t\t\tif (GetDataDirectory(i).Size > 0) {\n\t\t\t\t\t++count;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn count;\n\t\t}\n\n\t\tstd::uint8_t* base() const {\n\t\t\treturn (std::uint8_t*)m_base;\n\t\t}\n\n\t\t//! Check if image has relocations\n\t\tbool HasRelocations() const;\n\n\tprivate:\n\t\tvoid _setup(Image* image) {\n\t\t\tm_Image = image;\n\t\t\tm_base = &image->GetPEHeader().native()->OptionalHeader;\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/PEHeader.cpp", "content": "#include \"PELibrary.hpp\"\n\nusing namespace pepp;\n\n// Explicit templates.\ntemplate class PEHeader<32>;\ntemplate class PEHeader<64>;\n\ntemplate\ninline PEHeader::PEHeader()\n\t: m_Image(nullptr)\n{\n}\n\n\ntemplate\nstd::uint32_t PEHeader::GetSizeOfImage()\n{\n\tstd::uint32_t dwLowestRva{ 0 };\n\tstd::uint32_t dwHighestRva{ 0 };\n\n\tfor (std::uint16_t n = 0; n < GetFileHeader().GetNumberOfSections(); n++) {\n\t\t//\n\t\t// Skip sections with bad Misc.VirtualSize\n\t\tif (m_Image->m_rawSectionHeaders[n].GetVirtualSize() == 0)\n\t\t\tcontinue;\n\t\t//\n\t\t// Fill in high/low rvas if possible.\n\t\tif (m_Image->m_rawSectionHeaders[n].GetVirtualAddress() < dwLowestRva)\n\t\t\tdwLowestRva = \n\t\t\t\tm_Image->m_rawSectionHeaders[n].GetVirtualAddress();\n\t\tif (m_Image->m_rawSectionHeaders[n].GetVirtualAddress() > dwHighestRva)\n\t\t\tdwHighestRva = \n\t\t\t\tm_Image->m_rawSectionHeaders[n].GetVirtualAddress() + m_Image->m_rawSectionHeaders[n].GetVirtualSize();\n\t}\n\n\treturn (dwHighestRva - dwLowestRva);\n}\n\ntemplate\nstd::uint32_t PEHeader::GetStartOfCode()\n{\n\treturn m_OptionalHeader.GetBaseOfCode();\n}\n\ntemplate\nstd::uint32_t PEHeader::GetNextSectionOffset()\n{\n\tstd::uint16_t nlastSecIdx = GetFileHeader().GetNumberOfSections() - 1;\n\tSectionHeader const& sec = GetSectionHeader(nlastSecIdx);\n\tstd::uint32_t uNextOffset = sec.GetPointerToRawData() + sec.GetSizeOfRawData();\n\n\t/*\n\t* FileAlignment\n\t* The alignment of the raw data of sections in the image file, in bytes.\n\t*/\n\treturn Align(uNextOffset, GetOptionalHeader().GetFileAlignment());\n}\n\ntemplate\nstd::uint32_t PEHeader::GetNextSectionRva()\n{\n\tstd::uint16_t nlastSecIdx = GetFileHeader().GetNumberOfSections() - 1;\n\tSectionHeader const& sec = GetSectionHeader(nlastSecIdx);\n\tstd::uint32_t uNextRva = sec.GetVirtualAddress() + sec.GetVirtualSize();\n\n\t/*\n\t* SectionAlignment\n\t* The alignment of sections loaded in memory, in bytes.\n\t*/\n\treturn Align(uNextRva, GetOptionalHeader().GetSectionAlignment());\n}\n" }, { "path": "vendor/pepp/PEHeader.hpp", "content": "#pragma once\n\nnamespace pepp\n{\n\tconstexpr static int MAX_DIRECTORY_COUNT = 16;\n\n\ttemplate\n\tclass Image;\n\ttemplate\n\tclass OptionalHeader;\n\t\n\tclass SectionHeader;\n\tclass FileHeader;\n\t\n\ttemplate\n\tclass PEHeader : pepp::msc::NonCopyable\n\t{\n\t\tfriend class Image;\n\n\t\tusing ImageData_t = detail::Image_t;\n\n\t\tImage*\t\t\t\t\tm_Image;\n\t\tImageData_t::Header_t*\t\t\tm_PEHdr = nullptr;\n\t\tFileHeader\t\t\t\t\t\tm_FileHeader;\n\t\tOptionalHeader\t\t\tm_OptionalHeader;\n\tprivate:\n\t\t//! Private constructor, this should never be established outside of `class Image`\n\t\tPEHeader();\n\tpublic:\n\n\t\tclass FileHeader& GetFileHeader() {\n\t\t\treturn m_FileHeader;\n\t\t}\n\n\t\tconst class FileHeader& GetFileHeader() const {\n\t\t\treturn m_FileHeader;\n\t\t}\n\n\t\tclass OptionalHeader& GetOptionalHeader() {\n\t\t\treturn m_OptionalHeader;\n\t\t}\n\n\t\tconst class OptionalHeader& GetOptionalHeader() const {\n\t\t\treturn m_OptionalHeader;\n\t\t}\n\n\t\tSectionHeader& GetSectionHeader(std::uint16_t dwIndex) {\n\t\t\tstatic SectionHeader dummy{};\n\n\t\t\tif (dwIndex < m_Image->GetNumberOfSections())\n\t\t\t\treturn m_Image->m_rawSectionHeaders[dwIndex];\n\t\t\t\n\t\t\treturn dummy;\n\t\t}\n\n\t\tSectionHeader& GetSectionHeader(std::string_view name) {\n\t\t\tstatic SectionHeader dummy{};\n\n\t\t\tfor (std::uint16_t n = 0; n < m_Image->GetNumberOfSections(); n++)\n\t\t\t{\n\t\t\t\tif (m_Image->m_rawSectionHeaders[n].GetName().compare(name) == 0) {\n\t\t\t\t\treturn m_Image->m_rawSectionHeaders[n];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn dummy;\n\t\t}\n\n\t\tSectionHeader& GetSectionHeaderFromVa(std::uint32_t va) {\n\t\t\tstatic SectionHeader dummy{}; \n\t\t\t\n\t\t\tfor (std::uint16_t n = 0; n < m_Image->GetNumberOfSections(); n++)\n\t\t\t{\n\t\t\t\tif (m_Image->m_rawSectionHeaders[n].HasVirtualAddress(va)) {\n\t\t\t\t\treturn m_Image->m_rawSectionHeaders[n];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn dummy;\n\t\t}\n\n\t\tSectionHeader& GetSectionHeaderFromOffset(std::uint32_t offset) {\n\t\t\tstatic SectionHeader dummy{};\n\n\t\t\tfor (std::uint16_t n = 0; n < m_Image->GetNumberOfSections(); n++)\n\t\t\t{\n\t\t\t\tif (m_Image->m_rawSectionHeaders[n].HasOffset(offset)) {\n\t\t\t\t\treturn m_Image->m_rawSectionHeaders[n];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn dummy;\n\t\t}\n\n\n\n\t\t//! Calculate the number of directories present (not NumberOfRvaAndSizes)\n\t\tstd::uint32_t DirectoryCount() const {\n\t\t\treturn GetOptionalHeader().DirectoryCount();\n\t\t}\n\n\t\t//! Convert a relative virtual address to a file offset\n\t\tstd::uint32_t RvaToOffset(std::uint32_t rva) {\n\t\t\tSectionHeader const& sec { GetSectionHeaderFromVa(rva) };\n\t\t\t//\n\t\t\t// Did we get one?\n\t\t\tif (sec.GetName() != \".dummy\") {\n\t\t\t\treturn sec.GetPointerToRawData() + rva - sec.GetVirtualAddress();\n\t\t\t}\n\n\t\t\treturn 0ul;\n\t\t}\n\n\t\t//! Convert a file offset back to a relative virtual address\n\t\tstd::uint32_t OffsetToRva(std::uint32_t offset) {\n\t\t\tSectionHeader const& sec{ GetSectionHeaderFromOffset(offset) };\n\t\t\t//\n\t\t\t// Did we get one?\n\t\t\tif (sec.GetName() != \".dummy\") {\n\t\t\t\treturn (sec.GetVirtualAddress() + offset) - sec.GetPointerToRawData();\n\t\t\t}\n\n\t\t\treturn 0ul;\n\t\t}\n\t\t \n\t\t//! Convert a rel. virtual address to a virtual address\n\t\tdetail::Image_t::Address_t RvaToVa(std::uint32_t rva) const {\n\t\t\treturn m_OptionalHeader.GetImageBase() + rva;\n\t\t}\n\n\t\t//! Used to check if the NT tag is present.\n\t\tbool IsTaggedPE() const {\n\t\t\treturn m_PEHdr->Signature == IMAGE_NT_SIGNATURE;\n\t\t}\n\n\t\tstd::uint8_t* base() const {\n\t\t\treturn (std::uint8_t*)m_PEHdr;\n\t\t}\n\n\t\tconstexpr std::size_t size() const {\n\t\t\treturn sizeof(decltype(*m_PEHdr));\n\t\t}\n\n\t\t//! Return native pointer\n\t\tdetail::Image_t::Header_t* native() {\n\t\t\treturn m_PEHdr;\n\t\t}\n\n\t\t//! Manually calculate the size of the image\n\t\tstd::uint32_t GetSizeOfImage();\n\n\t\t//! Manually calculate the start of the code section\n\t\tstd::uint32_t GetStartOfCode();\n\n\t\t//! Calculate next section offset\n\t\tstd::uint32_t GetNextSectionOffset();\n\n\t\t//! Calculate next section rva\n\t\tstd::uint32_t GetNextSectionRva();\n\tprivate:\n\t\t//! Setup the header\n\t\tvoid _setup(Image* image) {\n\t\t\tm_Image = image;\n\t\t\tm_PEHdr = reinterpret_cast(m_Image->base() + m_Image->m_MZHeader->e_lfanew);\n\t\t\tm_FileHeader._setup(image);\n\t\t\tm_OptionalHeader._setup(image);\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/PELibrary.hpp", "content": "#pragma once\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"misc/File.hpp\"\n#include \"misc/NonCopyable.hpp\"\n#include \"misc/ByteVector.hpp\"\n#include \"misc/Concept.hpp\"\n#include \"misc/Address.hpp\"\n\n#include \"Image.hpp\"\n#include \"PEHeader.hpp\"\n#include \"SectionHeader.hpp\"\n#include \"FileHeader.hpp\"\n#include \"OptionalHeader.hpp\"\n#include \"ExportDirectory.hpp\"\n#include \"ImportDirectory.hpp\"\n#include \"RelocationDirectory.hpp\"\n#include \"PEUtil.hpp\"\n\n" }, { "path": "vendor/pepp/PEUtil.cpp", "content": "#include \"PELibrary.hpp\"\n\n#include \n#pragma comment(lib, \"dbghelp.lib\")\n\nusing namespace pepp;\n\nstd::string pepp::DemangleName(std::string_view mangled_name)\n{\n //\n // TODO: Don't rely on DbgHelp??\n char undecorated_name[1024];\n UnDecorateSymbolName(\n mangled_name.data(),\n undecorated_name,\n sizeof undecorated_name,\n UNDNAME_32_BIT_DECODE | UNDNAME_NAME_ONLY);\n \n return undecorated_name;\n}\n\n" }, { "path": "vendor/pepp/PEUtil.hpp", "content": "#pragma once\n\n\nnamespace pepp\n{\n\t//! Windows 32/64bit declare the page size as 4kb (4096)\n\tstatic constexpr std::uint32_t PAGE_SIZE = 0x1000;\n\n\t//! Align a value\n\ttemplate\n\tconstexpr __forceinline auto Align(V_t value, std::uint32_t alignment) requires std::unsigned_integral\n\t{\n\t\tif (alignment == 0)\n\t\t\treturn value;\n\t\treturn ((value + alignment) & ~(alignment - 1));\n\t}\n\n\t//! Make a value 4kb aligned (for section purposes)\n\ttemplate\n\tconstexpr __forceinline auto Align4kb(V_t v) requires std::unsigned_integral\n\t{\n\t\treturn Align(v, PAGE_SIZE);\n\t}\n\n\t//! Demangle a mangled name (MS supplied)\n\tstd::string DemangleName(std::string_view mangled_name);\n}" }, { "path": "vendor/pepp/RelocationDirectory.cpp", "content": "#include \"PELibrary.hpp\"\n\nusing namespace pepp;\n\n// Explicit templates.\ntemplate class RelocationDirectory<32>;\ntemplate class RelocationDirectory<64>;\n\ntemplate\nint RelocationDirectory::GetNumberOfBlocks() const\n{\n\tauto base = m_base;\n\tint count = 0;\n\n\twhile (base->VirtualAddress)\n\t{\n\t\tcount++;\n\t\tbase = decltype(base)((char*)base + base->SizeOfBlock);\n\t}\n\n\treturn count;\n}\n\ntemplate\nint RelocationDirectory::GetNumberOfEntries(detail::Image_t<>::RelocationBase_t* reloc) const\n{\n\t// MSDN: The Block Size field is then followed by any number of Type or Offset field entries.\n\t// Each entry is a WORD (2 bytes)\n\treturn (reloc->SizeOfBlock - sizeof(decltype(*reloc))) / sizeof(std::uint16_t);\n}\n\ntemplate\nstd::uint32_t RelocationDirectory::GetRemainingFreeBytes() const\n{\n\tauto base = m_base;\n\tstd::uint32_t count = 0;\n\n\twhile (base->VirtualAddress)\n\t{\n\t\tcount += base->SizeOfBlock;\n\t\tbase = decltype(base)((char*)base + base->SizeOfBlock);\n\t}\n\n\treturn std::max(m_section->GetVirtualSize() - count, 0);\n}\n\ntemplate\nbool pepp::RelocationDirectory::ChangeRelocationType(std::uint32_t rva, RelocationType type)\n{\n\tauto base = m_base;\n\tstd::vector entries;\n\n\twhile (base->VirtualAddress)\n\t{\n\t\tint numEntries = GetNumberOfEntries(base);\n\t\tstd::uint16_t* entry = (std::uint16_t*)(base + 1);\n\n\t\tfor (int i = 0; i != numEntries; i++, entry++)\n\t\t{\n\t\t\tBlockEntry block(base->VirtualAddress, *entry);\n\t\t\tif (block.GetRva() == rva)\n\t\t\t{\n\t\t\t\t*entry = CraftRelocationBlockEntry(type, block.GetOffset());\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\tbase = decltype(base)((char*)base + base->SizeOfBlock);\n\t}\n\n\treturn false;\n}\n\ntemplate\nstd::vector RelocationDirectory::GetBlockEntries(int blockIdx)\n{\n\tauto base = m_base;\n\tint count = 0;\n\tstd::vector entries;\n\n\twhile (base->VirtualAddress)\n\t{\n\t\tif (count == blockIdx)\n\t\t{\n\t\t\tint numEntries = GetNumberOfEntries(base);\n\t\t\tstd::uint16_t* entry = (std::uint16_t*)(base + 1);\n\n\t\t\tfor (int i = 0; i != numEntries; i++, entry++)\n\t\t\t{\n\t\t\t\tentries.emplace_back(base->VirtualAddress, *entry);\n\t\t\t}\n\t\t}\n\n\t\tbase = decltype(base)((char*)base + base->SizeOfBlock);\n\t\tcount++;\n\t}\n\n\treturn entries;\n}\n\ntemplate\nBlockStream RelocationDirectory::CreateBlock(std::uint32_t rva, std::uint32_t num_entries)\n{\n\tstd::uint32_t size = sizeof(detail::Image_t<>::RelocationBase_t) + num_entries * sizeof(std::uint16_t);\n\n\tdetail::Image_t<>::RelocationBase_t* reloc;\n\n\tstd::uint32_t remaining_bytes = GetRemainingFreeBytes();\n\tif (remaining_bytes < size)\n\t{\n\t\tassert(m_image->ExtendSection(m_section->GetName(), size - remaining_bytes));\n\t}\n\n\tauto base = m_base;\n\tint count = 0;\n\n\twhile (base->VirtualAddress)\n\t{\n\t\tbase = decltype(base)((char*)base + base->SizeOfBlock);\n\t}\n\n\tbase->VirtualAddress = rva;\n\tbase->SizeOfBlock = size;\n\n\treturn BlockStream(base);\n}" }, { "path": "vendor/pepp/RelocationDirectory.hpp", "content": "#pragma once\n\nnamespace pepp\n{\n\t/*\n\t* Relocations: research32.blogspot.com/2015/01/base-relocation-table.html\n\t* Format looks like\n\t* 00 10 00 00\t\t| RVA of Block\n\t* 28 01 00 00\t\t| Size of Block\n\t* ?? ?? ?? ?? .....\t| Entries in block\n\t* (entry count = (reloc->SizeOfBlock - sizeof(IMAGE_BASE_RELOC)) / sizeof(WORD))\n\t*/\n\tenum RelocationType : std::int8_t\n\t{\n\t\tREL_BASED_ABSOLUTE = 0,\n\t\tREL_BASED_HIGH = 1,\n\t\tREL_BASED_LOW = 2,\n\t\tREL_BASED_HIGHLOW = 3,\n\t\tREL_BASED_HIGHADJ = 4,\n\t\tREL_BASED_MACHINE_SPECIFIC_5 = 5,\n\t\tREL_BASED_RESERVED = 6,\n\t\tREL_BASED_MACHINE_SPECIFIC_7 = 7,\n\t\tREL_BASED_MACHINE_SPECIFIC_8 = 8,\n\t\tREL_BASED_MACHINE_SPECIFIC_9 = 9,\n\t\tREL_BASED_DIR64 = 10\n\t};\n\n\tconstexpr std::uint16_t CraftRelocationBlockEntry(RelocationType type, std::uint16_t offset) noexcept {\n\t\treturn (offset & 0xfff) | (type << 12);\n\t}\n\n\tclass BlockEntry\n\t{\n\t\tstd::uint32_t m_va;\n\t\tstd::uint16_t m_entry;\n\tpublic:\n\t\tBlockEntry(std::uint32_t va, std::uint16_t entry)\n\t\t\t: m_va(va)\n\t\t\t, m_entry(entry)\n\t\t{\n\t\t}\n\n\t\tRelocationType GetType() const\n\t\t{\n\t\t\treturn static_cast(m_entry >> 12);\n\t\t}\n\n\t\tstd::uint32_t GetOffset() const\n\t\t{\n\t\t\t// Single out the last 12 bits of the entry\n\t\t\treturn static_cast(m_entry & ((1 << 12) - 1));\n\t\t}\n\n\t\tstd::uint32_t GetRva() const\n\t\t{\n\t\t\treturn m_va + GetOffset();\n\t\t}\n\n\t\tconstexpr operator std::uint16_t() const\n\t\t{\n\t\t\treturn m_entry;\n\t\t}\n\t};\n\n\tclass BlockStream\n\t{\n\t\tstd::uint16_t*\t\t\t\t\t\t m_base;\n\t\tstd::uint32_t\t\t\t\t\t m_idx;\n\t\tstd::uint32_t\t\t\t\t\t\t m_max_size;\n\tpublic:\n\t\tBlockStream(detail::Image_t<>::RelocationBase_t* reloc)\n\t\t\t: m_base((std::uint16_t*)(reloc+1))\n\t\t\t, m_idx(0)\n\t\t\t, m_max_size(reloc->SizeOfBlock)\n\t\t{\n\t\t}\n\n\t\tvoid Push(RelocationType type, std::uint16_t offset)\n\t\t{\n\t\t\tif (m_idx * sizeof(uint16_t) >= m_max_size)\n\t\t\t\treturn;\n\n\t\t\tm_base[m_idx++] = CraftRelocationBlockEntry(type, offset);\n\t\t}\n\t};\n\n\ttemplate\n\tclass RelocationDirectory : pepp::msc::NonCopyable\n\t{\n\t\tfriend class Image<32>;\n\t\tfriend class Image<64>;\n\n\t\tusing PatchType_t = typename detail::Image_t::Address_t;\n\n\t\tImage*\t\t\t\t\t\t\tm_image;\n\t\tdetail::Image_t<>::RelocationBase_t*\tm_base;\n\t\tSectionHeader*\t\t\t\t\t\t\tm_section;\n\tpublic:\n\n\t\tint\t\t\tGetNumberOfBlocks() const;\n\t\tint\t\t\tGetNumberOfEntries(detail::Image_t<>::RelocationBase_t* reloc) const;\n\t\tstd::uint32_t\tGetRemainingFreeBytes() const;\n\t\tbool\t\t\tChangeRelocationType(std::uint32_t rva, RelocationType type);\n\t\tstd::vector GetBlockEntries(int blockIdx);\n\t\tBlockStream CreateBlock(std::uint32_t rva, std::uint32_t num_entries);\n\n\t\tbool IsPresent() const {\n\t\t\treturn m_image->GetPEHeader().GetOptionalHeader().GetDataDirectory(DIRECTORY_ENTRY_BASERELOC).Size > 0;\n\t\t}\n\tprivate:\n\t\t//! Setup the directory\n\t\tvoid _setup(Image* image) {\n\t\t\tm_image = image;\n\t\t\tm_base = reinterpret_cast(\n\t\t\t\t&image->base()[image->GetPEHeader().RvaToOffset(\n\t\t\t\t\timage->GetPEHeader().GetOptionalHeader().GetDataDirectory(DIRECTORY_ENTRY_BASERELOC).VirtualAddress)]);\n\t\t\tm_section = \n\t\t\t\t&image->GetSectionHeaderFromVa(image->GetPEHeader().GetOptionalHeader().GetDataDirectory(DIRECTORY_ENTRY_BASERELOC).VirtualAddress);\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/SectionHeader.cpp", "content": "#include \"PELibrary.hpp\"\n\nusing namespace pepp;\n\nvoid SectionHeader::SetName(std::string_view name)\n{\n\tstd:memcpy(m_base.Name, name.data(), name.size());\n}\n\nstd::string SectionHeader::GetName() const\n{\n\tchar szData[9];\n\tstd::memcpy(szData, m_base.Name, sizeof m_base.Name);\n\tszData[8] = '\\0';\n\treturn szData;\n}\n\nstd::uint32_t SectionHeader::GetFileAddress() const\n{\n\treturn m_base.Misc.PhysicalAddress;\n}\n\nvoid SectionHeader::SetFileAddress(std::uint32_t fileAddress)\n{\n\tm_base.Misc.PhysicalAddress = fileAddress;\n}\n\nstd::uint32_t SectionHeader::GetVirtualSize() const\n{\n\treturn m_base.Misc.VirtualSize;\n}\n\nvoid SectionHeader::SetVirtualSize(std::uint32_t virtualSize)\n{\n\tm_base.Misc.VirtualSize = virtualSize;\n}\n\nstd::uint32_t SectionHeader::GetVirtualAddress() const\n{\n\treturn m_base.VirtualAddress;\n}\n\nvoid SectionHeader::SetVirtualAddress(std::uint32_t va)\n{\n\tm_base.VirtualAddress = va;\n}\n\nstd::uint32_t SectionHeader::GetSizeOfRawData() const\n{\n\treturn m_base.SizeOfRawData;\n}\n\nvoid SectionHeader::SetSizeOfRawData(std::uint32_t sz)\n{\n\tm_base.SizeOfRawData = sz;\n}\n\nstd::uint32_t SectionHeader::GetPointerToRawData() const\n{\n\treturn m_base.PointerToRawData;\n}\n\nvoid SectionHeader::SetPointerToRawData(std::uint32_t ptr)\n{\n\tm_base.PointerToRawData = ptr;\n}\n\nstd::uint32_t SectionHeader::GetPointerToRelocations() const\n{\n\treturn m_base.PointerToRelocations;\n}\n\nvoid SectionHeader::SetPointerToRelocations(std::uint32_t ptr)\n{\n\tm_base.PointerToRelocations = ptr;\n}\n\nstd::uint32_t SectionHeader::GetPointerToLinenumbers() const\n{\n\treturn m_base.PointerToLinenumbers;\n}\n\nvoid SectionHeader::SetPointerToLinenumbers(std::uint32_t ptr)\n{\n\tm_base.PointerToLinenumbers = ptr;\n}\n\nstd::uint16_t SectionHeader::GetNumberOfRelocations() const\n{\n\treturn m_base.NumberOfRelocations;\n}\n\nvoid SectionHeader::SetNumberOfRelocations(std::uint16_t num)\n{\n\tm_base.NumberOfRelocations = num;\n}\n\nstd::uint16_t SectionHeader::GetNumberOfLinenumbers() const\n{\n\treturn m_base.NumberOfLinenumbers;\n}\n\nvoid SectionHeader::SetNumberOfLinenumbers(std::uint16_t num)\n{\n\tm_base.NumberOfLinenumbers = num;\n}\n\nstd::uint32_t SectionHeader::GetCharacteristics() const\n{\n\treturn m_base.Characteristics;\n}\n\nvoid SectionHeader::SetCharacteristics(std::uint32_t chars)\n{\n\tm_base.Characteristics = chars;\n}\n" }, { "path": "vendor/pepp/SectionHeader.hpp", "content": "#pragma once\n\nnamespace pepp\n{\n\ttemplate\n\tclass Image;\n\n\tenum SectionCharacteristics : std::uint32_t\n\t{\n SCN_TYPE_NO_PAD = 0x00000008, // Reserved.\n SCN_CNT_CODE = 0x00000020, // Section contains code.\n SCN_CNT_INITIALIZED_DATA = 0x00000040, // Section contains initialized data.\n SCN_CNT_UNINITIALIZED_DATA = 0x00000080, // Section contains uninitialized data.\n SCN_LNK_OTHER\t\t\t\t = 0x00000100, // Reserved.\n SCN_LNK_INFO = 0x00000200, // Section contains comments or some other type of information.\n SCN_LNK_REMOVE = 0x00000800, // Section contents will not become part of image.\n SCN_LNK_COMDAT = 0x00001000, // Section contents comdat.\n SCN_NO_DEFER_SPEC_EXC = 0x00004000, // Reset speculative exceptions handling bits in the TLB entries for this section.\n SCN_GPREL = 0x00008000, // Section content can be accessed relative to GP\n SCN_MEM_FARDATA = 0x00008000,\n SCN_MEM_PURGEABLE = 0x00020000,\n SCN_MEM_16BIT = 0x00020000,\n SCN_MEM_LOCKED = 0x00040000,\n SCN_MEM_PRELOAD = 0x00080000,\n SCN_ALIGN_1BYTES = 0x00100000, //\n SCN_ALIGN_2BYTES = 0x00200000, //\n SCN_ALIGN_4BYTES = 0x00300000, //\n SCN_ALIGN_8BYTES = 0x00400000, //\n SCN_ALIGN_16BYTES = 0x00500000, // Default alignment if no others are specified.\n SCN_ALIGN_32BYTES = 0x00600000, //\n SCN_ALIGN_64BYTES = 0x00700000, //\n SCN_ALIGN_128BYTES = 0x00800000, //\n SCN_ALIGN_256BYTES = 0x00900000, //\n SCN_ALIGN_512BYTES = 0x00A00000, //\n SCN_ALIGN_1024BYTES = 0x00B00000, //\n SCN_ALIGN_2048BYTES = 0x00C00000, //\n SCN_ALIGN_4096BYTES = 0x00D00000, //\n SCN_ALIGN_8192BYTES = 0x00E00000, //\n SCN_ALIGN_MASK = 0x00F00000,\n SCN_LNK_NRELOC_OVFL = 0x01000000, // Section contains extended relocations.\n SCN_MEM_DISCARDABLE = 0x02000000, // Section can be discarded.\n SCN_MEM_NOT_CACHED = 0x04000000, // Section is not cachable.\n SCN_MEM_NOT_PAGED = 0x08000000, // Section is not pageable.\n SCN_MEM_SHARED = 0x10000000, // Section is shareable.\n SCN_MEM_EXECUTE = 0x20000000, // Section is executable.\n SCN_MEM_READ = 0x40000000, // Section is readable.\n SCN_MEM_WRITE = 0x80000000 // Section is writeable.\n\t};\n\n\tclass SectionHeader\n\t{\n\t\tfriend class Image<32>;\n\t\tfriend class Image<64>;\n\t\t \n\t\tdetail::Image_t<>::SectionHeader_t m_base;\n\tpublic:\n\t\tSectionHeader() {\n\t\t\tmemcpy(m_base.Name, \".dummy\", sizeof(\".dummy\"));\n\t\t}\n\n\t\t//! Getter/setter for SectionHeader.Name\n\t\tvoid SetName(std::string_view name);\n\t\tstd::string GetName() const;\n\n\t\t//! Getter/setters for SectionHeader.Misc\n\t\tstd::uint32_t GetFileAddress() const;\n\t\tvoid SetFileAddress(std::uint32_t fileAddress);\n\n\t\tstd::uint32_t GetVirtualSize() const;\n\t\tvoid SetVirtualSize(std::uint32_t virtualSize);\n\n\t\t//! Getter/setter for VirtualAddress\n\t\tstd::uint32_t GetVirtualAddress() const;\n\t\tvoid SetVirtualAddress(std::uint32_t va);\n\n\t\t//! Getter/setter for SizeOfRawData\n\t\tstd::uint32_t GetSizeOfRawData() const;\n\t\tvoid SetSizeOfRawData(std::uint32_t sz);\n\t\t \n\t\t//! Getter/setter for SizeOfRawData\n\t\tstd::uint32_t GetPointerToRawData() const;\n\t\tvoid SetPointerToRawData(std::uint32_t ptr);\n\n\t\t//! Getter/setter for PointerToRelocations\n\t\tstd::uint32_t GetPointerToRelocations() const;\n\t\tvoid SetPointerToRelocations(std::uint32_t ptr);\n\n\t\t//! Getter/setter for PointerToLinenumbers\n\t\tstd::uint32_t GetPointerToLinenumbers() const;\n\t\tvoid SetPointerToLinenumbers(std::uint32_t ptr);\n\t\t\n\t\t//! Getter/setter for NumberOfRelocations\n\t\tstd::uint16_t GetNumberOfRelocations() const;\n\t\tvoid SetNumberOfRelocations(std::uint16_t num);\n\t\t\n\t\t//! Getter/setter for \n\t\tstd::uint16_t GetNumberOfLinenumbers() const;\n\t\tvoid SetNumberOfLinenumbers(std::uint16_t num);\n\n\t\t//! Getter/setter for \n\t\tstd::uint32_t GetCharacteristics() const;\n\t\tvoid SetCharacteristics(std::uint32_t chars);\n\n\n\t\t// Section utility functions\n\t\tvoid AddCharacteristic(std::uint32_t dwChar) {\n\t\t\tm_base.Characteristics |= dwChar;\n\t\t}\n\t\tvoid StripCharacteristic(std::uint32_t dwChar) {\n\t\t\tm_base.Characteristics &= ~dwChar;\n\t\t} \n\t\tbool IsReadable() const {\n\t\t\treturn GetCharacteristics() & SCN_MEM_READ;\n\t\t}\n\t\tbool IsWriteable() const {\n\t\t\treturn GetCharacteristics() & SCN_MEM_WRITE;\n\t\t}\n\t\tbool IsExecutable() const {\n\t\t\treturn GetCharacteristics() & SCN_MEM_EXECUTE;\n\t\t}\n\t\tbool HasVirtualAddress(std::uint32_t va) const {\n\t\t\treturn va >= m_base.VirtualAddress && va < m_base.VirtualAddress + m_base.Misc.VirtualSize;\n\t\t}\n\t\tbool HasOffset(std::uint32_t offset) const {\n\t\t\treturn offset >= m_base.PointerToRawData && offset < m_base.PointerToRawData + m_base.SizeOfRawData;\n\t\t}\n\t};\n\n\tstatic_assert(sizeof(SectionHeader) == sizeof(detail::Image_t<>::SectionHeader_t), \"Invalid size of SectionHeader\");\n}" }, { "path": "vendor/pepp/misc/Address.hpp", "content": "#pragma once\n\n\n#include \"Concept.hpp\"\n\nnamespace pepp {\n\ttemplate\n\tclass Address\n\t{\n\t\tValueType\tm_address;\n\tpublic:\n\t\ttemplate\n\t\tconstexpr Address(T value = 0) noexcept requires pepp::msc::MemoryAddress\n\t\t\t: m_address((ValueType)(value))\n\t\t{\n\t\t}\n\n\t\tconstexpr Address(const Address& rhs) = default;\n\t\t~Address() = default;\n\n\t\tAddress& operator=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address = rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\n\t\tconstexpr explicit operator std::uintptr_t() const noexcept\n\t\t{\n\t\t\treturn m_address;\n\t\t}\n\n\t\tconstexpr ValueType uintptr() const noexcept\n\t\t{\n\t\t\treturn m_address;\n\t\t}\n\n\t\ttemplate\n\t\tC* as_ptr() noexcept requires pepp::msc::MemoryAddress\n\t\t{\n\t\t\treturn reinterpret_cast(m_address);\n\t\t}\n\n\t\ttemplate\n\t\tC as() noexcept\n\t\t{\n\t\t\treturn (C)m_address;\n\t\t}\n\n\t\ttemplate\n\t\tC& deref() noexcept\n\t\t{\n\t\t\treturn *reinterpret_cast(m_address);\n\t\t}\n\n\n\t\t/*\n\t\t*! Comparison operators\n\t\t*/\n\t\tconstexpr bool operator==(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address == rhs.m_address;\n\t\t}\n\n\t\tconstexpr bool operator!=(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address != rhs.m_address;\n\t\t}\n\n\t\tconstexpr bool operator>=(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address >= rhs.m_address;\n\t\t}\n\n\t\tconstexpr bool operator<=(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address <= rhs.m_address;\n\t\t}\n\n\t\tconstexpr bool operator>(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address > rhs.m_address;\n\t\t}\n\n\t\tconstexpr bool operator<(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address < rhs.m_address;\n\t\t}\n\n\t\t/*\n\t\t/! Arithmetic operators\n\t\t*/\n\n\n\t\tconstexpr Address operator+(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address + rhs.m_address;\n\t\t}\n\n\t\tconstexpr Address operator-(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address - rhs.m_address;\n\t\t}\n\n\t\tconstexpr Address operator*(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address * rhs.m_address;\n\t\t}\n\n\t\tconstexpr Address operator/(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address / rhs.m_address;\n\t\t}\n\n\t\t/*\n\t\t/!\n\t\t*/\n\n\t\tconstexpr Address& operator+=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address += rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\n\t\tconstexpr Address& operator-=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address -= rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\n\t\tconstexpr Address& operator*=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address *= rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\n\n\t\t/*\n\t\t/! Bitwise operators\n\t\t*/\n\n\t\tconstexpr Address operator>>(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address >> rhs.m_address;\n\t\t}\n\n\t\tconstexpr Address operator<<(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address << rhs.m_address;\n\t\t}\n\n\t\tconstexpr Address operator^(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address ^ rhs.m_address;\n\t\t}\n\n\t\tconstexpr Address operator&(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address & rhs.m_address;\n\t\t}\n\n\t\tconstexpr Address operator|(const Address& rhs) const noexcept\n\t\t{\n\t\t\treturn m_address | rhs.m_address;\n\t\t}\n\n\t\t/*\n\t\t/!\n\t\t*/\n\n\t\tconstexpr Address& operator>>=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address >>= rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\n\t\tconstexpr Address& operator<<=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address <<= rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\n\t\tconstexpr Address& operator^=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address ^= rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\n\t\tconstexpr Address& operator&=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address &= rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\n\t\tconstexpr Address& operator|=(const Address& rhs) noexcept\n\t\t{\n\t\t\tm_address |= rhs.m_address;\n\t\t\treturn *this;\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/misc/ByteVector.hpp", "content": "#pragma once\n\n#include \n\nnamespace pepp::mem {\n\tclass ByteVector : public std::vector\n\t{\n\tpublic:\n\t\t//\n\t\t//! Used for pushing a single byte.\n\t\t//! Example: push(0x55)\n\t\t//\n\t\tconstexpr ByteVector& push_byte(std::uint8_t byte) {\n\t\t\tpush_back(byte);\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Used for pushing raw data\n\t\t//! Example: push_raw(data, size)\n\t\t//\n\t\ttemplate\n\t\tconstexpr ByteVector& push_raw(const T* data, std::size_t rsize) {\n\t\t\tresize(size() + rsize);\n\t\t\tmemcpy(&(*this)[size() - rsize], data, rsize);\n\t\t\treturn *this;\n\t\t}\n \n\t\t//\n\t\t//! Used for pushing a container.\n\t\t//! Example: push_container(array/vector/etc)\n\t\t//\n\t\ttemplate\n\t\tconstexpr ByteVector& push_container(const T& container) {\n\t\t\tfor (auto c : container)\n\t\t\t\tpush_back(static_cast(c));\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Used for pushing a raw array.\n\t\t//! Example: push_array({0x55, 0x8b, 0xec})\n\t\t//\n\t\ttemplate\n\t\tconstexpr ByteVector& push_array(const std::initializer_list& list) requires std::convertible_to {\n\t\t\tfor (auto c : list)\n\t\t\t\tpush_back(static_cast(c));\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Used for pushing a iterator range.\n\t\t//! Example: push_range(c.begin(), c.end())\n\t\t//\n\t\ttemplate\n\t\tconstexpr ByteVector& push_range(iterator_t first, iterator_t last) {\n\t\t\twhile (first != last) {\n\t\t\t\tpush_back(static_cast(*first));\n\t\t\t\tfirst++;\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Used for pushing arguments.\n\t\t//! Example: push_args(0x55, 0x8b, 0xec)\n\t\t// \n\t\tconstexpr ByteVector& push_args(std::convertible_to auto... args) {\n\t\t\tfor (auto arg : { args... })\n\t\t\t\tpush_back(static_cast(arg));\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Push a double dword\n\t\t//! Example: push_dword(0xdeadbeef) ..\n\t\t//\n\t\tconstexpr ByteVector& push_dword(std::uint32_t dword) {\n\t\t\tpush_back(static_cast(dword & 0xFF));\n\t\t\tpush_back(static_cast((dword >> 8) & 0xFF));\n\t\t\tpush_back(static_cast((dword >> 16) & 0xFF));\n\t\t\tpush_back(static_cast((dword >> 24) & 0xFF));\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Push a quad word\n\t\t//! Example: push_qword(0x1122334411223344) ..\n\t\t//\n\t\tconstexpr ByteVector& push_qword(std::uint64_t qword) {\n\t\t\tpush_back(static_cast(qword & 0xFF));\n\t\t\tpush_back(static_cast((qword >> 8) & 0xFF));\n\t\t\tpush_back(static_cast((qword >> 16) & 0xFF));\n\t\t\tpush_back(static_cast((qword >> 24) & 0xFF));\n\t\t\tpush_back(static_cast((qword >> 32) & 0xFF));\n\t\t\tpush_back(static_cast((qword >> 40) & 0xFF));\n\t\t\tpush_back(static_cast((qword >> 48) & 0xFF));\n\t\t\tpush_back(static_cast((qword >> 56) & 0xFF));\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Copy in data at specified index\n\t\t//! Example: copy_data(0, data, size)\n\t\t//\n\t\ttemplate\n\t\tByteVector& copy_data(std::size_t idx, const T* data, std::size_t rsize) {\n\t\t\tif (size() > idx) {\n\t\t\t\tstd::memcpy(&(*this)[idx], data, rsize);\n\t\t\t}\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Add/insert in data at specified index\n\t\t//! Example: insert_data(0, data, size)\n\t\t//\n\t\ttemplate\n\t\tByteVector& insert_data(std::size_t idx, const T* data, std::size_t rsize) {\n\t\t\tif (size() <= idx)\n\t\t\t\tresize(idx);\n\t\t\tinsert(begin() + idx, rsize, 0x0);\n\t\t\tmemcpy(&(*this)[idx], data, rsize);\n\t\t\treturn *this;\n\t\t}\n\n\t\t//\n\t\t//! Interpret data as T\n\t\t//! Example: as(0x0/)\n\t\t//\n\t\ttemplate\n\t\tT as(std::size_t idx = 0x0) const {\n\t\t\treturn (T)(&at(idx));\n\t\t}\n\t\ttemplate\n\t\tT as(std::size_t idx = 0x0) {\n\t\t\treturn (T)(&at(idx));\n\t\t}\n\n\t\t//\n\t\t//! Dereference bytes as T\n\t\t//! Example: deref(0x0/)\n\t\t//\n\t\ttemplate\n\t\tT deref(std::size_t idx = 0x0) const {\n\t\t\treturn *(T*)(&at(idx));\n\t\t}\n\t};\n}" }, { "path": "vendor/pepp/misc/Concept.hpp", "content": "#pragma once\n\n#include \n\nnamespace pepp::msc\n{\n\ttemplate \n\tconcept Arithmetic = std::is_arithmetic_v;\n\ttemplate \n\tconcept MemoryAddress = std::is_integral_v || std::is_pointer_v;\n}" }, { "path": "vendor/pepp/misc/File.cpp", "content": "#include \n#include \n#include \n#include \n#include \n#include \"File.hpp\"\n\nnamespace pepp::io {\n\n\tFile::File(std::string_view filename, int flags)\n\t\t: m_filename(filename)\n\t\t, m_flags(flags)\n\t{\n\t}\n\n\tFile::File(File&& other)\n\t\t: m_filename(std::move(other.m_filename))\n\t\t, m_flags(other.m_flags)\n\t{\n\t}\n\n\tvoid File::Write(std::string_view text)\n\t{\n\t\tm_out_file.open(m_filename, m_flags & ~FILE_INPUT);\n\t\tif (m_out_file.is_open()) {\n\t\t\tm_out_file << text;\n\t\t\tm_out_file.close();\n\t\t}\n\t}\n\n\tvoid File::Write(const std::vector& data)\n\t{\n\t\tm_out_file.open(m_filename, m_flags & ~FILE_INPUT);\n\t\tif (m_out_file.is_open()) {\n\t\t\tm_out_file.write((const char*)data.data(), data.size());\n\t\t\tm_out_file.close();\n\t\t}\n\t}\n\n\tstd::vector File::Read()\n\t{\n\t\tstd::vector file_buffer;\n\n\t\tm_in_file.open(m_filename, m_flags & ~FILE_OUTPUT);\n\n\t\tif (m_in_file.is_open()) {\n\t\t\tfile_buffer = std::vector(std::istreambuf_iterator(m_in_file), {});\n\t\t\tm_in_file.close();\n\t\t}\n\n\t\treturn file_buffer;\n\t}\n\n\tstd::uintmax_t File::GetSize()\n\t{\n\t\treturn std::filesystem::file_size(m_filename);\n\t}\n\n\tFile& io::File::operator=(File&& rhs)\n\t{\n\t\tif (this == &rhs)\n\t\t\treturn *this;\n\n\t\tstd::swap(m_filename, rhs.m_filename);\n\t\tstd::swap(m_flags, rhs.m_flags);\n\t\treturn *this;\n\t}\n\n}\n\n\n" }, { "path": "vendor/pepp/misc/File.hpp", "content": "#pragma once\n\n#include \n\nnamespace pepp::io\n{\n enum FileFlags {\n FILE_INPUT = 1,\n FILE_OUTPUT = 2,\n FILE_APP = 8,\n FILE_TRUNC = 16,\n FILE_BINARY = 32\n };\n\n class File {\n public:\n File() = default;\n File(const File& other) = default;\n\n File(std::string_view filename, int flags);\n File(File&& other);\n\n void Write(std::string_view text);\n void Write(const std::vector& data);\n std::vector Read();\n std::uintmax_t GetSize();\n\n File& operator=(File&& rhs);\n\n private:\n std::string m_filename;\n int m_flags;\n std::ofstream m_out_file;\n std::ifstream m_in_file;\n };\n}" }, { "path": "vendor/pepp/misc/NonCopyable.hpp", "content": "#pragma once\n\nnamespace pepp::msc\n{\n class NonCopyable {\n public:\n NonCopyable() = default;\n NonCopyable(const NonCopyable&) = delete;\n NonCopyable& operator=(const NonCopyable&) = delete;\n };\n}" }, { "path": "vendor/spdlog/include/spdlog/async.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n//\n// Async logging using global thread pool\n// All loggers created here share same global thread pool.\n// Each log message is pushed to a queue along with a shared pointer to the\n// logger.\n// If a logger deleted while having pending messages in the queue, it's actual\n// destruction will defer\n// until all its messages are processed by the thread pool.\n// This is because each message in the queue holds a shared_ptr to the\n// originating logger.\n\n#include \n#include \n#include \n\n#include \n#include \n#include \n\nnamespace spdlog {\n\nnamespace details {\nstatic const size_t default_async_q_size = 8192;\n}\n\n// async logger factory - creates async loggers backed with thread pool.\n// if a global thread pool doesn't already exist, create it with default queue\n// size of 8192 items and single thread.\ntemplate\nstruct async_factory_impl\n{\n template\n static std::shared_ptr create(std::string logger_name, SinkArgs &&...args)\n {\n auto ®istry_inst = details::registry::instance();\n\n // create global thread pool if not already exists..\n\n auto &mutex = registry_inst.tp_mutex();\n std::lock_guard tp_lock(mutex);\n auto tp = registry_inst.get_tp();\n if (tp == nullptr)\n {\n tp = std::make_shared(details::default_async_q_size, 1U);\n registry_inst.set_tp(tp);\n }\n\n auto sink = std::make_shared(std::forward(args)...);\n auto new_logger = std::make_shared(std::move(logger_name), std::move(sink), std::move(tp), OverflowPolicy);\n registry_inst.initialize_logger(new_logger);\n return new_logger;\n }\n};\n\nusing async_factory = async_factory_impl;\nusing async_factory_nonblock = async_factory_impl;\n\ntemplate\ninline std::shared_ptr create_async(std::string logger_name, SinkArgs &&...sink_args)\n{\n return async_factory::create(std::move(logger_name), std::forward(sink_args)...);\n}\n\ntemplate\ninline std::shared_ptr create_async_nb(std::string logger_name, SinkArgs &&...sink_args)\n{\n return async_factory_nonblock::create(std::move(logger_name), std::forward(sink_args)...);\n}\n\n// set global thread pool.\ninline void init_thread_pool(size_t q_size, size_t thread_count, std::function on_thread_start)\n{\n auto tp = std::make_shared(q_size, thread_count, on_thread_start);\n details::registry::instance().set_tp(std::move(tp));\n}\n\n// set global thread pool.\ninline void init_thread_pool(size_t q_size, size_t thread_count)\n{\n init_thread_pool(q_size, thread_count, [] {});\n}\n\n// get the global thread pool.\ninline std::shared_ptr thread_pool()\n{\n return details::registry::instance().get_tp();\n}\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/async_logger-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\n#include \n#include \n\n#include \n#include \n\nSPDLOG_INLINE spdlog::async_logger::async_logger(\n std::string logger_name, sinks_init_list sinks_list, std::weak_ptr tp, async_overflow_policy overflow_policy)\n : async_logger(std::move(logger_name), sinks_list.begin(), sinks_list.end(), std::move(tp), overflow_policy)\n{}\n\nSPDLOG_INLINE spdlog::async_logger::async_logger(\n std::string logger_name, sink_ptr single_sink, std::weak_ptr tp, async_overflow_policy overflow_policy)\n : async_logger(std::move(logger_name), {std::move(single_sink)}, std::move(tp), overflow_policy)\n{}\n\n// send the log message to the thread pool\nSPDLOG_INLINE void spdlog::async_logger::sink_it_(const details::log_msg &msg)\n{\n if (auto pool_ptr = thread_pool_.lock())\n {\n pool_ptr->post_log(shared_from_this(), msg, overflow_policy_);\n }\n else\n {\n throw_spdlog_ex(\"async log: thread pool doesn't exist anymore\");\n }\n}\n\n// send flush request to the thread pool\nSPDLOG_INLINE void spdlog::async_logger::flush_()\n{\n if (auto pool_ptr = thread_pool_.lock())\n {\n pool_ptr->post_flush(shared_from_this(), overflow_policy_);\n }\n else\n {\n throw_spdlog_ex(\"async flush: thread pool doesn't exist anymore\");\n }\n}\n\n//\n// backend functions - called from the thread pool to do the actual job\n//\nSPDLOG_INLINE void spdlog::async_logger::backend_sink_it_(const details::log_msg &msg)\n{\n for (auto &sink : sinks_)\n {\n if (sink->should_log(msg.level))\n {\n SPDLOG_TRY\n {\n sink->log(msg);\n }\n SPDLOG_LOGGER_CATCH()\n }\n }\n\n if (should_flush_(msg))\n {\n backend_flush_();\n }\n}\n\nSPDLOG_INLINE void spdlog::async_logger::backend_flush_()\n{\n for (auto &sink : sinks_)\n {\n SPDLOG_TRY\n {\n sink->flush();\n }\n SPDLOG_LOGGER_CATCH()\n }\n}\n\nSPDLOG_INLINE std::shared_ptr spdlog::async_logger::clone(std::string new_name)\n{\n auto cloned = std::make_shared(*this);\n cloned->name_ = std::move(new_name);\n return cloned;\n}\n" }, { "path": "vendor/spdlog/include/spdlog/async_logger.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n// Fast asynchronous logger.\n// Uses pre allocated queue.\n// Creates a single back thread to pop messages from the queue and log them.\n//\n// Upon each log write the logger:\n// 1. Checks if its log level is enough to log the message\n// 2. Push a new copy of the message to a queue (or block the caller until\n// space is available in the queue)\n// Upon destruction, logs all remaining messages in the queue before\n// destructing..\n\n#include \n\nnamespace spdlog {\n\n// Async overflow policy - block by default.\nenum class async_overflow_policy\n{\n block, // Block until message can be enqueued\n overrun_oldest // Discard oldest message in the queue if full when trying to\n // add new item.\n};\n\nnamespace details {\nclass thread_pool;\n}\n\nclass SPDLOG_API async_logger final : public std::enable_shared_from_this, public logger\n{\n friend class details::thread_pool;\n\npublic:\n template\n async_logger(std::string logger_name, It begin, It end, std::weak_ptr tp,\n async_overflow_policy overflow_policy = async_overflow_policy::block)\n : logger(std::move(logger_name), begin, end)\n , thread_pool_(std::move(tp))\n , overflow_policy_(overflow_policy)\n {}\n\n async_logger(std::string logger_name, sinks_init_list sinks_list, std::weak_ptr tp,\n async_overflow_policy overflow_policy = async_overflow_policy::block);\n\n async_logger(std::string logger_name, sink_ptr single_sink, std::weak_ptr tp,\n async_overflow_policy overflow_policy = async_overflow_policy::block);\n\n std::shared_ptr clone(std::string new_name) override;\n\nprotected:\n void sink_it_(const details::log_msg &msg) override;\n void flush_() override;\n void backend_sink_it_(const details::log_msg &incoming_log_msg);\n void backend_flush_();\n\nprivate:\n std::weak_ptr thread_pool_;\n async_overflow_policy overflow_policy_;\n};\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"async_logger-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/cfg/argv.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n#include \n#include \n\n//\n// Init log levels using each argv entry that starts with \"SPDLOG_LEVEL=\"\n//\n// set all loggers to debug level:\n// example.exe \"SPDLOG_LEVEL=debug\"\n\n// set logger1 to trace level\n// example.exe \"SPDLOG_LEVEL=logger1=trace\"\n\n// turn off all logging except for logger1 and logger2:\n// example.exe \"SPDLOG_LEVEL=off,logger1=debug,logger2=info\"\n\nnamespace spdlog {\nnamespace cfg {\n\n// search for SPDLOG_LEVEL= in the args and use it to init the levels\ninline void load_argv_levels(int argc, const char **argv)\n{\n const std::string spdlog_level_prefix = \"SPDLOG_LEVEL=\";\n for (int i = 1; i < argc; i++)\n {\n std::string arg = argv[i];\n if (arg.find(spdlog_level_prefix) == 0)\n {\n auto levels_string = arg.substr(spdlog_level_prefix.size());\n helpers::load_levels(levels_string);\n }\n }\n}\n\ninline void load_argv_levels(int argc, char **argv)\n{\n load_argv_levels(argc, const_cast(argv));\n}\n\n} // namespace cfg\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/cfg/env.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n#include \n#include \n#include \n\n//\n// Init levels and patterns from env variables SPDLOG_LEVEL\n// Inspired from Rust's \"env_logger\" crate (https://crates.io/crates/env_logger).\n// Note - fallback to \"info\" level on unrecognized levels\n//\n// Examples:\n//\n// set global level to debug:\n// export SPDLOG_LEVEL=debug\n//\n// turn off all logging except for logger1:\n// export SPDLOG_LEVEL=\"*=off,logger1=debug\"\n//\n\n// turn off all logging except for logger1 and logger2:\n// export SPDLOG_LEVEL=\"off,logger1=debug,logger2=info\"\n\nnamespace spdlog {\nnamespace cfg {\ninline void load_env_levels()\n{\n auto env_val = details::os::getenv(\"SPDLOG_LEVEL\");\n if (!env_val.empty())\n {\n helpers::load_levels(env_val);\n }\n}\n\n} // namespace cfg\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/cfg/helpers-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n\nnamespace spdlog {\nnamespace cfg {\nnamespace helpers {\n\n// inplace convert to lowercase\ninline std::string &to_lower_(std::string &str)\n{\n std::transform(\n str.begin(), str.end(), str.begin(), [](char ch) { return static_cast((ch >= 'A' && ch <= 'Z') ? ch + ('a' - 'A') : ch); });\n return str;\n}\n\n// inplace trim spaces\ninline std::string &trim_(std::string &str)\n{\n const char *spaces = \" \\n\\r\\t\";\n str.erase(str.find_last_not_of(spaces) + 1);\n str.erase(0, str.find_first_not_of(spaces));\n return str;\n}\n\n// return (name,value) trimmed pair from given \"name=value\" string.\n// return empty string on missing parts\n// \"key=val\" => (\"key\", \"val\")\n// \" key = val \" => (\"key\", \"val\")\n// \"key=\" => (\"key\", \"\")\n// \"val\" => (\"\", \"val\")\n\ninline std::pair extract_kv_(char sep, const std::string &str)\n{\n auto n = str.find(sep);\n std::string k, v;\n if (n == std::string::npos)\n {\n v = str;\n }\n else\n {\n k = str.substr(0, n);\n v = str.substr(n + 1);\n }\n return std::make_pair(trim_(k), trim_(v));\n}\n\n// return vector of key/value pairs from sequence of \"K1=V1,K2=V2,..\"\n// \"a=AAA,b=BBB,c=CCC,..\" => {(\"a\",\"AAA\"),(\"b\",\"BBB\"),(\"c\", \"CCC\"),...}\ninline std::unordered_map extract_key_vals_(const std::string &str)\n{\n std::string token;\n std::istringstream token_stream(str);\n std::unordered_map rv{};\n while (std::getline(token_stream, token, ','))\n {\n if (token.empty())\n {\n continue;\n }\n auto kv = extract_kv_('=', token);\n rv[kv.first] = kv.second;\n }\n return rv;\n}\n\nSPDLOG_INLINE void load_levels(const std::string &input)\n{\n if (input.empty() || input.size() > 512)\n {\n return;\n }\n\n auto key_vals = extract_key_vals_(input);\n std::unordered_map levels;\n level::level_enum global_level = level::info;\n bool global_level_found = false;\n\n for (auto &name_level : key_vals)\n {\n auto &logger_name = name_level.first;\n auto level_name = to_lower_(name_level.second);\n auto level = level::from_str(level_name);\n // ignore unrecognized level names\n if (level == level::off && level_name != \"off\")\n {\n continue;\n }\n if (logger_name.empty()) // no logger name indicate global level\n {\n global_level_found = true;\n global_level = level;\n }\n else\n {\n levels[logger_name] = level;\n }\n }\n\n details::registry::instance().set_levels(std::move(levels), global_level_found ? &global_level : nullptr);\n}\n\n} // namespace helpers\n} // namespace cfg\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/cfg/helpers.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include \n\nnamespace spdlog {\nnamespace cfg {\nnamespace helpers {\n//\n// Init levels from given string\n//\n// Examples:\n//\n// set global level to debug: \"debug\"\n// turn off all logging except for logger1: \"off,logger1=debug\"\n// turn off all logging except for logger1 and logger2: \"off,logger1=debug,logger2=info\"\n//\nSPDLOG_API void load_levels(const std::string &txt);\n} // namespace helpers\n\n} // namespace cfg\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"helpers-inl.h\"\n#endif // SPDLOG_HEADER_ONLY\n" }, { "path": "vendor/spdlog/include/spdlog/common-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\n#include \n#include \n\nnamespace spdlog {\nnamespace level {\n\n#if __cplusplus >= 201703L\nconstexpr\n#endif\nstatic string_view_t level_string_views[] SPDLOG_LEVEL_NAMES;\n\nstatic const char *short_level_names[] SPDLOG_SHORT_LEVEL_NAMES;\n\nSPDLOG_INLINE const string_view_t &to_string_view(spdlog::level::level_enum l) SPDLOG_NOEXCEPT\n{\n return level_string_views[l];\n}\n\nSPDLOG_INLINE const char *to_short_c_str(spdlog::level::level_enum l) SPDLOG_NOEXCEPT\n{\n return short_level_names[l];\n}\n\nSPDLOG_INLINE spdlog::level::level_enum from_str(const std::string &name) SPDLOG_NOEXCEPT\n{\n auto it = std::find(std::begin(level_string_views), std::end(level_string_views), name);\n if (it != std::end(level_string_views))\n return static_cast(std::distance(std::begin(level_string_views), it));\n\n // check also for \"warn\" and \"err\" before giving up..\n if (name == \"warn\")\n {\n return level::warn;\n }\n if (name == \"err\")\n {\n return level::err;\n }\n return level::off;\n}\n} // namespace level\n\nSPDLOG_INLINE spdlog_ex::spdlog_ex(std::string msg)\n : msg_(std::move(msg))\n{}\n\nSPDLOG_INLINE spdlog_ex::spdlog_ex(const std::string &msg, int last_errno)\n{\n memory_buf_t outbuf;\n fmt::format_system_error(outbuf, last_errno, msg.c_str());\n msg_ = fmt::to_string(outbuf);\n}\n\nSPDLOG_INLINE const char *spdlog_ex::what() const SPDLOG_NOEXCEPT\n{\n return msg_.c_str();\n}\n\nSPDLOG_INLINE void throw_spdlog_ex(const std::string &msg, int last_errno)\n{\n SPDLOG_THROW(spdlog_ex(msg, last_errno));\n}\n\nSPDLOG_INLINE void throw_spdlog_ex(std::string msg)\n{\n SPDLOG_THROW(spdlog_ex(std::move(msg)));\n}\n\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/common.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#ifdef SPDLOG_COMPILED_LIB\n# undef SPDLOG_HEADER_ONLY\n# if defined(_WIN32) && defined(SPDLOG_SHARED_LIB)\n# ifdef spdlog_EXPORTS\n# define SPDLOG_API __declspec(dllexport)\n# else\n# define SPDLOG_API __declspec(dllimport)\n# endif\n# else // !defined(_WIN32) || !defined(SPDLOG_SHARED_LIB)\n# define SPDLOG_API\n# endif\n# define SPDLOG_INLINE\n#else // !defined(SPDLOG_COMPILED_LIB)\n# define SPDLOG_API\n# define SPDLOG_HEADER_ONLY\n# define SPDLOG_INLINE inline\n#endif // #ifdef SPDLOG_COMPILED_LIB\n\n#include \n\n#if defined(SPDLOG_WCHAR_FILENAMES) || defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT)\n# include \n#endif\n\n// visual studio upto 2013 does not support noexcept nor constexpr\n#if defined(_MSC_VER) && (_MSC_VER < 1900)\n# define SPDLOG_NOEXCEPT _NOEXCEPT\n# define SPDLOG_CONSTEXPR\n#else\n# define SPDLOG_NOEXCEPT noexcept\n# define SPDLOG_CONSTEXPR constexpr\n#endif\n\n#if defined(__GNUC__) || defined(__clang__)\n# define SPDLOG_DEPRECATED __attribute__((deprecated))\n#elif defined(_MSC_VER)\n# define SPDLOG_DEPRECATED __declspec(deprecated)\n#else\n# define SPDLOG_DEPRECATED\n#endif\n\n// disable thread local on msvc 2013\n#ifndef SPDLOG_NO_TLS\n# if (defined(_MSC_VER) && (_MSC_VER < 1900)) || defined(__cplusplus_winrt)\n# define SPDLOG_NO_TLS 1\n# endif\n#endif\n\n#ifndef SPDLOG_FUNCTION\n# define SPDLOG_FUNCTION static_cast(__FUNCTION__)\n#endif\n\n#ifdef SPDLOG_NO_EXCEPTIONS\n# define SPDLOG_TRY\n# define SPDLOG_THROW(ex) \\\n do \\\n { \\\n printf(\"spdlog fatal error: %s\\n\", ex.what()); \\\n std::abort(); \\\n } while (0)\n# define SPDLOG_CATCH_STD\n#else\n# define SPDLOG_TRY try\n# define SPDLOG_THROW(ex) throw(ex)\n# define SPDLOG_CATCH_STD \\\n catch (const std::exception &) {}\n#endif\n\nnamespace spdlog {\n\nclass formatter;\n\nnamespace sinks {\nclass sink;\n}\n\n#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)\nusing filename_t = std::wstring;\n// allow macro expansion to occur in SPDLOG_FILENAME_T\n# define SPDLOG_FILENAME_T_INNER(s) L##s\n# define SPDLOG_FILENAME_T(s) SPDLOG_FILENAME_T_INNER(s)\n#else\nusing filename_t = std::string;\n# define SPDLOG_FILENAME_T(s) s\n#endif\n\nusing log_clock = std::chrono::system_clock;\nusing sink_ptr = std::shared_ptr;\nusing sinks_init_list = std::initializer_list;\nusing err_handler = std::function;\nusing string_view_t = fmt::basic_string_view;\nusing wstring_view_t = fmt::basic_string_view;\nusing memory_buf_t = fmt::basic_memory_buffer;\nusing wmemory_buf_t = fmt::basic_memory_buffer;\n\n#ifdef SPDLOG_WCHAR_TO_UTF8_SUPPORT\n# ifndef _WIN32\n# error SPDLOG_WCHAR_TO_UTF8_SUPPORT only supported on windows\n# else\ntemplate\nstruct is_convertible_to_wstring_view : std::is_convertible\n{};\n# endif // _WIN32\n#else\ntemplate\nstruct is_convertible_to_wstring_view : std::false_type\n{};\n#endif // SPDLOG_WCHAR_TO_UTF8_SUPPORT\n\n#if defined(SPDLOG_NO_ATOMIC_LEVELS)\nusing level_t = details::null_atomic_int;\n#else\nusing level_t = std::atomic;\n#endif\n\n#define SPDLOG_LEVEL_TRACE 0\n#define SPDLOG_LEVEL_DEBUG 1\n#define SPDLOG_LEVEL_INFO 2\n#define SPDLOG_LEVEL_WARN 3\n#define SPDLOG_LEVEL_ERROR 4\n#define SPDLOG_LEVEL_CRITICAL 5\n#define SPDLOG_LEVEL_OFF 6\n\n#if !defined(SPDLOG_ACTIVE_LEVEL)\n# define SPDLOG_ACTIVE_LEVEL SPDLOG_LEVEL_INFO\n#endif\n\n// Log level enum\nnamespace level {\nenum level_enum\n{\n trace = SPDLOG_LEVEL_TRACE,\n debug = SPDLOG_LEVEL_DEBUG,\n info = SPDLOG_LEVEL_INFO,\n warn = SPDLOG_LEVEL_WARN,\n err = SPDLOG_LEVEL_ERROR,\n critical = SPDLOG_LEVEL_CRITICAL,\n off = SPDLOG_LEVEL_OFF,\n n_levels\n};\n\n#define SPDLOG_LEVEL_NAME_TRACE string_view_t(\"trace\", 5)\n#define SPDLOG_LEVEL_NAME_DEBUG string_view_t(\"debug\", 5)\n#define SPDLOG_LEVEL_NAME_INFO string_view_t(\"info\", 4)\n#define SPDLOG_LEVEL_NAME_WARNING string_view_t(\"warning\", 7)\n#define SPDLOG_LEVEL_NAME_ERROR string_view_t(\"error\", 5)\n#define SPDLOG_LEVEL_NAME_CRITICAL string_view_t(\"critical\", 8)\n#define SPDLOG_LEVEL_NAME_OFF string_view_t(\"off\", 3)\n\n#if !defined(SPDLOG_LEVEL_NAMES)\n# define SPDLOG_LEVEL_NAMES \\\n { \\\n SPDLOG_LEVEL_NAME_TRACE, SPDLOG_LEVEL_NAME_DEBUG, SPDLOG_LEVEL_NAME_INFO, SPDLOG_LEVEL_NAME_WARNING, SPDLOG_LEVEL_NAME_ERROR, \\\n SPDLOG_LEVEL_NAME_CRITICAL, SPDLOG_LEVEL_NAME_OFF \\\n }\n#endif\n\n#if !defined(SPDLOG_SHORT_LEVEL_NAMES)\n\n# define SPDLOG_SHORT_LEVEL_NAMES \\\n { \\\n \"T\", \"D\", \"I\", \"W\", \"E\", \"C\", \"O\" \\\n }\n#endif\n\nSPDLOG_API const string_view_t &to_string_view(spdlog::level::level_enum l) SPDLOG_NOEXCEPT;\nSPDLOG_API const char *to_short_c_str(spdlog::level::level_enum l) SPDLOG_NOEXCEPT;\nSPDLOG_API spdlog::level::level_enum from_str(const std::string &name) SPDLOG_NOEXCEPT;\n\n} // namespace level\n\n//\n// Color mode used by sinks with color support.\n//\nenum class color_mode\n{\n always,\n automatic,\n never\n};\n\n//\n// Pattern time - specific time getting to use for pattern_formatter.\n// local time by default\n//\nenum class pattern_time_type\n{\n local, // log localtime\n utc // log utc\n};\n\n//\n// Log exception\n//\nclass SPDLOG_API spdlog_ex : public std::exception\n{\npublic:\n explicit spdlog_ex(std::string msg);\n spdlog_ex(const std::string &msg, int last_errno);\n const char *what() const SPDLOG_NOEXCEPT override;\n\nprivate:\n std::string msg_;\n};\n\n[[noreturn]] SPDLOG_API void throw_spdlog_ex(const std::string &msg, int last_errno);\n[[noreturn]] SPDLOG_API void throw_spdlog_ex(std::string msg);\n\nstruct source_loc\n{\n SPDLOG_CONSTEXPR source_loc() = default;\n SPDLOG_CONSTEXPR source_loc(const char *filename_in, int line_in, const char *funcname_in)\n : filename{filename_in}\n , line{line_in}\n , funcname{funcname_in}\n {}\n\n SPDLOG_CONSTEXPR bool empty() const SPDLOG_NOEXCEPT\n {\n return line == 0;\n }\n const char *filename{nullptr};\n int line{0};\n const char *funcname{nullptr};\n};\n\nnamespace details {\n// make_unique support for pre c++14\n\n#if __cplusplus >= 201402L // C++14 and beyond\nusing std::make_unique;\n#else\ntemplate\nstd::unique_ptr make_unique(Args &&...args)\n{\n static_assert(!std::is_array::value, \"arrays not supported\");\n return std::unique_ptr(new T(std::forward(args)...));\n}\n#endif\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n# include \"common-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/details/backtracer-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\nnamespace spdlog {\nnamespace details {\nSPDLOG_INLINE backtracer::backtracer(const backtracer &other)\n{\n std::lock_guard lock(other.mutex_);\n enabled_ = other.enabled();\n messages_ = other.messages_;\n}\n\nSPDLOG_INLINE backtracer::backtracer(backtracer &&other) SPDLOG_NOEXCEPT\n{\n std::lock_guard lock(other.mutex_);\n enabled_ = other.enabled();\n messages_ = std::move(other.messages_);\n}\n\nSPDLOG_INLINE backtracer &backtracer::operator=(backtracer other)\n{\n std::lock_guard lock(mutex_);\n enabled_ = other.enabled();\n messages_ = std::move(other.messages_);\n return *this;\n}\n\nSPDLOG_INLINE void backtracer::enable(size_t size)\n{\n std::lock_guard lock{mutex_};\n enabled_.store(true, std::memory_order_relaxed);\n messages_ = circular_q{size};\n}\n\nSPDLOG_INLINE void backtracer::disable()\n{\n std::lock_guard lock{mutex_};\n enabled_.store(false, std::memory_order_relaxed);\n}\n\nSPDLOG_INLINE bool backtracer::enabled() const\n{\n return enabled_.load(std::memory_order_relaxed);\n}\n\nSPDLOG_INLINE void backtracer::push_back(const log_msg &msg)\n{\n std::lock_guard lock{mutex_};\n messages_.push_back(log_msg_buffer{msg});\n}\n\n// pop all items in the q and apply the given fun on each of them.\nSPDLOG_INLINE void backtracer::foreach_pop(std::function fun)\n{\n std::lock_guard lock{mutex_};\n while (!messages_.empty())\n {\n auto &front_msg = messages_.front();\n fun(front_msg);\n messages_.pop_front();\n }\n}\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/backtracer.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include \n\n#include \n#include \n#include \n\n// Store log messages in circular buffer.\n// Useful for storing debug data in case of error/warning happens.\n\nnamespace spdlog {\nnamespace details {\nclass SPDLOG_API backtracer\n{\n mutable std::mutex mutex_;\n std::atomic enabled_{false};\n circular_q messages_;\n\npublic:\n backtracer() = default;\n backtracer(const backtracer &other);\n\n backtracer(backtracer &&other) SPDLOG_NOEXCEPT;\n backtracer &operator=(backtracer other);\n\n void enable(size_t size);\n void disable();\n bool enabled() const;\n void push_back(const log_msg &msg);\n\n // pop all items in the q and apply the given fun on each of them.\n void foreach_pop(std::function fun);\n};\n\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"backtracer-inl.h\"\n#endif\n\n" }, { "path": "vendor/spdlog/include/spdlog/details/circular_q.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n// circular q view of std::vector.\n#pragma once\n\n#include \n#include \n\nnamespace spdlog {\nnamespace details {\ntemplate\nclass circular_q\n{\n size_t max_items_ = 0;\n typename std::vector::size_type head_ = 0;\n typename std::vector::size_type tail_ = 0;\n size_t overrun_counter_ = 0;\n std::vector v_;\n\npublic:\n using value_type = T;\n\n // empty ctor - create a disabled queue with no elements allocated at all\n circular_q() = default;\n\n explicit circular_q(size_t max_items)\n : max_items_(max_items + 1) // one item is reserved as marker for full q\n , v_(max_items_)\n {}\n\n circular_q(const circular_q &) = default;\n circular_q &operator=(const circular_q &) = default;\n\n // move cannot be default,\n // since we need to reset head_, tail_, etc to zero in the moved object\n circular_q(circular_q &&other) SPDLOG_NOEXCEPT\n {\n copy_moveable(std::move(other));\n }\n\n circular_q &operator=(circular_q &&other) SPDLOG_NOEXCEPT\n {\n copy_moveable(std::move(other));\n return *this;\n }\n\n // push back, overrun (oldest) item if no room left\n void push_back(T &&item)\n {\n if (max_items_ > 0)\n {\n v_[tail_] = std::move(item);\n tail_ = (tail_ + 1) % max_items_;\n\n if (tail_ == head_) // overrun last item if full\n {\n head_ = (head_ + 1) % max_items_;\n ++overrun_counter_;\n }\n }\n }\n\n // Return reference to the front item.\n // If there are no elements in the container, the behavior is undefined.\n const T &front() const\n {\n return v_[head_];\n }\n\n T &front()\n {\n return v_[head_];\n }\n\n // Return number of elements actually stored\n size_t size() const\n {\n if (tail_ >= head_)\n {\n return tail_ - head_;\n }\n else\n {\n return max_items_ - (head_ - tail_);\n }\n }\n\n // Return const reference to item by index.\n // If index is out of range 0…size()-1, the behavior is undefined.\n const T &at(size_t i) const\n {\n assert(i < size());\n return v_[(head_ + i) % max_items_];\n }\n\n // Pop item from front.\n // If there are no elements in the container, the behavior is undefined.\n void pop_front()\n {\n head_ = (head_ + 1) % max_items_;\n }\n\n bool empty() const\n {\n return tail_ == head_;\n }\n\n bool full() const\n {\n // head is ahead of the tail by 1\n if (max_items_ > 0)\n {\n return ((tail_ + 1) % max_items_) == head_;\n }\n return false;\n }\n\n size_t overrun_counter() const\n {\n return overrun_counter_;\n }\n\nprivate:\n // copy from other&& and reset it to disabled state\n void copy_moveable(circular_q &&other) SPDLOG_NOEXCEPT\n {\n max_items_ = other.max_items_;\n head_ = other.head_;\n tail_ = other.tail_;\n overrun_counter_ = other.overrun_counter_;\n v_ = std::move(other.v_);\n\n // put &&other in disabled, but valid state\n other.max_items_ = 0;\n other.head_ = other.tail_ = 0;\n other.overrun_counter_ = 0;\n }\n};\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/console_globals.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include \n\nnamespace spdlog {\nnamespace details {\n\nstruct console_mutex\n{\n using mutex_t = std::mutex;\n static mutex_t &mutex()\n {\n static mutex_t s_mutex;\n return s_mutex;\n }\n};\n\nstruct console_nullmutex\n{\n using mutex_t = null_mutex;\n static mutex_t &mutex()\n {\n static mutex_t s_mutex;\n return s_mutex;\n }\n};\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/file_helper-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace spdlog {\nnamespace details {\n\nSPDLOG_INLINE file_helper::~file_helper()\n{\n close();\n}\n\nSPDLOG_INLINE void file_helper::open(const filename_t &fname, bool truncate)\n{\n close();\n filename_ = fname;\n\n auto *mode = SPDLOG_FILENAME_T(\"ab\");\n auto *trunc_mode = SPDLOG_FILENAME_T(\"wb\");\n\n for (int tries = 0; tries < open_tries_; ++tries)\n {\n // create containing folder if not exists already.\n os::create_dir(os::dir_name(fname));\n if (truncate)\n {\n // Truncate by opening-and-closing a tmp file in \"wb\" mode, always\n // opening the actual log-we-write-to in \"ab\" mode, since that\n // interacts more politely with eternal processes that might\n // rotate/truncate the file underneath us.\n std::FILE *tmp;\n if (os::fopen_s(&tmp, fname, trunc_mode))\n {\n continue;\n }\n std::fclose(tmp);\n }\n if (!os::fopen_s(&fd_, fname, mode))\n {\n return;\n }\n\n details::os::sleep_for_millis(open_interval_);\n }\n\n throw_spdlog_ex(\"Failed opening file \" + os::filename_to_str(filename_) + \" for writing\", errno);\n}\n\nSPDLOG_INLINE void file_helper::reopen(bool truncate)\n{\n if (filename_.empty())\n {\n throw_spdlog_ex(\"Failed re opening file - was not opened before\");\n }\n this->open(filename_, truncate);\n}\n\nSPDLOG_INLINE void file_helper::flush()\n{\n std::fflush(fd_);\n}\n\nSPDLOG_INLINE void file_helper::close()\n{\n if (fd_ != nullptr)\n {\n std::fclose(fd_);\n fd_ = nullptr;\n }\n}\n\nSPDLOG_INLINE void file_helper::write(const memory_buf_t &buf)\n{\n size_t msg_size = buf.size();\n auto data = buf.data();\n if (std::fwrite(data, 1, msg_size, fd_) != msg_size)\n {\n throw_spdlog_ex(\"Failed writing to file \" + os::filename_to_str(filename_), errno);\n }\n}\n\nSPDLOG_INLINE size_t file_helper::size() const\n{\n if (fd_ == nullptr)\n {\n throw_spdlog_ex(\"Cannot use size() on closed file \" + os::filename_to_str(filename_));\n }\n return os::filesize(fd_);\n}\n\nSPDLOG_INLINE const filename_t &file_helper::filename() const\n{\n return filename_;\n}\n\n//\n// return file path and its extension:\n//\n// \"mylog.txt\" => (\"mylog\", \".txt\")\n// \"mylog\" => (\"mylog\", \"\")\n// \"mylog.\" => (\"mylog.\", \"\")\n// \"/dir1/dir2/mylog.txt\" => (\"/dir1/dir2/mylog\", \".txt\")\n//\n// the starting dot in filenames is ignored (hidden files):\n//\n// \".mylog\" => (\".mylog\". \"\")\n// \"my_folder/.mylog\" => (\"my_folder/.mylog\", \"\")\n// \"my_folder/.mylog.txt\" => (\"my_folder/.mylog\", \".txt\")\nSPDLOG_INLINE std::tuple file_helper::split_by_extension(const filename_t &fname)\n{\n auto ext_index = fname.rfind('.');\n\n // no valid extension found - return whole path and empty string as\n // extension\n if (ext_index == filename_t::npos || ext_index == 0 || ext_index == fname.size() - 1)\n {\n return std::make_tuple(fname, filename_t());\n }\n\n // treat cases like \"/etc/rc.d/somelogfile or \"/abc/.hiddenfile\"\n auto folder_index = fname.find_last_of(details::os::folder_seps_filename);\n if (folder_index != filename_t::npos && folder_index >= ext_index - 1)\n {\n return std::make_tuple(fname, filename_t());\n }\n\n // finally - return a valid base and extension tuple\n return std::make_tuple(fname.substr(0, ext_index), fname.substr(ext_index));\n}\n\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/file_helper.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include \n\nnamespace spdlog {\nnamespace details {\n\n// Helper class for file sinks.\n// When failing to open a file, retry several times(5) with a delay interval(10 ms).\n// Throw spdlog_ex exception on errors.\n\nclass SPDLOG_API file_helper\n{\npublic:\n explicit file_helper() = default;\n\n file_helper(const file_helper &) = delete;\n file_helper &operator=(const file_helper &) = delete;\n ~file_helper();\n\n void open(const filename_t &fname, bool truncate = false);\n void reopen(bool truncate);\n void flush();\n void close();\n void write(const memory_buf_t &buf);\n size_t size() const;\n const filename_t &filename() const;\n\n //\n // return file path and its extension:\n //\n // \"mylog.txt\" => (\"mylog\", \".txt\")\n // \"mylog\" => (\"mylog\", \"\")\n // \"mylog.\" => (\"mylog.\", \"\")\n // \"/dir1/dir2/mylog.txt\" => (\"/dir1/dir2/mylog\", \".txt\")\n //\n // the starting dot in filenames is ignored (hidden files):\n //\n // \".mylog\" => (\".mylog\". \"\")\n // \"my_folder/.mylog\" => (\"my_folder/.mylog\", \"\")\n // \"my_folder/.mylog.txt\" => (\"my_folder/.mylog\", \".txt\")\n static std::tuple split_by_extension(const filename_t &fname);\n\nprivate:\n const int open_tries_ = 5;\n const unsigned int open_interval_ = 10;\n std::FILE *fd_{nullptr};\n filename_t filename_;\n};\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"file_helper-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/details/fmt_helper.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n#pragma once\n\n#include \n#include \n#include \n#include \n#include \n\n// Some fmt helpers to efficiently format and pad ints and strings\nnamespace spdlog {\nnamespace details {\nnamespace fmt_helper {\n\ninline spdlog::string_view_t to_string_view(const memory_buf_t &buf) SPDLOG_NOEXCEPT\n{\n return spdlog::string_view_t{buf.data(), buf.size()};\n}\n\ninline void append_string_view(spdlog::string_view_t view, memory_buf_t &dest)\n{\n auto *buf_ptr = view.data();\n dest.append(buf_ptr, buf_ptr + view.size());\n}\n\ntemplate\ninline void append_int(T n, memory_buf_t &dest)\n{\n fmt::format_int i(n);\n dest.append(i.data(), i.data() + i.size());\n}\n\ntemplate\ninline unsigned int count_digits(T n)\n{\n using count_type = typename std::conditional<(sizeof(T) > sizeof(uint32_t)), uint64_t, uint32_t>::type;\n return static_cast(fmt::\n// fmt 7.0.0 renamed the internal namespace to detail.\n// See: https://github.com/fmtlib/fmt/issues/1538\n#if FMT_VERSION < 70000\n internal\n#else\n detail\n#endif\n ::count_digits(static_cast(n)));\n}\n\ninline void pad2(int n, memory_buf_t &dest)\n{\n if (n >= 0 && n < 100) // 0-99\n {\n dest.push_back(static_cast('0' + n / 10));\n dest.push_back(static_cast('0' + n % 10));\n }\n else // unlikely, but just in case, let fmt deal with it\n {\n fmt::format_to(std::back_inserter(dest), \"{:02}\", n);\n }\n}\n\ntemplate\ninline void pad_uint(T n, unsigned int width, memory_buf_t &dest)\n{\n static_assert(std::is_unsigned::value, \"pad_uint must get unsigned T\");\n for (auto digits = count_digits(n); digits < width; digits++)\n {\n dest.push_back('0');\n }\n append_int(n, dest);\n}\n\ntemplate\ninline void pad3(T n, memory_buf_t &dest)\n{\n static_assert(std::is_unsigned::value, \"pad3 must get unsigned T\");\n if (n < 1000)\n {\n dest.push_back(static_cast(n / 100 + '0'));\n n = n % 100;\n dest.push_back(static_cast((n / 10) + '0'));\n dest.push_back(static_cast((n % 10) + '0'));\n }\n else\n {\n append_int(n, dest);\n }\n}\n\ntemplate\ninline void pad6(T n, memory_buf_t &dest)\n{\n pad_uint(n, 6, dest);\n}\n\ntemplate\ninline void pad9(T n, memory_buf_t &dest)\n{\n pad_uint(n, 9, dest);\n}\n\n// return fraction of a second of the given time_point.\n// e.g.\n// fraction(tp) -> will return the millis part of the second\ntemplate\ninline ToDuration time_fraction(log_clock::time_point tp)\n{\n using std::chrono::duration_cast;\n using std::chrono::seconds;\n auto duration = tp.time_since_epoch();\n auto secs = duration_cast(duration);\n return duration_cast(duration) - duration_cast(secs);\n}\n\n} // namespace fmt_helper\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/log_msg-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\n#include \n\nnamespace spdlog {\nnamespace details {\n\nSPDLOG_INLINE log_msg::log_msg(spdlog::log_clock::time_point log_time, spdlog::source_loc loc, string_view_t a_logger_name,\n spdlog::level::level_enum lvl, spdlog::string_view_t msg)\n : logger_name(a_logger_name)\n , level(lvl)\n , time(log_time)\n#ifndef SPDLOG_NO_THREAD_ID\n , thread_id(os::thread_id())\n#endif\n , source(loc)\n , payload(msg)\n{}\n\nSPDLOG_INLINE log_msg::log_msg(\n spdlog::source_loc loc, string_view_t a_logger_name, spdlog::level::level_enum lvl, spdlog::string_view_t msg)\n : log_msg(os::now(), loc, a_logger_name, lvl, msg)\n{}\n\nSPDLOG_INLINE log_msg::log_msg(string_view_t a_logger_name, spdlog::level::level_enum lvl, spdlog::string_view_t msg)\n : log_msg(os::now(), source_loc{}, a_logger_name, lvl, msg)\n{}\n\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/log_msg.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include \n\nnamespace spdlog {\nnamespace details {\nstruct SPDLOG_API log_msg\n{\n log_msg() = default;\n log_msg(log_clock::time_point log_time, source_loc loc, string_view_t logger_name, level::level_enum lvl, string_view_t msg);\n log_msg(source_loc loc, string_view_t logger_name, level::level_enum lvl, string_view_t msg);\n log_msg(string_view_t logger_name, level::level_enum lvl, string_view_t msg);\n log_msg(const log_msg &other) = default;\n log_msg &operator=(const log_msg &other) = default;\n\n string_view_t logger_name;\n level::level_enum level{level::off};\n log_clock::time_point time;\n size_t thread_id{0};\n\n // wrapping the formatted text with color (updated by pattern_formatter).\n mutable size_t color_range_start{0};\n mutable size_t color_range_end{0};\n\n source_loc source;\n string_view_t payload;\n};\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"log_msg-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/details/log_msg_buffer-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\nnamespace spdlog {\nnamespace details {\n\nSPDLOG_INLINE log_msg_buffer::log_msg_buffer(const log_msg &orig_msg)\n : log_msg{orig_msg}\n{\n buffer.append(logger_name.begin(), logger_name.end());\n buffer.append(payload.begin(), payload.end());\n update_string_views();\n}\n\nSPDLOG_INLINE log_msg_buffer::log_msg_buffer(const log_msg_buffer &other)\n : log_msg{other}\n{\n buffer.append(logger_name.begin(), logger_name.end());\n buffer.append(payload.begin(), payload.end());\n update_string_views();\n}\n\nSPDLOG_INLINE log_msg_buffer::log_msg_buffer(log_msg_buffer &&other) SPDLOG_NOEXCEPT \n : log_msg{other}\n , buffer{std::move(other.buffer)}\n{\n update_string_views();\n}\n\nSPDLOG_INLINE log_msg_buffer &log_msg_buffer::operator=(const log_msg_buffer &other)\n{\n log_msg::operator=(other);\n buffer.clear();\n buffer.append(other.buffer.data(), other.buffer.data() + other.buffer.size());\n update_string_views();\n return *this;\n}\n\nSPDLOG_INLINE log_msg_buffer &log_msg_buffer::operator=(log_msg_buffer &&other) SPDLOG_NOEXCEPT\n{\n log_msg::operator=(other);\n buffer = std::move(other.buffer);\n update_string_views();\n return *this;\n}\n\nSPDLOG_INLINE void log_msg_buffer::update_string_views()\n{\n logger_name = string_view_t{buffer.data(), logger_name.size()};\n payload = string_view_t{buffer.data() + logger_name.size(), payload.size()};\n}\n\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/log_msg_buffer.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n\nnamespace spdlog {\nnamespace details {\n\n// Extend log_msg with internal buffer to store its payload.\n// This is needed since log_msg holds string_views that points to stack data.\n\nclass SPDLOG_API log_msg_buffer : public log_msg\n{\n memory_buf_t buffer;\n void update_string_views();\n\npublic:\n log_msg_buffer() = default;\n explicit log_msg_buffer(const log_msg &orig_msg);\n log_msg_buffer(const log_msg_buffer &other);\n log_msg_buffer(log_msg_buffer &&other) SPDLOG_NOEXCEPT;\n log_msg_buffer &operator=(const log_msg_buffer &other);\n log_msg_buffer &operator=(log_msg_buffer &&other) SPDLOG_NOEXCEPT;\n};\n\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"log_msg_buffer-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/details/mpmc_blocking_q.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n// multi producer-multi consumer blocking queue.\n// enqueue(..) - will block until room found to put the new message.\n// enqueue_nowait(..) - will return immediately with false if no room left in\n// the queue.\n// dequeue_for(..) - will block until the queue is not empty or timeout have\n// passed.\n\n#include \n\n#include \n#include \n\nnamespace spdlog {\nnamespace details {\n\ntemplate\nclass mpmc_blocking_queue\n{\npublic:\n using item_type = T;\n explicit mpmc_blocking_queue(size_t max_items)\n : q_(max_items)\n {}\n\n#ifndef __MINGW32__\n // try to enqueue and block if no room left\n void enqueue(T &&item)\n {\n {\n std::unique_lock lock(queue_mutex_);\n pop_cv_.wait(lock, [this] { return !this->q_.full(); });\n q_.push_back(std::move(item));\n }\n push_cv_.notify_one();\n }\n\n // enqueue immediately. overrun oldest message in the queue if no room left.\n void enqueue_nowait(T &&item)\n {\n {\n std::unique_lock lock(queue_mutex_);\n q_.push_back(std::move(item));\n }\n push_cv_.notify_one();\n }\n\n // try to dequeue item. if no item found. wait upto timeout and try again\n // Return true, if succeeded dequeue item, false otherwise\n bool dequeue_for(T &popped_item, std::chrono::milliseconds wait_duration)\n {\n {\n std::unique_lock lock(queue_mutex_);\n if (!push_cv_.wait_for(lock, wait_duration, [this] { return !this->q_.empty(); }))\n {\n return false;\n }\n popped_item = std::move(q_.front());\n q_.pop_front();\n }\n pop_cv_.notify_one();\n return true;\n }\n\n#else\n // apparently mingw deadlocks if the mutex is released before cv.notify_one(),\n // so release the mutex at the very end each function.\n\n // try to enqueue and block if no room left\n void enqueue(T &&item)\n {\n std::unique_lock lock(queue_mutex_);\n pop_cv_.wait(lock, [this] { return !this->q_.full(); });\n q_.push_back(std::move(item));\n push_cv_.notify_one();\n }\n\n // enqueue immediately. overrun oldest message in the queue if no room left.\n void enqueue_nowait(T &&item)\n {\n std::unique_lock lock(queue_mutex_);\n q_.push_back(std::move(item));\n push_cv_.notify_one();\n }\n\n // try to dequeue item. if no item found. wait upto timeout and try again\n // Return true, if succeeded dequeue item, false otherwise\n bool dequeue_for(T &popped_item, std::chrono::milliseconds wait_duration)\n {\n std::unique_lock lock(queue_mutex_);\n if (!push_cv_.wait_for(lock, wait_duration, [this] { return !this->q_.empty(); }))\n {\n return false;\n }\n popped_item = std::move(q_.front());\n q_.pop_front();\n pop_cv_.notify_one();\n return true;\n }\n\n#endif\n\n size_t overrun_counter()\n {\n std::unique_lock lock(queue_mutex_);\n return q_.overrun_counter();\n }\n\n size_t size()\n {\n std::unique_lock lock(queue_mutex_);\n return q_.size();\n }\n\nprivate:\n std::mutex queue_mutex_;\n std::condition_variable push_cv_;\n std::condition_variable pop_cv_;\n spdlog::details::circular_q q_;\n};\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/null_mutex.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include \n// null, no cost dummy \"mutex\" and dummy \"atomic\" int\n\nnamespace spdlog {\nnamespace details {\nstruct null_mutex\n{\n void lock() const {}\n void unlock() const {}\n bool try_lock() const\n {\n return true;\n }\n};\n\nstruct null_atomic_int\n{\n int value;\n null_atomic_int() = default;\n\n explicit null_atomic_int(int new_value)\n : value(new_value)\n {}\n\n int load(std::memory_order = std::memory_order_relaxed) const\n {\n return value;\n }\n\n void store(int new_value, std::memory_order = std::memory_order_relaxed)\n {\n value = new_value;\n }\n\n int exchange(int new_value, std::memory_order = std::memory_order_relaxed)\n {\n std::swap(new_value, value);\n return new_value; // return value before the call\n }\n};\n\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/os-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \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#include \n\n#ifdef _WIN32\n\n#include // _get_osfhandle and _isatty support\n#include // _get_pid support\n#include \n\n#ifdef __MINGW32__\n#include \n#endif\n\n#if defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT) || defined(SPDLOG_WCHAR_FILENAMES)\n#include \n#endif\n\n#include // for _mkdir/_wmkdir\n\n#else // unix\n\n#include \n#include \n\n#ifdef __linux__\n#include //Use gettid() syscall under linux to get thread id\n\n#elif defined(_AIX)\n#include // for pthread_getthreadid_np\n\n#elif defined(__DragonFly__) || defined(__FreeBSD__)\n#include // for pthread_getthreadid_np\n\n#elif defined(__NetBSD__)\n#include // for _lwp_self\n\n#elif defined(__sun)\n#include // for thr_self\n#endif\n\n#endif // unix\n\n#ifndef __has_feature // Clang - feature checking macros.\n#define __has_feature(x) 0 // Compatibility with non-clang compilers.\n#endif\n\nnamespace spdlog {\nnamespace details {\nnamespace os {\n\nSPDLOG_INLINE spdlog::log_clock::time_point now() SPDLOG_NOEXCEPT\n{\n\n#if defined __linux__ && defined SPDLOG_CLOCK_COARSE\n timespec ts;\n ::clock_gettime(CLOCK_REALTIME_COARSE, &ts);\n return std::chrono::time_point(\n std::chrono::duration_cast(std::chrono::seconds(ts.tv_sec) + std::chrono::nanoseconds(ts.tv_nsec)));\n\n#else\n return log_clock::now();\n#endif\n}\nSPDLOG_INLINE std::tm localtime(const std::time_t &time_tt) SPDLOG_NOEXCEPT\n{\n\n#ifdef _WIN32\n std::tm tm;\n ::localtime_s(&tm, &time_tt);\n#else\n std::tm tm;\n ::localtime_r(&time_tt, &tm);\n#endif\n return tm;\n}\n\nSPDLOG_INLINE std::tm localtime() SPDLOG_NOEXCEPT\n{\n std::time_t now_t = ::time(nullptr);\n return localtime(now_t);\n}\n\nSPDLOG_INLINE std::tm gmtime(const std::time_t &time_tt) SPDLOG_NOEXCEPT\n{\n\n#ifdef _WIN32\n std::tm tm;\n ::gmtime_s(&tm, &time_tt);\n#else\n std::tm tm;\n ::gmtime_r(&time_tt, &tm);\n#endif\n return tm;\n}\n\nSPDLOG_INLINE std::tm gmtime() SPDLOG_NOEXCEPT\n{\n std::time_t now_t = ::time(nullptr);\n return gmtime(now_t);\n}\n\n// fopen_s on non windows for writing\nSPDLOG_INLINE bool fopen_s(FILE **fp, const filename_t &filename, const filename_t &mode)\n{\n#ifdef _WIN32\n#ifdef SPDLOG_WCHAR_FILENAMES\n *fp = ::_wfsopen((filename.c_str()), mode.c_str(), _SH_DENYNO);\n#else\n *fp = ::_fsopen((filename.c_str()), mode.c_str(), _SH_DENYNO);\n#endif\n#if defined(SPDLOG_PREVENT_CHILD_FD)\n if (*fp != nullptr)\n {\n auto file_handle = reinterpret_cast(_get_osfhandle(::_fileno(*fp)));\n if (!::SetHandleInformation(file_handle, HANDLE_FLAG_INHERIT, 0))\n {\n ::fclose(*fp);\n *fp = nullptr;\n }\n }\n#endif\n#else // unix\n#if defined(SPDLOG_PREVENT_CHILD_FD)\n const int mode_flag = mode == SPDLOG_FILENAME_T(\"ab\") ? O_APPEND : O_TRUNC;\n const int fd = ::open((filename.c_str()), O_CREAT | O_WRONLY | O_CLOEXEC | mode_flag, mode_t(0644));\n if (fd == -1)\n {\n return false;\n }\n *fp = ::fdopen(fd, mode.c_str());\n if (*fp == nullptr)\n {\n ::close(fd);\n }\n#else\n *fp = ::fopen((filename.c_str()), mode.c_str());\n#endif\n#endif\n\n return *fp == nullptr;\n}\n\nSPDLOG_INLINE int remove(const filename_t &filename) SPDLOG_NOEXCEPT\n{\n#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)\n return ::_wremove(filename.c_str());\n#else\n return std::remove(filename.c_str());\n#endif\n}\n\nSPDLOG_INLINE int remove_if_exists(const filename_t &filename) SPDLOG_NOEXCEPT\n{\n return path_exists(filename) ? remove(filename) : 0;\n}\n\nSPDLOG_INLINE int rename(const filename_t &filename1, const filename_t &filename2) SPDLOG_NOEXCEPT\n{\n#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)\n return ::_wrename(filename1.c_str(), filename2.c_str());\n#else\n return std::rename(filename1.c_str(), filename2.c_str());\n#endif\n}\n\n// Return true if path exists (file or directory)\nSPDLOG_INLINE bool path_exists(const filename_t &filename) SPDLOG_NOEXCEPT\n{\n#ifdef _WIN32\n#ifdef SPDLOG_WCHAR_FILENAMES\n auto attribs = ::GetFileAttributesW(filename.c_str());\n#else\n auto attribs = ::GetFileAttributesA(filename.c_str());\n#endif\n return attribs != INVALID_FILE_ATTRIBUTES;\n#else // common linux/unix all have the stat system call\n struct stat buffer;\n return (::stat(filename.c_str(), &buffer) == 0);\n#endif\n}\n\n#ifdef _MSC_VER\n // avoid warning about unreachable statement at the end of filesize()\n #pragma warning(push)\n #pragma warning(disable: 4702)\n#endif\n\n// Return file size according to open FILE* object\nSPDLOG_INLINE size_t filesize(FILE *f)\n{\n if (f == nullptr)\n {\n throw_spdlog_ex(\"Failed getting file size. fd is null\");\n }\n#if defined(_WIN32) && !defined(__CYGWIN__)\n int fd = ::_fileno(f);\n#if defined(_WIN64) // 64 bits\n __int64 ret = ::_filelengthi64(fd);\n if (ret >= 0)\n {\n return static_cast(ret);\n }\n\n#else // windows 32 bits\n long ret = ::_filelength(fd);\n if (ret >= 0)\n {\n return static_cast(ret);\n }\n#endif\n\n#else // unix\n// OpenBSD doesn't compile with :: before the fileno(..)\n#if defined(__OpenBSD__)\n int fd = fileno(f);\n#else\n int fd = ::fileno(f);\n#endif\n// 64 bits(but not in osx or cygwin, where fstat64 is deprecated)\n#if (defined(__linux__) || defined(__sun) || defined(_AIX)) && (defined(__LP64__) || defined(_LP64))\n struct stat64 st;\n if (::fstat64(fd, &st) == 0)\n {\n return static_cast(st.st_size);\n }\n#else // other unix or linux 32 bits or cygwin\n struct stat st;\n if (::fstat(fd, &st) == 0)\n {\n return static_cast(st.st_size);\n }\n#endif\n#endif\n throw_spdlog_ex(\"Failed getting file size from fd\", errno);\n return 0; // will not be reached.\n}\n\n#ifdef _MSC_VER\n #pragma warning(pop)\n#endif\n\n// Return utc offset in minutes or throw spdlog_ex on failure\nSPDLOG_INLINE int utc_minutes_offset(const std::tm &tm)\n{\n\n#ifdef _WIN32\n#if _WIN32_WINNT < _WIN32_WINNT_WS08\n TIME_ZONE_INFORMATION tzinfo;\n auto rv = ::GetTimeZoneInformation(&tzinfo);\n#else\n DYNAMIC_TIME_ZONE_INFORMATION tzinfo;\n auto rv = ::GetDynamicTimeZoneInformation(&tzinfo);\n#endif\n if (rv == TIME_ZONE_ID_INVALID)\n throw_spdlog_ex(\"Failed getting timezone info. \", errno);\n\n int offset = -tzinfo.Bias;\n if (tm.tm_isdst)\n {\n offset -= tzinfo.DaylightBias;\n }\n else\n {\n offset -= tzinfo.StandardBias;\n }\n return offset;\n#else\n\n#if defined(sun) || defined(__sun) || defined(_AIX) || (!defined(_BSD_SOURCE) && !defined(_GNU_SOURCE))\n // 'tm_gmtoff' field is BSD extension and it's missing on SunOS/Solaris\n struct helper\n {\n static long int calculate_gmt_offset(const std::tm &localtm = details::os::localtime(), const std::tm &gmtm = details::os::gmtime())\n {\n int local_year = localtm.tm_year + (1900 - 1);\n int gmt_year = gmtm.tm_year + (1900 - 1);\n\n long int days = (\n // difference in day of year\n localtm.tm_yday -\n gmtm.tm_yday\n\n // + intervening leap days\n + ((local_year >> 2) - (gmt_year >> 2)) - (local_year / 100 - gmt_year / 100) +\n ((local_year / 100 >> 2) - (gmt_year / 100 >> 2))\n\n // + difference in years * 365 */\n + (long int)(local_year - gmt_year) * 365);\n\n long int hours = (24 * days) + (localtm.tm_hour - gmtm.tm_hour);\n long int mins = (60 * hours) + (localtm.tm_min - gmtm.tm_min);\n long int secs = (60 * mins) + (localtm.tm_sec - gmtm.tm_sec);\n\n return secs;\n }\n };\n\n auto offset_seconds = helper::calculate_gmt_offset(tm);\n#else\n auto offset_seconds = tm.tm_gmtoff;\n#endif\n\n return static_cast(offset_seconds / 60);\n#endif\n}\n\n// Return current thread id as size_t\n// It exists because the std::this_thread::get_id() is much slower(especially\n// under VS 2013)\nSPDLOG_INLINE size_t _thread_id() SPDLOG_NOEXCEPT\n{\n#ifdef _WIN32\n return static_cast(::GetCurrentThreadId());\n#elif defined(__linux__)\n#if defined(__ANDROID__) && defined(__ANDROID_API__) && (__ANDROID_API__ < 21)\n#define SYS_gettid __NR_gettid\n#endif\n return static_cast(::syscall(SYS_gettid));\n#elif defined(_AIX) || defined(__DragonFly__) || defined(__FreeBSD__)\n return static_cast(::pthread_getthreadid_np());\n#elif defined(__NetBSD__)\n return static_cast(::_lwp_self());\n#elif defined(__OpenBSD__)\n return static_cast(::getthrid());\n#elif defined(__sun)\n return static_cast(::thr_self());\n#elif __APPLE__\n uint64_t tid;\n pthread_threadid_np(nullptr, &tid);\n return static_cast(tid);\n#else // Default to standard C++11 (other Unix)\n return static_cast(std::hash()(std::this_thread::get_id()));\n#endif\n}\n\n// Return current thread id as size_t (from thread local storage)\nSPDLOG_INLINE size_t thread_id() SPDLOG_NOEXCEPT\n{\n#if defined(SPDLOG_NO_TLS)\n return _thread_id();\n#else // cache thread id in tls\n static thread_local const size_t tid = _thread_id();\n return tid;\n#endif\n}\n\n// This is avoid msvc issue in sleep_for that happens if the clock changes.\n// See https://github.com/gabime/spdlog/issues/609\nSPDLOG_INLINE void sleep_for_millis(unsigned int milliseconds) SPDLOG_NOEXCEPT\n{\n#if defined(_WIN32)\n ::Sleep(milliseconds);\n#else\n std::this_thread::sleep_for(std::chrono::milliseconds(milliseconds));\n#endif\n}\n\n// wchar support for windows file names (SPDLOG_WCHAR_FILENAMES must be defined)\n#if defined(_WIN32) && defined(SPDLOG_WCHAR_FILENAMES)\nSPDLOG_INLINE std::string filename_to_str(const filename_t &filename)\n{\n memory_buf_t buf;\n wstr_to_utf8buf(filename, buf);\n return fmt::to_string(buf);\n}\n#else\nSPDLOG_INLINE std::string filename_to_str(const filename_t &filename)\n{\n return filename;\n}\n#endif\n\nSPDLOG_INLINE int pid() SPDLOG_NOEXCEPT\n{\n\n#ifdef _WIN32\n return static_cast(::GetCurrentProcessId());\n#else\n return static_cast(::getpid());\n#endif\n}\n\n// Determine if the terminal supports colors\n// Based on: https://github.com/agauniyal/rang/\nSPDLOG_INLINE bool is_color_terminal() SPDLOG_NOEXCEPT\n{\n#ifdef _WIN32\n return true;\n#else\n\n static const bool result = []() {\n const char *env_colorterm_p = std::getenv(\"COLORTERM\");\n if (env_colorterm_p != nullptr)\n {\n return true;\n }\n\n static constexpr std::array terms = {{\"ansi\", \"color\", \"console\", \"cygwin\", \"gnome\", \"konsole\", \"kterm\", \"linux\",\n \"msys\", \"putty\", \"rxvt\", \"screen\", \"vt100\", \"xterm\", \"alacritty\", \"vt102\"}};\n\n const char *env_term_p = std::getenv(\"TERM\");\n if (env_term_p == nullptr)\n {\n return false;\n }\n\n return std::any_of(terms.begin(), terms.end(), [&](const char *term) { return std::strstr(env_term_p, term) != nullptr; });\n }();\n\n return result;\n#endif\n}\n\n// Determine if the terminal attached\n// Source: https://github.com/agauniyal/rang/\nSPDLOG_INLINE bool in_terminal(FILE *file) SPDLOG_NOEXCEPT\n{\n\n#ifdef _WIN32\n return ::_isatty(_fileno(file)) != 0;\n#else\n return ::isatty(fileno(file)) != 0;\n#endif\n}\n\n#if (defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT) || defined(SPDLOG_WCHAR_FILENAMES)) && defined(_WIN32)\nSPDLOG_INLINE void wstr_to_utf8buf(wstring_view_t wstr, memory_buf_t &target)\n{\n if (wstr.size() > static_cast((std::numeric_limits::max)()) / 2 - 1)\n {\n throw_spdlog_ex(\"UTF-16 string is too big to be converted to UTF-8\");\n }\n\n int wstr_size = static_cast(wstr.size());\n if (wstr_size == 0)\n {\n target.resize(0);\n return;\n }\n\n int result_size = static_cast(target.capacity());\n if ((wstr_size + 1) * 2 > result_size)\n {\n result_size = ::WideCharToMultiByte(CP_UTF8, 0, wstr.data(), wstr_size, NULL, 0, NULL, NULL);\n }\n\n if (result_size > 0)\n {\n target.resize(result_size);\n result_size = ::WideCharToMultiByte(CP_UTF8, 0, wstr.data(), wstr_size, target.data(), result_size, NULL, NULL);\n\n if (result_size > 0)\n {\n target.resize(result_size);\n return;\n }\n }\n\n throw_spdlog_ex(fmt::format(\"WideCharToMultiByte failed. Last error: {}\", ::GetLastError()));\n}\n\nSPDLOG_INLINE void utf8_to_wstrbuf(string_view_t str, wmemory_buf_t &target)\n{\n if (str.size() > static_cast((std::numeric_limits::max)()) - 1)\n {\n throw_spdlog_ex(\"UTF-8 string is too big to be converted to UTF-16\");\n }\n\n int str_size = static_cast(str.size());\n if (str_size == 0)\n {\n target.resize(0);\n return;\n }\n\n int result_size = static_cast(target.capacity());\n if (str_size + 1 > result_size)\n {\n result_size = ::MultiByteToWideChar(CP_UTF8, MB_ERR_INVALID_CHARS, str.data(), str_size, NULL, 0);\n }\n\n if (result_size > 0)\n {\n target.resize(result_size);\n result_size = ::MultiByteToWideChar(CP_UTF8, MB_ERR_INVALID_CHARS, str.data(), str_size, target.data(), result_size);\n\n if (result_size > 0)\n {\n target.resize(result_size);\n return;\n }\n }\n\n throw_spdlog_ex(fmt::format(\"MultiByteToWideChar failed. Last error: {}\", ::GetLastError()));\n}\n#endif // (defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT) || defined(SPDLOG_WCHAR_FILENAMES)) && defined(_WIN32)\n\n// return true on success\nstatic SPDLOG_INLINE bool mkdir_(const filename_t &path)\n{\n#ifdef _WIN32\n#ifdef SPDLOG_WCHAR_FILENAMES\n return ::_wmkdir(path.c_str()) == 0;\n#else\n return ::_mkdir(path.c_str()) == 0;\n#endif\n#else\n return ::mkdir(path.c_str(), mode_t(0755)) == 0;\n#endif\n}\n\n// create the given directory - and all directories leading to it\n// return true on success or if the directory already exists\nSPDLOG_INLINE bool create_dir(filename_t path)\n{\n if (path_exists(path))\n {\n return true;\n }\n\n if (path.empty())\n {\n return false;\n }\n\n size_t search_offset = 0;\n do\n {\n auto token_pos = path.find_first_of(folder_seps_filename, search_offset);\n // treat the entire path as a folder if no folder separator not found\n if (token_pos == filename_t::npos)\n {\n token_pos = path.size();\n }\n\n auto subdir = path.substr(0, token_pos);\n\n if (!subdir.empty() && !path_exists(subdir) && !mkdir_(subdir))\n {\n return false; // return error if failed creating dir\n }\n search_offset = token_pos + 1;\n } while (search_offset < path.size());\n\n return true;\n}\n\n// Return directory name from given path or empty string\n// \"abc/file\" => \"abc\"\n// \"abc/\" => \"abc\"\n// \"abc\" => \"\"\n// \"abc///\" => \"abc//\"\nSPDLOG_INLINE filename_t dir_name(filename_t path)\n{\n auto pos = path.find_last_of(folder_seps_filename);\n return pos != filename_t::npos ? path.substr(0, pos) : filename_t{};\n}\n\nstd::string SPDLOG_INLINE getenv(const char *field)\n{\n\n#if defined(_MSC_VER)\n#if defined(__cplusplus_winrt)\n return std::string{}; // not supported under uwp\n#else\n size_t len = 0;\n char buf[128];\n bool ok = ::getenv_s(&len, buf, sizeof(buf), field) == 0;\n return ok ? buf : std::string{};\n#endif\n#else // revert to getenv\n char *buf = ::getenv(field);\n return buf ? buf : std::string{};\n#endif\n}\n\n} // namespace os\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/os.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include // std::time_t\n\nnamespace spdlog {\nnamespace details {\nnamespace os {\n\nSPDLOG_API spdlog::log_clock::time_point now() SPDLOG_NOEXCEPT;\n\nSPDLOG_API std::tm localtime(const std::time_t &time_tt) SPDLOG_NOEXCEPT;\n\nSPDLOG_API std::tm localtime() SPDLOG_NOEXCEPT;\n\nSPDLOG_API std::tm gmtime(const std::time_t &time_tt) SPDLOG_NOEXCEPT;\n\nSPDLOG_API std::tm gmtime() SPDLOG_NOEXCEPT;\n\n// eol definition\n#if !defined(SPDLOG_EOL)\n#ifdef _WIN32\n#define SPDLOG_EOL \"\\r\\n\"\n#else\n#define SPDLOG_EOL \"\\n\"\n#endif\n#endif\n\nSPDLOG_CONSTEXPR static const char *default_eol = SPDLOG_EOL;\n\n// folder separator\n#if !defined(SPDLOG_FOLDER_SEPS)\n#ifdef _WIN32\n#define SPDLOG_FOLDER_SEPS \"\\\\/\"\n#else\n#define SPDLOG_FOLDER_SEPS \"/\"\n#endif\n#endif\n\nSPDLOG_CONSTEXPR static const char folder_seps[] = SPDLOG_FOLDER_SEPS;\nSPDLOG_CONSTEXPR static const filename_t::value_type folder_seps_filename[] = SPDLOG_FILENAME_T(SPDLOG_FOLDER_SEPS);\n\n// fopen_s on non windows for writing\nSPDLOG_API bool fopen_s(FILE **fp, const filename_t &filename, const filename_t &mode);\n\n// Remove filename. return 0 on success\nSPDLOG_API int remove(const filename_t &filename) SPDLOG_NOEXCEPT;\n\n// Remove file if exists. return 0 on success\n// Note: Non atomic (might return failure to delete if concurrently deleted by other process/thread)\nSPDLOG_API int remove_if_exists(const filename_t &filename) SPDLOG_NOEXCEPT;\n\nSPDLOG_API int rename(const filename_t &filename1, const filename_t &filename2) SPDLOG_NOEXCEPT;\n\n// Return if file exists.\nSPDLOG_API bool path_exists(const filename_t &filename) SPDLOG_NOEXCEPT;\n\n// Return file size according to open FILE* object\nSPDLOG_API size_t filesize(FILE *f);\n\n// Return utc offset in minutes or throw spdlog_ex on failure\nSPDLOG_API int utc_minutes_offset(const std::tm &tm = details::os::localtime());\n\n// Return current thread id as size_t\n// It exists because the std::this_thread::get_id() is much slower(especially\n// under VS 2013)\nSPDLOG_API size_t _thread_id() SPDLOG_NOEXCEPT;\n\n// Return current thread id as size_t (from thread local storage)\nSPDLOG_API size_t thread_id() SPDLOG_NOEXCEPT;\n\n// This is avoid msvc issue in sleep_for that happens if the clock changes.\n// See https://github.com/gabime/spdlog/issues/609\nSPDLOG_API void sleep_for_millis(unsigned int milliseconds) SPDLOG_NOEXCEPT;\n\nSPDLOG_API std::string filename_to_str(const filename_t &filename);\n\nSPDLOG_API int pid() SPDLOG_NOEXCEPT;\n\n// Determine if the terminal supports colors\n// Source: https://github.com/agauniyal/rang/\nSPDLOG_API bool is_color_terminal() SPDLOG_NOEXCEPT;\n\n// Determine if the terminal attached\n// Source: https://github.com/agauniyal/rang/\nSPDLOG_API bool in_terminal(FILE *file) SPDLOG_NOEXCEPT;\n\n#if (defined(SPDLOG_WCHAR_TO_UTF8_SUPPORT) || defined(SPDLOG_WCHAR_FILENAMES)) && defined(_WIN32)\nSPDLOG_API void wstr_to_utf8buf(wstring_view_t wstr, memory_buf_t &target);\n\nSPDLOG_API void utf8_to_wstrbuf(string_view_t str, wmemory_buf_t &target);\n#endif\n\n// Return directory name from given path or empty string\n// \"abc/file\" => \"abc\"\n// \"abc/\" => \"abc\"\n// \"abc\" => \"\"\n// \"abc///\" => \"abc//\"\nSPDLOG_API filename_t dir_name(filename_t path);\n\n// Create a dir from the given path.\n// Return true if succeeded or if this dir already exists.\nSPDLOG_API bool create_dir(filename_t path);\n\n// non thread safe, cross platform getenv/getenv_s\n// return empty string if field not found\nSPDLOG_API std::string getenv(const char *field);\n\n} // namespace os\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"os-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/details/periodic_worker-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\nnamespace spdlog {\nnamespace details {\n\nSPDLOG_INLINE periodic_worker::periodic_worker(const std::function &callback_fun, std::chrono::seconds interval)\n{\n active_ = (interval > std::chrono::seconds::zero());\n if (!active_)\n {\n return;\n }\n\n worker_thread_ = std::thread([this, callback_fun, interval]() {\n for (;;)\n {\n std::unique_lock lock(this->mutex_);\n if (this->cv_.wait_for(lock, interval, [this] { return !this->active_; }))\n {\n return; // active_ == false, so exit this thread\n }\n callback_fun();\n }\n });\n}\n\n// stop the worker thread and join it\nSPDLOG_INLINE periodic_worker::~periodic_worker()\n{\n if (worker_thread_.joinable())\n {\n {\n std::lock_guard lock(mutex_);\n active_ = false;\n }\n cv_.notify_one();\n worker_thread_.join();\n }\n}\n\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/periodic_worker.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n// periodic worker thread - periodically executes the given callback function.\n//\n// RAII over the owned thread:\n// creates the thread on construction.\n// stops and joins the thread on destruction (if the thread is executing a callback, wait for it to finish first).\n\n#include \n#include \n#include \n#include \n#include \nnamespace spdlog {\nnamespace details {\n\nclass SPDLOG_API periodic_worker\n{\npublic:\n periodic_worker(const std::function &callback_fun, std::chrono::seconds interval);\n periodic_worker(const periodic_worker &) = delete;\n periodic_worker &operator=(const periodic_worker &) = delete;\n // stop the worker thread and join it\n ~periodic_worker();\n\nprivate:\n bool active_;\n std::thread worker_thread_;\n std::mutex mutex_;\n std::condition_variable cv_;\n};\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"periodic_worker-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/details/registry-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\n#include \n#include \n#include \n#include \n\n#ifndef SPDLOG_DISABLE_DEFAULT_LOGGER\n// support for the default stdout color logger\n#ifdef _WIN32\n#include \n#else\n#include \n#endif\n#endif // SPDLOG_DISABLE_DEFAULT_LOGGER\n\n#include \n#include \n#include \n#include \n#include \n\nnamespace spdlog {\nnamespace details {\n\nSPDLOG_INLINE registry::registry()\n : formatter_(new pattern_formatter())\n{\n\n#ifndef SPDLOG_DISABLE_DEFAULT_LOGGER\n // create default logger (ansicolor_stdout_sink_mt or wincolor_stdout_sink_mt in windows).\n#ifdef _WIN32\n auto color_sink = std::make_shared();\n#else\n auto color_sink = std::make_shared();\n#endif\n\n const char *default_logger_name = \"\";\n default_logger_ = std::make_shared(default_logger_name, std::move(color_sink));\n loggers_[default_logger_name] = default_logger_;\n\n#endif // SPDLOG_DISABLE_DEFAULT_LOGGER\n}\n\nSPDLOG_INLINE registry::~registry() = default;\n\nSPDLOG_INLINE void registry::register_logger(std::shared_ptr new_logger)\n{\n std::lock_guard lock(logger_map_mutex_);\n register_logger_(std::move(new_logger));\n}\n\nSPDLOG_INLINE void registry::initialize_logger(std::shared_ptr new_logger)\n{\n std::lock_guard lock(logger_map_mutex_);\n new_logger->set_formatter(formatter_->clone());\n\n if (err_handler_)\n {\n new_logger->set_error_handler(err_handler_);\n }\n\n // set new level according to previously configured level or default level\n auto it = log_levels_.find(new_logger->name());\n auto new_level = it != log_levels_.end() ? it->second : global_log_level_;\n new_logger->set_level(new_level);\n\n new_logger->flush_on(flush_level_);\n\n if (backtrace_n_messages_ > 0)\n {\n new_logger->enable_backtrace(backtrace_n_messages_);\n }\n\n if (automatic_registration_)\n {\n register_logger_(std::move(new_logger));\n }\n}\n\nSPDLOG_INLINE std::shared_ptr registry::get(const std::string &logger_name)\n{\n std::lock_guard lock(logger_map_mutex_);\n auto found = loggers_.find(logger_name);\n return found == loggers_.end() ? nullptr : found->second;\n}\n\nSPDLOG_INLINE std::shared_ptr registry::default_logger()\n{\n std::lock_guard lock(logger_map_mutex_);\n return default_logger_;\n}\n\n// Return raw ptr to the default logger.\n// To be used directly by the spdlog default api (e.g. spdlog::info)\n// This make the default API faster, but cannot be used concurrently with set_default_logger().\n// e.g do not call set_default_logger() from one thread while calling spdlog::info() from another.\nSPDLOG_INLINE logger *registry::get_default_raw()\n{\n return default_logger_.get();\n}\n\n// set default logger.\n// default logger is stored in default_logger_ (for faster retrieval) and in the loggers_ map.\nSPDLOG_INLINE void registry::set_default_logger(std::shared_ptr new_default_logger)\n{\n std::lock_guard lock(logger_map_mutex_);\n // remove previous default logger from the map\n if (default_logger_ != nullptr)\n {\n loggers_.erase(default_logger_->name());\n }\n if (new_default_logger != nullptr)\n {\n loggers_[new_default_logger->name()] = new_default_logger;\n }\n default_logger_ = std::move(new_default_logger);\n}\n\nSPDLOG_INLINE void registry::set_tp(std::shared_ptr tp)\n{\n std::lock_guard lock(tp_mutex_);\n tp_ = std::move(tp);\n}\n\nSPDLOG_INLINE std::shared_ptr registry::get_tp()\n{\n std::lock_guard lock(tp_mutex_);\n return tp_;\n}\n\n// Set global formatter. Each sink in each logger will get a clone of this object\nSPDLOG_INLINE void registry::set_formatter(std::unique_ptr formatter)\n{\n std::lock_guard lock(logger_map_mutex_);\n formatter_ = std::move(formatter);\n for (auto &l : loggers_)\n {\n l.second->set_formatter(formatter_->clone());\n }\n}\n\nSPDLOG_INLINE void registry::enable_backtrace(size_t n_messages)\n{\n std::lock_guard lock(logger_map_mutex_);\n backtrace_n_messages_ = n_messages;\n\n for (auto &l : loggers_)\n {\n l.second->enable_backtrace(n_messages);\n }\n}\n\nSPDLOG_INLINE void registry::disable_backtrace()\n{\n std::lock_guard lock(logger_map_mutex_);\n backtrace_n_messages_ = 0;\n for (auto &l : loggers_)\n {\n l.second->disable_backtrace();\n }\n}\n\nSPDLOG_INLINE void registry::set_level(level::level_enum log_level)\n{\n std::lock_guard lock(logger_map_mutex_);\n for (auto &l : loggers_)\n {\n l.second->set_level(log_level);\n }\n global_log_level_ = log_level;\n}\n\nSPDLOG_INLINE void registry::flush_on(level::level_enum log_level)\n{\n std::lock_guard lock(logger_map_mutex_);\n for (auto &l : loggers_)\n {\n l.second->flush_on(log_level);\n }\n flush_level_ = log_level;\n}\n\nSPDLOG_INLINE void registry::flush_every(std::chrono::seconds interval)\n{\n std::lock_guard lock(flusher_mutex_);\n auto clbk = [this]() { this->flush_all(); };\n periodic_flusher_ = details::make_unique(clbk, interval);\n}\n\nSPDLOG_INLINE void registry::set_error_handler(err_handler handler)\n{\n std::lock_guard lock(logger_map_mutex_);\n for (auto &l : loggers_)\n {\n l.second->set_error_handler(handler);\n }\n err_handler_ = std::move(handler);\n}\n\nSPDLOG_INLINE void registry::apply_all(const std::function)> &fun)\n{\n std::lock_guard lock(logger_map_mutex_);\n for (auto &l : loggers_)\n {\n fun(l.second);\n }\n}\n\nSPDLOG_INLINE void registry::flush_all()\n{\n std::lock_guard lock(logger_map_mutex_);\n for (auto &l : loggers_)\n {\n l.second->flush();\n }\n}\n\nSPDLOG_INLINE void registry::drop(const std::string &logger_name)\n{\n std::lock_guard lock(logger_map_mutex_);\n loggers_.erase(logger_name);\n if (default_logger_ && default_logger_->name() == logger_name)\n {\n default_logger_.reset();\n }\n}\n\nSPDLOG_INLINE void registry::drop_all()\n{\n std::lock_guard lock(logger_map_mutex_);\n loggers_.clear();\n default_logger_.reset();\n}\n\n// clean all resources and threads started by the registry\nSPDLOG_INLINE void registry::shutdown()\n{\n {\n std::lock_guard lock(flusher_mutex_);\n periodic_flusher_.reset();\n }\n\n drop_all();\n\n {\n std::lock_guard lock(tp_mutex_);\n tp_.reset();\n }\n}\n\nSPDLOG_INLINE std::recursive_mutex ®istry::tp_mutex()\n{\n return tp_mutex_;\n}\n\nSPDLOG_INLINE void registry::set_automatic_registration(bool automatic_registration)\n{\n std::lock_guard lock(logger_map_mutex_);\n automatic_registration_ = automatic_registration;\n}\n\nSPDLOG_INLINE void registry::set_levels(log_levels levels, level::level_enum *global_level)\n{\n std::lock_guard lock(logger_map_mutex_);\n log_levels_ = std::move(levels);\n auto global_level_requested = global_level != nullptr;\n global_log_level_ = global_level_requested ? *global_level : global_log_level_;\n\n for (auto &logger : loggers_)\n {\n auto logger_entry = log_levels_.find(logger.first);\n if (logger_entry != log_levels_.end())\n {\n logger.second->set_level(logger_entry->second);\n }\n else if (global_level_requested)\n {\n logger.second->set_level(*global_level);\n }\n }\n}\n\nSPDLOG_INLINE registry ®istry::instance()\n{\n static registry s_instance;\n return s_instance;\n}\n\nSPDLOG_INLINE void registry::throw_if_exists_(const std::string &logger_name)\n{\n if (loggers_.find(logger_name) != loggers_.end())\n {\n throw_spdlog_ex(\"logger with name '\" + logger_name + \"' already exists\");\n }\n}\n\nSPDLOG_INLINE void registry::register_logger_(std::shared_ptr new_logger)\n{\n auto logger_name = new_logger->name();\n throw_if_exists_(logger_name);\n loggers_[logger_name] = std::move(new_logger);\n}\n\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/registry.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n// Loggers registry of unique name->logger pointer\n// An attempt to create a logger with an already existing name will result with spdlog_ex exception.\n// If user requests a non existing logger, nullptr will be returned\n// This class is thread safe\n\n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace spdlog {\nclass logger;\n\nnamespace details {\nclass thread_pool;\nclass periodic_worker;\n\nclass SPDLOG_API registry\n{\npublic:\n using log_levels = std::unordered_map;\n registry(const registry &) = delete;\n registry &operator=(const registry &) = delete;\n\n void register_logger(std::shared_ptr new_logger);\n void initialize_logger(std::shared_ptr new_logger);\n std::shared_ptr get(const std::string &logger_name);\n std::shared_ptr default_logger();\n\n // Return raw ptr to the default logger.\n // To be used directly by the spdlog default api (e.g. spdlog::info)\n // This make the default API faster, but cannot be used concurrently with set_default_logger().\n // e.g do not call set_default_logger() from one thread while calling spdlog::info() from another.\n logger *get_default_raw();\n\n // set default logger.\n // default logger is stored in default_logger_ (for faster retrieval) and in the loggers_ map.\n void set_default_logger(std::shared_ptr new_default_logger);\n\n void set_tp(std::shared_ptr tp);\n\n std::shared_ptr get_tp();\n\n // Set global formatter. Each sink in each logger will get a clone of this object\n void set_formatter(std::unique_ptr formatter);\n\n void enable_backtrace(size_t n_messages);\n\n void disable_backtrace();\n\n void set_level(level::level_enum log_level);\n\n void flush_on(level::level_enum log_level);\n\n void flush_every(std::chrono::seconds interval);\n\n void set_error_handler(err_handler handler);\n\n void apply_all(const std::function)> &fun);\n\n void flush_all();\n\n void drop(const std::string &logger_name);\n\n void drop_all();\n\n // clean all resources and threads started by the registry\n void shutdown();\n\n std::recursive_mutex &tp_mutex();\n\n void set_automatic_registration(bool automatic_registration);\n\n // set levels for all existing/future loggers. global_level can be null if should not set.\n void set_levels(log_levels levels, level::level_enum *global_level);\n\n static registry &instance();\n\nprivate:\n registry();\n ~registry();\n\n void throw_if_exists_(const std::string &logger_name);\n void register_logger_(std::shared_ptr new_logger);\n bool set_level_from_cfg_(logger *logger);\n std::mutex logger_map_mutex_, flusher_mutex_;\n std::recursive_mutex tp_mutex_;\n std::unordered_map> loggers_;\n log_levels log_levels_;\n std::unique_ptr formatter_;\n spdlog::level::level_enum global_log_level_ = level::info;\n level::level_enum flush_level_ = level::off;\n err_handler err_handler_;\n std::shared_ptr tp_;\n std::unique_ptr periodic_flusher_;\n std::shared_ptr default_logger_;\n bool automatic_registration_ = true;\n size_t backtrace_n_messages_ = 0;\n};\n\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"registry-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/details/synchronous_factory.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \"registry.h\"\n\nnamespace spdlog {\n\n// Default logger factory- creates synchronous loggers\nclass logger;\n\nstruct synchronous_factory\n{\n template\n static std::shared_ptr create(std::string logger_name, SinkArgs &&...args)\n {\n auto sink = std::make_shared(std::forward(args)...);\n auto new_logger = std::make_shared(std::move(logger_name), std::move(sink));\n details::registry::instance().initialize_logger(new_logger);\n return new_logger;\n }\n};\n} // namespace spdlog\n\n" }, { "path": "vendor/spdlog/include/spdlog/details/tcp_client-windows.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#define WIN32_LEAN_AND_MEAN\n// tcp client helper\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#pragma comment(lib, \"Ws2_32.lib\")\n#pragma comment(lib, \"Mswsock.lib\")\n#pragma comment(lib, \"AdvApi32.lib\")\n\nnamespace spdlog {\nnamespace details {\nclass tcp_client\n{\n SOCKET socket_ = INVALID_SOCKET;\n\n static bool winsock_initialized_()\n {\n SOCKET s = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n if (s == INVALID_SOCKET)\n {\n return false;\n }\n else\n {\n closesocket(s);\n return true;\n }\n }\n\n static void init_winsock_()\n {\n WSADATA wsaData;\n auto rv = WSAStartup(MAKEWORD(2, 2), &wsaData);\n if (rv != 0)\n {\n throw_winsock_error_(\"WSAStartup failed\", ::WSAGetLastError());\n }\n }\n\n static void throw_winsock_error_(const std::string &msg, int last_error)\n {\n char buf[512];\n ::FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, NULL, last_error,\n MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), buf, (sizeof(buf) / sizeof(char)), NULL);\n\n throw_spdlog_ex(fmt::format(\"tcp_sink - {}: {}\", msg, buf));\n }\n\npublic:\n bool is_connected() const\n {\n return socket_ != INVALID_SOCKET;\n }\n\n void close()\n {\n ::closesocket(socket_);\n socket_ = INVALID_SOCKET;\n WSACleanup();\n }\n\n SOCKET fd() const\n {\n return socket_;\n }\n\n ~tcp_client()\n {\n close();\n }\n\n // try to connect or throw on failure\n void connect(const std::string &host, int port)\n {\n // initialize winsock if needed\n if (!winsock_initialized_())\n {\n init_winsock_();\n }\n\n if (is_connected())\n {\n close();\n }\n struct addrinfo hints\n {};\n ZeroMemory(&hints, sizeof(hints));\n\n hints.ai_family = AF_INET; // IPv4\n hints.ai_socktype = SOCK_STREAM; // TCP\n hints.ai_flags = AI_NUMERICSERV; // port passed as as numeric value\n hints.ai_protocol = 0;\n\n auto port_str = std::to_string(port);\n struct addrinfo *addrinfo_result;\n auto rv = ::getaddrinfo(host.c_str(), port_str.c_str(), &hints, &addrinfo_result);\n int last_error = 0;\n if (rv != 0)\n {\n last_error = ::WSAGetLastError();\n WSACleanup();\n throw_winsock_error_(\"getaddrinfo failed\", last_error);\n }\n\n // Try each address until we successfully connect(2).\n\n for (auto *rp = addrinfo_result; rp != nullptr; rp = rp->ai_next)\n {\n socket_ = socket(rp->ai_family, rp->ai_socktype, rp->ai_protocol);\n if (socket_ == INVALID_SOCKET)\n {\n last_error = ::WSAGetLastError();\n WSACleanup();\n continue;\n }\n if (::connect(socket_, rp->ai_addr, (int)rp->ai_addrlen) == 0)\n {\n break;\n }\n else\n {\n last_error = ::WSAGetLastError();\n close();\n }\n }\n ::freeaddrinfo(addrinfo_result);\n if (socket_ == INVALID_SOCKET)\n {\n WSACleanup();\n throw_winsock_error_(\"connect failed\", last_error);\n }\n\n // set TCP_NODELAY\n int enable_flag = 1;\n ::setsockopt(socket_, IPPROTO_TCP, TCP_NODELAY, reinterpret_cast(&enable_flag), sizeof(enable_flag));\n }\n\n // Send exactly n_bytes of the given data.\n // On error close the connection and throw.\n void send(const char *data, size_t n_bytes)\n {\n size_t bytes_sent = 0;\n while (bytes_sent < n_bytes)\n {\n const int send_flags = 0;\n auto write_result = ::send(socket_, data + bytes_sent, (int)(n_bytes - bytes_sent), send_flags);\n if (write_result == SOCKET_ERROR)\n {\n int last_error = ::WSAGetLastError();\n close();\n throw_winsock_error_(\"send failed\", last_error);\n }\n\n if (write_result == 0) // (probably should not happen but in any case..)\n {\n break;\n }\n bytes_sent += static_cast(write_result);\n }\n }\n};\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/tcp_client.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifdef _WIN32\n#error include tcp_client-windows.h instead\n#endif\n\n// tcp client helper\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\n#include \n\nnamespace spdlog {\nnamespace details {\nclass tcp_client\n{\n int socket_ = -1;\n\npublic:\n bool is_connected() const\n {\n return socket_ != -1;\n }\n\n void close()\n {\n if (is_connected())\n {\n ::close(socket_);\n socket_ = -1;\n }\n }\n\n int fd() const\n {\n return socket_;\n }\n\n ~tcp_client()\n {\n close();\n }\n\n // try to connect or throw on failure\n void connect(const std::string &host, int port)\n {\n close();\n struct addrinfo hints\n {};\n memset(&hints, 0, sizeof(struct addrinfo));\n hints.ai_family = AF_INET; // IPv4\n hints.ai_socktype = SOCK_STREAM; // TCP\n hints.ai_flags = AI_NUMERICSERV; // port passed as as numeric value\n hints.ai_protocol = 0;\n\n auto port_str = std::to_string(port);\n struct addrinfo *addrinfo_result;\n auto rv = ::getaddrinfo(host.c_str(), port_str.c_str(), &hints, &addrinfo_result);\n if (rv != 0)\n {\n auto msg = fmt::format(\"::getaddrinfo failed: {}\", gai_strerror(rv));\n throw_spdlog_ex(msg);\n }\n\n // Try each address until we successfully connect(2).\n int last_errno = 0;\n for (auto *rp = addrinfo_result; rp != nullptr; rp = rp->ai_next)\n {\n#if defined(SOCK_CLOEXEC)\n const int flags = SOCK_CLOEXEC;\n#else\n const int flags = 0;\n#endif\n socket_ = ::socket(rp->ai_family, rp->ai_socktype | flags, rp->ai_protocol);\n if (socket_ == -1)\n {\n last_errno = errno;\n continue;\n }\n rv = ::connect(socket_, rp->ai_addr, rp->ai_addrlen);\n if (rv == 0)\n {\n break;\n }\n last_errno = errno;\n ::close(socket_);\n socket_ = -1;\n }\n ::freeaddrinfo(addrinfo_result);\n if (socket_ == -1)\n {\n throw_spdlog_ex(\"::connect failed\", last_errno);\n }\n\n // set TCP_NODELAY\n int enable_flag = 1;\n ::setsockopt(socket_, IPPROTO_TCP, TCP_NODELAY, reinterpret_cast(&enable_flag), sizeof(enable_flag));\n\n // prevent sigpipe on systems where MSG_NOSIGNAL is not available\n#if defined(SO_NOSIGPIPE) && !defined(MSG_NOSIGNAL)\n ::setsockopt(socket_, SOL_SOCKET, SO_NOSIGPIPE, reinterpret_cast(&enable_flag), sizeof(enable_flag));\n#endif\n\n#if !defined(SO_NOSIGPIPE) && !defined(MSG_NOSIGNAL)\n#error \"tcp_sink would raise SIGPIPE since niether SO_NOSIGPIPE nor MSG_NOSIGNAL are available\"\n#endif\n }\n\n // Send exactly n_bytes of the given data.\n // On error close the connection and throw.\n void send(const char *data, size_t n_bytes)\n {\n size_t bytes_sent = 0;\n while (bytes_sent < n_bytes)\n {\n#if defined(MSG_NOSIGNAL)\n const int send_flags = MSG_NOSIGNAL;\n#else\n const int send_flags = 0;\n#endif\n auto write_result = ::send(socket_, data + bytes_sent, n_bytes - bytes_sent, send_flags);\n if (write_result < 0)\n {\n close();\n throw_spdlog_ex(\"write(2) failed\", errno);\n }\n\n if (write_result == 0) // (probably should not happen but in any case..)\n {\n break;\n }\n bytes_sent += static_cast(write_result);\n }\n }\n};\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/thread_pool-inl.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#ifndef SPDLOG_HEADER_ONLY\n#include \n#endif\n\n#include \n#include \n\nnamespace spdlog {\nnamespace details {\n\nSPDLOG_INLINE thread_pool::thread_pool(size_t q_max_items, size_t threads_n, std::function on_thread_start)\n : q_(q_max_items)\n{\n if (threads_n == 0 || threads_n > 1000)\n {\n throw_spdlog_ex(\"spdlog::thread_pool(): invalid threads_n param (valid \"\n \"range is 1-1000)\");\n }\n for (size_t i = 0; i < threads_n; i++)\n {\n threads_.emplace_back([this, on_thread_start] {\n on_thread_start();\n this->thread_pool::worker_loop_();\n });\n }\n}\n\nSPDLOG_INLINE thread_pool::thread_pool(size_t q_max_items, size_t threads_n)\n : thread_pool(q_max_items, threads_n, [] {})\n{}\n\n// message all threads to terminate gracefully join them\nSPDLOG_INLINE thread_pool::~thread_pool()\n{\n SPDLOG_TRY\n {\n for (size_t i = 0; i < threads_.size(); i++)\n {\n post_async_msg_(async_msg(async_msg_type::terminate), async_overflow_policy::block);\n }\n\n for (auto &t : threads_)\n {\n t.join();\n }\n }\n SPDLOG_CATCH_STD\n}\n\nvoid SPDLOG_INLINE thread_pool::post_log(async_logger_ptr &&worker_ptr, const details::log_msg &msg, async_overflow_policy overflow_policy)\n{\n async_msg async_m(std::move(worker_ptr), async_msg_type::log, msg);\n post_async_msg_(std::move(async_m), overflow_policy);\n}\n\nvoid SPDLOG_INLINE thread_pool::post_flush(async_logger_ptr &&worker_ptr, async_overflow_policy overflow_policy)\n{\n post_async_msg_(async_msg(std::move(worker_ptr), async_msg_type::flush), overflow_policy);\n}\n\nsize_t SPDLOG_INLINE thread_pool::overrun_counter()\n{\n return q_.overrun_counter();\n}\n\nsize_t SPDLOG_INLINE thread_pool::queue_size()\n{\n return q_.size();\n}\n\nvoid SPDLOG_INLINE thread_pool::post_async_msg_(async_msg &&new_msg, async_overflow_policy overflow_policy)\n{\n if (overflow_policy == async_overflow_policy::block)\n {\n q_.enqueue(std::move(new_msg));\n }\n else\n {\n q_.enqueue_nowait(std::move(new_msg));\n }\n}\n\nvoid SPDLOG_INLINE thread_pool::worker_loop_()\n{\n while (process_next_msg_()) {}\n}\n\n// process next message in the queue\n// return true if this thread should still be active (while no terminate msg\n// was received)\nbool SPDLOG_INLINE thread_pool::process_next_msg_()\n{\n async_msg incoming_async_msg;\n bool dequeued = q_.dequeue_for(incoming_async_msg, std::chrono::seconds(10));\n if (!dequeued)\n {\n return true;\n }\n\n switch (incoming_async_msg.msg_type)\n {\n case async_msg_type::log: {\n incoming_async_msg.worker_ptr->backend_sink_it_(incoming_async_msg);\n return true;\n }\n case async_msg_type::flush: {\n incoming_async_msg.worker_ptr->backend_flush_();\n return true;\n }\n\n case async_msg_type::terminate: {\n return false;\n }\n\n default: {\n assert(false);\n }\n }\n\n return true;\n}\n\n} // namespace details\n} // namespace spdlog\n" }, { "path": "vendor/spdlog/include/spdlog/details/thread_pool.h", "content": "// Copyright(c) 2015-present, Gabi Melman & spdlog contributors.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n\n#pragma once\n\n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\nnamespace spdlog {\nclass async_logger;\n\nnamespace details {\n\nusing async_logger_ptr = std::shared_ptr;\n\nenum class async_msg_type\n{\n log,\n flush,\n terminate\n};\n\n#include \n// Async msg to move to/from the queue\n// Movable only. should never be copied\nstruct async_msg : log_msg_buffer\n{\n async_msg_type msg_type{async_msg_type::log};\n async_logger_ptr worker_ptr;\n\n async_msg() = default;\n ~async_msg() = default;\n\n // should only be moved in or out of the queue..\n async_msg(const async_msg &) = delete;\n\n// support for vs2013 move\n#if defined(_MSC_VER) && _MSC_VER <= 1800\n async_msg(async_msg &&other)\n : log_msg_buffer(std::move(other))\n , msg_type(other.msg_type)\n , worker_ptr(std::move(other.worker_ptr))\n {}\n\n async_msg &operator=(async_msg &&other)\n {\n *static_cast(this) = std::move(other);\n msg_type = other.msg_type;\n worker_ptr = std::move(other.worker_ptr);\n return *this;\n }\n#else // (_MSC_VER) && _MSC_VER <= 1800\n async_msg(async_msg &&) = default;\n async_msg &operator=(async_msg &&) = default;\n#endif\n\n // construct from log_msg with given type\n async_msg(async_logger_ptr &&worker, async_msg_type the_type, const details::log_msg &m)\n : log_msg_buffer{m}\n , msg_type{the_type}\n , worker_ptr{std::move(worker)}\n {}\n\n async_msg(async_logger_ptr &&worker, async_msg_type the_type)\n : log_msg_buffer{}\n , msg_type{the_type}\n , worker_ptr{std::move(worker)}\n {}\n\n explicit async_msg(async_msg_type the_type)\n : async_msg{nullptr, the_type}\n {}\n};\n\nclass SPDLOG_API thread_pool\n{\npublic:\n using item_type = async_msg;\n using q_type = details::mpmc_blocking_queue;\n\n thread_pool(size_t q_max_items, size_t threads_n, std::function on_thread_start);\n thread_pool(size_t q_max_items, size_t threads_n);\n\n // message all threads to terminate gracefully join them\n ~thread_pool();\n\n thread_pool(const thread_pool &) = delete;\n thread_pool &operator=(thread_pool &&) = delete;\n\n void post_log(async_logger_ptr &&worker_ptr, const details::log_msg &msg, async_overflow_policy overflow_policy);\n void post_flush(async_logger_ptr &&worker_ptr, async_overflow_policy overflow_policy);\n size_t overrun_counter();\n size_t queue_size();\n\nprivate:\n q_type q_;\n\n std::vector threads_;\n\n void post_async_msg_(async_msg &&new_msg, async_overflow_policy overflow_policy);\n void worker_loop_();\n\n // process next message in the queue\n // return true if this thread should still be active (while no terminate msg\n // was received)\n bool process_next_msg_();\n};\n\n} // namespace details\n} // namespace spdlog\n\n#ifdef SPDLOG_HEADER_ONLY\n#include \"thread_pool-inl.h\"\n#endif\n" }, { "path": "vendor/spdlog/include/spdlog/details/windows_include.h", "content": "#pragma once\n\n#ifndef NOMINMAX\n#define NOMINMAX // prevent windows redefining min/max\n#endif\n\n#ifndef WIN32_LEAN_AND_MEAN\n#define WIN32_LEAN_AND_MEAN\n#endif\n\n#include \n" }, { "path": "vendor/spdlog/include/spdlog/fmt/bin_to_hex.h", "content": "//\n// Copyright(c) 2015 Gabi Melman.\n// Distributed under the MIT License (http://opensource.org/licenses/MIT)\n//\n\n#pragma once\n\n#include \n\n//\n// Support for logging binary data as hex\n// format flags, any combination of the followng:\n// {:X} - print in uppercase.\n// {:s} - don't separate each byte with space.\n// {:p} - don't print the position on each line start.\n// {:n} - don't split the output to lines.\n// {:a} - show ASCII if :n is not set\n\n//\n// Examples:\n//\n// std::vector v(200, 0x0b);\n// logger->info(\"Some buffer {}\", spdlog::to_hex(v));\n// char buf[128];\n// logger->info(\"Some buffer {:X}\", spdlog::to_hex(std::begin(buf), std::end(buf)));\n// logger->info(\"Some buffer {:X}\", spdlog::to_hex(std::begin(buf), std::end(buf), 16));\n\nnamespace spdlog {\nnamespace details {\n\ntemplate\nclass dump_info\n{\npublic:\n dump_info(It range_begin, It range_end, size_t size_per_line)\n : begin_(range_begin)\n , end_(range_end)\n , size_per_line_(size_per_line)\n {}\n\n It begin() const\n {\n return begin_;\n }\n It end() const\n {\n return end_;\n }\n size_t size_per_line() const\n {\n return size_per_line_;\n }\n\nprivate:\n It begin_, end_;\n size_t size_per_line_;\n};\n} // namespace details\n\n// create a dump_info that wraps the given container\ntemplate\ninline details::dump_info to_hex(const Container &container, size_t size_per_line = 32)\n{\n static_assert(sizeof(typename Container::value_type) == 1, \"sizeof(Container::value_type) != 1\");\n using Iter = typename Container::const_iterator;\n return details::dump_info(std::begin(container), std::end(container), size_per_line);\n}\n\n// create dump_info from ranges\ntemplate\ninline details::dump_info to_hex(const It range_begin, const It range_end, size_t size_per_line = 32)\n{\n return details::dump_info(range_begin, range_end, size_per_line);\n}\n\n} // namespace spdlog\n\nnamespace fmt {\n\ntemplate\nstruct formatter>\n{\n const char delimiter = ' ';\n bool put_newlines = true;\n bool put_delimiters = true;\n bool use_uppercase = false;\n bool put_positions = true; // position on start of each line\n bool show_ascii = false;\n\n // parse the format string flags\n template\n auto parse(ParseContext &ctx) -> decltype(ctx.begin())\n {\n auto it = ctx.begin();\n while (it != ctx.end() && *it != '}')\n {\n switch (*it)\n {\n case 'X':\n use_uppercase = true;\n break;\n case 's':\n put_delimiters = false;\n break;\n case 'p':\n put_positions = false;\n break;\n case 'n':\n put_newlines = false;\n show_ascii = false;\n break;\n case 'a':\n if (put_newlines)\n {\n show_ascii = true;\n }\n break;\n }\n\n ++it;\n }\n return it;\n }\n\n // format the given bytes range as hex\n template\n auto format(const spdlog::details::dump_info &the_range, FormatContext &ctx) -> decltype(ctx.out())\n {\n SPDLOG_CONSTEXPR const char *hex_upper = \"0123456789ABCDEF\";\n SPDLOG_CONSTEXPR const char *hex_lower = \"0123456789abcdef\";\n const char *hex_chars = use_uppercase ? hex_upper : hex_lower;\n\n#if FMT_VERSION < 60000\n auto inserter = ctx.begin();\n#else\n auto inserter = ctx.out();\n#endif\n\n int size_per_line = static_cast(the_range.size_per_line());\n auto start_of_line = the_range.begin();\n for (auto i = the_range.begin(); i != the_range.end(); i++)\n {\n auto ch = static_cast(*i);\n\n if (put_newlines && (i == the_range.begin() || i - start_of_line >= size_per_line))\n {\n if (show_ascii && i != the_range.begin())\n {\n *inserter++ = delimiter;\n *inserter++ = delimiter;\n for (auto j = start_of_line; j < i; j++)\n {\n auto pc = static_cast(*j);\n *inserter++ = std::isprint(pc) ? static_cast(*j) : '.';\n }\n }\n\n put_newline(inserter, static_cast(i - the_range.begin()));\n\n // put first byte without delimiter in front of it\n *inserter++ = hex_chars[(ch >> 4) & 0x0f];\n *inserter++ = hex_chars[ch & 0x0f];\n start_of_line = i;\n continue;\n }\n\n if (put_delimiters)\n {\n *inserter++ = delimiter;\n }\n\n *inserter++ = hex_chars[(ch >> 4) & 0x0f];\n *inserter++ = hex_chars[ch & 0x0f];\n }\n if (show_ascii) // add ascii to last line\n {\n if (the_range.end() - the_range.begin() > size_per_line)\n {\n auto blank_num = size_per_line - (the_range.end() - start_of_line);\n while (blank_num-- > 0)\n {\n *inserter++ = delimiter;\n *inserter++ = delimiter;\n if (put_delimiters)\n {\n *inserter++ = delimiter;\n }\n }\n }\n *inserter++ = delimiter;\n *inserter++ = delimiter;\n for (auto j = start_of_line; j != the_range.end(); j++)\n {\n auto pc = static_cast(*j);\n *inserter++ = std::isprint(pc) ? static_cast(*j) : '.';\n }\n }\n return inserter;\n }\n\n // put newline(and position header)\n template\n void put_newline(It inserter, std::size_t pos)\n {\n#ifdef _WIN32\n *inserter++ = '\\r';\n#endif\n *inserter++ = '\\n';\n\n if (put_positions)\n {\n fmt::format_to(inserter, \"{:04X}: \", pos);\n }\n }\n};\n} // namespace fmt\n" }, { "path": "vendor/spdlog/include/spdlog/fmt/bundled/args.h", "content": "// Formatting library for C++ - dynamic format arguments\n//\n// Copyright (c) 2012 - present, Victor Zverovich\n// All rights reserved.\n//\n// For the license information refer to format.h.\n\n#ifndef FMT_ARGS_H_\n#define FMT_ARGS_H_\n\n#include // std::reference_wrapper\n#include // std::unique_ptr\n#include \n\n#include \"core.h\"\n\nFMT_BEGIN_NAMESPACE\n\nnamespace detail {\n\ntemplate struct is_reference_wrapper : std::false_type {};\ntemplate \nstruct is_reference_wrapper> : std::true_type {};\n\ntemplate const T& unwrap(const T& v) { return v; }\ntemplate const T& unwrap(const std::reference_wrapper& v) {\n return static_cast(v);\n}\n\nclass dynamic_arg_list {\n // Workaround for clang's -Wweak-vtables. Unlike for regular classes, for\n // templates it doesn't complain about inability to deduce single translation\n // unit for placing vtable. So storage_node_base is made a fake template.\n template struct node {\n virtual ~node() = default;\n std::unique_ptr> next;\n };\n\n template struct typed_node : node<> {\n T value;\n\n template \n FMT_CONSTEXPR typed_node(const Arg& arg) : value(arg) {}\n\n template \n FMT_CONSTEXPR typed_node(const basic_string_view& arg)\n : value(arg.data(), arg.size()) {}\n };\n\n std::unique_ptr> head_;\n\n public:\n template const T& push(const Arg& arg) {\n auto new_node = std::unique_ptr>(new typed_node(arg));\n auto& value = new_node->value;\n new_node->next = std::move(head_);\n head_ = std::move(new_node);\n return value;\n }\n};\n} // namespace detail\n\n/**\n \\rst\n A dynamic version of `fmt::format_arg_store`.\n It's equipped with a storage to potentially temporary objects which lifetimes\n could be shorter than the format arguments object.\n\n It can be implicitly converted into `~fmt::basic_format_args` for passing\n into type-erased formatting functions such as `~fmt::vformat`.\n \\endrst\n */\ntemplate \nclass dynamic_format_arg_store\n#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409\n // Workaround a GCC template argument substitution bug.\n : public basic_format_args\n#endif\n{\n private:\n using char_type = typename Context::char_type;\n\n template struct need_copy {\n static constexpr detail::type mapped_type =\n detail::mapped_type_constant::value;\n\n enum {\n value = !(detail::is_reference_wrapper::value ||\n std::is_same>::value ||\n std::is_same>::value ||\n (mapped_type != detail::type::cstring_type &&\n mapped_type != detail::type::string_type &&\n mapped_type != detail::type::custom_type))\n };\n };\n\n template \n using stored_type = conditional_t::value &&\n !has_formatter::value &&\n !detail::is_reference_wrapper::value,\n std::basic_string, T>;\n\n // Storage of basic_format_arg must be contiguous.\n std::vector> data_;\n std::vector> named_info_;\n\n // Storage of arguments not fitting into basic_format_arg must grow\n // without relocation because items in data_ refer to it.\n detail::dynamic_arg_list dynamic_args_;\n\n friend class basic_format_args;\n\n unsigned long long get_types() const {\n return detail::is_unpacked_bit | data_.size() |\n (named_info_.empty()\n ? 0ULL\n : static_cast(detail::has_named_args_bit));\n }\n\n const basic_format_arg* data() const {\n return named_info_.empty() ? data_.data() : data_.data() + 1;\n }\n\n template void emplace_arg(const T& arg) {\n data_.emplace_back(detail::make_arg(arg));\n }\n\n template \n void emplace_arg(const detail::named_arg& arg) {\n if (named_info_.empty()) {\n constexpr const detail::named_arg_info* zero_ptr{nullptr};\n data_.insert(data_.begin(), {zero_ptr, 0});\n }\n data_.emplace_back(detail::make_arg(detail::unwrap(arg.value)));\n auto pop_one = [](std::vector>* data) {\n data->pop_back();\n };\n std::unique_ptr>, decltype(pop_one)>\n guard{&data_, pop_one};\n named_info_.push_back({arg.name, static_cast(data_.size() - 2u)});\n data_[0].value_.named_args = {named_info_.data(), named_info_.size()};\n guard.release();\n }\n\n public:\n /**\n \\rst\n Adds an argument into the dynamic store for later passing to a formatting\n function.\n\n Note that custom types and string types (but not string views) are copied\n into the store dynamically allocating memory if necessary.\n\n **Example**::\n\n fmt::dynamic_format_arg_store store;\n store.push_back(42);\n store.push_back(\"abc\");\n store.push_back(1.5f);\n std::string result = fmt::vformat(\"{} and {} and {}\", store);\n \\endrst\n */\n template void push_back(const T& arg) {\n if (detail::const_check(need_copy::value))\n emplace_arg(dynamic_args_.push>(arg));\n else\n emplace_arg(detail::unwrap(arg));\n }\n\n /**\n \\rst\n Adds a reference to the argument into the dynamic store for later passing to\n a formatting function.\n\n **Example**::\n\n fmt::dynamic_format_arg_store store;\n char band[] = \"Rolling Stones\";\n store.push_back(std::cref(band));\n band[9] = 'c'; // Changing str affects the output.\n std::string result = fmt::vformat(\"{}\", store);\n // result == \"Rolling Scones\"\n \\endrst\n */\n template void push_back(std::reference_wrapper arg) {\n static_assert(\n need_copy::value,\n \"objects of built-in types and string views are always copied\");\n emplace_arg(arg.get());\n }\n\n /**\n Adds named argument into the dynamic store for later passing to a formatting\n function. ``std::reference_wrapper`` is supported to avoid copying of the\n argument. The name is always copied into the store.\n */\n template \n void push_back(const detail::named_arg& arg) {\n const char_type* arg_name =\n dynamic_args_.push>(arg.name).c_str();\n if (detail::const_check(need_copy::value)) {\n emplace_arg(\n fmt::arg(arg_name, dynamic_args_.push>(arg.value)));\n } else {\n emplace_arg(fmt::arg(arg_name, arg.value));\n }\n }\n\n /** Erase all elements from the store */\n void clear() {\n data_.clear();\n named_info_.clear();\n dynamic_args_ = detail::dynamic_arg_list();\n }\n\n /**\n \\rst\n Reserves space to store at least *new_cap* arguments including\n *new_cap_named* named arguments.\n \\endrst\n */\n void reserve(size_t new_cap, size_t new_cap_named) {\n FMT_ASSERT(new_cap >= new_cap_named,\n \"Set of arguments includes set of named arguments\");\n data_.reserve(new_cap);\n named_info_.reserve(new_cap_named);\n }\n};\n\nFMT_END_NAMESPACE\n\n#endif // FMT_ARGS_H_\n" }, { "path": "vendor/spdlog/include/spdlog/fmt/bundled/chrono.h", "content": "// Formatting library for C++ - chrono support\n//\n// Copyright (c) 2012 - present, Victor Zverovich\n// All rights reserved.\n//\n// For the license information refer to format.h.\n\n#ifndef FMT_CHRONO_H_\n#define FMT_CHRONO_H_\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"format.h\"\n\nFMT_BEGIN_NAMESPACE\n\n// Enable safe chrono durations, unless explicitly disabled.\n#ifndef FMT_SAFE_DURATION_CAST\n# define FMT_SAFE_DURATION_CAST 1\n#endif\n#if FMT_SAFE_DURATION_CAST\n\n// For conversion between std::chrono::durations without undefined\n// behaviour or erroneous results.\n// This is a stripped down version of duration_cast, for inclusion in fmt.\n// See https://github.com/pauldreik/safe_duration_cast\n//\n// Copyright Paul Dreik 2019\nnamespace safe_duration_cast {\n\ntemplate ::value &&\n std::numeric_limits::is_signed ==\n std::numeric_limits::is_signed)>\nFMT_CONSTEXPR To lossless_integral_conversion(const From from, int& ec) {\n ec = 0;\n using F = std::numeric_limits;\n using T = std::numeric_limits;\n static_assert(F::is_integer, \"From must be integral\");\n static_assert(T::is_integer, \"To must be integral\");\n\n // A and B are both signed, or both unsigned.\n if (F::digits <= T::digits) {\n // From fits in To without any problem.\n } else {\n // From does not always fit in To, resort to a dynamic check.\n if (from < (T::min)() || from > (T::max)()) {\n // outside range.\n ec = 1;\n return {};\n }\n }\n return static_cast(from);\n}\n\n/**\n * converts From to To, without loss. If the dynamic value of from\n * can't be converted to To without loss, ec is set.\n */\ntemplate ::value &&\n std::numeric_limits::is_signed !=\n std::numeric_limits::is_signed)>\nFMT_CONSTEXPR To lossless_integral_conversion(const From from, int& ec) {\n ec = 0;\n using F = std::numeric_limits;\n using T = std::numeric_limits;\n static_assert(F::is_integer, \"From must be integral\");\n static_assert(T::is_integer, \"To must be integral\");\n\n if (detail::const_check(F::is_signed && !T::is_signed)) {\n // From may be negative, not allowed!\n if (fmt::detail::is_negative(from)) {\n ec = 1;\n return {};\n }\n // From is positive. Can it always fit in To?\n if (F::digits > T::digits &&\n from > static_cast(detail::max_value())) {\n ec = 1;\n return {};\n }\n }\n\n if (!F::is_signed && T::is_signed && F::digits >= T::digits &&\n from > static_cast(detail::max_value())) {\n ec = 1;\n return {};\n }\n return static_cast(from); // Lossless conversion.\n}\n\ntemplate ::value)>\nFMT_CONSTEXPR To lossless_integral_conversion(const From from, int& ec) {\n ec = 0;\n return from;\n} // function\n\n// clang-format off\n/**\n * converts From to To if possible, otherwise ec is set.\n *\n * input | output\n * ---------------------------------|---------------\n * NaN | NaN\n * Inf | Inf\n * normal, fits in output | converted (possibly lossy)\n * normal, does not fit in output | ec is set\n * subnormal | best effort\n * -Inf | -Inf\n */\n// clang-format on\ntemplate ::value)>\nFMT_CONSTEXPR To safe_float_conversion(const From from, int& ec) {\n ec = 0;\n using T = std::numeric_limits;\n static_assert(std::is_floating_point::value, \"From must be floating\");\n static_assert(std::is_floating_point::value, \"To must be floating\");\n\n // catch the only happy case\n if (std::isfinite(from)) {\n if (from >= T::lowest() && from <= (T::max)()) {\n return static_cast(from);\n }\n // not within range.\n ec = 1;\n return {};\n }\n\n // nan and inf will be preserved\n return static_cast(from);\n} // function\n\ntemplate ::value)>\nFMT_CONSTEXPR To safe_float_conversion(const From from, int& ec) {\n ec = 0;\n static_assert(std::is_floating_point::value, \"From must be floating\");\n return from;\n}\n\n/**\n * safe duration cast between integral durations\n */\ntemplate ::value),\n FMT_ENABLE_IF(std::is_integral::value)>\nTo safe_duration_cast(std::chrono::duration from,\n int& ec) {\n using From = std::chrono::duration;\n ec = 0;\n // the basic idea is that we need to convert from count() in the from type\n // to count() in the To type, by multiplying it with this:\n struct Factor\n : std::ratio_divide {};\n\n static_assert(Factor::num > 0, \"num must be positive\");\n static_assert(Factor::den > 0, \"den must be positive\");\n\n // the conversion is like this: multiply from.count() with Factor::num\n // /Factor::den and convert it to To::rep, all this without\n // overflow/underflow. let's start by finding a suitable type that can hold\n // both To, From and Factor::num\n using IntermediateRep =\n typename std::common_type::type;\n\n // safe conversion to IntermediateRep\n IntermediateRep count =\n lossless_integral_conversion(from.count(), ec);\n if (ec) return {};\n // multiply with Factor::num without overflow or underflow\n if (detail::const_check(Factor::num != 1)) {\n const auto max1 = detail::max_value() / Factor::num;\n if (count > max1) {\n ec = 1;\n return {};\n }\n const auto min1 =\n (std::numeric_limits::min)() / Factor::num;\n if (count < min1) {\n ec = 1;\n return {};\n }\n count *= Factor::num;\n }\n\n if (detail::const_check(Factor::den != 1)) count /= Factor::den;\n auto tocount = lossless_integral_conversion(count, ec);\n return ec ? To() : To(tocount);\n}\n\n/**\n * safe duration_cast between floating point durations\n */\ntemplate ::value),\n FMT_ENABLE_IF(std::is_floating_point::value)>\nTo safe_duration_cast(std::chrono::duration from,\n int& ec) {\n using From = std::chrono::duration;\n ec = 0;\n if (std::isnan(from.count())) {\n // nan in, gives nan out. easy.\n return To{std::numeric_limits::quiet_NaN()};\n }\n // maybe we should also check if from is denormal, and decide what to do about\n // it.\n\n // +-inf should be preserved.\n if (std::isinf(from.count())) {\n return To{from.count()};\n }\n\n // the basic idea is that we need to convert from count() in the from type\n // to count() in the To type, by multiplying it with this:\n struct Factor\n : std::ratio_divide {};\n\n static_assert(Factor::num > 0, \"num must be positive\");\n static_assert(Factor::den > 0, \"den must be positive\");\n\n // the conversion is like this: multiply from.count() with Factor::num\n // /Factor::den and convert it to To::rep, all this without\n // overflow/underflow. let's start by finding a suitable type that can hold\n // both To, From and Factor::num\n using IntermediateRep =\n typename std::common_type::type;\n\n // force conversion of From::rep -> IntermediateRep to be safe,\n // even if it will never happen be narrowing in this context.\n IntermediateRep count =\n safe_float_conversion(from.count(), ec);\n if (ec) {\n return {};\n }\n\n // multiply with Factor::num without overflow or underflow\n if (Factor::num != 1) {\n constexpr auto max1 = detail::max_value() /\n static_cast(Factor::num);\n if (count > max1) {\n ec = 1;\n return {};\n }\n constexpr auto min1 = std::numeric_limits::lowest() /\n static_cast(Factor::num);\n if (count < min1) {\n ec = 1;\n return {};\n }\n count *= static_cast(Factor::num);\n }\n\n // this can't go wrong, right? den>0 is checked earlier.\n if (Factor::den != 1) {\n using common_t = typename std::common_type::type;\n count /= static_cast(Factor::den);\n }\n\n // convert to the to type, safely\n using ToRep = typename To::rep;\n\n const ToRep tocount = safe_float_conversion(count, ec);\n if (ec) {\n return {};\n }\n return To{tocount};\n}\n} // namespace safe_duration_cast\n#endif\n\n// Prevents expansion of a preceding token as a function-style macro.\n// Usage: f FMT_NOMACRO()\n#define FMT_NOMACRO\n\nnamespace detail {\ntemplate struct null {};\ninline null<> localtime_r FMT_NOMACRO(...) { return null<>(); }\ninline null<> localtime_s(...) { return null<>(); }\ninline null<> gmtime_r(...) { return null<>(); }\ninline null<> gmtime_s(...) { return null<>(); }\n\ninline auto do_write(const std::tm& time, const std::locale& loc, char format,\n char modifier) -> std::string {\n auto&& os = std::ostringstream();\n os.imbue(loc);\n using iterator = std::ostreambuf_iterator;\n const auto& facet = std::use_facet>(loc);\n auto end = facet.put(os, os, ' ', &time, format, modifier);\n if (end.failed()) FMT_THROW(format_error(\"failed to format time\"));\n auto str = os.str();\n if (!detail::is_utf8() || loc == std::locale::classic()) return str;\n // char16_t and char32_t codecvts are broken in MSVC (linkage errors) and\n // gcc-4.\n#if FMT_MSC_VER != 0 || \\\n (defined(__GLIBCXX__) && !defined(_GLIBCXX_USE_DUAL_ABI))\n // The _GLIBCXX_USE_DUAL_ABI macro is always defined in libstdc++ from gcc-5\n // and newer.\n using code_unit = wchar_t;\n#else\n using code_unit = char32_t;\n#endif\n auto& f = std::use_facet>(loc);\n auto mb = std::mbstate_t();\n const char* from_next = nullptr;\n code_unit* to_next = nullptr;\n constexpr size_t buf_size = 32;\n code_unit buf[buf_size] = {};\n auto result = f.in(mb, str.data(), str.data() + str.size(), from_next, buf,\n buf + buf_size, to_next);\n if (result != std::codecvt_base::ok)\n FMT_THROW(format_error(\"failed to format time\"));\n str.clear();\n for (code_unit* p = buf; p != to_next; ++p) {\n uint32_t c = static_cast(*p);\n if (sizeof(code_unit) == 2 && c >= 0xd800 && c <= 0xdfff) {\n // surrogate pair\n ++p;\n if (p == to_next || (c & 0xfc00) != 0xd800 || (*p & 0xfc00) != 0xdc00) {\n FMT_THROW(format_error(\"failed to format time\"));\n }\n c = (c << 10) + static_cast(*p) - 0x35fdc00;\n }\n if (c < 0x80) {\n str.push_back(static_cast(c));\n } else if (c < 0x800) {\n str.push_back(static_cast(0xc0 | (c >> 6)));\n str.push_back(static_cast(0x80 | (c & 0x3f)));\n } else if ((c >= 0x800 && c <= 0xd7ff) || (c >= 0xe000 && c <= 0xffff)) {\n str.push_back(static_cast(0xe0 | (c >> 12)));\n str.push_back(static_cast(0x80 | ((c & 0xfff) >> 6)));\n str.push_back(static_cast(0x80 | (c & 0x3f)));\n } else if (c >= 0x10000 && c <= 0x10ffff) {\n str.push_back(static_cast(0xf0 | (c >> 18)));\n str.push_back(static_cast(0x80 | ((c & 0x3ffff) >> 12)));\n str.push_back(static_cast(0x80 | ((c & 0xfff) >> 6)));\n str.push_back(static_cast(0x80 | (c & 0x3f)));\n } else {\n FMT_THROW(format_error(\"failed to format time\"));\n }\n }\n return str;\n}\n\ntemplate \nauto write(OutputIt out, const std::tm& time, const std::locale& loc,\n char format, char modifier = 0) -> OutputIt {\n auto str = do_write(time, loc, format, modifier);\n return std::copy(str.begin(), str.end(), out);\n}\n} // namespace detail\n\nFMT_MODULE_EXPORT_BEGIN\n\n/**\n Converts given time since epoch as ``std::time_t`` value into calendar time,\n expressed in local time. Unlike ``std::localtime``, this function is\n thread-safe on most platforms.\n */\ninline std::tm localtime(std::time_t time) {\n struct dispatcher {\n std::time_t time_;\n std::tm tm_;\n\n dispatcher(std::time_t t) : time_(t) {}\n\n bool run() {\n using namespace fmt::detail;\n return handle(localtime_r(&time_, &tm_));\n }\n\n bool handle(std::tm* tm) { return tm != nullptr; }\n\n bool handle(detail::null<>) {\n using namespace fmt::detail;\n return fallback(localtime_s(&tm_, &time_));\n }\n\n bool fallback(int res) { return res == 0; }\n\n#if !FMT_MSC_VER\n bool fallback(detail::null<>) {\n using namespace fmt::detail;\n std::tm* tm = std::localtime(&time_);\n if (tm) tm_ = *tm;\n return tm != nullptr;\n }\n#endif\n };\n dispatcher lt(time);\n // Too big time values may be unsupported.\n if (!lt.run()) FMT_THROW(format_error(\"time_t value out of range\"));\n return lt.tm_;\n}\n\ninline std::tm localtime(\n std::chrono::time_point time_point) {\n return localtime(std::chrono::system_clock::to_time_t(time_point));\n}\n\n/**\n Converts given time since epoch as ``std::time_t`` value into calendar time,\n expressed in Coordinated Universal Time (UTC). Unlike ``std::gmtime``, this\n function is thread-safe on most platforms.\n */\ninline std::tm gmtime(std::time_t time) {\n struct dispatcher {\n std::time_t time_;\n std::tm tm_;\n\n dispatcher(std::time_t t) : time_(t) {}\n\n bool run() {\n using namespace fmt::detail;\n return handle(gmtime_r(&time_, &tm_));\n }\n\n bool handle(std::tm* tm) { return tm != nullptr; }\n\n bool handle(detail::null<>) {\n using namespace fmt::detail;\n return fallback(gmtime_s(&tm_, &time_));\n }\n\n bool fallback(int res) { return res == 0; }\n\n#if !FMT_MSC_VER\n bool fallback(detail::null<>) {\n std::tm* tm = std::gmtime(&time_);\n if (tm) tm_ = *tm;\n return tm != nullptr;\n }\n#endif\n };\n dispatcher gt(time);\n // Too big time values may be unsupported.\n if (!gt.run()) FMT_THROW(format_error(\"time_t value out of range\"));\n return gt.tm_;\n}\n\ninline std::tm gmtime(\n std::chrono::time_point time_point) {\n return gmtime(std::chrono::system_clock::to_time_t(time_point));\n}\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\ninline size_t strftime(char* str, size_t count, const char* format,\n const std::tm* time) {\n // Assign to a pointer to suppress GCCs -Wformat-nonliteral\n // First assign the nullptr to suppress -Wsuggest-attribute=format\n std::size_t (*strftime)(char*, std::size_t, const char*, const std::tm*) =\n nullptr;\n strftime = std::strftime;\n return strftime(str, count, format, time);\n}\n\ninline size_t strftime(wchar_t* str, size_t count, const wchar_t* format,\n const std::tm* time) {\n // See above\n std::size_t (*wcsftime)(wchar_t*, std::size_t, const wchar_t*,\n const std::tm*) = nullptr;\n wcsftime = std::wcsftime;\n return wcsftime(str, count, format, time);\n}\n\nFMT_END_DETAIL_NAMESPACE\n\ntemplate \nstruct formatter,\n Char> : formatter {\n FMT_CONSTEXPR formatter() {\n this->specs = {default_specs, sizeof(default_specs) / sizeof(Char)};\n }\n\n template \n FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {\n auto it = ctx.begin();\n if (it != ctx.end() && *it == ':') ++it;\n auto end = it;\n while (end != ctx.end() && *end != '}') ++end;\n if (end != it) this->specs = {it, detail::to_unsigned(end - it)};\n return end;\n }\n\n template \n auto format(std::chrono::time_point val,\n FormatContext& ctx) -> decltype(ctx.out()) {\n std::tm time = localtime(val);\n return formatter::format(time, ctx);\n }\n\n static constexpr Char default_specs[] = {'%', 'Y', '-', '%', 'm', '-',\n '%', 'd', ' ', '%', 'H', ':',\n '%', 'M', ':', '%', 'S'};\n};\n\ntemplate \nconstexpr Char\n formatter,\n Char>::default_specs[];\n\ntemplate struct formatter {\n template \n FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {\n auto it = ctx.begin();\n if (it != ctx.end() && *it == ':') ++it;\n auto end = it;\n while (end != ctx.end() && *end != '}') ++end;\n specs = {it, detail::to_unsigned(end - it)};\n return end;\n }\n\n template \n auto format(const std::tm& tm, FormatContext& ctx) const\n -> decltype(ctx.out()) {\n basic_memory_buffer tm_format;\n tm_format.append(specs.begin(), specs.end());\n // By appending an extra space we can distinguish an empty result that\n // indicates insufficient buffer size from a guaranteed non-empty result\n // https://github.com/fmtlib/fmt/issues/2238\n tm_format.push_back(' ');\n tm_format.push_back('\\0');\n basic_memory_buffer buf;\n size_t start = buf.size();\n for (;;) {\n size_t size = buf.capacity() - start;\n size_t count = detail::strftime(&buf[start], size, &tm_format[0], &tm);\n if (count != 0) {\n buf.resize(start + count);\n break;\n }\n const size_t MIN_GROWTH = 10;\n buf.reserve(buf.capacity() + (size > MIN_GROWTH ? size : MIN_GROWTH));\n }\n // Remove the extra space.\n return std::copy(buf.begin(), buf.end() - 1, ctx.out());\n }\n\n basic_string_view specs;\n};\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\ntemplate FMT_CONSTEXPR inline const char* get_units() {\n if (std::is_same::value) return \"as\";\n if (std::is_same::value) return \"fs\";\n if (std::is_same::value) return \"ps\";\n if (std::is_same::value) return \"ns\";\n if (std::is_same::value) return \"µs\";\n if (std::is_same::value) return \"ms\";\n if (std::is_same::value) return \"cs\";\n if (std::is_same::value) return \"ds\";\n if (std::is_same>::value) return \"s\";\n if (std::is_same::value) return \"das\";\n if (std::is_same::value) return \"hs\";\n if (std::is_same::value) return \"ks\";\n if (std::is_same::value) return \"Ms\";\n if (std::is_same::value) return \"Gs\";\n if (std::is_same::value) return \"Ts\";\n if (std::is_same::value) return \"Ps\";\n if (std::is_same::value) return \"Es\";\n if (std::is_same>::value) return \"m\";\n if (std::is_same>::value) return \"h\";\n return nullptr;\n}\n\nenum class numeric_system {\n standard,\n // Alternative numeric system, e.g. 十二 instead of 12 in ja_JP locale.\n alternative\n};\n\n// Parses a put_time-like format string and invokes handler actions.\ntemplate \nFMT_CONSTEXPR const Char* parse_chrono_format(const Char* begin,\n const Char* end,\n Handler&& handler) {\n auto ptr = begin;\n while (ptr != end) {\n auto c = *ptr;\n if (c == '}') break;\n if (c != '%') {\n ++ptr;\n continue;\n }\n if (begin != ptr) handler.on_text(begin, ptr);\n ++ptr; // consume '%'\n if (ptr == end) FMT_THROW(format_error(\"invalid format\"));\n c = *ptr++;\n switch (c) {\n case '%':\n handler.on_text(ptr - 1, ptr);\n break;\n case 'n': {\n const Char newline[] = {'\\n'};\n handler.on_text(newline, newline + 1);\n break;\n }\n case 't': {\n const Char tab[] = {'\\t'};\n handler.on_text(tab, tab + 1);\n break;\n }\n // Day of the week:\n case 'a':\n handler.on_abbr_weekday();\n break;\n case 'A':\n handler.on_full_weekday();\n break;\n case 'w':\n handler.on_dec0_weekday(numeric_system::standard);\n break;\n case 'u':\n handler.on_dec1_weekday(numeric_system::standard);\n break;\n // Month:\n case 'b':\n handler.on_abbr_month();\n break;\n case 'B':\n handler.on_full_month();\n break;\n // Hour, minute, second:\n case 'H':\n handler.on_24_hour(numeric_system::standard);\n break;\n case 'I':\n handler.on_12_hour(numeric_system::standard);\n break;\n case 'M':\n handler.on_minute(numeric_system::standard);\n break;\n case 'S':\n handler.on_second(numeric_system::standard);\n break;\n // Other:\n case 'c':\n handler.on_datetime(numeric_system::standard);\n break;\n case 'x':\n handler.on_loc_date(numeric_system::standard);\n break;\n case 'X':\n handler.on_loc_time(numeric_system::standard);\n break;\n case 'D':\n handler.on_us_date();\n break;\n case 'F':\n handler.on_iso_date();\n break;\n case 'r':\n handler.on_12_hour_time();\n break;\n case 'R':\n handler.on_24_hour_time();\n break;\n case 'T':\n handler.on_iso_time();\n break;\n case 'p':\n handler.on_am_pm();\n break;\n case 'Q':\n handler.on_duration_value();\n break;\n case 'q':\n handler.on_duration_unit();\n break;\n case 'z':\n handler.on_utc_offset();\n break;\n case 'Z':\n handler.on_tz_name();\n break;\n // Alternative representation:\n case 'E': {\n if (ptr == end) FMT_THROW(format_error(\"invalid format\"));\n c = *ptr++;\n switch (c) {\n case 'c':\n handler.on_datetime(numeric_system::alternative);\n break;\n case 'x':\n handler.on_loc_date(numeric_system::alternative);\n break;\n case 'X':\n handler.on_loc_time(numeric_system::alternative);\n break;\n default:\n FMT_THROW(format_error(\"invalid format\"));\n }\n break;\n }\n case 'O':\n if (ptr == end) FMT_THROW(format_error(\"invalid format\"));\n c = *ptr++;\n switch (c) {\n case 'w':\n handler.on_dec0_weekday(numeric_system::alternative);\n break;\n case 'u':\n handler.on_dec1_weekday(numeric_system::alternative);\n break;\n case 'H':\n handler.on_24_hour(numeric_system::alternative);\n break;\n case 'I':\n handler.on_12_hour(numeric_system::alternative);\n break;\n case 'M':\n handler.on_minute(numeric_system::alternative);\n break;\n case 'S':\n handler.on_second(numeric_system::alternative);\n break;\n default:\n FMT_THROW(format_error(\"invalid format\"));\n }\n break;\n default:\n FMT_THROW(format_error(\"invalid format\"));\n }\n begin = ptr;\n }\n if (begin != ptr) handler.on_text(begin, ptr);\n return ptr;\n}\n\ntemplate struct null_chrono_spec_handler {\n FMT_CONSTEXPR void unsupported() {\n static_cast(this)->unsupported();\n }\n FMT_CONSTEXPR void on_abbr_weekday() { unsupported(); }\n FMT_CONSTEXPR void on_full_weekday() { unsupported(); }\n FMT_CONSTEXPR void on_dec0_weekday(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_dec1_weekday(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_abbr_month() { unsupported(); }\n FMT_CONSTEXPR void on_full_month() { unsupported(); }\n FMT_CONSTEXPR void on_24_hour(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_12_hour(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_minute(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_second(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_datetime(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_loc_date(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_loc_time(numeric_system) { unsupported(); }\n FMT_CONSTEXPR void on_us_date() { unsupported(); }\n FMT_CONSTEXPR void on_iso_date() { unsupported(); }\n FMT_CONSTEXPR void on_12_hour_time() { unsupported(); }\n FMT_CONSTEXPR void on_24_hour_time() { unsupported(); }\n FMT_CONSTEXPR void on_iso_time() { unsupported(); }\n FMT_CONSTEXPR void on_am_pm() { unsupported(); }\n FMT_CONSTEXPR void on_duration_value() { unsupported(); }\n FMT_CONSTEXPR void on_duration_unit() { unsupported(); }\n FMT_CONSTEXPR void on_utc_offset() { unsupported(); }\n FMT_CONSTEXPR void on_tz_name() { unsupported(); }\n};\n\nstruct chrono_format_checker : null_chrono_spec_handler {\n FMT_NORETURN void unsupported() { FMT_THROW(format_error(\"no date\")); }\n\n template \n FMT_CONSTEXPR void on_text(const Char*, const Char*) {}\n FMT_CONSTEXPR void on_24_hour(numeric_system) {}\n FMT_CONSTEXPR void on_12_hour(numeric_system) {}\n FMT_CONSTEXPR void on_minute(numeric_system) {}\n FMT_CONSTEXPR void on_second(numeric_system) {}\n FMT_CONSTEXPR void on_12_hour_time() {}\n FMT_CONSTEXPR void on_24_hour_time() {}\n FMT_CONSTEXPR void on_iso_time() {}\n FMT_CONSTEXPR void on_am_pm() {}\n FMT_CONSTEXPR void on_duration_value() {}\n FMT_CONSTEXPR void on_duration_unit() {}\n};\n\ntemplate ::value)>\ninline bool isnan(T) {\n return false;\n}\ntemplate ::value)>\ninline bool isnan(T value) {\n return std::isnan(value);\n}\n\ntemplate ::value)>\ninline bool isfinite(T) {\n return true;\n}\ntemplate ::value)>\ninline bool isfinite(T value) {\n return std::isfinite(value);\n}\n\n// Converts value to int and checks that it's in the range [0, upper).\ntemplate ::value)>\ninline int to_nonnegative_int(T value, int upper) {\n FMT_ASSERT(value >= 0 && to_unsigned(value) <= to_unsigned(upper),\n \"invalid value\");\n (void)upper;\n return static_cast(value);\n}\ntemplate ::value)>\ninline int to_nonnegative_int(T value, int upper) {\n FMT_ASSERT(\n std::isnan(value) || (value >= 0 && value <= static_cast(upper)),\n \"invalid value\");\n (void)upper;\n return static_cast(value);\n}\n\ntemplate ::value)>\ninline T mod(T x, int y) {\n return x % static_cast(y);\n}\ntemplate ::value)>\ninline T mod(T x, int y) {\n return std::fmod(x, static_cast(y));\n}\n\n// If T is an integral type, maps T to its unsigned counterpart, otherwise\n// leaves it unchanged (unlike std::make_unsigned).\ntemplate ::value>\nstruct make_unsigned_or_unchanged {\n using type = T;\n};\n\ntemplate struct make_unsigned_or_unchanged {\n using type = typename std::make_unsigned::type;\n};\n\n#if FMT_SAFE_DURATION_CAST\n// throwing version of safe_duration_cast\ntemplate \nTo fmt_safe_duration_cast(std::chrono::duration from) {\n int ec;\n To to = safe_duration_cast::safe_duration_cast(from, ec);\n if (ec) FMT_THROW(format_error(\"cannot format duration\"));\n return to;\n}\n#endif\n\ntemplate ::value)>\ninline std::chrono::duration get_milliseconds(\n std::chrono::duration d) {\n // this may overflow and/or the result may not fit in the\n // target type.\n#if FMT_SAFE_DURATION_CAST\n using CommonSecondsType =\n typename std::common_type::type;\n const auto d_as_common = fmt_safe_duration_cast(d);\n const auto d_as_whole_seconds =\n fmt_safe_duration_cast(d_as_common);\n // this conversion should be nonproblematic\n const auto diff = d_as_common - d_as_whole_seconds;\n const auto ms =\n fmt_safe_duration_cast>(diff);\n return ms;\n#else\n auto s = std::chrono::duration_cast(d);\n return std::chrono::duration_cast(d - s);\n#endif\n}\n\ntemplate ::value)>\ninline std::chrono::duration get_milliseconds(\n std::chrono::duration d) {\n using common_type = typename std::common_type::type;\n auto ms = mod(d.count() * static_cast(Period::num) /\n static_cast(Period::den) * 1000,\n 1000);\n return std::chrono::duration(static_cast(ms));\n}\n\ntemplate ::value)>\nOutputIt format_duration_value(OutputIt out, Rep val, int) {\n return write(out, val);\n}\n\ntemplate ::value)>\nOutputIt format_duration_value(OutputIt out, Rep val, int precision) {\n auto specs = basic_format_specs();\n specs.precision = precision;\n specs.type = precision > 0 ? 'f' : 'g';\n return write(out, val, specs);\n}\n\ntemplate \nOutputIt copy_unit(string_view unit, OutputIt out, Char) {\n return std::copy(unit.begin(), unit.end(), out);\n}\n\ntemplate \nOutputIt copy_unit(string_view unit, OutputIt out, wchar_t) {\n // This works when wchar_t is UTF-32 because units only contain characters\n // that have the same representation in UTF-16 and UTF-32.\n utf8_to_utf16 u(unit);\n return std::copy(u.c_str(), u.c_str() + u.size(), out);\n}\n\ntemplate \nOutputIt format_duration_unit(OutputIt out) {\n if (const char* unit = get_units())\n return copy_unit(string_view(unit), out, Char());\n *out++ = '[';\n out = write(out, Period::num);\n if (const_check(Period::den != 1)) {\n *out++ = '/';\n out = write(out, Period::den);\n }\n *out++ = ']';\n *out++ = 's';\n return out;\n}\n\ntemplate \nstruct chrono_formatter {\n FormatContext& context;\n OutputIt out;\n int precision;\n bool localized = false;\n // rep is unsigned to avoid overflow.\n using rep =\n conditional_t::value && sizeof(Rep) < sizeof(int),\n unsigned, typename make_unsigned_or_unchanged::type>;\n rep val;\n using seconds = std::chrono::duration;\n seconds s;\n using milliseconds = std::chrono::duration;\n bool negative;\n\n using char_type = typename FormatContext::char_type;\n\n explicit chrono_formatter(FormatContext& ctx, OutputIt o,\n std::chrono::duration d)\n : context(ctx),\n out(o),\n val(static_cast(d.count())),\n negative(false) {\n if (d.count() < 0) {\n val = 0 - val;\n negative = true;\n }\n\n // this may overflow and/or the result may not fit in the\n // target type.\n#if FMT_SAFE_DURATION_CAST\n // might need checked conversion (rep!=Rep)\n auto tmpval = std::chrono::duration(val);\n s = fmt_safe_duration_cast(tmpval);\n#else\n s = std::chrono::duration_cast(\n std::chrono::duration(val));\n#endif\n }\n\n // returns true if nan or inf, writes to out.\n bool handle_nan_inf() {\n if (isfinite(val)) {\n return false;\n }\n if (isnan(val)) {\n write_nan();\n return true;\n }\n // must be +-inf\n if (val > 0) {\n write_pinf();\n } else {\n write_ninf();\n }\n return true;\n }\n\n Rep hour() const { return static_cast(mod((s.count() / 3600), 24)); }\n\n Rep hour12() const {\n Rep hour = static_cast(mod((s.count() / 3600), 12));\n return hour <= 0 ? 12 : hour;\n }\n\n Rep minute() const { return static_cast(mod((s.count() / 60), 60)); }\n Rep second() const { return static_cast(mod(s.count(), 60)); }\n\n std::tm time() const {\n auto time = std::tm();\n time.tm_hour = to_nonnegative_int(hour(), 24);\n time.tm_min = to_nonnegative_int(minute(), 60);\n time.tm_sec = to_nonnegative_int(second(), 60);\n return time;\n }\n\n void write_sign() {\n if (negative) {\n *out++ = '-';\n negative = false;\n }\n }\n\n void write(Rep value, int width) {\n write_sign();\n if (isnan(value)) return write_nan();\n uint32_or_64_or_128_t n =\n to_unsigned(to_nonnegative_int(value, max_value()));\n int num_digits = detail::count_digits(n);\n if (width > num_digits) out = std::fill_n(out, width - num_digits, '0');\n out = format_decimal(out, n, num_digits).end;\n }\n\n void write_nan() { std::copy_n(\"nan\", 3, out); }\n void write_pinf() { std::copy_n(\"inf\", 3, out); }\n void write_ninf() { std::copy_n(\"-inf\", 4, out); }\n\n void format_localized(const tm& time, char format, char modifier = 0) {\n if (isnan(val)) return write_nan();\n const auto& loc = localized ? context.locale().template get()\n : std::locale::classic();\n out = detail::write(out, time, loc, format, modifier);\n }\n\n void on_text(const char_type* begin, const char_type* end) {\n std::copy(begin, end, out);\n }\n\n // These are not implemented because durations don't have date information.\n void on_abbr_weekday() {}\n void on_full_weekday() {}\n void on_dec0_weekday(numeric_system) {}\n void on_dec1_weekday(numeric_system) {}\n void on_abbr_month() {}\n void on_full_month() {}\n void on_datetime(numeric_system) {}\n void on_loc_date(numeric_system) {}\n void on_loc_time(numeric_system) {}\n void on_us_date() {}\n void on_iso_date() {}\n void on_utc_offset() {}\n void on_tz_name() {}\n\n void on_24_hour(numeric_system ns) {\n if (handle_nan_inf()) return;\n\n if (ns == numeric_system::standard) return write(hour(), 2);\n auto time = tm();\n time.tm_hour = to_nonnegative_int(hour(), 24);\n format_localized(time, 'H', 'O');\n }\n\n void on_12_hour(numeric_system ns) {\n if (handle_nan_inf()) return;\n\n if (ns == numeric_system::standard) return write(hour12(), 2);\n auto time = tm();\n time.tm_hour = to_nonnegative_int(hour12(), 12);\n format_localized(time, 'I', 'O');\n }\n\n void on_minute(numeric_system ns) {\n if (handle_nan_inf()) return;\n\n if (ns == numeric_system::standard) return write(minute(), 2);\n auto time = tm();\n time.tm_min = to_nonnegative_int(minute(), 60);\n format_localized(time, 'M', 'O');\n }\n\n void on_second(numeric_system ns) {\n if (handle_nan_inf()) return;\n\n if (ns == numeric_system::standard) {\n write(second(), 2);\n#if FMT_SAFE_DURATION_CAST\n // convert rep->Rep\n using duration_rep = std::chrono::duration;\n using duration_Rep = std::chrono::duration;\n auto tmpval = fmt_safe_duration_cast(duration_rep{val});\n#else\n auto tmpval = std::chrono::duration(val);\n#endif\n auto ms = get_milliseconds(tmpval);\n if (ms != std::chrono::milliseconds(0)) {\n *out++ = '.';\n write(ms.count(), 3);\n }\n return;\n }\n auto time = tm();\n time.tm_sec = to_nonnegative_int(second(), 60);\n format_localized(time, 'S', 'O');\n }\n\n void on_12_hour_time() {\n if (handle_nan_inf()) return;\n format_localized(time(), 'r');\n }\n\n void on_24_hour_time() {\n if (handle_nan_inf()) {\n *out++ = ':';\n handle_nan_inf();\n return;\n }\n\n write(hour(), 2);\n *out++ = ':';\n write(minute(), 2);\n }\n\n void on_iso_time() {\n on_24_hour_time();\n *out++ = ':';\n if (handle_nan_inf()) return;\n write(second(), 2);\n }\n\n void on_am_pm() {\n if (handle_nan_inf()) return;\n format_localized(time(), 'p');\n }\n\n void on_duration_value() {\n if (handle_nan_inf()) return;\n write_sign();\n out = format_duration_value(out, val, precision);\n }\n\n void on_duration_unit() {\n out = format_duration_unit(out);\n }\n};\n\nFMT_END_DETAIL_NAMESPACE\n\n#if defined(__cpp_lib_chrono) && __cpp_lib_chrono >= 201907\nusing weekday = std::chrono::weekday;\n#else\n// A fallback version of weekday.\nclass weekday {\n private:\n unsigned char value;\n\n public:\n weekday() = default;\n explicit constexpr weekday(unsigned wd) noexcept\n : value(static_cast(wd != 7 ? wd : 0)) {}\n constexpr unsigned c_encoding() const noexcept { return value; }\n};\n#endif\n\n// A rudimentary weekday formatter.\ntemplate <> struct formatter {\n private:\n bool localized = false;\n\n public:\n FMT_CONSTEXPR auto parse(format_parse_context& ctx) -> decltype(ctx.begin()) {\n auto begin = ctx.begin(), end = ctx.end();\n if (begin != end && *begin == 'L') {\n ++begin;\n localized = true;\n }\n return begin;\n }\n\n auto format(weekday wd, format_context& ctx) -> decltype(ctx.out()) {\n auto time = std::tm();\n time.tm_wday = static_cast(wd.c_encoding());\n const auto& loc = localized ? ctx.locale().template get()\n : std::locale::classic();\n return detail::write(ctx.out(), time, loc, 'a');\n }\n};\n\ntemplate \nstruct formatter, Char> {\n private:\n basic_format_specs specs;\n int precision = -1;\n using arg_ref_type = detail::arg_ref;\n arg_ref_type width_ref;\n arg_ref_type precision_ref;\n bool localized = false;\n basic_string_view format_str;\n using duration = std::chrono::duration;\n\n struct spec_handler {\n formatter& f;\n basic_format_parse_context& context;\n basic_string_view format_str;\n\n template FMT_CONSTEXPR arg_ref_type make_arg_ref(Id arg_id) {\n context.check_arg_id(arg_id);\n return arg_ref_type(arg_id);\n }\n\n FMT_CONSTEXPR arg_ref_type make_arg_ref(basic_string_view arg_id) {\n context.check_arg_id(arg_id);\n return arg_ref_type(arg_id);\n }\n\n FMT_CONSTEXPR arg_ref_type make_arg_ref(detail::auto_id) {\n return arg_ref_type(context.next_arg_id());\n }\n\n void on_error(const char* msg) { FMT_THROW(format_error(msg)); }\n FMT_CONSTEXPR void on_fill(basic_string_view fill) {\n f.specs.fill = fill;\n }\n FMT_CONSTEXPR void on_align(align_t align) { f.specs.align = align; }\n FMT_CONSTEXPR void on_width(int width) { f.specs.width = width; }\n FMT_CONSTEXPR void on_precision(int _precision) {\n f.precision = _precision;\n }\n FMT_CONSTEXPR void end_precision() {}\n\n template FMT_CONSTEXPR void on_dynamic_width(Id arg_id) {\n f.width_ref = make_arg_ref(arg_id);\n }\n\n template FMT_CONSTEXPR void on_dynamic_precision(Id arg_id) {\n f.precision_ref = make_arg_ref(arg_id);\n }\n };\n\n using iterator = typename basic_format_parse_context::iterator;\n struct parse_range {\n iterator begin;\n iterator end;\n };\n\n FMT_CONSTEXPR parse_range do_parse(basic_format_parse_context& ctx) {\n auto begin = ctx.begin(), end = ctx.end();\n if (begin == end || *begin == '}') return {begin, begin};\n spec_handler handler{*this, ctx, format_str};\n begin = detail::parse_align(begin, end, handler);\n if (begin == end) return {begin, begin};\n begin = detail::parse_width(begin, end, handler);\n if (begin == end) return {begin, begin};\n if (*begin == '.') {\n if (std::is_floating_point::value)\n begin = detail::parse_precision(begin, end, handler);\n else\n handler.on_error(\"precision not allowed for this argument type\");\n }\n if (begin != end && *begin == 'L') {\n ++begin;\n localized = true;\n }\n end = parse_chrono_format(begin, end, detail::chrono_format_checker());\n return {begin, end};\n }\n\n public:\n FMT_CONSTEXPR auto parse(basic_format_parse_context& ctx)\n -> decltype(ctx.begin()) {\n auto range = do_parse(ctx);\n format_str = basic_string_view(\n &*range.begin, detail::to_unsigned(range.end - range.begin));\n return range.end;\n }\n\n template \n auto format(const duration& d, FormatContext& ctx) const\n -> decltype(ctx.out()) {\n auto specs_copy = specs;\n auto precision_copy = precision;\n auto begin = format_str.begin(), end = format_str.end();\n // As a possible future optimization, we could avoid extra copying if width\n // is not specified.\n basic_memory_buffer buf;\n auto out = std::back_inserter(buf);\n detail::handle_dynamic_spec(specs_copy.width,\n width_ref, ctx);\n detail::handle_dynamic_spec(precision_copy,\n precision_ref, ctx);\n if (begin == end || *begin == '}') {\n out = detail::format_duration_value(out, d.count(), precision_copy);\n detail::format_duration_unit(out);\n } else {\n detail::chrono_formatter f(\n ctx, out, d);\n f.precision = precision_copy;\n f.localized = localized;\n detail::parse_chrono_format(begin, end, f);\n }\n return detail::write(\n ctx.out(), basic_string_view(buf.data(), buf.size()), specs_copy);\n }\n};\n\nFMT_MODULE_EXPORT_END\nFMT_END_NAMESPACE\n\n#endif // FMT_CHRONO_H_\n" }, { "path": "vendor/spdlog/include/spdlog/fmt/bundled/color.h", "content": "// Formatting library for C++ - color support\n//\n// Copyright (c) 2018 - present, Victor Zverovich and fmt contributors\n// All rights reserved.\n//\n// For the license information refer to format.h.\n\n#ifndef FMT_COLOR_H_\n#define FMT_COLOR_H_\n\n#include \"format.h\"\n\n// __declspec(deprecated) is broken in some MSVC versions.\n#if FMT_MSC_VER\n# define FMT_DEPRECATED_NONMSVC\n#else\n# define FMT_DEPRECATED_NONMSVC FMT_DEPRECATED\n#endif\n\nFMT_BEGIN_NAMESPACE\nFMT_MODULE_EXPORT_BEGIN\n\nenum class color : uint32_t {\n alice_blue = 0xF0F8FF, // rgb(240,248,255)\n antique_white = 0xFAEBD7, // rgb(250,235,215)\n aqua = 0x00FFFF, // rgb(0,255,255)\n aquamarine = 0x7FFFD4, // rgb(127,255,212)\n azure = 0xF0FFFF, // rgb(240,255,255)\n beige = 0xF5F5DC, // rgb(245,245,220)\n bisque = 0xFFE4C4, // rgb(255,228,196)\n black = 0x000000, // rgb(0,0,0)\n blanched_almond = 0xFFEBCD, // rgb(255,235,205)\n blue = 0x0000FF, // rgb(0,0,255)\n blue_violet = 0x8A2BE2, // rgb(138,43,226)\n brown = 0xA52A2A, // rgb(165,42,42)\n burly_wood = 0xDEB887, // rgb(222,184,135)\n cadet_blue = 0x5F9EA0, // rgb(95,158,160)\n chartreuse = 0x7FFF00, // rgb(127,255,0)\n chocolate = 0xD2691E, // rgb(210,105,30)\n coral = 0xFF7F50, // rgb(255,127,80)\n cornflower_blue = 0x6495ED, // rgb(100,149,237)\n cornsilk = 0xFFF8DC, // rgb(255,248,220)\n crimson = 0xDC143C, // rgb(220,20,60)\n cyan = 0x00FFFF, // rgb(0,255,255)\n dark_blue = 0x00008B, // rgb(0,0,139)\n dark_cyan = 0x008B8B, // rgb(0,139,139)\n dark_golden_rod = 0xB8860B, // rgb(184,134,11)\n dark_gray = 0xA9A9A9, // rgb(169,169,169)\n dark_green = 0x006400, // rgb(0,100,0)\n dark_khaki = 0xBDB76B, // rgb(189,183,107)\n dark_magenta = 0x8B008B, // rgb(139,0,139)\n dark_olive_green = 0x556B2F, // rgb(85,107,47)\n dark_orange = 0xFF8C00, // rgb(255,140,0)\n dark_orchid = 0x9932CC, // rgb(153,50,204)\n dark_red = 0x8B0000, // rgb(139,0,0)\n dark_salmon = 0xE9967A, // rgb(233,150,122)\n dark_sea_green = 0x8FBC8F, // rgb(143,188,143)\n dark_slate_blue = 0x483D8B, // rgb(72,61,139)\n dark_slate_gray = 0x2F4F4F, // rgb(47,79,79)\n dark_turquoise = 0x00CED1, // rgb(0,206,209)\n dark_violet = 0x9400D3, // rgb(148,0,211)\n deep_pink = 0xFF1493, // rgb(255,20,147)\n deep_sky_blue = 0x00BFFF, // rgb(0,191,255)\n dim_gray = 0x696969, // rgb(105,105,105)\n dodger_blue = 0x1E90FF, // rgb(30,144,255)\n fire_brick = 0xB22222, // rgb(178,34,34)\n floral_white = 0xFFFAF0, // rgb(255,250,240)\n forest_green = 0x228B22, // rgb(34,139,34)\n fuchsia = 0xFF00FF, // rgb(255,0,255)\n gainsboro = 0xDCDCDC, // rgb(220,220,220)\n ghost_white = 0xF8F8FF, // rgb(248,248,255)\n gold = 0xFFD700, // rgb(255,215,0)\n golden_rod = 0xDAA520, // rgb(218,165,32)\n gray = 0x808080, // rgb(128,128,128)\n green = 0x008000, // rgb(0,128,0)\n green_yellow = 0xADFF2F, // rgb(173,255,47)\n honey_dew = 0xF0FFF0, // rgb(240,255,240)\n hot_pink = 0xFF69B4, // rgb(255,105,180)\n indian_red = 0xCD5C5C, // rgb(205,92,92)\n indigo = 0x4B0082, // rgb(75,0,130)\n ivory = 0xFFFFF0, // rgb(255,255,240)\n khaki = 0xF0E68C, // rgb(240,230,140)\n lavender = 0xE6E6FA, // rgb(230,230,250)\n lavender_blush = 0xFFF0F5, // rgb(255,240,245)\n lawn_green = 0x7CFC00, // rgb(124,252,0)\n lemon_chiffon = 0xFFFACD, // rgb(255,250,205)\n light_blue = 0xADD8E6, // rgb(173,216,230)\n light_coral = 0xF08080, // rgb(240,128,128)\n light_cyan = 0xE0FFFF, // rgb(224,255,255)\n light_golden_rod_yellow = 0xFAFAD2, // rgb(250,250,210)\n light_gray = 0xD3D3D3, // rgb(211,211,211)\n light_green = 0x90EE90, // rgb(144,238,144)\n light_pink = 0xFFB6C1, // rgb(255,182,193)\n light_salmon = 0xFFA07A, // rgb(255,160,122)\n light_sea_green = 0x20B2AA, // rgb(32,178,170)\n light_sky_blue = 0x87CEFA, // rgb(135,206,250)\n light_slate_gray = 0x778899, // rgb(119,136,153)\n light_steel_blue = 0xB0C4DE, // rgb(176,196,222)\n light_yellow = 0xFFFFE0, // rgb(255,255,224)\n lime = 0x00FF00, // rgb(0,255,0)\n lime_green = 0x32CD32, // rgb(50,205,50)\n linen = 0xFAF0E6, // rgb(250,240,230)\n magenta = 0xFF00FF, // rgb(255,0,255)\n maroon = 0x800000, // rgb(128,0,0)\n medium_aquamarine = 0x66CDAA, // rgb(102,205,170)\n medium_blue = 0x0000CD, // rgb(0,0,205)\n medium_orchid = 0xBA55D3, // rgb(186,85,211)\n medium_purple = 0x9370DB, // rgb(147,112,219)\n medium_sea_green = 0x3CB371, // rgb(60,179,113)\n medium_slate_blue = 0x7B68EE, // rgb(123,104,238)\n medium_spring_green = 0x00FA9A, // rgb(0,250,154)\n medium_turquoise = 0x48D1CC, // rgb(72,209,204)\n medium_violet_red = 0xC71585, // rgb(199,21,133)\n midnight_blue = 0x191970, // rgb(25,25,112)\n mint_cream = 0xF5FFFA, // rgb(245,255,250)\n misty_rose = 0xFFE4E1, // rgb(255,228,225)\n moccasin = 0xFFE4B5, // rgb(255,228,181)\n navajo_white = 0xFFDEAD, // rgb(255,222,173)\n navy = 0x000080, // rgb(0,0,128)\n old_lace = 0xFDF5E6, // rgb(253,245,230)\n olive = 0x808000, // rgb(128,128,0)\n olive_drab = 0x6B8E23, // rgb(107,142,35)\n orange = 0xFFA500, // rgb(255,165,0)\n orange_red = 0xFF4500, // rgb(255,69,0)\n orchid = 0xDA70D6, // rgb(218,112,214)\n pale_golden_rod = 0xEEE8AA, // rgb(238,232,170)\n pale_green = 0x98FB98, // rgb(152,251,152)\n pale_turquoise = 0xAFEEEE, // rgb(175,238,238)\n pale_violet_red = 0xDB7093, // rgb(219,112,147)\n papaya_whip = 0xFFEFD5, // rgb(255,239,213)\n peach_puff = 0xFFDAB9, // rgb(255,218,185)\n peru = 0xCD853F, // rgb(205,133,63)\n pink = 0xFFC0CB, // rgb(255,192,203)\n plum = 0xDDA0DD, // rgb(221,160,221)\n powder_blue = 0xB0E0E6, // rgb(176,224,230)\n purple = 0x800080, // rgb(128,0,128)\n rebecca_purple = 0x663399, // rgb(102,51,153)\n red = 0xFF0000, // rgb(255,0,0)\n rosy_brown = 0xBC8F8F, // rgb(188,143,143)\n royal_blue = 0x4169E1, // rgb(65,105,225)\n saddle_brown = 0x8B4513, // rgb(139,69,19)\n salmon = 0xFA8072, // rgb(250,128,114)\n sandy_brown = 0xF4A460, // rgb(244,164,96)\n sea_green = 0x2E8B57, // rgb(46,139,87)\n sea_shell = 0xFFF5EE, // rgb(255,245,238)\n sienna = 0xA0522D, // rgb(160,82,45)\n silver = 0xC0C0C0, // rgb(192,192,192)\n sky_blue = 0x87CEEB, // rgb(135,206,235)\n slate_blue = 0x6A5ACD, // rgb(106,90,205)\n slate_gray = 0x708090, // rgb(112,128,144)\n snow = 0xFFFAFA, // rgb(255,250,250)\n spring_green = 0x00FF7F, // rgb(0,255,127)\n steel_blue = 0x4682B4, // rgb(70,130,180)\n tan = 0xD2B48C, // rgb(210,180,140)\n teal = 0x008080, // rgb(0,128,128)\n thistle = 0xD8BFD8, // rgb(216,191,216)\n tomato = 0xFF6347, // rgb(255,99,71)\n turquoise = 0x40E0D0, // rgb(64,224,208)\n violet = 0xEE82EE, // rgb(238,130,238)\n wheat = 0xF5DEB3, // rgb(245,222,179)\n white = 0xFFFFFF, // rgb(255,255,255)\n white_smoke = 0xF5F5F5, // rgb(245,245,245)\n yellow = 0xFFFF00, // rgb(255,255,0)\n yellow_green = 0x9ACD32 // rgb(154,205,50)\n}; // enum class color\n\nenum class terminal_color : uint8_t {\n black = 30,\n red,\n green,\n yellow,\n blue,\n magenta,\n cyan,\n white,\n bright_black = 90,\n bright_red,\n bright_green,\n bright_yellow,\n bright_blue,\n bright_magenta,\n bright_cyan,\n bright_white\n};\n\nenum class emphasis : uint8_t {\n bold = 1,\n italic = 1 << 1,\n underline = 1 << 2,\n strikethrough = 1 << 3\n};\n\n// rgb is a struct for red, green and blue colors.\n// Using the name \"rgb\" makes some editors show the color in a tooltip.\nstruct rgb {\n FMT_CONSTEXPR rgb() : r(0), g(0), b(0) {}\n FMT_CONSTEXPR rgb(uint8_t r_, uint8_t g_, uint8_t b_) : r(r_), g(g_), b(b_) {}\n FMT_CONSTEXPR rgb(uint32_t hex)\n : r((hex >> 16) & 0xFF), g((hex >> 8) & 0xFF), b(hex & 0xFF) {}\n FMT_CONSTEXPR rgb(color hex)\n : r((uint32_t(hex) >> 16) & 0xFF),\n g((uint32_t(hex) >> 8) & 0xFF),\n b(uint32_t(hex) & 0xFF) {}\n uint8_t r;\n uint8_t g;\n uint8_t b;\n};\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\n// color is a struct of either a rgb color or a terminal color.\nstruct color_type {\n FMT_CONSTEXPR color_type() FMT_NOEXCEPT : is_rgb(), value{} {}\n FMT_CONSTEXPR color_type(color rgb_color) FMT_NOEXCEPT : is_rgb(true),\n value{} {\n value.rgb_color = static_cast(rgb_color);\n }\n FMT_CONSTEXPR color_type(rgb rgb_color) FMT_NOEXCEPT : is_rgb(true), value{} {\n value.rgb_color = (static_cast(rgb_color.r) << 16) |\n (static_cast(rgb_color.g) << 8) | rgb_color.b;\n }\n FMT_CONSTEXPR color_type(terminal_color term_color) FMT_NOEXCEPT : is_rgb(),\n value{} {\n value.term_color = static_cast(term_color);\n }\n bool is_rgb;\n union color_union {\n uint8_t term_color;\n uint32_t rgb_color;\n } value;\n};\n\nFMT_END_DETAIL_NAMESPACE\n\n/** A text style consisting of foreground and background colors and emphasis. */\nclass text_style {\n public:\n FMT_CONSTEXPR text_style(emphasis em = emphasis()) FMT_NOEXCEPT\n : set_foreground_color(),\n set_background_color(),\n ems(em) {}\n\n FMT_CONSTEXPR text_style& operator|=(const text_style& rhs) {\n if (!set_foreground_color) {\n set_foreground_color = rhs.set_foreground_color;\n foreground_color = rhs.foreground_color;\n } else if (rhs.set_foreground_color) {\n if (!foreground_color.is_rgb || !rhs.foreground_color.is_rgb)\n FMT_THROW(format_error(\"can't OR a terminal color\"));\n foreground_color.value.rgb_color |= rhs.foreground_color.value.rgb_color;\n }\n\n if (!set_background_color) {\n set_background_color = rhs.set_background_color;\n background_color = rhs.background_color;\n } else if (rhs.set_background_color) {\n if (!background_color.is_rgb || !rhs.background_color.is_rgb)\n FMT_THROW(format_error(\"can't OR a terminal color\"));\n background_color.value.rgb_color |= rhs.background_color.value.rgb_color;\n }\n\n ems = static_cast(static_cast(ems) |\n static_cast(rhs.ems));\n return *this;\n }\n\n friend FMT_CONSTEXPR text_style operator|(text_style lhs,\n const text_style& rhs) {\n return lhs |= rhs;\n }\n\n FMT_DEPRECATED_NONMSVC FMT_CONSTEXPR text_style& operator&=(\n const text_style& rhs) {\n return and_assign(rhs);\n }\n\n FMT_DEPRECATED_NONMSVC friend FMT_CONSTEXPR text_style\n operator&(text_style lhs, const text_style& rhs) {\n return lhs.and_assign(rhs);\n }\n\n FMT_CONSTEXPR bool has_foreground() const FMT_NOEXCEPT {\n return set_foreground_color;\n }\n FMT_CONSTEXPR bool has_background() const FMT_NOEXCEPT {\n return set_background_color;\n }\n FMT_CONSTEXPR bool has_emphasis() const FMT_NOEXCEPT {\n return static_cast(ems) != 0;\n }\n FMT_CONSTEXPR detail::color_type get_foreground() const FMT_NOEXCEPT {\n FMT_ASSERT(has_foreground(), \"no foreground specified for this style\");\n return foreground_color;\n }\n FMT_CONSTEXPR detail::color_type get_background() const FMT_NOEXCEPT {\n FMT_ASSERT(has_background(), \"no background specified for this style\");\n return background_color;\n }\n FMT_CONSTEXPR emphasis get_emphasis() const FMT_NOEXCEPT {\n FMT_ASSERT(has_emphasis(), \"no emphasis specified for this style\");\n return ems;\n }\n\n private:\n FMT_CONSTEXPR text_style(bool is_foreground,\n detail::color_type text_color) FMT_NOEXCEPT\n : set_foreground_color(),\n set_background_color(),\n ems() {\n if (is_foreground) {\n foreground_color = text_color;\n set_foreground_color = true;\n } else {\n background_color = text_color;\n set_background_color = true;\n }\n }\n\n // DEPRECATED!\n FMT_CONSTEXPR text_style& and_assign(const text_style& rhs) {\n if (!set_foreground_color) {\n set_foreground_color = rhs.set_foreground_color;\n foreground_color = rhs.foreground_color;\n } else if (rhs.set_foreground_color) {\n if (!foreground_color.is_rgb || !rhs.foreground_color.is_rgb)\n FMT_THROW(format_error(\"can't AND a terminal color\"));\n foreground_color.value.rgb_color &= rhs.foreground_color.value.rgb_color;\n }\n\n if (!set_background_color) {\n set_background_color = rhs.set_background_color;\n background_color = rhs.background_color;\n } else if (rhs.set_background_color) {\n if (!background_color.is_rgb || !rhs.background_color.is_rgb)\n FMT_THROW(format_error(\"can't AND a terminal color\"));\n background_color.value.rgb_color &= rhs.background_color.value.rgb_color;\n }\n\n ems = static_cast(static_cast(ems) &\n static_cast(rhs.ems));\n return *this;\n }\n\n friend FMT_CONSTEXPR_DECL text_style fg(detail::color_type foreground)\n FMT_NOEXCEPT;\n\n friend FMT_CONSTEXPR_DECL text_style bg(detail::color_type background)\n FMT_NOEXCEPT;\n\n detail::color_type foreground_color;\n detail::color_type background_color;\n bool set_foreground_color;\n bool set_background_color;\n emphasis ems;\n};\n\n/** Creates a text style from the foreground (text) color. */\nFMT_CONSTEXPR inline text_style fg(detail::color_type foreground) FMT_NOEXCEPT {\n return text_style(true, foreground);\n}\n\n/** Creates a text style from the background color. */\nFMT_CONSTEXPR inline text_style bg(detail::color_type background) FMT_NOEXCEPT {\n return text_style(false, background);\n}\n\nFMT_CONSTEXPR inline text_style operator|(emphasis lhs,\n emphasis rhs) FMT_NOEXCEPT {\n return text_style(lhs) | rhs;\n}\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\ntemplate struct ansi_color_escape {\n FMT_CONSTEXPR ansi_color_escape(detail::color_type text_color,\n const char* esc) FMT_NOEXCEPT {\n // If we have a terminal color, we need to output another escape code\n // sequence.\n if (!text_color.is_rgb) {\n bool is_background = esc == string_view(\"\\x1b[48;2;\");\n uint32_t value = text_color.value.term_color;\n // Background ASCII codes are the same as the foreground ones but with\n // 10 more.\n if (is_background) value += 10u;\n\n size_t index = 0;\n buffer[index++] = static_cast('\\x1b');\n buffer[index++] = static_cast('[');\n\n if (value >= 100u) {\n buffer[index++] = static_cast('1');\n value %= 100u;\n }\n buffer[index++] = static_cast('0' + value / 10u);\n buffer[index++] = static_cast('0' + value % 10u);\n\n buffer[index++] = static_cast('m');\n buffer[index++] = static_cast('\\0');\n return;\n }\n\n for (int i = 0; i < 7; i++) {\n buffer[i] = static_cast(esc[i]);\n }\n rgb color(text_color.value.rgb_color);\n to_esc(color.r, buffer + 7, ';');\n to_esc(color.g, buffer + 11, ';');\n to_esc(color.b, buffer + 15, 'm');\n buffer[19] = static_cast(0);\n }\n FMT_CONSTEXPR ansi_color_escape(emphasis em) FMT_NOEXCEPT {\n uint8_t em_codes[4] = {};\n uint8_t em_bits = static_cast(em);\n if (em_bits & static_cast(emphasis::bold)) em_codes[0] = 1;\n if (em_bits & static_cast(emphasis::italic)) em_codes[1] = 3;\n if (em_bits & static_cast(emphasis::underline)) em_codes[2] = 4;\n if (em_bits & static_cast(emphasis::strikethrough))\n em_codes[3] = 9;\n\n size_t index = 0;\n for (int i = 0; i < 4; ++i) {\n if (!em_codes[i]) continue;\n buffer[index++] = static_cast('\\x1b');\n buffer[index++] = static_cast('[');\n buffer[index++] = static_cast('0' + em_codes[i]);\n buffer[index++] = static_cast('m');\n }\n buffer[index++] = static_cast(0);\n }\n FMT_CONSTEXPR operator const Char*() const FMT_NOEXCEPT { return buffer; }\n\n FMT_CONSTEXPR const Char* begin() const FMT_NOEXCEPT { return buffer; }\n FMT_CONSTEXPR_CHAR_TRAITS const Char* end() const FMT_NOEXCEPT {\n return buffer + std::char_traits::length(buffer);\n }\n\n private:\n Char buffer[7u + 3u * 4u + 1u];\n\n static FMT_CONSTEXPR void to_esc(uint8_t c, Char* out,\n char delimiter) FMT_NOEXCEPT {\n out[0] = static_cast('0' + c / 100);\n out[1] = static_cast('0' + c / 10 % 10);\n out[2] = static_cast('0' + c % 10);\n out[3] = static_cast(delimiter);\n }\n};\n\ntemplate \nFMT_CONSTEXPR ansi_color_escape make_foreground_color(\n detail::color_type foreground) FMT_NOEXCEPT {\n return ansi_color_escape(foreground, \"\\x1b[38;2;\");\n}\n\ntemplate \nFMT_CONSTEXPR ansi_color_escape make_background_color(\n detail::color_type background) FMT_NOEXCEPT {\n return ansi_color_escape(background, \"\\x1b[48;2;\");\n}\n\ntemplate \nFMT_CONSTEXPR ansi_color_escape make_emphasis(emphasis em) FMT_NOEXCEPT {\n return ansi_color_escape(em);\n}\n\ntemplate \ninline void fputs(const Char* chars, FILE* stream) FMT_NOEXCEPT {\n std::fputs(chars, stream);\n}\n\ntemplate <>\ninline void fputs(const wchar_t* chars, FILE* stream) FMT_NOEXCEPT {\n std::fputws(chars, stream);\n}\n\ntemplate inline void reset_color(FILE* stream) FMT_NOEXCEPT {\n fputs(\"\\x1b[0m\", stream);\n}\n\ntemplate <> inline void reset_color(FILE* stream) FMT_NOEXCEPT {\n fputs(L\"\\x1b[0m\", stream);\n}\n\ntemplate \ninline void reset_color(buffer& buffer) FMT_NOEXCEPT {\n auto reset_color = string_view(\"\\x1b[0m\");\n buffer.append(reset_color.begin(), reset_color.end());\n}\n\ntemplate \nvoid vformat_to(buffer& buf, const text_style& ts,\n basic_string_view format_str,\n basic_format_args>> args) {\n bool has_style = false;\n if (ts.has_emphasis()) {\n has_style = true;\n auto emphasis = detail::make_emphasis(ts.get_emphasis());\n buf.append(emphasis.begin(), emphasis.end());\n }\n if (ts.has_foreground()) {\n has_style = true;\n auto foreground = detail::make_foreground_color(ts.get_foreground());\n buf.append(foreground.begin(), foreground.end());\n }\n if (ts.has_background()) {\n has_style = true;\n auto background = detail::make_background_color(ts.get_background());\n buf.append(background.begin(), background.end());\n }\n detail::vformat_to(buf, format_str, args);\n if (has_style) detail::reset_color(buf);\n}\n\nFMT_END_DETAIL_NAMESPACE\n\ntemplate >\nvoid vprint(std::FILE* f, const text_style& ts, const S& format,\n basic_format_args>> args) {\n basic_memory_buffer buf;\n detail::vformat_to(buf, ts, to_string_view(format), args);\n buf.push_back(Char(0));\n detail::fputs(buf.data(), f);\n}\n\n/**\n \\rst\n Formats a string and prints it to the specified file stream using ANSI\n escape sequences to specify text formatting.\n\n **Example**::\n\n fmt::print(fmt::emphasis::bold | fg(fmt::color::red),\n \"Elapsed time: {0:.2f} seconds\", 1.23);\n \\endrst\n */\ntemplate ::value)>\nvoid print(std::FILE* f, const text_style& ts, const S& format_str,\n const Args&... args) {\n vprint(f, ts, format_str,\n fmt::make_args_checked(format_str, args...));\n}\n\n/**\n \\rst\n Formats a string and prints it to stdout using ANSI escape sequences to\n specify text formatting.\n\n **Example**::\n\n fmt::print(fmt::emphasis::bold | fg(fmt::color::red),\n \"Elapsed time: {0:.2f} seconds\", 1.23);\n \\endrst\n */\ntemplate ::value)>\nvoid print(const text_style& ts, const S& format_str, const Args&... args) {\n return print(stdout, ts, format_str, args...);\n}\n\ntemplate >\ninline std::basic_string vformat(\n const text_style& ts, const S& format_str,\n basic_format_args>> args) {\n basic_memory_buffer buf;\n detail::vformat_to(buf, ts, to_string_view(format_str), args);\n return fmt::to_string(buf);\n}\n\n/**\n \\rst\n Formats arguments and returns the result as a string using ANSI\n escape sequences to specify text formatting.\n\n **Example**::\n\n #include \n std::string message = fmt::format(fmt::emphasis::bold | fg(fmt::color::red),\n \"The answer is {}\", 42);\n \\endrst\n*/\ntemplate >\ninline std::basic_string format(const text_style& ts, const S& format_str,\n const Args&... args) {\n return fmt::vformat(ts, to_string_view(format_str),\n fmt::make_args_checked(format_str, args...));\n}\n\n/**\n Formats a string with the given text_style and writes the output to ``out``.\n */\ntemplate ::value)>\nOutputIt vformat_to(\n OutputIt out, const text_style& ts, basic_string_view format_str,\n basic_format_args>> args) {\n auto&& buf = detail::get_buffer(out);\n detail::vformat_to(buf, ts, format_str, args);\n return detail::get_iterator(buf);\n}\n\n/**\n \\rst\n Formats arguments with the given text_style, writes the result to the output\n iterator ``out`` and returns the iterator past the end of the output range.\n\n **Example**::\n\n std::vector out;\n fmt::format_to(std::back_inserter(out),\n fmt::emphasis::bold | fg(fmt::color::red), \"{}\", 42);\n \\endrst\n*/\ntemplate >::value&&\n detail::is_string::value>\ninline auto format_to(OutputIt out, const text_style& ts, const S& format_str,\n Args&&... args) ->\n typename std::enable_if::type {\n return vformat_to(out, ts, to_string_view(format_str),\n fmt::make_args_checked(format_str, args...));\n}\n\nFMT_MODULE_EXPORT_END\nFMT_END_NAMESPACE\n\n#endif // FMT_COLOR_H_\n" }, { "path": "vendor/spdlog/include/spdlog/fmt/bundled/compile.h", "content": "// Formatting library for C++ - experimental format string compilation\n//\n// Copyright (c) 2012 - present, Victor Zverovich and fmt contributors\n// All rights reserved.\n//\n// For the license information refer to format.h.\n\n#ifndef FMT_COMPILE_H_\n#define FMT_COMPILE_H_\n\n#include \"format.h\"\n\nFMT_BEGIN_NAMESPACE\nnamespace detail {\n\n// An output iterator that counts the number of objects written to it and\n// discards them.\nclass counting_iterator {\n private:\n size_t count_;\n\n public:\n using iterator_category = std::output_iterator_tag;\n using difference_type = std::ptrdiff_t;\n using pointer = void;\n using reference = void;\n using _Unchecked_type = counting_iterator; // Mark iterator as checked.\n\n struct value_type {\n template void operator=(const T&) {}\n };\n\n counting_iterator() : count_(0) {}\n\n size_t count() const { return count_; }\n\n counting_iterator& operator++() {\n ++count_;\n return *this;\n }\n counting_iterator operator++(int) {\n auto it = *this;\n ++*this;\n return it;\n }\n\n friend counting_iterator operator+(counting_iterator it, difference_type n) {\n it.count_ += static_cast(n);\n return it;\n }\n\n value_type operator*() const { return {}; }\n};\n\ntemplate \ninline counting_iterator copy_str(InputIt begin, InputIt end,\n counting_iterator it) {\n return it + (end - begin);\n}\n\ntemplate class truncating_iterator_base {\n protected:\n OutputIt out_;\n size_t limit_;\n size_t count_ = 0;\n\n truncating_iterator_base() : out_(), limit_(0) {}\n\n truncating_iterator_base(OutputIt out, size_t limit)\n : out_(out), limit_(limit) {}\n\n public:\n using iterator_category = std::output_iterator_tag;\n using value_type = typename std::iterator_traits::value_type;\n using difference_type = std::ptrdiff_t;\n using pointer = void;\n using reference = void;\n using _Unchecked_type =\n truncating_iterator_base; // Mark iterator as checked.\n\n OutputIt base() const { return out_; }\n size_t count() const { return count_; }\n};\n\n// An output iterator that truncates the output and counts the number of objects\n// written to it.\ntemplate ::value_type>::type>\nclass truncating_iterator;\n\ntemplate \nclass truncating_iterator\n : public truncating_iterator_base {\n mutable typename truncating_iterator_base::value_type blackhole_;\n\n public:\n using value_type = typename truncating_iterator_base::value_type;\n\n truncating_iterator() = default;\n\n truncating_iterator(OutputIt out, size_t limit)\n : truncating_iterator_base(out, limit) {}\n\n truncating_iterator& operator++() {\n if (this->count_++ < this->limit_) ++this->out_;\n return *this;\n }\n\n truncating_iterator operator++(int) {\n auto it = *this;\n ++*this;\n return it;\n }\n\n value_type& operator*() const {\n return this->count_ < this->limit_ ? *this->out_ : blackhole_;\n }\n};\n\ntemplate \nclass truncating_iterator\n : public truncating_iterator_base {\n public:\n truncating_iterator() = default;\n\n truncating_iterator(OutputIt out, size_t limit)\n : truncating_iterator_base(out, limit) {}\n\n template truncating_iterator& operator=(T val) {\n if (this->count_++ < this->limit_) *this->out_++ = val;\n return *this;\n }\n\n truncating_iterator& operator++() { return *this; }\n truncating_iterator& operator++(int) { return *this; }\n truncating_iterator& operator*() { return *this; }\n};\n\n// A compile-time string which is compiled into fast formatting code.\nclass compiled_string {};\n\ntemplate \nstruct is_compiled_string : std::is_base_of {};\n\n/**\n \\rst\n Converts a string literal *s* into a format string that will be parsed at\n compile time and converted into efficient formatting code. Requires C++17\n ``constexpr if`` compiler support.\n\n **Example**::\n\n // Converts 42 into std::string using the most efficient method and no\n // runtime format string processing.\n std::string s = fmt::format(FMT_COMPILE(\"{}\"), 42);\n \\endrst\n */\n#ifdef __cpp_if_constexpr\n# define FMT_COMPILE(s) \\\n FMT_STRING_IMPL(s, fmt::detail::compiled_string, explicit)\n#else\n# define FMT_COMPILE(s) FMT_STRING(s)\n#endif\n\n#if FMT_USE_NONTYPE_TEMPLATE_PARAMETERS\ntemplate Str>\nstruct udl_compiled_string : compiled_string {\n using char_type = Char;\n constexpr operator basic_string_view() const {\n return {Str.data, N - 1};\n }\n};\n#endif\n\ntemplate \nconst T& first(const T& value, const Tail&...) {\n return value;\n}\n\n#ifdef __cpp_if_constexpr\ntemplate struct type_list {};\n\n// Returns a reference to the argument at index N from [first, rest...].\ntemplate \nconstexpr const auto& get([[maybe_unused]] const T& first,\n [[maybe_unused]] const Args&... rest) {\n static_assert(N < 1 + sizeof...(Args), \"index is out of bounds\");\n if constexpr (N == 0)\n return first;\n else\n return get(rest...);\n}\n\ntemplate \nconstexpr int get_arg_index_by_name(basic_string_view name,\n type_list) {\n return get_arg_index_by_name(name);\n}\n\ntemplate struct get_type_impl;\n\ntemplate struct get_type_impl> {\n using type = remove_cvref_t(std::declval()...))>;\n};\n\ntemplate \nusing get_type = typename get_type_impl::type;\n\ntemplate struct is_compiled_format : std::false_type {};\n\ntemplate struct text {\n basic_string_view data;\n using char_type = Char;\n\n template \n constexpr OutputIt format(OutputIt out, const Args&...) const {\n return write(out, data);\n }\n};\n\ntemplate \nstruct is_compiled_format> : std::true_type {};\n\ntemplate \nconstexpr text make_text(basic_string_view s, size_t pos,\n size_t size) {\n return {{&s[pos], size}};\n}\n\ntemplate struct code_unit {\n Char value;\n using char_type = Char;\n\n template \n constexpr OutputIt format(OutputIt out, const Args&...) const {\n return write(out, value);\n }\n};\n\n// This ensures that the argument type is convertible to `const T&`.\ntemplate \nconstexpr const T& get_arg_checked(const Args&... args) {\n const auto& arg = get(args...);\n if constexpr (detail::is_named_arg>()) {\n return arg.value;\n } else {\n return arg;\n }\n}\n\ntemplate \nstruct is_compiled_format> : std::true_type {};\n\n// A replacement field that refers to argument N.\ntemplate struct field {\n using char_type = Char;\n\n template \n constexpr OutputIt format(OutputIt out, const Args&... args) const {\n return write(out, get_arg_checked(args...));\n }\n};\n\ntemplate \nstruct is_compiled_format> : std::true_type {};\n\n// A replacement field that refers to argument with name.\ntemplate struct runtime_named_field {\n using char_type = Char;\n basic_string_view name;\n\n template \n constexpr static bool try_format_argument(\n OutputIt& out,\n // [[maybe_unused]] due to unused-but-set-parameter warning in GCC 7,8,9\n [[maybe_unused]] basic_string_view arg_name, const T& arg) {\n if constexpr (is_named_arg::type>::value) {\n if (arg_name == arg.name) {\n out = write(out, arg.value);\n return true;\n }\n }\n return false;\n }\n\n template \n constexpr OutputIt format(OutputIt out, const Args&... args) const {\n bool found = (try_format_argument(out, name, args) || ...);\n if (!found) {\n throw format_error(\"argument with specified name is not found\");\n }\n return out;\n }\n};\n\ntemplate \nstruct is_compiled_format> : std::true_type {};\n\n// A replacement field that refers to argument N and has format specifiers.\ntemplate struct spec_field {\n using char_type = Char;\n formatter fmt;\n\n template \n constexpr FMT_INLINE OutputIt format(OutputIt out,\n const Args&... args) const {\n const auto& vargs =\n fmt::make_format_args>(args...);\n basic_format_context ctx(out, vargs);\n return fmt.format(get_arg_checked(args...), ctx);\n }\n};\n\ntemplate \nstruct is_compiled_format> : std::true_type {};\n\ntemplate struct concat {\n L lhs;\n R rhs;\n using char_type = typename L::char_type;\n\n template \n constexpr OutputIt format(OutputIt out, const Args&... args) const {\n out = lhs.format(out, args...);\n return rhs.format(out, args...);\n }\n};\n\ntemplate \nstruct is_compiled_format> : std::true_type {};\n\ntemplate \nconstexpr concat make_concat(L lhs, R rhs) {\n return {lhs, rhs};\n}\n\nstruct unknown_format {};\n\ntemplate \nconstexpr size_t parse_text(basic_string_view str, size_t pos) {\n for (size_t size = str.size(); pos != size; ++pos) {\n if (str[pos] == '{' || str[pos] == '}') break;\n }\n return pos;\n}\n\ntemplate \nconstexpr auto compile_format_string(S format_str);\n\ntemplate \nconstexpr auto parse_tail(T head, S format_str) {\n if constexpr (POS !=\n basic_string_view(format_str).size()) {\n constexpr auto tail = compile_format_string(format_str);\n if constexpr (std::is_same,\n unknown_format>())\n return tail;\n else\n return make_concat(head, tail);\n } else {\n return head;\n }\n}\n\ntemplate struct parse_specs_result {\n formatter fmt;\n size_t end;\n int next_arg_id;\n};\n\nconstexpr int manual_indexing_id = -1;\n\ntemplate \nconstexpr parse_specs_result parse_specs(basic_string_view str,\n size_t pos, int next_arg_id) {\n str.remove_prefix(pos);\n auto ctx = basic_format_parse_context(str, {}, next_arg_id);\n auto f = formatter();\n auto end = f.parse(ctx);\n return {f, pos + fmt::detail::to_unsigned(end - str.data()) + 1,\n next_arg_id == 0 ? manual_indexing_id : ctx.next_arg_id()};\n}\n\ntemplate struct arg_id_handler {\n arg_ref arg_id;\n\n constexpr int operator()() {\n FMT_ASSERT(false, \"handler cannot be used with automatic indexing\");\n return 0;\n }\n constexpr int operator()(int id) {\n arg_id = arg_ref(id);\n return 0;\n }\n constexpr int operator()(basic_string_view id) {\n arg_id = arg_ref(id);\n return 0;\n }\n\n constexpr void on_error(const char* message) { throw format_error(message); }\n};\n\ntemplate struct parse_arg_id_result {\n arg_ref arg_id;\n const Char* arg_id_end;\n};\n\ntemplate \nconstexpr auto parse_arg_id(const Char* begin, const Char* end) {\n auto handler = arg_id_handler{arg_ref{}};\n auto arg_id_end = parse_arg_id(begin, end, handler);\n return parse_arg_id_result{handler.arg_id, arg_id_end};\n}\n\ntemplate struct field_type {\n using type = remove_cvref_t;\n};\n\ntemplate \nstruct field_type::value>> {\n using type = remove_cvref_t;\n};\n\ntemplate \nconstexpr auto parse_replacement_field_then_tail(S format_str) {\n using char_type = typename S::char_type;\n constexpr auto str = basic_string_view(format_str);\n constexpr char_type c = END_POS != str.size() ? str[END_POS] : char_type();\n if constexpr (c == '}') {\n return parse_tail(\n field::type, ARG_INDEX>(),\n format_str);\n } else if constexpr (c == ':') {\n constexpr auto result = parse_specs::type>(\n str, END_POS + 1, NEXT_ID == manual_indexing_id ? 0 : NEXT_ID);\n return parse_tail(\n spec_field::type, ARG_INDEX>{\n result.fmt},\n format_str);\n }\n}\n\n// Compiles a non-empty format string and returns the compiled representation\n// or unknown_format() on unrecognized input.\ntemplate \nconstexpr auto compile_format_string(S format_str) {\n using char_type = typename S::char_type;\n constexpr auto str = basic_string_view(format_str);\n if constexpr (str[POS] == '{') {\n if constexpr (POS + 1 == str.size())\n throw format_error(\"unmatched '{' in format string\");\n if constexpr (str[POS + 1] == '{') {\n return parse_tail(make_text(str, POS, 1), format_str);\n } else if constexpr (str[POS + 1] == '}' || str[POS + 1] == ':') {\n static_assert(ID != manual_indexing_id,\n \"cannot switch from manual to automatic argument indexing\");\n constexpr auto next_id =\n ID != manual_indexing_id ? ID + 1 : manual_indexing_id;\n return parse_replacement_field_then_tail, Args,\n POS + 1, ID, next_id>(\n format_str);\n } else {\n constexpr auto arg_id_result =\n parse_arg_id(str.data() + POS + 1, str.data() + str.size());\n constexpr auto arg_id_end_pos = arg_id_result.arg_id_end - str.data();\n constexpr char_type c =\n arg_id_end_pos != str.size() ? str[arg_id_end_pos] : char_type();\n static_assert(c == '}' || c == ':', \"missing '}' in format string\");\n if constexpr (arg_id_result.arg_id.kind == arg_id_kind::index) {\n static_assert(\n ID == manual_indexing_id || ID == 0,\n \"cannot switch from automatic to manual argument indexing\");\n constexpr auto arg_index = arg_id_result.arg_id.val.index;\n return parse_replacement_field_then_tail,\n Args, arg_id_end_pos,\n arg_index, manual_indexing_id>(\n format_str);\n } else if constexpr (arg_id_result.arg_id.kind == arg_id_kind::name) {\n constexpr auto arg_index =\n get_arg_index_by_name(arg_id_result.arg_id.val.name, Args{});\n if constexpr (arg_index != invalid_arg_index) {\n constexpr auto next_id =\n ID != manual_indexing_id ? ID + 1 : manual_indexing_id;\n return parse_replacement_field_then_tail<\n decltype(get_type::value), Args, arg_id_end_pos,\n arg_index, next_id>(format_str);\n } else {\n if constexpr (c == '}') {\n return parse_tail(\n runtime_named_field{arg_id_result.arg_id.val.name},\n format_str);\n } else if constexpr (c == ':') {\n return unknown_format(); // no type info for specs parsing\n }\n }\n }\n }\n } else if constexpr (str[POS] == '}') {\n if constexpr (POS + 1 == str.size())\n throw format_error(\"unmatched '}' in format string\");\n return parse_tail(make_text(str, POS, 1), format_str);\n } else {\n constexpr auto end = parse_text(str, POS + 1);\n if constexpr (end - POS > 1) {\n return parse_tail(make_text(str, POS, end - POS),\n format_str);\n } else {\n return parse_tail(code_unit{str[POS]},\n format_str);\n }\n }\n}\n\ntemplate ::value)>\nconstexpr auto compile(S format_str) {\n constexpr auto str = basic_string_view(format_str);\n if constexpr (str.size() == 0) {\n return detail::make_text(str, 0, 0);\n } else {\n constexpr auto result =\n detail::compile_format_string, 0, 0>(\n format_str);\n return result;\n }\n}\n#endif // __cpp_if_constexpr\n} // namespace detail\n\nFMT_MODULE_EXPORT_BEGIN\n\n#ifdef __cpp_if_constexpr\n\ntemplate ::value)>\nFMT_INLINE std::basic_string format(const CompiledFormat& cf,\n const Args&... args) {\n auto s = std::basic_string();\n cf.format(std::back_inserter(s), args...);\n return s;\n}\n\ntemplate ::value)>\nconstexpr FMT_INLINE OutputIt format_to(OutputIt out, const CompiledFormat& cf,\n const Args&... args) {\n return cf.format(out, args...);\n}\n\ntemplate ::value)>\nFMT_INLINE std::basic_string format(const S&,\n Args&&... args) {\n if constexpr (std::is_same::value) {\n constexpr auto str = basic_string_view(S());\n if constexpr (str.size() == 2 && str[0] == '{' && str[1] == '}') {\n const auto& first = detail::first(args...);\n if constexpr (detail::is_named_arg<\n remove_cvref_t>::value) {\n return fmt::to_string(first.value);\n } else {\n return fmt::to_string(first);\n }\n }\n }\n constexpr auto compiled = detail::compile(S());\n if constexpr (std::is_same,\n detail::unknown_format>()) {\n return format(static_cast>(S()),\n std::forward(args)...);\n } else {\n return format(compiled, std::forward(args)...);\n }\n}\n\ntemplate ::value)>\nFMT_CONSTEXPR OutputIt format_to(OutputIt out, const S&, Args&&... args) {\n constexpr auto compiled = detail::compile(S());\n if constexpr (std::is_same,\n detail::unknown_format>()) {\n return format_to(out,\n static_cast>(S()),\n std::forward(args)...);\n } else {\n return format_to(out, compiled, std::forward(args)...);\n }\n}\n#endif\n\ntemplate ::value)>\nformat_to_n_result format_to_n(OutputIt out, size_t n,\n const S& format_str, Args&&... args) {\n auto it = format_to(detail::truncating_iterator(out, n), format_str,\n std::forward(args)...);\n return {it.base(), it.count()};\n}\n\ntemplate ::value)>\nsize_t formatted_size(const S& format_str, const Args&... args) {\n return format_to(detail::counting_iterator(), format_str, args...).count();\n}\n\ntemplate ::value)>\nvoid print(std::FILE* f, const S& format_str, const Args&... args) {\n memory_buffer buffer;\n format_to(std::back_inserter(buffer), format_str, args...);\n detail::print(f, {buffer.data(), buffer.size()});\n}\n\ntemplate ::value)>\nvoid print(const S& format_str, const Args&... args) {\n print(stdout, format_str, args...);\n}\n\n#if FMT_USE_NONTYPE_TEMPLATE_PARAMETERS\ninline namespace literals {\ntemplate \nconstexpr detail::udl_compiled_string<\n remove_cvref_t,\n sizeof(Str.data) / sizeof(decltype(Str.data[0])), Str>\noperator\"\"_cf() {\n return {};\n}\n} // namespace literals\n#endif\n\nFMT_MODULE_EXPORT_END\nFMT_END_NAMESPACE\n\n#endif // FMT_COMPILE_H_\n" }, { "path": "vendor/spdlog/include/spdlog/fmt/bundled/core.h", "content": "// Formatting library for C++ - the core API for char/UTF-8\n//\n// Copyright (c) 2012 - present, Victor Zverovich\n// All rights reserved.\n//\n// For the license information refer to format.h.\n\n#ifndef FMT_CORE_H_\n#define FMT_CORE_H_\n\n#include // std::FILE\n#include \n#include \n#include \n#include \n#include \n\n// The fmt library version in the form major * 10000 + minor * 100 + patch.\n#define FMT_VERSION 80000\n\n#ifdef __clang__\n# define FMT_CLANG_VERSION (__clang_major__ * 100 + __clang_minor__)\n#else\n# define FMT_CLANG_VERSION 0\n#endif\n\n#if defined(__GNUC__) && !defined(__clang__)\n# define FMT_GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)\n# define FMT_GCC_PRAGMA(arg) _Pragma(arg)\n#else\n# define FMT_GCC_VERSION 0\n# define FMT_GCC_PRAGMA(arg)\n#endif\n\n#if __cplusplus >= 201103L || defined(__GXX_EXPERIMENTAL_CXX0X__)\n# define FMT_HAS_GXX_CXX11 FMT_GCC_VERSION\n#else\n# define FMT_HAS_GXX_CXX11 0\n#endif\n\n#if defined(__INTEL_COMPILER)\n# define FMT_ICC_VERSION __INTEL_COMPILER\n#else\n# define FMT_ICC_VERSION 0\n#endif\n\n#ifdef __NVCC__\n# define FMT_NVCC __NVCC__\n#else\n# define FMT_NVCC 0\n#endif\n\n#ifdef _MSC_VER\n# define FMT_MSC_VER _MSC_VER\n# define FMT_MSC_WARNING(...) __pragma(warning(__VA_ARGS__))\n#else\n# define FMT_MSC_VER 0\n# define FMT_MSC_WARNING(...)\n#endif\n\n#ifdef __has_feature\n# define FMT_HAS_FEATURE(x) __has_feature(x)\n#else\n# define FMT_HAS_FEATURE(x) 0\n#endif\n\n#if defined(__has_include) && !defined(__INTELLISENSE__) && \\\n (!FMT_ICC_VERSION || FMT_ICC_VERSION >= 1600)\n# define FMT_HAS_INCLUDE(x) __has_include(x)\n#else\n# define FMT_HAS_INCLUDE(x) 0\n#endif\n\n#ifdef __has_cpp_attribute\n# define FMT_HAS_CPP_ATTRIBUTE(x) __has_cpp_attribute(x)\n#else\n# define FMT_HAS_CPP_ATTRIBUTE(x) 0\n#endif\n\n#define FMT_HAS_CPP14_ATTRIBUTE(attribute) \\\n (__cplusplus >= 201402L && FMT_HAS_CPP_ATTRIBUTE(attribute))\n\n#define FMT_HAS_CPP17_ATTRIBUTE(attribute) \\\n (__cplusplus >= 201703L && FMT_HAS_CPP_ATTRIBUTE(attribute))\n\n// Check if relaxed C++14 constexpr is supported.\n// GCC doesn't allow throw in constexpr until version 6 (bug 67371).\n#ifndef FMT_USE_CONSTEXPR\n# define FMT_USE_CONSTEXPR \\\n (FMT_HAS_FEATURE(cxx_relaxed_constexpr) || FMT_MSC_VER >= 1910 || \\\n (FMT_GCC_VERSION >= 600 && __cplusplus >= 201402L)) && \\\n !FMT_NVCC && !FMT_ICC_VERSION\n#endif\n#if FMT_USE_CONSTEXPR\n# define FMT_CONSTEXPR constexpr\n# define FMT_CONSTEXPR_DECL constexpr\n#else\n# define FMT_CONSTEXPR\n# define FMT_CONSTEXPR_DECL\n#endif\n\n// Check if constexpr std::char_traits<>::compare,length is supported.\n#if defined(__GLIBCXX__)\n# if __cplusplus >= 201703L && defined(_GLIBCXX_RELEASE) && \\\n _GLIBCXX_RELEASE >= 7 // GCC 7+ libstdc++ has _GLIBCXX_RELEASE.\n# define FMT_CONSTEXPR_CHAR_TRAITS constexpr\n# endif\n#elif defined(_LIBCPP_VERSION) && __cplusplus >= 201703L && \\\n _LIBCPP_VERSION >= 4000\n# define FMT_CONSTEXPR_CHAR_TRAITS constexpr\n#elif FMT_MSC_VER >= 1914 && _MSVC_LANG >= 201703L\n# define FMT_CONSTEXPR_CHAR_TRAITS constexpr\n#endif\n#ifndef FMT_CONSTEXPR_CHAR_TRAITS\n# define FMT_CONSTEXPR_CHAR_TRAITS\n#endif\n\n#ifndef FMT_OVERRIDE\n# if FMT_HAS_FEATURE(cxx_override_control) || \\\n (FMT_GCC_VERSION >= 408 && FMT_HAS_GXX_CXX11) || FMT_MSC_VER >= 1900\n# define FMT_OVERRIDE override\n# else\n# define FMT_OVERRIDE\n# endif\n#endif\n\n// Check if exceptions are disabled.\n#ifndef FMT_EXCEPTIONS\n# if (defined(__GNUC__) && !defined(__EXCEPTIONS)) || \\\n FMT_MSC_VER && !_HAS_EXCEPTIONS\n# define FMT_EXCEPTIONS 0\n# else\n# define FMT_EXCEPTIONS 1\n# endif\n#endif\n\n// Define FMT_USE_NOEXCEPT to make fmt use noexcept (C++11 feature).\n#ifndef FMT_USE_NOEXCEPT\n# define FMT_USE_NOEXCEPT 0\n#endif\n\n#if FMT_USE_NOEXCEPT || FMT_HAS_FEATURE(cxx_noexcept) || \\\n (FMT_GCC_VERSION >= 408 && FMT_HAS_GXX_CXX11) || FMT_MSC_VER >= 1900\n# define FMT_DETECTED_NOEXCEPT noexcept\n# define FMT_HAS_CXX11_NOEXCEPT 1\n#else\n# define FMT_DETECTED_NOEXCEPT throw()\n# define FMT_HAS_CXX11_NOEXCEPT 0\n#endif\n\n#ifndef FMT_NOEXCEPT\n# if FMT_EXCEPTIONS || FMT_HAS_CXX11_NOEXCEPT\n# define FMT_NOEXCEPT FMT_DETECTED_NOEXCEPT\n# else\n# define FMT_NOEXCEPT\n# endif\n#endif\n\n// [[noreturn]] is disabled on MSVC and NVCC because of bogus unreachable code\n// warnings.\n#if FMT_EXCEPTIONS && FMT_HAS_CPP_ATTRIBUTE(noreturn) && !FMT_MSC_VER && \\\n !FMT_NVCC\n# define FMT_NORETURN [[noreturn]]\n#else\n# define FMT_NORETURN\n#endif\n\n#ifndef FMT_MAYBE_UNUSED\n# if FMT_HAS_CPP17_ATTRIBUTE(maybe_unused)\n# define FMT_MAYBE_UNUSED [[maybe_unused]]\n# else\n# define FMT_MAYBE_UNUSED\n# endif\n#endif\n\n#if __cplusplus == 201103L || __cplusplus == 201402L\n# if defined(__INTEL_COMPILER) || defined(__PGI)\n# define FMT_FALLTHROUGH\n# elif defined(__clang__)\n# define FMT_FALLTHROUGH [[clang::fallthrough]]\n# elif FMT_GCC_VERSION >= 700 && \\\n (!defined(__EDG_VERSION__) || __EDG_VERSION__ >= 520)\n# define FMT_FALLTHROUGH [[gnu::fallthrough]]\n# else\n# define FMT_FALLTHROUGH\n# endif\n#elif FMT_HAS_CPP17_ATTRIBUTE(fallthrough) || \\\n (defined(_MSVC_LANG) && _MSVC_LANG >= 201703L)\n# define FMT_FALLTHROUGH [[fallthrough]]\n#else\n# define FMT_FALLTHROUGH\n#endif\n\n#ifndef FMT_USE_FLOAT\n# define FMT_USE_FLOAT 1\n#endif\n#ifndef FMT_USE_DOUBLE\n# define FMT_USE_DOUBLE 1\n#endif\n#ifndef FMT_USE_LONG_DOUBLE\n# define FMT_USE_LONG_DOUBLE 1\n#endif\n\n#ifndef FMT_INLINE\n# if FMT_GCC_VERSION || FMT_CLANG_VERSION\n# define FMT_INLINE inline __attribute__((always_inline))\n# else\n# define FMT_INLINE inline\n# endif\n#endif\n\n#ifndef FMT_USE_INLINE_NAMESPACES\n# if FMT_HAS_FEATURE(cxx_inline_namespaces) || FMT_GCC_VERSION >= 404 || \\\n (FMT_MSC_VER >= 1900 && (!defined(_MANAGED) || !_MANAGED))\n# define FMT_USE_INLINE_NAMESPACES 1\n# else\n# define FMT_USE_INLINE_NAMESPACES 0\n# endif\n#endif\n\n#ifndef FMT_BEGIN_NAMESPACE\n# if FMT_USE_INLINE_NAMESPACES\n# define FMT_INLINE_NAMESPACE inline namespace\n# define FMT_END_NAMESPACE \\\n } \\\n }\n# else\n# define FMT_INLINE_NAMESPACE namespace\n# define FMT_END_NAMESPACE \\\n } \\\n using namespace v8; \\\n }\n# endif\n# define FMT_BEGIN_NAMESPACE \\\n namespace fmt { \\\n FMT_INLINE_NAMESPACE v8 {\n#endif\n\n#ifndef FMT_MODULE_EXPORT\n# define FMT_MODULE_EXPORT\n# define FMT_MODULE_EXPORT_BEGIN\n# define FMT_MODULE_EXPORT_END\n# define FMT_BEGIN_DETAIL_NAMESPACE namespace detail {\n# define FMT_END_DETAIL_NAMESPACE }\n#endif\n\n#if !defined(FMT_HEADER_ONLY) && defined(_WIN32)\n# define FMT_CLASS_API FMT_MSC_WARNING(suppress : 4275)\n# ifdef FMT_EXPORT\n# define FMT_API __declspec(dllexport)\n# elif defined(FMT_SHARED)\n# define FMT_API __declspec(dllimport)\n# endif\n#else\n# define FMT_CLASS_API\n# if defined(FMT_EXPORT) || defined(FMT_SHARED)\n# if defined(__GNUC__) || defined(__clang__)\n# define FMT_API __attribute__((visibility(\"default\")))\n# endif\n# endif\n#endif\n#ifndef FMT_API\n# define FMT_API\n#endif\n\n#if FMT_GCC_VERSION\n# define FMT_GCC_VISIBILITY_HIDDEN __attribute__((visibility(\"hidden\")))\n#else\n# define FMT_GCC_VISIBILITY_HIDDEN\n#endif\n\n// libc++ supports string_view in pre-c++17.\n#if (FMT_HAS_INCLUDE() && \\\n (__cplusplus > 201402L || defined(_LIBCPP_VERSION))) || \\\n (defined(_MSVC_LANG) && _MSVC_LANG > 201402L && _MSC_VER >= 1910)\n# include \n# define FMT_USE_STRING_VIEW\n#elif FMT_HAS_INCLUDE(\"experimental/string_view\") && __cplusplus >= 201402L\n# include \n# define FMT_USE_EXPERIMENTAL_STRING_VIEW\n#endif\n\n#ifndef FMT_UNICODE\n# define FMT_UNICODE !FMT_MSC_VER\n#endif\n\n#ifndef FMT_CONSTEVAL\n# if ((FMT_GCC_VERSION >= 1000 || FMT_CLANG_VERSION >= 1101) && \\\n __cplusplus > 201703L) || \\\n (defined(__cpp_consteval) && \\\n !FMT_MSC_VER) // consteval is broken in MSVC.\n# define FMT_CONSTEVAL consteval\n# define FMT_HAS_CONSTEVAL\n# else\n# define FMT_CONSTEVAL\n# endif\n#endif\n\n#ifndef FMT_USE_NONTYPE_TEMPLATE_PARAMETERS\n# if defined(__cpp_nontype_template_args) && \\\n ((FMT_GCC_VERSION >= 903 && __cplusplus >= 201709L) || \\\n __cpp_nontype_template_args >= 201911L)\n# define FMT_USE_NONTYPE_TEMPLATE_PARAMETERS 1\n# else\n# define FMT_USE_NONTYPE_TEMPLATE_PARAMETERS 0\n# endif\n#endif\n\n// Enable minimal optimizations for more compact code in debug mode.\nFMT_GCC_PRAGMA(\"GCC push_options\")\n#ifndef __OPTIMIZE__\nFMT_GCC_PRAGMA(\"GCC optimize(\\\"Og\\\")\")\n#endif\n\nFMT_BEGIN_NAMESPACE\nFMT_MODULE_EXPORT_BEGIN\n\n// Implementations of enable_if_t and other metafunctions for older systems.\ntemplate \nusing enable_if_t = typename std::enable_if::type;\ntemplate \nusing conditional_t = typename std::conditional::type;\ntemplate using bool_constant = std::integral_constant;\ntemplate \nusing remove_reference_t = typename std::remove_reference::type;\ntemplate \nusing remove_cvref_t = typename std::remove_cv>::type;\ntemplate struct type_identity { using type = T; };\ntemplate using type_identity_t = typename type_identity::type;\n\nstruct monostate {\n constexpr monostate() {}\n};\n\n// An enable_if helper to be used in template parameters which results in much\n// shorter symbols: https://godbolt.org/z/sWw4vP. Extra parentheses are needed\n// to workaround a bug in MSVC 2019 (see #1140 and #1186).\n#ifdef FMT_DOC\n# define FMT_ENABLE_IF(...)\n#else\n# define FMT_ENABLE_IF(...) enable_if_t<(__VA_ARGS__), int> = 0\n#endif\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\nconstexpr FMT_INLINE auto is_constant_evaluated() FMT_NOEXCEPT -> bool {\n#ifdef __cpp_lib_is_constant_evaluated\n return std::is_constant_evaluated();\n#else\n return false;\n#endif\n}\n\n// A function to suppress \"conditional expression is constant\" warnings.\ntemplate constexpr auto const_check(T value) -> T { return value; }\n\nFMT_NORETURN FMT_API void assert_fail(const char* file, int line,\n const char* message);\n\n#ifndef FMT_ASSERT\n# ifdef NDEBUG\n// FMT_ASSERT is not empty to avoid -Werror=empty-body.\n# define FMT_ASSERT(condition, message) ((void)0)\n# else\n# define FMT_ASSERT(condition, message) \\\n ((condition) /* void() fails with -Winvalid-constexpr on clang 4.0.1 */ \\\n ? (void)0 \\\n : ::fmt::detail::assert_fail(__FILE__, __LINE__, (message)))\n# endif\n#endif\n\n#if defined(FMT_USE_STRING_VIEW)\ntemplate using std_string_view = std::basic_string_view;\n#elif defined(FMT_USE_EXPERIMENTAL_STRING_VIEW)\ntemplate \nusing std_string_view = std::experimental::basic_string_view;\n#else\ntemplate struct std_string_view {};\n#endif\n\n#ifdef FMT_USE_INT128\n// Do nothing.\n#elif defined(__SIZEOF_INT128__) && !FMT_NVCC && \\\n !(FMT_CLANG_VERSION && FMT_MSC_VER)\n# define FMT_USE_INT128 1\nusing int128_t = __int128_t;\nusing uint128_t = __uint128_t;\ntemplate inline auto convert_for_visit(T value) -> T {\n return value;\n}\n#else\n# define FMT_USE_INT128 0\n#endif\n#if !FMT_USE_INT128\nenum class int128_t {};\nenum class uint128_t {};\n// Reduce template instantiations.\ntemplate inline auto convert_for_visit(T) -> monostate {\n return {};\n}\n#endif\n\n// Casts a nonnegative integer to unsigned.\ntemplate \nFMT_CONSTEXPR auto to_unsigned(Int value) ->\n typename std::make_unsigned::type {\n FMT_ASSERT(value >= 0, \"negative value\");\n return static_cast::type>(value);\n}\n\nFMT_MSC_WARNING(suppress : 4566) constexpr unsigned char micro[] = \"\\u00B5\";\n\nconstexpr auto is_utf8() -> bool {\n // Avoid buggy sign extensions in MSVC's constant evaluation mode.\n // https://developercommunity.visualstudio.com/t/C-difference-in-behavior-for-unsigned/1233612\n using uchar = unsigned char;\n return FMT_UNICODE || (sizeof(micro) == 3 && uchar(micro[0]) == 0xC2 &&\n uchar(micro[1]) == 0xB5);\n}\nFMT_END_DETAIL_NAMESPACE\n\n/**\n An implementation of ``std::basic_string_view`` for pre-C++17. It provides a\n subset of the API. ``fmt::basic_string_view`` is used for format strings even\n if ``std::string_view`` is available to prevent issues when a library is\n compiled with a different ``-std`` option than the client code (which is not\n recommended).\n */\ntemplate class basic_string_view {\n private:\n const Char* data_;\n size_t size_;\n\n public:\n using value_type = Char;\n using iterator = const Char*;\n\n constexpr basic_string_view() FMT_NOEXCEPT : data_(nullptr), size_(0) {}\n\n /** Constructs a string reference object from a C string and a size. */\n constexpr basic_string_view(const Char* s, size_t count) FMT_NOEXCEPT\n : data_(s),\n size_(count) {}\n\n /**\n \\rst\n Constructs a string reference object from a C string computing\n the size with ``std::char_traits::length``.\n \\endrst\n */\n FMT_CONSTEXPR_CHAR_TRAITS\n FMT_INLINE\n basic_string_view(const Char* s) : data_(s) {\n if (detail::const_check(std::is_same::value &&\n !detail::is_constant_evaluated()))\n size_ = std::strlen(reinterpret_cast(s));\n else\n size_ = std::char_traits::length(s);\n }\n\n /** Constructs a string reference from a ``std::basic_string`` object. */\n template \n FMT_CONSTEXPR basic_string_view(\n const std::basic_string& s) FMT_NOEXCEPT\n : data_(s.data()),\n size_(s.size()) {}\n\n template >::value)>\n FMT_CONSTEXPR basic_string_view(S s) FMT_NOEXCEPT : data_(s.data()),\n size_(s.size()) {}\n\n /** Returns a pointer to the string data. */\n constexpr auto data() const -> const Char* { return data_; }\n\n /** Returns the string size. */\n constexpr auto size() const -> size_t { return size_; }\n\n constexpr auto begin() const -> iterator { return data_; }\n constexpr auto end() const -> iterator { return data_ + size_; }\n\n constexpr auto operator[](size_t pos) const -> const Char& {\n return data_[pos];\n }\n\n FMT_CONSTEXPR void remove_prefix(size_t n) {\n data_ += n;\n size_ -= n;\n }\n\n // Lexicographically compare this string reference to other.\n FMT_CONSTEXPR_CHAR_TRAITS auto compare(basic_string_view other) const -> int {\n size_t str_size = size_ < other.size_ ? size_ : other.size_;\n int result = std::char_traits::compare(data_, other.data_, str_size);\n if (result == 0)\n result = size_ == other.size_ ? 0 : (size_ < other.size_ ? -1 : 1);\n return result;\n }\n\n FMT_CONSTEXPR_CHAR_TRAITS friend auto operator==(basic_string_view lhs,\n basic_string_view rhs)\n -> bool {\n return lhs.compare(rhs) == 0;\n }\n friend auto operator!=(basic_string_view lhs, basic_string_view rhs) -> bool {\n return lhs.compare(rhs) != 0;\n }\n friend auto operator<(basic_string_view lhs, basic_string_view rhs) -> bool {\n return lhs.compare(rhs) < 0;\n }\n friend auto operator<=(basic_string_view lhs, basic_string_view rhs) -> bool {\n return lhs.compare(rhs) <= 0;\n }\n friend auto operator>(basic_string_view lhs, basic_string_view rhs) -> bool {\n return lhs.compare(rhs) > 0;\n }\n friend auto operator>=(basic_string_view lhs, basic_string_view rhs) -> bool {\n return lhs.compare(rhs) >= 0;\n }\n};\n\nusing string_view = basic_string_view;\n\n/** Specifies if ``T`` is a character type. Can be specialized by users. */\ntemplate struct is_char : std::false_type {};\ntemplate <> struct is_char : std::true_type {};\n\n/**\n \\rst\n Returns a string view of `s`. In order to add custom string type support to\n {fmt} provide an overload of `to_string_view` for it in the same namespace as\n the type for the argument-dependent lookup to work.\n\n **Example**::\n\n namespace my_ns {\n inline string_view to_string_view(const my_string& s) {\n return {s.data(), s.length()};\n }\n }\n std::string message = fmt::format(my_string(\"The answer is {}\"), 42);\n \\endrst\n */\ntemplate ::value)>\nFMT_INLINE auto to_string_view(const Char* s) -> basic_string_view {\n return s;\n}\n\ntemplate \ninline auto to_string_view(const std::basic_string& s)\n -> basic_string_view {\n return s;\n}\n\ntemplate \nconstexpr auto to_string_view(basic_string_view s)\n -> basic_string_view {\n return s;\n}\n\ntemplate >::value)>\ninline auto to_string_view(detail::std_string_view s)\n -> basic_string_view {\n return s;\n}\n\n// A base class for compile-time strings. It is defined in the fmt namespace to\n// make formatting functions visible via ADL, e.g. format(FMT_STRING(\"{}\"), 42).\nstruct compile_string {};\n\ntemplate \nstruct is_compile_string : std::is_base_of {};\n\ntemplate ::value)>\nconstexpr auto to_string_view(const S& s)\n -> basic_string_view {\n return basic_string_view(s);\n}\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\nvoid to_string_view(...);\nusing fmt::v8::to_string_view;\n\n// Specifies whether S is a string type convertible to fmt::basic_string_view.\n// It should be a constexpr function but MSVC 2017 fails to compile it in\n// enable_if and MSVC 2015 fails to compile it as an alias template.\ntemplate \nstruct is_string : std::is_class()))> {\n};\n\ntemplate struct char_t_impl {};\ntemplate struct char_t_impl::value>> {\n using result = decltype(to_string_view(std::declval()));\n using type = typename result::value_type;\n};\n\n// Reports a compile-time error if S is not a valid format string.\ntemplate ::value)>\nFMT_INLINE void check_format_string(const S&) {\n#ifdef FMT_ENFORCE_COMPILE_STRING\n static_assert(is_compile_string::value,\n \"FMT_ENFORCE_COMPILE_STRING requires all format strings to use \"\n \"FMT_STRING.\");\n#endif\n}\ntemplate ::value)>\nvoid check_format_string(S);\n\nstruct error_handler {\n constexpr error_handler() = default;\n constexpr error_handler(const error_handler&) = default;\n\n // This function is intentionally not constexpr to give a compile-time error.\n FMT_NORETURN FMT_API void on_error(const char* message);\n};\nFMT_END_DETAIL_NAMESPACE\n\n/** String's character type. */\ntemplate using char_t = typename detail::char_t_impl::type;\n\n/**\n \\rst\n Parsing context consisting of a format string range being parsed and an\n argument counter for automatic indexing.\n You can use the ```format_parse_context`` type alias for ``char`` instead.\n \\endrst\n */\ntemplate \nclass basic_format_parse_context : private ErrorHandler {\n private:\n basic_string_view format_str_;\n int next_arg_id_;\n\n public:\n using char_type = Char;\n using iterator = typename basic_string_view::iterator;\n\n explicit constexpr basic_format_parse_context(\n basic_string_view format_str, ErrorHandler eh = {},\n int next_arg_id = 0)\n : ErrorHandler(eh), format_str_(format_str), next_arg_id_(next_arg_id) {}\n\n /**\n Returns an iterator to the beginning of the format string range being\n parsed.\n */\n constexpr auto begin() const FMT_NOEXCEPT -> iterator {\n return format_str_.begin();\n }\n\n /**\n Returns an iterator past the end of the format string range being parsed.\n */\n constexpr auto end() const FMT_NOEXCEPT -> iterator {\n return format_str_.end();\n }\n\n /** Advances the begin iterator to ``it``. */\n FMT_CONSTEXPR void advance_to(iterator it) {\n format_str_.remove_prefix(detail::to_unsigned(it - begin()));\n }\n\n /**\n Reports an error if using the manual argument indexing; otherwise returns\n the next argument index and switches to the automatic indexing.\n */\n FMT_CONSTEXPR auto next_arg_id() -> int {\n // Don't check if the argument id is valid to avoid overhead and because it\n // will be checked during formatting anyway.\n if (next_arg_id_ >= 0) return next_arg_id_++;\n on_error(\"cannot switch from manual to automatic argument indexing\");\n return 0;\n }\n\n /**\n Reports an error if using the automatic argument indexing; otherwise\n switches to the manual indexing.\n */\n FMT_CONSTEXPR void check_arg_id(int) {\n if (next_arg_id_ > 0)\n on_error(\"cannot switch from automatic to manual argument indexing\");\n else\n next_arg_id_ = -1;\n }\n\n FMT_CONSTEXPR void check_arg_id(basic_string_view) {}\n\n FMT_CONSTEXPR void on_error(const char* message) {\n ErrorHandler::on_error(message);\n }\n\n constexpr auto error_handler() const -> ErrorHandler { return *this; }\n};\n\nusing format_parse_context = basic_format_parse_context;\n\ntemplate class basic_format_arg;\ntemplate class basic_format_args;\ntemplate class dynamic_format_arg_store;\n\n// A formatter for objects of type T.\ntemplate \nstruct formatter {\n // A deleted default constructor indicates a disabled formatter.\n formatter() = delete;\n};\n\n// Specifies if T has an enabled formatter specialization. A type can be\n// formattable even if it doesn't have a formatter e.g. via a conversion.\ntemplate \nusing has_formatter =\n std::is_constructible>;\n\n// Checks whether T is a container with contiguous storage.\ntemplate struct is_contiguous : std::false_type {};\ntemplate \nstruct is_contiguous> : std::true_type {};\n\nclass appender;\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\n// Extracts a reference to the container from back_insert_iterator.\ntemplate \ninline auto get_container(std::back_insert_iterator it)\n -> Container& {\n using bi_iterator = std::back_insert_iterator;\n struct accessor : bi_iterator {\n accessor(bi_iterator iter) : bi_iterator(iter) {}\n using bi_iterator::container;\n };\n return *accessor(it).container;\n}\n\ntemplate \nFMT_CONSTEXPR auto copy_str(InputIt begin, InputIt end, OutputIt out)\n -> OutputIt {\n while (begin != end) *out++ = static_cast(*begin++);\n return out;\n}\n\ntemplate ::value)>\nFMT_CONSTEXPR auto copy_str(const Char* begin, const Char* end, Char* out)\n -> Char* {\n if (is_constant_evaluated())\n return copy_str(begin, end, out);\n auto size = to_unsigned(end - begin);\n memcpy(out, begin, size);\n return out + size;\n}\n\n/**\n \\rst\n A contiguous memory buffer with an optional growing ability. It is an internal\n class and shouldn't be used directly, only via `~fmt::basic_memory_buffer`.\n \\endrst\n */\ntemplate class buffer {\n private:\n T* ptr_;\n size_t size_;\n size_t capacity_;\n\n protected:\n // Don't initialize ptr_ since it is not accessed to save a few cycles.\n FMT_MSC_WARNING(suppress : 26495)\n buffer(size_t sz) FMT_NOEXCEPT : size_(sz), capacity_(sz) {}\n\n buffer(T* p = nullptr, size_t sz = 0, size_t cap = 0) FMT_NOEXCEPT\n : ptr_(p),\n size_(sz),\n capacity_(cap) {}\n\n ~buffer() = default;\n buffer(buffer&&) = default;\n\n /** Sets the buffer data and capacity. */\n void set(T* buf_data, size_t buf_capacity) FMT_NOEXCEPT {\n ptr_ = buf_data;\n capacity_ = buf_capacity;\n }\n\n /** Increases the buffer capacity to hold at least *capacity* elements. */\n virtual void grow(size_t capacity) = 0;\n\n public:\n using value_type = T;\n using const_reference = const T&;\n\n buffer(const buffer&) = delete;\n void operator=(const buffer&) = delete;\n\n auto begin() FMT_NOEXCEPT -> T* { return ptr_; }\n auto end() FMT_NOEXCEPT -> T* { return ptr_ + size_; }\n\n auto begin() const FMT_NOEXCEPT -> const T* { return ptr_; }\n auto end() const FMT_NOEXCEPT -> const T* { return ptr_ + size_; }\n\n /** Returns the size of this buffer. */\n auto size() const FMT_NOEXCEPT -> size_t { return size_; }\n\n /** Returns the capacity of this buffer. */\n auto capacity() const FMT_NOEXCEPT -> size_t { return capacity_; }\n\n /** Returns a pointer to the buffer data. */\n auto data() FMT_NOEXCEPT -> T* { return ptr_; }\n\n /** Returns a pointer to the buffer data. */\n auto data() const FMT_NOEXCEPT -> const T* { return ptr_; }\n\n /** Clears this buffer. */\n void clear() { size_ = 0; }\n\n // Tries resizing the buffer to contain *count* elements. If T is a POD type\n // the new elements may not be initialized.\n void try_resize(size_t count) {\n try_reserve(count);\n size_ = count <= capacity_ ? count : capacity_;\n }\n\n // Tries increasing the buffer capacity to *new_capacity*. It can increase the\n // capacity by a smaller amount than requested but guarantees there is space\n // for at least one additional element either by increasing the capacity or by\n // flushing the buffer if it is full.\n void try_reserve(size_t new_capacity) {\n if (new_capacity > capacity_) grow(new_capacity);\n }\n\n void push_back(const T& value) {\n try_reserve(size_ + 1);\n ptr_[size_++] = value;\n }\n\n /** Appends data to the end of the buffer. */\n template void append(const U* begin, const U* end);\n\n template auto operator[](I index) -> T& { return ptr_[index]; }\n template auto operator[](I index) const -> const T& {\n return ptr_[index];\n }\n};\n\nstruct buffer_traits {\n explicit buffer_traits(size_t) {}\n auto count() const -> size_t { return 0; }\n auto limit(size_t size) -> size_t { return size; }\n};\n\nclass fixed_buffer_traits {\n private:\n size_t count_ = 0;\n size_t limit_;\n\n public:\n explicit fixed_buffer_traits(size_t limit) : limit_(limit) {}\n auto count() const -> size_t { return count_; }\n auto limit(size_t size) -> size_t {\n size_t n = limit_ > count_ ? limit_ - count_ : 0;\n count_ += size;\n return size < n ? size : n;\n }\n};\n\n// A buffer that writes to an output iterator when flushed.\ntemplate \nclass iterator_buffer final : public Traits, public buffer {\n private:\n OutputIt out_;\n enum { buffer_size = 256 };\n T data_[buffer_size];\n\n protected:\n void grow(size_t) final FMT_OVERRIDE {\n if (this->size() == buffer_size) flush();\n }\n\n void flush() {\n auto size = this->size();\n this->clear();\n out_ = copy_str(data_, data_ + this->limit(size), out_);\n }\n\n public:\n explicit iterator_buffer(OutputIt out, size_t n = buffer_size)\n : Traits(n), buffer(data_, 0, buffer_size), out_(out) {}\n iterator_buffer(iterator_buffer&& other)\n : Traits(other), buffer(data_, 0, buffer_size), out_(other.out_) {}\n ~iterator_buffer() { flush(); }\n\n auto out() -> OutputIt {\n flush();\n return out_;\n }\n auto count() const -> size_t { return Traits::count() + this->size(); }\n};\n\ntemplate class iterator_buffer final : public buffer {\n protected:\n void grow(size_t) final FMT_OVERRIDE {}\n\n public:\n explicit iterator_buffer(T* out, size_t = 0) : buffer(out, 0, ~size_t()) {}\n\n auto out() -> T* { return &*this->end(); }\n};\n\n// A buffer that writes to a container with the contiguous storage.\ntemplate \nclass iterator_buffer,\n enable_if_t::value,\n typename Container::value_type>>\n final : public buffer {\n private:\n Container& container_;\n\n protected:\n void grow(size_t capacity) final FMT_OVERRIDE {\n container_.resize(capacity);\n this->set(&container_[0], capacity);\n }\n\n public:\n explicit iterator_buffer(Container& c)\n : buffer(c.size()), container_(c) {}\n explicit iterator_buffer(std::back_insert_iterator out, size_t = 0)\n : iterator_buffer(get_container(out)) {}\n auto out() -> std::back_insert_iterator {\n return std::back_inserter(container_);\n }\n};\n\n// A buffer that counts the number of code units written discarding the output.\ntemplate class counting_buffer final : public buffer {\n private:\n enum { buffer_size = 256 };\n T data_[buffer_size];\n size_t count_ = 0;\n\n protected:\n void grow(size_t) final FMT_OVERRIDE {\n if (this->size() != buffer_size) return;\n count_ += this->size();\n this->clear();\n }\n\n public:\n counting_buffer() : buffer(data_, 0, buffer_size) {}\n\n auto count() -> size_t { return count_ + this->size(); }\n};\n\ntemplate \nusing buffer_appender = conditional_t::value, appender,\n std::back_insert_iterator>>;\n\n// Maps an output iterator to a buffer.\ntemplate \nauto get_buffer(OutputIt out) -> iterator_buffer {\n return iterator_buffer(out);\n}\n\ntemplate \nauto get_iterator(Buffer& buf) -> decltype(buf.out()) {\n return buf.out();\n}\ntemplate auto get_iterator(buffer& buf) -> buffer_appender {\n return buffer_appender(buf);\n}\n\ntemplate \nstruct fallback_formatter {\n fallback_formatter() = delete;\n};\n\n// Specifies if T has an enabled fallback_formatter specialization.\ntemplate \nusing has_fallback_formatter =\n std::is_constructible>;\n\nstruct view {};\n\ntemplate struct named_arg : view {\n const Char* name;\n const T& value;\n named_arg(const Char* n, const T& v) : name(n), value(v) {}\n};\n\ntemplate struct named_arg_info {\n const Char* name;\n int id;\n};\n\ntemplate \nstruct arg_data {\n // args_[0].named_args points to named_args_ to avoid bloating format_args.\n // +1 to workaround a bug in gcc 7.5 that causes duplicated-branches warning.\n T args_[1 + (NUM_ARGS != 0 ? NUM_ARGS : +1)];\n named_arg_info named_args_[NUM_NAMED_ARGS];\n\n template \n arg_data(const U&... init) : args_{T(named_args_, NUM_NAMED_ARGS), init...} {}\n arg_data(const arg_data& other) = delete;\n auto args() const -> const T* { return args_ + 1; }\n auto named_args() -> named_arg_info* { return named_args_; }\n};\n\ntemplate \nstruct arg_data {\n // +1 to workaround a bug in gcc 7.5 that causes duplicated-branches warning.\n T args_[NUM_ARGS != 0 ? NUM_ARGS : +1];\n\n template \n FMT_CONSTEXPR FMT_INLINE arg_data(const U&... init) : args_{init...} {}\n FMT_CONSTEXPR FMT_INLINE auto args() const -> const T* { return args_; }\n FMT_CONSTEXPR FMT_INLINE auto named_args() -> std::nullptr_t {\n return nullptr;\n }\n};\n\ntemplate \ninline void init_named_args(named_arg_info*, int, int) {}\n\ntemplate struct is_named_arg : std::false_type {};\ntemplate struct is_statically_named_arg : std::false_type {};\n\ntemplate \nstruct is_named_arg> : std::true_type {};\n\ntemplate ::value)>\nvoid init_named_args(named_arg_info* named_args, int arg_count,\n int named_arg_count, const T&, const Tail&... args) {\n init_named_args(named_args, arg_count + 1, named_arg_count, args...);\n}\n\ntemplate ::value)>\nvoid init_named_args(named_arg_info* named_args, int arg_count,\n int named_arg_count, const T& arg, const Tail&... args) {\n named_args[named_arg_count++] = {arg.name, arg_count};\n init_named_args(named_args, arg_count + 1, named_arg_count, args...);\n}\n\ntemplate \nFMT_CONSTEXPR FMT_INLINE void init_named_args(std::nullptr_t, int, int,\n const Args&...) {}\n\ntemplate constexpr auto count() -> size_t { return B ? 1 : 0; }\ntemplate constexpr auto count() -> size_t {\n return (B1 ? 1 : 0) + count();\n}\n\ntemplate constexpr auto count_named_args() -> size_t {\n return count::value...>();\n}\n\nenum class type {\n none_type,\n // Integer types should go first,\n int_type,\n uint_type,\n long_long_type,\n ulong_long_type,\n int128_type,\n uint128_type,\n bool_type,\n char_type,\n last_integer_type = char_type,\n // followed by floating-point types.\n float_type,\n double_type,\n long_double_type,\n last_numeric_type = long_double_type,\n cstring_type,\n string_type,\n pointer_type,\n custom_type\n};\n\n// Maps core type T to the corresponding type enum constant.\ntemplate \nstruct type_constant : std::integral_constant {};\n\n#define FMT_TYPE_CONSTANT(Type, constant) \\\n template \\\n struct type_constant \\\n : std::integral_constant {}\n\nFMT_TYPE_CONSTANT(int, int_type);\nFMT_TYPE_CONSTANT(unsigned, uint_type);\nFMT_TYPE_CONSTANT(long long, long_long_type);\nFMT_TYPE_CONSTANT(unsigned long long, ulong_long_type);\nFMT_TYPE_CONSTANT(int128_t, int128_type);\nFMT_TYPE_CONSTANT(uint128_t, uint128_type);\nFMT_TYPE_CONSTANT(bool, bool_type);\nFMT_TYPE_CONSTANT(Char, char_type);\nFMT_TYPE_CONSTANT(float, float_type);\nFMT_TYPE_CONSTANT(double, double_type);\nFMT_TYPE_CONSTANT(long double, long_double_type);\nFMT_TYPE_CONSTANT(const Char*, cstring_type);\nFMT_TYPE_CONSTANT(basic_string_view, string_type);\nFMT_TYPE_CONSTANT(const void*, pointer_type);\n\nconstexpr bool is_integral_type(type t) {\n return t > type::none_type && t <= type::last_integer_type;\n}\n\nconstexpr bool is_arithmetic_type(type t) {\n return t > type::none_type && t <= type::last_numeric_type;\n}\n\ntemplate struct string_value {\n const Char* data;\n size_t size;\n};\n\ntemplate struct named_arg_value {\n const named_arg_info* data;\n size_t size;\n};\n\ntemplate struct custom_value {\n using parse_context = typename Context::parse_context_type;\n const void* value;\n void (*format)(const void* arg, parse_context& parse_ctx, Context& ctx);\n};\n\n// A formatting argument value.\ntemplate class value {\n public:\n using char_type = typename Context::char_type;\n\n union {\n monostate no_value;\n int int_value;\n unsigned uint_value;\n long long long_long_value;\n unsigned long long ulong_long_value;\n int128_t int128_value;\n uint128_t uint128_value;\n bool bool_value;\n char_type char_value;\n float float_value;\n double double_value;\n long double long_double_value;\n const void* pointer;\n string_value string;\n custom_value custom;\n named_arg_value named_args;\n };\n\n constexpr FMT_INLINE value() : no_value() {}\n constexpr FMT_INLINE value(int val) : int_value(val) {}\n constexpr FMT_INLINE value(unsigned val) : uint_value(val) {}\n constexpr FMT_INLINE value(long long val) : long_long_value(val) {}\n constexpr FMT_INLINE value(unsigned long long val) : ulong_long_value(val) {}\n FMT_INLINE value(int128_t val) : int128_value(val) {}\n FMT_INLINE value(uint128_t val) : uint128_value(val) {}\n FMT_INLINE value(float val) : float_value(val) {}\n FMT_INLINE value(double val) : double_value(val) {}\n FMT_INLINE value(long double val) : long_double_value(val) {}\n constexpr FMT_INLINE value(bool val) : bool_value(val) {}\n constexpr FMT_INLINE value(char_type val) : char_value(val) {}\n FMT_CONSTEXPR FMT_INLINE value(const char_type* val) {\n string.data = val;\n if (is_constant_evaluated()) string.size = {};\n }\n FMT_CONSTEXPR FMT_INLINE value(basic_string_view val) {\n string.data = val.data();\n string.size = val.size();\n }\n FMT_INLINE value(const void* val) : pointer(val) {}\n FMT_INLINE value(const named_arg_info* args, size_t size)\n : named_args{args, size} {}\n\n template FMT_CONSTEXPR FMT_INLINE value(const T& val) {\n custom.value = &val;\n // Get the formatter type through the context to allow different contexts\n // have different extension points, e.g. `formatter` for `format` and\n // `printf_formatter` for `printf`.\n custom.format = format_custom_arg<\n T, conditional_t::value,\n typename Context::template formatter_type,\n fallback_formatter>>;\n }\n\n private:\n // Formats an argument of a custom type, such as a user-defined class.\n template \n static void format_custom_arg(const void* arg,\n typename Context::parse_context_type& parse_ctx,\n Context& ctx) {\n Formatter f;\n parse_ctx.advance_to(f.parse(parse_ctx));\n ctx.advance_to(f.format(*static_cast(arg), ctx));\n }\n};\n\ntemplate \nFMT_CONSTEXPR auto make_arg(const T& value) -> basic_format_arg;\n\n// To minimize the number of types we need to deal with, long is translated\n// either to int or to long long depending on its size.\nenum { long_short = sizeof(long) == sizeof(int) };\nusing long_type = conditional_t;\nusing ulong_type = conditional_t;\n\nstruct unformattable {};\n\n// Maps formatting arguments to core types.\ntemplate struct arg_mapper {\n using char_type = typename Context::char_type;\n\n FMT_CONSTEXPR FMT_INLINE auto map(signed char val) -> int { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(unsigned char val) -> unsigned {\n return val;\n }\n FMT_CONSTEXPR FMT_INLINE auto map(short val) -> int { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(unsigned short val) -> unsigned {\n return val;\n }\n FMT_CONSTEXPR FMT_INLINE auto map(int val) -> int { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(unsigned val) -> unsigned { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(long val) -> long_type { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(unsigned long val) -> ulong_type {\n return val;\n }\n FMT_CONSTEXPR FMT_INLINE auto map(long long val) -> long long { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(unsigned long long val)\n -> unsigned long long {\n return val;\n }\n FMT_CONSTEXPR FMT_INLINE auto map(int128_t val) -> int128_t { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(uint128_t val) -> uint128_t { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(bool val) -> bool { return val; }\n\n template ::value)>\n FMT_CONSTEXPR FMT_INLINE auto map(T val) -> char_type {\n static_assert(\n std::is_same::value || std::is_same::value,\n \"mixing character types is disallowed\");\n return val;\n }\n\n FMT_CONSTEXPR FMT_INLINE auto map(float val) -> float { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(double val) -> double { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(long double val) -> long double {\n return val;\n }\n\n FMT_CONSTEXPR FMT_INLINE auto map(char_type* val) -> const char_type* {\n return val;\n }\n FMT_CONSTEXPR FMT_INLINE auto map(const char_type* val) -> const char_type* {\n return val;\n }\n template ::value)>\n FMT_CONSTEXPR FMT_INLINE auto map(const T& val)\n -> basic_string_view {\n static_assert(std::is_same>::value,\n \"mixing character types is disallowed\");\n return to_string_view(val);\n }\n template , T>::value &&\n !is_string::value && !has_formatter::value &&\n !has_fallback_formatter::value)>\n FMT_CONSTEXPR FMT_INLINE auto map(const T& val)\n -> basic_string_view {\n return basic_string_view(val);\n }\n template <\n typename T,\n FMT_ENABLE_IF(\n std::is_constructible, T>::value &&\n !std::is_constructible, T>::value &&\n !is_string::value && !has_formatter::value &&\n !has_fallback_formatter::value)>\n FMT_CONSTEXPR FMT_INLINE auto map(const T& val)\n -> basic_string_view {\n return std_string_view(val);\n }\n FMT_CONSTEXPR FMT_INLINE auto map(const signed char* val) -> const char* {\n static_assert(std::is_same::value, \"invalid string type\");\n return reinterpret_cast(val);\n }\n FMT_CONSTEXPR FMT_INLINE auto map(const unsigned char* val) -> const char* {\n static_assert(std::is_same::value, \"invalid string type\");\n return reinterpret_cast(val);\n }\n FMT_CONSTEXPR FMT_INLINE auto map(signed char* val) -> const char* {\n const auto* const_val = val;\n return map(const_val);\n }\n FMT_CONSTEXPR FMT_INLINE auto map(unsigned char* val) -> const char* {\n const auto* const_val = val;\n return map(const_val);\n }\n\n FMT_CONSTEXPR FMT_INLINE auto map(void* val) -> const void* { return val; }\n FMT_CONSTEXPR FMT_INLINE auto map(const void* val) -> const void* {\n return val;\n }\n FMT_CONSTEXPR FMT_INLINE auto map(std::nullptr_t val) -> const void* {\n return val;\n }\n\n // We use SFINAE instead of a const T* parameter to avoid conflicting with\n // the C array overload.\n template \n FMT_CONSTEXPR auto map(T) -> enable_if_t::value, int> {\n // Formatting of arbitrary pointers is disallowed. If you want to output\n // a pointer cast it to \"void *\" or \"const void *\". In particular, this\n // forbids formatting of \"[const] volatile char *\" which is printed as bool\n // by iostreams.\n static_assert(!sizeof(T), \"formatting of non-void pointers is disallowed\");\n return 0;\n }\n\n template \n FMT_CONSTEXPR FMT_INLINE auto map(const T (&values)[N]) -> const T (&)[N] {\n return values;\n }\n\n template ::value &&\n !has_formatter::value &&\n !has_fallback_formatter::value)>\n FMT_CONSTEXPR FMT_INLINE auto map(const T& val)\n -> decltype(std::declval().map(\n static_cast::type>(val))) {\n return map(static_cast::type>(val));\n }\n template ::value && !is_char::value &&\n (has_formatter::value ||\n has_fallback_formatter::value))>\n FMT_CONSTEXPR FMT_INLINE auto map(const T& val) -> const T& {\n return val;\n }\n\n template ::value)>\n FMT_CONSTEXPR FMT_INLINE auto map(const T& named_arg)\n -> decltype(std::declval().map(named_arg.value)) {\n return map(named_arg.value);\n }\n\n auto map(...) -> unformattable { return {}; }\n};\n\n// A type constant after applying arg_mapper.\ntemplate \nusing mapped_type_constant =\n type_constant().map(std::declval())),\n typename Context::char_type>;\n\nenum { packed_arg_bits = 4 };\n// Maximum number of arguments with packed types.\nenum { max_packed_args = 62 / packed_arg_bits };\nenum : unsigned long long { is_unpacked_bit = 1ULL << 63 };\nenum : unsigned long long { has_named_args_bit = 1ULL << 62 };\n\nFMT_END_DETAIL_NAMESPACE\n\n// An output iterator that appends to a buffer.\n// It is used to reduce symbol sizes for the common case.\nclass appender : public std::back_insert_iterator> {\n using base = std::back_insert_iterator>;\n\n template \n friend auto get_buffer(appender out) -> detail::buffer& {\n return detail::get_container(out);\n }\n\n public:\n using std::back_insert_iterator>::back_insert_iterator;\n appender(base it) : base(it) {}\n using _Unchecked_type = appender; // Mark iterator as checked.\n\n auto operator++() -> appender& {\n base::operator++();\n return *this;\n }\n\n auto operator++(int) -> appender {\n auto tmp = *this;\n ++*this;\n return tmp;\n }\n};\n\n// A formatting argument. It is a trivially copyable/constructible type to\n// allow storage in basic_memory_buffer.\ntemplate class basic_format_arg {\n private:\n detail::value value_;\n detail::type type_;\n\n template \n friend FMT_CONSTEXPR auto detail::make_arg(const T& value)\n -> basic_format_arg;\n\n template \n friend FMT_CONSTEXPR auto visit_format_arg(Visitor&& vis,\n const basic_format_arg& arg)\n -> decltype(vis(0));\n\n friend class basic_format_args;\n friend class dynamic_format_arg_store;\n\n using char_type = typename Context::char_type;\n\n template \n friend struct detail::arg_data;\n\n basic_format_arg(const detail::named_arg_info* args, size_t size)\n : value_(args, size) {}\n\n public:\n class handle {\n public:\n explicit handle(detail::custom_value custom) : custom_(custom) {}\n\n void format(typename Context::parse_context_type& parse_ctx,\n Context& ctx) const {\n custom_.format(custom_.value, parse_ctx, ctx);\n }\n\n private:\n detail::custom_value custom_;\n };\n\n constexpr basic_format_arg() : type_(detail::type::none_type) {}\n\n constexpr explicit operator bool() const FMT_NOEXCEPT {\n return type_ != detail::type::none_type;\n }\n\n auto type() const -> detail::type { return type_; }\n\n auto is_integral() const -> bool { return detail::is_integral_type(type_); }\n auto is_arithmetic() const -> bool {\n return detail::is_arithmetic_type(type_);\n }\n};\n\n/**\n \\rst\n Visits an argument dispatching to the appropriate visit method based on\n the argument type. For example, if the argument type is ``double`` then\n ``vis(value)`` will be called with the value of type ``double``.\n \\endrst\n */\ntemplate \nFMT_CONSTEXPR FMT_INLINE auto visit_format_arg(\n Visitor&& vis, const basic_format_arg& arg) -> decltype(vis(0)) {\n switch (arg.type_) {\n case detail::type::none_type:\n break;\n case detail::type::int_type:\n return vis(arg.value_.int_value);\n case detail::type::uint_type:\n return vis(arg.value_.uint_value);\n case detail::type::long_long_type:\n return vis(arg.value_.long_long_value);\n case detail::type::ulong_long_type:\n return vis(arg.value_.ulong_long_value);\n case detail::type::int128_type:\n return vis(detail::convert_for_visit(arg.value_.int128_value));\n case detail::type::uint128_type:\n return vis(detail::convert_for_visit(arg.value_.uint128_value));\n case detail::type::bool_type:\n return vis(arg.value_.bool_value);\n case detail::type::char_type:\n return vis(arg.value_.char_value);\n case detail::type::float_type:\n return vis(arg.value_.float_value);\n case detail::type::double_type:\n return vis(arg.value_.double_value);\n case detail::type::long_double_type:\n return vis(arg.value_.long_double_value);\n case detail::type::cstring_type:\n return vis(arg.value_.string.data);\n case detail::type::string_type:\n using sv = basic_string_view;\n return vis(sv(arg.value_.string.data, arg.value_.string.size));\n case detail::type::pointer_type:\n return vis(arg.value_.pointer);\n case detail::type::custom_type:\n return vis(typename basic_format_arg::handle(arg.value_.custom));\n }\n return vis(monostate());\n}\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\ntemplate \nauto copy_str(InputIt begin, InputIt end, appender out) -> appender {\n get_container(out).append(begin, end);\n return out;\n}\n\n#if FMT_GCC_VERSION && FMT_GCC_VERSION < 500\n// A workaround for gcc 4.8 to make void_t work in a SFINAE context.\ntemplate struct void_t_impl { using type = void; };\ntemplate \nusing void_t = typename detail::void_t_impl::type;\n#else\ntemplate using void_t = void;\n#endif\n\ntemplate \nstruct is_output_iterator : std::false_type {};\n\ntemplate \nstruct is_output_iterator<\n It, T,\n void_t::iterator_category,\n decltype(*std::declval() = std::declval())>>\n : std::true_type {};\n\ntemplate \nstruct is_back_insert_iterator : std::false_type {};\ntemplate \nstruct is_back_insert_iterator>\n : std::true_type {};\n\ntemplate \nstruct is_contiguous_back_insert_iterator : std::false_type {};\ntemplate \nstruct is_contiguous_back_insert_iterator>\n : is_contiguous {};\ntemplate <>\nstruct is_contiguous_back_insert_iterator : std::true_type {};\n\n// A type-erased reference to an std::locale to avoid heavy include.\nclass locale_ref {\n private:\n const void* locale_; // A type-erased pointer to std::locale.\n\n public:\n constexpr locale_ref() : locale_(nullptr) {}\n template explicit locale_ref(const Locale& loc);\n\n explicit operator bool() const FMT_NOEXCEPT { return locale_ != nullptr; }\n\n template auto get() const -> Locale;\n};\n\ntemplate constexpr auto encode_types() -> unsigned long long {\n return 0;\n}\n\ntemplate \nconstexpr auto encode_types() -> unsigned long long {\n return static_cast(mapped_type_constant::value) |\n (encode_types() << packed_arg_bits);\n}\n\ntemplate \nFMT_CONSTEXPR auto make_arg(const T& value) -> basic_format_arg {\n basic_format_arg arg;\n arg.type_ = mapped_type_constant::value;\n arg.value_ = arg_mapper().map(value);\n return arg;\n}\n\n// The type template parameter is there to avoid an ODR violation when using\n// a fallback formatter in one translation unit and an implicit conversion in\n// another (not recommended).\ntemplate \nFMT_CONSTEXPR FMT_INLINE auto make_arg(const T& val) -> value {\n const auto& arg = arg_mapper().map(val);\n static_assert(\n !std::is_same::value,\n \"Cannot format an argument. To make type T formattable provide a \"\n \"formatter specialization: https://fmt.dev/latest/api.html#udt\");\n return {arg};\n}\n\ntemplate \ninline auto make_arg(const T& value) -> basic_format_arg {\n return make_arg(value);\n}\nFMT_END_DETAIL_NAMESPACE\n\n// Formatting context.\ntemplate class basic_format_context {\n public:\n /** The character type for the output. */\n using char_type = Char;\n\n private:\n OutputIt out_;\n basic_format_args args_;\n detail::locale_ref loc_;\n\n public:\n using iterator = OutputIt;\n using format_arg = basic_format_arg;\n using parse_context_type = basic_format_parse_context;\n template using formatter_type = formatter;\n\n basic_format_context(basic_format_context&&) = default;\n basic_format_context(const basic_format_context&) = delete;\n void operator=(const basic_format_context&) = delete;\n /**\n Constructs a ``basic_format_context`` object. References to the arguments are\n stored in the object so make sure they have appropriate lifetimes.\n */\n constexpr basic_format_context(\n OutputIt out, basic_format_args ctx_args,\n detail::locale_ref loc = detail::locale_ref())\n : out_(out), args_(ctx_args), loc_(loc) {}\n\n constexpr auto arg(int id) const -> format_arg { return args_.get(id); }\n FMT_CONSTEXPR auto arg(basic_string_view name) -> format_arg {\n return args_.get(name);\n }\n FMT_CONSTEXPR auto arg_id(basic_string_view name) -> int {\n return args_.get_id(name);\n }\n auto args() const -> const basic_format_args& {\n return args_;\n }\n\n FMT_CONSTEXPR auto error_handler() -> detail::error_handler { return {}; }\n void on_error(const char* message) { error_handler().on_error(message); }\n\n // Returns an iterator to the beginning of the output range.\n FMT_CONSTEXPR auto out() -> iterator { return out_; }\n\n // Advances the begin iterator to ``it``.\n void advance_to(iterator it) {\n if (!detail::is_back_insert_iterator()) out_ = it;\n }\n\n FMT_CONSTEXPR auto locale() -> detail::locale_ref { return loc_; }\n};\n\ntemplate \nusing buffer_context =\n basic_format_context, Char>;\nusing format_context = buffer_context;\n\n// Workaround an alias issue: https://stackoverflow.com/q/62767544/471164.\n#define FMT_BUFFER_CONTEXT(Char) \\\n basic_format_context, Char>\n\ntemplate \nusing is_formattable = bool_constant<\n !std::is_same>().map(\n std::declval())),\n detail::unformattable>::value &&\n !detail::has_fallback_formatter::value>;\n\n/**\n \\rst\n An array of references to arguments. It can be implicitly converted into\n `~fmt::basic_format_args` for passing into type-erased formatting functions\n such as `~fmt::vformat`.\n \\endrst\n */\ntemplate \nclass format_arg_store\n#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409\n // Workaround a GCC template argument substitution bug.\n : public basic_format_args\n#endif\n{\n private:\n static const size_t num_args = sizeof...(Args);\n static const size_t num_named_args = detail::count_named_args();\n static const bool is_packed = num_args <= detail::max_packed_args;\n\n using value_type = conditional_t,\n basic_format_arg>;\n\n detail::arg_data\n data_;\n\n friend class basic_format_args;\n\n static constexpr unsigned long long desc =\n (is_packed ? detail::encode_types()\n : detail::is_unpacked_bit | num_args) |\n (num_named_args != 0\n ? static_cast(detail::has_named_args_bit)\n : 0);\n\n public:\n FMT_CONSTEXPR FMT_INLINE format_arg_store(const Args&... args)\n :\n#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409\n basic_format_args(*this),\n#endif\n data_{detail::make_arg<\n is_packed, Context,\n detail::mapped_type_constant::value>(args)...} {\n detail::init_named_args(data_.named_args(), 0, 0, args...);\n }\n};\n\n/**\n \\rst\n Constructs a `~fmt::format_arg_store` object that contains references to\n arguments and can be implicitly converted to `~fmt::format_args`. `Context`\n can be omitted in which case it defaults to `~fmt::context`.\n See `~fmt::arg` for lifetime considerations.\n \\endrst\n */\ntemplate \nconstexpr auto make_format_args(const Args&... args)\n -> format_arg_store {\n return {args...};\n}\n\n/**\n \\rst\n Returns a named argument to be used in a formatting function.\n It should only be used in a call to a formatting function or\n `dynamic_format_arg_store::push_back`.\n\n **Example**::\n\n fmt::print(\"Elapsed time: {s:.2f} seconds\", fmt::arg(\"s\", 1.23));\n \\endrst\n */\ntemplate \ninline auto arg(const Char* name, const T& arg) -> detail::named_arg {\n static_assert(!detail::is_named_arg(), \"nested named arguments\");\n return {name, arg};\n}\n\n/**\n \\rst\n A view of a collection of formatting arguments. To avoid lifetime issues it\n should only be used as a parameter type in type-erased functions such as\n ``vformat``::\n\n void vlog(string_view format_str, format_args args); // OK\n format_args args = make_format_args(42); // Error: dangling reference\n \\endrst\n */\ntemplate class basic_format_args {\n public:\n using size_type = int;\n using format_arg = basic_format_arg;\n\n private:\n // A descriptor that contains information about formatting arguments.\n // If the number of arguments is less or equal to max_packed_args then\n // argument types are passed in the descriptor. This reduces binary code size\n // per formatting function call.\n unsigned long long desc_;\n union {\n // If is_packed() returns true then argument values are stored in values_;\n // otherwise they are stored in args_. This is done to improve cache\n // locality and reduce compiled code size since storing larger objects\n // may require more code (at least on x86-64) even if the same amount of\n // data is actually copied to stack. It saves ~10% on the bloat test.\n const detail::value* values_;\n const format_arg* args_;\n };\n\n constexpr auto is_packed() const -> bool {\n return (desc_ & detail::is_unpacked_bit) == 0;\n }\n auto has_named_args() const -> bool {\n return (desc_ & detail::has_named_args_bit) != 0;\n }\n\n FMT_CONSTEXPR auto type(int index) const -> detail::type {\n int shift = index * detail::packed_arg_bits;\n unsigned int mask = (1 << detail::packed_arg_bits) - 1;\n return static_cast((desc_ >> shift) & mask);\n }\n\n constexpr FMT_INLINE basic_format_args(unsigned long long desc,\n const detail::value* values)\n : desc_(desc), values_(values) {}\n constexpr basic_format_args(unsigned long long desc, const format_arg* args)\n : desc_(desc), args_(args) {}\n\n public:\n constexpr basic_format_args() : desc_(0), args_(nullptr) {}\n\n /**\n \\rst\n Constructs a `basic_format_args` object from `~fmt::format_arg_store`.\n \\endrst\n */\n template \n constexpr FMT_INLINE basic_format_args(\n const format_arg_store& store)\n : basic_format_args(format_arg_store::desc,\n store.data_.args()) {}\n\n /**\n \\rst\n Constructs a `basic_format_args` object from\n `~fmt::dynamic_format_arg_store`.\n \\endrst\n */\n constexpr FMT_INLINE basic_format_args(\n const dynamic_format_arg_store& store)\n : basic_format_args(store.get_types(), store.data()) {}\n\n /**\n \\rst\n Constructs a `basic_format_args` object from a dynamic set of arguments.\n \\endrst\n */\n constexpr basic_format_args(const format_arg* args, int count)\n : basic_format_args(detail::is_unpacked_bit | detail::to_unsigned(count),\n args) {}\n\n /** Returns the argument with the specified id. */\n FMT_CONSTEXPR auto get(int id) const -> format_arg {\n format_arg arg;\n if (!is_packed()) {\n if (id < max_size()) arg = args_[id];\n return arg;\n }\n if (id >= detail::max_packed_args) return arg;\n arg.type_ = type(id);\n if (arg.type_ == detail::type::none_type) return arg;\n arg.value_ = values_[id];\n return arg;\n }\n\n template \n auto get(basic_string_view name) const -> format_arg {\n int id = get_id(name);\n return id >= 0 ? get(id) : format_arg();\n }\n\n template \n auto get_id(basic_string_view name) const -> int {\n if (!has_named_args()) return -1;\n const auto& named_args =\n (is_packed() ? values_[-1] : args_[-1].value_).named_args;\n for (size_t i = 0; i < named_args.size; ++i) {\n if (named_args.data[i].name == name) return named_args.data[i].id;\n }\n return -1;\n }\n\n auto max_size() const -> int {\n unsigned long long max_packed = detail::max_packed_args;\n return static_cast(is_packed() ? max_packed\n : desc_ & ~detail::is_unpacked_bit);\n }\n};\n\n/** An alias to ``basic_format_args``. */\n// A separate type would result in shorter symbols but break ABI compatibility\n// between clang and gcc on ARM (#1919).\nusing format_args = basic_format_args;\n\n// We cannot use enum classes as bit fields because of a gcc bug\n// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=61414.\nnamespace align {\nenum type { none, left, right, center, numeric };\n}\nusing align_t = align::type;\nnamespace sign {\nenum type { none, minus, plus, space };\n}\nusing sign_t = sign::type;\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\nvoid throw_format_error(const char* message);\n\n// Workaround an array initialization issue in gcc 4.8.\ntemplate struct fill_t {\n private:\n enum { max_size = 4 };\n Char data_[max_size] = {Char(' '), Char(0), Char(0), Char(0)};\n unsigned char size_ = 1;\n\n public:\n FMT_CONSTEXPR void operator=(basic_string_view s) {\n auto size = s.size();\n if (size > max_size) return throw_format_error(\"invalid fill\");\n for (size_t i = 0; i < size; ++i) data_[i] = s[i];\n size_ = static_cast(size);\n }\n\n constexpr auto size() const -> size_t { return size_; }\n constexpr auto data() const -> const Char* { return data_; }\n\n FMT_CONSTEXPR auto operator[](size_t index) -> Char& { return data_[index]; }\n FMT_CONSTEXPR auto operator[](size_t index) const -> const Char& {\n return data_[index];\n }\n};\nFMT_END_DETAIL_NAMESPACE\n\n// Format specifiers for built-in and string types.\ntemplate struct basic_format_specs {\n int width;\n int precision;\n char type;\n align_t align : 4;\n sign_t sign : 3;\n bool alt : 1; // Alternate form ('#').\n bool localized : 1;\n detail::fill_t fill;\n\n constexpr basic_format_specs()\n : width(0),\n precision(-1),\n type(0),\n align(align::none),\n sign(sign::none),\n alt(false),\n localized(false) {}\n};\n\nusing format_specs = basic_format_specs;\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\nenum class arg_id_kind { none, index, name };\n\n// An argument reference.\ntemplate struct arg_ref {\n FMT_CONSTEXPR arg_ref() : kind(arg_id_kind::none), val() {}\n\n FMT_CONSTEXPR explicit arg_ref(int index)\n : kind(arg_id_kind::index), val(index) {}\n FMT_CONSTEXPR explicit arg_ref(basic_string_view name)\n : kind(arg_id_kind::name), val(name) {}\n\n FMT_CONSTEXPR auto operator=(int idx) -> arg_ref& {\n kind = arg_id_kind::index;\n val.index = idx;\n return *this;\n }\n\n arg_id_kind kind;\n union value {\n FMT_CONSTEXPR value(int id = 0) : index{id} {}\n FMT_CONSTEXPR value(basic_string_view n) : name(n) {}\n\n int index;\n basic_string_view name;\n } val;\n};\n\n// Format specifiers with width and precision resolved at formatting rather\n// than parsing time to allow re-using the same parsed specifiers with\n// different sets of arguments (precompilation of format strings).\ntemplate \nstruct dynamic_format_specs : basic_format_specs {\n arg_ref width_ref;\n arg_ref precision_ref;\n};\n\nstruct auto_id {};\n\n// A format specifier handler that sets fields in basic_format_specs.\ntemplate class specs_setter {\n protected:\n basic_format_specs& specs_;\n\n public:\n explicit FMT_CONSTEXPR specs_setter(basic_format_specs& specs)\n : specs_(specs) {}\n\n FMT_CONSTEXPR specs_setter(const specs_setter& other)\n : specs_(other.specs_) {}\n\n FMT_CONSTEXPR void on_align(align_t align) { specs_.align = align; }\n FMT_CONSTEXPR void on_fill(basic_string_view fill) {\n specs_.fill = fill;\n }\n FMT_CONSTEXPR void on_sign(sign_t s) { specs_.sign = s; }\n FMT_CONSTEXPR void on_hash() { specs_.alt = true; }\n FMT_CONSTEXPR void on_localized() { specs_.localized = true; }\n\n FMT_CONSTEXPR void on_zero() {\n if (specs_.align == align::none) specs_.align = align::numeric;\n specs_.fill[0] = Char('0');\n }\n\n FMT_CONSTEXPR void on_width(int width) { specs_.width = width; }\n FMT_CONSTEXPR void on_precision(int precision) {\n specs_.precision = precision;\n }\n FMT_CONSTEXPR void end_precision() {}\n\n FMT_CONSTEXPR void on_type(Char type) {\n specs_.type = static_cast(type);\n }\n};\n\n// Format spec handler that saves references to arguments representing dynamic\n// width and precision to be resolved at formatting time.\ntemplate \nclass dynamic_specs_handler\n : public specs_setter {\n public:\n using char_type = typename ParseContext::char_type;\n\n FMT_CONSTEXPR dynamic_specs_handler(dynamic_format_specs& specs,\n ParseContext& ctx)\n : specs_setter(specs), specs_(specs), context_(ctx) {}\n\n FMT_CONSTEXPR dynamic_specs_handler(const dynamic_specs_handler& other)\n : specs_setter(other),\n specs_(other.specs_),\n context_(other.context_) {}\n\n template FMT_CONSTEXPR void on_dynamic_width(Id arg_id) {\n specs_.width_ref = make_arg_ref(arg_id);\n }\n\n template FMT_CONSTEXPR void on_dynamic_precision(Id arg_id) {\n specs_.precision_ref = make_arg_ref(arg_id);\n }\n\n FMT_CONSTEXPR void on_error(const char* message) {\n context_.on_error(message);\n }\n\n private:\n dynamic_format_specs& specs_;\n ParseContext& context_;\n\n using arg_ref_type = arg_ref;\n\n FMT_CONSTEXPR auto make_arg_ref(int arg_id) -> arg_ref_type {\n context_.check_arg_id(arg_id);\n return arg_ref_type(arg_id);\n }\n\n FMT_CONSTEXPR auto make_arg_ref(auto_id) -> arg_ref_type {\n return arg_ref_type(context_.next_arg_id());\n }\n\n FMT_CONSTEXPR auto make_arg_ref(basic_string_view arg_id)\n -> arg_ref_type {\n context_.check_arg_id(arg_id);\n basic_string_view format_str(\n context_.begin(), to_unsigned(context_.end() - context_.begin()));\n return arg_ref_type(arg_id);\n }\n};\n\ntemplate constexpr bool is_ascii_letter(Char c) {\n return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');\n}\n\n// Converts a character to ASCII. Returns a number > 127 on conversion failure.\ntemplate ::value)>\nconstexpr auto to_ascii(Char value) -> Char {\n return value;\n}\ntemplate ::value)>\nconstexpr auto to_ascii(Char value) ->\n typename std::underlying_type::type {\n return value;\n}\n\ntemplate \nFMT_CONSTEXPR auto code_point_length(const Char* begin) -> int {\n if (const_check(sizeof(Char) != 1)) return 1;\n constexpr char lengths[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\n 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 3, 3, 4, 0};\n int len = lengths[static_cast(*begin) >> 3];\n\n // Compute the pointer to the next character early so that the next\n // iteration can start working on the next character. Neither Clang\n // nor GCC figure out this reordering on their own.\n return len + !len;\n}\n\n// Return the result via the out param to workaround gcc bug 77539.\ntemplate \nFMT_CONSTEXPR auto find(Ptr first, Ptr last, T value, Ptr& out) -> bool {\n for (out = first; out != last; ++out) {\n if (*out == value) return true;\n }\n return false;\n}\n\ntemplate <>\ninline auto find(const char* first, const char* last, char value,\n const char*& out) -> bool {\n out = static_cast(\n std::memchr(first, value, to_unsigned(last - first)));\n return out != nullptr;\n}\n\n// Parses the range [begin, end) as an unsigned integer. This function assumes\n// that the range is non-empty and the first character is a digit.\ntemplate \nFMT_CONSTEXPR auto parse_nonnegative_int(const Char*& begin, const Char* end,\n int error_value) noexcept -> int {\n FMT_ASSERT(begin != end && '0' <= *begin && *begin <= '9', \"\");\n unsigned value = 0, prev = 0;\n auto p = begin;\n do {\n prev = value;\n value = value * 10 + unsigned(*p - '0');\n ++p;\n } while (p != end && '0' <= *p && *p <= '9');\n auto num_digits = p - begin;\n begin = p;\n if (num_digits <= std::numeric_limits::digits10)\n return static_cast(value);\n // Check for overflow.\n const unsigned max = to_unsigned((std::numeric_limits::max)());\n return num_digits == std::numeric_limits::digits10 + 1 &&\n prev * 10ull + unsigned(p[-1] - '0') <= max\n ? static_cast(value)\n : error_value;\n}\n\n// Parses fill and alignment.\ntemplate \nFMT_CONSTEXPR auto parse_align(const Char* begin, const Char* end,\n Handler&& handler) -> const Char* {\n FMT_ASSERT(begin != end, \"\");\n auto align = align::none;\n auto p = begin + code_point_length(begin);\n if (p >= end) p = begin;\n for (;;) {\n switch (to_ascii(*p)) {\n case '<':\n align = align::left;\n break;\n case '>':\n align = align::right;\n break;\n case '^':\n align = align::center;\n break;\n default:\n break;\n }\n if (align != align::none) {\n if (p != begin) {\n auto c = *begin;\n if (c == '{')\n return handler.on_error(\"invalid fill character '{'\"), begin;\n handler.on_fill(basic_string_view(begin, to_unsigned(p - begin)));\n begin = p + 1;\n } else\n ++begin;\n handler.on_align(align);\n break;\n } else if (p == begin) {\n break;\n }\n p = begin;\n }\n return begin;\n}\n\ntemplate FMT_CONSTEXPR bool is_name_start(Char c) {\n return ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') || '_' == c;\n}\n\ntemplate \nFMT_CONSTEXPR auto do_parse_arg_id(const Char* begin, const Char* end,\n IDHandler&& handler) -> const Char* {\n FMT_ASSERT(begin != end, \"\");\n Char c = *begin;\n if (c >= '0' && c <= '9') {\n int index = 0;\n if (c != '0')\n index =\n parse_nonnegative_int(begin, end, (std::numeric_limits::max)());\n else\n ++begin;\n if (begin == end || (*begin != '}' && *begin != ':'))\n handler.on_error(\"invalid format string\");\n else\n handler(index);\n return begin;\n }\n if (!is_name_start(c)) {\n handler.on_error(\"invalid format string\");\n return begin;\n }\n auto it = begin;\n do {\n ++it;\n } while (it != end && (is_name_start(c = *it) || ('0' <= c && c <= '9')));\n handler(basic_string_view(begin, to_unsigned(it - begin)));\n return it;\n}\n\ntemplate \nFMT_CONSTEXPR FMT_INLINE auto parse_arg_id(const Char* begin, const Char* end,\n IDHandler&& handler) -> const Char* {\n Char c = *begin;\n if (c != '}' && c != ':') return do_parse_arg_id(begin, end, handler);\n handler();\n return begin;\n}\n\ntemplate \nFMT_CONSTEXPR auto parse_width(const Char* begin, const Char* end,\n Handler&& handler) -> const Char* {\n using detail::auto_id;\n struct width_adapter {\n Handler& handler;\n\n FMT_CONSTEXPR void operator()() { handler.on_dynamic_width(auto_id()); }\n FMT_CONSTEXPR void operator()(int id) { handler.on_dynamic_width(id); }\n FMT_CONSTEXPR void operator()(basic_string_view id) {\n handler.on_dynamic_width(id);\n }\n FMT_CONSTEXPR void on_error(const char* message) {\n if (message) handler.on_error(message);\n }\n };\n\n FMT_ASSERT(begin != end, \"\");\n if ('0' <= *begin && *begin <= '9') {\n int width = parse_nonnegative_int(begin, end, -1);\n if (width != -1)\n handler.on_width(width);\n else\n handler.on_error(\"number is too big\");\n } else if (*begin == '{') {\n ++begin;\n if (begin != end) begin = parse_arg_id(begin, end, width_adapter{handler});\n if (begin == end || *begin != '}')\n return handler.on_error(\"invalid format string\"), begin;\n ++begin;\n }\n return begin;\n}\n\ntemplate \nFMT_CONSTEXPR auto parse_precision(const Char* begin, const Char* end,\n Handler&& handler) -> const Char* {\n using detail::auto_id;\n struct precision_adapter {\n Handler& handler;\n\n FMT_CONSTEXPR void operator()() { handler.on_dynamic_precision(auto_id()); }\n FMT_CONSTEXPR void operator()(int id) { handler.on_dynamic_precision(id); }\n FMT_CONSTEXPR void operator()(basic_string_view id) {\n handler.on_dynamic_precision(id);\n }\n FMT_CONSTEXPR void on_error(const char* message) {\n if (message) handler.on_error(message);\n }\n };\n\n ++begin;\n auto c = begin != end ? *begin : Char();\n if ('0' <= c && c <= '9') {\n auto precision = parse_nonnegative_int(begin, end, -1);\n if (precision != -1)\n handler.on_precision(precision);\n else\n handler.on_error(\"number is too big\");\n } else if (c == '{') {\n ++begin;\n if (begin != end)\n begin = parse_arg_id(begin, end, precision_adapter{handler});\n if (begin == end || *begin++ != '}')\n return handler.on_error(\"invalid format string\"), begin;\n } else {\n return handler.on_error(\"missing precision specifier\"), begin;\n }\n handler.end_precision();\n return begin;\n}\n\n// Parses standard format specifiers and sends notifications about parsed\n// components to handler.\ntemplate \nFMT_CONSTEXPR FMT_INLINE auto parse_format_specs(const Char* begin,\n const Char* end,\n SpecHandler&& handler)\n -> const Char* {\n if (begin + 1 < end && begin[1] == '}' && is_ascii_letter(*begin) &&\n *begin != 'L') {\n handler.on_type(*begin++);\n return begin;\n }\n\n if (begin == end) return begin;\n\n begin = parse_align(begin, end, handler);\n if (begin == end) return begin;\n\n // Parse sign.\n switch (to_ascii(*begin)) {\n case '+':\n handler.on_sign(sign::plus);\n ++begin;\n break;\n case '-':\n handler.on_sign(sign::minus);\n ++begin;\n break;\n case ' ':\n handler.on_sign(sign::space);\n ++begin;\n break;\n default:\n break;\n }\n if (begin == end) return begin;\n\n if (*begin == '#') {\n handler.on_hash();\n if (++begin == end) return begin;\n }\n\n // Parse zero flag.\n if (*begin == '0') {\n handler.on_zero();\n if (++begin == end) return begin;\n }\n\n begin = parse_width(begin, end, handler);\n if (begin == end) return begin;\n\n // Parse precision.\n if (*begin == '.') {\n begin = parse_precision(begin, end, handler);\n if (begin == end) return begin;\n }\n\n if (*begin == 'L') {\n handler.on_localized();\n ++begin;\n }\n\n // Parse type.\n if (begin != end && *begin != '}') handler.on_type(*begin++);\n return begin;\n}\n\ntemplate \nFMT_CONSTEXPR auto parse_replacement_field(const Char* begin, const Char* end,\n Handler&& handler) -> const Char* {\n struct id_adapter {\n Handler& handler;\n int arg_id;\n\n FMT_CONSTEXPR void operator()() { arg_id = handler.on_arg_id(); }\n FMT_CONSTEXPR void operator()(int id) { arg_id = handler.on_arg_id(id); }\n FMT_CONSTEXPR void operator()(basic_string_view id) {\n arg_id = handler.on_arg_id(id);\n }\n FMT_CONSTEXPR void on_error(const char* message) {\n if (message) handler.on_error(message);\n }\n };\n\n ++begin;\n if (begin == end) return handler.on_error(\"invalid format string\"), end;\n if (*begin == '}') {\n handler.on_replacement_field(handler.on_arg_id(), begin);\n } else if (*begin == '{') {\n handler.on_text(begin, begin + 1);\n } else {\n auto adapter = id_adapter{handler, 0};\n begin = parse_arg_id(begin, end, adapter);\n Char c = begin != end ? *begin : Char();\n if (c == '}') {\n handler.on_replacement_field(adapter.arg_id, begin);\n } else if (c == ':') {\n begin = handler.on_format_specs(adapter.arg_id, begin + 1, end);\n if (begin == end || *begin != '}')\n return handler.on_error(\"unknown format specifier\"), end;\n } else {\n return handler.on_error(\"missing '}' in format string\"), end;\n }\n }\n return begin + 1;\n}\n\ntemplate \nFMT_CONSTEXPR FMT_INLINE void parse_format_string(\n basic_string_view format_str, Handler&& handler) {\n // this is most likely a name-lookup defect in msvc's modules implementation\n using detail::find;\n\n auto begin = format_str.data();\n auto end = begin + format_str.size();\n if (end - begin < 32) {\n // Use a simple loop instead of memchr for small strings.\n const Char* p = begin;\n while (p != end) {\n auto c = *p++;\n if (c == '{') {\n handler.on_text(begin, p - 1);\n begin = p = parse_replacement_field(p - 1, end, handler);\n } else if (c == '}') {\n if (p == end || *p != '}')\n return handler.on_error(\"unmatched '}' in format string\");\n handler.on_text(begin, p);\n begin = ++p;\n }\n }\n handler.on_text(begin, end);\n return;\n }\n struct writer {\n FMT_CONSTEXPR void operator()(const Char* pbegin, const Char* pend) {\n if (pbegin == pend) return;\n for (;;) {\n const Char* p = nullptr;\n if (!find(pbegin, pend, '}', p))\n return handler_.on_text(pbegin, pend);\n ++p;\n if (p == pend || *p != '}')\n return handler_.on_error(\"unmatched '}' in format string\");\n handler_.on_text(pbegin, p);\n pbegin = p + 1;\n }\n }\n Handler& handler_;\n } write{handler};\n while (begin != end) {\n // Doing two passes with memchr (one for '{' and another for '}') is up to\n // 2.5x faster than the naive one-pass implementation on big format strings.\n const Char* p = begin;\n if (*begin != '{' && !find(begin + 1, end, '{', p))\n return write(begin, end);\n write(begin, p);\n begin = parse_replacement_field(p, end, handler);\n }\n}\n\ntemplate \nFMT_CONSTEXPR auto parse_format_specs(ParseContext& ctx)\n -> decltype(ctx.begin()) {\n using char_type = typename ParseContext::char_type;\n using context = buffer_context;\n using mapped_type = conditional_t<\n mapped_type_constant::value != type::custom_type,\n decltype(arg_mapper().map(std::declval())), T>;\n auto f = conditional_t::value,\n formatter,\n fallback_formatter>();\n return f.parse(ctx);\n}\n\n// A parse context with extra argument id checks. It is only used at compile\n// time because adding checks at runtime would introduce substantial overhead\n// and would be redundant since argument ids are checked when arguments are\n// retrieved anyway.\ntemplate \nclass compile_parse_context\n : public basic_format_parse_context {\n private:\n int num_args_;\n using base = basic_format_parse_context;\n\n public:\n explicit FMT_CONSTEXPR compile_parse_context(\n basic_string_view format_str,\n int num_args = (std::numeric_limits::max)(), ErrorHandler eh = {})\n : base(format_str, eh), num_args_(num_args) {}\n\n FMT_CONSTEXPR auto next_arg_id() -> int {\n int id = base::next_arg_id();\n if (id >= num_args_) this->on_error(\"argument not found\");\n return id;\n }\n\n FMT_CONSTEXPR void check_arg_id(int id) {\n base::check_arg_id(id);\n if (id >= num_args_) this->on_error(\"argument not found\");\n }\n using base::check_arg_id;\n};\n\ntemplate \nFMT_CONSTEXPR void check_int_type_spec(char spec, ErrorHandler&& eh) {\n switch (spec) {\n case 0:\n case 'd':\n case 'x':\n case 'X':\n case 'b':\n case 'B':\n case 'o':\n case 'c':\n break;\n default:\n eh.on_error(\"invalid type specifier\");\n break;\n }\n}\n\n// Checks char specs and returns true if the type spec is char (and not int).\ntemplate \nFMT_CONSTEXPR auto check_char_specs(const basic_format_specs& specs,\n ErrorHandler&& eh = {}) -> bool {\n if (specs.type && specs.type != 'c') {\n check_int_type_spec(specs.type, eh);\n return false;\n }\n if (specs.align == align::numeric || specs.sign != sign::none || specs.alt)\n eh.on_error(\"invalid format specifier for char\");\n return true;\n}\n\n// A floating-point presentation format.\nenum class float_format : unsigned char {\n general, // General: exponent notation or fixed point based on magnitude.\n exp, // Exponent notation with the default precision of 6, e.g. 1.2e-3.\n fixed, // Fixed point with the default precision of 6, e.g. 0.0012.\n hex\n};\n\nstruct float_specs {\n int precision;\n float_format format : 8;\n sign_t sign : 8;\n bool upper : 1;\n bool locale : 1;\n bool binary32 : 1;\n bool use_grisu : 1;\n bool showpoint : 1;\n};\n\ntemplate \nFMT_CONSTEXPR auto parse_float_type_spec(const basic_format_specs& specs,\n ErrorHandler&& eh = {})\n -> float_specs {\n auto result = float_specs();\n result.showpoint = specs.alt;\n result.locale = specs.localized;\n switch (specs.type) {\n case 0:\n result.format = float_format::general;\n break;\n case 'G':\n result.upper = true;\n FMT_FALLTHROUGH;\n case 'g':\n result.format = float_format::general;\n break;\n case 'E':\n result.upper = true;\n FMT_FALLTHROUGH;\n case 'e':\n result.format = float_format::exp;\n result.showpoint |= specs.precision != 0;\n break;\n case 'F':\n result.upper = true;\n FMT_FALLTHROUGH;\n case 'f':\n result.format = float_format::fixed;\n result.showpoint |= specs.precision != 0;\n break;\n case 'A':\n result.upper = true;\n FMT_FALLTHROUGH;\n case 'a':\n result.format = float_format::hex;\n break;\n default:\n eh.on_error(\"invalid type specifier\");\n break;\n }\n return result;\n}\n\ntemplate \nFMT_CONSTEXPR auto check_cstring_type_spec(Char spec, ErrorHandler&& eh = {})\n -> bool {\n if (spec == 0 || spec == 's') return true;\n if (spec != 'p') eh.on_error(\"invalid type specifier\");\n return false;\n}\n\ntemplate \nFMT_CONSTEXPR void check_string_type_spec(Char spec, ErrorHandler&& eh) {\n if (spec != 0 && spec != 's') eh.on_error(\"invalid type specifier\");\n}\n\ntemplate \nFMT_CONSTEXPR void check_pointer_type_spec(Char spec, ErrorHandler&& eh) {\n if (spec != 0 && spec != 'p') eh.on_error(\"invalid type specifier\");\n}\n\n// A parse_format_specs handler that checks if specifiers are consistent with\n// the argument type.\ntemplate class specs_checker : public Handler {\n private:\n detail::type arg_type_;\n\n FMT_CONSTEXPR void require_numeric_argument() {\n if (!is_arithmetic_type(arg_type_))\n this->on_error(\"format specifier requires numeric argument\");\n }\n\n public:\n FMT_CONSTEXPR specs_checker(const Handler& handler, detail::type arg_type)\n : Handler(handler), arg_type_(arg_type) {}\n\n FMT_CONSTEXPR void on_align(align_t align) {\n if (align == align::numeric) require_numeric_argument();\n Handler::on_align(align);\n }\n\n FMT_CONSTEXPR void on_sign(sign_t s) {\n require_numeric_argument();\n if (is_integral_type(arg_type_) && arg_type_ != type::int_type &&\n arg_type_ != type::long_long_type && arg_type_ != type::char_type) {\n this->on_error(\"format specifier requires signed argument\");\n }\n Handler::on_sign(s);\n }\n\n FMT_CONSTEXPR void on_hash() {\n require_numeric_argument();\n Handler::on_hash();\n }\n\n FMT_CONSTEXPR void on_localized() {\n require_numeric_argument();\n Handler::on_localized();\n }\n\n FMT_CONSTEXPR void on_zero() {\n require_numeric_argument();\n Handler::on_zero();\n }\n\n FMT_CONSTEXPR void end_precision() {\n if (is_integral_type(arg_type_) || arg_type_ == type::pointer_type)\n this->on_error(\"precision not allowed for this argument type\");\n }\n};\n\nconstexpr int invalid_arg_index = -1;\n\n#if FMT_USE_NONTYPE_TEMPLATE_PARAMETERS\ntemplate \nconstexpr auto get_arg_index_by_name(basic_string_view name) -> int {\n if constexpr (detail::is_statically_named_arg()) {\n if (name == T::name) return N;\n }\n if constexpr (sizeof...(Args) > 0)\n return get_arg_index_by_name(name);\n (void)name; // Workaround an MSVC bug about \"unused\" parameter.\n return invalid_arg_index;\n}\n#endif\n\ntemplate \nFMT_CONSTEXPR auto get_arg_index_by_name(basic_string_view name) -> int {\n#if FMT_USE_NONTYPE_TEMPLATE_PARAMETERS\n if constexpr (sizeof...(Args) > 0)\n return get_arg_index_by_name<0, Args...>(name);\n#endif\n (void)name;\n return invalid_arg_index;\n}\n\ntemplate \nclass format_string_checker {\n private:\n using parse_context_type = compile_parse_context;\n enum { num_args = sizeof...(Args) };\n\n // Format specifier parsing function.\n using parse_func = const Char* (*)(parse_context_type&);\n\n parse_context_type context_;\n parse_func parse_funcs_[num_args > 0 ? num_args : 1];\n\n public:\n explicit FMT_CONSTEXPR format_string_checker(\n basic_string_view format_str, ErrorHandler eh)\n : context_(format_str, num_args, eh),\n parse_funcs_{&parse_format_specs...} {}\n\n FMT_CONSTEXPR void on_text(const Char*, const Char*) {}\n\n FMT_CONSTEXPR auto on_arg_id() -> int { return context_.next_arg_id(); }\n FMT_CONSTEXPR auto on_arg_id(int id) -> int {\n return context_.check_arg_id(id), id;\n }\n FMT_CONSTEXPR auto on_arg_id(basic_string_view id) -> int {\n#if FMT_USE_NONTYPE_TEMPLATE_PARAMETERS\n auto index = get_arg_index_by_name(id);\n if (index == invalid_arg_index) on_error(\"named argument is not found\");\n return context_.check_arg_id(index), index;\n#else\n (void)id;\n on_error(\"compile-time checks for named arguments require C++20 support\");\n return 0;\n#endif\n }\n\n FMT_CONSTEXPR void on_replacement_field(int, const Char*) {}\n\n FMT_CONSTEXPR auto on_format_specs(int id, const Char* begin, const Char*)\n -> const Char* {\n context_.advance_to(context_.begin() + (begin - &*context_.begin()));\n // id >= 0 check is a workaround for gcc 10 bug (#2065).\n return id >= 0 && id < num_args ? parse_funcs_[id](context_) : begin;\n }\n\n FMT_CONSTEXPR void on_error(const char* message) {\n context_.on_error(message);\n }\n};\n\ntemplate ::value), int>>\nvoid check_format_string(S format_str) {\n FMT_CONSTEXPR auto s = to_string_view(format_str);\n using checker = format_string_checker...>;\n FMT_CONSTEXPR bool invalid_format =\n (parse_format_string(s, checker(s, {})), true);\n (void)invalid_format;\n}\n\ntemplate \nvoid vformat_to(\n buffer& buf, basic_string_view fmt,\n basic_format_args)> args,\n detail::locale_ref loc = {});\n\nFMT_API void vprint_mojibake(std::FILE*, string_view, format_args);\n#ifndef _WIN32\ninline void vprint_mojibake(std::FILE*, string_view, format_args) {}\n#endif\nFMT_END_DETAIL_NAMESPACE\n\n// A formatter specialization for the core types corresponding to detail::type\n// constants.\ntemplate \nstruct formatter::value !=\n detail::type::custom_type>> {\n private:\n detail::dynamic_format_specs specs_;\n\n public:\n // Parses format specifiers stopping either at the end of the range or at the\n // terminating '}'.\n template \n FMT_CONSTEXPR auto parse(ParseContext& ctx) -> decltype(ctx.begin()) {\n auto begin = ctx.begin(), end = ctx.end();\n if (begin == end) return begin;\n using handler_type = detail::dynamic_specs_handler;\n auto type = detail::type_constant::value;\n auto checker =\n detail::specs_checker(handler_type(specs_, ctx), type);\n auto it = detail::parse_format_specs(begin, end, checker);\n auto eh = ctx.error_handler();\n switch (type) {\n case detail::type::none_type:\n FMT_ASSERT(false, \"invalid argument type\");\n break;\n case detail::type::bool_type:\n if (!specs_.type || specs_.type == 's') break;\n FMT_FALLTHROUGH;\n case detail::type::int_type:\n case detail::type::uint_type:\n case detail::type::long_long_type:\n case detail::type::ulong_long_type:\n case detail::type::int128_type:\n case detail::type::uint128_type:\n detail::check_int_type_spec(specs_.type, eh);\n break;\n case detail::type::char_type:\n detail::check_char_specs(specs_, eh);\n break;\n case detail::type::float_type:\n if (detail::const_check(FMT_USE_FLOAT))\n detail::parse_float_type_spec(specs_, eh);\n else\n FMT_ASSERT(false, \"float support disabled\");\n break;\n case detail::type::double_type:\n if (detail::const_check(FMT_USE_DOUBLE))\n detail::parse_float_type_spec(specs_, eh);\n else\n FMT_ASSERT(false, \"double support disabled\");\n break;\n case detail::type::long_double_type:\n if (detail::const_check(FMT_USE_LONG_DOUBLE))\n detail::parse_float_type_spec(specs_, eh);\n else\n FMT_ASSERT(false, \"long double support disabled\");\n break;\n case detail::type::cstring_type:\n detail::check_cstring_type_spec(specs_.type, eh);\n break;\n case detail::type::string_type:\n detail::check_string_type_spec(specs_.type, eh);\n break;\n case detail::type::pointer_type:\n detail::check_pointer_type_spec(specs_.type, eh);\n break;\n case detail::type::custom_type:\n // Custom format specifiers are checked in parse functions of\n // formatter specializations.\n break;\n }\n return it;\n }\n\n template \n FMT_CONSTEXPR auto format(const T& val, FormatContext& ctx) const\n -> decltype(ctx.out());\n};\n\ntemplate struct basic_runtime { basic_string_view str; };\n\ntemplate class basic_format_string {\n private:\n basic_string_view str_;\n\n public:\n template >::value)>\n FMT_CONSTEVAL basic_format_string(const S& s) : str_(s) {\n static_assert(\n detail::count<\n (std::is_base_of>::value &&\n std::is_reference::value)...>() == 0,\n \"passing views as lvalues is disallowed\");\n#ifdef FMT_HAS_CONSTEVAL\n if constexpr (detail::count_named_args() == 0) {\n using checker = detail::format_string_checker...>;\n detail::parse_format_string(str_, checker(s, {}));\n }\n#else\n detail::check_format_string(s);\n#endif\n }\n basic_format_string(basic_runtime r) : str_(r.str) {}\n\n FMT_INLINE operator basic_string_view() const { return str_; }\n};\n\n#if FMT_GCC_VERSION && FMT_GCC_VERSION < 409\n// Workaround broken conversion on older gcc.\ntemplate using format_string = string_view;\ntemplate auto runtime(const S& s) -> basic_string_view> {\n return s;\n}\n#else\ntemplate \nusing format_string = basic_format_string...>;\n// Creates a runtime format string.\ntemplate auto runtime(const S& s) -> basic_runtime> {\n return {{s}};\n}\n#endif\n\nFMT_API auto vformat(string_view fmt, format_args args) -> std::string;\n\n/**\n \\rst\n Formats ``args`` according to specifications in ``fmt`` and returns the result\n as a string.\n\n **Example**::\n\n #include \n std::string message = fmt::format(\"The answer is {}\", 42);\n \\endrst\n*/\ntemplate \nFMT_INLINE auto format(format_string fmt, T&&... args) -> std::string {\n return vformat(fmt, fmt::make_format_args(args...));\n}\n\n/** Formats a string and writes the output to ``out``. */\ntemplate ::value)>\nauto vformat_to(OutputIt out, string_view fmt, format_args args) -> OutputIt {\n using detail::get_buffer;\n auto&& buf = get_buffer(out);\n detail::vformat_to(buf, string_view(fmt), args);\n return detail::get_iterator(buf);\n}\n\n/**\n \\rst\n Formats ``args`` according to specifications in ``fmt``, writes the result to\n the output iterator ``out`` and returns the iterator past the end of the output\n range.\n\n **Example**::\n\n auto out = std::vector();\n fmt::format_to(std::back_inserter(out), \"{}\", 42);\n \\endrst\n */\ntemplate ::value)>\nFMT_INLINE auto format_to(OutputIt out, format_string fmt, T&&... args)\n -> OutputIt {\n return vformat_to(out, fmt, fmt::make_format_args(args...));\n}\n\ntemplate struct format_to_n_result {\n /** Iterator past the end of the output range. */\n OutputIt out;\n /** Total (not truncated) output size. */\n size_t size;\n};\n\ntemplate ::value)>\nauto vformat_to_n(OutputIt out, size_t n, string_view fmt, format_args args)\n -> format_to_n_result {\n using buffer =\n detail::iterator_buffer;\n auto buf = buffer(out, n);\n detail::vformat_to(buf, fmt, args);\n return {buf.out(), buf.count()};\n}\n\n/**\n \\rst\n Formats ``args`` according to specifications in ``fmt``, writes up to ``n``\n characters of the result to the output iterator ``out`` and returns the total\n (not truncated) output size and the iterator past the end of the output range.\n \\endrst\n */\ntemplate ::value)>\nFMT_INLINE auto format_to_n(OutputIt out, size_t n, format_string fmt,\n const T&... args) -> format_to_n_result {\n return vformat_to_n(out, n, fmt, fmt::make_format_args(args...));\n}\n\n/** Returns the number of chars in the output of ``format(fmt, args...)``. */\ntemplate \nFMT_INLINE auto formatted_size(format_string fmt, T&&... args) -> size_t {\n auto buf = detail::counting_buffer<>();\n detail::vformat_to(buf, string_view(fmt), fmt::make_format_args(args...));\n return buf.count();\n}\n\nFMT_API void vprint(string_view fmt, format_args args);\nFMT_API void vprint(std::FILE* f, string_view fmt, format_args args);\n\n/**\n \\rst\n Formats ``args`` according to specifications in ``fmt`` and writes the output\n to ``stdout``.\n\n **Example**::\n\n fmt::print(\"Elapsed time: {0:.2f} seconds\", 1.23);\n \\endrst\n */\ntemplate \nFMT_INLINE void print(format_string fmt, T&&... args) {\n const auto& vargs = fmt::make_format_args(args...);\n return detail::is_utf8() ? vprint(fmt, vargs)\n : detail::vprint_mojibake(stdout, fmt, vargs);\n}\n\n/**\n \\rst\n Formats ``args`` according to specifications in ``fmt`` and writes the\n output to the file ``f``.\n\n **Example**::\n\n fmt::print(stderr, \"Don't {}!\", \"panic\");\n \\endrst\n */\ntemplate \nFMT_INLINE void print(std::FILE* f, format_string fmt, T&&... args) {\n const auto& vargs = fmt::make_format_args(args...);\n return detail::is_utf8() ? vprint(f, fmt, vargs)\n : detail::vprint_mojibake(f, fmt, vargs);\n}\n\nFMT_MODULE_EXPORT_END\nFMT_GCC_PRAGMA(\"GCC pop_options\")\nFMT_END_NAMESPACE\n\n#ifdef FMT_HEADER_ONLY\n# include \"format.h\"\n#endif\n#endif // FMT_CORE_H_\n" }, { "path": "vendor/spdlog/include/spdlog/fmt/bundled/format-inl.h", "content": "// Formatting library for C++ - implementation\n//\n// Copyright (c) 2012 - 2016, Victor Zverovich\n// All rights reserved.\n//\n// For the license information refer to format.h.\n\n#ifndef FMT_FORMAT_INL_H_\n#define FMT_FORMAT_INL_H_\n\n#include \n#include \n#include // errno\n#include \n#include \n#include \n#include // std::memmove\n#include \n#include \n\n#ifndef FMT_STATIC_THOUSANDS_SEPARATOR\n# include \n#endif\n\n#ifdef _WIN32\n# include // _isatty\n#endif\n\n#include \"format.h\"\n\nFMT_BEGIN_NAMESPACE\nnamespace detail {\n\nFMT_FUNC void assert_fail(const char* file, int line, const char* message) {\n // Use unchecked std::fprintf to avoid triggering another assertion when\n // writing to stderr fails\n std::fprintf(stderr, \"%s:%d: assertion failed: %s\", file, line, message);\n // Chosen instead of std::abort to satisfy Clang in CUDA mode during device\n // code pass.\n std::terminate();\n}\n\n#ifndef _MSC_VER\n# define FMT_SNPRINTF snprintf\n#else // _MSC_VER\ninline int fmt_snprintf(char* buffer, size_t size, const char* format, ...) {\n va_list args;\n va_start(args, format);\n int result = vsnprintf_s(buffer, size, _TRUNCATE, format, args);\n va_end(args);\n return result;\n}\n# define FMT_SNPRINTF fmt_snprintf\n#endif // _MSC_VER\n\nFMT_FUNC void format_error_code(detail::buffer& out, int error_code,\n string_view message) FMT_NOEXCEPT {\n // Report error code making sure that the output fits into\n // inline_buffer_size to avoid dynamic memory allocation and potential\n // bad_alloc.\n out.try_resize(0);\n static const char SEP[] = \": \";\n static const char ERROR_STR[] = \"error \";\n // Subtract 2 to account for terminating null characters in SEP and ERROR_STR.\n size_t error_code_size = sizeof(SEP) + sizeof(ERROR_STR) - 2;\n auto abs_value = static_cast>(error_code);\n if (detail::is_negative(error_code)) {\n abs_value = 0 - abs_value;\n ++error_code_size;\n }\n error_code_size += detail::to_unsigned(detail::count_digits(abs_value));\n auto it = buffer_appender(out);\n if (message.size() <= inline_buffer_size - error_code_size)\n format_to(it, FMT_STRING(\"{}{}\"), message, SEP);\n format_to(it, FMT_STRING(\"{}{}\"), ERROR_STR, error_code);\n FMT_ASSERT(out.size() <= inline_buffer_size, \"\");\n}\n\nFMT_FUNC void report_error(format_func func, int error_code,\n const char* message) FMT_NOEXCEPT {\n memory_buffer full_message;\n func(full_message, error_code, message);\n // Don't use fwrite_fully because the latter may throw.\n if (std::fwrite(full_message.data(), full_message.size(), 1, stderr) > 0)\n std::fputc('\\n', stderr);\n}\n\n// A wrapper around fwrite that throws on error.\ninline void fwrite_fully(const void* ptr, size_t size, size_t count,\n FILE* stream) {\n size_t written = std::fwrite(ptr, size, count, stream);\n if (written < count) FMT_THROW(system_error(errno, \"cannot write to file\"));\n}\n\n#ifndef FMT_STATIC_THOUSANDS_SEPARATOR\ntemplate \nlocale_ref::locale_ref(const Locale& loc) : locale_(&loc) {\n static_assert(std::is_same::value, \"\");\n}\n\ntemplate Locale locale_ref::get() const {\n static_assert(std::is_same::value, \"\");\n return locale_ ? *static_cast(locale_) : std::locale();\n}\n\ntemplate \nFMT_FUNC auto thousands_sep_impl(locale_ref loc) -> thousands_sep_result {\n auto& facet = std::use_facet>(loc.get());\n auto grouping = facet.grouping();\n auto thousands_sep = grouping.empty() ? Char() : facet.thousands_sep();\n return {std::move(grouping), thousands_sep};\n}\ntemplate FMT_FUNC Char decimal_point_impl(locale_ref loc) {\n return std::use_facet>(loc.get())\n .decimal_point();\n}\n#else\ntemplate \nFMT_FUNC auto thousands_sep_impl(locale_ref) -> thousands_sep_result {\n return {\"\\03\", FMT_STATIC_THOUSANDS_SEPARATOR};\n}\ntemplate FMT_FUNC Char decimal_point_impl(locale_ref) {\n return '.';\n}\n#endif\n} // namespace detail\n\n#if !FMT_MSC_VER\nFMT_API FMT_FUNC format_error::~format_error() FMT_NOEXCEPT = default;\n#endif\n\nFMT_FUNC std::system_error vsystem_error(int error_code, string_view format_str,\n format_args args) {\n auto ec = std::error_code(error_code, std::generic_category());\n return std::system_error(ec, vformat(format_str, args));\n}\n\nnamespace detail {\n\ntemplate <> FMT_FUNC int count_digits<4>(detail::fallback_uintptr n) {\n // fallback_uintptr is always stored in little endian.\n int i = static_cast(sizeof(void*)) - 1;\n while (i > 0 && n.value[i] == 0) --i;\n auto char_digits = std::numeric_limits::digits / 4;\n return i >= 0 ? i * char_digits + count_digits<4, unsigned>(n.value[i]) : 1;\n}\n\n#if __cplusplus < 201703L\ntemplate constexpr const char basic_data::digits[][2];\ntemplate constexpr const char basic_data::hex_digits[];\ntemplate constexpr const char basic_data::signs[];\ntemplate constexpr const unsigned basic_data::prefixes[];\ntemplate constexpr const char basic_data::left_padding_shifts[];\ntemplate \nconstexpr const char basic_data::right_padding_shifts[];\n#endif\n\ntemplate struct bits {\n static FMT_CONSTEXPR_DECL const int value =\n static_cast(sizeof(T) * std::numeric_limits::digits);\n};\n\nclass fp;\ntemplate fp normalize(fp value);\n\n// Lower (upper) boundary is a value half way between a floating-point value\n// and its predecessor (successor). Boundaries have the same exponent as the\n// value so only significands are stored.\nstruct boundaries {\n uint64_t lower;\n uint64_t upper;\n};\n\n// A handmade floating-point number f * pow(2, e).\nclass fp {\n private:\n using significand_type = uint64_t;\n\n template \n using is_supported_float = bool_constant;\n\n public:\n significand_type f;\n int e;\n\n // All sizes are in bits.\n // Subtract 1 to account for an implicit most significant bit in the\n // normalized form.\n static FMT_CONSTEXPR_DECL const int double_significand_size =\n std::numeric_limits::digits - 1;\n static FMT_CONSTEXPR_DECL const uint64_t implicit_bit =\n 1ULL << double_significand_size;\n static FMT_CONSTEXPR_DECL const int significand_size =\n bits::value;\n\n fp() : f(0), e(0) {}\n fp(uint64_t f_val, int e_val) : f(f_val), e(e_val) {}\n\n // Constructs fp from an IEEE754 double. It is a template to prevent compile\n // errors on platforms where double is not IEEE754.\n template explicit fp(Double d) { assign(d); }\n\n // Assigns d to this and return true iff predecessor is closer than successor.\n template ::value)>\n bool assign(Float d) {\n // Assume float is in the format [sign][exponent][significand].\n using limits = std::numeric_limits;\n const int float_significand_size = limits::digits - 1;\n const int exponent_size =\n bits::value - float_significand_size - 1; // -1 for sign\n const uint64_t float_implicit_bit = 1ULL << float_significand_size;\n const uint64_t significand_mask = float_implicit_bit - 1;\n const uint64_t exponent_mask = (~0ULL >> 1) & ~significand_mask;\n const int exponent_bias = (1 << exponent_size) - limits::max_exponent - 1;\n constexpr bool is_double = sizeof(Float) == sizeof(uint64_t);\n auto u = bit_cast>(d);\n f = u & significand_mask;\n int biased_e =\n static_cast((u & exponent_mask) >> float_significand_size);\n // Predecessor is closer if d is a normalized power of 2 (f == 0) other than\n // the smallest normalized number (biased_e > 1).\n bool is_predecessor_closer = f == 0 && biased_e > 1;\n if (biased_e != 0)\n f += float_implicit_bit;\n else\n biased_e = 1; // Subnormals use biased exponent 1 (min exponent).\n e = biased_e - exponent_bias - float_significand_size;\n return is_predecessor_closer;\n }\n\n template ::value)>\n bool assign(Float) {\n *this = fp();\n return false;\n }\n};\n\n// Normalizes the value converted from double and multiplied by (1 << SHIFT).\ntemplate fp normalize(fp value) {\n // Handle subnormals.\n const auto shifted_implicit_bit = fp::implicit_bit << SHIFT;\n while ((value.f & shifted_implicit_bit) == 0) {\n value.f <<= 1;\n --value.e;\n }\n // Subtract 1 to account for hidden bit.\n const auto offset =\n fp::significand_size - fp::double_significand_size - SHIFT - 1;\n value.f <<= offset;\n value.e -= offset;\n return value;\n}\n\ninline bool operator==(fp x, fp y) { return x.f == y.f && x.e == y.e; }\n\n// Computes lhs * rhs / pow(2, 64) rounded to nearest with half-up tie breaking.\ninline uint64_t multiply(uint64_t lhs, uint64_t rhs) {\n#if FMT_USE_INT128\n auto product = static_cast<__uint128_t>(lhs) * rhs;\n auto f = static_cast(product >> 64);\n return (static_cast(product) & (1ULL << 63)) != 0 ? f + 1 : f;\n#else\n // Multiply 32-bit parts of significands.\n uint64_t mask = (1ULL << 32) - 1;\n uint64_t a = lhs >> 32, b = lhs & mask;\n uint64_t c = rhs >> 32, d = rhs & mask;\n uint64_t ac = a * c, bc = b * c, ad = a * d, bd = b * d;\n // Compute mid 64-bit of result and round.\n uint64_t mid = (bd >> 32) + (ad & mask) + (bc & mask) + (1U << 31);\n return ac + (ad >> 32) + (bc >> 32) + (mid >> 32);\n#endif\n}\n\ninline fp operator*(fp x, fp y) { return {multiply(x.f, y.f), x.e + y.e + 64}; }\n\n// Returns a cached power of 10 `c_k = c_k.f * pow(2, c_k.e)` such that its\n// (binary) exponent satisfies `min_exponent <= c_k.e <= min_exponent + 28`.\ninline fp get_cached_power(int min_exponent, int& pow10_exponent) {\n // Normalized 64-bit significands of pow(10, k), for k = -348, -340, ..., 340.\n // These are generated by support/compute-powers.py.\n static constexpr const uint64_t pow10_significands[] = {\n 0xfa8fd5a0081c0288, 0xbaaee17fa23ebf76, 0x8b16fb203055ac76,\n 0xcf42894a5dce35ea, 0x9a6bb0aa55653b2d, 0xe61acf033d1a45df,\n 0xab70fe17c79ac6ca, 0xff77b1fcbebcdc4f, 0xbe5691ef416bd60c,\n 0x8dd01fad907ffc3c, 0xd3515c2831559a83, 0x9d71ac8fada6c9b5,\n 0xea9c227723ee8bcb, 0xaecc49914078536d, 0x823c12795db6ce57,\n 0xc21094364dfb5637, 0x9096ea6f3848984f, 0xd77485cb25823ac7,\n 0xa086cfcd97bf97f4, 0xef340a98172aace5, 0xb23867fb2a35b28e,\n 0x84c8d4dfd2c63f3b, 0xc5dd44271ad3cdba, 0x936b9fcebb25c996,\n 0xdbac6c247d62a584, 0xa3ab66580d5fdaf6, 0xf3e2f893dec3f126,\n 0xb5b5ada8aaff80b8, 0x87625f056c7c4a8b, 0xc9bcff6034c13053,\n 0x964e858c91ba2655, 0xdff9772470297ebd, 0xa6dfbd9fb8e5b88f,\n 0xf8a95fcf88747d94, 0xb94470938fa89bcf, 0x8a08f0f8bf0f156b,\n 0xcdb02555653131b6, 0x993fe2c6d07b7fac, 0xe45c10c42a2b3b06,\n 0xaa242499697392d3, 0xfd87b5f28300ca0e, 0xbce5086492111aeb,\n 0x8cbccc096f5088cc, 0xd1b71758e219652c, 0x9c40000000000000,\n 0xe8d4a51000000000, 0xad78ebc5ac620000, 0x813f3978f8940984,\n 0xc097ce7bc90715b3, 0x8f7e32ce7bea5c70, 0xd5d238a4abe98068,\n 0x9f4f2726179a2245, 0xed63a231d4c4fb27, 0xb0de65388cc8ada8,\n 0x83c7088e1aab65db, 0xc45d1df942711d9a, 0x924d692ca61be758,\n 0xda01ee641a708dea, 0xa26da3999aef774a, 0xf209787bb47d6b85,\n 0xb454e4a179dd1877, 0x865b86925b9bc5c2, 0xc83553c5c8965d3d,\n 0x952ab45cfa97a0b3, 0xde469fbd99a05fe3, 0xa59bc234db398c25,\n 0xf6c69a72a3989f5c, 0xb7dcbf5354e9bece, 0x88fcf317f22241e2,\n 0xcc20ce9bd35c78a5, 0x98165af37b2153df, 0xe2a0b5dc971f303a,\n 0xa8d9d1535ce3b396, 0xfb9b7cd9a4a7443c, 0xbb764c4ca7a44410,\n 0x8bab8eefb6409c1a, 0xd01fef10a657842c, 0x9b10a4e5e9913129,\n 0xe7109bfba19c0c9d, 0xac2820d9623bf429, 0x80444b5e7aa7cf85,\n 0xbf21e44003acdd2d, 0x8e679c2f5e44ff8f, 0xd433179d9c8cb841,\n 0x9e19db92b4e31ba9, 0xeb96bf6ebadf77d9, 0xaf87023b9bf0ee6b,\n };\n\n // Binary exponents of pow(10, k), for k = -348, -340, ..., 340, corresponding\n // to significands above.\n static constexpr const int16_t pow10_exponents[] = {\n -1220, -1193, -1166, -1140, -1113, -1087, -1060, -1034, -1007, -980, -954,\n -927, -901, -874, -847, -821, -794, -768, -741, -715, -688, -661,\n -635, -608, -582, -555, -529, -502, -475, -449, -422, -396, -369,\n -343, -316, -289, -263, -236, -210, -183, -157, -130, -103, -77,\n -50, -24, 3, 30, 56, 83, 109, 136, 162, 189, 216,\n 242, 269, 295, 322, 348, 375, 402, 428, 455, 481, 508,\n 534, 561, 588, 614, 641, 667, 694, 720, 747, 774, 800,\n 827, 853, 880, 907, 933, 960, 986, 1013, 1039, 1066};\n\n const int shift = 32;\n const auto significand = static_cast(data::log10_2_significand);\n int index = static_cast(\n ((min_exponent + fp::significand_size - 1) * (significand >> shift) +\n ((int64_t(1) << shift) - 1)) // ceil\n >> 32 // arithmetic shift\n );\n // Decimal exponent of the first (smallest) cached power of 10.\n const int first_dec_exp = -348;\n // Difference between 2 consecutive decimal exponents in cached powers of 10.\n const int dec_exp_step = 8;\n index = (index - first_dec_exp - 1) / dec_exp_step + 1;\n pow10_exponent = first_dec_exp + index * dec_exp_step;\n return {pow10_significands[index], pow10_exponents[index]};\n}\n\n// A simple accumulator to hold the sums of terms in bigint::square if uint128_t\n// is not available.\nstruct accumulator {\n uint64_t lower;\n uint64_t upper;\n\n accumulator() : lower(0), upper(0) {}\n explicit operator uint32_t() const { return static_cast(lower); }\n\n void operator+=(uint64_t n) {\n lower += n;\n if (lower < n) ++upper;\n }\n void operator>>=(int shift) {\n FMT_ASSERT(shift == 32, \"\");\n (void)shift;\n lower = (upper << 32) | (lower >> 32);\n upper >>= 32;\n }\n};\n\nclass bigint {\n private:\n // A bigint is stored as an array of bigits (big digits), with bigit at index\n // 0 being the least significant one.\n using bigit = uint32_t;\n using double_bigit = uint64_t;\n enum { bigits_capacity = 32 };\n basic_memory_buffer bigits_;\n int exp_;\n\n bigit operator[](int index) const { return bigits_[to_unsigned(index)]; }\n bigit& operator[](int index) { return bigits_[to_unsigned(index)]; }\n\n static FMT_CONSTEXPR_DECL const int bigit_bits = bits::value;\n\n friend struct formatter;\n\n void subtract_bigits(int index, bigit other, bigit& borrow) {\n auto result = static_cast((*this)[index]) - other - borrow;\n (*this)[index] = static_cast(result);\n borrow = static_cast(result >> (bigit_bits * 2 - 1));\n }\n\n void remove_leading_zeros() {\n int num_bigits = static_cast(bigits_.size()) - 1;\n while (num_bigits > 0 && (*this)[num_bigits] == 0) --num_bigits;\n bigits_.resize(to_unsigned(num_bigits + 1));\n }\n\n // Computes *this -= other assuming aligned bigints and *this >= other.\n void subtract_aligned(const bigint& other) {\n FMT_ASSERT(other.exp_ >= exp_, \"unaligned bigints\");\n FMT_ASSERT(compare(*this, other) >= 0, \"\");\n bigit borrow = 0;\n int i = other.exp_ - exp_;\n for (size_t j = 0, n = other.bigits_.size(); j != n; ++i, ++j)\n subtract_bigits(i, other.bigits_[j], borrow);\n while (borrow > 0) subtract_bigits(i, 0, borrow);\n remove_leading_zeros();\n }\n\n void multiply(uint32_t value) {\n const double_bigit wide_value = value;\n bigit carry = 0;\n for (size_t i = 0, n = bigits_.size(); i < n; ++i) {\n double_bigit result = bigits_[i] * wide_value + carry;\n bigits_[i] = static_cast(result);\n carry = static_cast(result >> bigit_bits);\n }\n if (carry != 0) bigits_.push_back(carry);\n }\n\n void multiply(uint64_t value) {\n const bigit mask = ~bigit(0);\n const double_bigit lower = value & mask;\n const double_bigit upper = value >> bigit_bits;\n double_bigit carry = 0;\n for (size_t i = 0, n = bigits_.size(); i < n; ++i) {\n double_bigit result = bigits_[i] * lower + (carry & mask);\n carry =\n bigits_[i] * upper + (result >> bigit_bits) + (carry >> bigit_bits);\n bigits_[i] = static_cast(result);\n }\n while (carry != 0) {\n bigits_.push_back(carry & mask);\n carry >>= bigit_bits;\n }\n }\n\n public:\n bigint() : exp_(0) {}\n explicit bigint(uint64_t n) { assign(n); }\n ~bigint() { FMT_ASSERT(bigits_.capacity() <= bigits_capacity, \"\"); }\n\n bigint(const bigint&) = delete;\n void operator=(const bigint&) = delete;\n\n void assign(const bigint& other) {\n auto size = other.bigits_.size();\n bigits_.resize(size);\n auto data = other.bigits_.data();\n std::copy(data, data + size, make_checked(bigits_.data(), size));\n exp_ = other.exp_;\n }\n\n void assign(uint64_t n) {\n size_t num_bigits = 0;\n do {\n bigits_[num_bigits++] = n & ~bigit(0);\n n >>= bigit_bits;\n } while (n != 0);\n bigits_.resize(num_bigits);\n exp_ = 0;\n }\n\n int num_bigits() const { return static_cast(bigits_.size()) + exp_; }\n\n FMT_NOINLINE bigint& operator<<=(int shift) {\n FMT_ASSERT(shift >= 0, \"\");\n exp_ += shift / bigit_bits;\n shift %= bigit_bits;\n if (shift == 0) return *this;\n bigit carry = 0;\n for (size_t i = 0, n = bigits_.size(); i < n; ++i) {\n bigit c = bigits_[i] >> (bigit_bits - shift);\n bigits_[i] = (bigits_[i] << shift) + carry;\n carry = c;\n }\n if (carry != 0) bigits_.push_back(carry);\n return *this;\n }\n\n template bigint& operator*=(Int value) {\n FMT_ASSERT(value > 0, \"\");\n multiply(uint32_or_64_or_128_t(value));\n return *this;\n }\n\n friend int compare(const bigint& lhs, const bigint& rhs) {\n int num_lhs_bigits = lhs.num_bigits(), num_rhs_bigits = rhs.num_bigits();\n if (num_lhs_bigits != num_rhs_bigits)\n return num_lhs_bigits > num_rhs_bigits ? 1 : -1;\n int i = static_cast(lhs.bigits_.size()) - 1;\n int j = static_cast(rhs.bigits_.size()) - 1;\n int end = i - j;\n if (end < 0) end = 0;\n for (; i >= end; --i, --j) {\n bigit lhs_bigit = lhs[i], rhs_bigit = rhs[j];\n if (lhs_bigit != rhs_bigit) return lhs_bigit > rhs_bigit ? 1 : -1;\n }\n if (i != j) return i > j ? 1 : -1;\n return 0;\n }\n\n // Returns compare(lhs1 + lhs2, rhs).\n friend int add_compare(const bigint& lhs1, const bigint& lhs2,\n const bigint& rhs) {\n int max_lhs_bigits = (std::max)(lhs1.num_bigits(), lhs2.num_bigits());\n int num_rhs_bigits = rhs.num_bigits();\n if (max_lhs_bigits + 1 < num_rhs_bigits) return -1;\n if (max_lhs_bigits > num_rhs_bigits) return 1;\n auto get_bigit = [](const bigint& n, int i) -> bigit {\n return i >= n.exp_ && i < n.num_bigits() ? n[i - n.exp_] : 0;\n };\n double_bigit borrow = 0;\n int min_exp = (std::min)((std::min)(lhs1.exp_, lhs2.exp_), rhs.exp_);\n for (int i = num_rhs_bigits - 1; i >= min_exp; --i) {\n double_bigit sum =\n static_cast(get_bigit(lhs1, i)) + get_bigit(lhs2, i);\n bigit rhs_bigit = get_bigit(rhs, i);\n if (sum > rhs_bigit + borrow) return 1;\n borrow = rhs_bigit + borrow - sum;\n if (borrow > 1) return -1;\n borrow <<= bigit_bits;\n }\n return borrow != 0 ? -1 : 0;\n }\n\n // Assigns pow(10, exp) to this bigint.\n void assign_pow10(int exp) {\n FMT_ASSERT(exp >= 0, \"\");\n if (exp == 0) return assign(1);\n // Find the top bit.\n int bitmask = 1;\n while (exp >= bitmask) bitmask <<= 1;\n bitmask >>= 1;\n // pow(10, exp) = pow(5, exp) * pow(2, exp). First compute pow(5, exp) by\n // repeated squaring and multiplication.\n assign(5);\n bitmask >>= 1;\n while (bitmask != 0) {\n square();\n if ((exp & bitmask) != 0) *this *= 5;\n bitmask >>= 1;\n }\n *this <<= exp; // Multiply by pow(2, exp) by shifting.\n }\n\n void square() {\n int num_bigits = static_cast(bigits_.size());\n int num_result_bigits = 2 * num_bigits;\n basic_memory_buffer n(std::move(bigits_));\n bigits_.resize(to_unsigned(num_result_bigits));\n using accumulator_t = conditional_t;\n auto sum = accumulator_t();\n for (int bigit_index = 0; bigit_index < num_bigits; ++bigit_index) {\n // Compute bigit at position bigit_index of the result by adding\n // cross-product terms n[i] * n[j] such that i + j == bigit_index.\n for (int i = 0, j = bigit_index; j >= 0; ++i, --j) {\n // Most terms are multiplied twice which can be optimized in the future.\n sum += static_cast(n[i]) * n[j];\n }\n (*this)[bigit_index] = static_cast(sum);\n sum >>= bits::value; // Compute the carry.\n }\n // Do the same for the top half.\n for (int bigit_index = num_bigits; bigit_index < num_result_bigits;\n ++bigit_index) {\n for (int j = num_bigits - 1, i = bigit_index - j; i < num_bigits;)\n sum += static_cast(n[i++]) * n[j--];\n (*this)[bigit_index] = static_cast(sum);\n sum >>= bits::value;\n }\n --num_result_bigits;\n remove_leading_zeros();\n exp_ *= 2;\n }\n\n // If this bigint has a bigger exponent than other, adds trailing zero to make\n // exponents equal. This simplifies some operations such as subtraction.\n void align(const bigint& other) {\n int exp_difference = exp_ - other.exp_;\n if (exp_difference <= 0) return;\n int num_bigits = static_cast(bigits_.size());\n bigits_.resize(to_unsigned(num_bigits + exp_difference));\n for (int i = num_bigits - 1, j = i + exp_difference; i >= 0; --i, --j)\n bigits_[j] = bigits_[i];\n std::uninitialized_fill_n(bigits_.data(), exp_difference, 0);\n exp_ -= exp_difference;\n }\n\n // Divides this bignum by divisor, assigning the remainder to this and\n // returning the quotient.\n int divmod_assign(const bigint& divisor) {\n FMT_ASSERT(this != &divisor, \"\");\n if (compare(*this, divisor) < 0) return 0;\n FMT_ASSERT(divisor.bigits_[divisor.bigits_.size() - 1u] != 0, \"\");\n align(divisor);\n int quotient = 0;\n do {\n subtract_aligned(divisor);\n ++quotient;\n } while (compare(*this, divisor) >= 0);\n return quotient;\n }\n};\n\nenum class round_direction { unknown, up, down };\n\n// Given the divisor (normally a power of 10), the remainder = v % divisor for\n// some number v and the error, returns whether v should be rounded up, down, or\n// whether the rounding direction can't be determined due to error.\n// error should be less than divisor / 2.\ninline round_direction get_round_direction(uint64_t divisor, uint64_t remainder,\n uint64_t error) {\n FMT_ASSERT(remainder < divisor, \"\"); // divisor - remainder won't overflow.\n FMT_ASSERT(error < divisor, \"\"); // divisor - error won't overflow.\n FMT_ASSERT(error < divisor - error, \"\"); // error * 2 won't overflow.\n // Round down if (remainder + error) * 2 <= divisor.\n if (remainder <= divisor - remainder && error * 2 <= divisor - remainder * 2)\n return round_direction::down;\n // Round up if (remainder - error) * 2 >= divisor.\n if (remainder >= error &&\n remainder - error >= divisor - (remainder - error)) {\n return round_direction::up;\n }\n return round_direction::unknown;\n}\n\nnamespace digits {\nenum result {\n more, // Generate more digits.\n done, // Done generating digits.\n error // Digit generation cancelled due to an error.\n};\n}\n\ninline uint64_t power_of_10_64(int exp) {\n static constexpr const uint64_t data[] = {1, FMT_POWERS_OF_10(1),\n FMT_POWERS_OF_10(1000000000ULL),\n 10000000000000000000ULL};\n return data[exp];\n}\n\n// Generates output using the Grisu digit-gen algorithm.\n// error: the size of the region (lower, upper) outside of which numbers\n// definitely do not round to value (Delta in Grisu3).\ntemplate \nFMT_INLINE digits::result grisu_gen_digits(fp value, uint64_t error, int& exp,\n Handler& handler) {\n const fp one(1ULL << -value.e, value.e);\n // The integral part of scaled value (p1 in Grisu) = value / one. It cannot be\n // zero because it contains a product of two 64-bit numbers with MSB set (due\n // to normalization) - 1, shifted right by at most 60 bits.\n auto integral = static_cast(value.f >> -one.e);\n FMT_ASSERT(integral != 0, \"\");\n FMT_ASSERT(integral == value.f >> -one.e, \"\");\n // The fractional part of scaled value (p2 in Grisu) c = value % one.\n uint64_t fractional = value.f & (one.f - 1);\n exp = count_digits(integral); // kappa in Grisu.\n // Divide by 10 to prevent overflow.\n auto result = handler.on_start(power_of_10_64(exp - 1) << -one.e,\n value.f / 10, error * 10, exp);\n if (result != digits::more) return result;\n // Generate digits for the integral part. This can produce up to 10 digits.\n do {\n uint32_t digit = 0;\n auto divmod_integral = [&](uint32_t divisor) {\n digit = integral / divisor;\n integral %= divisor;\n };\n // This optimization by Milo Yip reduces the number of integer divisions by\n // one per iteration.\n switch (exp) {\n case 10:\n divmod_integral(1000000000);\n break;\n case 9:\n divmod_integral(100000000);\n break;\n case 8:\n divmod_integral(10000000);\n break;\n case 7:\n divmod_integral(1000000);\n break;\n case 6:\n divmod_integral(100000);\n break;\n case 5:\n divmod_integral(10000);\n break;\n case 4:\n divmod_integral(1000);\n break;\n case 3:\n divmod_integral(100);\n break;\n case 2:\n divmod_integral(10);\n break;\n case 1:\n digit = integral;\n integral = 0;\n break;\n default:\n FMT_ASSERT(false, \"invalid number of digits\");\n }\n --exp;\n auto remainder = (static_cast(integral) << -one.e) + fractional;\n result = handler.on_digit(static_cast('0' + digit),\n power_of_10_64(exp) << -one.e, remainder, error,\n exp, true);\n if (result != digits::more) return result;\n } while (exp > 0);\n // Generate digits for the fractional part.\n for (;;) {\n fractional *= 10;\n error *= 10;\n char digit = static_cast('0' + (fractional >> -one.e));\n fractional &= one.f - 1;\n --exp;\n result = handler.on_digit(digit, one.f, fractional, error, exp, false);\n if (result != digits::more) return result;\n }\n}\n\n// The fixed precision digit handler.\nstruct fixed_handler {\n char* buf;\n int size;\n int precision;\n int exp10;\n bool fixed;\n\n digits::result on_start(uint64_t divisor, uint64_t remainder, uint64_t error,\n int& exp) {\n // Non-fixed formats require at least one digit and no precision adjustment.\n if (!fixed) return digits::more;\n // Adjust fixed precision by exponent because it is relative to decimal\n // point.\n precision += exp + exp10;\n // Check if precision is satisfied just by leading zeros, e.g.\n // format(\"{:.2f}\", 0.001) gives \"0.00\" without generating any digits.\n if (precision > 0) return digits::more;\n if (precision < 0) return digits::done;\n auto dir = get_round_direction(divisor, remainder, error);\n if (dir == round_direction::unknown) return digits::error;\n buf[size++] = dir == round_direction::up ? '1' : '0';\n return digits::done;\n }\n\n digits::result on_digit(char digit, uint64_t divisor, uint64_t remainder,\n uint64_t error, int, bool integral) {\n FMT_ASSERT(remainder < divisor, \"\");\n buf[size++] = digit;\n if (!integral && error >= remainder) return digits::error;\n if (size < precision) return digits::more;\n if (!integral) {\n // Check if error * 2 < divisor with overflow prevention.\n // The check is not needed for the integral part because error = 1\n // and divisor > (1 << 32) there.\n if (error >= divisor || error >= divisor - error) return digits::error;\n } else {\n FMT_ASSERT(error == 1 && divisor > 2, \"\");\n }\n auto dir = get_round_direction(divisor, remainder, error);\n if (dir != round_direction::up)\n return dir == round_direction::down ? digits::done : digits::error;\n ++buf[size - 1];\n for (int i = size - 1; i > 0 && buf[i] > '9'; --i) {\n buf[i] = '0';\n ++buf[i - 1];\n }\n if (buf[0] > '9') {\n buf[0] = '1';\n if (fixed)\n buf[size++] = '0';\n else\n ++exp10;\n }\n return digits::done;\n }\n};\n\n// A 128-bit integer type used internally,\nstruct uint128_wrapper {\n uint128_wrapper() = default;\n\n#if FMT_USE_INT128\n uint128_t internal_;\n\n constexpr uint128_wrapper(uint64_t high, uint64_t low) FMT_NOEXCEPT\n : internal_{static_cast(low) |\n (static_cast(high) << 64)} {}\n\n constexpr uint128_wrapper(uint128_t u) : internal_{u} {}\n\n constexpr uint64_t high() const FMT_NOEXCEPT {\n return uint64_t(internal_ >> 64);\n }\n constexpr uint64_t low() const FMT_NOEXCEPT { return uint64_t(internal_); }\n\n uint128_wrapper& operator+=(uint64_t n) FMT_NOEXCEPT {\n internal_ += n;\n return *this;\n }\n#else\n uint64_t high_;\n uint64_t low_;\n\n constexpr uint128_wrapper(uint64_t high, uint64_t low) FMT_NOEXCEPT\n : high_{high},\n low_{low} {}\n\n constexpr uint64_t high() const FMT_NOEXCEPT { return high_; }\n constexpr uint64_t low() const FMT_NOEXCEPT { return low_; }\n\n uint128_wrapper& operator+=(uint64_t n) FMT_NOEXCEPT {\n# if defined(_MSC_VER) && defined(_M_X64)\n unsigned char carry = _addcarry_u64(0, low_, n, &low_);\n _addcarry_u64(carry, high_, 0, &high_);\n return *this;\n# else\n uint64_t sum = low_ + n;\n high_ += (sum < low_ ? 1 : 0);\n low_ = sum;\n return *this;\n# endif\n }\n#endif\n};\n\n// Implementation of Dragonbox algorithm: https://github.com/jk-jeon/dragonbox.\nnamespace dragonbox {\n// Computes 128-bit result of multiplication of two 64-bit unsigned integers.\ninline uint128_wrapper umul128(uint64_t x, uint64_t y) FMT_NOEXCEPT {\n#if FMT_USE_INT128\n return static_cast(x) * static_cast(y);\n#elif defined(_MSC_VER) && defined(_M_X64)\n uint128_wrapper result;\n result.low_ = _umul128(x, y, &result.high_);\n return result;\n#else\n const uint64_t mask = (uint64_t(1) << 32) - uint64_t(1);\n\n uint64_t a = x >> 32;\n uint64_t b = x & mask;\n uint64_t c = y >> 32;\n uint64_t d = y & mask;\n\n uint64_t ac = a * c;\n uint64_t bc = b * c;\n uint64_t ad = a * d;\n uint64_t bd = b * d;\n\n uint64_t intermediate = (bd >> 32) + (ad & mask) + (bc & mask);\n\n return {ac + (intermediate >> 32) + (ad >> 32) + (bc >> 32),\n (intermediate << 32) + (bd & mask)};\n#endif\n}\n\n// Computes upper 64 bits of multiplication of two 64-bit unsigned integers.\ninline uint64_t umul128_upper64(uint64_t x, uint64_t y) FMT_NOEXCEPT {\n#if FMT_USE_INT128\n auto p = static_cast(x) * static_cast(y);\n return static_cast(p >> 64);\n#elif defined(_MSC_VER) && defined(_M_X64)\n return __umulh(x, y);\n#else\n return umul128(x, y).high();\n#endif\n}\n\n// Computes upper 64 bits of multiplication of a 64-bit unsigned integer and a\n// 128-bit unsigned integer.\ninline uint64_t umul192_upper64(uint64_t x, uint128_wrapper y) FMT_NOEXCEPT {\n uint128_wrapper g0 = umul128(x, y.high());\n g0 += umul128_upper64(x, y.low());\n return g0.high();\n}\n\n// Computes upper 32 bits of multiplication of a 32-bit unsigned integer and a\n// 64-bit unsigned integer.\ninline uint32_t umul96_upper32(uint32_t x, uint64_t y) FMT_NOEXCEPT {\n return static_cast(umul128_upper64(x, y));\n}\n\n// Computes middle 64 bits of multiplication of a 64-bit unsigned integer and a\n// 128-bit unsigned integer.\ninline uint64_t umul192_middle64(uint64_t x, uint128_wrapper y) FMT_NOEXCEPT {\n uint64_t g01 = x * y.high();\n uint64_t g10 = umul128_upper64(x, y.low());\n return g01 + g10;\n}\n\n// Computes lower 64 bits of multiplication of a 32-bit unsigned integer and a\n// 64-bit unsigned integer.\ninline uint64_t umul96_lower64(uint32_t x, uint64_t y) FMT_NOEXCEPT {\n return x * y;\n}\n\n// Computes floor(log10(pow(2, e))) for e in [-1700, 1700] using the method from\n// https://fmt.dev/papers/Grisu-Exact.pdf#page=5, section 3.4.\ninline int floor_log10_pow2(int e) FMT_NOEXCEPT {\n FMT_ASSERT(e <= 1700 && e >= -1700, \"too large exponent\");\n const int shift = 22;\n return (e * static_cast(data::log10_2_significand >> (64 - shift))) >>\n shift;\n}\n\n// Various fast log computations.\ninline int floor_log2_pow10(int e) FMT_NOEXCEPT {\n FMT_ASSERT(e <= 1233 && e >= -1233, \"too large exponent\");\n const uint64_t log2_10_integer_part = 3;\n const uint64_t log2_10_fractional_digits = 0x5269e12f346e2bf9;\n const int shift_amount = 19;\n return (e * static_cast(\n (log2_10_integer_part << shift_amount) |\n (log2_10_fractional_digits >> (64 - shift_amount)))) >>\n shift_amount;\n}\ninline int floor_log10_pow2_minus_log10_4_over_3(int e) FMT_NOEXCEPT {\n FMT_ASSERT(e <= 1700 && e >= -1700, \"too large exponent\");\n const uint64_t log10_4_over_3_fractional_digits = 0x1ffbfc2bbc780375;\n const int shift_amount = 22;\n return (e * static_cast(data::log10_2_significand >>\n (64 - shift_amount)) -\n static_cast(log10_4_over_3_fractional_digits >>\n (64 - shift_amount))) >>\n shift_amount;\n}\n\n// Returns true iff x is divisible by pow(2, exp).\ninline bool divisible_by_power_of_2(uint32_t x, int exp) FMT_NOEXCEPT {\n FMT_ASSERT(exp >= 1, \"\");\n FMT_ASSERT(x != 0, \"\");\n#ifdef FMT_BUILTIN_CTZ\n return FMT_BUILTIN_CTZ(x) >= exp;\n#else\n return exp < num_bits() && x == ((x >> exp) << exp);\n#endif\n}\ninline bool divisible_by_power_of_2(uint64_t x, int exp) FMT_NOEXCEPT {\n FMT_ASSERT(exp >= 1, \"\");\n FMT_ASSERT(x != 0, \"\");\n#ifdef FMT_BUILTIN_CTZLL\n return FMT_BUILTIN_CTZLL(x) >= exp;\n#else\n return exp < num_bits() && x == ((x >> exp) << exp);\n#endif\n}\n\n// Table entry type for divisibility test.\ntemplate struct divtest_table_entry {\n T mod_inv;\n T max_quotient;\n};\n\n// Returns true iff x is divisible by pow(5, exp).\ninline bool divisible_by_power_of_5(uint32_t x, int exp) FMT_NOEXCEPT {\n FMT_ASSERT(exp <= 10, \"too large exponent\");\n static constexpr const divtest_table_entry divtest_table[] = {\n {0x00000001, 0xffffffff}, {0xcccccccd, 0x33333333},\n {0xc28f5c29, 0x0a3d70a3}, {0x26e978d5, 0x020c49ba},\n {0x3afb7e91, 0x0068db8b}, {0x0bcbe61d, 0x0014f8b5},\n {0x68c26139, 0x000431bd}, {0xae8d46a5, 0x0000d6bf},\n {0x22e90e21, 0x00002af3}, {0x3a2e9c6d, 0x00000897},\n {0x3ed61f49, 0x000001b7}};\n return x * divtest_table[exp].mod_inv <= divtest_table[exp].max_quotient;\n}\ninline bool divisible_by_power_of_5(uint64_t x, int exp) FMT_NOEXCEPT {\n FMT_ASSERT(exp <= 23, \"too large exponent\");\n static constexpr const divtest_table_entry divtest_table[] = {\n {0x0000000000000001, 0xffffffffffffffff},\n {0xcccccccccccccccd, 0x3333333333333333},\n {0x8f5c28f5c28f5c29, 0x0a3d70a3d70a3d70},\n {0x1cac083126e978d5, 0x020c49ba5e353f7c},\n {0xd288ce703afb7e91, 0x0068db8bac710cb2},\n {0x5d4e8fb00bcbe61d, 0x0014f8b588e368f0},\n {0x790fb65668c26139, 0x000431bde82d7b63},\n {0xe5032477ae8d46a5, 0x0000d6bf94d5e57a},\n {0xc767074b22e90e21, 0x00002af31dc46118},\n {0x8e47ce423a2e9c6d, 0x0000089705f4136b},\n {0x4fa7f60d3ed61f49, 0x000001b7cdfd9d7b},\n {0x0fee64690c913975, 0x00000057f5ff85e5},\n {0x3662e0e1cf503eb1, 0x000000119799812d},\n {0xa47a2cf9f6433fbd, 0x0000000384b84d09},\n {0x54186f653140a659, 0x00000000b424dc35},\n {0x7738164770402145, 0x0000000024075f3d},\n {0xe4a4d1417cd9a041, 0x000000000734aca5},\n {0xc75429d9e5c5200d, 0x000000000170ef54},\n {0xc1773b91fac10669, 0x000000000049c977},\n {0x26b172506559ce15, 0x00000000000ec1e4},\n {0xd489e3a9addec2d1, 0x000000000002f394},\n {0x90e860bb892c8d5d, 0x000000000000971d},\n {0x502e79bf1b6f4f79, 0x0000000000001e39},\n {0xdcd618596be30fe5, 0x000000000000060b}};\n return x * divtest_table[exp].mod_inv <= divtest_table[exp].max_quotient;\n}\n\n// Replaces n by floor(n / pow(5, N)) returning true if and only if n is\n// divisible by pow(5, N).\n// Precondition: n <= 2 * pow(5, N + 1).\ntemplate \nbool check_divisibility_and_divide_by_pow5(uint32_t& n) FMT_NOEXCEPT {\n static constexpr struct {\n uint32_t magic_number;\n int bits_for_comparison;\n uint32_t threshold;\n int shift_amount;\n } infos[] = {{0xcccd, 16, 0x3333, 18}, {0xa429, 8, 0x0a, 20}};\n constexpr auto info = infos[N - 1];\n n *= info.magic_number;\n const uint32_t comparison_mask = (1u << info.bits_for_comparison) - 1;\n bool result = (n & comparison_mask) <= info.threshold;\n n >>= info.shift_amount;\n return result;\n}\n\n// Computes floor(n / pow(10, N)) for small n and N.\n// Precondition: n <= pow(10, N + 1).\ntemplate uint32_t small_division_by_pow10(uint32_t n) FMT_NOEXCEPT {\n static constexpr struct {\n uint32_t magic_number;\n int shift_amount;\n uint32_t divisor_times_10;\n } infos[] = {{0xcccd, 19, 100}, {0xa3d8, 22, 1000}};\n constexpr auto info = infos[N - 1];\n FMT_ASSERT(n <= info.divisor_times_10, \"n is too large\");\n return n * info.magic_number >> info.shift_amount;\n}\n\n// Computes floor(n / 10^(kappa + 1)) (float)\ninline uint32_t divide_by_10_to_kappa_plus_1(uint32_t n) FMT_NOEXCEPT {\n return n / float_info::big_divisor;\n}\n// Computes floor(n / 10^(kappa + 1)) (double)\ninline uint64_t divide_by_10_to_kappa_plus_1(uint64_t n) FMT_NOEXCEPT {\n return umul128_upper64(n, 0x83126e978d4fdf3c) >> 9;\n}\n\n// Various subroutines using pow10 cache\ntemplate struct cache_accessor;\n\ntemplate <> struct cache_accessor {\n using carrier_uint = float_info::carrier_uint;\n using cache_entry_type = uint64_t;\n\n static uint64_t get_cached_power(int k) FMT_NOEXCEPT {\n FMT_ASSERT(k >= float_info::min_k && k <= float_info::max_k,\n \"k is out of range\");\n constexpr const uint64_t pow10_significands[] = {\n 0x81ceb32c4b43fcf5, 0xa2425ff75e14fc32, 0xcad2f7f5359a3b3f,\n 0xfd87b5f28300ca0e, 0x9e74d1b791e07e49, 0xc612062576589ddb,\n 0xf79687aed3eec552, 0x9abe14cd44753b53, 0xc16d9a0095928a28,\n 0xf1c90080baf72cb2, 0x971da05074da7bef, 0xbce5086492111aeb,\n 0xec1e4a7db69561a6, 0x9392ee8e921d5d08, 0xb877aa3236a4b44a,\n 0xe69594bec44de15c, 0x901d7cf73ab0acda, 0xb424dc35095cd810,\n 0xe12e13424bb40e14, 0x8cbccc096f5088cc, 0xafebff0bcb24aaff,\n 0xdbe6fecebdedd5bf, 0x89705f4136b4a598, 0xabcc77118461cefd,\n 0xd6bf94d5e57a42bd, 0x8637bd05af6c69b6, 0xa7c5ac471b478424,\n 0xd1b71758e219652c, 0x83126e978d4fdf3c, 0xa3d70a3d70a3d70b,\n 0xcccccccccccccccd, 0x8000000000000000, 0xa000000000000000,\n 0xc800000000000000, 0xfa00000000000000, 0x9c40000000000000,\n 0xc350000000000000, 0xf424000000000000, 0x9896800000000000,\n 0xbebc200000000000, 0xee6b280000000000, 0x9502f90000000000,\n 0xba43b74000000000, 0xe8d4a51000000000, 0x9184e72a00000000,\n 0xb5e620f480000000, 0xe35fa931a0000000, 0x8e1bc9bf04000000,\n 0xb1a2bc2ec5000000, 0xde0b6b3a76400000, 0x8ac7230489e80000,\n 0xad78ebc5ac620000, 0xd8d726b7177a8000, 0x878678326eac9000,\n 0xa968163f0a57b400, 0xd3c21bcecceda100, 0x84595161401484a0,\n 0xa56fa5b99019a5c8, 0xcecb8f27f4200f3a, 0x813f3978f8940984,\n 0xa18f07d736b90be5, 0xc9f2c9cd04674ede, 0xfc6f7c4045812296,\n 0x9dc5ada82b70b59d, 0xc5371912364ce305, 0xf684df56c3e01bc6,\n 0x9a130b963a6c115c, 0xc097ce7bc90715b3, 0xf0bdc21abb48db20,\n 0x96769950b50d88f4, 0xbc143fa4e250eb31, 0xeb194f8e1ae525fd,\n 0x92efd1b8d0cf37be, 0xb7abc627050305ad, 0xe596b7b0c643c719,\n 0x8f7e32ce7bea5c6f, 0xb35dbf821ae4f38b, 0xe0352f62a19e306e};\n return pow10_significands[k - float_info::min_k];\n }\n\n static carrier_uint compute_mul(carrier_uint u,\n const cache_entry_type& cache) FMT_NOEXCEPT {\n return umul96_upper32(u, cache);\n }\n\n static uint32_t compute_delta(const cache_entry_type& cache,\n int beta_minus_1) FMT_NOEXCEPT {\n return static_cast(cache >> (64 - 1 - beta_minus_1));\n }\n\n static bool compute_mul_parity(carrier_uint two_f,\n const cache_entry_type& cache,\n int beta_minus_1) FMT_NOEXCEPT {\n FMT_ASSERT(beta_minus_1 >= 1, \"\");\n FMT_ASSERT(beta_minus_1 < 64, \"\");\n\n return ((umul96_lower64(two_f, cache) >> (64 - beta_minus_1)) & 1) != 0;\n }\n\n static carrier_uint compute_left_endpoint_for_shorter_interval_case(\n const cache_entry_type& cache, int beta_minus_1) FMT_NOEXCEPT {\n return static_cast(\n (cache - (cache >> (float_info::significand_bits + 2))) >>\n (64 - float_info::significand_bits - 1 - beta_minus_1));\n }\n\n static carrier_uint compute_right_endpoint_for_shorter_interval_case(\n const cache_entry_type& cache, int beta_minus_1) FMT_NOEXCEPT {\n return static_cast(\n (cache + (cache >> (float_info::significand_bits + 1))) >>\n (64 - float_info::significand_bits - 1 - beta_minus_1));\n }\n\n static carrier_uint compute_round_up_for_shorter_interval_case(\n const cache_entry_type& cache, int beta_minus_1) FMT_NOEXCEPT {\n return (static_cast(\n cache >>\n (64 - float_info::significand_bits - 2 - beta_minus_1)) +\n 1) /\n 2;\n }\n};\n\ntemplate <> struct cache_accessor {\n using carrier_uint = float_info::carrier_uint;\n using cache_entry_type = uint128_wrapper;\n\n static uint128_wrapper get_cached_power(int k) FMT_NOEXCEPT {\n FMT_ASSERT(k >= float_info::min_k && k <= float_info::max_k,\n \"k is out of range\");\n\n static constexpr const uint128_wrapper pow10_significands[] = {\n#if FMT_USE_FULL_CACHE_DRAGONBOX\n {0xff77b1fcbebcdc4f, 0x25e8e89c13bb0f7b},\n {0x9faacf3df73609b1, 0x77b191618c54e9ad},\n {0xc795830d75038c1d, 0xd59df5b9ef6a2418},\n {0xf97ae3d0d2446f25, 0x4b0573286b44ad1e},\n {0x9becce62836ac577, 0x4ee367f9430aec33},\n {0xc2e801fb244576d5, 0x229c41f793cda740},\n {0xf3a20279ed56d48a, 0x6b43527578c11110},\n {0x9845418c345644d6, 0x830a13896b78aaaa},\n {0xbe5691ef416bd60c, 0x23cc986bc656d554},\n {0xedec366b11c6cb8f, 0x2cbfbe86b7ec8aa9},\n {0x94b3a202eb1c3f39, 0x7bf7d71432f3d6aa},\n {0xb9e08a83a5e34f07, 0xdaf5ccd93fb0cc54},\n {0xe858ad248f5c22c9, 0xd1b3400f8f9cff69},\n {0x91376c36d99995be, 0x23100809b9c21fa2},\n {0xb58547448ffffb2d, 0xabd40a0c2832a78b},\n {0xe2e69915b3fff9f9, 0x16c90c8f323f516d},\n {0x8dd01fad907ffc3b, 0xae3da7d97f6792e4},\n {0xb1442798f49ffb4a, 0x99cd11cfdf41779d},\n {0xdd95317f31c7fa1d, 0x40405643d711d584},\n {0x8a7d3eef7f1cfc52, 0x482835ea666b2573},\n {0xad1c8eab5ee43b66, 0xda3243650005eed0},\n {0xd863b256369d4a40, 0x90bed43e40076a83},\n {0x873e4f75e2224e68, 0x5a7744a6e804a292},\n {0xa90de3535aaae202, 0x711515d0a205cb37},\n {0xd3515c2831559a83, 0x0d5a5b44ca873e04},\n {0x8412d9991ed58091, 0xe858790afe9486c3},\n {0xa5178fff668ae0b6, 0x626e974dbe39a873},\n {0xce5d73ff402d98e3, 0xfb0a3d212dc81290},\n {0x80fa687f881c7f8e, 0x7ce66634bc9d0b9a},\n {0xa139029f6a239f72, 0x1c1fffc1ebc44e81},\n {0xc987434744ac874e, 0xa327ffb266b56221},\n {0xfbe9141915d7a922, 0x4bf1ff9f0062baa9},\n {0x9d71ac8fada6c9b5, 0x6f773fc3603db4aa},\n {0xc4ce17b399107c22, 0xcb550fb4384d21d4},\n {0xf6019da07f549b2b, 0x7e2a53a146606a49},\n {0x99c102844f94e0fb, 0x2eda7444cbfc426e},\n {0xc0314325637a1939, 0xfa911155fefb5309},\n {0xf03d93eebc589f88, 0x793555ab7eba27cb},\n {0x96267c7535b763b5, 0x4bc1558b2f3458df},\n {0xbbb01b9283253ca2, 0x9eb1aaedfb016f17},\n {0xea9c227723ee8bcb, 0x465e15a979c1cadd},\n {0x92a1958a7675175f, 0x0bfacd89ec191eca},\n {0xb749faed14125d36, 0xcef980ec671f667c},\n {0xe51c79a85916f484, 0x82b7e12780e7401b},\n {0x8f31cc0937ae58d2, 0xd1b2ecb8b0908811},\n {0xb2fe3f0b8599ef07, 0x861fa7e6dcb4aa16},\n {0xdfbdcece67006ac9, 0x67a791e093e1d49b},\n {0x8bd6a141006042bd, 0xe0c8bb2c5c6d24e1},\n {0xaecc49914078536d, 0x58fae9f773886e19},\n {0xda7f5bf590966848, 0xaf39a475506a899f},\n {0x888f99797a5e012d, 0x6d8406c952429604},\n {0xaab37fd7d8f58178, 0xc8e5087ba6d33b84},\n {0xd5605fcdcf32e1d6, 0xfb1e4a9a90880a65},\n {0x855c3be0a17fcd26, 0x5cf2eea09a550680},\n {0xa6b34ad8c9dfc06f, 0xf42faa48c0ea481f},\n {0xd0601d8efc57b08b, 0xf13b94daf124da27},\n {0x823c12795db6ce57, 0x76c53d08d6b70859},\n {0xa2cb1717b52481ed, 0x54768c4b0c64ca6f},\n {0xcb7ddcdda26da268, 0xa9942f5dcf7dfd0a},\n {0xfe5d54150b090b02, 0xd3f93b35435d7c4d},\n {0x9efa548d26e5a6e1, 0xc47bc5014a1a6db0},\n {0xc6b8e9b0709f109a, 0x359ab6419ca1091c},\n {0xf867241c8cc6d4c0, 0xc30163d203c94b63},\n {0x9b407691d7fc44f8, 0x79e0de63425dcf1e},\n {0xc21094364dfb5636, 0x985915fc12f542e5},\n {0xf294b943e17a2bc4, 0x3e6f5b7b17b2939e},\n {0x979cf3ca6cec5b5a, 0xa705992ceecf9c43},\n {0xbd8430bd08277231, 0x50c6ff782a838354},\n {0xece53cec4a314ebd, 0xa4f8bf5635246429},\n {0x940f4613ae5ed136, 0x871b7795e136be9a},\n {0xb913179899f68584, 0x28e2557b59846e40},\n {0xe757dd7ec07426e5, 0x331aeada2fe589d0},\n {0x9096ea6f3848984f, 0x3ff0d2c85def7622},\n {0xb4bca50b065abe63, 0x0fed077a756b53aa},\n {0xe1ebce4dc7f16dfb, 0xd3e8495912c62895},\n {0x8d3360f09cf6e4bd, 0x64712dd7abbbd95d},\n {0xb080392cc4349dec, 0xbd8d794d96aacfb4},\n {0xdca04777f541c567, 0xecf0d7a0fc5583a1},\n {0x89e42caaf9491b60, 0xf41686c49db57245},\n {0xac5d37d5b79b6239, 0x311c2875c522ced6},\n {0xd77485cb25823ac7, 0x7d633293366b828c},\n {0x86a8d39ef77164bc, 0xae5dff9c02033198},\n {0xa8530886b54dbdeb, 0xd9f57f830283fdfd},\n {0xd267caa862a12d66, 0xd072df63c324fd7c},\n {0x8380dea93da4bc60, 0x4247cb9e59f71e6e},\n {0xa46116538d0deb78, 0x52d9be85f074e609},\n {0xcd795be870516656, 0x67902e276c921f8c},\n {0x806bd9714632dff6, 0x00ba1cd8a3db53b7},\n {0xa086cfcd97bf97f3, 0x80e8a40eccd228a5},\n {0xc8a883c0fdaf7df0, 0x6122cd128006b2ce},\n {0xfad2a4b13d1b5d6c, 0x796b805720085f82},\n {0x9cc3a6eec6311a63, 0xcbe3303674053bb1},\n {0xc3f490aa77bd60fc, 0xbedbfc4411068a9d},\n {0xf4f1b4d515acb93b, 0xee92fb5515482d45},\n {0x991711052d8bf3c5, 0x751bdd152d4d1c4b},\n {0xbf5cd54678eef0b6, 0xd262d45a78a0635e},\n {0xef340a98172aace4, 0x86fb897116c87c35},\n {0x9580869f0e7aac0e, 0xd45d35e6ae3d4da1},\n {0xbae0a846d2195712, 0x8974836059cca10a},\n {0xe998d258869facd7, 0x2bd1a438703fc94c},\n {0x91ff83775423cc06, 0x7b6306a34627ddd0},\n {0xb67f6455292cbf08, 0x1a3bc84c17b1d543},\n {0xe41f3d6a7377eeca, 0x20caba5f1d9e4a94},\n {0x8e938662882af53e, 0x547eb47b7282ee9d},\n {0xb23867fb2a35b28d, 0xe99e619a4f23aa44},\n {0xdec681f9f4c31f31, 0x6405fa00e2ec94d5},\n {0x8b3c113c38f9f37e, 0xde83bc408dd3dd05},\n {0xae0b158b4738705e, 0x9624ab50b148d446},\n {0xd98ddaee19068c76, 0x3badd624dd9b0958},\n {0x87f8a8d4cfa417c9, 0xe54ca5d70a80e5d7},\n {0xa9f6d30a038d1dbc, 0x5e9fcf4ccd211f4d},\n {0xd47487cc8470652b, 0x7647c32000696720},\n {0x84c8d4dfd2c63f3b, 0x29ecd9f40041e074},\n {0xa5fb0a17c777cf09, 0xf468107100525891},\n {0xcf79cc9db955c2cc, 0x7182148d4066eeb5},\n {0x81ac1fe293d599bf, 0xc6f14cd848405531},\n {0xa21727db38cb002f, 0xb8ada00e5a506a7d},\n {0xca9cf1d206fdc03b, 0xa6d90811f0e4851d},\n {0xfd442e4688bd304a, 0x908f4a166d1da664},\n {0x9e4a9cec15763e2e, 0x9a598e4e043287ff},\n {0xc5dd44271ad3cdba, 0x40eff1e1853f29fe},\n {0xf7549530e188c128, 0xd12bee59e68ef47d},\n {0x9a94dd3e8cf578b9, 0x82bb74f8301958cf},\n {0xc13a148e3032d6e7, 0xe36a52363c1faf02},\n {0xf18899b1bc3f8ca1, 0xdc44e6c3cb279ac2},\n {0x96f5600f15a7b7e5, 0x29ab103a5ef8c0ba},\n {0xbcb2b812db11a5de, 0x7415d448f6b6f0e8},\n {0xebdf661791d60f56, 0x111b495b3464ad22},\n {0x936b9fcebb25c995, 0xcab10dd900beec35},\n {0xb84687c269ef3bfb, 0x3d5d514f40eea743},\n {0xe65829b3046b0afa, 0x0cb4a5a3112a5113},\n {0x8ff71a0fe2c2e6dc, 0x47f0e785eaba72ac},\n {0xb3f4e093db73a093, 0x59ed216765690f57},\n {0xe0f218b8d25088b8, 0x306869c13ec3532d},\n {0x8c974f7383725573, 0x1e414218c73a13fc},\n {0xafbd2350644eeacf, 0xe5d1929ef90898fb},\n {0xdbac6c247d62a583, 0xdf45f746b74abf3a},\n {0x894bc396ce5da772, 0x6b8bba8c328eb784},\n {0xab9eb47c81f5114f, 0x066ea92f3f326565},\n {0xd686619ba27255a2, 0xc80a537b0efefebe},\n {0x8613fd0145877585, 0xbd06742ce95f5f37},\n {0xa798fc4196e952e7, 0x2c48113823b73705},\n {0xd17f3b51fca3a7a0, 0xf75a15862ca504c6},\n {0x82ef85133de648c4, 0x9a984d73dbe722fc},\n {0xa3ab66580d5fdaf5, 0xc13e60d0d2e0ebbb},\n {0xcc963fee10b7d1b3, 0x318df905079926a9},\n {0xffbbcfe994e5c61f, 0xfdf17746497f7053},\n {0x9fd561f1fd0f9bd3, 0xfeb6ea8bedefa634},\n {0xc7caba6e7c5382c8, 0xfe64a52ee96b8fc1},\n {0xf9bd690a1b68637b, 0x3dfdce7aa3c673b1},\n {0x9c1661a651213e2d, 0x06bea10ca65c084f},\n {0xc31bfa0fe5698db8, 0x486e494fcff30a63},\n {0xf3e2f893dec3f126, 0x5a89dba3c3efccfb},\n {0x986ddb5c6b3a76b7, 0xf89629465a75e01d},\n {0xbe89523386091465, 0xf6bbb397f1135824},\n {0xee2ba6c0678b597f, 0x746aa07ded582e2d},\n {0x94db483840b717ef, 0xa8c2a44eb4571cdd},\n {0xba121a4650e4ddeb, 0x92f34d62616ce414},\n {0xe896a0d7e51e1566, 0x77b020baf9c81d18},\n {0x915e2486ef32cd60, 0x0ace1474dc1d122f},\n {0xb5b5ada8aaff80b8, 0x0d819992132456bb},\n {0xe3231912d5bf60e6, 0x10e1fff697ed6c6a},\n {0x8df5efabc5979c8f, 0xca8d3ffa1ef463c2},\n {0xb1736b96b6fd83b3, 0xbd308ff8a6b17cb3},\n {0xddd0467c64bce4a0, 0xac7cb3f6d05ddbdf},\n {0x8aa22c0dbef60ee4, 0x6bcdf07a423aa96c},\n {0xad4ab7112eb3929d, 0x86c16c98d2c953c7},\n {0xd89d64d57a607744, 0xe871c7bf077ba8b8},\n {0x87625f056c7c4a8b, 0x11471cd764ad4973},\n {0xa93af6c6c79b5d2d, 0xd598e40d3dd89bd0},\n {0xd389b47879823479, 0x4aff1d108d4ec2c4},\n {0x843610cb4bf160cb, 0xcedf722a585139bb},\n {0xa54394fe1eedb8fe, 0xc2974eb4ee658829},\n {0xce947a3da6a9273e, 0x733d226229feea33},\n {0x811ccc668829b887, 0x0806357d5a3f5260},\n {0xa163ff802a3426a8, 0xca07c2dcb0cf26f8},\n {0xc9bcff6034c13052, 0xfc89b393dd02f0b6},\n {0xfc2c3f3841f17c67, 0xbbac2078d443ace3},\n {0x9d9ba7832936edc0, 0xd54b944b84aa4c0e},\n {0xc5029163f384a931, 0x0a9e795e65d4df12},\n {0xf64335bcf065d37d, 0x4d4617b5ff4a16d6},\n {0x99ea0196163fa42e, 0x504bced1bf8e4e46},\n {0xc06481fb9bcf8d39, 0xe45ec2862f71e1d7},\n {0xf07da27a82c37088, 0x5d767327bb4e5a4d},\n {0x964e858c91ba2655, 0x3a6a07f8d510f870},\n {0xbbe226efb628afea, 0x890489f70a55368c},\n {0xeadab0aba3b2dbe5, 0x2b45ac74ccea842f},\n {0x92c8ae6b464fc96f, 0x3b0b8bc90012929e},\n {0xb77ada0617e3bbcb, 0x09ce6ebb40173745},\n {0xe55990879ddcaabd, 0xcc420a6a101d0516},\n {0x8f57fa54c2a9eab6, 0x9fa946824a12232e},\n {0xb32df8e9f3546564, 0x47939822dc96abfa},\n {0xdff9772470297ebd, 0x59787e2b93bc56f8},\n {0x8bfbea76c619ef36, 0x57eb4edb3c55b65b},\n {0xaefae51477a06b03, 0xede622920b6b23f2},\n {0xdab99e59958885c4, 0xe95fab368e45ecee},\n {0x88b402f7fd75539b, 0x11dbcb0218ebb415},\n {0xaae103b5fcd2a881, 0xd652bdc29f26a11a},\n {0xd59944a37c0752a2, 0x4be76d3346f04960},\n {0x857fcae62d8493a5, 0x6f70a4400c562ddc},\n {0xa6dfbd9fb8e5b88e, 0xcb4ccd500f6bb953},\n {0xd097ad07a71f26b2, 0x7e2000a41346a7a8},\n {0x825ecc24c873782f, 0x8ed400668c0c28c9},\n {0xa2f67f2dfa90563b, 0x728900802f0f32fb},\n {0xcbb41ef979346bca, 0x4f2b40a03ad2ffba},\n {0xfea126b7d78186bc, 0xe2f610c84987bfa9},\n {0x9f24b832e6b0f436, 0x0dd9ca7d2df4d7ca},\n {0xc6ede63fa05d3143, 0x91503d1c79720dbc},\n {0xf8a95fcf88747d94, 0x75a44c6397ce912b},\n {0x9b69dbe1b548ce7c, 0xc986afbe3ee11abb},\n {0xc24452da229b021b, 0xfbe85badce996169},\n {0xf2d56790ab41c2a2, 0xfae27299423fb9c4},\n {0x97c560ba6b0919a5, 0xdccd879fc967d41b},\n {0xbdb6b8e905cb600f, 0x5400e987bbc1c921},\n {0xed246723473e3813, 0x290123e9aab23b69},\n {0x9436c0760c86e30b, 0xf9a0b6720aaf6522},\n {0xb94470938fa89bce, 0xf808e40e8d5b3e6a},\n {0xe7958cb87392c2c2, 0xb60b1d1230b20e05},\n {0x90bd77f3483bb9b9, 0xb1c6f22b5e6f48c3},\n {0xb4ecd5f01a4aa828, 0x1e38aeb6360b1af4},\n {0xe2280b6c20dd5232, 0x25c6da63c38de1b1},\n {0x8d590723948a535f, 0x579c487e5a38ad0f},\n {0xb0af48ec79ace837, 0x2d835a9df0c6d852},\n {0xdcdb1b2798182244, 0xf8e431456cf88e66},\n {0x8a08f0f8bf0f156b, 0x1b8e9ecb641b5900},\n {0xac8b2d36eed2dac5, 0xe272467e3d222f40},\n {0xd7adf884aa879177, 0x5b0ed81dcc6abb10},\n {0x86ccbb52ea94baea, 0x98e947129fc2b4ea},\n {0xa87fea27a539e9a5, 0x3f2398d747b36225},\n {0xd29fe4b18e88640e, 0x8eec7f0d19a03aae},\n {0x83a3eeeef9153e89, 0x1953cf68300424ad},\n {0xa48ceaaab75a8e2b, 0x5fa8c3423c052dd8},\n {0xcdb02555653131b6, 0x3792f412cb06794e},\n {0x808e17555f3ebf11, 0xe2bbd88bbee40bd1},\n {0xa0b19d2ab70e6ed6, 0x5b6aceaeae9d0ec5},\n {0xc8de047564d20a8b, 0xf245825a5a445276},\n {0xfb158592be068d2e, 0xeed6e2f0f0d56713},\n {0x9ced737bb6c4183d, 0x55464dd69685606c},\n {0xc428d05aa4751e4c, 0xaa97e14c3c26b887},\n {0xf53304714d9265df, 0xd53dd99f4b3066a9},\n {0x993fe2c6d07b7fab, 0xe546a8038efe402a},\n {0xbf8fdb78849a5f96, 0xde98520472bdd034},\n {0xef73d256a5c0f77c, 0x963e66858f6d4441},\n {0x95a8637627989aad, 0xdde7001379a44aa9},\n {0xbb127c53b17ec159, 0x5560c018580d5d53},\n {0xe9d71b689dde71af, 0xaab8f01e6e10b4a7},\n {0x9226712162ab070d, 0xcab3961304ca70e9},\n {0xb6b00d69bb55c8d1, 0x3d607b97c5fd0d23},\n {0xe45c10c42a2b3b05, 0x8cb89a7db77c506b},\n {0x8eb98a7a9a5b04e3, 0x77f3608e92adb243},\n {0xb267ed1940f1c61c, 0x55f038b237591ed4},\n {0xdf01e85f912e37a3, 0x6b6c46dec52f6689},\n {0x8b61313bbabce2c6, 0x2323ac4b3b3da016},\n {0xae397d8aa96c1b77, 0xabec975e0a0d081b},\n {0xd9c7dced53c72255, 0x96e7bd358c904a22},\n {0x881cea14545c7575, 0x7e50d64177da2e55},\n {0xaa242499697392d2, 0xdde50bd1d5d0b9ea},\n {0xd4ad2dbfc3d07787, 0x955e4ec64b44e865},\n {0x84ec3c97da624ab4, 0xbd5af13bef0b113f},\n {0xa6274bbdd0fadd61, 0xecb1ad8aeacdd58f},\n {0xcfb11ead453994ba, 0x67de18eda5814af3},\n {0x81ceb32c4b43fcf4, 0x80eacf948770ced8},\n {0xa2425ff75e14fc31, 0xa1258379a94d028e},\n {0xcad2f7f5359a3b3e, 0x096ee45813a04331},\n {0xfd87b5f28300ca0d, 0x8bca9d6e188853fd},\n {0x9e74d1b791e07e48, 0x775ea264cf55347e},\n {0xc612062576589dda, 0x95364afe032a819e},\n {0xf79687aed3eec551, 0x3a83ddbd83f52205},\n {0x9abe14cd44753b52, 0xc4926a9672793543},\n {0xc16d9a0095928a27, 0x75b7053c0f178294},\n {0xf1c90080baf72cb1, 0x5324c68b12dd6339},\n {0x971da05074da7bee, 0xd3f6fc16ebca5e04},\n {0xbce5086492111aea, 0x88f4bb1ca6bcf585},\n {0xec1e4a7db69561a5, 0x2b31e9e3d06c32e6},\n {0x9392ee8e921d5d07, 0x3aff322e62439fd0},\n {0xb877aa3236a4b449, 0x09befeb9fad487c3},\n {0xe69594bec44de15b, 0x4c2ebe687989a9b4},\n {0x901d7cf73ab0acd9, 0x0f9d37014bf60a11},\n {0xb424dc35095cd80f, 0x538484c19ef38c95},\n {0xe12e13424bb40e13, 0x2865a5f206b06fba},\n {0x8cbccc096f5088cb, 0xf93f87b7442e45d4},\n {0xafebff0bcb24aafe, 0xf78f69a51539d749},\n {0xdbe6fecebdedd5be, 0xb573440e5a884d1c},\n {0x89705f4136b4a597, 0x31680a88f8953031},\n {0xabcc77118461cefc, 0xfdc20d2b36ba7c3e},\n {0xd6bf94d5e57a42bc, 0x3d32907604691b4d},\n {0x8637bd05af6c69b5, 0xa63f9a49c2c1b110},\n {0xa7c5ac471b478423, 0x0fcf80dc33721d54},\n {0xd1b71758e219652b, 0xd3c36113404ea4a9},\n {0x83126e978d4fdf3b, 0x645a1cac083126ea},\n {0xa3d70a3d70a3d70a, 0x3d70a3d70a3d70a4},\n {0xcccccccccccccccc, 0xcccccccccccccccd},\n {0x8000000000000000, 0x0000000000000000},\n {0xa000000000000000, 0x0000000000000000},\n {0xc800000000000000, 0x0000000000000000},\n {0xfa00000000000000, 0x0000000000000000},\n {0x9c40000000000000, 0x0000000000000000},\n {0xc350000000000000, 0x0000000000000000},\n {0xf424000000000000, 0x0000000000000000},\n {0x9896800000000000, 0x0000000000000000},\n {0xbebc200000000000, 0x0000000000000000},\n {0xee6b280000000000, 0x0000000000000000},\n {0x9502f90000000000, 0x0000000000000000},\n {0xba43b74000000000, 0x0000000000000000},\n {0xe8d4a51000000000, 0x0000000000000000},\n {0x9184e72a00000000, 0x0000000000000000},\n {0xb5e620f480000000, 0x0000000000000000},\n {0xe35fa931a0000000, 0x0000000000000000},\n {0x8e1bc9bf04000000, 0x0000000000000000},\n {0xb1a2bc2ec5000000, 0x0000000000000000},\n {0xde0b6b3a76400000, 0x0000000000000000},\n {0x8ac7230489e80000, 0x0000000000000000},\n {0xad78ebc5ac620000, 0x0000000000000000},\n {0xd8d726b7177a8000, 0x0000000000000000},\n {0x878678326eac9000, 0x0000000000000000},\n {0xa968163f0a57b400, 0x0000000000000000},\n {0xd3c21bcecceda100, 0x0000000000000000},\n {0x84595161401484a0, 0x0000000000000000},\n {0xa56fa5b99019a5c8, 0x0000000000000000},\n {0xcecb8f27f4200f3a, 0x0000000000000000},\n {0x813f3978f8940984, 0x4000000000000000},\n {0xa18f07d736b90be5, 0x5000000000000000},\n {0xc9f2c9cd04674ede, 0xa400000000000000},\n {0xfc6f7c4045812296, 0x4d00000000000000},\n {0x9dc5ada82b70b59d, 0xf020000000000000},\n {0xc5371912364ce305, 0x6c28000000000000},\n {0xf684df56c3e01bc6, 0xc732000000000000},\n {0x9a130b963a6c115c, 0x3c7f400000000000},\n {0xc097ce7bc90715b3, 0x4b9f100000000000},\n {0xf0bdc21abb48db20, 0x1e86d40000000000},\n {0x96769950b50d88f4, 0x1314448000000000},\n {0xbc143fa4e250eb31, 0x17d955a000000000},\n {0xeb194f8e1ae525fd, 0x5dcfab0800000000},\n {0x92efd1b8d0cf37be, 0x5aa1cae500000000},\n {0xb7abc627050305ad, 0xf14a3d9e40000000},\n {0xe596b7b0c643c719, 0x6d9ccd05d0000000},\n {0x8f7e32ce7bea5c6f, 0xe4820023a2000000},\n {0xb35dbf821ae4f38b, 0xdda2802c8a800000},\n {0xe0352f62a19e306e, 0xd50b2037ad200000},\n {0x8c213d9da502de45, 0x4526f422cc340000},\n {0xaf298d050e4395d6, 0x9670b12b7f410000},\n {0xdaf3f04651d47b4c, 0x3c0cdd765f114000},\n {0x88d8762bf324cd0f, 0xa5880a69fb6ac800},\n {0xab0e93b6efee0053, 0x8eea0d047a457a00},\n {0xd5d238a4abe98068, 0x72a4904598d6d880},\n {0x85a36366eb71f041, 0x47a6da2b7f864750},\n {0xa70c3c40a64e6c51, 0x999090b65f67d924},\n {0xd0cf4b50cfe20765, 0xfff4b4e3f741cf6d},\n {0x82818f1281ed449f, 0xbff8f10e7a8921a4},\n {0xa321f2d7226895c7, 0xaff72d52192b6a0d},\n {0xcbea6f8ceb02bb39, 0x9bf4f8a69f764490},\n {0xfee50b7025c36a08, 0x02f236d04753d5b4},\n {0x9f4f2726179a2245, 0x01d762422c946590},\n {0xc722f0ef9d80aad6, 0x424d3ad2b7b97ef5},\n {0xf8ebad2b84e0d58b, 0xd2e0898765a7deb2},\n {0x9b934c3b330c8577, 0x63cc55f49f88eb2f},\n {0xc2781f49ffcfa6d5, 0x3cbf6b71c76b25fb},\n {0xf316271c7fc3908a, 0x8bef464e3945ef7a},\n {0x97edd871cfda3a56, 0x97758bf0e3cbb5ac},\n {0xbde94e8e43d0c8ec, 0x3d52eeed1cbea317},\n {0xed63a231d4c4fb27, 0x4ca7aaa863ee4bdd},\n {0x945e455f24fb1cf8, 0x8fe8caa93e74ef6a},\n {0xb975d6b6ee39e436, 0xb3e2fd538e122b44},\n {0xe7d34c64a9c85d44, 0x60dbbca87196b616},\n {0x90e40fbeea1d3a4a, 0xbc8955e946fe31cd},\n {0xb51d13aea4a488dd, 0x6babab6398bdbe41},\n {0xe264589a4dcdab14, 0xc696963c7eed2dd1},\n {0x8d7eb76070a08aec, 0xfc1e1de5cf543ca2},\n {0xb0de65388cc8ada8, 0x3b25a55f43294bcb},\n {0xdd15fe86affad912, 0x49ef0eb713f39ebe},\n {0x8a2dbf142dfcc7ab, 0x6e3569326c784337},\n {0xacb92ed9397bf996, 0x49c2c37f07965404},\n {0xd7e77a8f87daf7fb, 0xdc33745ec97be906},\n {0x86f0ac99b4e8dafd, 0x69a028bb3ded71a3},\n {0xa8acd7c0222311bc, 0xc40832ea0d68ce0c},\n {0xd2d80db02aabd62b, 0xf50a3fa490c30190},\n {0x83c7088e1aab65db, 0x792667c6da79e0fa},\n {0xa4b8cab1a1563f52, 0x577001b891185938},\n {0xcde6fd5e09abcf26, 0xed4c0226b55e6f86},\n {0x80b05e5ac60b6178, 0x544f8158315b05b4},\n {0xa0dc75f1778e39d6, 0x696361ae3db1c721},\n {0xc913936dd571c84c, 0x03bc3a19cd1e38e9},\n {0xfb5878494ace3a5f, 0x04ab48a04065c723},\n {0x9d174b2dcec0e47b, 0x62eb0d64283f9c76},\n {0xc45d1df942711d9a, 0x3ba5d0bd324f8394},\n {0xf5746577930d6500, 0xca8f44ec7ee36479},\n {0x9968bf6abbe85f20, 0x7e998b13cf4e1ecb},\n {0xbfc2ef456ae276e8, 0x9e3fedd8c321a67e},\n {0xefb3ab16c59b14a2, 0xc5cfe94ef3ea101e},\n {0x95d04aee3b80ece5, 0xbba1f1d158724a12},\n {0xbb445da9ca61281f, 0x2a8a6e45ae8edc97},\n {0xea1575143cf97226, 0xf52d09d71a3293bd},\n {0x924d692ca61be758, 0x593c2626705f9c56},\n {0xb6e0c377cfa2e12e, 0x6f8b2fb00c77836c},\n {0xe498f455c38b997a, 0x0b6dfb9c0f956447},\n {0x8edf98b59a373fec, 0x4724bd4189bd5eac},\n {0xb2977ee300c50fe7, 0x58edec91ec2cb657},\n {0xdf3d5e9bc0f653e1, 0x2f2967b66737e3ed},\n {0x8b865b215899f46c, 0xbd79e0d20082ee74},\n {0xae67f1e9aec07187, 0xecd8590680a3aa11},\n {0xda01ee641a708de9, 0xe80e6f4820cc9495},\n {0x884134fe908658b2, 0x3109058d147fdcdd},\n {0xaa51823e34a7eede, 0xbd4b46f0599fd415},\n {0xd4e5e2cdc1d1ea96, 0x6c9e18ac7007c91a},\n {0x850fadc09923329e, 0x03e2cf6bc604ddb0},\n {0xa6539930bf6bff45, 0x84db8346b786151c},\n {0xcfe87f7cef46ff16, 0xe612641865679a63},\n {0x81f14fae158c5f6e, 0x4fcb7e8f3f60c07e},\n {0xa26da3999aef7749, 0xe3be5e330f38f09d},\n {0xcb090c8001ab551c, 0x5cadf5bfd3072cc5},\n {0xfdcb4fa002162a63, 0x73d9732fc7c8f7f6},\n {0x9e9f11c4014dda7e, 0x2867e7fddcdd9afa},\n {0xc646d63501a1511d, 0xb281e1fd541501b8},\n {0xf7d88bc24209a565, 0x1f225a7ca91a4226},\n {0x9ae757596946075f, 0x3375788de9b06958},\n {0xc1a12d2fc3978937, 0x0052d6b1641c83ae},\n {0xf209787bb47d6b84, 0xc0678c5dbd23a49a},\n {0x9745eb4d50ce6332, 0xf840b7ba963646e0},\n {0xbd176620a501fbff, 0xb650e5a93bc3d898},\n {0xec5d3fa8ce427aff, 0xa3e51f138ab4cebe},\n {0x93ba47c980e98cdf, 0xc66f336c36b10137},\n {0xb8a8d9bbe123f017, 0xb80b0047445d4184},\n {0xe6d3102ad96cec1d, 0xa60dc059157491e5},\n {0x9043ea1ac7e41392, 0x87c89837ad68db2f},\n {0xb454e4a179dd1877, 0x29babe4598c311fb},\n {0xe16a1dc9d8545e94, 0xf4296dd6fef3d67a},\n {0x8ce2529e2734bb1d, 0x1899e4a65f58660c},\n {0xb01ae745b101e9e4, 0x5ec05dcff72e7f8f},\n {0xdc21a1171d42645d, 0x76707543f4fa1f73},\n {0x899504ae72497eba, 0x6a06494a791c53a8},\n {0xabfa45da0edbde69, 0x0487db9d17636892},\n {0xd6f8d7509292d603, 0x45a9d2845d3c42b6},\n {0x865b86925b9bc5c2, 0x0b8a2392ba45a9b2},\n {0xa7f26836f282b732, 0x8e6cac7768d7141e},\n {0xd1ef0244af2364ff, 0x3207d795430cd926},\n {0x8335616aed761f1f, 0x7f44e6bd49e807b8},\n {0xa402b9c5a8d3a6e7, 0x5f16206c9c6209a6},\n {0xcd036837130890a1, 0x36dba887c37a8c0f},\n {0x802221226be55a64, 0xc2494954da2c9789},\n {0xa02aa96b06deb0fd, 0xf2db9baa10b7bd6c},\n {0xc83553c5c8965d3d, 0x6f92829494e5acc7},\n {0xfa42a8b73abbf48c, 0xcb772339ba1f17f9},\n {0x9c69a97284b578d7, 0xff2a760414536efb},\n {0xc38413cf25e2d70d, 0xfef5138519684aba},\n {0xf46518c2ef5b8cd1, 0x7eb258665fc25d69},\n {0x98bf2f79d5993802, 0xef2f773ffbd97a61},\n {0xbeeefb584aff8603, 0xaafb550ffacfd8fa},\n {0xeeaaba2e5dbf6784, 0x95ba2a53f983cf38},\n {0x952ab45cfa97a0b2, 0xdd945a747bf26183},\n {0xba756174393d88df, 0x94f971119aeef9e4},\n {0xe912b9d1478ceb17, 0x7a37cd5601aab85d},\n {0x91abb422ccb812ee, 0xac62e055c10ab33a},\n {0xb616a12b7fe617aa, 0x577b986b314d6009},\n {0xe39c49765fdf9d94, 0xed5a7e85fda0b80b},\n {0x8e41ade9fbebc27d, 0x14588f13be847307},\n {0xb1d219647ae6b31c, 0x596eb2d8ae258fc8},\n {0xde469fbd99a05fe3, 0x6fca5f8ed9aef3bb},\n {0x8aec23d680043bee, 0x25de7bb9480d5854},\n {0xada72ccc20054ae9, 0xaf561aa79a10ae6a},\n {0xd910f7ff28069da4, 0x1b2ba1518094da04},\n {0x87aa9aff79042286, 0x90fb44d2f05d0842},\n {0xa99541bf57452b28, 0x353a1607ac744a53},\n {0xd3fa922f2d1675f2, 0x42889b8997915ce8},\n {0x847c9b5d7c2e09b7, 0x69956135febada11},\n {0xa59bc234db398c25, 0x43fab9837e699095},\n {0xcf02b2c21207ef2e, 0x94f967e45e03f4bb},\n {0x8161afb94b44f57d, 0x1d1be0eebac278f5},\n {0xa1ba1ba79e1632dc, 0x6462d92a69731732},\n {0xca28a291859bbf93, 0x7d7b8f7503cfdcfe},\n {0xfcb2cb35e702af78, 0x5cda735244c3d43e},\n {0x9defbf01b061adab, 0x3a0888136afa64a7},\n {0xc56baec21c7a1916, 0x088aaa1845b8fdd0},\n {0xf6c69a72a3989f5b, 0x8aad549e57273d45},\n {0x9a3c2087a63f6399, 0x36ac54e2f678864b},\n {0xc0cb28a98fcf3c7f, 0x84576a1bb416a7dd},\n {0xf0fdf2d3f3c30b9f, 0x656d44a2a11c51d5},\n {0x969eb7c47859e743, 0x9f644ae5a4b1b325},\n {0xbc4665b596706114, 0x873d5d9f0dde1fee},\n {0xeb57ff22fc0c7959, 0xa90cb506d155a7ea},\n {0x9316ff75dd87cbd8, 0x09a7f12442d588f2},\n {0xb7dcbf5354e9bece, 0x0c11ed6d538aeb2f},\n {0xe5d3ef282a242e81, 0x8f1668c8a86da5fa},\n {0x8fa475791a569d10, 0xf96e017d694487bc},\n {0xb38d92d760ec4455, 0x37c981dcc395a9ac},\n {0xe070f78d3927556a, 0x85bbe253f47b1417},\n {0x8c469ab843b89562, 0x93956d7478ccec8e},\n {0xaf58416654a6babb, 0x387ac8d1970027b2},\n {0xdb2e51bfe9d0696a, 0x06997b05fcc0319e},\n {0x88fcf317f22241e2, 0x441fece3bdf81f03},\n {0xab3c2fddeeaad25a, 0xd527e81cad7626c3},\n {0xd60b3bd56a5586f1, 0x8a71e223d8d3b074},\n {0x85c7056562757456, 0xf6872d5667844e49},\n {0xa738c6bebb12d16c, 0xb428f8ac016561db},\n {0xd106f86e69d785c7, 0xe13336d701beba52},\n {0x82a45b450226b39c, 0xecc0024661173473},\n {0xa34d721642b06084, 0x27f002d7f95d0190},\n {0xcc20ce9bd35c78a5, 0x31ec038df7b441f4},\n {0xff290242c83396ce, 0x7e67047175a15271},\n {0x9f79a169bd203e41, 0x0f0062c6e984d386},\n {0xc75809c42c684dd1, 0x52c07b78a3e60868},\n {0xf92e0c3537826145, 0xa7709a56ccdf8a82},\n {0x9bbcc7a142b17ccb, 0x88a66076400bb691},\n {0xc2abf989935ddbfe, 0x6acff893d00ea435},\n {0xf356f7ebf83552fe, 0x0583f6b8c4124d43},\n {0x98165af37b2153de, 0xc3727a337a8b704a},\n {0xbe1bf1b059e9a8d6, 0x744f18c0592e4c5c},\n {0xeda2ee1c7064130c, 0x1162def06f79df73},\n {0x9485d4d1c63e8be7, 0x8addcb5645ac2ba8},\n {0xb9a74a0637ce2ee1, 0x6d953e2bd7173692},\n {0xe8111c87c5c1ba99, 0xc8fa8db6ccdd0437},\n {0x910ab1d4db9914a0, 0x1d9c9892400a22a2},\n {0xb54d5e4a127f59c8, 0x2503beb6d00cab4b},\n {0xe2a0b5dc971f303a, 0x2e44ae64840fd61d},\n {0x8da471a9de737e24, 0x5ceaecfed289e5d2},\n {0xb10d8e1456105dad, 0x7425a83e872c5f47},\n {0xdd50f1996b947518, 0xd12f124e28f77719},\n {0x8a5296ffe33cc92f, 0x82bd6b70d99aaa6f},\n {0xace73cbfdc0bfb7b, 0x636cc64d1001550b},\n {0xd8210befd30efa5a, 0x3c47f7e05401aa4e},\n {0x8714a775e3e95c78, 0x65acfaec34810a71},\n {0xa8d9d1535ce3b396, 0x7f1839a741a14d0d},\n {0xd31045a8341ca07c, 0x1ede48111209a050},\n {0x83ea2b892091e44d, 0x934aed0aab460432},\n {0xa4e4b66b68b65d60, 0xf81da84d5617853f},\n {0xce1de40642e3f4b9, 0x36251260ab9d668e},\n {0x80d2ae83e9ce78f3, 0xc1d72b7c6b426019},\n {0xa1075a24e4421730, 0xb24cf65b8612f81f},\n {0xc94930ae1d529cfc, 0xdee033f26797b627},\n {0xfb9b7cd9a4a7443c, 0x169840ef017da3b1},\n {0x9d412e0806e88aa5, 0x8e1f289560ee864e},\n {0xc491798a08a2ad4e, 0xf1a6f2bab92a27e2},\n {0xf5b5d7ec8acb58a2, 0xae10af696774b1db},\n {0x9991a6f3d6bf1765, 0xacca6da1e0a8ef29},\n {0xbff610b0cc6edd3f, 0x17fd090a58d32af3},\n {0xeff394dcff8a948e, 0xddfc4b4cef07f5b0},\n {0x95f83d0a1fb69cd9, 0x4abdaf101564f98e},\n {0xbb764c4ca7a4440f, 0x9d6d1ad41abe37f1},\n {0xea53df5fd18d5513, 0x84c86189216dc5ed},\n {0x92746b9be2f8552c, 0x32fd3cf5b4e49bb4},\n {0xb7118682dbb66a77, 0x3fbc8c33221dc2a1},\n {0xe4d5e82392a40515, 0x0fabaf3feaa5334a},\n {0x8f05b1163ba6832d, 0x29cb4d87f2a7400e},\n {0xb2c71d5bca9023f8, 0x743e20e9ef511012},\n {0xdf78e4b2bd342cf6, 0x914da9246b255416},\n {0x8bab8eefb6409c1a, 0x1ad089b6c2f7548e},\n {0xae9672aba3d0c320, 0xa184ac2473b529b1},\n {0xda3c0f568cc4f3e8, 0xc9e5d72d90a2741e},\n {0x8865899617fb1871, 0x7e2fa67c7a658892},\n {0xaa7eebfb9df9de8d, 0xddbb901b98feeab7},\n {0xd51ea6fa85785631, 0x552a74227f3ea565},\n {0x8533285c936b35de, 0xd53a88958f87275f},\n {0xa67ff273b8460356, 0x8a892abaf368f137},\n {0xd01fef10a657842c, 0x2d2b7569b0432d85},\n {0x8213f56a67f6b29b, 0x9c3b29620e29fc73},\n {0xa298f2c501f45f42, 0x8349f3ba91b47b8f},\n {0xcb3f2f7642717713, 0x241c70a936219a73},\n {0xfe0efb53d30dd4d7, 0xed238cd383aa0110},\n {0x9ec95d1463e8a506, 0xf4363804324a40aa},\n {0xc67bb4597ce2ce48, 0xb143c6053edcd0d5},\n {0xf81aa16fdc1b81da, 0xdd94b7868e94050a},\n {0x9b10a4e5e9913128, 0xca7cf2b4191c8326},\n {0xc1d4ce1f63f57d72, 0xfd1c2f611f63a3f0},\n {0xf24a01a73cf2dccf, 0xbc633b39673c8cec},\n {0x976e41088617ca01, 0xd5be0503e085d813},\n {0xbd49d14aa79dbc82, 0x4b2d8644d8a74e18},\n {0xec9c459d51852ba2, 0xddf8e7d60ed1219e},\n {0x93e1ab8252f33b45, 0xcabb90e5c942b503},\n {0xb8da1662e7b00a17, 0x3d6a751f3b936243},\n {0xe7109bfba19c0c9d, 0x0cc512670a783ad4},\n {0x906a617d450187e2, 0x27fb2b80668b24c5},\n {0xb484f9dc9641e9da, 0xb1f9f660802dedf6},\n {0xe1a63853bbd26451, 0x5e7873f8a0396973},\n {0x8d07e33455637eb2, 0xdb0b487b6423e1e8},\n {0xb049dc016abc5e5f, 0x91ce1a9a3d2cda62},\n {0xdc5c5301c56b75f7, 0x7641a140cc7810fb},\n {0x89b9b3e11b6329ba, 0xa9e904c87fcb0a9d},\n {0xac2820d9623bf429, 0x546345fa9fbdcd44},\n {0xd732290fbacaf133, 0xa97c177947ad4095},\n {0x867f59a9d4bed6c0, 0x49ed8eabcccc485d},\n {0xa81f301449ee8c70, 0x5c68f256bfff5a74},\n {0xd226fc195c6a2f8c, 0x73832eec6fff3111},\n {0x83585d8fd9c25db7, 0xc831fd53c5ff7eab},\n {0xa42e74f3d032f525, 0xba3e7ca8b77f5e55},\n {0xcd3a1230c43fb26f, 0x28ce1bd2e55f35eb},\n {0x80444b5e7aa7cf85, 0x7980d163cf5b81b3},\n {0xa0555e361951c366, 0xd7e105bcc332621f},\n {0xc86ab5c39fa63440, 0x8dd9472bf3fefaa7},\n {0xfa856334878fc150, 0xb14f98f6f0feb951},\n {0x9c935e00d4b9d8d2, 0x6ed1bf9a569f33d3},\n {0xc3b8358109e84f07, 0x0a862f80ec4700c8},\n {0xf4a642e14c6262c8, 0xcd27bb612758c0fa},\n {0x98e7e9cccfbd7dbd, 0x8038d51cb897789c},\n {0xbf21e44003acdd2c, 0xe0470a63e6bd56c3},\n {0xeeea5d5004981478, 0x1858ccfce06cac74},\n {0x95527a5202df0ccb, 0x0f37801e0c43ebc8},\n {0xbaa718e68396cffd, 0xd30560258f54e6ba},\n {0xe950df20247c83fd, 0x47c6b82ef32a2069},\n {0x91d28b7416cdd27e, 0x4cdc331d57fa5441},\n {0xb6472e511c81471d, 0xe0133fe4adf8e952},\n {0xe3d8f9e563a198e5, 0x58180fddd97723a6},\n {0x8e679c2f5e44ff8f, 0x570f09eaa7ea7648},\n {0xb201833b35d63f73, 0x2cd2cc6551e513da},\n {0xde81e40a034bcf4f, 0xf8077f7ea65e58d1},\n {0x8b112e86420f6191, 0xfb04afaf27faf782},\n {0xadd57a27d29339f6, 0x79c5db9af1f9b563},\n {0xd94ad8b1c7380874, 0x18375281ae7822bc},\n {0x87cec76f1c830548, 0x8f2293910d0b15b5},\n {0xa9c2794ae3a3c69a, 0xb2eb3875504ddb22},\n {0xd433179d9c8cb841, 0x5fa60692a46151eb},\n {0x849feec281d7f328, 0xdbc7c41ba6bcd333},\n {0xa5c7ea73224deff3, 0x12b9b522906c0800},\n {0xcf39e50feae16bef, 0xd768226b34870a00},\n {0x81842f29f2cce375, 0xe6a1158300d46640},\n {0xa1e53af46f801c53, 0x60495ae3c1097fd0},\n {0xca5e89b18b602368, 0x385bb19cb14bdfc4},\n {0xfcf62c1dee382c42, 0x46729e03dd9ed7b5},\n {0x9e19db92b4e31ba9, 0x6c07a2c26a8346d1},\n {0xc5a05277621be293, 0xc7098b7305241885},\n { 0xf70867153aa2db38,\n 0xb8cbee4fc66d1ea7 }\n#else\n {0xff77b1fcbebcdc4f, 0x25e8e89c13bb0f7b},\n {0xce5d73ff402d98e3, 0xfb0a3d212dc81290},\n {0xa6b34ad8c9dfc06f, 0xf42faa48c0ea481f},\n {0x86a8d39ef77164bc, 0xae5dff9c02033198},\n {0xd98ddaee19068c76, 0x3badd624dd9b0958},\n {0xafbd2350644eeacf, 0xe5d1929ef90898fb},\n {0x8df5efabc5979c8f, 0xca8d3ffa1ef463c2},\n {0xe55990879ddcaabd, 0xcc420a6a101d0516},\n {0xb94470938fa89bce, 0xf808e40e8d5b3e6a},\n {0x95a8637627989aad, 0xdde7001379a44aa9},\n {0xf1c90080baf72cb1, 0x5324c68b12dd6339},\n {0xc350000000000000, 0x0000000000000000},\n {0x9dc5ada82b70b59d, 0xf020000000000000},\n {0xfee50b7025c36a08, 0x02f236d04753d5b4},\n {0xcde6fd5e09abcf26, 0xed4c0226b55e6f86},\n {0xa6539930bf6bff45, 0x84db8346b786151c},\n {0x865b86925b9bc5c2, 0x0b8a2392ba45a9b2},\n {0xd910f7ff28069da4, 0x1b2ba1518094da04},\n {0xaf58416654a6babb, 0x387ac8d1970027b2},\n {0x8da471a9de737e24, 0x5ceaecfed289e5d2},\n {0xe4d5e82392a40515, 0x0fabaf3feaa5334a},\n {0xb8da1662e7b00a17, 0x3d6a751f3b936243},\n { 0x95527a5202df0ccb,\n 0x0f37801e0c43ebc8 }\n#endif\n };\n\n#if FMT_USE_FULL_CACHE_DRAGONBOX\n return pow10_significands[k - float_info::min_k];\n#else\n static constexpr const uint64_t powers_of_5_64[] = {\n 0x0000000000000001, 0x0000000000000005, 0x0000000000000019,\n 0x000000000000007d, 0x0000000000000271, 0x0000000000000c35,\n 0x0000000000003d09, 0x000000000001312d, 0x000000000005f5e1,\n 0x00000000001dcd65, 0x00000000009502f9, 0x0000000002e90edd,\n 0x000000000e8d4a51, 0x0000000048c27395, 0x000000016bcc41e9,\n 0x000000071afd498d, 0x0000002386f26fc1, 0x000000b1a2bc2ec5,\n 0x000003782dace9d9, 0x00001158e460913d, 0x000056bc75e2d631,\n 0x0001b1ae4d6e2ef5, 0x000878678326eac9, 0x002a5a058fc295ed,\n 0x00d3c21bcecceda1, 0x0422ca8b0a00a425, 0x14adf4b7320334b9};\n\n static constexpr const uint32_t pow10_recovery_errors[] = {\n 0x50001400, 0x54044100, 0x54014555, 0x55954415, 0x54115555, 0x00000001,\n 0x50000000, 0x00104000, 0x54010004, 0x05004001, 0x55555544, 0x41545555,\n 0x54040551, 0x15445545, 0x51555514, 0x10000015, 0x00101100, 0x01100015,\n 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x04450514, 0x45414110,\n 0x55555145, 0x50544050, 0x15040155, 0x11054140, 0x50111514, 0x11451454,\n 0x00400541, 0x00000000, 0x55555450, 0x10056551, 0x10054011, 0x55551014,\n 0x69514555, 0x05151109, 0x00155555};\n\n static const int compression_ratio = 27;\n\n // Compute base index.\n int cache_index = (k - float_info::min_k) / compression_ratio;\n int kb = cache_index * compression_ratio + float_info::min_k;\n int offset = k - kb;\n\n // Get base cache.\n uint128_wrapper base_cache = pow10_significands[cache_index];\n if (offset == 0) return base_cache;\n\n // Compute the required amount of bit-shift.\n int alpha = floor_log2_pow10(kb + offset) - floor_log2_pow10(kb) - offset;\n FMT_ASSERT(alpha > 0 && alpha < 64, \"shifting error detected\");\n\n // Try to recover the real cache.\n uint64_t pow5 = powers_of_5_64[offset];\n uint128_wrapper recovered_cache = umul128(base_cache.high(), pow5);\n uint128_wrapper middle_low =\n umul128(base_cache.low() - (kb < 0 ? 1u : 0u), pow5);\n\n recovered_cache += middle_low.high();\n\n uint64_t high_to_middle = recovered_cache.high() << (64 - alpha);\n uint64_t middle_to_low = recovered_cache.low() << (64 - alpha);\n\n recovered_cache =\n uint128_wrapper{(recovered_cache.low() >> alpha) | high_to_middle,\n ((middle_low.low() >> alpha) | middle_to_low)};\n\n if (kb < 0) recovered_cache += 1;\n\n // Get error.\n int error_idx = (k - float_info::min_k) / 16;\n uint32_t error = (pow10_recovery_errors[error_idx] >>\n ((k - float_info::min_k) % 16) * 2) &\n 0x3;\n\n // Add the error back.\n FMT_ASSERT(recovered_cache.low() + error >= recovered_cache.low(), \"\");\n return {recovered_cache.high(), recovered_cache.low() + error};\n#endif\n }\n\n static carrier_uint compute_mul(carrier_uint u,\n const cache_entry_type& cache) FMT_NOEXCEPT {\n return umul192_upper64(u, cache);\n }\n\n static uint32_t compute_delta(cache_entry_type const& cache,\n int beta_minus_1) FMT_NOEXCEPT {\n return static_cast(cache.high() >> (64 - 1 - beta_minus_1));\n }\n\n static bool compute_mul_parity(carrier_uint two_f,\n const cache_entry_type& cache,\n int beta_minus_1) FMT_NOEXCEPT {\n FMT_ASSERT(beta_minus_1 >= 1, \"\");\n FMT_ASSERT(beta_minus_1 < 64, \"\");\n\n return ((umul192_middle64(two_f, cache) >> (64 - beta_minus_1)) & 1) != 0;\n }\n\n static carrier_uint compute_left_endpoint_for_shorter_interval_case(\n const cache_entry_type& cache, int beta_minus_1) FMT_NOEXCEPT {\n return (cache.high() -\n (cache.high() >> (float_info::significand_bits + 2))) >>\n (64 - float_info::significand_bits - 1 - beta_minus_1);\n }\n\n static carrier_uint compute_right_endpoint_for_shorter_interval_case(\n const cache_entry_type& cache, int beta_minus_1) FMT_NOEXCEPT {\n return (cache.high() +\n (cache.high() >> (float_info::significand_bits + 1))) >>\n (64 - float_info::significand_bits - 1 - beta_minus_1);\n }\n\n static carrier_uint compute_round_up_for_shorter_interval_case(\n const cache_entry_type& cache, int beta_minus_1) FMT_NOEXCEPT {\n return ((cache.high() >>\n (64 - float_info::significand_bits - 2 - beta_minus_1)) +\n 1) /\n 2;\n }\n};\n\n// Various integer checks\ntemplate \nbool is_left_endpoint_integer_shorter_interval(int exponent) FMT_NOEXCEPT {\n return exponent >=\n float_info<\n T>::case_shorter_interval_left_endpoint_lower_threshold &&\n exponent <=\n float_info::case_shorter_interval_left_endpoint_upper_threshold;\n}\ntemplate \nbool is_endpoint_integer(typename float_info::carrier_uint two_f,\n int exponent, int minus_k) FMT_NOEXCEPT {\n if (exponent < float_info::case_fc_pm_half_lower_threshold) return false;\n // For k >= 0.\n if (exponent <= float_info::case_fc_pm_half_upper_threshold) return true;\n // For k < 0.\n if (exponent > float_info::divisibility_check_by_5_threshold) return false;\n return divisible_by_power_of_5(two_f, minus_k);\n}\n\ntemplate \nbool is_center_integer(typename float_info::carrier_uint two_f, int exponent,\n int minus_k) FMT_NOEXCEPT {\n // Exponent for 5 is negative.\n if (exponent > float_info::divisibility_check_by_5_threshold) return false;\n if (exponent > float_info::case_fc_upper_threshold)\n return divisible_by_power_of_5(two_f, minus_k);\n // Both exponents are nonnegative.\n if (exponent >= float_info::case_fc_lower_threshold) return true;\n // Exponent for 2 is negative.\n return divisible_by_power_of_2(two_f, minus_k - exponent + 1);\n}\n\n// Remove trailing zeros from n and return the number of zeros removed (float)\nFMT_INLINE int remove_trailing_zeros(uint32_t& n) FMT_NOEXCEPT {\n#ifdef FMT_BUILTIN_CTZ\n int t = FMT_BUILTIN_CTZ(n);\n#else\n int t = ctz(n);\n#endif\n if (t > float_info::max_trailing_zeros)\n t = float_info::max_trailing_zeros;\n\n const uint32_t mod_inv1 = 0xcccccccd;\n const uint32_t max_quotient1 = 0x33333333;\n const uint32_t mod_inv2 = 0xc28f5c29;\n const uint32_t max_quotient2 = 0x0a3d70a3;\n\n int s = 0;\n for (; s < t - 1; s += 2) {\n if (n * mod_inv2 > max_quotient2) break;\n n *= mod_inv2;\n }\n if (s < t && n * mod_inv1 <= max_quotient1) {\n n *= mod_inv1;\n ++s;\n }\n n >>= s;\n return s;\n}\n\n// Removes trailing zeros and returns the number of zeros removed (double)\nFMT_INLINE int remove_trailing_zeros(uint64_t& n) FMT_NOEXCEPT {\n#ifdef FMT_BUILTIN_CTZLL\n int t = FMT_BUILTIN_CTZLL(n);\n#else\n int t = ctzll(n);\n#endif\n if (t > float_info::max_trailing_zeros)\n t = float_info::max_trailing_zeros;\n // Divide by 10^8 and reduce to 32-bits\n // Since ret_value.significand <= (2^64 - 1) / 1000 < 10^17,\n // both of the quotient and the r should fit in 32-bits\n\n const uint32_t mod_inv1 = 0xcccccccd;\n const uint32_t max_quotient1 = 0x33333333;\n const uint64_t mod_inv8 = 0xc767074b22e90e21;\n const uint64_t max_quotient8 = 0x00002af31dc46118;\n\n // If the number is divisible by 1'0000'0000, work with the quotient\n if (t >= 8) {\n auto quotient_candidate = n * mod_inv8;\n\n if (quotient_candidate <= max_quotient8) {\n auto quotient = static_cast(quotient_candidate >> 8);\n\n int s = 8;\n for (; s < t; ++s) {\n if (quotient * mod_inv1 > max_quotient1) break;\n quotient *= mod_inv1;\n }\n quotient >>= (s - 8);\n n = quotient;\n return s;\n }\n }\n\n // Otherwise, work with the remainder\n auto quotient = static_cast(n / 100000000);\n auto remainder = static_cast(n - 100000000 * quotient);\n\n if (t == 0 || remainder * mod_inv1 > max_quotient1) {\n return 0;\n }\n remainder *= mod_inv1;\n\n if (t == 1 || remainder * mod_inv1 > max_quotient1) {\n n = (remainder >> 1) + quotient * 10000000ull;\n return 1;\n }\n remainder *= mod_inv1;\n\n if (t == 2 || remainder * mod_inv1 > max_quotient1) {\n n = (remainder >> 2) + quotient * 1000000ull;\n return 2;\n }\n remainder *= mod_inv1;\n\n if (t == 3 || remainder * mod_inv1 > max_quotient1) {\n n = (remainder >> 3) + quotient * 100000ull;\n return 3;\n }\n remainder *= mod_inv1;\n\n if (t == 4 || remainder * mod_inv1 > max_quotient1) {\n n = (remainder >> 4) + quotient * 10000ull;\n return 4;\n }\n remainder *= mod_inv1;\n\n if (t == 5 || remainder * mod_inv1 > max_quotient1) {\n n = (remainder >> 5) + quotient * 1000ull;\n return 5;\n }\n remainder *= mod_inv1;\n\n if (t == 6 || remainder * mod_inv1 > max_quotient1) {\n n = (remainder >> 6) + quotient * 100ull;\n return 6;\n }\n remainder *= mod_inv1;\n\n n = (remainder >> 7) + quotient * 10ull;\n return 7;\n}\n\n// The main algorithm for shorter interval case\ntemplate \nFMT_INLINE decimal_fp shorter_interval_case(int exponent) FMT_NOEXCEPT {\n decimal_fp ret_value;\n // Compute k and beta\n const int minus_k = floor_log10_pow2_minus_log10_4_over_3(exponent);\n const int beta_minus_1 = exponent + floor_log2_pow10(-minus_k);\n\n // Compute xi and zi\n using cache_entry_type = typename cache_accessor::cache_entry_type;\n const cache_entry_type cache = cache_accessor::get_cached_power(-minus_k);\n\n auto xi = cache_accessor::compute_left_endpoint_for_shorter_interval_case(\n cache, beta_minus_1);\n auto zi = cache_accessor::compute_right_endpoint_for_shorter_interval_case(\n cache, beta_minus_1);\n\n // If the left endpoint is not an integer, increase it\n if (!is_left_endpoint_integer_shorter_interval(exponent)) ++xi;\n\n // Try bigger divisor\n ret_value.significand = zi / 10;\n\n // If succeed, remove trailing zeros if necessary and return\n if (ret_value.significand * 10 >= xi) {\n ret_value.exponent = minus_k + 1;\n ret_value.exponent += remove_trailing_zeros(ret_value.significand);\n return ret_value;\n }\n\n // Otherwise, compute the round-up of y\n ret_value.significand =\n cache_accessor::compute_round_up_for_shorter_interval_case(\n cache, beta_minus_1);\n ret_value.exponent = minus_k;\n\n // When tie occurs, choose one of them according to the rule\n if (exponent >= float_info::shorter_interval_tie_lower_threshold &&\n exponent <= float_info::shorter_interval_tie_upper_threshold) {\n ret_value.significand = ret_value.significand % 2 == 0\n ? ret_value.significand\n : ret_value.significand - 1;\n } else if (ret_value.significand < xi) {\n ++ret_value.significand;\n }\n return ret_value;\n}\n\ntemplate decimal_fp to_decimal(T x) FMT_NOEXCEPT {\n // Step 1: integer promotion & Schubfach multiplier calculation.\n\n using carrier_uint = typename float_info::carrier_uint;\n using cache_entry_type = typename cache_accessor::cache_entry_type;\n auto br = bit_cast(x);\n\n // Extract significand bits and exponent bits.\n const carrier_uint significand_mask =\n (static_cast(1) << float_info::significand_bits) - 1;\n carrier_uint significand = (br & significand_mask);\n int exponent = static_cast((br & exponent_mask()) >>\n float_info::significand_bits);\n\n if (exponent != 0) { // Check if normal.\n exponent += float_info::exponent_bias - float_info::significand_bits;\n\n // Shorter interval case; proceed like Schubfach.\n if (significand == 0) return shorter_interval_case(exponent);\n\n significand |=\n (static_cast(1) << float_info::significand_bits);\n } else {\n // Subnormal case; the interval is always regular.\n if (significand == 0) return {0, 0};\n exponent = float_info::min_exponent - float_info::significand_bits;\n }\n\n const bool include_left_endpoint = (significand % 2 == 0);\n const bool include_right_endpoint = include_left_endpoint;\n\n // Compute k and beta.\n const int minus_k = floor_log10_pow2(exponent) - float_info::kappa;\n const cache_entry_type cache = cache_accessor::get_cached_power(-minus_k);\n const int beta_minus_1 = exponent + floor_log2_pow10(-minus_k);\n\n // Compute zi and deltai\n // 10^kappa <= deltai < 10^(kappa + 1)\n const uint32_t deltai = cache_accessor::compute_delta(cache, beta_minus_1);\n const carrier_uint two_fc = significand << 1;\n const carrier_uint two_fr = two_fc | 1;\n const carrier_uint zi =\n cache_accessor::compute_mul(two_fr << beta_minus_1, cache);\n\n // Step 2: Try larger divisor; remove trailing zeros if necessary\n\n // Using an upper bound on zi, we might be able to optimize the division\n // better than the compiler; we are computing zi / big_divisor here\n decimal_fp ret_value;\n ret_value.significand = divide_by_10_to_kappa_plus_1(zi);\n uint32_t r = static_cast(zi - float_info::big_divisor *\n ret_value.significand);\n\n if (r > deltai) {\n goto small_divisor_case_label;\n } else if (r < deltai) {\n // Exclude the right endpoint if necessary\n if (r == 0 && !include_right_endpoint &&\n is_endpoint_integer(two_fr, exponent, minus_k)) {\n --ret_value.significand;\n r = float_info::big_divisor;\n goto small_divisor_case_label;\n }\n } else {\n // r == deltai; compare fractional parts\n // Check conditions in the order different from the paper\n // to take advantage of short-circuiting\n const carrier_uint two_fl = two_fc - 1;\n if ((!include_left_endpoint ||\n !is_endpoint_integer(two_fl, exponent, minus_k)) &&\n !cache_accessor::compute_mul_parity(two_fl, cache, beta_minus_1)) {\n goto small_divisor_case_label;\n }\n }\n ret_value.exponent = minus_k + float_info::kappa + 1;\n\n // We may need to remove trailing zeros\n ret_value.exponent += remove_trailing_zeros(ret_value.significand);\n return ret_value;\n\n // Step 3: Find the significand with the smaller divisor\n\nsmall_divisor_case_label:\n ret_value.significand *= 10;\n ret_value.exponent = minus_k + float_info::kappa;\n\n const uint32_t mask = (1u << float_info::kappa) - 1;\n auto dist = r - (deltai / 2) + (float_info::small_divisor / 2);\n\n // Is dist divisible by 2^kappa?\n if ((dist & mask) == 0) {\n const bool approx_y_parity =\n ((dist ^ (float_info::small_divisor / 2)) & 1) != 0;\n dist >>= float_info::kappa;\n\n // Is dist divisible by 5^kappa?\n if (check_divisibility_and_divide_by_pow5::kappa>(dist)) {\n ret_value.significand += dist;\n\n // Check z^(f) >= epsilon^(f)\n // We have either yi == zi - epsiloni or yi == (zi - epsiloni) - 1,\n // where yi == zi - epsiloni if and only if z^(f) >= epsilon^(f)\n // Since there are only 2 possibilities, we only need to care about the\n // parity. Also, zi and r should have the same parity since the divisor\n // is an even number\n if (cache_accessor::compute_mul_parity(two_fc, cache, beta_minus_1) !=\n approx_y_parity) {\n --ret_value.significand;\n } else {\n // If z^(f) >= epsilon^(f), we might have a tie\n // when z^(f) == epsilon^(f), or equivalently, when y is an integer\n if (is_center_integer(two_fc, exponent, minus_k)) {\n ret_value.significand = ret_value.significand % 2 == 0\n ? ret_value.significand\n : ret_value.significand - 1;\n }\n }\n }\n // Is dist not divisible by 5^kappa?\n else {\n ret_value.significand += dist;\n }\n }\n // Is dist not divisible by 2^kappa?\n else {\n // Since we know dist is small, we might be able to optimize the division\n // better than the compiler; we are computing dist / small_divisor here\n ret_value.significand +=\n small_division_by_pow10::kappa>(dist);\n }\n return ret_value;\n}\n} // namespace dragonbox\n\n// Formats value using a variation of the Fixed-Precision Positive\n// Floating-Point Printout ((FPP)^2) algorithm by Steele & White:\n// https://fmt.dev/papers/p372-steele.pdf.\ntemplate \nvoid fallback_format(Double d, int num_digits, bool binary32, buffer& buf,\n int& exp10) {\n bigint numerator; // 2 * R in (FPP)^2.\n bigint denominator; // 2 * S in (FPP)^2.\n // lower and upper are differences between value and corresponding boundaries.\n bigint lower; // (M^- in (FPP)^2).\n bigint upper_store; // upper's value if different from lower.\n bigint* upper = nullptr; // (M^+ in (FPP)^2).\n fp value;\n // Shift numerator and denominator by an extra bit or two (if lower boundary\n // is closer) to make lower and upper integers. This eliminates multiplication\n // by 2 during later computations.\n const bool is_predecessor_closer =\n binary32 ? value.assign(static_cast(d)) : value.assign(d);\n int shift = is_predecessor_closer ? 2 : 1;\n uint64_t significand = value.f << shift;\n if (value.e >= 0) {\n numerator.assign(significand);\n numerator <<= value.e;\n lower.assign(1);\n lower <<= value.e;\n if (shift != 1) {\n upper_store.assign(1);\n upper_store <<= value.e + 1;\n upper = &upper_store;\n }\n denominator.assign_pow10(exp10);\n denominator <<= shift;\n } else if (exp10 < 0) {\n numerator.assign_pow10(-exp10);\n lower.assign(numerator);\n if (shift != 1) {\n upper_store.assign(numerator);\n upper_store <<= 1;\n upper = &upper_store;\n }\n numerator *= significand;\n denominator.assign(1);\n denominator <<= shift - value.e;\n } else {\n numerator.assign(significand);\n denominator.assign_pow10(exp10);\n denominator <<= shift - value.e;\n lower.assign(1);\n if (shift != 1) {\n upper_store.assign(1ULL << 1);\n upper = &upper_store;\n }\n }\n // Invariant: value == (numerator / denominator) * pow(10, exp10).\n if (num_digits < 0) {\n // Generate the shortest representation.\n if (!upper) upper = &lower;\n bool even = (value.f & 1) == 0;\n num_digits = 0;\n char* data = buf.data();\n for (;;) {\n int digit = numerator.divmod_assign(denominator);\n bool low = compare(numerator, lower) - even < 0; // numerator <[=] lower.\n // numerator + upper >[=] pow10:\n bool high = add_compare(numerator, *upper, denominator) + even > 0;\n data[num_digits++] = static_cast('0' + digit);\n if (low || high) {\n if (!low) {\n ++data[num_digits - 1];\n } else if (high) {\n int result = add_compare(numerator, numerator, denominator);\n // Round half to even.\n if (result > 0 || (result == 0 && (digit % 2) != 0))\n ++data[num_digits - 1];\n }\n buf.try_resize(to_unsigned(num_digits));\n exp10 -= num_digits - 1;\n return;\n }\n numerator *= 10;\n lower *= 10;\n if (upper != &lower) *upper *= 10;\n }\n }\n // Generate the given number of digits.\n exp10 -= num_digits - 1;\n if (num_digits == 0) {\n buf.try_resize(1);\n denominator *= 10;\n buf[0] = add_compare(numerator, numerator, denominator) > 0 ? '1' : '0';\n return;\n }\n buf.try_resize(to_unsigned(num_digits));\n for (int i = 0; i < num_digits - 1; ++i) {\n int digit = numerator.divmod_assign(denominator);\n buf[i] = static_cast('0' + digit);\n numerator *= 10;\n }\n int digit = numerator.divmod_assign(denominator);\n auto result = add_compare(numerator, numerator, denominator);\n if (result > 0 || (result == 0 && (digit % 2) != 0)) {\n if (digit == 9) {\n const auto overflow = '0' + 10;\n buf[num_digits - 1] = overflow;\n // Propagate the carry.\n for (int i = num_digits - 1; i > 0 && buf[i] == overflow; --i) {\n buf[i] = '0';\n ++buf[i - 1];\n }\n if (buf[0] == overflow) {\n buf[0] = '1';\n ++exp10;\n }\n return;\n }\n ++digit;\n }\n buf[num_digits - 1] = static_cast('0' + digit);\n}\n\ntemplate \nint format_float(T value, int precision, float_specs specs, buffer& buf) {\n static_assert(!std::is_same::value, \"\");\n FMT_ASSERT(value >= 0, \"value is negative\");\n\n const bool fixed = specs.format == float_format::fixed;\n if (value <= 0) { // <= instead of == to silence a warning.\n if (precision <= 0 || !fixed) {\n buf.push_back('0');\n return 0;\n }\n buf.try_resize(to_unsigned(precision));\n std::uninitialized_fill_n(buf.data(), precision, '0');\n return -precision;\n }\n\n if (!specs.use_grisu) return snprintf_float(value, precision, specs, buf);\n\n if (precision < 0) {\n // Use Dragonbox for the shortest format.\n if (specs.binary32) {\n auto dec = dragonbox::to_decimal(static_cast(value));\n write(buffer_appender(buf), dec.significand);\n return dec.exponent;\n }\n auto dec = dragonbox::to_decimal(static_cast(value));\n write(buffer_appender(buf), dec.significand);\n return dec.exponent;\n }\n\n // Use Grisu + Dragon4 for the given precision:\n // https://www.cs.tufts.edu/~nr/cs257/archive/florian-loitsch/printf.pdf.\n int exp = 0;\n const int min_exp = -60; // alpha in Grisu.\n int cached_exp10 = 0; // K in Grisu.\n fp normalized = normalize(fp(value));\n const auto cached_pow = get_cached_power(\n min_exp - (normalized.e + fp::significand_size), cached_exp10);\n normalized = normalized * cached_pow;\n // Limit precision to the maximum possible number of significant digits in an\n // IEEE754 double because we don't need to generate zeros.\n const int max_double_digits = 767;\n if (precision > max_double_digits) precision = max_double_digits;\n fixed_handler handler{buf.data(), 0, precision, -cached_exp10, fixed};\n if (grisu_gen_digits(normalized, 1, exp, handler) == digits::error) {\n exp += handler.size - cached_exp10 - 1;\n fallback_format(value, handler.precision, specs.binary32, buf, exp);\n } else {\n exp += handler.exp10;\n buf.try_resize(to_unsigned(handler.size));\n }\n if (!fixed && !specs.showpoint) {\n // Remove trailing zeros.\n auto num_digits = buf.size();\n while (num_digits > 0 && buf[num_digits - 1] == '0') {\n --num_digits;\n ++exp;\n }\n buf.try_resize(num_digits);\n }\n return exp;\n} // namespace detail\n\ntemplate \nint snprintf_float(T value, int precision, float_specs specs,\n buffer& buf) {\n // Buffer capacity must be non-zero, otherwise MSVC's vsnprintf_s will fail.\n FMT_ASSERT(buf.capacity() > buf.size(), \"empty buffer\");\n static_assert(!std::is_same::value, \"\");\n\n // Subtract 1 to account for the difference in precision since we use %e for\n // both general and exponent format.\n if (specs.format == float_format::general ||\n specs.format == float_format::exp)\n precision = (precision >= 0 ? precision : 6) - 1;\n\n // Build the format string.\n enum { max_format_size = 7 }; // The longest format is \"%#.*Le\".\n char format[max_format_size];\n char* format_ptr = format;\n *format_ptr++ = '%';\n if (specs.showpoint && specs.format == float_format::hex) *format_ptr++ = '#';\n if (precision >= 0) {\n *format_ptr++ = '.';\n *format_ptr++ = '*';\n }\n if (std::is_same()) *format_ptr++ = 'L';\n *format_ptr++ = specs.format != float_format::hex\n ? (specs.format == float_format::fixed ? 'f' : 'e')\n : (specs.upper ? 'A' : 'a');\n *format_ptr = '\\0';\n\n // Format using snprintf.\n auto offset = buf.size();\n for (;;) {\n auto begin = buf.data() + offset;\n auto capacity = buf.capacity() - offset;\n#ifdef FMT_FUZZ\n if (precision > 100000)\n throw std::runtime_error(\n \"fuzz mode - avoid large allocation inside snprintf\");\n#endif\n // Suppress the warning about a nonliteral format string.\n // Cannot use auto because of a bug in MinGW (#1532).\n int (*snprintf_ptr)(char*, size_t, const char*, ...) = FMT_SNPRINTF;\n int result = precision >= 0\n ? snprintf_ptr(begin, capacity, format, precision, value)\n : snprintf_ptr(begin, capacity, format, value);\n if (result < 0) {\n // The buffer will grow exponentially.\n buf.try_reserve(buf.capacity() + 1);\n continue;\n }\n auto size = to_unsigned(result);\n // Size equal to capacity means that the last character was truncated.\n if (size >= capacity) {\n buf.try_reserve(size + offset + 1); // Add 1 for the terminating '\\0'.\n continue;\n }\n auto is_digit = [](char c) { return c >= '0' && c <= '9'; };\n if (specs.format == float_format::fixed) {\n if (precision == 0) {\n buf.try_resize(size);\n return 0;\n }\n // Find and remove the decimal point.\n auto end = begin + size, p = end;\n do {\n --p;\n } while (is_digit(*p));\n int fraction_size = static_cast(end - p - 1);\n std::memmove(p, p + 1, to_unsigned(fraction_size));\n buf.try_resize(size - 1);\n return -fraction_size;\n }\n if (specs.format == float_format::hex) {\n buf.try_resize(size + offset);\n return 0;\n }\n // Find and parse the exponent.\n auto end = begin + size, exp_pos = end;\n do {\n --exp_pos;\n } while (*exp_pos != 'e');\n char sign = exp_pos[1];\n FMT_ASSERT(sign == '+' || sign == '-', \"\");\n int exp = 0;\n auto p = exp_pos + 2; // Skip 'e' and sign.\n do {\n FMT_ASSERT(is_digit(*p), \"\");\n exp = exp * 10 + (*p++ - '0');\n } while (p != end);\n if (sign == '-') exp = -exp;\n int fraction_size = 0;\n if (exp_pos != begin + 1) {\n // Remove trailing zeros.\n auto fraction_end = exp_pos - 1;\n while (*fraction_end == '0') --fraction_end;\n // Move the fractional part left to get rid of the decimal point.\n fraction_size = static_cast(fraction_end - begin - 1);\n std::memmove(begin + 1, begin + 2, to_unsigned(fraction_size));\n }\n buf.try_resize(to_unsigned(fraction_size) + offset + 1);\n return exp - fraction_size;\n }\n}\n} // namespace detail\n\ntemplate <> struct formatter {\n FMT_CONSTEXPR format_parse_context::iterator parse(\n format_parse_context& ctx) {\n return ctx.begin();\n }\n\n format_context::iterator format(const detail::bigint& n,\n format_context& ctx) {\n auto out = ctx.out();\n bool first = true;\n for (auto i = n.bigits_.size(); i > 0; --i) {\n auto value = n.bigits_[i - 1u];\n if (first) {\n out = format_to(out, FMT_STRING(\"{:x}\"), value);\n first = false;\n continue;\n }\n out = format_to(out, FMT_STRING(\"{:08x}\"), value);\n }\n if (n.exp_ > 0)\n out = format_to(out, FMT_STRING(\"p{}\"),\n n.exp_ * detail::bigint::bigit_bits);\n return out;\n }\n};\n\nFMT_FUNC detail::utf8_to_utf16::utf8_to_utf16(string_view s) {\n for_each_codepoint(s, [this](uint32_t cp, int error) {\n if (error != 0) FMT_THROW(std::runtime_error(\"invalid utf8\"));\n if (cp <= 0xFFFF) {\n buffer_.push_back(static_cast(cp));\n } else {\n cp -= 0x10000;\n buffer_.push_back(static_cast(0xD800 + (cp >> 10)));\n buffer_.push_back(static_cast(0xDC00 + (cp & 0x3FF)));\n }\n });\n buffer_.push_back(0);\n}\n\nFMT_FUNC void format_system_error(detail::buffer& out, int error_code,\n const char* message) FMT_NOEXCEPT {\n FMT_TRY {\n auto ec = std::error_code(error_code, std::generic_category());\n write(std::back_inserter(out), std::system_error(ec, message).what());\n return;\n }\n FMT_CATCH(...) {}\n format_error_code(out, error_code, message);\n}\n\nFMT_FUNC void detail::error_handler::on_error(const char* message) {\n FMT_THROW(format_error(message));\n}\n\nFMT_FUNC void report_system_error(int error_code,\n const char* message) FMT_NOEXCEPT {\n report_error(format_system_error, error_code, message);\n}\n\nFMT_FUNC std::string vformat(string_view fmt, format_args args) {\n // Don't optimize the \"{}\" case to keep the binary size small and because it\n // can be better optimized in fmt::format anyway.\n auto buffer = memory_buffer();\n detail::vformat_to(buffer, fmt, args);\n return to_string(buffer);\n}\n\n#ifdef _WIN32\nnamespace detail {\nusing dword = conditional_t;\nextern \"C\" __declspec(dllimport) int __stdcall WriteConsoleW( //\n void*, const void*, dword, dword*, void*);\n} // namespace detail\n#endif\n\nnamespace detail {\nFMT_FUNC void print(std::FILE* f, string_view text) {\n#ifdef _WIN32\n auto fd = _fileno(f);\n if (_isatty(fd)) {\n detail::utf8_to_utf16 u16(string_view(text.data(), text.size()));\n auto written = detail::dword();\n if (detail::WriteConsoleW(reinterpret_cast(_get_osfhandle(fd)),\n u16.c_str(), static_cast(u16.size()),\n &written, nullptr)) {\n return;\n }\n // Fallback to fwrite on failure. It can happen if the output has been\n // redirected to NUL.\n }\n#endif\n detail::fwrite_fully(text.data(), 1, text.size(), f);\n}\n} // namespace detail\n\nFMT_FUNC void vprint(std::FILE* f, string_view format_str, format_args args) {\n memory_buffer buffer;\n detail::vformat_to(buffer, format_str, args);\n detail::print(f, {buffer.data(), buffer.size()});\n}\n\n#ifdef _WIN32\n// Print assuming legacy (non-Unicode) encoding.\nFMT_FUNC void detail::vprint_mojibake(std::FILE* f, string_view format_str,\n format_args args) {\n memory_buffer buffer;\n detail::vformat_to(buffer, format_str,\n basic_format_args>(args));\n fwrite_fully(buffer.data(), 1, buffer.size(), f);\n}\n#endif\n\nFMT_FUNC void vprint(string_view format_str, format_args args) {\n vprint(stdout, format_str, args);\n}\n\nFMT_END_NAMESPACE\n\n#endif // FMT_FORMAT_INL_H_\n" }, { "path": "vendor/spdlog/include/spdlog/fmt/bundled/format.h", "content": "/*\n Formatting library for C++\n\n Copyright (c) 2012 - present, Victor Zverovich\n\n Permission is hereby granted, free of charge, to any person obtaining\n a copy of this software and associated documentation files (the\n \"Software\"), to deal in the Software without restriction, including\n without limitation the rights to use, copy, modify, merge, publish,\n distribute, sublicense, and/or sell copies of the Software, and to\n permit persons to whom the Software is furnished to do so, subject to\n the following conditions:\n\n The above copyright notice and this permission notice shall be\n included in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n --- Optional exception to the license ---\n\n As an exception, if, as a result of your compiling your source code, portions\n of this Software are embedded into a machine-executable object form of such\n source code, you may redistribute such embedded portions in such object form\n without including the above copyright and permission notices.\n */\n\n#ifndef FMT_FORMAT_H_\n#define FMT_FORMAT_H_\n\n#include // std::signbit\n#include // uint32_t\n#include // std::numeric_limits\n#include // std::uninitialized_copy\n#include // std::runtime_error\n#include // std::system_error\n#include // std::swap\n\n#include \"core.h\"\n\n#ifdef __INTEL_COMPILER\n# define FMT_ICC_VERSION __INTEL_COMPILER\n#elif defined(__ICL)\n# define FMT_ICC_VERSION __ICL\n#else\n# define FMT_ICC_VERSION 0\n#endif\n\n#ifdef __NVCC__\n# define FMT_CUDA_VERSION (__CUDACC_VER_MAJOR__ * 100 + __CUDACC_VER_MINOR__)\n#else\n# define FMT_CUDA_VERSION 0\n#endif\n\n#ifdef __has_builtin\n# define FMT_HAS_BUILTIN(x) __has_builtin(x)\n#else\n# define FMT_HAS_BUILTIN(x) 0\n#endif\n\n#if FMT_GCC_VERSION || FMT_CLANG_VERSION\n# define FMT_NOINLINE __attribute__((noinline))\n#else\n# define FMT_NOINLINE\n#endif\n\n#if FMT_MSC_VER\n# define FMT_MSC_DEFAULT = default\n#else\n# define FMT_MSC_DEFAULT\n#endif\n\n#ifndef FMT_THROW\n# if FMT_EXCEPTIONS\n# if FMT_MSC_VER || FMT_NVCC\nFMT_BEGIN_NAMESPACE\nnamespace detail {\ntemplate inline void do_throw(const Exception& x) {\n // Silence unreachable code warnings in MSVC and NVCC because these\n // are nearly impossible to fix in a generic code.\n volatile bool b = true;\n if (b) throw x;\n}\n} // namespace detail\nFMT_END_NAMESPACE\n# define FMT_THROW(x) detail::do_throw(x)\n# else\n# define FMT_THROW(x) throw x\n# endif\n# else\n# define FMT_THROW(x) \\\n do { \\\n FMT_ASSERT(false, (x).what()); \\\n } while (false)\n# endif\n#endif\n\n#if FMT_EXCEPTIONS\n# define FMT_TRY try\n# define FMT_CATCH(x) catch (x)\n#else\n# define FMT_TRY if (true)\n# define FMT_CATCH(x) if (false)\n#endif\n\n#ifndef FMT_DEPRECATED\n# if FMT_HAS_CPP14_ATTRIBUTE(deprecated) || FMT_MSC_VER >= 1900\n# define FMT_DEPRECATED [[deprecated]]\n# else\n# if (defined(__GNUC__) && !defined(__LCC__)) || defined(__clang__)\n# define FMT_DEPRECATED __attribute__((deprecated))\n# elif FMT_MSC_VER\n# define FMT_DEPRECATED __declspec(deprecated)\n# else\n# define FMT_DEPRECATED /* deprecated */\n# endif\n# endif\n#endif\n\n// Workaround broken [[deprecated]] in the Intel, PGI and NVCC compilers.\n#if FMT_ICC_VERSION || defined(__PGI) || FMT_NVCC\n# define FMT_DEPRECATED_ALIAS\n#else\n# define FMT_DEPRECATED_ALIAS FMT_DEPRECATED\n#endif\n\n#ifndef FMT_USE_USER_DEFINED_LITERALS\n// EDG based compilers (Intel, NVIDIA, Elbrus, etc), GCC and MSVC support UDLs.\n# if (FMT_HAS_FEATURE(cxx_user_literals) || FMT_GCC_VERSION >= 407 || \\\n FMT_MSC_VER >= 1900) && \\\n (!defined(__EDG_VERSION__) || __EDG_VERSION__ >= /* UDL feature */ 480)\n# define FMT_USE_USER_DEFINED_LITERALS 1\n# else\n# define FMT_USE_USER_DEFINED_LITERALS 0\n# endif\n#endif\n\n// Defining FMT_REDUCE_INT_INSTANTIATIONS to 1, will reduce the number of\n// integer formatter template instantiations to just one by only using the\n// largest integer type. This results in a reduction in binary size but will\n// cause a decrease in integer formatting performance.\n#if !defined(FMT_REDUCE_INT_INSTANTIATIONS)\n# define FMT_REDUCE_INT_INSTANTIATIONS 0\n#endif\n\n// __builtin_clz is broken in clang with Microsoft CodeGen:\n// https://github.com/fmtlib/fmt/issues/519\n#if (FMT_GCC_VERSION || FMT_HAS_BUILTIN(__builtin_clz)) && !FMT_MSC_VER\n# define FMT_BUILTIN_CLZ(n) __builtin_clz(n)\n#endif\n#if (FMT_GCC_VERSION || FMT_HAS_BUILTIN(__builtin_clzll)) && !FMT_MSC_VER\n# define FMT_BUILTIN_CLZLL(n) __builtin_clzll(n)\n#endif\n#if (FMT_GCC_VERSION || FMT_HAS_BUILTIN(__builtin_ctz))\n# define FMT_BUILTIN_CTZ(n) __builtin_ctz(n)\n#endif\n#if (FMT_GCC_VERSION || FMT_HAS_BUILTIN(__builtin_ctzll))\n# define FMT_BUILTIN_CTZLL(n) __builtin_ctzll(n)\n#endif\n\n#if FMT_MSC_VER\n# include // _BitScanReverse[64], _BitScanForward[64], _umul128\n#endif\n\n// Some compilers masquerade as both MSVC and GCC-likes or otherwise support\n// __builtin_clz and __builtin_clzll, so only define FMT_BUILTIN_CLZ using the\n// MSVC intrinsics if the clz and clzll builtins are not available.\n#if FMT_MSC_VER && !defined(FMT_BUILTIN_CLZLL) && !defined(FMT_BUILTIN_CTZLL)\nFMT_BEGIN_NAMESPACE\nnamespace detail {\n// Avoid Clang with Microsoft CodeGen's -Wunknown-pragmas warning.\n# if !defined(__clang__)\n# pragma managed(push, off)\n# pragma intrinsic(_BitScanForward)\n# pragma intrinsic(_BitScanReverse)\n# if defined(_WIN64)\n# pragma intrinsic(_BitScanForward64)\n# pragma intrinsic(_BitScanReverse64)\n# endif\n# endif\n\ninline auto clz(uint32_t x) -> int {\n unsigned long r = 0;\n _BitScanReverse(&r, x);\n FMT_ASSERT(x != 0, \"\");\n // Static analysis complains about using uninitialized data\n // \"r\", but the only way that can happen is if \"x\" is 0,\n // which the callers guarantee to not happen.\n FMT_MSC_WARNING(suppress : 6102)\n return 31 ^ static_cast(r);\n}\n# define FMT_BUILTIN_CLZ(n) detail::clz(n)\n\ninline auto clzll(uint64_t x) -> int {\n unsigned long r = 0;\n# ifdef _WIN64\n _BitScanReverse64(&r, x);\n# else\n // Scan the high 32 bits.\n if (_BitScanReverse(&r, static_cast(x >> 32))) return 63 ^ (r + 32);\n // Scan the low 32 bits.\n _BitScanReverse(&r, static_cast(x));\n# endif\n FMT_ASSERT(x != 0, \"\");\n FMT_MSC_WARNING(suppress : 6102) // Suppress a bogus static analysis warning.\n return 63 ^ static_cast(r);\n}\n# define FMT_BUILTIN_CLZLL(n) detail::clzll(n)\n\ninline auto ctz(uint32_t x) -> int {\n unsigned long r = 0;\n _BitScanForward(&r, x);\n FMT_ASSERT(x != 0, \"\");\n FMT_MSC_WARNING(suppress : 6102) // Suppress a bogus static analysis warning.\n return static_cast(r);\n}\n# define FMT_BUILTIN_CTZ(n) detail::ctz(n)\n\ninline auto ctzll(uint64_t x) -> int {\n unsigned long r = 0;\n FMT_ASSERT(x != 0, \"\");\n FMT_MSC_WARNING(suppress : 6102) // Suppress a bogus static analysis warning.\n# ifdef _WIN64\n _BitScanForward64(&r, x);\n# else\n // Scan the low 32 bits.\n if (_BitScanForward(&r, static_cast(x))) return static_cast(r);\n // Scan the high 32 bits.\n _BitScanForward(&r, static_cast(x >> 32));\n r += 32;\n# endif\n return static_cast(r);\n}\n# define FMT_BUILTIN_CTZLL(n) detail::ctzll(n)\n# if !defined(__clang__)\n# pragma managed(pop)\n# endif\n} // namespace detail\nFMT_END_NAMESPACE\n#endif\n\nFMT_BEGIN_NAMESPACE\nnamespace detail {\n\n#if __cplusplus >= 202002L || \\\n (__cplusplus >= 201709L && FMT_GCC_VERSION >= 1002)\n# define FMT_CONSTEXPR20 constexpr\n#else\n# define FMT_CONSTEXPR20\n#endif\n\n// An equivalent of `*reinterpret_cast(&source)` that doesn't have\n// undefined behavior (e.g. due to type aliasing).\n// Example: uint64_t d = bit_cast(2.718);\ntemplate \ninline auto bit_cast(const Source& source) -> Dest {\n static_assert(sizeof(Dest) == sizeof(Source), \"size mismatch\");\n Dest dest;\n std::memcpy(&dest, &source, sizeof(dest));\n return dest;\n}\n\ninline auto is_big_endian() -> bool {\n const auto u = 1u;\n struct bytes {\n char data[sizeof(u)];\n };\n return bit_cast(u).data[0] == 0;\n}\n\n// A fallback implementation of uintptr_t for systems that lack it.\nstruct fallback_uintptr {\n unsigned char value[sizeof(void*)];\n\n fallback_uintptr() = default;\n explicit fallback_uintptr(const void* p) {\n *this = bit_cast(p);\n if (is_big_endian()) {\n for (size_t i = 0, j = sizeof(void*) - 1; i < j; ++i, --j)\n std::swap(value[i], value[j]);\n }\n }\n};\n#ifdef UINTPTR_MAX\nusing uintptr_t = ::uintptr_t;\ninline auto to_uintptr(const void* p) -> uintptr_t {\n return bit_cast(p);\n}\n#else\nusing uintptr_t = fallback_uintptr;\ninline auto to_uintptr(const void* p) -> fallback_uintptr {\n return fallback_uintptr(p);\n}\n#endif\n\n// Returns the largest possible value for type T. Same as\n// std::numeric_limits::max() but shorter and not affected by the max macro.\ntemplate constexpr auto max_value() -> T {\n return (std::numeric_limits::max)();\n}\ntemplate constexpr auto num_bits() -> int {\n return std::numeric_limits::digits;\n}\n// std::numeric_limits::digits may return 0 for 128-bit ints.\ntemplate <> constexpr auto num_bits() -> int { return 128; }\ntemplate <> constexpr auto num_bits() -> int { return 128; }\ntemplate <> constexpr auto num_bits() -> int {\n return static_cast(sizeof(void*) *\n std::numeric_limits::digits);\n}\n\nFMT_INLINE void assume(bool condition) {\n (void)condition;\n#if FMT_HAS_BUILTIN(__builtin_assume)\n __builtin_assume(condition);\n#endif\n}\n\n// An approximation of iterator_t for pre-C++20 systems.\ntemplate \nusing iterator_t = decltype(std::begin(std::declval()));\ntemplate using sentinel_t = decltype(std::end(std::declval()));\n\n// A workaround for std::string not having mutable data() until C++17.\ntemplate \ninline auto get_data(std::basic_string& s) -> Char* {\n return &s[0];\n}\ntemplate \ninline auto get_data(Container& c) -> typename Container::value_type* {\n return c.data();\n}\n\n#if defined(_SECURE_SCL) && _SECURE_SCL\n// Make a checked iterator to avoid MSVC warnings.\ntemplate using checked_ptr = stdext::checked_array_iterator;\ntemplate auto make_checked(T* p, size_t size) -> checked_ptr {\n return {p, size};\n}\n#else\ntemplate using checked_ptr = T*;\ntemplate inline auto make_checked(T* p, size_t) -> T* { return p; }\n#endif\n\n// Attempts to reserve space for n extra characters in the output range.\n// Returns a pointer to the reserved range or a reference to it.\ntemplate ::value)>\n#if FMT_CLANG_VERSION >= 307 && !FMT_ICC_VERSION\n__attribute__((no_sanitize(\"undefined\")))\n#endif\ninline auto\nreserve(std::back_insert_iterator it, size_t n)\n -> checked_ptr {\n Container& c = get_container(it);\n size_t size = c.size();\n c.resize(size + n);\n return make_checked(get_data(c) + size, n);\n}\n\ntemplate \ninline auto reserve(buffer_appender it, size_t n) -> buffer_appender {\n buffer& buf = get_container(it);\n buf.try_reserve(buf.size() + n);\n return it;\n}\n\ntemplate \nconstexpr auto reserve(Iterator& it, size_t) -> Iterator& {\n return it;\n}\n\ntemplate \nusing reserve_iterator =\n remove_reference_t(), 0))>;\n\ntemplate \nconstexpr auto to_pointer(OutputIt, size_t) -> T* {\n return nullptr;\n}\ntemplate auto to_pointer(buffer_appender it, size_t n) -> T* {\n buffer& buf = get_container(it);\n auto size = buf.size();\n if (buf.capacity() < size + n) return nullptr;\n buf.try_resize(size + n);\n return buf.data() + size;\n}\n\ntemplate ::value)>\ninline auto base_iterator(std::back_insert_iterator& it,\n checked_ptr)\n -> std::back_insert_iterator {\n return it;\n}\n\ntemplate \nconstexpr auto base_iterator(Iterator, Iterator it) -> Iterator {\n return it;\n}\n\n// is spectacularly slow to compile in C++20 so use a simple fill_n\n// instead (#1998).\ntemplate \nFMT_CONSTEXPR auto fill_n(OutputIt out, Size count, const T& value)\n -> OutputIt {\n for (Size i = 0; i < count; ++i) *out++ = value;\n return out;\n}\ntemplate \nFMT_CONSTEXPR20 auto fill_n(T* out, Size count, char value) -> T* {\n if (is_constant_evaluated()) {\n return fill_n(out, count, value);\n }\n std::memset(out, value, to_unsigned(count));\n return out + count;\n}\n\n#ifdef __cpp_char8_t\nusing char8_type = char8_t;\n#else\nenum char8_type : unsigned char {};\n#endif\n\ntemplate \nFMT_CONSTEXPR FMT_NOINLINE auto copy_str_noinline(InputIt begin, InputIt end,\n OutputIt out) -> OutputIt {\n return copy_str(begin, end, out);\n}\n\n// A public domain branchless UTF-8 decoder by Christopher Wellons:\n// https://github.com/skeeto/branchless-utf8\n/* Decode the next character, c, from s, reporting errors in e.\n *\n * Since this is a branchless decoder, four bytes will be read from the\n * buffer regardless of the actual length of the next character. This\n * means the buffer _must_ have at least three bytes of zero padding\n * following the end of the data stream.\n *\n * Errors are reported in e, which will be non-zero if the parsed\n * character was somehow invalid: invalid byte sequence, non-canonical\n * encoding, or a surrogate half.\n *\n * The function returns a pointer to the next character. When an error\n * occurs, this pointer will be a guess that depends on the particular\n * error, but it will always advance at least one byte.\n */\nFMT_CONSTEXPR inline auto utf8_decode(const char* s, uint32_t* c, int* e)\n -> const char* {\n constexpr const int masks[] = {0x00, 0x7f, 0x1f, 0x0f, 0x07};\n constexpr const uint32_t mins[] = {4194304, 0, 128, 2048, 65536};\n constexpr const int shiftc[] = {0, 18, 12, 6, 0};\n constexpr const int shifte[] = {0, 6, 4, 2, 0};\n\n int len = code_point_length(s);\n const char* next = s + len;\n\n // Assume a four-byte character and load four bytes. Unused bits are\n // shifted out.\n *c = uint32_t(s[0] & masks[len]) << 18;\n *c |= uint32_t(s[1] & 0x3f) << 12;\n *c |= uint32_t(s[2] & 0x3f) << 6;\n *c |= uint32_t(s[3] & 0x3f) << 0;\n *c >>= shiftc[len];\n\n // Accumulate the various error conditions.\n using uchar = unsigned char;\n *e = (*c < mins[len]) << 6; // non-canonical encoding\n *e |= ((*c >> 11) == 0x1b) << 7; // surrogate half?\n *e |= (*c > 0x10FFFF) << 8; // out of range?\n *e |= (uchar(s[1]) & 0xc0) >> 2;\n *e |= (uchar(s[2]) & 0xc0) >> 4;\n *e |= uchar(s[3]) >> 6;\n *e ^= 0x2a; // top two bits of each tail byte correct?\n *e >>= shifte[len];\n\n return next;\n}\n\ntemplate \nFMT_CONSTEXPR void for_each_codepoint(string_view s, F f) {\n auto decode = [f](const char* p) {\n auto cp = uint32_t();\n auto error = 0;\n p = utf8_decode(p, &cp, &error);\n f(cp, error);\n return p;\n };\n auto p = s.data();\n const size_t block_size = 4; // utf8_decode always reads blocks of 4 chars.\n if (s.size() >= block_size) {\n for (auto end = p + s.size() - block_size + 1; p < end;) p = decode(p);\n }\n if (auto num_chars_left = s.data() + s.size() - p) {\n char buf[2 * block_size - 1] = {};\n copy_str(p, p + num_chars_left, buf);\n p = buf;\n do {\n p = decode(p);\n } while (p - buf < num_chars_left);\n }\n}\n\ntemplate \ninline auto compute_width(basic_string_view s) -> size_t {\n return s.size();\n}\n\n// Computes approximate display width of a UTF-8 string.\nFMT_CONSTEXPR inline size_t compute_width(string_view s) {\n size_t num_code_points = 0;\n // It is not a lambda for compatibility with C++14.\n struct count_code_points {\n size_t* count;\n FMT_CONSTEXPR void operator()(uint32_t cp, int error) const {\n *count += detail::to_unsigned(\n 1 +\n (error == 0 && cp >= 0x1100 &&\n (cp <= 0x115f || // Hangul Jamo init. consonants\n cp == 0x2329 || // LEFT-POINTING ANGLE BRACKET〈\n cp == 0x232a || // RIGHT-POINTING ANGLE BRACKET 〉\n // CJK ... Yi except Unicode Character “〿”:\n (cp >= 0x2e80 && cp <= 0xa4cf && cp != 0x303f) ||\n (cp >= 0xac00 && cp <= 0xd7a3) || // Hangul Syllables\n (cp >= 0xf900 && cp <= 0xfaff) || // CJK Compatibility Ideographs\n (cp >= 0xfe10 && cp <= 0xfe19) || // Vertical Forms\n (cp >= 0xfe30 && cp <= 0xfe6f) || // CJK Compatibility Forms\n (cp >= 0xff00 && cp <= 0xff60) || // Fullwidth Forms\n (cp >= 0xffe0 && cp <= 0xffe6) || // Fullwidth Forms\n (cp >= 0x20000 && cp <= 0x2fffd) || // CJK\n (cp >= 0x30000 && cp <= 0x3fffd) ||\n // Miscellaneous Symbols and Pictographs + Emoticons:\n (cp >= 0x1f300 && cp <= 0x1f64f) ||\n // Supplemental Symbols and Pictographs:\n (cp >= 0x1f900 && cp <= 0x1f9ff))));\n }\n };\n for_each_codepoint(s, count_code_points{&num_code_points});\n return num_code_points;\n}\n\ninline auto compute_width(basic_string_view s) -> size_t {\n return compute_width(basic_string_view(\n reinterpret_cast(s.data()), s.size()));\n}\n\ntemplate \ninline auto code_point_index(basic_string_view s, size_t n) -> size_t {\n size_t size = s.size();\n return n < size ? n : size;\n}\n\n// Calculates the index of the nth code point in a UTF-8 string.\ninline auto code_point_index(basic_string_view s, size_t n)\n -> size_t {\n const char8_type* data = s.data();\n size_t num_code_points = 0;\n for (size_t i = 0, size = s.size(); i != size; ++i) {\n if ((data[i] & 0xc0) != 0x80 && ++num_code_points > n) return i;\n }\n return s.size();\n}\n\ntemplate \nusing is_fast_float = bool_constant::is_iec559 &&\n sizeof(T) <= sizeof(double)>;\n\n#ifndef FMT_USE_FULL_CACHE_DRAGONBOX\n# define FMT_USE_FULL_CACHE_DRAGONBOX 0\n#endif\n\ntemplate \ntemplate \nvoid buffer::append(const U* begin, const U* end) {\n while (begin != end) {\n auto count = to_unsigned(end - begin);\n try_reserve(size_ + count);\n auto free_cap = capacity_ - size_;\n if (free_cap < count) count = free_cap;\n std::uninitialized_copy_n(begin, count, make_checked(ptr_ + size_, count));\n size_ += count;\n begin += count;\n }\n}\n\ntemplate \nstruct is_locale : std::false_type {};\ntemplate \nstruct is_locale> : std::true_type {};\n} // namespace detail\n\nFMT_MODULE_EXPORT_BEGIN\n\n// The number of characters to store in the basic_memory_buffer object itself\n// to avoid dynamic memory allocation.\nenum { inline_buffer_size = 500 };\n\n/**\n \\rst\n A dynamically growing memory buffer for trivially copyable/constructible types\n with the first ``SIZE`` elements stored in the object itself.\n\n You can use the ```memory_buffer`` type alias for ``char`` instead.\n\n **Example**::\n\n fmt::memory_buffer out;\n format_to(out, \"The answer is {}.\", 42);\n\n This will append the following output to the ``out`` object:\n\n .. code-block:: none\n\n The answer is 42.\n\n The output can be converted to an ``std::string`` with ``to_string(out)``.\n \\endrst\n */\ntemplate >\nclass basic_memory_buffer final : public detail::buffer {\n private:\n T store_[SIZE];\n\n // Don't inherit from Allocator avoid generating type_info for it.\n Allocator alloc_;\n\n // Deallocate memory allocated by the buffer.\n void deallocate() {\n T* data = this->data();\n if (data != store_) alloc_.deallocate(data, this->capacity());\n }\n\n protected:\n void grow(size_t size) final FMT_OVERRIDE;\n\n public:\n using value_type = T;\n using const_reference = const T&;\n\n explicit basic_memory_buffer(const Allocator& alloc = Allocator())\n : alloc_(alloc) {\n this->set(store_, SIZE);\n }\n ~basic_memory_buffer() { deallocate(); }\n\n private:\n // Move data from other to this buffer.\n void move(basic_memory_buffer& other) {\n alloc_ = std::move(other.alloc_);\n T* data = other.data();\n size_t size = other.size(), capacity = other.capacity();\n if (data == other.store_) {\n this->set(store_, capacity);\n std::uninitialized_copy(other.store_, other.store_ + size,\n detail::make_checked(store_, capacity));\n } else {\n this->set(data, capacity);\n // Set pointer to the inline array so that delete is not called\n // when deallocating.\n other.set(other.store_, 0);\n }\n this->resize(size);\n }\n\n public:\n /**\n \\rst\n Constructs a :class:`fmt::basic_memory_buffer` object moving the content\n of the other object to it.\n \\endrst\n */\n basic_memory_buffer(basic_memory_buffer&& other) FMT_NOEXCEPT { move(other); }\n\n /**\n \\rst\n Moves the content of the other ``basic_memory_buffer`` object to this one.\n \\endrst\n */\n auto operator=(basic_memory_buffer&& other) FMT_NOEXCEPT\n -> basic_memory_buffer& {\n FMT_ASSERT(this != &other, \"\");\n deallocate();\n move(other);\n return *this;\n }\n\n // Returns a copy of the allocator associated with this buffer.\n auto get_allocator() const -> Allocator { return alloc_; }\n\n /**\n Resizes the buffer to contain *count* elements. If T is a POD type new\n elements may not be initialized.\n */\n void resize(size_t count) { this->try_resize(count); }\n\n /** Increases the buffer capacity to *new_capacity*. */\n void reserve(size_t new_capacity) { this->try_reserve(new_capacity); }\n\n // Directly append data into the buffer\n using detail::buffer::append;\n template \n void append(const ContiguousRange& range) {\n append(range.data(), range.data() + range.size());\n }\n};\n\ntemplate \nvoid basic_memory_buffer::grow(size_t size) {\n#ifdef FMT_FUZZ\n if (size > 5000) throw std::runtime_error(\"fuzz mode - won't grow that much\");\n#endif\n const size_t max_size = std::allocator_traits::max_size(alloc_);\n size_t old_capacity = this->capacity();\n size_t new_capacity = old_capacity + old_capacity / 2;\n if (size > new_capacity)\n new_capacity = size;\n else if (new_capacity > max_size)\n new_capacity = size > max_size ? size : max_size;\n T* old_data = this->data();\n T* new_data =\n std::allocator_traits::allocate(alloc_, new_capacity);\n // The following code doesn't throw, so the raw pointer above doesn't leak.\n std::uninitialized_copy(old_data, old_data + this->size(),\n detail::make_checked(new_data, new_capacity));\n this->set(new_data, new_capacity);\n // deallocate must not throw according to the standard, but even if it does,\n // the buffer already uses the new storage and will deallocate it in\n // destructor.\n if (old_data != store_) alloc_.deallocate(old_data, old_capacity);\n}\n\nusing memory_buffer = basic_memory_buffer;\n\ntemplate \nstruct is_contiguous> : std::true_type {\n};\n\nnamespace detail {\nFMT_API void print(std::FILE*, string_view);\n}\n\n/** A formatting error such as invalid format string. */\nFMT_CLASS_API\nclass FMT_API format_error : public std::runtime_error {\n public:\n explicit format_error(const char* message) : std::runtime_error(message) {}\n explicit format_error(const std::string& message)\n : std::runtime_error(message) {}\n format_error(const format_error&) = default;\n format_error& operator=(const format_error&) = default;\n format_error(format_error&&) = default;\n format_error& operator=(format_error&&) = default;\n ~format_error() FMT_NOEXCEPT FMT_OVERRIDE FMT_MSC_DEFAULT;\n};\n\n/**\n \\rst\n Constructs a `~fmt::format_arg_store` object that contains references\n to arguments and can be implicitly converted to `~fmt::format_args`.\n If ``fmt`` is a compile-time string then `make_args_checked` checks\n its validity at compile time.\n \\endrst\n */\ntemplate >\nFMT_INLINE auto make_args_checked(const S& fmt,\n const remove_reference_t&... args)\n -> format_arg_store, remove_reference_t...> {\n static_assert(\n detail::count<(\n std::is_base_of>::value &&\n std::is_reference::value)...>() == 0,\n \"passing views as lvalues is disallowed\");\n detail::check_format_string(fmt);\n return {args...};\n}\n\n// compile-time support\nnamespace detail_exported {\n#if FMT_USE_NONTYPE_TEMPLATE_PARAMETERS\ntemplate struct fixed_string {\n constexpr fixed_string(const Char (&str)[N]) {\n detail::copy_str(static_cast(str),\n str + N, data);\n }\n Char data[N]{};\n};\n#endif\n\n// Converts a compile-time string to basic_string_view.\ntemplate \nconstexpr auto compile_string_to_view(const Char (&s)[N])\n -> basic_string_view {\n // Remove trailing NUL character if needed. Won't be present if this is used\n // with a raw character array (i.e. not defined as a string).\n return {s, N - (std::char_traits::to_int_type(s[N - 1]) == 0 ? 1 : 0)};\n}\ntemplate \nconstexpr auto compile_string_to_view(detail::std_string_view s)\n -> basic_string_view {\n return {s.data(), s.size()};\n}\n} // namespace detail_exported\n\nFMT_BEGIN_DETAIL_NAMESPACE\n\ninline void throw_format_error(const char* message) {\n FMT_THROW(format_error(message));\n}\n\ntemplate struct is_integral : std::is_integral {};\ntemplate <> struct is_integral : std::true_type {};\ntemplate <> struct is_integral : std::true_type {};\n\ntemplate \nusing is_signed =\n std::integral_constant::is_signed ||\n std::is_same::value>;\n\n// Returns true if value is negative, false otherwise.\n// Same as `value < 0` but doesn't produce warnings if T is an unsigned type.\ntemplate ::value)>\nFMT_CONSTEXPR auto is_negative(T value) -> bool {\n return value < 0;\n}\ntemplate ::value)>\nFMT_CONSTEXPR auto is_negative(T) -> bool {\n return false;\n}\n\ntemplate ::value)>\nFMT_CONSTEXPR auto is_supported_floating_point(T) -> uint16_t {\n return (std::is_same::value && FMT_USE_FLOAT) ||\n (std::is_same::value && FMT_USE_DOUBLE) ||\n (std::is_same::value && FMT_USE_LONG_DOUBLE);\n}\n\n// Smallest of uint32_t, uint64_t, uint128_t that is large enough to\n// represent all values of an integral type T.\ntemplate \nusing uint32_or_64_or_128_t =\n conditional_t() <= 32 && !FMT_REDUCE_INT_INSTANTIATIONS,\n uint32_t,\n conditional_t() <= 64, uint64_t, uint128_t>>;\ntemplate \nusing uint64_or_128_t = conditional_t() <= 64, uint64_t, uint128_t>;\n\n#define FMT_POWERS_OF_10(factor) \\\n factor * 10, (factor)*100, (factor)*1000, (factor)*10000, (factor)*100000, \\\n (factor)*1000000, (factor)*10000000, (factor)*100000000, \\\n (factor)*1000000000\n\n// Static data is placed in this class template for the header-only config.\ntemplate struct basic_data {\n // log10(2) = 0x0.4d104d427de7fbcc...\n static const uint64_t log10_2_significand = 0x4d104d427de7fbcc;\n\n // GCC generates slightly better code for pairs than chars.\n FMT_API static constexpr const char digits[][2] = {\n {'0', '0'}, {'0', '1'}, {'0', '2'}, {'0', '3'}, {'0', '4'}, {'0', '5'},\n {'0', '6'}, {'0', '7'}, {'0', '8'}, {'0', '9'}, {'1', '0'}, {'1', '1'},\n {'1', '2'}, {'1', '3'}, {'1', '4'}, {'1', '5'}, {'1', '6'}, {'1', '7'},\n {'1', '8'}, {'1', '9'}, {'2', '0'}, {'2', '1'}, {'2', '2'}, {'2', '3'},\n {'2', '4'}, {'2', '5'}, {'2', '6'}, {'2', '7'}, {'2', '8'}, {'2', '9'},\n {'3', '0'}, {'3', '1'}, {'3', '2'}, {'3', '3'}, {'3', '4'}, {'3', '5'},\n {'3', '6'}, {'3', '7'}, {'3', '8'}, {'3', '9'}, {'4', '0'}, {'4', '1'},\n {'4', '2'}, {'4', '3'}, {'4', '4'}, {'4', '5'}, {'4', '6'}, {'4', '7'},\n {'4', '8'}, {'4', '9'}, {'5', '0'}, {'5', '1'}, {'5', '2'}, {'5', '3'},\n {'5', '4'}, {'5', '5'}, {'5', '6'}, {'5', '7'}, {'5', '8'}, {'5', '9'},\n {'6', '0'}, {'6', '1'}, {'6', '2'}, {'6', '3'}, {'6', '4'}, {'6', '5'},\n {'6', '6'}, {'6', '7'}, {'6', '8'}, {'6', '9'}, {'7', '0'}, {'7', '1'},\n {'7', '2'}, {'7', '3'}, {'7', '4'}, {'7', '5'}, {'7', '6'}, {'7', '7'},\n {'7', '8'}, {'7', '9'}, {'8', '0'}, {'8', '1'}, {'8', '2'}, {'8', '3'},\n {'8', '4'}, {'8', '5'}, {'8', '6'}, {'8', '7'}, {'8', '8'}, {'8', '9'},\n {'9', '0'}, {'9', '1'}, {'9', '2'}, {'9', '3'}, {'9', '4'}, {'9', '5'},\n {'9', '6'}, {'9', '7'}, {'9', '8'}, {'9', '9'}};\n\n FMT_API static constexpr const char hex_digits[] = \"0123456789abcdef\";\n FMT_API static constexpr const char signs[] = {0, '-', '+', ' '};\n FMT_API static constexpr const unsigned prefixes[4] = {0, 0, 0x1000000u | '+',\n 0x1000000u | ' '};\n FMT_API static constexpr const char left_padding_shifts[] = {31, 31, 0, 1, 0};\n FMT_API static constexpr const char right_padding_shifts[] = {0, 31, 0, 1, 0};\n};\n\n#ifdef FMT_SHARED\n// Required for -flto, -fivisibility=hidden and -shared to work\nextern template struct basic_data;\n#endif\n\n// This is a struct rather than an alias to avoid shadowing warnings in gcc.\nstruct data : basic_data<> {};\n\ntemplate FMT_CONSTEXPR auto count_digits_fallback(T n) -> int {\n int count = 1;\n for (;;) {\n // Integer division is slow so do it for a group of four digits instead\n // of for every digit. The idea comes from the talk by Alexandrescu\n // \"Three Optimization Tips for C++\". See speed-test for a comparison.\n if (n < 10) return count;\n if (n < 100) return count + 1;\n if (n < 1000) return count + 2;\n if (n < 10000) return count + 3;\n n /= 10000u;\n count += 4;\n }\n}\n#if FMT_USE_INT128\nFMT_CONSTEXPR inline auto count_digits(uint128_t n) -> int {\n return count_digits_fallback(n);\n}\n#endif\n\n// Returns the number of decimal digits in n. Leading zeros are not counted\n// except for n == 0 in which case count_digits returns 1.\nFMT_CONSTEXPR20 inline auto count_digits(uint64_t n) -> int {\n#ifdef FMT_BUILTIN_CLZLL\n if (!is_constant_evaluated()) {\n // https://github.com/fmtlib/format-benchmark/blob/master/digits10\n // Maps bsr(n) to ceil(log10(pow(2, bsr(n) + 1) - 1)).\n constexpr uint16_t bsr2log10[] = {\n 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5,\n 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10,\n 10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 15, 15,\n 15, 16, 16, 16, 16, 17, 17, 17, 18, 18, 18, 19, 19, 19, 19, 20};\n auto t = bsr2log10[FMT_BUILTIN_CLZLL(n | 1) ^ 63];\n constexpr const uint64_t zero_or_powers_of_10[] = {\n 0, 0, FMT_POWERS_OF_10(1U), FMT_POWERS_OF_10(1000000000ULL),\n 10000000000000000000ULL};\n return t - (n < zero_or_powers_of_10[t]);\n }\n#endif\n return count_digits_fallback(n);\n}\n\n// Counts the number of digits in n. BITS = log2(radix).\ntemplate \nFMT_CONSTEXPR auto count_digits(UInt n) -> int {\n#ifdef FMT_BUILTIN_CLZ\n if (num_bits() == 32)\n return (FMT_BUILTIN_CLZ(static_cast(n) | 1) ^ 31) / BITS + 1;\n#endif\n int num_digits = 0;\n do {\n ++num_digits;\n } while ((n >>= BITS) != 0);\n return num_digits;\n}\n\ntemplate <> auto count_digits<4>(detail::fallback_uintptr n) -> int;\n\n// It is a separate function rather than a part of count_digits to workaround\n// the lack of static constexpr in constexpr functions.\nFMT_INLINE uint64_t count_digits_inc(int n) {\n // An optimization by Kendall Willets from https://bit.ly/3uOIQrB.\n // This increments the upper 32 bits (log10(T) - 1) when >= T is added.\n#define FMT_INC(T) (((sizeof(#T) - 1ull) << 32) - T)\n static constexpr uint64_t table[] = {\n FMT_INC(0), FMT_INC(0), FMT_INC(0), // 8\n FMT_INC(10), FMT_INC(10), FMT_INC(10), // 64\n FMT_INC(100), FMT_INC(100), FMT_INC(100), // 512\n FMT_INC(1000), FMT_INC(1000), FMT_INC(1000), // 4096\n FMT_INC(10000), FMT_INC(10000), FMT_INC(10000), // 32k\n FMT_INC(100000), FMT_INC(100000), FMT_INC(100000), // 256k\n FMT_INC(1000000), FMT_INC(1000000), FMT_INC(1000000), // 2048k\n FMT_INC(10000000), FMT_INC(10000000), FMT_INC(10000000), // 16M\n FMT_INC(100000000), FMT_INC(100000000), FMT_INC(100000000), // 128M\n FMT_INC(1000000000), FMT_INC(1000000000), FMT_INC(1000000000), // 1024M\n FMT_INC(1000000000), FMT_INC(1000000000) // 4B\n };\n return table[n];\n}\n\n// Optional version of count_digits for better performance on 32-bit platforms.\nFMT_CONSTEXPR20 inline auto count_digits(uint32_t n) -> int {\n#ifdef FMT_BUILTIN_CLZ\n if (!is_constant_evaluated()) {\n auto inc = count_digits_inc(FMT_BUILTIN_CLZ(n | 1) ^ 31);\n return static_cast((n + inc) >> 32);\n }\n#endif\n return count_digits_fallback(n);\n}\n\ntemplate constexpr auto digits10() FMT_NOEXCEPT -> int {\n return std::numeric_limits::digits10;\n}\ntemplate <> constexpr auto digits10() FMT_NOEXCEPT -> int {\n return 38;\n}\ntemplate <> constexpr auto digits10() FMT_NOEXCEPT -> int {\n return 38;\n}\n\ntemplate struct thousands_sep_result {\n std::string grouping;\n Char thousands_sep;\n};\n\ntemplate \nFMT_API auto thousands_sep_impl(locale_ref loc) -> thousands_sep_result;\ntemplate \ninline auto thousands_sep(locale_ref loc) -> thousands_sep_result {\n auto result = thousands_sep_impl(loc);\n return {result.grouping, Char(result.thousands_sep)};\n}\ntemplate <>\ninline auto thousands_sep(locale_ref loc) -> thousands_sep_result {\n return thousands_sep_impl(loc);\n}\n\ntemplate \nFMT_API auto decimal_point_impl(locale_ref loc) -> Char;\ntemplate inline auto decimal_point(locale_ref loc) -> Char {\n return Char(decimal_point_impl(loc));\n}\ntemplate <> inline auto decimal_point(locale_ref loc) -> wchar_t {\n return decimal_point_impl(loc);\n}\n\n// Compares two characters for equality.\ntemplate auto equal2(const Char* lhs, const char* rhs) -> bool {\n return lhs[0] == rhs[0] && lhs[1] == rhs[1];\n}\ninline auto equal2(const char* lhs, const char* rhs) -> bool {\n return memcmp(lhs, rhs, 2) == 0;\n}\n\n// Copies two characters from src to dst.\ntemplate void copy2(Char* dst, const char* src) {\n *dst++ = static_cast(*src++);\n *dst = static_cast(*src);\n}\nFMT_INLINE void copy2(char* dst, const char* src) { memcpy(dst, src, 2); }\n\ntemplate struct format_decimal_result {\n Iterator begin;\n Iterator end;\n};\n\n// Formats a decimal unsigned integer value writing into out pointing to a\n// buffer of specified size. The caller must ensure that the buffer is large\n// enough.\ntemplate \nFMT_CONSTEXPR20 auto format_decimal(Char* out, UInt value, int size)\n -> format_decimal_result {\n FMT_ASSERT(size >= count_digits(value), \"invalid digit count\");\n out += size;\n Char* end = out;\n if (is_constant_evaluated()) {\n while (value >= 10) {\n *--out = static_cast('0' + value % 10);\n value /= 10;\n }\n *--out = static_cast('0' + value);\n return {out, end};\n }\n while (value >= 100) {\n // Integer division is slow so do it for a group of two digits instead\n // of for every digit. The idea comes from the talk by Alexandrescu\n // \"Three Optimization Tips for C++\". See speed-test for a comparison.\n out -= 2;\n copy2(out, data::digits[value % 100]);\n value /= 100;\n }\n if (value < 10) {\n *--out = static_cast('0' + value);\n return {out, end};\n }\n out -= 2;\n copy2(out, data::digits[value]);\n return {out, end};\n}\n\ntemplate >::value)>\ninline auto format_decimal(Iterator out, UInt value, int size)\n -> format_decimal_result {\n // Buffer is large enough to hold all digits (digits10 + 1).\n Char buffer[digits10() + 1];\n auto end = format_decimal(buffer, value, size).end;\n return {out, detail::copy_str_noinline(buffer, end, out)};\n}\n\ntemplate \nFMT_CONSTEXPR auto format_uint(Char* buffer, UInt value, int num_digits,\n bool upper = false) -> Char* {\n buffer += num_digits;\n Char* end = buffer;\n do {\n const char* digits = upper ? \"0123456789ABCDEF\" : data::hex_digits;\n unsigned digit = (value & ((1 << BASE_BITS) - 1));\n *--buffer = static_cast(BASE_BITS < 4 ? static_cast('0' + digit)\n : digits[digit]);\n } while ((value >>= BASE_BITS) != 0);\n return end;\n}\n\ntemplate \nauto format_uint(Char* buffer, detail::fallback_uintptr n, int num_digits,\n bool = false) -> Char* {\n auto char_digits = std::numeric_limits::digits / 4;\n int start = (num_digits + char_digits - 1) / char_digits - 1;\n if (int start_digits = num_digits % char_digits) {\n unsigned value = n.value[start--];\n buffer = format_uint(buffer, value, start_digits);\n }\n for (; start >= 0; --start) {\n unsigned value = n.value[start];\n buffer += char_digits;\n auto p = buffer;\n for (int i = 0; i < char_digits; ++i) {\n unsigned digit = (value & ((1 << BASE_BITS) - 1));\n *--p = static_cast(data::hex_digits[digit]);\n value >>= BASE_BITS;\n }\n }\n return buffer;\n}\n\ntemplate \ninline auto format_uint(It out, UInt value, int num_digits, bool upper = false)\n -> It {\n if (auto ptr = to_pointer(out, to_unsigned(num_digits))) {\n format_uint(ptr, value, num_digits, upper);\n return out;\n }\n // Buffer should be large enough to hold all digits (digits / BASE_BITS + 1).\n char buffer[num_bits() / BASE_BITS + 1];\n format_uint(buffer, value, num_digits, upper);\n return detail::copy_str_noinline(buffer, buffer + num_digits, out);\n}\n\n// A converter from UTF-8 to UTF-16.\nclass utf8_to_utf16 {\n private:\n basic_memory_buffer buffer_;\n\n public:\n FMT_API explicit utf8_to_utf16(string_view s);\n operator basic_string_view() const { return {&buffer_[0], size()}; }\n auto size() const -> size_t { return buffer_.size() - 1; }\n auto c_str() const -> const wchar_t* { return &buffer_[0]; }\n auto str() const -> std::wstring { return {&buffer_[0], size()}; }\n};\n\nnamespace dragonbox {\n\n// Type-specific information that Dragonbox uses.\ntemplate struct float_info;\n\ntemplate <> struct float_info {\n using carrier_uint = uint32_t;\n static const int significand_bits = 23;\n static const int exponent_bits = 8;\n static const int min_exponent = -126;\n static const int max_exponent = 127;\n static const int exponent_bias = -127;\n static const int decimal_digits = 9;\n static const int kappa = 1;\n static const int big_divisor = 100;\n static const int small_divisor = 10;\n static const int min_k = -31;\n static const int max_k = 46;\n static const int cache_bits = 64;\n static const int divisibility_check_by_5_threshold = 39;\n static const int case_fc_pm_half_lower_threshold = -1;\n static const int case_fc_pm_half_upper_threshold = 6;\n static const int case_fc_lower_threshold = -2;\n static const int case_fc_upper_threshold = 6;\n static const int case_shorter_interval_left_endpoint_lower_threshold = 2;\n static const int case_shorter_interval_left_endpoint_upper_threshold = 3;\n static const int shorter_interval_tie_lower_threshold = -35;\n static const int shorter_interval_tie_upper_threshold = -35;\n static const int max_trailing_zeros = 7;\n};\n\ntemplate <> struct float_info {\n using carrier_uint = uint64_t;\n static const int significand_bits = 52;\n static const int exponent_bits = 11;\n static const int min_exponent = -1022;\n static const int max_exponent = 1023;\n static const int exponent_bias = -1023;\n static const int decimal_digits = 17;\n static const int kappa = 2;\n static const int big_divisor = 1000;\n static const int small_divisor = 100;\n static const int min_k = -292;\n static const int max_k = 326;\n static const int cache_bits = 128;\n static const int divisibility_check_by_5_threshold = 86;\n static const int case_fc_pm_half_lower_threshold = -2;\n static const int case_fc_pm_half_upper_threshold = 9;\n static const int case_fc_lower_threshold = -4;\n static const int case_fc_upper_threshold = 9;\n static const int case_shorter_interval_left_endpoint_lower_threshold = 2;\n static const int case_shorter_interval_left_endpoint_upper_threshold = 3;\n static const int shorter_interval_tie_lower_threshold = -77;\n static const int shorter_interval_tie_upper_threshold = -77;\n static const int max_trailing_zeros = 16;\n};\n\ntemplate struct decimal_fp {\n using significand_type = typename float_info::carrier_uint;\n significand_type significand;\n int exponent;\n};\n\ntemplate \nFMT_API auto to_decimal(T x) FMT_NOEXCEPT -> decimal_fp;\n} // namespace dragonbox\n\ntemplate \nconstexpr auto exponent_mask() ->\n typename dragonbox::float_info::carrier_uint {\n using uint = typename dragonbox::float_info::carrier_uint;\n return ((uint(1) << dragonbox::float_info::exponent_bits) - 1)\n << dragonbox::float_info::significand_bits;\n}\n\n// Writes the exponent exp in the form \"[+-]d{2,3}\" to buffer.\ntemplate \nauto write_exponent(int exp, It it) -> It {\n FMT_ASSERT(-10000 < exp && exp < 10000, \"exponent out of range\");\n if (exp < 0) {\n *it++ = static_cast('-');\n exp = -exp;\n } else {\n *it++ = static_cast('+');\n }\n if (exp >= 100) {\n const char* top = data::digits[exp / 100];\n if (exp >= 1000) *it++ = static_cast(top[0]);\n *it++ = static_cast(top[1]);\n exp %= 100;\n }\n const char* d = data::digits[exp];\n *it++ = static_cast(d[0]);\n *it++ = static_cast(d[1]);\n return it;\n}\n\ntemplate \nauto format_float(T value, int precision, float_specs specs, buffer& buf)\n -> int;\n\n// Formats a floating-point number with snprintf.\ntemplate \nauto snprintf_float(T value, int precision, float_specs specs,\n buffer& buf) -> int;\n\ntemplate auto promote_float(T value) -> T { return value; }\ninline auto promote_float(float value) -> double {\n return static_cast(value);\n}\n\ntemplate \nFMT_NOINLINE FMT_CONSTEXPR auto fill(OutputIt it, size_t n,\n const fill_t& fill) -> OutputIt {\n auto fill_size = fill.size();\n if (fill_size == 1) return detail::fill_n(it, n, fill[0]);\n auto data = fill.data();\n for (size_t i = 0; i < n; ++i)\n it = copy_str(data, data + fill_size, it);\n return it;\n}\n\n// Writes the output of f, padded according to format specifications in specs.\n// size: output size in code units.\n// width: output display width in (terminal) column positions.\ntemplate \nFMT_CONSTEXPR auto write_padded(OutputIt out,\n const basic_format_specs& specs,\n size_t size, size_t width, F&& f) -> OutputIt {\n static_assert(align == align::left || align == align::right, \"\");\n unsigned spec_width = to_unsigned(specs.width);\n size_t padding = spec_width > width ? spec_width - width : 0;\n auto* shifts = align == align::left ? data::left_padding_shifts\n : data::right_padding_shifts;\n size_t left_padding = padding >> shifts[specs.align];\n size_t right_padding = padding - left_padding;\n auto it = reserve(out, size + padding * specs.fill.size());\n if (left_padding != 0) it = fill(it, left_padding, specs.fill);\n it = f(it);\n if (right_padding != 0) it = fill(it, right_padding, specs.fill);\n return base_iterator(out, it);\n}\n\ntemplate \nconstexpr auto write_padded(OutputIt out, const basic_format_specs& specs,\n size_t size, F&& f) -> OutputIt {\n return write_padded(out, specs, size, size, f);\n}\n\ntemplate \nFMT_CONSTEXPR auto write_bytes(OutputIt out, string_view bytes,\n const basic_format_specs& specs)\n -> OutputIt {\n return write_padded(\n out, specs, bytes.size(), [bytes](reserve_iterator it) {\n const char* data = bytes.data();\n return copy_str(data, data + bytes.size(), it);\n });\n}\n\ntemplate \nauto write_ptr(OutputIt out, UIntPtr value,\n const basic_format_specs* specs) -> OutputIt {\n int num_digits = count_digits<4>(value);\n auto size = to_unsigned(num_digits) + size_t(2);\n auto write = [=](reserve_iterator it) {\n *it++ = static_cast('0');\n *it++ = static_cast('x');\n return format_uint<4, Char>(it, value, num_digits);\n };\n return specs ? write_padded(out, *specs, size, write)\n : base_iterator(out, write(reserve(out, size)));\n}\n\ntemplate \nFMT_CONSTEXPR auto write_char(OutputIt out, Char value,\n const basic_format_specs& specs)\n -> OutputIt {\n return write_padded(out, specs, 1, [=](reserve_iterator it) {\n *it++ = value;\n return it;\n });\n}\ntemplate \nFMT_CONSTEXPR auto write(OutputIt out, Char value,\n const basic_format_specs& specs,\n locale_ref loc = {}) -> OutputIt {\n return check_char_specs(specs)\n ? write_char(out, value, specs)\n : write(out, static_cast(value), specs, loc);\n}\n\n// Data for write_int that doesn't depend on output iterator type. It is used to\n// avoid template code bloat.\ntemplate struct write_int_data {\n size_t size;\n size_t padding;\n\n FMT_CONSTEXPR write_int_data(int num_digits, unsigned prefix,\n const basic_format_specs& specs)\n : size((prefix >> 24) + to_unsigned(num_digits)), padding(0) {\n if (specs.align == align::numeric) {\n auto width = to_unsigned(specs.width);\n if (width > size) {\n padding = width - size;\n size = width;\n }\n } else if (specs.precision > num_digits) {\n size = (prefix >> 24) + to_unsigned(specs.precision);\n padding = to_unsigned(specs.precision - num_digits);\n }\n }\n};\n\n// Writes an integer in the format\n// \n// where are written by write_digits(it).\n// prefix contains chars in three lower bytes and the size in the fourth byte.\ntemplate \nFMT_CONSTEXPR FMT_INLINE auto write_int(OutputIt out, int num_digits,\n unsigned prefix,\n const basic_format_specs& specs,\n W write_digits) -> OutputIt {\n // Slightly faster check for specs.width == 0 && specs.precision == -1.\n if ((specs.width | (specs.precision + 1)) == 0) {\n auto it = reserve(out, to_unsigned(num_digits) + (prefix >> 24));\n if (prefix != 0) {\n for (unsigned p = prefix & 0xffffff; p != 0; p >>= 8)\n *it++ = static_cast(p & 0xff);\n }\n return base_iterator(out, write_digits(it));\n }\n auto data = write_int_data(num_digits, prefix, specs);\n return write_padded(\n out, specs, data.size, [=](reserve_iterator it) {\n for (unsigned p = prefix & 0xffffff; p != 0; p >>= 8)\n *it++ = static_cast(p & 0xff);\n it = detail::fill_n(it, data.padding, static_cast('0'));\n return write_digits(it);\n });\n}\n\ntemplate \nauto write_int_localized(OutputIt& out, UInt value, unsigned prefix,\n const basic_format_specs& specs, locale_ref loc)\n -> bool {\n static_assert(std::is_same, UInt>::value, \"\");\n const auto sep_size = 1;\n auto ts = thousands_sep(loc);\n if (!ts.thousands_sep) return false;\n int num_digits = count_digits(value);\n int size = num_digits, n = num_digits;\n const std::string& groups = ts.grouping;\n std::string::const_iterator group = groups.cbegin();\n while (group != groups.cend() && n > *group && *group > 0 &&\n *group != max_value()) {\n size += sep_size;\n n -= *group;\n ++group;\n }\n if (group == groups.cend()) size += sep_size * ((n - 1) / groups.back());\n char digits[40];\n format_decimal(digits, value, num_digits);\n basic_memory_buffer buffer;\n if (prefix != 0) ++size;\n const auto usize = to_unsigned(size);\n buffer.resize(usize);\n basic_string_view s(&ts.thousands_sep, sep_size);\n // Index of a decimal digit with the least significant digit having index 0.\n int digit_index = 0;\n group = groups.cbegin();\n auto p = buffer.data() + size - 1;\n for (int i = num_digits - 1; i > 0; --i) {\n *p-- = static_cast(digits[i]);\n if (*group <= 0 || ++digit_index % *group != 0 ||\n *group == max_value())\n continue;\n if (group + 1 != groups.cend()) {\n digit_index = 0;\n ++group;\n }\n std::uninitialized_copy(s.data(), s.data() + s.size(),\n make_checked(p, s.size()));\n p -= s.size();\n }\n *p-- = static_cast(*digits);\n if (prefix != 0) *p = static_cast(prefix);\n auto data = buffer.data();\n out = write_padded(\n out, specs, usize, usize, [=](reserve_iterator it) {\n return copy_str(data, data + size, it);\n });\n return true;\n}\n\nFMT_CONSTEXPR inline void prefix_append(unsigned& prefix, unsigned value) {\n prefix |= prefix != 0 ? value << 8 : value;\n prefix += (1u + (value > 0xff ? 1 : 0)) << 24;\n}\n\ntemplate struct write_int_arg {\n UInt abs_value;\n unsigned prefix;\n};\n\ntemplate \nFMT_CONSTEXPR auto make_write_int_arg(T value, sign_t sign)\n -> write_int_arg> {\n auto prefix = 0u;\n auto abs_value = static_cast>(value);\n if (is_negative(value)) {\n prefix = 0x01000000 | '-';\n abs_value = 0 - abs_value;\n } else {\n prefix = data::prefixes[sign];\n }\n return {abs_value, prefix};\n}\n\ntemplate \nFMT_CONSTEXPR FMT_INLINE auto write_int(OutputIt out, write_int_arg arg,\n const basic_format_specs& specs,\n locale_ref loc) -> OutputIt {\n static_assert(std::is_same>::value, \"\");\n auto abs_value = arg.abs_value;\n auto prefix = arg.prefix;\n auto utype = static_cast(specs.type);\n switch (specs.type) {\n case 0:\n case 'd': {\n if (specs.localized &&\n write_int_localized(out, static_cast>(abs_value),\n prefix, specs, loc)) {\n return out;\n }\n auto num_digits = count_digits(abs_value);\n return write_int(\n out, num_digits, prefix, specs, [=](reserve_iterator it) {\n return format_decimal(it, abs_value, num_digits).end;\n });\n }\n case 'x':\n case 'X': {\n if (specs.alt) prefix_append(prefix, (utype << 8) | '0');\n bool upper = specs.type != 'x';\n int num_digits = count_digits<4>(abs_value);\n return write_int(\n out, num_digits, prefix, specs, [=](reserve_iterator it) {\n return format_uint<4, Char>(it, abs_value, num_digits, upper);\n });\n }\n case 'b':\n case 'B': {\n if (specs.alt) prefix_append(prefix, (utype << 8) | '0');\n int num_digits = count_digits<1>(abs_value);\n return write_int(out, num_digits, prefix, specs,\n [=](reserve_iterator it) {\n return format_uint<1, Char>(it, abs_value, num_digits);\n });\n }\n case 'o': {\n int num_digits = count_digits<3>(abs_value);\n if (specs.alt && specs.precision <= num_digits && abs_value != 0) {\n // Octal prefix '0' is counted as a digit, so only add it if precision\n // is not greater than the number of digits.\n prefix_append(prefix, '0');\n }\n return write_int(out, num_digits, prefix, specs,\n [=](reserve_iterator it) {\n return format_uint<3, Char>(it, abs_value, num_digits);\n });\n }\n case 'c':\n return write_char(out, static_cast(abs_value), specs);\n default:\n FMT_THROW(format_error(\"invalid type specifier\"));\n }\n return out;\n}\ntemplate ::value &&\n !std::is_same::value &&\n std::is_same>::value)>\nFMT_CONSTEXPR auto write(OutputIt out, T value,\n const basic_format_specs& specs, locale_ref loc)\n -> OutputIt {\n return write_int(out, make_write_int_arg(value, specs.sign), specs, loc);\n}\n// An inlined version of write used in format string compilation.\ntemplate ::value &&\n !std::is_same::value &&\n !std::is_same>::value)>\nFMT_CONSTEXPR FMT_INLINE auto write(OutputIt out, T value,\n const basic_format_specs& specs,\n locale_ref loc) -> OutputIt {\n return write_int(out, make_write_int_arg(value, specs.sign), specs, loc);\n}\n\ntemplate \nFMT_CONSTEXPR auto write(OutputIt out, basic_string_view s,\n const basic_format_specs& specs) -> OutputIt {\n auto data = s.data();\n auto size = s.size();\n if (specs.precision >= 0 && to_unsigned(specs.precision) < size)\n size = code_point_index(s, to_unsigned(specs.precision));\n auto width =\n specs.width != 0 ? compute_width(basic_string_view(data, size)) : 0;\n return write_padded(out, specs, size, width,\n [=](reserve_iterator it) {\n return copy_str(data, data + size, it);\n });\n}\ntemplate \nFMT_CONSTEXPR auto write(OutputIt out,\n basic_string_view> s,\n const basic_format_specs& specs, locale_ref)\n -> OutputIt {\n return write(out, s, specs);\n}\ntemplate \nFMT_CONSTEXPR auto write(OutputIt out, const Char* s,\n const basic_format_specs& specs, locale_ref)\n -> OutputIt {\n return check_cstring_type_spec(specs.type)\n ? write(out, basic_string_view(s), specs, {})\n : write_ptr(out, to_uintptr(s), &specs);\n}\n\ntemplate \nauto write_nonfinite(OutputIt out, bool isinf, basic_format_specs specs,\n const float_specs& fspecs) -> OutputIt {\n auto str =\n isinf ? (fspecs.upper ? \"INF\" : \"inf\") : (fspecs.upper ? \"NAN\" : \"nan\");\n constexpr size_t str_size = 3;\n auto sign = fspecs.sign;\n auto size = str_size + (sign ? 1 : 0);\n // Replace '0'-padding with space for non-finite values.\n const bool is_zero_fill =\n specs.fill.size() == 1 && *specs.fill.data() == static_cast('0');\n if (is_zero_fill) specs.fill[0] = static_cast(' ');\n return write_padded(out, specs, size, [=](reserve_iterator it) {\n if (sign) *it++ = static_cast(data::signs[sign]);\n return copy_str(str, str + str_size, it);\n });\n}\n\n// A decimal floating-point number significand * pow(10, exp).\nstruct big_decimal_fp {\n const char* significand;\n int significand_size;\n int exponent;\n};\n\ninline auto get_significand_size(const big_decimal_fp& fp) -> int {\n return fp.significand_size;\n}\ntemplate \ninline auto get_significand_size(const dragonbox::decimal_fp& fp) -> int {\n return count_digits(fp.significand);\n}\n\ntemplate \ninline auto write_significand(OutputIt out, const char* significand,\n int& significand_size) -> OutputIt {\n return copy_str(significand, significand + significand_size, out);\n}\ntemplate \ninline auto write_significand(OutputIt out, UInt significand,\n int significand_size) -> OutputIt {\n return format_decimal(out, significand, significand_size).end;\n}\n\ntemplate ::value)>\ninline auto write_significand(Char* out, UInt significand, int significand_size,\n int integral_size, Char decimal_point) -> Char* {\n if (!decimal_point)\n return format_decimal(out, significand, significand_size).end;\n auto end = format_decimal(out + 1, significand, significand_size).end;\n if (integral_size == 1) {\n out[0] = out[1];\n } else {\n std::uninitialized_copy_n(out + 1, integral_size,\n make_checked(out, to_unsigned(integral_size)));\n }\n out[integral_size] = decimal_point;\n return end;\n}\n\ntemplate >::value)>\ninline auto write_significand(OutputIt out, UInt significand,\n int significand_size, int integral_size,\n Char decimal_point) -> OutputIt {\n // Buffer is large enough to hold digits (digits10 + 1) and a decimal point.\n Char buffer[digits10() + 2];\n auto end = write_significand(buffer, significand, significand_size,\n integral_size, decimal_point);\n return detail::copy_str_noinline(buffer, end, out);\n}\n\ntemplate \ninline auto write_significand(OutputIt out, const char* significand,\n int significand_size, int integral_size,\n Char decimal_point) -> OutputIt {\n out = detail::copy_str_noinline(significand,\n significand + integral_size, out);\n if (!decimal_point) return out;\n *out++ = decimal_point;\n return detail::copy_str_noinline(significand + integral_size,\n significand + significand_size, out);\n}\n\ntemplate \nauto write_float(OutputIt out, const DecimalFP& fp,\n const basic_format_specs& specs, float_specs fspecs,\n Char decimal_point) -> OutputIt {\n auto significand = fp.significand;\n int significand_size = get_significand_size(fp);\n static const Char zero = static_cast('0');\n auto sign = fspecs.sign;\n size_t size = to_unsigned(significand_size) + (sign ? 1 : 0);\n using iterator = reserve_iterator;\n\n int output_exp = fp.exponent + significand_size - 1;\n auto use_exp_format = [=]() {\n if (fspecs.format == float_format::exp) return true;\n if (fspecs.format != float_format::general) return false;\n // Use the fixed notation if the exponent is in [exp_lower, exp_upper),\n // e.g. 0.0001 instead of 1e-04. Otherwise use the exponent notation.\n const int exp_lower = -4, exp_upper = 16;\n return output_exp < exp_lower ||\n output_exp >= (fspecs.precision > 0 ? fspecs.precision : exp_upper);\n };\n if (use_exp_format()) {\n int num_zeros = 0;\n if (fspecs.showpoint) {\n num_zeros = fspecs.precision - significand_size;\n if (num_zeros < 0) num_zeros = 0;\n size += to_unsigned(num_zeros);\n } else if (significand_size == 1) {\n decimal_point = Char();\n }\n auto abs_output_exp = output_exp >= 0 ? output_exp : -output_exp;\n int exp_digits = 2;\n if (abs_output_exp >= 100) exp_digits = abs_output_exp >= 1000 ? 4 : 3;\n\n size += to_unsigned((decimal_point ? 1 : 0) + 2 + exp_digits);\n char exp_char = fspecs.upper ? 'E' : 'e';\n auto write = [=](iterator it) {\n if (sign) *it++ = static_cast(data::signs[sign]);\n // Insert a decimal point after the first digit and add an exponent.\n it = write_significand(it, significand, significand_size, 1,\n decimal_point);\n if (num_zeros > 0) it = detail::fill_n(it, num_zeros, zero);\n *it++ = static_cast(exp_char);\n return write_exponent(output_exp, it);\n };\n return specs.width > 0 ? write_padded(out, specs, size, write)\n : base_iterator(out, write(reserve(out, size)));\n }\n\n int exp = fp.exponent + significand_size;\n if (fp.exponent >= 0) {\n // 1234e5 -> 123400000[.0+]\n size += to_unsigned(fp.exponent);\n int num_zeros = fspecs.precision - exp;\n#ifdef FMT_FUZZ\n if (num_zeros > 5000)\n throw std::runtime_error(\"fuzz mode - avoiding excessive cpu use\");\n#endif\n if (fspecs.showpoint) {\n if (num_zeros <= 0 && fspecs.format != float_format::fixed) num_zeros = 1;\n if (num_zeros > 0) size += to_unsigned(num_zeros) + 1;\n }\n return write_padded(out, specs, size, [&](iterator it) {\n if (sign) *it++ = static_cast(data::signs[sign]);\n it = write_significand(it, significand, significand_size);\n it = detail::fill_n(it, fp.exponent, zero);\n if (!fspecs.showpoint) return it;\n *it++ = decimal_point;\n return num_zeros > 0 ? detail::fill_n(it, num_zeros, zero) : it;\n });\n } else if (exp > 0) {\n // 1234e-2 -> 12.34[0+]\n int num_zeros = fspecs.showpoint ? fspecs.precision - significand_size : 0;\n size += 1 + to_unsigned(num_zeros > 0 ? num_zeros : 0);\n return write_padded(out, specs, size, [&](iterator it) {\n if (sign) *it++ = static_cast(data::signs[sign]);\n it = write_significand(it, significand, significand_size, exp,\n decimal_point);\n return num_zeros > 0 ? detail::fill_n(it, num_zeros, zero) : it;\n });\n }\n // 1234e-6 -> 0.001234\n int num_zeros = -exp;\n if (significand_size == 0 && fspecs.precision >= 0 &&\n fspecs.precision < num_zeros) {\n num_zeros = fspecs.precision;\n }\n bool pointy = num_zeros != 0 || significand_size != 0 || fspecs.showpoint;\n size += 1 + (pointy ? 1 : 0) + to_unsigned(num_zeros);\n return write_padded(out, specs, size, [&](iterator it) {\n if (sign) *it++ = static_cast(data::signs[sign]);\n *it++ = zero;\n if (!pointy) return it;\n *it++ = decimal_point;\n it = detail::fill_n(it, num_zeros, zero);\n return write_significand(it, significand, significand_size);\n });\n}\n\ntemplate ::value)>\nauto write(OutputIt out, T value, basic_format_specs specs,\n locale_ref loc = {}) -> OutputIt {\n if (const_check(!is_supported_floating_point(value))) return out;\n float_specs fspecs = parse_float_type_spec(specs);\n fspecs.sign = specs.sign;\n if (std::signbit(value)) { // value < 0 is false for NaN so use signbit.\n fspecs.sign = sign::minus;\n value = -value;\n } else if (fspecs.sign == sign::minus) {\n fspecs.sign = sign::none;\n }\n\n if (!std::isfinite(value))\n return write_nonfinite(out, std::isinf(value), specs, fspecs);\n\n if (specs.align == align::numeric && fspecs.sign) {\n auto it = reserve(out, 1);\n *it++ = static_cast(data::signs[fspecs.sign]);\n out = base_iterator(out, it);\n fspecs.sign = sign::none;\n if (specs.width != 0) --specs.width;\n }\n\n memory_buffer buffer;\n if (fspecs.format == float_format::hex) {\n if (fspecs.sign) buffer.push_back(data::signs[fspecs.sign]);\n snprintf_float(promote_float(value), specs.precision, fspecs, buffer);\n return write_bytes(out, {buffer.data(), buffer.size()},\n specs);\n }\n int precision = specs.precision >= 0 || !specs.type ? specs.precision : 6;\n if (fspecs.format == float_format::exp) {\n if (precision == max_value())\n FMT_THROW(format_error(\"number is too big\"));\n else\n ++precision;\n }\n if (const_check(std::is_same())) fspecs.binary32 = true;\n fspecs.use_grisu = is_fast_float();\n int exp = format_float(promote_float(value), precision, fspecs, buffer);\n fspecs.precision = precision;\n Char point =\n fspecs.locale ? decimal_point(loc) : static_cast('.');\n auto fp = big_decimal_fp{buffer.data(), static_cast(buffer.size()), exp};\n return write_float(out, fp, specs, fspecs, point);\n}\n\ntemplate ::value)>\nauto write(OutputIt out, T value) -> OutputIt {\n if (const_check(!is_supported_floating_point(value))) return out;\n\n using floaty = conditional_t::value, double, T>;\n using uint = typename dragonbox::float_info::carrier_uint;\n auto bits = bit_cast(value);\n\n auto fspecs = float_specs();\n auto sign_bit = bits & (uint(1) << (num_bits() - 1));\n if (sign_bit != 0) {\n fspecs.sign = sign::minus;\n value = -value;\n }\n\n static const auto specs = basic_format_specs();\n uint mask = exponent_mask();\n if ((bits & mask) == mask)\n return write_nonfinite(out, std::isinf(value), specs, fspecs);\n\n auto dec = dragonbox::to_decimal(static_cast(value));\n return write_float(out, dec, specs, fspecs, static_cast('.'));\n}\n\ntemplate ::value &&\n !is_fast_float::value)>\ninline auto write(OutputIt out, T value) -> OutputIt {\n return write(out, value, basic_format_specs());\n}\n\ntemplate \nauto write(OutputIt out, monostate, basic_format_specs = {},\n locale_ref = {}) -> OutputIt {\n FMT_ASSERT(false, \"\");\n return out;\n}\n\ntemplate \nFMT_CONSTEXPR auto write(OutputIt out, basic_string_view value)\n -> OutputIt {\n auto it = reserve(out, value.size());\n it = copy_str_noinline(value.begin(), value.end(), it);\n return base_iterator(out, it);\n}\n\ntemplate ::value)>\nconstexpr auto write(OutputIt out, const T& value) -> OutputIt {\n return write(out, to_string_view(value));\n}\n\ntemplate ::value &&\n !std::is_same::value &&\n !std::is_same::value)>\nFMT_CONSTEXPR auto write(OutputIt out, T value) -> OutputIt {\n auto abs_value = static_cast>(value);\n bool negative = is_negative(value);\n // Don't do -abs_value since it trips unsigned-integer-overflow sanitizer.\n if (negative) abs_value = ~abs_value + 1;\n int num_digits = count_digits(abs_value);\n auto size = (negative ? 1 : 0) + static_cast(num_digits);\n auto it = reserve(out, size);\n if (auto ptr = to_pointer(it, size)) {\n if (negative) *ptr++ = static_cast('-');\n format_decimal(ptr, abs_value, num_digits);\n return out;\n }\n if (negative) *it++ = static_cast('-');\n it = format_decimal(it, abs_value, num_digits).end;\n return base_iterator(out, it);\n}\n\n// FMT_ENABLE_IF() condition separated to workaround MSVC bug\ntemplate <\n typename Char, typename OutputIt, typename T,\n bool check =\n std::is_enum::value && !std::is_same::value &&\n mapped_type_constant>::value !=\n type::custom_type,\n FMT_ENABLE_IF(check)>\nFMT_CONSTEXPR auto write(OutputIt out, T value) -> OutputIt {\n return write(\n out, static_cast::type>(value));\n}\n\ntemplate ::value)>\nFMT_CONSTEXPR auto write(OutputIt out, T value,\n const basic_format_specs& specs = {},\n locale_ref = {}) -> OutputIt {\n return specs.type && specs.type != 's'\n ? write(out, value ? 1 : 0, specs, {})\n : write_bytes(out, value ? \"true\" : \"false\", specs);\n}\n\ntemplate \nFMT_CONSTEXPR auto write(OutputIt out, Char value) -> OutputIt {\n auto it = reserve(out, 1);\n *it++ = value;\n return base_iterator(out, it);\n}\n\ntemplate \nFMT_CONSTEXPR_CHAR_TRAITS auto write(OutputIt out, const Char* value)\n -> OutputIt {\n if (!value) {\n FMT_THROW(format_error(\"string pointer is null\"));\n } else {\n auto length = std::char_traits::length(value);\n out = write(out, basic_string_view(value, length));\n }\n return out;\n}\n\ntemplate ::value)>\nauto write(OutputIt out, const T* value,\n const basic_format_specs& specs = {}, locale_ref = {})\n -> OutputIt {\n check_pointer_type_spec(specs.type, error_handler());\n return write_ptr(out, to_uintptr(value), &specs);\n}\n\ntemplate \nFMT_CONSTEXPR auto write(OutputIt out, const T& value) ->\n typename std::enable_if<\n mapped_type_constant>::value ==\n type::custom_type,\n OutputIt>::type {\n using context_type = basic_format_context;\n using formatter_type =\n conditional_t::value,\n typename context_type::template formatter_type,\n fallback_formatter>;\n context_type ctx(out, {}, {});\n return formatter_type().format(value, ctx);\n}\n\n// An argument visitor that formats the argument and writes it via the output\n// iterator. It's a class and not a generic lambda for compatibility with C++11.\ntemplate struct default_arg_formatter {\n using iterator = buffer_appender;\n using context = buffer_context;\n\n iterator out;\n basic_format_args args;\n locale_ref loc;\n\n template auto operator()(T value) -> iterator {\n return write(out, value);\n }\n auto operator()(typename basic_format_arg::handle h) -> iterator {\n basic_format_parse_context parse_ctx({});\n context format_ctx(out, args, loc);\n h.format(parse_ctx, format_ctx);\n return format_ctx.out();\n }\n};\n\ntemplate struct arg_formatter {\n using iterator = buffer_appender;\n using context = buffer_context;\n\n iterator out;\n const basic_format_specs& specs;\n locale_ref locale;\n\n template \n FMT_CONSTEXPR FMT_INLINE auto operator()(T value) -> iterator {\n return detail::write(out, value, specs, locale);\n }\n auto operator()(typename basic_format_arg::handle) -> iterator {\n // User-defined types are handled separately because they require access\n // to the parse context.\n return out;\n }\n};\n\ntemplate struct custom_formatter {\n basic_format_parse_context& parse_ctx;\n buffer_context& ctx;\n\n void operator()(\n typename basic_format_arg>::handle h) const {\n h.format(parse_ctx, ctx);\n }\n template void operator()(T) const {}\n};\n\ntemplate \nusing is_integer =\n bool_constant::value && !std::is_same::value &&\n !std::is_same::value &&\n !std::is_same::value>;\n\ntemplate class width_checker {\n public:\n explicit FMT_CONSTEXPR width_checker(ErrorHandler& eh) : handler_(eh) {}\n\n template ::value)>\n FMT_CONSTEXPR auto operator()(T value) -> unsigned long long {\n if (is_negative(value)) handler_.on_error(\"negative width\");\n return static_cast(value);\n }\n\n template ::value)>\n FMT_CONSTEXPR auto operator()(T) -> unsigned long long {\n handler_.on_error(\"width is not integer\");\n return 0;\n }\n\n private:\n ErrorHandler& handler_;\n};\n\ntemplate class precision_checker {\n public:\n explicit FMT_CONSTEXPR precision_checker(ErrorHandler& eh) : handler_(eh) {}\n\n template ::value)>\n FMT_CONSTEXPR auto operator()(T value) -> unsigned long long {\n if (is_negative(value)) handler_.on_error(\"negative precision\");\n return static_cast(value);\n }\n\n template ::value)>\n FMT_CONSTEXPR auto operator()(T) -> unsigned long long {\n handler_.on_error(\"precision is not integer\");\n return 0;\n }\n\n private:\n ErrorHandler& handler_;\n};\n\ntemplate