diff options
| -rw-r--r-- | .clang-format | 272 | ||||
| -rw-r--r-- | .gitignore | 5 | ||||
| -rw-r--r-- | .gitmodules | 3 | ||||
| -rw-r--r-- | LICENSE | 557 | ||||
| -rw-r--r-- | Makefile | 30 | ||||
| -rw-r--r-- | README | 3 | ||||
| -rw-r--r-- | include/net/client.hpp | 51 | ||||
| -rw-r--r-- | include/net/conn.hpp | 188 | ||||
| -rw-r--r-- | include/net/packet.hpp | 98 | ||||
| -rw-r--r-- | include/net/server.hpp | 65 | ||||
| -rw-r--r-- | include/net/types.hpp | 503 | ||||
| -rw-r--r-- | include/util/bitset.hpp | 48 | ||||
| -rw-r--r-- | include/util/endian.hpp | 21 | ||||
| -rw-r--r-- | include/version.hpp | 3 | ||||
| -rw-r--r-- | include/world/world.hpp | 12 | ||||
| -rw-r--r-- | src/kill_proxy.cpp | 80 |
16 files changed, 1939 insertions, 0 deletions
diff --git a/.clang-format b/.clang-format new file mode 100644 index 0000000..60d5ee5 --- /dev/null +++ b/.clang-format @@ -0,0 +1,272 @@ +--- +BasedOnStyle: WebKit +AccessModifierOffset: -4 +AlignAfterOpenBracket: DontAlign +AlignArrayOfStructures: None +AlignConsecutiveAssignments: + Enabled: false + AcrossEmptyLines: false + AcrossComments: false + AlignCompound: false + AlignFunctionPointers: false + PadOperators: true +AlignConsecutiveBitFields: + Enabled: false + AcrossEmptyLines: false + AcrossComments: false + AlignCompound: false + AlignFunctionPointers: false + PadOperators: false +AlignConsecutiveDeclarations: + Enabled: false + AcrossEmptyLines: false + AcrossComments: false + AlignCompound: false + AlignFunctionPointers: false + PadOperators: false +AlignConsecutiveMacros: + Enabled: false + AcrossEmptyLines: false + AcrossComments: false + AlignCompound: false + AlignFunctionPointers: false + PadOperators: false +AlignConsecutiveShortCaseStatements: + Enabled: false + AcrossEmptyLines: false + AcrossComments: false + AlignCaseArrows: false + AlignCaseColons: false +AlignConsecutiveTableGenBreakingDAGArgColons: + Enabled: false + AcrossEmptyLines: false + AcrossComments: false + AlignCompound: false + AlignFunctionPointers: false + PadOperators: false +AlignConsecutiveTableGenCondOperatorColons: + Enabled: false + AcrossEmptyLines: false + AcrossComments: false + AlignCompound: false + AlignFunctionPointers: false + PadOperators: false +AlignConsecutiveTableGenDefinitionColons: + Enabled: false + AcrossEmptyLines: false + AcrossComments: false + AlignCompound: false + AlignFunctionPointers: false + PadOperators: false +AlignEscapedNewlines: Right +AlignOperands: DontAlign +AlignTrailingComments: + Kind: Never + OverEmptyLines: 0 +AllowAllArgumentsOnNextLine: true +AllowAllParametersOfDeclarationOnNextLine: true +AllowBreakBeforeNoexceptSpecifier: Never +AllowShortBlocksOnASingleLine: Empty +AllowShortCaseExpressionOnASingleLine: true +AllowShortCaseLabelsOnASingleLine: false +AllowShortCompoundRequirementOnASingleLine: true +AllowShortEnumsOnASingleLine: true +AllowShortFunctionsOnASingleLine: All +AllowShortIfStatementsOnASingleLine: Never +AllowShortLambdasOnASingleLine: All +AllowShortLoopsOnASingleLine: false +AlwaysBreakAfterDefinitionReturnType: None +AlwaysBreakBeforeMultilineStrings: false +AttributeMacros: + - __capability +BinPackArguments: true +BinPackParameters: true +BitFieldColonSpacing: Both +BraceWrapping: + AfterCaseLabel: false + AfterClass: false + AfterControlStatement: Never + AfterEnum: false + AfterFunction: true + AfterNamespace: false + AfterObjCDeclaration: false + AfterStruct: false + AfterUnion: false + AfterExternBlock: false + BeforeCatch: false + BeforeElse: false + BeforeLambdaBody: false + BeforeWhile: false + IndentBraces: false + SplitEmptyFunction: true + SplitEmptyRecord: true + SplitEmptyNamespace: true +BreakAdjacentStringLiterals: true +BreakAfterAttributes: Leave +BreakAfterJavaFieldAnnotations: false +BreakAfterReturnType: None +BreakArrays: true +BreakBeforeBinaryOperators: All +BreakBeforeBraces: WebKit +BreakBeforeConceptDeclarations: Always +BreakBeforeInlineASMColon: OnlyMultiline +BreakBeforeTernaryOperators: true +BreakConstructorInitializers: BeforeComma +BreakFunctionDefinitionParameters: false +BreakInheritanceList: BeforeColon +BreakStringLiterals: true +BreakTemplateDeclarations: MultiLine +ColumnLimit: 0 +CommentPragmas: "^ IWYU pragma:" +CompactNamespaces: false +ConstructorInitializerIndentWidth: 4 +ContinuationIndentWidth: 4 +Cpp11BracedListStyle: false +DerivePointerAlignment: false +DisableFormat: false +EmptyLineAfterAccessModifier: Never +EmptyLineBeforeAccessModifier: LogicalBlock +ExperimentalAutoDetectBinPacking: false +FixNamespaceComments: false +ForEachMacros: + - foreach + - Q_FOREACH + - BOOST_FOREACH +IfMacros: + - KJ_IF_MAYBE +IncludeBlocks: Preserve +IncludeCategories: + - Regex: ^"(llvm|llvm-c|clang|clang-c)/ + Priority: 2 + SortPriority: 0 + CaseSensitive: false + - Regex: ^(<|"(gtest|gmock|isl|json)/) + Priority: 3 + SortPriority: 0 + CaseSensitive: false + - Regex: .* + Priority: 1 + SortPriority: 0 + CaseSensitive: false +IncludeIsMainRegex: (Test)?$ +IncludeIsMainSourceRegex: "" +IndentAccessModifiers: false +IndentCaseBlocks: false +IndentCaseLabels: false +IndentExternBlock: AfterExternBlock +IndentGotoLabels: true +IndentPPDirectives: None +IndentRequiresClause: true +IndentWidth: 4 +IndentWrappedFunctionNames: false +InsertBraces: false +InsertNewlineAtEOF: false +InsertTrailingCommas: None +IntegerLiteralSeparator: + Binary: 0 + BinaryMinDigits: 0 + Decimal: 0 + DecimalMinDigits: 0 + Hex: 0 + HexMinDigits: 0 +JavaScriptQuotes: Leave +JavaScriptWrapImports: true +KeepEmptyLines: + AtEndOfFile: false + AtStartOfBlock: true + AtStartOfFile: true +LambdaBodyIndentation: Signature +LineEnding: DeriveLF +MacroBlockBegin: "" +MacroBlockEnd: "" +MainIncludeChar: Quote +MaxEmptyLinesToKeep: 1 +NamespaceIndentation: None +ObjCBinPackProtocolList: Auto +ObjCBlockIndentWidth: 4 +ObjCBreakBeforeNestedBlockParam: true +ObjCSpaceAfterProperty: true +ObjCSpaceBeforeProtocolList: true +PPIndentWidth: -1 +PackConstructorInitializers: BinPack +PenaltyBreakAssignment: 2 +PenaltyBreakBeforeFirstCallParameter: 19 +PenaltyBreakComment: 300 +PenaltyBreakFirstLessLess: 120 +PenaltyBreakOpenParenthesis: 0 +PenaltyBreakScopeResolution: 500 +PenaltyBreakString: 1000 +PenaltyBreakTemplateDeclaration: 10 +PenaltyExcessCharacter: 1000000 +PenaltyIndentedWhitespace: 0 +PenaltyReturnTypeOnItsOwnLine: 60 +PointerAlignment: Left +QualifierAlignment: Leave +ReferenceAlignment: Pointer +ReflowComments: true +RemoveBracesLLVM: false +RemoveParentheses: Leave +RemoveSemicolon: false +RequiresClausePosition: OwnLine +RequiresExpressionIndentation: OuterScope +SeparateDefinitionBlocks: Leave +ShortNamespaceLines: 1 +SkipMacroDefinitionBody: false +SortIncludes: CaseSensitive +SortJavaStaticImport: Before +SortUsingDeclarations: LexicographicNumeric +SpaceAfterCStyleCast: false +SpaceAfterLogicalNot: false +SpaceAfterTemplateKeyword: true +SpaceAroundPointerQualifiers: Default +SpaceBeforeAssignmentOperators: true +SpaceBeforeCaseColon: false +SpaceBeforeCpp11BracedList: true +SpaceBeforeCtorInitializerColon: true +SpaceBeforeInheritanceColon: true +SpaceBeforeJsonColon: false +SpaceBeforeParens: ControlStatements +SpaceBeforeParensOptions: + AfterControlStatements: true + AfterForeachMacros: true + AfterFunctionDeclarationName: false + AfterFunctionDefinitionName: false + AfterIfMacros: true + AfterOverloadedOperator: false + AfterPlacementOperator: true + AfterRequiresInClause: false + AfterRequiresInExpression: false + BeforeNonEmptyParentheses: false +SpaceBeforeRangeBasedForLoopColon: true +SpaceBeforeSquareBrackets: false +SpaceInEmptyBlock: true +SpacesBeforeTrailingComments: 1 +SpacesInAngles: Never +SpacesInContainerLiterals: true +SpacesInLineCommentPrefix: + Minimum: 1 + Maximum: -1 +SpacesInParens: Never +SpacesInParensOptions: + ExceptDoubleParentheses: false + InConditionalStatements: false + InCStyleCasts: false + InEmptyParentheses: false + Other: false +SpacesInSquareBrackets: false +Standard: Latest +StatementAttributeLikeMacros: + - Q_EMIT +StatementMacros: + - Q_UNUSED + - QT_REQUIRE_VERSION +TabWidth: 4 +TableGenBreakInsideDAGArg: DontBreak +UseTab: ForIndentation +VerilogBreakBetweenInstancePorts: true +WhitespaceSensitiveMacros: + - BOOST_PP_STRINGIZE + - CF_SWIFT_NAME + - NS_SWIFT_NAME + - PP_STRINGIZE + - STRINGIZE diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..ba30eef --- /dev/null +++ b/.gitignore @@ -0,0 +1,5 @@ +*.o +*.d +.vscode +.cache +compile_commands.json
\ No newline at end of file diff --git a/.gitmodules b/.gitmodules new file mode 100644 index 0000000..e1b76eb --- /dev/null +++ b/.gitmodules @@ -0,0 +1,3 @@ +[submodule "third_party/pfr"] + path = third_party/pfr + url = https://github.com/boostorg/pfr @@ -0,0 +1,557 @@ + Server Side Public License + VERSION 1, OCTOBER 16, 2018 + + Copyright © 2025 большыеяйца2008 + + Everyone is permitted to copy and distribute verbatim copies of this + license document, but changing it is not allowed. + + TERMS AND CONDITIONS + + 0. Definitions. + + “This License” refers to Server Side 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, subject to section 13. 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. Subject to section 13, 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 use, + propagate or 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 use, propagate or 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. Offering the Program as a Service. + + If you make the functionality of the Program or a modified version + available to third parties as a service, you must make the Service Source + Code available via network download to everyone at no charge, under the + terms of this License. Making the functionality of the Program or + modified version available to third parties as a service includes, + without limitation, enabling third parties to interact with the + functionality of the Program or modified version remotely through a + computer network, offering a service the value of which entirely or + primarily derives from the value of the Program or modified version, or + offering a service that accomplishes for users the primary purpose of the + Program or modified version. + + “Service Source Code” means the Corresponding Source for the Program or + the modified version, and the Corresponding Source for all programs that + you use to make the Program or modified version available as a service, + including, without limitation, management software, user interfaces, + application program interfaces, automation software, monitoring software, + backup software, storage software and hosting software, all such that a + user could run an instance of the service using the Service Source Code + you make available. + + 14. Revised Versions of this License. + + MongoDB, Inc. may publish revised and/or new versions of the Server Side + 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 Server Side 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 MongoDB, Inc. If the Program does not + specify a version number of the Server Side Public License, you may + choose any version ever published by MongoDB, Inc. + + If the Program specifies that a proxy can decide which future versions of + the Server Side 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
\ No newline at end of file diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..08d6e0f --- /dev/null +++ b/Makefile @@ -0,0 +1,30 @@ +CXX?= g++ + +CXXFLAGS?= -std=c++20 \ + -Wall \ + -Iinclude \ + -Ithird_party/pfi/include \ + -g +LDFLAGS?= +LDADD=-lz + +TARGET= kill_proxy + +CXX_SRCS= src/kill_proxy.cpp +CXX_OBJS= $(CXX_SRCS:%.cpp=%.cpp.o) +CXX_DEPS= $(CXX_SRCS:%.cpp=%.cpp.d) + +all: ${TARGET} + +${TARGET}: ${CXX_OBJS} + ${CXX} ${LDFLAGS} -o $@ $< ${LDADD} + +%.cpp.o: %.cpp + ${CXX} ${CXXFLAGS} -MMD -c -o $@ $< + + +-include $(CXX_DEPS) + +.PHONY: clean +clean: + -rm ${TARGET} ${CXX_OBJS} ${CXX_DEPS} @@ -0,0 +1,3 @@ +WIP implementation of terraria protocol. + +`src / kill_proxy.cpp` is a working proxy with packet modification.
\ No newline at end of file diff --git a/include/net/client.hpp b/include/net/client.hpp new file mode 100644 index 0000000..8f81638 --- /dev/null +++ b/include/net/client.hpp @@ -0,0 +1,51 @@ +#pragma once + +#include "net/conn.hpp" +#include <cerrno> +#include <cstdio> +#include <cstdlib> +#include <cstring> +#include <stdexcept> +#include <string> + +#include <arpa/inet.h> +#include <fcntl.h> +#include <netdb.h> +#include <netinet/in.h> +#include <sys/socket.h> +#include <sys/time.h> +#include <sys/types.h> +#include <sys/uio.h> +#include <sys/wait.h> +#include <unistd.h> + +namespace net { + +class client { + struct sockaddr_in server_address {}; + +public: + client(std::string hostname, int port) + { + server_address.sin_family = AF_INET; + inet_pton(AF_INET, hostname.c_str(), &server_address.sin_addr); + server_address.sin_port = htons(port); + } + + conn connect() + { + int sock_fd; + + sock_fd = socket(AF_INET, SOCK_STREAM, 0); + if (sock_fd < 0) + throw std::runtime_error(strerror(errno)); + + auto err = ::connect(sock_fd, (struct sockaddr*)&server_address, + sizeof(server_address)); + if (err < 0) + throw std::runtime_error(strerror(errno)); + + return conn { sock_fd, server_address, sizeof(server_address) }; + } +}; +}; diff --git a/include/net/conn.hpp b/include/net/conn.hpp new file mode 100644 index 0000000..b69dac6 --- /dev/null +++ b/include/net/conn.hpp @@ -0,0 +1,188 @@ +#pragma once + +#include <cstdint> +#include <functional> +#include <map> +#include <netinet/in.h> +#include <span> +#include <vector> + +#include "net/packet.hpp" + +namespace net { +class conn { + int sock_fd; + + sockaddr_in conn_addr; + socklen_t conn_addr_size; + + using handler_list = std::vector<std::function<bool(std::span<uint8_t>)>>; + std::array<handler_list, 256> handlers; + std::map<uint16_t, handler_list> netmodule_handlers; + +private: + packet::packet_header read_header() + { + uint16_t packet_size; + uint8_t id; + + recv(packet_size); + recv(id); + + return { id, packet_size - 3}; + } + +public: + conn(int sock_fd, sockaddr_in conn_addr, socklen_t conn_addr_size) + : sock_fd(sock_fd) + , conn_addr(conn_addr) + , conn_addr_size(conn_addr_size) + { + } + + ~conn() + { + close(sock_fd); + } + + ssize_t send(std::span<uint8_t> data) + { + auto bytes = ::send(sock_fd, data.data(), data.size_bytes(), 0); + if (bytes < 0) { + throw std::runtime_error(strerror(errno)); + } + return bytes; + } + + template <std::integral T> + ssize_t send(T t) + { + t = to_little(t); + auto bytes = ::send(sock_fd, &t, sizeof(T), 0); + if (bytes < 0) { + throw std::runtime_error(strerror(errno)); + } + return bytes; + } + + ssize_t recv(std::span<uint8_t> data) + { + if (data.size_bytes() == 0) { + return 0; + } + + auto bytes = ::recv(sock_fd, data.data(), data.size_bytes(), 0); + if (bytes <= 0) { + throw std::runtime_error(strerror(errno)); + } + return bytes; + } + + template <std::integral T> + ssize_t recv(T& t) + { + auto bytes = ::recv(sock_fd, &t, sizeof(T), 0); + if (bytes <= 0) { + throw std::runtime_error(strerror(errno)); + } + t = to_little(t); + if (bytes != sizeof(T)) { + throw std::runtime_error(strerror(errno)); + } + return bytes; + } + + template <packet::packet T> + void expect_packet(T& t) + { + auto [id, len] = read_header(); + assert(id == T::packet_id); + + if(len > 0) { + std::vector<uint8_t> payload(len); + recv(payload); + decode_packet(payload, t); + } + } + + template <packet::packet P, typename H> + void reg_handler(H h) { + handlers[P::packet_id].push_back([this, h](std::span<uint8_t> payload) { + P t; + if (payload.size() > 0) { + packet::decode_packet(payload, t); + } + return h(t); + }); + } + + template <packet::netmodule P, typename H> + void reg_handler(H h) { + netmodule_handlers[P::module_id].push_back([this, h](std::span<uint8_t> payload) { + P t; + if (payload.size() > 0) { + packet::decode_packet(payload, t); + } + return h(t); + }); + } + + template <packet::packet T> + void send_packet(T p) + { + auto payload = encode_packet(p); + + send(int16_t(payload.size() + 3)); + send(T::packet_id); + if (payload.size() > 0) { + send(payload); + } + } + + bool handle_netmodule(std::span<uint8_t> payload) { + uint16_t id; + std::memcpy(&id, payload.data(), sizeof(id)); + id = to_little(id); + + if (netmodule_handlers[id].size() <= 0) { + // currently i won't bother implementing netmodules + // FIXME: return false + return true; + } + + for (auto &h : handlers[id]) { + if (h(payload.subspan(2)) == true) { + return false; + } + } + return true; + } + + bool handle() { + auto [id, len] = read_header(); + if (id == 0) { + return false; + } + + std::vector<uint8_t> payload(len); + recv(payload); + + //got netmodule + if (id == 82) { + return handle_netmodule(payload); + } + + if (handlers[id].size() <= 0) { + return false; + } + + for (auto &h : handlers[id]) { + if (h(payload) == true) { + break; + } + } + return true; + } + +}; +}
\ No newline at end of file diff --git a/include/net/packet.hpp b/include/net/packet.hpp new file mode 100644 index 0000000..f2094c0 --- /dev/null +++ b/include/net/packet.hpp @@ -0,0 +1,98 @@ +#pragma once + +#include <array> +#include <cassert> +#include <cstddef> +#include <cstdint> +#include <cstdio> +#include <cstring> +#include <format> +#include <stdexcept> +#include <vector> + +#include <sys/socket.h> +#include <sys/types.h> + +#include <boost/pfr/core.hpp> +#include <zlib.h> + +#include "types.hpp" + +namespace net { + +namespace packet { + +using packet_header = std::tuple<uint8_t, uint16_t>; + +template <packet T> +void decode_packet(std::span<uint8_t> payload, T& t) +{ + std::size_t offset = 0; + + boost::pfr::for_each_field(t, [&payload, &offset](auto& field, int i) { + if (offset >= payload.size()) { + throw std::runtime_error("Received invalid packet"); + } + offset += decode_field(payload.subspan(offset), field); + }); + + if (offset < payload.size()) { + throw std::runtime_error(std::format("{}: {}", offset, payload.size())); + } +} + +template <packet T> +std::vector<uint8_t> encode_raw_packet(T& t) +{ + std::vector<uint8_t> payload; + + boost::pfr::for_each_field(t, [&payload](auto& field) { + encode_field(payload, field); + }); + + return payload; +} + +template <packet T> +std::vector<uint8_t> encode_packet(T& t) +{ + return encode_raw_packet(t); +} + +template <compressed_packet T> +std::vector<uint8_t> encode_packet(T& t) +{ + static constexpr auto chunk_size = 1024; + std::array<uint8_t, chunk_size> buffer; + std::vector<uint8_t> payload; + + int ret, flush; + z_stream strm; + + auto raw_payload = encode_raw_packet(t); + + strm.zalloc = Z_NULL; + strm.zfree = Z_NULL; + strm.opaque = Z_NULL; + ret = deflateInit(&strm, 15); + if (ret != Z_OK) + throw std::runtime_error("deflate init error"); + + strm.avail_in = raw_payload.size(); + strm.next_in = raw_payload.data(); + do { + strm.avail_out = chunk_size; + strm.next_out = reinterpret_cast<Bytef *>(buffer.data()); + ret = deflate(&strm, flush); + assert(ret != Z_STREAM_ERROR); + payload.insert(payload.end(), buffer.begin(), buffer.end()-strm.avail_out); + } while (strm.avail_out == 0); + + assert(strm.avail_in == 0); /* all input will be used */ + + deflateEnd(&strm); + return payload; +} +} + +}
\ No newline at end of file diff --git a/include/net/server.hpp b/include/net/server.hpp new file mode 100644 index 0000000..14a5d1d --- /dev/null +++ b/include/net/server.hpp @@ -0,0 +1,65 @@ +#pragma once + +#include "net/conn.hpp" +#include <cerrno> +#include <cstdio> +#include <cstdlib> +#include <cstring> +#include <stdexcept> +#include <string> + +#include <arpa/inet.h> +#include <fcntl.h> +#include <netdb.h> +#include <netinet/in.h> +#include <sys/socket.h> +#include <sys/time.h> +#include <sys/types.h> +#include <sys/uio.h> +#include <sys/wait.h> +#include <unistd.h> + +namespace net { + +class server { + struct sockaddr_in server_address {}; + int sock_fd; + +public: + + server(std::string hostname, int port) + { + server_address.sin_family = AF_INET; + inet_pton(AF_INET, hostname.c_str(), &server_address.sin_addr); + server_address.sin_port = htons(port); + } + + ~server() { + close(sock_fd); + } + + void bind() { + sock_fd = socket(AF_INET, SOCK_STREAM, 0); + if (sock_fd < 0) + throw std::runtime_error(strerror(errno)); + + int bindStatus = ::bind(sock_fd, (struct sockaddr*)&server_address, sizeof(server_address)); + if (bindStatus < 0) + throw std::runtime_error(strerror(errno)); + } + + void listen(int max_connections) { + ::listen(sock_fd, max_connections); + } + + conn accept() { + sockaddr_in conn_addr {}; + socklen_t conn_addr_size = sizeof(conn_addr); + + int conn_fd = ::accept(sock_fd, (struct sockaddr *)&conn_addr, &conn_addr_size); + if (conn_fd < 0) + throw std::runtime_error(strerror(errno)); + return conn { conn_fd, conn_addr, conn_addr_size }; + } +}; +}
\ No newline at end of file diff --git a/include/net/types.hpp b/include/net/types.hpp new file mode 100644 index 0000000..9ebc56c --- /dev/null +++ b/include/net/types.hpp @@ -0,0 +1,503 @@ +#pragma once + +#include <array> +#include <cassert> +#include <concepts> +#include <cstddef> +#include <cstdint> +#include <cstdio> +#include <cstring> +#include <span> +#include <string> +#include <sys/types.h> +#include <vector> + +#include "util/bitset.hpp" +#include "util/endian.hpp" +#include "version.hpp" + +namespace net { +namespace packet { + +using packet_flag = struct { }; + +template <class T> +concept packet = requires(T x) { x.packet_id; }; + +template <class T> +concept compressed_packet = requires(T x) { packet<T> && x.compressed; }; + +template <class T> +concept netmodule = requires(T x) { x.module_id; }; + +struct nstring : std::string { + enum : uint8_t { + Literal, + Formattable, + LocalizationKey, + } mode; + + std::string s; + + nstring(std::string&& s) + : mode(Literal) + , s(s) + { + } + + nstring(std::string& s) + : mode(Literal) + , s(s) + { + } +}; + +struct rgb { + uint8_t r; + uint8_t g; + uint8_t b; +}; + +struct death_reason { + enum class reason : int { + Player = 0, + NPC, + Projectile, + Other, + ProjectileType, + Item, + ItemPrefix, + Custom, + }; + + bitset<8> reasons; + + int16_t player_index; + int16_t npc_index; + int16_t projectile_index; + uint8_t other_index; + int16_t projectile_type; + int16_t item_type; + uint8_t item_prefix; + std::string custom; +}; + +void encode_field(std::vector<uint8_t>& data, const std::string& f) +{ + auto bytes = reinterpret_cast<uint8_t const*>(f.data()); + data.insert(data.end(), uint8_t(f.size())); + data.insert(data.end(), bytes, bytes + f.size()); +} + +template <std::integral T> +void encode_field(std::vector<uint8_t>& data, T f) +{ + auto fixed = to_little(f); + auto* p = reinterpret_cast<uint8_t const*>(&fixed); + data.insert(data.end(), p, p + sizeof(T)); +} + +template <std::floating_point T> +void encode_field(std::vector<uint8_t>& data, T f) +{ + auto x = reinterpret_cast<uint8_t*>(&f); + data.insert(data.end(), x, x + sizeof(T)); +} + +void encode_field(std::vector<uint8_t>& data, nstring& s) +{ + data.insert(data.end(), uint8_t(s.mode)); + encode_field(data, s.s); +} + +void encode_field(std::vector<uint8_t>& data, const rgb& f) +{ + encode_field(data, f.r); + encode_field(data, f.g); + encode_field(data, f.b); +} + +template <typename T, std::size_t sz> +void encode_field(std::vector<uint8_t>& data, std::array<T, sz>& f) +{ + for (auto& e : f) { + encode_field(data, e); + } +} + +template <typename T> +void encode_field(std::vector<uint8_t>& data, std::vector<T> &f) +{ + for (auto& e : f) { + encode_field(data, e); + } +} + +template <typename T> +void encode_field(std::vector<uint8_t>& data, std::span<T> &f) +{ + for (auto& e : f) { + encode_field(data, e); + } +} + +template <unsigned int bits> +void encode_field(std::vector<uint8_t>& data, bitset<bits> &f) +{ + for (auto& e : f) { + encode_field(data, e); + } +} + +void encode_field(std::vector<uint8_t>& data, death_reason &f) +{ + encode_field(data, f.reasons); + if (f.reasons[death_reason::reason::Player]) { + encode_field(data, f.player_index); + } + if (f.reasons[death_reason::reason::NPC]) { + encode_field(data, f.npc_index); + } + if (f.reasons[death_reason::reason::Projectile]) { + encode_field(data, f.projectile_index); + } + if (f.reasons[death_reason::reason::Other]) { + encode_field(data, f.other_index); + } + if (f.reasons[death_reason::reason::ProjectileType]) { + encode_field(data, f.projectile_type); + } + if (f.reasons[death_reason::reason::Item]) { + encode_field(data, f.item_type); + } + if (f.reasons[death_reason::reason::ItemPrefix]) { + encode_field(data, f.item_prefix); + } + if (f.reasons[death_reason::reason::Custom]) { + encode_field(data, f.custom); + } +} + +ssize_t decode_field(std::span<uint8_t> data, std::string& f) +{ + assert(data.size() > 0); + uint8_t size = uint8_t(data[0]); // FIXME: varint + + assert(data.size() >= std::size_t(size + 1)); + + f.resize(size); + f.assign(reinterpret_cast<const char*>(data.data() + 1 /* FIXME: varint*/), size); + return size + 1; +} + +template <std::integral T> +ssize_t decode_field(std::span<uint8_t> data, T& f) +{ + assert(data.size() >= sizeof(T)); + std::memcpy(&f, data.data(), sizeof(T)); + f = to_little(f); + return sizeof(T); +} + + +ssize_t decode_field(std::span<uint8_t> data, std::vector<uint8_t>& f) +{ + f.insert(f.begin(), data.begin(), data.end()); + return f.size(); +} + + +template <typename T, std::size_t sz> +ssize_t decode_field(std::span<uint8_t> data, std::array<T, sz>& f) +{ + assert(data.size() >= sizeof(T) * sz); + + ssize_t offset = 0; + for (auto& e : f) { + offset += decode_field(data.subspan(offset), e); + } + + return offset; +} + +ssize_t decode_field(std::span<uint8_t> data, death_reason &f) +{ + int offset = 0; + offset += decode_field(data, f.reasons); + if (f.reasons[0]) { + offset += decode_field(data.subspan(offset), f.player_index); + } + if (f.reasons[1]) { + offset += decode_field(data.subspan(offset), f.npc_index); + } + if (f.reasons[2]) { + offset += decode_field(data.subspan(offset), f.projectile_index); + } + if (f.reasons[3]) { + offset += decode_field(data.subspan(offset), f.other_index); + } + if (f.reasons[4]) { + offset += decode_field(data.subspan(offset), f.projectile_type); + } + if (f.reasons[5]) { + offset += decode_field(data.subspan(offset), f.item_type); + } + if (f.reasons[6]) { + offset += decode_field(data.subspan(offset), f.item_prefix); + } + if (f.reasons[7]) { + offset += decode_field(data.subspan(offset), f.custom); + } + + return offset; +} +ssize_t decode_field(std::span<uint8_t> data, rgb& f) +{ + assert(data.size() >= 3); + + f.r = uint8_t(data[0]); + f.g = uint8_t(data[1]); + f.b = uint8_t(data[2]); + return 3; +} + +struct conn_request { + static constexpr uint8_t packet_id = 1; + + std::string ver; +}; + +struct disconnect { + static constexpr uint8_t packet_id = 2; + + nstring reason; +}; + +struct accept { + static constexpr uint8_t packet_id = 3; + + std::uint8_t client_id; + uint8_t _ = 0; +}; + +struct player_info { + static constexpr uint8_t packet_id = 4; + + uint8_t client_id; + uint8_t skin_variant; + uint8_t hair_variant; + std::string name; + uint8_t hair_dye; + uint16_t hide_visuals; + uint8_t hide_misc; + rgb hair_color; + rgb skin_color; + rgb eye_color; + rgb shirt_color; + rgb undershirt_color; + rgb pants_color; + rgb shoes_color; + uint8_t difficulty; + uint8_t torches; + uint8_t permanent_buffs; +}; + +struct player_inventory_slot { + static constexpr uint8_t packet_id = 5; + + uint8_t client_id; + int16_t slot_id; + int16_t amount; + uint8_t prefix; + int16_t item_id; +}; + +struct request_world_data { + static constexpr uint8_t packet_id = 6; +}; + +struct world_info { + static constexpr uint8_t packet_id = 7; + + // FIXME: i'm not sure this struct is correct + int32_t time; + uint8_t day_info; + uint8_t moon_phase; + int16_t max_tiles_x; + int16_t max_tiles_y; + int16_t spawn_x; + int16_t spawn_y; + int16_t world_surface; + int16_t rock_layer; + int32_t world_id; + std::string world_name; + uint8_t game_mode; + std::array<uint8_t, 16> world_unique_id; + std::array<int32_t, 2> world_generator_version; + uint8_t moon_type; + std::array<uint8_t, 13> backgrounds; + uint8_t ice_back_style; + uint8_t jungle_back_style; + uint8_t hell_back_style; + float wind_speed_set; + uint8_t cloud_number; + std::array<int32_t, 3> trees; + std::array<uint8_t, 4> tree_styles; + std::array<int32_t, 3> cave_backs; + std::array<uint8_t, 4> cave_back_styles; + std::array<uint8_t, 13> tree_top_styles; + float rain; + bitset<104> flags1; + std::array<int16_t, 7> ore_tiers_tiles; + int8_t invasion_type; + uint64_t lobby_id; + float sandstorm_severity; +}; + +struct request_tiles_at { + static constexpr uint8_t packet_id = 8; + int32_t spawn_x; + int32_t spawn_y; +}; + +struct statusbar_text { + static constexpr uint8_t packet_id = 9; + + int32_t status_max; + nstring status_text; + uint8_t server_flags; +}; + +struct send_tile_data { + static constexpr uint8_t packet_id = 10; + static constexpr packet_flag compressed {}; + + //FIXME: implement +}; + +struct spawn_player { + static constexpr uint8_t packet_id = 12; + + uint8_t client_id; + + int16_t spawn_x; + int16_t spawn_y; + int32_t respawn_timer; + uint16_t pve_death_count; + uint16_t pvp_death_count; + uint8_t spwan_context; +}; + +struct player_health { + static constexpr uint8_t packet_id = 16; + + uint8_t client_id; + uint16_t current; + uint16_t max; +}; + +struct request_password { + static constexpr uint8_t packet_id = 37; +}; + +struct send_password { + static constexpr uint8_t packet_id = 38; + + std::string password; +}; + +struct player_mana { + static constexpr uint8_t packet_id = 42; + + uint8_t client_id; + uint16_t current; + uint16_t max; +}; + +struct initial_spawn_player { + static constexpr uint8_t packet_id = 49; +}; + +struct update_player_buffs { + static constexpr uint8_t packet_id = 50; + + uint8_t client_id; + std::array<uint16_t, max_buffs> buffs; +}; + +struct world_evil { + static constexpr uint8_t packet_id = 57; + + uint8_t good; + uint8_t evil; + uint8_t blood; +}; + +struct player_uuid { + static constexpr uint8_t packet_id = 68; + + std::string uuid; +}; + +struct npc_kill_count { + static constexpr uint8_t packet_id = 83; + + uint16_t npc_type; + uint32_t npc_kill_count; +}; + +struct tower_powers { + static constexpr uint8_t packet_id = 101; + uint16_t solar, nebula, vertex, stardust; +}; + +struct monster_types { + static constexpr uint8_t packet_id = 136; + + std::array<std::array<uint16_t, 3>, 2> types; +}; + +struct connection_completed { + static constexpr uint8_t packet_id = 129; +}; + +struct player_zones { + static constexpr uint8_t packet_id = 36; + + uint8_t client_id; + uint32_t zone_flags; + uint8_t zone_flags2; +}; + +struct player_loadout { + static constexpr uint8_t packet_id = 147; + + uint8_t client_id; + uint8_t index; + uint16_t hide_accessory; +}; + +struct damage_player { + static constexpr uint8_t packet_id = 117; + + uint8_t client_id; + death_reason reason; + int16_t damage; + uint8_t hit_direction; + uint8_t ty; + int8_t cooldown_counter; +}; + +template <uint8_t id> +struct raw { + static constexpr uint8_t packet_id = id; + std::vector<uint8_t> data; +}; + +inline nstring operator""_ns(const char* str, std::size_t) +{ + return nstring(str); +} + +} +} diff --git a/include/util/bitset.hpp b/include/util/bitset.hpp new file mode 100644 index 0000000..8798a4a --- /dev/null +++ b/include/util/bitset.hpp @@ -0,0 +1,48 @@ +#pragma once + +#include <array> +#include <cassert> +#include <cstdint> + +constexpr int bits_ceil(int bits) { + return bits / 8 + (bits % 8 > 0 ? 1 : 0); +} + +template <unsigned int flags, auto size = bits_ceil(flags)> +struct bitset : std::array<std::uint8_t, size> { + using array_type = std::array<std::uint8_t, size>; + +private: + struct bit_ref { + bitset<flags> &a; + int referenced_byte; + uint8_t referenced_bit_mask; + + bool operator=(bool b) { + if (b) + a.at(referenced_byte) |= referenced_bit_mask; + else + a.at(referenced_byte) &= ~referenced_bit_mask; + return b; + } + + constexpr operator bool() const { + return (a.at(referenced_byte) & referenced_bit_mask) > 0; + } + }; + +public: + template<class T> + constexpr bool operator [](T idx) const { + unsigned int i = (unsigned int)(idx); + assert(i < flags); + return (array_type::at(i/8) & (1 << (i%8))) > 0; + } + + template<class T> + bit_ref operator[](T idx) { + unsigned int i = (unsigned int)(idx); + assert(i < flags); + return bit_ref(*this, i/8, (1 << (i%8))); + } +};
\ No newline at end of file diff --git a/include/util/endian.hpp b/include/util/endian.hpp new file mode 100644 index 0000000..18e49f6 --- /dev/null +++ b/include/util/endian.hpp @@ -0,0 +1,21 @@ +#pragma once + +#include <bit> +#include <concepts> + +template <std::integral T> + requires(sizeof(T) <= 8) +T to_little(T x) +{ + if constexpr (std::endian::native == std::endian::little || sizeof(T) == 1) { + return x; + } + switch (sizeof(T)) { + case 2: + return __builtin_bswap16(x); + case 4: + return __builtin_bswap32(x); + case 8: + return __builtin_bswap64(x); + } +}
\ No newline at end of file diff --git a/include/version.hpp b/include/version.hpp new file mode 100644 index 0000000..0371595 --- /dev/null +++ b/include/version.hpp @@ -0,0 +1,3 @@ +#pragma once + +constexpr auto max_buffs = 44;
\ No newline at end of file diff --git a/include/world/world.hpp b/include/world/world.hpp new file mode 100644 index 0000000..1b2481b --- /dev/null +++ b/include/world/world.hpp @@ -0,0 +1,12 @@ +#pragma once + +#include <cstdint> + +namespace world { + +class world { + int32_t version; + +}; + +}
\ No newline at end of file diff --git a/src/kill_proxy.cpp b/src/kill_proxy.cpp new file mode 100644 index 0000000..a2a2e27 --- /dev/null +++ b/src/kill_proxy.cpp @@ -0,0 +1,80 @@ +#include <arpa/inet.h> +#include <bitset> +#include <concepts> +#include <cstdint> +#include <fcntl.h> +#include <format> +#include <iostream> +#include <netdb.h> +#include <netinet/in.h> +#include <ostream> +#include <stdlib.h> +#include <sys/socket.h> +#include <sys/time.h> +#include <sys/types.h> +#include <sys/uio.h> +#include <sys/wait.h> +#include <thread> +#include <unistd.h> +#include <utility> + +#include "net/client.hpp" +#include "net/conn.hpp" +#include "net/server.hpp" +#include "net/types.hpp" + +using net::packet::operator""_ns; + +template <typename T, T... ints> +void forward_packets(net::conn &dst, net::conn &src, std::integer_sequence<T, ints...> int_seq) { + (src.reg_handler<net::packet::raw<ints>>([&dst](auto &a) { + dst.send_packet(a); + return true; + }), ...); +} + +int main(int argc, char* argv[]) +{ + auto server = net::client("localhost", 7777); + auto proxy = net::server("localhost", 8888); + + proxy.bind(); + proxy.listen(1); + + auto server_conn = server.connect(); + auto proxy_conn = proxy.accept(); + + uint8_t slot; + server_conn.reg_handler<net::packet::accept>([=, &slot](auto& a) { + slot = a.client_id; + return false; + }); + + proxy_conn.reg_handler<net::packet::damage_player>([&slot, &server_conn](auto &dmg) { + if (dmg.client_id != slot) { + dmg.damage *= 100; + dmg.reason.reasons.at(0) = 0; + + dmg.reason.reasons[net::packet::death_reason::reason::Custom] = true; + dmg.reason.custom = "killed by server insecurity"; + + server_conn.send_packet(dmg); + return true; + } + return false; + }); + + forward_packets(server_conn, proxy_conn, std::make_integer_sequence<uint8_t, 255>{}); + forward_packets(proxy_conn, server_conn, std::make_integer_sequence<uint8_t, 255>{}); + + auto handle_loop = [] (net::conn &c) { + for(;;) { + c.handle(); + } + }; + + std::thread server_thread(handle_loop, std::ref(server_conn)); + std::thread proxy_thread(handle_loop, std::ref(proxy_conn)); + + return 0; +}
\ No newline at end of file |