commit 3e50a7c132066bf474cf8d2728dca7620194158a Author: FutureRave Date: Sat Nov 12 21:49:50 2022 +0000 init diff --git a/.github/dependabot.yml b/.github/dependabot.yml new file mode 100644 index 0000000..4fcd556 --- /dev/null +++ b/.github/dependabot.yml @@ -0,0 +1,7 @@ +version: 2 +updates: +- package-ecosystem: gitsubmodule + directory: "/" + schedule: + interval: daily + open-pull-requests-limit: 10 diff --git a/.github/workflows/build.yml b/.github/workflows/build.yml new file mode 100644 index 0000000..8d503a4 --- /dev/null +++ b/.github/workflows/build.yml @@ -0,0 +1,151 @@ +name: Build + +on: + push: + branches: + - "*" + pull_request: + branches: + - "*" + types: [opened, synchronize, reopened] +jobs: + build-win: + name: Build Windows + runs-on: windows-latest + strategy: + fail-fast: false + matrix: + configuration: + - Debug + - Release + arch: + - x64 + include: + - arch: x64 + platform: x64 + steps: + - name: Check out files + uses: actions/checkout@v3 + with: + submodules: true + fetch-depth: 0 + lfs: false + + - name: Add msbuild to PATH + uses: microsoft/setup-msbuild@v1.1.3 + + - name: Generate project files + run: cmd /C call generate.bat + + - name: Set up problem matching + uses: ammaraskar/msvc-problem-matcher@master + + - name: Build ${{matrix.configuration}} ${{matrix.arch}} binaries + run: msbuild /m /v:minimal /p:Configuration=${{matrix.configuration}} /p:Platform=${{matrix.platform}} build/xlabs-master-tool.sln + + - name: Upload ${{matrix.configuration}} ${{matrix.arch}} binaries + uses: actions/upload-artifact@v3.1.0 + with: + name: Windows ${{matrix.configuration}} ${{matrix.arch}} binaries + path: | + build/bin/${{matrix.arch}}/${{matrix.configuration}}/xlabs-master-tool.exe + build/bin/${{matrix.arch}}/${{matrix.configuration}}/xlabs-master-tool.pdb + + build-lin: + name: Build Linux + runs-on: ubuntu-latest + strategy: + fail-fast: false + matrix: + configuration: + - Debug + - Release + arch: + - x64 + include: + - configuration: Debug + config: debug + - configuration: Release + config: release + steps: + - name: Check out files + uses: actions/checkout@v3 + with: + submodules: true + fetch-depth: 0 + lfs: false + + - name: Install dependencies (x64) + if: matrix.arch == 'x64' + run: | + sudo apt-get update + sudo apt-get -y install libcurl4-gnutls-dev + + - name: Generate project files + run: ./generate.sh + + - name: Set up problem matching + uses: ammaraskar/gcc-problem-matcher@master + + - name: Build ${{matrix.configuration}} ${{matrix.arch}} binaries + run: | + pushd build + make config=${{matrix.config}}_${{matrix.arch}} -j$(nproc) + shell: bash + env: + CC: gcc-11 + CXX: g++-11 + + - name: Upload ${{matrix.configuration}} ${{matrix.arch}} binaries + uses: actions/upload-artifact@v3.1.0 + with: + name: Linux ${{matrix.configuration}} ${{matrix.arch}} binaries + path: | + build/bin/${{matrix.arch}}/${{matrix.configuration}}/xlabs-master-tool + + build-mac: + name: Build macOS + runs-on: macos-latest + strategy: + fail-fast: false + matrix: + configuration: + - Debug + - Release + arch: + - x64 + - ARM64 + include: + - configuration: Debug + config: debug + - configuration: Release + config: release + - arch: x64 + platform: x64 + - arch: ARM64 + platform: arm64 + steps: + - name: Check out files + uses: actions/checkout@v3 + with: + submodules: true + fetch-depth: 0 + lfs: false + + - name: Generate project files + run: ./generate.sh + + - name: Set up problem matching + uses: ammaraskar/gcc-problem-matcher@master + + - name: Build ${{matrix.configuration}} ${{matrix.arch}} binaries + run: | + pushd build + make config=${{matrix.config}}_${{matrix.platform}} -j$(sysctl -n hw.logicalcpu) + + - name: Upload ${{matrix.configuration}} ${{matrix.arch}} binaries + uses: actions/upload-artifact@v3.1.0 + with: + name: macOS ${{matrix.configuration}} ${{matrix.arch}} binaries + path: | + build/bin/${{matrix.platform}}/${{matrix.configuration}}/xlabs-master-tool diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..130a33a --- /dev/null +++ b/.gitignore @@ -0,0 +1,150 @@ +### Windows + +# Windows image file caches +Thumbs.db +ehthumbs.db + +# Folder config file +Desktop.ini + +# Recycle Bin used on file shares +$RECYCLE.BIN/ + +# Windows Installer files +*.cab +*.msi +*.msm +*.msp + +# Shortcuts +*.lnk + +### OSX + +.DS_Store +.AppleDouble +.LSOverride + +# Icon must end with two \r +Icon + +# Thumbnails +._* + +# Files that might appear on external disk +.Spotlight-V100 +.Trashes + +# Directories potentially created on remote AFP share +.AppleDB +.AppleDesktop +Network Trash Folder +Temporary Items +.apdisk + +### Visual Studio + +# User-specific files +*.suo +*.user +*.userosscache +*.sln.docstates + +# User-specific files (MonoDevelop/Xamarin Studio) +*.userprefs + +# Build results +build + +# Visual Studio 2015 cache/options directory +.vs/ + +# MSTest test Results +[Tt]est[Rr]esult*/ +[Bb]uild[Ll]og.* + +*_i.c +*_p.c +*_i.h +*.ilk +*.meta +*.obj +*.pch +*.pdb +*.pgc +*.pgd +*.rsp +*.sbr +*.tlb +*.tli +*.tlh +*.tmp +*.tmp_proj +*.log +*.vspscc +*.vssscc +.builds +*.pidb +*.svclog +*.scc + +# Visual C++ cache files +ipch/ +*.aps +*.ncb +*.opendb +*.opensdf +*.sdf +*.cachefile + +# Visual Studio profiler +*.psess +*.vsp +*.vspx +*.sap + +# TFS 2012 Local Workspace +$tf/ + +# Guidance Automation Toolkit +*.gpState + +# Visual Studio cache files +# files ending in .cache can be ignored +*.[Cc]ache +# but keep track of directories ending in .cache +!*.[Cc]ache/ + +# Others +~$* +*~ +*.dbmdl +*.dbproj.schemaview +*.pfx +*.publishsettings + +# Backup & report files from converting an old project file +# to a newer Visual Studio version. Backup files are not needed, +# because we have git ;-) +_UpgradeReport_Files/ +Backup*/ +UpgradeLog*.XML +UpgradeLog*.htm + +# SQL Server files +*.mdf +*.ldf + +### IDA +*.id0 +*.id1 +*.id2 +*.nam +*.til + +### Custom user files +# User scripts +user*.bat + +# Premake binary +#premake5.exe \ No newline at end of file diff --git a/.gitmodules b/.gitmodules new file mode 100644 index 0000000..7db0637 --- /dev/null +++ b/.gitmodules @@ -0,0 +1,9 @@ +[submodule "deps/libtomcrypt"] + path = deps/libtomcrypt + url = https://github.com/libtom/libtomcrypt.git +[submodule "deps/libtommath"] + path = deps/libtommath + url = https://github.com/libtom/libtommath.git +[submodule "deps/GSL"] + path = deps/GSL + url = https://github.com/microsoft/GSL.git diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/README.md b/README.md new file mode 100644 index 0000000..8eb04c1 --- /dev/null +++ b/README.md @@ -0,0 +1,5 @@ +![license](https://img.shields.io/github/license/diamante0018/master-tool.svg) +[![build](https://github.com/diamante0018/master-tool/workflows/Build/badge.svg)](https://github.com/diamante0018/master-tool/actions) +[![patreon](https://img.shields.io/badge/patreon-support-blue.svg?logo=patreon)](https://www.patreon.com/xlabsproject) + +# X-Labs: Master Server Tool diff --git a/deps/GSL b/deps/GSL new file mode 160000 index 0000000..517ed29 --- /dev/null +++ b/deps/GSL @@ -0,0 +1 @@ +Subproject commit 517ed29228d18cf2c5004d10826090108e06f049 diff --git a/deps/libtomcrypt b/deps/libtomcrypt new file mode 160000 index 0000000..3474ca3 --- /dev/null +++ b/deps/libtomcrypt @@ -0,0 +1 @@ +Subproject commit 3474ca37124c6fe78f5461876542e226a25b5f1f diff --git a/deps/libtommath b/deps/libtommath new file mode 160000 index 0000000..03de03d --- /dev/null +++ b/deps/libtommath @@ -0,0 +1 @@ +Subproject commit 03de03dee753442d4b23166982514639c4ccbc39 diff --git a/deps/premake/gsl.lua b/deps/premake/gsl.lua new file mode 100644 index 0000000..7a2daf6 --- /dev/null +++ b/deps/premake/gsl.lua @@ -0,0 +1,19 @@ +gsl = { + source = path.join(dependencies.basePath, "GSL"), +} + +function gsl.import() + gsl.includes() +end + +function gsl.includes() + includedirs { + path.join(gsl.source, "include") + } +end + +function gsl.project() + +end + +table.insert(dependencies, gsl) diff --git a/deps/premake/libtomcrypt.lua b/deps/premake/libtomcrypt.lua new file mode 100644 index 0000000..6c6f28d --- /dev/null +++ b/deps/premake/libtomcrypt.lua @@ -0,0 +1,61 @@ +libtomcrypt = { + source = path.join(dependencies.basePath, "libtomcrypt"), +} + +function libtomcrypt.import() + links { + "libtomcrypt" + } + + libtomcrypt.includes() +end + +function libtomcrypt.includes() + includedirs { + path.join(libtomcrypt.source, "src/headers") + } + + defines { + "LTC_NO_FAST", + "LTC_NO_PROTOTYPES", + "LTC_NO_RSA_BLINDING", + } +end + +function libtomcrypt.project() + project "libtomcrypt" + language "C" + + libtomcrypt.includes() + libtommath.import() + + files { + path.join(libtomcrypt.source, "src/**.c"), + } + + removefiles { + path.join(libtomcrypt.source, "src/**/*tab.c"), + path.join(libtomcrypt.source, "src/encauth/ocb3/**.c"), + } + + defines { + "_CRT_SECURE_NO_WARNINGS", + "LTC_SOURCE", + "_LIB", + "USE_LTM" + } + + removedefines { + "_DLL", + "_USRDLL" + } + + linkoptions { + "-IGNORE:4221" + } + + warnings "Off" + kind "StaticLib" +end + +table.insert(dependencies, libtomcrypt) diff --git a/deps/premake/libtommath.lua b/deps/premake/libtommath.lua new file mode 100644 index 0000000..35cdcf6 --- /dev/null +++ b/deps/premake/libtommath.lua @@ -0,0 +1,57 @@ +libtommath = { + source = path.join(dependencies.basePath, "libtommath"), +} + +function libtommath.import() + links { + "libtommath" + } + + libtommath.includes() +end + +function libtommath.includes() + includedirs { + libtommath.source + } + + if os.istarget("windows") then + defines { + "MP_NO_DEV_URANDOM", + } + end + + defines { + "LTM_DESC", + "__STDC_IEC_559__", + } +end + +function libtommath.project() + project "libtommath" + language "C" + + libtommath.includes() + + files { + path.join(libtommath.source, "*.c"), + } + + defines { + "_LIB" + } + + removedefines { + "_DLL", + "_USRDLL" + } + + linkoptions { + "-IGNORE:4221" + } + + warnings "Off" + kind "StaticLib" +end + +table.insert(dependencies, libtommath) diff --git a/generate.bat b/generate.bat new file mode 100644 index 0000000..561de2a --- /dev/null +++ b/generate.bat @@ -0,0 +1,3 @@ +@echo off +git submodule update --init --recursive +tools\premake5 %* vs2022 diff --git a/generate.sh b/generate.sh new file mode 100755 index 0000000..3ff2d70 --- /dev/null +++ b/generate.sh @@ -0,0 +1,7 @@ +#!/bin/bash +git submodule update --init --recursive +if [ "$(uname)" == "Darwin" ]; then + ./tools/premake5-mac gmake2 +else + ./tools/premake5-linux gmake2 +fi diff --git a/premake5.lua b/premake5.lua new file mode 100644 index 0000000..d3d2cb2 --- /dev/null +++ b/premake5.lua @@ -0,0 +1,134 @@ +dependencies = { + basePath = "./deps" +} + +function dependencies.load() + dir = path.join(dependencies.basePath, "premake/*.lua") + deps = os.matchfiles(dir) + + for i, dep in pairs(deps) do + dep = dep:gsub(".lua", "") + require(dep) + end +end + +function dependencies.imports() + for i, proj in pairs(dependencies) do + if type(i) == 'number' then + proj.import() + end + end +end + +function dependencies.projects() + for i, proj in pairs(dependencies) do + if type(i) == 'number' then + proj.project() + end + end +end + +dependencies.load() + +workspace "xlabs-master-tool" +startproject "xlabs-master-tool" +location "./build" +objdir "%{wks.location}/obj" +targetdir "%{wks.location}/bin/%{cfg.platform}/%{cfg.buildcfg}" + +configurations {"Debug", "Release"} + +if os.istarget("darwin") then + platforms {"x64", "arm64"} +else + platforms {"x86", "x64"} +end + +filter "platforms:x86" + architecture "x86" +filter {} + +filter "platforms:x64" + architecture "x86_64" +filter {} + +filter "platforms:arm64" + architecture "ARM64" +filter {} + +filter {"language:C++", "toolset:not msc*"} + buildoptions "-std=c++17" +filter {} + +filter "toolset:msc*" + buildoptions "/std:c++17" +filter {} + +filter {"system:windows"} + systemversion "latest" +filter {} + +filter {"system:macosx"} + systemversion "11.0" +filter {} + +symbols "On" +staticruntime "On" +editandcontinue "Off" +warnings "Extra" +characterset "ASCII" + +if os.istarget("linux") or os.istarget("darwin") then + buildoptions "-pthread" + linkoptions "-pthread" +end + +if _OPTIONS["dev-build"] then + defines "DEV_BUILD" +end + +if os.getenv("CI") then + defines "CI" +end + +flags {"NoIncrementalLink", "NoMinimalRebuild", "MultiProcessorCompile", "No64BitChecks"} + +filter "configurations:Release" + optimize "Speed" + defines "NDEBUG" + flags "FatalCompileWarnings" +filter {} + +filter "configurations:Debug" + optimize "Debug" + defines {"DEBUG", "_DEBUG"} +filter {} + +project "xlabs-master-tool" +kind "ConsoleApp" +language "C++" + +pchheader "std_include.hpp" +pchsource "src/std_include.cpp" + +files {"./src/**.rc", "./src/**.hpp", "./src/**.cpp"} + +includedirs {"./src", "%{prj.location}/src"} + +filter {"system:windows", "toolset:not msc*"} + resincludedirs { + "%{_MAIN_SCRIPT_DIR}/src" + } +filter {} + +filter {"system:windows", "toolset:msc*"} + linkoptions {"/IGNORE:4254", "/SAFESEH:NO", "/LARGEADDRESSAWARE", "/PDBCompress"} + resincludedirs { + "$(ProjectDir)src" + } +filter {} + +dependencies.imports() + +group "Dependencies" +dependencies.projects() diff --git a/src/console.cpp b/src/console.cpp new file mode 100644 index 0000000..35ed82e --- /dev/null +++ b/src/console.cpp @@ -0,0 +1,248 @@ +#include "std_include.hpp" +#include "console.hpp" + +#ifdef _WIN32 +#define COLOR_LOG_INFO 11 +#define COLOR_LOG_WARN 14 +#define COLOR_LOG_ERROR 12 +#define COLOR_LOG_DEBUG 15 +#else +#define COLOR_LOG_INFO "\033[0;36m" +#define COLOR_LOG_WARN "\033[0;33m" +#define COLOR_LOG_ERROR "\033[0;31m" +#define COLOR_LOG_DEBUG "\033[0m" +#endif + +namespace console +{ + namespace + { + std::mutex signal_mutex; + std::function signal_callback; + +#ifdef _WIN32 +#define COLOR(win, posix) win + using color_type = WORD; +#else +#define COLOR(win, posix) posix + using color_type = const char*; +#endif + + const color_type color_array[] = + { + COLOR(0x8, "\033[0;90m"), // 0 - black + COLOR(0xC, "\033[0;91m"), // 1 - red + COLOR(0xA, "\033[0;92m"), // 2 - green + COLOR(0xE, "\033[0;93m"), // 3 - yellow + COLOR(0x9, "\033[0;94m"), // 4 - blue + COLOR(0xB, "\033[0;96m"), // 5 - cyan + COLOR(0xD, "\033[0;95m"), // 6 - pink + COLOR(0xF, "\033[0;97m"), // 7 - white + }; + +#ifdef _WIN32 + BOOL WINAPI handler(const DWORD signal) + { + if (signal == CTRL_C_EVENT && signal_callback) + { + signal_callback(); + } + + return TRUE; + } + +#else + void handler(int signal) + { + if (signal == SIGINT && signal_callback) + { + signal_callback(); + } + } +#endif + + std::string format(va_list* ap, const char* message) + { + static thread_local char buffer[0x1000]; + +#ifdef _WIN32 + const int count = _vsnprintf_s(buffer, sizeof(buffer), sizeof(buffer), message, *ap); +#else + const int count = vsnprintf(buffer, sizeof(buffer), message, *ap); +#endif + + if (count < 0) return {}; + return {buffer, static_cast(count)}; + } + +#ifdef _WIN32 + HANDLE get_console_handle() + { + return GetStdHandle(STD_OUTPUT_HANDLE); + } +#endif + + void set_color(const color_type color) + { +#ifdef _WIN32 + SetConsoleTextAttribute(get_console_handle(), color); +#else + printf("%s", color); +#endif + } + + bool apply_color(const std::string& data, const size_t index, const color_type base_color) + { + if (data[index] != '^' || (index + 1) >= data.size()) + { + return false; + } + + auto code = data[index + 1] - '0'; + if (code < 0 || code > 11) + { + return false; + } + + code = std::min(code, 7); // Everything above white is white + if (code == 7) + { + set_color(base_color); + } + else + { + set_color(color_array[code]); + } + + return true; + } + + void print_colored(const std::string& line, const color_type base_color) + { + lock _{}; + set_color(base_color); + + for (size_t i = 0; i < line.size(); ++i) + { + if (apply_color(line, i, base_color)) + { + ++i; + continue; + } + + putchar(line[i]); + } + + reset_color(); + } + } + + lock::lock() + { +#ifdef _WIN32 + _lock_file(stdout); +#else + flockfile(stdout); +#endif + } + + lock::~lock() + { +#ifdef _WIN32 + _unlock_file(stdout); +#else + funlockfile(stdout); +#endif + } + + void reset_color() + { + lock _{}; +#ifdef _WIN32 + SetConsoleTextAttribute(get_console_handle(), 7); +#else + printf("\033[0m"); +#endif + + fflush(stdout); + } + + void info(const char* message, ...) + { + va_list ap; + va_start(ap, message); + + const auto data = format(&ap, message); + print_colored("[+] " + data + "\n", COLOR_LOG_INFO); + + va_end(ap); + } + + void warn(const char* message, ...) + { + va_list ap; + va_start(ap, message); + + const auto data = format(&ap, message); + print_colored("[!] " + data + "\n", COLOR_LOG_WARN); + + va_end(ap); + } + + void error(const char* message, ...) + { + va_list ap; + va_start(ap, message); + + const auto data = format(&ap, message); + print_colored("[-] " + data + "\n", COLOR_LOG_ERROR); + + va_end(ap); + } + + void log(const char* message, ...) + { + va_list ap; + va_start(ap, message); + + const auto data = format(&ap, message); + print_colored("[*] " + data + "\n", COLOR_LOG_DEBUG); + + va_end(ap); + } + + void set_title(const std::string& title) + { + lock _{}; + +#ifdef _WIN32 + SetConsoleTitleA(title.data()); +#else + printf("\033]0;%s\007", title.data()); + fflush(stdout); +#endif + } + + signal_handler::signal_handler(std::function callback) + : std::lock_guard(signal_mutex) + { + signal_callback = std::move(callback); + +#ifdef _WIN32 + SetConsoleCtrlHandler(handler, TRUE); +#else + signal(SIGINT, handler); +#endif + } + + signal_handler::~signal_handler() + { +#ifdef _WIN32 + SetConsoleCtrlHandler(handler, FALSE); +#else + signal(SIGINT, SIG_DFL); +#endif + + signal_callback = {}; + } +} diff --git a/src/console.hpp b/src/console.hpp new file mode 100644 index 0000000..f655dd0 --- /dev/null +++ b/src/console.hpp @@ -0,0 +1,32 @@ +#pragma once + +namespace console +{ + class lock + { + public: + lock(); + ~lock(); + + lock(lock&&) = delete; + lock(const lock&) = delete; + lock& operator=(lock&&) = delete; + lock& operator=(const lock&) = delete; + }; + + void reset_color(); + + void info(const char* message, ...); + void warn(const char* message, ...); + void error(const char* message, ...); + void log(const char* message, ...); + + void set_title(const std::string& title); + + class signal_handler : std::lock_guard + { + public: + signal_handler(std::function callback); + ~signal_handler(); + }; +} diff --git a/src/crypto_key.cpp b/src/crypto_key.cpp new file mode 100644 index 0000000..372f35a --- /dev/null +++ b/src/crypto_key.cpp @@ -0,0 +1,76 @@ +#include "std_include.hpp" + +#include "utils/io.hpp" +#include "utils/cryptography.hpp" + +#include "crypto_key.hpp" +#include "console.hpp" + +namespace crypto_key +{ + namespace + { + bool load_key(utils::cryptography::ecc::key& key) + { + std::string data{}; + if (!utils::io::read_file("./private.key", &data)) + { + return false; + } + + key.deserialize(data); + if (!key.is_valid()) + { + console::warn("Loaded key is invalid!"); + return false; + } + + return true; + } + + utils::cryptography::ecc::key generate_key() + { + auto key = utils::cryptography::ecc::generate_key(512); + if (!key.is_valid()) + { + throw std::runtime_error("Failed to generate server key!"); + } + + if (!utils::io::write_file("./private.key", key.serialize())) + { + throw std::runtime_error("Failed to write server key!"); + } + + console::info("Generated cryptographic key: %llX", key.get_hash()); + return key; + } + + utils::cryptography::ecc::key load_or_generate_key() + { + utils::cryptography::ecc::key key{}; + if (load_key(key)) + { + console::log("Loaded cryptographic key: %llX", key.get_hash()); + return key; + } + + return generate_key(); + } + + utils::cryptography::ecc::key get_key_internal() + { + auto key = load_or_generate_key(); + if (!utils::io::write_file("./public.key", key.get_public_key())) + { + console::error("Failed to write public key!"); + } + return key; + } + } + + const utils::cryptography::ecc::key& get() + { + static auto key = get_key_internal(); + return key; + } +} diff --git a/src/crypto_key.hpp b/src/crypto_key.hpp new file mode 100644 index 0000000..ac22073 --- /dev/null +++ b/src/crypto_key.hpp @@ -0,0 +1,6 @@ +#pragma once + +namespace crypto_key +{ + const utils::cryptography::ecc::key& get(); +} diff --git a/src/main.cpp b/src/main.cpp new file mode 100644 index 0000000..158d84e --- /dev/null +++ b/src/main.cpp @@ -0,0 +1,132 @@ +#include + +#include "utils/cryptography.hpp" + +#include "console.hpp" +#include "crypto_key.hpp" + +#include "network/address.hpp" +#include "network/socket.hpp" + +using namespace std::literals; + +namespace +{ + utils::cryptography::ecc::key key; + + const char* master_address = "master.xlabs.dev"; + std::uint16_t master_port = 20810; + const char* to_kill = nullptr; + const char* to_remove = nullptr; + const char* reason = "Admin abuse, please demote"; + + std::string format_command(const bool add) + { + std::string cmd = "\xFF\xFF\xFF\xFFpatchkill"; + + const auto current_timestamp = std::chrono::duration_cast(std::chrono::system_clock::now().time_since_epoch()); + const std::string to_sign = std::to_string(current_timestamp.count()); + + cmd += " " + to_sign; + + const auto signed_timestamp = utils::cryptography::ecc::sign_message(key, to_sign); + + cmd += " " + utils::cryptography::base64::encode(signed_timestamp); + + cmd += " " + (add ? "add"s : "remove"s); + + cmd += " " + (add ? std::string(to_kill) : std::string(to_remove)); + + cmd += " " + std::string(reason); + + return cmd; + } + + void unsafe_main() + { + key = crypto_key::get(); + console::log("Loaded cryptographic key %llX", key.get_hash()); + + network::address master(master_address); + master.set_port(master_port); + + const network::socket s; + + if (to_kill != nullptr) + { + const auto packet = format_command(true); + s.send(master, packet); + + console::log("Sent kill command to %s", master.to_string().data()); + } + else if (to_remove != nullptr) + { + const auto packet = format_command(false); + s.send(master, packet); + + console::log("Sent remove command to %s", master.to_string().data()); + } + } + + void usage(const char* prog) + { + console::error("X Labs Master Tool\n" + "Usage: %s OPTIONS\n" + " -master IP - set the target, default: '%s'\n" + " -port PORT - set the port, default: %hu\n" + " -add IP - remove ip address from the server list\n" + " -remove IP - allow ip address back on the server list\n" + " -reason - set a reason, default: '%s'", + prog, master_address, master_port, reason + ); + } +} + +int main(const int argc, const char** argv) +{ + console::set_title("X Labs Master Tool"); + console::log("Starting X Labs Master Tool"); + + // Parse command-line flags + for (auto i = 1; i < argc; i++) + { + if(std::strcmp(argv[i], "-master") == 0) + { + master_address = argv[++i]; + } + else if (std::strcmp(argv[i], "-port") == 0) + { + master_port = static_cast(std::strtol(argv[++i], nullptr, 0)); + } + else if (std::strcmp(argv[i], "-add") == 0) + { + to_kill = argv[++i]; + } + else if (std::strcmp(argv[i], "-remove") == 0) + { + to_remove = argv[++i]; + } + else if (std::strcmp(argv[i], "-reason") == 0) + { + reason = argv[++i]; + } + else + { + usage(argv[0]); + return -1; + } + } + + try + { + unsafe_main(); + } + catch (const std::exception& ex) + { + console::error("Fatal error: %s", ex.what()); + return -1; + } + + console::log("Terminating tool..."); + return 0; +} diff --git a/src/network/address.cpp b/src/network/address.cpp new file mode 100644 index 0000000..a3e1092 --- /dev/null +++ b/src/network/address.cpp @@ -0,0 +1,161 @@ +#include + +#include "network/address.hpp" + +using namespace std::literals; + +namespace network +{ + address::address() + { + std::memset(&this->address_, 0, sizeof(this->address_)); + } + + address::address(const std::string& addr) + : address() + { + this->parse(addr); + } + + address::address(sockaddr_in& addr) + { + this->address_ = addr; + } + + bool address::operator==(const address& obj) const + { + return this->address_.sin_family == obj.address_.sin_family // + && this->address_.sin_addr.s_addr == obj.address_.sin_addr.s_addr // + && this->address_.sin_port == obj.address_.sin_port; + } + + void address::set_ipv4(const in_addr addr) + { + this->address_.sin_family = AF_INET; + this->address_.sin_addr = addr; + } + + void address::set_port(const unsigned short port) + { + this->address_.sin_port = htons(port); + } + + unsigned short address::get_port() const + { + return ntohs(this->address_.sin_port); + } + + std::string address::to_string(bool with_port) const + { + char buffer[1000]{}; + inet_ntop(this->address_.sin_family, &this->address_.sin_addr, buffer, sizeof(buffer)); + + auto address = std::string(buffer); + if (with_port) + { + address += ":"s + std::to_string(this->get_port()); + } + + return address; + } + + bool address::is_local() const + { + // According to: https://en.wikipedia.org/wiki/Private_network + + std::uint8_t bytes[4]; + *reinterpret_cast(&bytes) = this->address_.sin_addr.s_addr; + + // 10.X.X.X + if (bytes[0] == 10) + { + return true; + } + + // 192.168.X.X + if (bytes[0] == 192 + && bytes[1] == 168) + { + return true; + } + + // 172.16.X.X - 172.31.X.X + if (bytes[0] == 172 + && bytes[1] >= 16 + && bytes[1] < 32) + { + return true; + } + + // 127.0.0.1 + if (this->address_.sin_addr.s_addr == 0x0100007F) + { + return true; + } + + return false; + } + + sockaddr& address::get_addr() + { + return reinterpret_cast(this->get_in_addr()); + } + + const sockaddr& address::get_addr() const + { + return reinterpret_cast(this->get_in_addr()); + } + + sockaddr_in& address::get_in_addr() + { + return this->address_; + } + + const sockaddr_in& address::get_in_addr() const + { + return this->address_; + } + + void address::parse(std::string addr) + { + const auto pos = addr.find_last_of(':'); + if (pos != std::string::npos) + { + auto port = addr.substr(pos + 1); + this->set_port(static_cast(std::strtol(port.data(), nullptr, 10))); + + addr = addr.substr(0, pos); + } + + this->resolve(addr); + } + + void address::resolve(const std::string& hostname) + { + addrinfo* result = nullptr; + if (!getaddrinfo(hostname.data(), nullptr, nullptr, &result)) + { + for (auto* i = result; i; i = i->ai_next) + { + if (i->ai_addr->sa_family == AF_INET) + { + const auto port = this->get_port(); + std::memcpy(&this->address_, i->ai_addr, sizeof(this->address_)); + this->set_port(port); + + break; + } + } + + freeaddrinfo(result); + } + } +} + +std::size_t std::hash::operator()(const network::address& a) const noexcept +{ + const auto h1 = std::hash{}(a.get_in_addr().sin_family); + const auto h2 = std::hash{}(a.get_in_addr().sin_addr.s_addr); + const auto h3 = std::hash{}(a.get_in_addr().sin_port); + return h1 ^ (h2 << 1) ^ (h3 << 2); +} diff --git a/src/network/address.hpp b/src/network/address.hpp new file mode 100644 index 0000000..d3ef065 --- /dev/null +++ b/src/network/address.hpp @@ -0,0 +1,46 @@ +#pragma once + +namespace network +{ + class address + { + public: + address(); + address(const std::string& addr); + address(sockaddr_in& addr); + + void set_ipv4(in_addr addr); + void set_port(unsigned short port); + [[nodiscard]] unsigned short get_port() const; + + [[nodiscard]] sockaddr& get_addr(); + [[nodiscard]] const sockaddr& get_addr() const; + [[nodiscard]] sockaddr_in& get_in_addr(); + [[nodiscard]] const sockaddr_in& get_in_addr() const; + + [[nodiscard]] bool is_local() const; + [[nodiscard]] std::string to_string(bool with_port = true) const; + + bool operator==(const address& obj) const; + + bool operator!=(const address& obj) const + { + return !(*this == obj); + } + + private: + sockaddr_in address_{}; + + void parse(std::string addr); + void resolve(const std::string& hostname); + }; +} + +namespace std +{ + template <> + struct hash + { + std::size_t operator()(const network::address& a) const noexcept; + }; +} diff --git a/src/network/socket.cpp b/src/network/socket.cpp new file mode 100644 index 0000000..bdba446 --- /dev/null +++ b/src/network/socket.cpp @@ -0,0 +1,131 @@ +#include + +#include "address.hpp" +#include "socket.hpp" + +using namespace std::literals; + +namespace network +{ + namespace + { +#ifdef _WIN32 + [[maybe_unused]] class wsa_initializer + { + public: + wsa_initializer() + { + WSADATA wsa_data; + if (WSAStartup(MAKEWORD(2, 2), &wsa_data)) + { + throw std::runtime_error("Unable to initialize WSA"); + } + } + + ~wsa_initializer() + { + WSACleanup(); + } + } _; +#endif + } + + socket::socket() + { + this->socket_ = ::socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP); + } + + socket::~socket() + { + if (this->socket_ != INVALID_SOCKET) + { +#ifdef _WIN32 + closesocket(this->socket_); +#else + close(this->socket_); +#endif + } + } + + socket::socket(socket&& obj) noexcept + { + this->operator=(std::move(obj)); + } + + socket& socket::operator=(socket&& obj) noexcept + { + if (this != &obj) + { + this->~socket(); + this->socket_ = obj.socket_; + obj.socket_ = INVALID_SOCKET; + } + + return *this; + } + + bool socket::bind(const address& target) + { + return ::bind(this->socket_, &target.get_addr(), sizeof(target.get_addr())) == 0; + } + + void socket::send(const address& target, const std::string& data) const + { + ::sendto(this->socket_, data.data(), static_cast(data.size()), 0, &target.get_addr(), sizeof(target.get_addr())); + } + + bool socket::receive(address& source, std::string& data) const + { + char buffer[0x2000]{}; + socklen_t len = sizeof(source.get_in_addr()); + + const auto result = recvfrom(this->socket_, buffer, sizeof(buffer), 0, &source.get_addr(), &len); + if (result == SOCKET_ERROR) // Probably WSAEWOULDBLOCK + { + return false; + } + + data.assign(buffer, buffer + result); + return true; + } + + bool socket::set_blocking(const bool blocking) + { +#ifdef _WIN32 + unsigned long mode = blocking ? 0 : 1; + return ioctlsocket(this->socket_, FIONBIO, &mode) == 0; +#else + int flags = fcntl(this->socket_, F_GETFL, 0); + if (flags == -1) return false; + flags = blocking ? (flags & ~O_NONBLOCK) : (flags | O_NONBLOCK); + return fcntl(this->socket_, F_SETFL, flags) == 0; +#endif + } + + bool socket::sleep(const std::chrono::milliseconds timeout) const + { + fd_set fdr; + FD_ZERO(&fdr); + FD_SET(this->socket_, &fdr); + + const auto msec = timeout.count(); + + timeval tv{}; + tv.tv_sec = static_cast(msec / 1000ll); + tv.tv_usec = static_cast((msec % 1000) * 1000); + + const auto ret_val = select(static_cast(this->socket_) + 1, &fdr, nullptr, nullptr, &tv); + if (ret_val == SOCKET_ERROR) + { + std::this_thread::sleep_for(1ms); + return socket_is_ready; + } + + if (ret_val > 0) + { + return socket_is_ready; + } + + return !socket_is_ready; + } +} diff --git a/src/network/socket.hpp b/src/network/socket.hpp new file mode 100644 index 0000000..dabc904 --- /dev/null +++ b/src/network/socket.hpp @@ -0,0 +1,38 @@ +#pragma once + +namespace network +{ + class socket + { + public: + socket(); + ~socket(); + + socket(const socket& obj) = delete; + socket& operator=(const socket& obj) = delete; + + socket(socket&& obj) noexcept; + socket& operator=(socket&& obj) noexcept; + + bool bind(const address& target); + + void send(const address& target, const std::string& data) const; + bool receive(address& source, std::string& data) const; + + bool set_blocking(bool blocking); + + static const bool socket_is_ready = true; + bool sleep(std::chrono::milliseconds timeout) const; + + private: +#ifdef _WIN32 + using socklen_t = int; +#else + using SOCKET = int; +#define INVALID_SOCKET (SOCKET)(~0) +#define SOCKET_ERROR (-1) +#endif + + SOCKET socket_ = INVALID_SOCKET; + }; +} diff --git a/src/std_include.cpp b/src/std_include.cpp new file mode 100644 index 0000000..9df2f5e --- /dev/null +++ b/src/std_include.cpp @@ -0,0 +1,33 @@ +#include + +extern "C" +{ + int s_read_arc4random(void*, std::size_t) + { + return -1; + } + +#if !defined(__linux__) + int s_read_getrandom(void*, std::size_t) + { + return -1; + } +#endif + +#ifdef _WIN32 + int s_read_urandom(void*, std::size_t) + { + return -1; + } + + int s_read_ltm_rng(void*, std::size_t) + { + return -1; + } +#else + int s_read_wincsp(void*, std::size_t) + { + return -1; + } +#endif +} diff --git a/src/std_include.hpp b/src/std_include.hpp new file mode 100644 index 0000000..9d57908 --- /dev/null +++ b/src/std_include.hpp @@ -0,0 +1,96 @@ +#pragma once + +#ifdef _WIN32 + +#pragma warning(push) +#pragma warning(disable: 4018) +#pragma warning(disable: 4100) +#pragma warning(disable: 4127) +#pragma warning(disable: 4244) +#pragma warning(disable: 4297) +#pragma warning(disable: 4458) +#pragma warning(disable: 4702) +#pragma warning(disable: 4804) +#pragma warning(disable: 4806) +#pragma warning(disable: 4996) +#pragma warning(disable: 5054) +#pragma warning(disable: 6011) +#pragma warning(disable: 6297) +#pragma warning(disable: 6385) +#pragma warning(disable: 6386) +#pragma warning(disable: 6387) +#pragma warning(disable: 26110) +#pragma warning(disable: 26451) +#pragma warning(disable: 26444) +#pragma warning(disable: 26451) +#pragma warning(disable: 26489) +#pragma warning(disable: 26495) +#pragma warning(disable: 26498) +#pragma warning(disable: 26812) +#pragma warning(disable: 28020) + +#define WIN32_LEAN_AND_MEAN + +#include +#include +#include + +#else + +#pragma GCC diagnostic push +#ifndef __APPLE__ +#pragma GCC diagnostic ignored "-Wbool-compare" +#endif +#pragma GCC diagnostic ignored "-Wlogical-not-parentheses" + +#include +#include +#include +#include +#include +#include +#include + +#endif + +// min and max is required by gdi, therefore NOMINMAX won't work +#ifdef max + #undef max +#endif + +#ifdef min + #undef min +#endif + +#include +#include +#include +#include +#include + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include + +#ifdef _WIN32 +#pragma warning(pop) +#pragma warning(disable: 4100) + +#pragma comment(lib, "ntdll.lib") +#pragma comment(lib, "ws2_32.lib") +#pragma comment(lib, "urlmon.lib" ) +#pragma comment(lib, "iphlpapi.lib") +#else +#pragma GCC diagnostic pop +#endif diff --git a/src/utils/cryptography.cpp b/src/utils/cryptography.cpp new file mode 100644 index 0000000..e75a605 --- /dev/null +++ b/src/utils/cryptography.cpp @@ -0,0 +1,639 @@ +#include + +#include "string.hpp" +#include "cryptography.hpp" + +using namespace std::literals; + +/// http://www.opensource.apple.com/source/CommonCrypto/CommonCrypto-55010/Source/libtomcrypt/doc/libTomCryptDoc.pdf + +namespace utils::cryptography +{ + namespace + { + struct __ + { + __() + { + ltc_mp = ltm_desc; + + register_cipher(&aes_desc); + register_cipher(&des3_desc); + + register_prng(&sprng_desc); + register_prng(&fortuna_desc); + register_prng(&yarrow_desc); + + register_hash(&sha1_desc); + register_hash(&sha256_desc); + register_hash(&sha512_desc); + } + } ___; + + [[maybe_unused]] const char* cs(const std::uint8_t* data) + { + return reinterpret_cast(data); + } + + [[maybe_unused]] char* cs(std::uint8_t* data) + { + return reinterpret_cast(data); + } + + [[maybe_unused]] const std::uint8_t* cs(const char* data) + { + return reinterpret_cast(data); + } + + [[maybe_unused]] std::uint8_t* cs(char* data) + { + return reinterpret_cast(data); + } + + [[maybe_unused]] unsigned long ul(const std::size_t value) + { + return static_cast(value); + } + + class prng + { + public: + prng(const ltc_prng_descriptor& descriptor, const bool autoseed = true) + : state_(std::make_unique()) + , descriptor_(descriptor) + { + this->id_ = register_prng(&descriptor); + if (this->id_ == -1) + { + throw std::runtime_error("PRNG "s + this->descriptor_.name + " could not be registered!"); + } + + if (autoseed) + { + this->auto_seed(); + } + else + { + this->descriptor_.start(this->state_.get()); + } + } + + ~prng() + { + this->descriptor_.done(this->state_.get()); + } + + prng_state* get_state() const + { + this->descriptor_.ready(this->state_.get()); + return this->state_.get(); + } + + int get_id() const + { + return this->id_; + } + + void add_entropy(const void* data, const std::size_t length) const + { + this->descriptor_.add_entropy(static_cast(data), ul(length), this->state_.get()); + } + + void read(void* data, const std::size_t length) const + { + this->descriptor_.read(static_cast(data), ul(length), this->get_state()); + } + + private: + int id_; + std::unique_ptr state_; + const ltc_prng_descriptor& descriptor_; + + void auto_seed() const + { + rng_make_prng(128, this->id_, this->state_.get(), nullptr); + + int i[4]; // uninitialized data + auto* i_ptr = &i; + this->add_entropy(reinterpret_cast(&i), sizeof(i)); + this->add_entropy(reinterpret_cast(&i_ptr), sizeof(i_ptr)); + + auto t = time(nullptr); + this->add_entropy(reinterpret_cast(&t), sizeof(t)); + } + }; + + const prng prng_(fortuna_desc); + } + + ecc::key::key() + { + ZeroMemory(&this->key_storage_, sizeof(this->key_storage_)); + } + + ecc::key::~key() + { + this->free(); + } + + ecc::key::key(key&& obj) noexcept + : key() + { + this->operator=(std::move(obj)); + } + + ecc::key::key(const key& obj) + : key() + { + this->operator=(obj); + } + + ecc::key& ecc::key::operator=(key&& obj) noexcept + { + if (this != &obj) + { + std::memmove(&this->key_storage_, &obj.key_storage_, sizeof(this->key_storage_)); + ZeroMemory(&obj.key_storage_, sizeof(obj.key_storage_)); + } + + return *this; + } + + ecc::key& ecc::key::operator=(const key& obj) + { + if (this != &obj && obj.is_valid()) + { + this->deserialize(obj.serialize(obj.key_storage_.type)); + } + + return *this; + } + + bool ecc::key::is_valid() const + { + return (!memory::is_set(&this->key_storage_, 0, sizeof(this->key_storage_))); + } + + ecc_key& ecc::key::get() + { + return this->key_storage_; + } + + const ecc_key& ecc::key::get() const + { + return this->key_storage_; + } + + std::string ecc::key::get_public_key() const + { + std::uint8_t buffer[512]{}; + unsigned long length = sizeof(buffer); + + if (ecc_ansi_x963_export(&this->key_storage_, buffer, &length) == CRYPT_OK) + { + return std::string(cs(buffer), length); + } + + return {}; + } + + void ecc::key::set(const std::string& pub_key_buffer) + { + this->free(); + + if (ecc_ansi_x963_import(cs(pub_key_buffer.data()), + ul(pub_key_buffer.size()), + &this->key_storage_) != CRYPT_OK) + { + ZeroMemory(&this->key_storage_, sizeof(this->key_storage_)); + } + } + + void ecc::key::deserialize(const std::string& key) + { + this->free(); + + if (ecc_import(cs(key.data()), ul(key.size()), + &this->key_storage_) != CRYPT_OK + ) + { + ZeroMemory(&this->key_storage_, sizeof(this->key_storage_)); + } + } + + std::string ecc::key::serialize(const int type) const + { + std::uint8_t buffer[4096]{}; + unsigned long length = sizeof(buffer); + + if (ecc_export(buffer, &length, type, &this->key_storage_) == CRYPT_OK) + { + return std::string(cs(buffer), length); + } + + return ""; + } + + void ecc::key::free() + { + if (this->is_valid()) + { + ecc_free(&this->key_storage_); + } + + ZeroMemory(&this->key_storage_, sizeof(this->key_storage_)); + } + + bool ecc::key::operator==(key& key) const + { + return (this->is_valid() && key.is_valid() && this->serialize(PK_PUBLIC) == key.serialize(PK_PUBLIC)); + } + + std::uint64_t ecc::key::get_hash() const + { + const auto hash = sha1::compute(this->get_public_key()); + if (hash.size() >= 8) + { + return *reinterpret_cast(hash.data()); + } + + return 0; + } + + ecc::key ecc::generate_key(const int bits) + { + key key; + ecc_make_key(prng_.get_state(), prng_.get_id(), bits / 8, &key.get()); + + return key; + } + + ecc::key ecc::generate_key(const int bits, const std::string& entropy) + { + key key{}; + const prng yarrow(yarrow_desc, false); + yarrow.add_entropy(entropy.data(), entropy.size()); + + ecc_make_key(yarrow.get_state(), yarrow.get_id(), bits / 8, &key.get()); + + return key; + } + + std::string ecc::sign_message(const key& key, const std::string& message) + { + if (!key.is_valid()) return ""; + + std::uint8_t buffer[512]{}; + unsigned long length = sizeof(buffer); + + ecc_sign_hash(cs(message.data()), ul(message.size()), buffer, &length, prng_.get_state(), prng_.get_id(), + &key.get()); + + return std::string(cs(buffer), length); + } + + bool ecc::verify_message(const key& key, const std::string& message, const std::string& signature) + { + if (!key.is_valid()) return false; + + auto result = 0; + return (ecc_verify_hash(cs(signature.data()), + ul(signature.size()), + cs(message.data()), + ul(message.size()), &result, + &key.get()) == CRYPT_OK && result != 0); + } + + bool ecc::encrypt(const key& key, std::string& data) + { + std::string out_data{}; + out_data.resize(std::max(ul(data.size() * 3), ul(0x100))); + + auto out_len = ul(out_data.size()); + auto crypt = [&]() + { + return ecc_encrypt_key(cs(data.data()), ul(data.size()), cs(out_data.data()), &out_len, + prng_.get_state(), prng_.get_id(), find_hash("sha512"), &key.get()); + }; + + auto res = crypt(); + + if (res == CRYPT_BUFFER_OVERFLOW) + { + out_data.resize(out_len); + res = crypt(); + } + + if (res != CRYPT_OK) + { + return false; + } + + out_data.resize(out_len); + data = std::move(out_data); + return true; + } + + bool ecc::decrypt(const key& key, std::string& data) + { + std::string out_data{}; + out_data.resize(std::max(ul(data.size() * 3), ul(0x100))); + + auto out_len = ul(out_data.size()); + auto crypt = [&]() + { + return ecc_decrypt_key(cs(data.data()), ul(data.size()), cs(out_data.data()), &out_len, &key.get()); + }; + + auto res = crypt(); + + if (res == CRYPT_BUFFER_OVERFLOW) + { + out_data.resize(out_len); + res = crypt(); + } + + if (res != CRYPT_OK) + { + return false; + } + + out_data.resize(out_len); + data = std::move(out_data); + return true; + } + + std::string rsa::encrypt(const std::string& data, const std::string& hash, const std::string& key) + { + rsa_key new_key; + rsa_import(cs(key.data()), ul(key.size()), &new_key); + const auto _ = gsl::finally([&]() + { + rsa_free(&new_key); + }); + + + std::string out_data{}; + out_data.resize(std::max(ul(data.size() * 3), ul(0x100))); + + auto out_len = ul(out_data.size()); + auto crypt = [&]() + { + return rsa_encrypt_key(cs(data.data()), ul(data.size()), cs(out_data.data()), &out_len, cs(hash.data()), + ul(hash.size()), prng_.get_state(), prng_.get_id(), find_hash("sha512"), &new_key); + }; + + auto res = crypt(); + + if (res == CRYPT_BUFFER_OVERFLOW) + { + out_data.resize(out_len); + res = crypt(); + } + + if (res == CRYPT_OK) + { + out_data.resize(out_len); + return out_data; + } + + return {}; + } + + std::string des3::encrypt(const std::string& data, const std::string& iv, const std::string& key) + { + std::string enc_data; + enc_data.resize(data.size()); + + symmetric_CBC cbc; + const auto des3 = find_cipher("3des"); + + cbc_start(des3, cs(iv.data()), cs(key.data()), static_cast(key.size()), 0, &cbc); + cbc_encrypt(cs(data.data()), cs(enc_data.data()), ul(data.size()), &cbc); + cbc_done(&cbc); + + return enc_data; + } + + std::string des3::decrypt(const std::string& data, const std::string& iv, const std::string& key) + { + std::string dec_data; + dec_data.resize(data.size()); + + symmetric_CBC cbc; + const auto des3 = find_cipher("3des"); + + cbc_start(des3, cs(iv.data()), cs(key.data()), static_cast(key.size()), 0, &cbc); + cbc_decrypt(cs(data.data()), cs(dec_data.data()), ul(data.size()), &cbc); + cbc_done(&cbc); + + return dec_data; + } + + std::string tiger::compute(const std::string& data, const bool hex) + { + return compute(cs(data.data()), data.size(), hex); + } + + std::string tiger::compute(const std::uint8_t* data, const std::size_t length, const bool hex) + { + std::uint8_t buffer[24]{}; + + hash_state state; + tiger_init(&state); + tiger_process(&state, data, ul(length)); + tiger_done(&state, buffer); + + std::string hash(cs(buffer), sizeof(buffer)); + if (!hex) return hash; + + return string::dump_hex(hash, ""); + } + + std::string aes::encrypt(const std::string& data, const std::string& iv, const std::string& key) + { + std::string enc_data; + enc_data.resize(data.size()); + + symmetric_CBC cbc; + const auto aes = find_cipher("aes"); + + cbc_start(aes, cs(iv.data()), cs(key.data()), + static_cast(key.size()), 0, &cbc); + cbc_encrypt(cs(data.data()), + cs(enc_data.data()), + ul(data.size()), &cbc); + cbc_done(&cbc); + + return enc_data; + } + + std::string aes::decrypt(const std::string& data, const std::string& iv, const std::string& key) + { + std::string dec_data; + dec_data.resize(data.size()); + + symmetric_CBC cbc; + const auto aes = find_cipher("aes"); + + cbc_start(aes, cs(iv.data()), cs(key.data()), + static_cast(key.size()), 0, &cbc); + cbc_decrypt(cs(data.data()), + cs(dec_data.data()), + ul(data.size()), &cbc); + cbc_done(&cbc); + + return dec_data; + } + + std::string hmac_sha1::compute(const std::string& data, const std::string& key) + { + std::string buffer; + buffer.resize(20); + + hmac_state state; + hmac_init(&state, find_hash("sha1"), cs(key.data()), ul(key.size())); + hmac_process(&state, cs(data.data()), static_cast(data.size())); + + auto out_len = ul(buffer.size()); + hmac_done(&state, cs(buffer.data()), &out_len); + + buffer.resize(out_len); + return buffer; + } + + std::string sha1::compute(const std::string& data, const bool hex) + { + return compute(cs(data.data()), data.size(), hex); + } + + std::string sha1::compute(const std::uint8_t* data, const size_t length, const bool hex) + { + std::uint8_t buffer[20]{}; + + hash_state state; + sha1_init(&state); + sha1_process(&state, data, ul(length)); + sha1_done(&state, buffer); + + std::string hash(cs(buffer), sizeof(buffer)); + if (!hex) return hash; + + return string::dump_hex(hash, ""); + } + + std::string sha256::compute(const std::string& data, const bool hex) + { + return compute(cs(data.data()), data.size(), hex); + } + + std::string sha256::compute(const std::uint8_t* data, const std::size_t length, const bool hex) + { + std::uint8_t buffer[32]{}; + + hash_state state; + sha256_init(&state); + sha256_process(&state, data, ul(length)); + sha256_done(&state, buffer); + + std::string hash(cs(buffer), sizeof(buffer)); + if (!hex) return hash; + + return string::dump_hex(hash, ""); + } + + std::string sha512::compute(const std::string& data, const bool hex) + { + return compute(cs(data.data()), data.size(), hex); + } + + std::string sha512::compute(const std::uint8_t* data, const std::size_t length, const bool hex) + { + std::uint8_t buffer[64]{}; + + hash_state state; + sha512_init(&state); + sha512_process(&state, data, ul(length)); + sha512_done(&state, buffer); + + std::string hash(cs(buffer), sizeof(buffer)); + if (!hex) return hash; + + return string::dump_hex(hash, ""); + } + + std::string base64::encode(const std::uint8_t* data, const std::size_t len) + { + std::string result; + result.resize((len + 2) * 2); + + auto out_len = ul(result.size()); + if (base64_encode(data, ul(len), result.data(), &out_len) != CRYPT_OK) + { + return {}; + } + + result.resize(out_len); + return result; + } + + std::string base64::encode(const std::string& data) + { + return base64::encode(cs(data.data()), static_cast(data.size())); + } + + std::string base64::decode(const std::string& data) + { + std::string result; + result.resize((data.size() + 2) * 2); + + auto out_len = ul(result.size()); + if (base64_decode(data.data(), ul(data.size()), cs(result.data()), &out_len) != CRYPT_OK) + { + return {}; + } + + result.resize(out_len); + return result; + } + + unsigned int jenkins_one_at_a_time::compute(const std::string& data) + { + return compute(data.data(), data.size()); + } + + unsigned int jenkins_one_at_a_time::compute(const char* key, const std::size_t len) + { + unsigned int hash, i; + for (hash = i = 0; i < len; ++i) + { + hash += key[i]; + hash += (hash << 10); + hash ^= (hash >> 6); + } + hash += (hash << 3); + hash ^= (hash >> 11); + hash += (hash << 15); + return hash; + } + + std::uint32_t random::get_integer() + { + std::uint32_t result; + get_data(&result, sizeof(result)); + return result; + } + + std::string random::get_challenge() + { + std::string result; + result.resize(sizeof(std::uint32_t)); + get_data(result.data(), result.size()); + return string::dump_hex(result, ""); + } + + void random::get_data(void* data, const std::size_t size) + { + prng_.read(data, size); + } +} diff --git a/src/utils/cryptography.hpp b/src/utils/cryptography.hpp new file mode 100644 index 0000000..25aa4dc --- /dev/null +++ b/src/utils/cryptography.hpp @@ -0,0 +1,118 @@ +#pragma once + +#include +#include + +namespace utils::cryptography +{ + namespace ecc + { + class key final + { + public: + key(); + ~key(); + + key(key&& obj) noexcept; + key(const key& obj); + key& operator=(key&& obj) noexcept; + key& operator=(const key& obj); + + [[nodiscard]] bool is_valid() const; + + ecc_key& get(); + [[nodiscard]] const ecc_key& get() const; + + [[nodiscard]] std::string get_public_key() const; + + void set(const std::string& pub_key_buffer); + + void deserialize(const std::string& key); + + [[nodiscard]] std::string serialize(int type = PK_PRIVATE) const; + + void free(); + + bool operator==(key& key) const; + + [[nodiscard]] std::uint64_t get_hash() const; + + private: + ecc_key key_storage_{}; + }; + + key generate_key(int bits); + key generate_key(int bits, const std::string& entropy); + std::string sign_message(const key& key, const std::string& message); + bool verify_message(const key& key, const std::string& message, const std::string& signature); + + bool encrypt(const key& key, std::string& data); + bool decrypt(const key& key, std::string& data); + } + + namespace rsa + { + std::string encrypt(const std::string& data, const std::string& hash, const std::string& key); + } + + namespace des3 + { + std::string encrypt(const std::string& data, const std::string& iv, const std::string& key); + std::string decrypt(const std::string& data, const std::string& iv, const std::string& key); + } + + namespace tiger + { + std::string compute(const std::string& data, bool hex = false); + std::string compute(const std::uint8_t* data, std::size_t length, bool hex = false); + } + + namespace aes + { + std::string encrypt(const std::string& data, const std::string& iv, const std::string& key); + std::string decrypt(const std::string& data, const std::string& iv, const std::string& key); + } + + namespace hmac_sha1 + { + std::string compute(const std::string& data, const std::string& key); + } + + namespace sha1 + { + std::string compute(const std::string& data, bool hex = false); + std::string compute(const std::uint8_t* data, std::size_t length, bool hex = false); + } + + namespace sha256 + { + std::string compute(const std::string& data, bool hex = false); + std::string compute(const std::uint8_t* data, std::size_t length, bool hex = false); + } + + namespace sha512 + { + std::string compute(const std::string& data, bool hex = false); + std::string compute(const std::uint8_t* data, std::size_t length, bool hex = false); + } + + namespace base64 + { + std::string encode(const std::uint8_t* data, std::size_t len); + std::string encode(const std::string& data); + std::string decode(const std::string& data); + } + + namespace jenkins_one_at_a_time + { + std::uint32_t compute(const std::string& data); + std::uint32_t compute(const char* key, std::size_t len); + }; + + namespace random + { + std::uint32_t get_integer(); + std::string get_challenge(); + void get_data(void* data, std::size_t size); + } +} diff --git a/src/utils/io.cpp b/src/utils/io.cpp new file mode 100644 index 0000000..c8f6317 --- /dev/null +++ b/src/utils/io.cpp @@ -0,0 +1,128 @@ +#include +#include "io.hpp" + +namespace utils::io +{ + bool remove_file(const std::string& file) + { + return remove(file.data()) == 0; + } + + bool move_file(const std::string& src, const std::string& target) + { + return rename(src.data(), target.data()) == 0; + } + + bool file_exists(const std::string& file) + { + return std::ifstream(file).good(); + } + + bool write_file(const std::string& file, const std::string& data, const bool append) + { + const auto pos = file.find_last_of("/\\"); + if (pos != std::string::npos) + { + create_directory(file.substr(0, pos)); + } + + auto mode = std::ios::binary | std::ofstream::out; + if (append) + { + mode |= std::ofstream::app; + } + + std::ofstream stream(file, mode); + + if (stream.is_open()) + { + stream.write(data.data(), static_cast(data.size())); + stream.close(); + return true; + } + + return false; + } + + std::string read_file(const std::string& file) + { + std::string data; + read_file(file, &data); + return data; + } + + bool read_file(const std::string& file, std::string* data) + { + if (!data) return false; + data->clear(); + + if (file_exists(file)) + { + std::ifstream stream(file, std::ios::binary); + if (!stream.is_open()) return false; + + stream.seekg(0, std::ios::end); + const std::streamsize size = stream.tellg(); + stream.seekg(0, std::ios::beg); + + if (size > -1) + { + data->resize(static_cast(size)); + stream.read(const_cast(data->data()), size); + stream.close(); + return true; + } + } + + return false; + } + + std::size_t file_size(const std::string& file) + { + if (file_exists(file)) + { + std::ifstream stream(file, std::ios::binary); + + if (stream.good()) + { + stream.seekg(0, std::ios::end); + return static_cast(stream.tellg()); + } + } + + return 0; + } + + bool create_directory(const std::string& directory) + { + return std::filesystem::create_directories(directory); + } + + bool directory_exists(const std::string& directory) + { + return std::filesystem::is_directory(directory); + } + + bool directory_is_empty(const std::string& directory) + { + return std::filesystem::is_empty(directory); + } + + std::vector list_files(const std::string& directory) + { + std::vector files; + + for (auto& file : std::filesystem::directory_iterator(directory)) + { + files.push_back(file.path().generic_string()); + } + + return files; + } + + void copy_folder(const std::filesystem::path& src, const std::filesystem::path& target) + { + std::filesystem::copy(src, target, std::filesystem::copy_options::overwrite_existing | + std::filesystem::copy_options::recursive); + } +} diff --git a/src/utils/io.hpp b/src/utils/io.hpp new file mode 100644 index 0000000..5dec1a5 --- /dev/null +++ b/src/utils/io.hpp @@ -0,0 +1,20 @@ +#pragma once + +#include +#include + +namespace utils::io +{ + bool remove_file(const std::string& file); + bool move_file(const std::string& src, const std::string& target); + bool file_exists(const std::string& file); + bool write_file(const std::string& file, const std::string& data, bool append = false); + bool read_file(const std::string& file, std::string* data); + std::string read_file(const std::string& file); + std::size_t file_size(const std::string& file); + bool create_directory(const std::string& directory); + bool directory_exists(const std::string& directory); + bool directory_is_empty(const std::string& directory); + std::vector list_files(const std::string& directory); + void copy_folder(const std::filesystem::path& src, const std::filesystem::path& target); +} diff --git a/src/utils/memory.cpp b/src/utils/memory.cpp new file mode 100644 index 0000000..2d8832d --- /dev/null +++ b/src/utils/memory.cpp @@ -0,0 +1,110 @@ +#include + +#include "memory.hpp" + +namespace utils +{ + memory::allocator memory::mem_allocator_; + + memory::allocator::~allocator() + { + this->clear(); + } + + void memory::allocator::clear() + { + std::lock_guard _(this->mutex_); + + for (auto& data : this->pool_) + { + memory::free(data); + } + + this->pool_.clear(); + } + + void memory::allocator::free(void* data) + { + std::lock_guard _(this->mutex_); + + const auto j = std::find(this->pool_.begin(), this->pool_.end(), data); + if (j != this->pool_.end()) + { + memory::free(data); + this->pool_.erase(j); + } + } + + void memory::allocator::free(const void* data) + { + this->free(const_cast(data)); + } + + void* memory::allocator::allocate(const size_t length) + { + std::lock_guard _(this->mutex_); + + const auto data = memory::allocate(length); + this->pool_.push_back(data); + return data; + } + + bool memory::allocator::empty() const + { + return this->pool_.empty(); + } + + char* memory::allocator::duplicate_string(const std::string& string) + { + std::lock_guard _(this->mutex_); + + const auto data = memory::duplicate_string(string); + this->pool_.push_back(data); + return data; + } + + void* memory::allocate(const size_t length) + { + return calloc(length, 1); + } + + char* memory::duplicate_string(const std::string& string) + { + const auto new_string = allocate_array(string.size() + 1); + std::memcpy(new_string, string.data(), string.size()); + return new_string; + } + + void memory::free(void* data) + { + if (data) + { + ::free(data); + } + } + + void memory::free(const void* data) + { + free(const_cast(data)); + } + + bool memory::is_set(const void* mem, const char chr, const size_t length) + { + auto* const mem_arr = static_cast(mem); + + for (size_t i = 0; i < length; ++i) + { + if (mem_arr[i] != chr) + { + return false; + } + } + + return true; + } + + memory::allocator* memory::get_allocator() + { + return &memory::mem_allocator_; + } +} diff --git a/src/utils/memory.hpp b/src/utils/memory.hpp new file mode 100644 index 0000000..a6f29e1 --- /dev/null +++ b/src/utils/memory.hpp @@ -0,0 +1,71 @@ +#pragma once + +#include +#include + +namespace utils +{ + class memory final + { + public: + class allocator final + { + public: + ~allocator(); + + void clear(); + + void free(void* data); + + void free(const void* data); + + void* allocate(size_t length); + + template + inline T* allocate() + { + return this->allocate_array(1); + } + + template + inline T* allocate_array(const size_t count = 1) + { + return static_cast(this->allocate(count * sizeof(T))); + } + + bool empty() const; + + char* duplicate_string(const std::string& string); + + private: + std::mutex mutex_; + std::vector pool_; + }; + + static void* allocate(size_t length); + + template + static inline T* allocate() + { + return allocate_array(1); + } + + template + static inline T* allocate_array(const size_t count = 1) + { + return static_cast(allocate(count * sizeof(T))); + } + + static char* duplicate_string(const std::string& string); + + static void free(void* data); + static void free(const void* data); + + static bool is_set(const void* mem, char chr, size_t length); + + static allocator* get_allocator(); + + private: + static allocator mem_allocator_; + }; +} diff --git a/src/utils/string.cpp b/src/utils/string.cpp new file mode 100644 index 0000000..626d373 --- /dev/null +++ b/src/utils/string.cpp @@ -0,0 +1,102 @@ +#include + +#include "string.hpp" +#include +#include +#include + +namespace utils::string +{ + const char* va(const char* fmt, ...) + { + static thread_local va_provider<8, 256> provider; + + va_list ap; + va_start(ap, fmt); + + const char* result = provider.get(fmt, ap); + + va_end(ap); + return result; + } + + std::vector split(const std::string& s, const char delim) + { + std::stringstream ss(s); + std::string item; + std::vector elems; + + while (std::getline(ss, item, delim)) + { + elems.push_back(item); + item = std::string(); + } + + return elems; + } + + std::string to_lower(std::string text) + { + std::transform(text.begin(), text.end(), text.begin(), [](const unsigned char input) + { + return static_cast(std::tolower(input)); + }); + + return text; + } + + std::string to_upper(std::string text) + { + std::transform(text.begin(), text.end(), text.begin(), [](const unsigned char input) + { + return static_cast(std::toupper(input)); + }); + + return text; + } + + bool starts_with(const std::string& text, const std::string& substring) + { + return text.find(substring) == 0; + } + + bool ends_with(const std::string& text, const std::string& substring) + { + if (substring.size() > text.size()) return false; + return std::equal(substring.rbegin(), substring.rend(), text.rbegin()); + } + + std::string replace(std::string str, const std::string& from, const std::string& to) + { + if (from.empty()) + { + return str; + } + + std::size_t start_pos = 0; + while ((start_pos = str.find(from, start_pos)) != std::string::npos) + { + str.replace(start_pos, from.length(), to); + start_pos += to.length(); + } + + return str; + } + + std::string dump_hex(const std::string& data, const std::string& separator) + { + std::string result; + + for (unsigned int i = 0; i < data.size(); ++i) + { + if (i > 0) + { + result.append(separator); + } + + result.append(va("%02X", data[i] & 0xFF)); + } + + return result; + } +} diff --git a/src/utils/string.hpp b/src/utils/string.hpp new file mode 100644 index 0000000..676214b --- /dev/null +++ b/src/utils/string.hpp @@ -0,0 +1,97 @@ +#pragma once +#include "memory.hpp" + +#ifndef ARRAYSIZE +template +size_t ARRAYSIZE(Type (&)[n]) { return n; } +#endif + +namespace utils::string +{ + template + class va_provider final + { + public: + static_assert(Buffers != 0 && MinBufferSize != 0, "Buffers and MinBufferSize mustn't be 0"); + + va_provider() : current_buffer_(0) + { + } + + char* get(const char* format, va_list ap) + { + ++this->current_buffer_ %= ARRAYSIZE(this->string_pool_); + auto entry = &this->string_pool_[this->current_buffer_]; + + if (!entry->size || !entry->buffer) + { + throw std::runtime_error("String pool not initialized"); + } + + while (true) + { +#ifdef _WIN32 + const int res = vsnprintf_s(entry->buffer, entry->size, _TRUNCATE, format, ap); +#else + const int res = vsnprintf(entry->buffer, entry->size, format, ap); +#endif + + if (res > 0) break; // Success + if (res == 0) return nullptr; // Error + + entry->double_size(); + } + + return entry->buffer; + } + + private: + class entry final + { + public: + explicit entry(const std::size_t _size = MinBufferSize) : size(_size), buffer(nullptr) + { + if (this->size < MinBufferSize) this->size = MinBufferSize; + this->allocate(); + } + + ~entry() + { + if (this->buffer) memory::get_allocator()->free(this->buffer); + this->size = 0; + this->buffer = nullptr; + } + + void allocate() + { + if (this->buffer) memory::get_allocator()->free(this->buffer); + this->buffer = memory::get_allocator()->allocate_array(this->size + 1); + } + + void double_size() + { + this->size *= 2; + this->allocate(); + } + + std::size_t size; + char* buffer; + }; + + std::size_t current_buffer_; + entry string_pool_[Buffers]; + }; + + const char* va(const char* fmt, ...); + + std::vector split(const std::string& s, char delim); + + std::string to_lower(std::string text); + std::string to_upper(std::string text); + bool starts_with(const std::string& text, const std::string& substring); + bool ends_with(const std::string& text, const std::string& substring); + + std::string replace(std::string str, const std::string& from, const std::string& to); + + std::string dump_hex(const std::string& data, const std::string& separator = " "); +} diff --git a/tools/premake5-linux b/tools/premake5-linux new file mode 100755 index 0000000..bcb51ce Binary files /dev/null and b/tools/premake5-linux differ diff --git a/tools/premake5-mac b/tools/premake5-mac new file mode 100755 index 0000000..48daa61 Binary files /dev/null and b/tools/premake5-mac differ diff --git a/tools/premake5.exe b/tools/premake5.exe new file mode 100644 index 0000000..1a637aa Binary files /dev/null and b/tools/premake5.exe differ