├── .clang-format ├── .github └── workflows │ ├── ci.yml │ ├── release.yml │ └── scripts │ └── cross-setup.sh ├── .gitignore ├── LICENSE ├── Makefile ├── README.md └── src └── fakehttp.c /.clang-format: -------------------------------------------------------------------------------- 1 | --- 2 | Language: Cpp 3 | AccessModifierOffset: -1 4 | AlignAfterOpenBracket: Align 5 | AlignArrayOfStructures: None 6 | AlignConsecutiveAssignments: None 7 | AlignConsecutiveBitFields: None 8 | AlignConsecutiveDeclarations: None 9 | AlignConsecutiveMacros: Consecutive 10 | AlignEscapedNewlines: Left 11 | AlignOperands: Align 12 | AlignTrailingComments: true 13 | AllowAllArgumentsOnNextLine: true 14 | AllowAllConstructorInitializersOnNextLine: true 15 | AllowAllParametersOfDeclarationOnNextLine: true 16 | AllowShortBlocksOnASingleLine: false 17 | AllowShortCaseLabelsOnASingleLine: false 18 | AllowShortEnumsOnASingleLine: false 19 | AllowShortFunctionsOnASingleLine: false 20 | AllowShortIfStatementsOnASingleLine: false 21 | AllowShortLambdasOnASingleLine: All 22 | AllowShortLoopsOnASingleLine: false 23 | AlwaysBreakAfterDefinitionReturnType: None 24 | AlwaysBreakAfterReturnType: None 25 | AlwaysBreakBeforeMultilineStrings: false 26 | AlwaysBreakTemplateDeclarations: Yes 27 | BinPackArguments: true 28 | BinPackParameters: true 29 | BraceWrapping: 30 | AfterCaseLabel: false 31 | AfterClass: true 32 | AfterControlStatement: false 33 | AfterEnum: false 34 | AfterFunction: true 35 | AfterNamespace: false 36 | AfterObjCDeclaration: false 37 | AfterStruct: false 38 | AfterUnion: false 39 | AfterExternBlock: false 40 | BeforeCatch: false 41 | BeforeElse: false 42 | BeforeLambdaBody: false 43 | BeforeWhile: false 44 | IndentBraces: false 45 | SplitEmptyFunction: true 46 | SplitEmptyRecord: true 47 | SplitEmptyNamespace: true 48 | BitFieldColonSpacing: Both 49 | BreakAfterJavaFieldAnnotations: false 50 | BreakBeforeBinaryOperators: None 51 | BreakBeforeBraces: Custom 52 | BreakBeforeConceptDeclarations: false 53 | BreakBeforeInheritanceComma: false 54 | BreakBeforeTernaryOperators: true 55 | BreakConstructorInitializers: BeforeColon 56 | BreakConstructorInitializersBeforeComma: false 57 | BreakInheritanceList: BeforeColon 58 | BreakStringLiterals: true 59 | ColumnLimit: 79 60 | CompactNamespaces: false 61 | ConstructorInitializerAllOnOneLineOrOnePerLine: true 62 | ConstructorInitializerIndentWidth: 4 63 | ContinuationIndentWidth: 4 64 | Cpp11BracedListStyle: true 65 | DeriveLineEnding: true 66 | DerivePointerAlignment: false 67 | DisableFormat: false 68 | EmptyLineAfterAccessModifier: Never 69 | EmptyLineBeforeAccessModifier: LogicalBlock 70 | ExperimentalAutoDetectBinPacking: false 71 | FixNamespaceComments: true 72 | IncludeBlocks: Preserve 73 | IndentAccessModifiers: false 74 | IndentCaseBlocks: false 75 | IndentCaseLabels: true 76 | IndentExternBlock: AfterExternBlock 77 | IndentGotoLabels: true 78 | IndentPPDirectives: None 79 | IndentRequires: true 80 | IndentWidth: 4 81 | IndentWrappedFunctionNames: false 82 | InsertTrailingCommas: None 83 | KeepEmptyLinesAtTheStartOfBlocks: false 84 | LambdaBodyIndentation: Signature 85 | MacroBlockBegin: '' 86 | MacroBlockEnd: '' 87 | MaxEmptyLinesToKeep: 2 88 | NamespaceIndentation: None 89 | PPIndentWidth: -1 90 | PackConstructorInitializers: BinPack 91 | PenaltyBreakAssignment: 150 92 | PenaltyBreakBeforeFirstCallParameter: 1 93 | PenaltyBreakComment: 300 94 | PenaltyBreakFirstLessLess: 120 95 | PenaltyBreakOpenParenthesis: 0 96 | PenaltyBreakString: 1000 97 | PenaltyBreakTemplateDeclaration: 10 98 | PenaltyExcessCharacter: 1000000 99 | PenaltyIndentedWhitespace: 0 100 | PenaltyReturnTypeOnItsOwnLine: 200 101 | PointerAlignment: Right 102 | QualifierAlignment: Leave 103 | ReferenceAlignment: Pointer 104 | ReflowComments: true 105 | SeparateDefinitionBlocks: Leave 106 | ShortNamespaceLines: 1 107 | SortIncludes: false 108 | SortUsingDeclarations: true 109 | SpaceAfterCStyleCast: true 110 | SpaceAfterLogicalNot: false 111 | SpaceAfterTemplateKeyword: true 112 | SpaceAroundPointerQualifiers: After 113 | SpaceBeforeAssignmentOperators: true 114 | SpaceBeforeCaseColon: false 115 | SpaceBeforeCpp11BracedList: false 116 | SpaceBeforeCtorInitializerColon: true 117 | SpaceBeforeInheritanceColon: true 118 | SpaceBeforeParens: ControlStatements 119 | SpaceBeforeRangeBasedForLoopColon: true 120 | SpaceInEmptyParentheses: false 121 | SpacesBeforeTrailingComments: 2 122 | SpacesInAngles: false 123 | SpacesInCStyleCastParentheses: false 124 | SpacesInContainerLiterals: true 125 | SpacesInParentheses: false 126 | SpacesInSquareBrackets: false 127 | Standard: Cpp11 128 | TabWidth: 4 129 | UseTab: Never 130 | ... 131 | -------------------------------------------------------------------------------- /.github/workflows/ci.yml: -------------------------------------------------------------------------------- 1 | name: CI 2 | 3 | on: 4 | push: 5 | pull_request: 6 | workflow_dispatch: 7 | workflow_call: 8 | inputs: 9 | version: 10 | description: Version Number 11 | type: string 12 | required: false 13 | 14 | jobs: 15 | Lint: 16 | name: Lint 17 | runs-on: ubuntu-latest 18 | steps: 19 | - name: Checkout 20 | uses: actions/checkout@v4 21 | with: 22 | fetch-depth: 1 23 | - name: Install clang-format 24 | run: | 25 | sudo apt-get update 26 | sudo apt-get install -y clang-format 27 | - name: Run clang-format 28 | run: | 29 | clang-format --dry-run --Werror src/*.c 30 | 31 | Build: 32 | name: Build 33 | runs-on: ubuntu-latest 34 | env: 35 | cross_dir: /opt/x-tools 36 | strategy: 37 | matrix: 38 | include: 39 | - name: arm64 40 | triplet: aarch64-unknown-linux-musl 41 | sha256: 76f0d71893f3864e91ad09feff71a719cdf94cccd4f14cc25d7deed395968b5b 42 | - name: arm32 43 | triplet: arm-unknown-linux-musleabi 44 | sha256: 1242b2a965480415ce90a710ab7600730a8de114f5bc5452ed7382e64839b5de 45 | - name: arm32hf 46 | triplet: arm-unknown-linux-musleabihf 47 | sha256: 6e6f20cebd75ca5319c5dfb00fdd50a4ceb22af2df9073a75cafbdd3204eebad 48 | - name: arm32v7 49 | triplet: armv7-unknown-linux-musleabi 50 | sha256: 158d8fd651d8c501d8dea4bb82a152208732cb10a5f72e7e8e4ce9f551e8d165 51 | - name: arm32v7hf 52 | triplet: armv7-unknown-linux-musleabihf 53 | sha256: 7643420285f038545997d3234bee9c854900fa9060388769442ed20a72aeac23 54 | - name: i586 55 | triplet: i586-unknown-linux-musl 56 | sha256: 37d494c1fe60ac07ab8b83871a77a63ab885e5b06cceaa0777537db7767c464f 57 | - name: i686 58 | triplet: i686-unknown-linux-musl 59 | sha256: 0b1baac45c94b499791b65bbc63d0486aa557c6576142eddce3dee55e2fd022b 60 | - name: loong64 61 | triplet: loongarch64-unknown-linux-musl 62 | sha256: 2b8cddf9e082f8c8527a459520037ebcedae7262950e429d96184622ae74b8cf 63 | - name: m68k 64 | triplet: m68k-unknown-linux-musl 65 | sha256: 72f6427a1c97c1bd151ebcbd98eab6c39d46090bb89ff2e40c639be012dd2855 66 | - name: microblazeel 67 | triplet: microblazeel-xilinx-linux-musl 68 | sha256: ce892fe2c799bfd963de06632f5d02ea3e78d8abf2bfd361d673d4ce28fb6f69 69 | - name: microblaze 70 | triplet: microblaze-xilinx-linux-musl 71 | sha256: 03852d0ba1a5d6cd3efe1ee5b1cb7506fcc2b5b3026966fe1d7d916d621f5b4b 72 | - name: mips64el 73 | triplet: mips64el-unknown-linux-musl 74 | sha256: 01f821f8c476ec6e9618c4272a2e7e6fa3d664491f5ede4296d33af2e423a5ca 75 | - name: mips64 76 | triplet: mips64-unknown-linux-musl 77 | sha256: 9a99beb2e08584373451321d4580ff9c6fe3e1899daab511d2822d547e1a78be 78 | - name: mips32el 79 | triplet: mipsel-unknown-linux-musl 80 | sha256: 2698fea97c0c8bfdbcfa5db3fead20f779411ab1222e571b966a823a9f27356d 81 | - name: mips32elsf 82 | triplet: mipsel-unknown-linux-muslsf 83 | sha256: 36d8b864b3f6d27558d3f19695a4a39b79a873086edc60bebf733777df2b8359 84 | - name: mips32 85 | triplet: mips-unknown-linux-musl 86 | sha256: b74b51d0f61a837f235ec2cecc7b112c1ed53ad8046c88b907a63b4fdf93d4f3 87 | - name: mips32sf 88 | triplet: mips-unknown-linux-muslsf 89 | sha256: cc87dcaeed29f970bddb4b572c40a4074b9ac3997ba254725e8a89e05485538a 90 | - name: powerpc64 91 | triplet: powerpc64-unknown-linux-musl 92 | sha256: d3cce7238b4e2bfaf0ae5a47d4390b84616ad8ae848a07809fe293f436444ee8 93 | - name: powerpc 94 | triplet: powerpc-unknown-linux-musl 95 | sha256: aa50fe4bd9de4e1616400086ec5a29eded5bfbbb9b974b44e990ede3554ffc9e 96 | - name: riscv32 97 | triplet: riscv32-unknown-linux-musl 98 | sha256: ebac6326d6a0cd77c03a9813e6cf63ce70d3d46381149a82cafb60563d9c4732 99 | - name: riscv64 100 | triplet: riscv64-unknown-linux-musl 101 | sha256: 552361f25eaef471d88032eab89e7c1642ddfee466556f1f2e0f6eb68453b7a1 102 | - name: s390x 103 | triplet: s390x-ibm-linux-musl 104 | sha256: d48e0465117ecdba93db01feffd7133bdc975b5dd859e388a8bf7937a9b68d36 105 | - name: sh4 106 | triplet: sh4-multilib-linux-musl 107 | sha256: 6d1cb6c64e71773c4fe68b4a5d774e596ac3d58813b5c1365529b34be08ff309 108 | - name: x86_64 109 | triplet: x86_64-unknown-linux-musl 110 | sha256: a896bad67a4dae7cd7baece62d537fda07f8c74e65fee1b450a691b83e151a9c 111 | steps: 112 | - name: Checkout 113 | uses: actions/checkout@v4 114 | with: 115 | fetch-depth: 1 116 | - name: Set up toolchain for ${{ matrix.name }} 117 | run: | 118 | CROSS_TOOLCHAIN_URL="https://github.com/cross-tools/musl-cross/releases/download/20250520/${{ matrix.triplet }}.tar.xz" 119 | 120 | sudo mkdir -m 777 -p "${{ env.cross_dir }}" 121 | env \ 122 | CROSS_TRIPLET="${{ matrix.triplet }}" \ 123 | CROSS_TOOLCHAIN_URL="$CROSS_TOOLCHAIN_URL" \ 124 | CROSS_TOOLCHAIN_SHA256="${{ matrix.sha256 }}" \ 125 | CROSS_DIR="${{ env.cross_dir }}" \ 126 | .github/workflows/scripts/cross-setup.sh 127 | - name: Build for ${{ matrix.name }} 128 | run: | 129 | CROSS_PREFIX="${{ env.cross_dir }}/${{ matrix.triplet }}/bin/${{ matrix.triplet }}-" 130 | VERSION="${{ inputs.version }}" 131 | 132 | if [ -n "$VERSION" ]; then 133 | make STATIC=1 CROSS_PREFIX="$CROSS_PREFIX" VERSION="$VERSION" 134 | else 135 | make STATIC=1 CROSS_PREFIX="$CROSS_PREFIX" 136 | fi 137 | - name: Upload ${{ matrix.name }} 138 | uses: actions/upload-artifact@v4 139 | with: 140 | name: fakehttp-linux-${{ matrix.name }} 141 | path: build 142 | if-no-files-found: error 143 | -------------------------------------------------------------------------------- /.github/workflows/release.yml: -------------------------------------------------------------------------------- 1 | name: Release 2 | run-name: Release ${{ github.event.inputs.version }} 3 | 4 | on: 5 | workflow_dispatch: 6 | inputs: 7 | version: 8 | description: Version Number 9 | type: string 10 | required: true 11 | 12 | jobs: 13 | Build: 14 | uses: ./.github/workflows/ci.yml 15 | with: 16 | version: ${{ github.event.inputs.version }} 17 | 18 | Release: 19 | permissions: 20 | contents: write 21 | runs-on: ubuntu-latest 22 | needs: Build 23 | steps: 24 | - name: Checkout 25 | uses: actions/checkout@v4 26 | with: 27 | fetch-depth: 1 28 | - name: Download Artifact 29 | uses: actions/download-artifact@v4 30 | with: 31 | path: ${{ github.workspace }}/artifacts 32 | - name: Reorganize files 33 | run: | 34 | mkdir release 35 | cd artifacts 36 | chmod a+x */fakehttp* 37 | for triplet in *; do 38 | tar czvf "../release/$triplet.tar.gz" "$triplet" 39 | done 40 | - name: Make a tag 41 | run: | 42 | git config user.name 'GitHub Actions' 43 | git config user.email '41898282+github-actions[bot]@users.noreply.github.com' 44 | git tag -a '${{ github.event.inputs.version }}' -m '${{ github.event.inputs.version }}' 45 | git push origin '${{ github.event.inputs.version }}' 46 | - name: Make a release 47 | env: 48 | GITHUB_TOKEN: ${{ github.token }} 49 | run: | 50 | gh release create --title 'v${{ github.event.inputs.version }}' --generate-notes --verify-tag '${{ github.event.inputs.version }}' release/*.tar.gz 51 | -------------------------------------------------------------------------------- /.github/workflows/scripts/cross-setup.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | set -eux 3 | 4 | : "------" 5 | : "CROSS_TRIPLET=$CROSS_TRIPLET" 6 | : "CROSS_TOOLCHAIN_URL=$CROSS_TOOLCHAIN_URL" 7 | : "CROSS_TOOLCHAIN_SHA256=$CROSS_TOOLCHAIN_SHA256" 8 | : "CROSS_DIR=$CROSS_DIR" 9 | : "------" 10 | 11 | CROSS_BASE="$CROSS_DIR/$CROSS_TRIPLET" 12 | CROSS_SRC="$CROSS_BASE/src" 13 | CROSS_USR="$CROSS_BASE/$CROSS_TRIPLET/sysroot/usr" 14 | PATH="$CROSS_BASE/bin:$PATH" 15 | PKG_CONFIG_PATH="$CROSS_DIR/$CROSS_TRIPLET/$CROSS_TRIPLET/sysroot/usr/lib/pkgconfig" 16 | export PATH PKG_CONFIG_PATH 17 | 18 | libmnl_name=libmnl-1.0.5 19 | libmnl_tar=$libmnl_name.tar.bz2 20 | libmnl_sha256=274b9b919ef3152bfb3da3a13c950dd60d6e2bcd54230ffeca298d03b40d0525 21 | libmnl_url="https://www.netfilter.org/projects/libmnl/files/$libmnl_tar" 22 | 23 | libnfnetlink_name=libnfnetlink-1.0.2 24 | libnfnetlink_tar=$libnfnetlink_name.tar.bz2 25 | libnfnetlink_sha256=b064c7c3d426efb4786e60a8e6859b82ee2f2c5e49ffeea640cfe4fe33cbc376 26 | libnfnetlink_url="https://www.netfilter.org/projects/libnfnetlink/files/$libnfnetlink_tar" 27 | 28 | libnetfilter_queue_name=libnetfilter_queue-1.0.5 29 | libnetfilter_queue_tar=$libnetfilter_queue_name.tar.bz2 30 | libnetfilter_queue_sha256=f9ff3c11305d6e03d81405957bdc11aea18e0d315c3e3f48da53a24ba251b9f5 31 | libnetfilter_queue_url="https://www.netfilter.org/projects/libnetfilter_queue/files/$libnetfilter_queue_tar" 32 | 33 | 34 | : "Downloading toolchain..." 35 | cd "$CROSS_DIR" 36 | curl -Lfo "$CROSS_TRIPLET.tar.xz" "$CROSS_TOOLCHAIN_URL" 37 | echo "$CROSS_TOOLCHAIN_SHA256 *$CROSS_TRIPLET.tar.xz" | sha256sum -c 38 | sha256sum "$CROSS_TRIPLET.tar.xz" 39 | 40 | 41 | : "Extracting toolchain..." 42 | cd "$CROSS_DIR" 43 | rm -rf "$CROSS_BASE" 44 | tar xf "$CROSS_TRIPLET.tar.xz" 45 | chmod -R u+w "$CROSS_BASE" 46 | mkdir -p "$CROSS_SRC" 47 | 48 | 49 | : "Downloading dependencies..." 50 | cd "$CROSS_SRC" 51 | curl -Lfo "$libmnl_tar" "$libmnl_url" 52 | echo "$libmnl_sha256 *$libmnl_tar" | sha256sum -c 53 | curl -Lfo "$libnfnetlink_tar" "$libnfnetlink_url" 54 | echo "$libnfnetlink_sha256 *$libnfnetlink_tar" | sha256sum -c 55 | curl -Lfo "$libnetfilter_queue_tar" "$libnetfilter_queue_url" 56 | echo "$libnetfilter_queue_sha256 *$libnetfilter_queue_tar" | sha256sum -c 57 | 58 | 59 | : "Building libmnl..." 60 | cd "$CROSS_SRC" 61 | rm -rf "$libmnl_name" 62 | tar xf "$libmnl_tar" 63 | mkdir "$libmnl_name/builddir" 64 | cd "$libmnl_name/builddir" 65 | ../configure \ 66 | --enable-static \ 67 | --host="$CROSS_TRIPLET" \ 68 | --prefix="$CROSS_USR" 69 | make 70 | make install 71 | 72 | 73 | : "Building libnfnetlink..." 74 | cd "$CROSS_SRC" 75 | rm -rf "$libnfnetlink_name" 76 | tar xf "$libnfnetlink_tar" 77 | mkdir "$libnfnetlink_name/builddir" 78 | cd "$libnfnetlink_name/builddir" 79 | ../configure \ 80 | --enable-static \ 81 | --host="$CROSS_TRIPLET" \ 82 | --prefix="$CROSS_USR" 83 | make 84 | make install 85 | 86 | 87 | : "Building libnetfilter_queue..." 88 | cd "$CROSS_SRC" 89 | rm -rf "$libnetfilter_queue_name" 90 | tar xf "$libnetfilter_queue_tar" 91 | mkdir "$libnetfilter_queue_name/builddir" 92 | cd "$libnetfilter_queue_name/builddir" 93 | ../configure \ 94 | --enable-static \ 95 | --host="$CROSS_TRIPLET" \ 96 | --prefix="$CROSS_USR" 97 | make 98 | make install 99 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | .vscode 2 | build 3 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | CROSS_PREFIX := 2 | CC=$(CROSS_PREFIX)gcc 3 | STRIP=$(CROSS_PREFIX)strip 4 | 5 | override CFLAGS+=-O3 -std=c99 -pedantic -Wall -Wextra 6 | override LDFLAGS+=-lnetfilter_queue -lnfnetlink -lmnl 7 | 8 | ifdef VERSION 9 | override CFLAGS += -DVERSION=\"$(VERSION)\" 10 | endif 11 | 12 | PREFIX=/usr/local 13 | BINDIR=$(PREFIX)/bin 14 | BUILDDIR=build 15 | 16 | FAKEHTTP=$(BUILDDIR)/fakehttp 17 | 18 | ifeq ($(STATIC), 1) 19 | override CFLAGS += -static 20 | endif 21 | 22 | all: $(FAKEHTTP) 23 | 24 | clean: 25 | $(RM) -r $(BUILDDIR) 26 | 27 | $(FAKEHTTP): src/fakehttp.c 28 | mkdir -p $(BUILDDIR) 29 | $(CC) $(CFLAGS) $< -o $@ $(LDFLAGS) 30 | $(STRIP) $@ 31 | 32 | install: all 33 | mkdir -p $(DESTDIR)$(BINDIR) 34 | install -m 755 fakehttp $(DESTDIR)$(BINDIR)/fakehttp 35 | 36 | uninstall: 37 | $(RM) $(DESTDIR)$(BINDIR)/fakehttp 38 | 39 | .PHONY: all clean install uninstall 40 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # FakeHTTP 2 | 3 | Obfuscate all your TCP connections into HTTP protocol, using Netfilter Queue (NFQUEUE). 4 | 5 | [[ 中文文档 ]](https://github.com/MikeWang000000/FakeHTTP/wiki) 6 | 7 | 8 | ## Quick Start 9 | 10 | ``` 11 | fakehttp -h www.example.com -i eth0 12 | ``` 13 | 14 | 15 | ## Usage 16 | 17 | ``` 18 | Usage: fakehttp [options] 19 | 20 | Options: 21 | -d run as a daemon 22 | -h hostname for obfuscation (required) 23 | -i network interface name (required) 24 | -k kill the running process 25 | -m fwmark for bypassing the queue 26 | -n netfilter queue number 27 | -r duplicate generated packets for times 28 | -s enable silent mode 29 | -t TTL for generated packets 30 | -w write log to instead of stderr 31 | -x set the mask for fwmark 32 | -z use iptables commands instead of nft 33 | 34 | ``` 35 | 36 | 37 | ## License 38 | 39 | GNU General Public License v3.0 40 | -------------------------------------------------------------------------------- /src/fakehttp.c: -------------------------------------------------------------------------------- 1 | /* 2 | * fakehttp.c - FakeHTTP: https://github.com/MikeWang000000/FakeHTTP 3 | * 4 | * Copyright (C) 2025 MikeWang000000 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | */ 19 | 20 | #define _GNU_SOURCE 21 | #include 22 | #include 23 | #include 24 | #include 25 | #include 26 | #include 27 | #include 28 | #include 29 | #include 30 | #include 31 | #include 32 | #include 33 | #include 34 | #include 35 | #include 36 | #include 37 | #include 38 | #include 39 | #include 40 | #include 41 | 42 | #ifndef VERSION 43 | #define VERSION "dev" 44 | #endif /* VERSION */ 45 | 46 | #define E(...) logger(__func__, __FILE__, __LINE__, __VA_ARGS__) 47 | #define E_RAW(...) logger_raw(__VA_ARGS__) 48 | #define E_INFO(...) \ 49 | if (!g_silent) { \ 50 | E(__VA_ARGS__); \ 51 | } 52 | 53 | static FILE *g_logfp = NULL; 54 | static int g_sockfd = 0; 55 | static int g_exit = 0; 56 | static int g_daemon = 0; 57 | static int g_silent = 0; 58 | static int g_killproc = 0; 59 | static int g_use_iptables = 0; 60 | static int g_repeat = 3; 61 | static uint32_t g_fwmark = 0x8000; 62 | static uint32_t g_fwmask = 0; 63 | static uint32_t g_nfqnum = 512; 64 | static uint8_t g_ttl = 3; 65 | static const char *g_iface = NULL; 66 | static const char *g_hostname = NULL; 67 | 68 | static void print_usage(const char *name) 69 | { 70 | fprintf(stderr, 71 | "Usage: %s [options]\n" 72 | "\n" 73 | "Options:\n" 74 | " -d run as a daemon\n" 75 | " -h hostname for obfuscation (required)\n" 76 | " -i network interface name (required)\n" 77 | " -k kill the running process\n" 78 | " -m fwmark for bypassing the queue\n" 79 | " -n netfilter queue number\n" 80 | " -r duplicate generated packets for " 81 | "times\n" 82 | " -s enable silent mode\n" 83 | " -t TTL for generated packets\n" 84 | " -w write log to instead of stderr\n" 85 | " -x set the mask for fwmark\n" 86 | " -z use iptables commands instead of nft\n" 87 | "\n" 88 | "FakeHTTP version " VERSION "\n", 89 | name); 90 | } 91 | 92 | 93 | static void logger(const char *funcname, const char *filename, 94 | unsigned long line, const char *fmt, ...) 95 | { 96 | FILE *fp; 97 | va_list args; 98 | time_t t; 99 | char *stime; 100 | 101 | fp = g_logfp ? g_logfp : stderr; 102 | t = time(NULL); 103 | stime = ctime(&t); 104 | if (stime) { 105 | stime[strlen(stime) - 1] = '\0'; 106 | fprintf(fp, "%s ", stime); 107 | } 108 | 109 | fprintf(fp, "[%s() - %s:%lu] ", funcname, filename, line); 110 | va_start(args, fmt); 111 | vfprintf(fp, fmt, args); 112 | va_end(args); 113 | fputc('\n', fp); 114 | fflush(fp); 115 | } 116 | 117 | 118 | static void logger_raw(const char *fmt, ...) 119 | { 120 | FILE *fp; 121 | va_list args; 122 | 123 | fp = g_logfp ? g_logfp : stderr; 124 | va_start(args, fmt); 125 | vfprintf(fp, fmt, args); 126 | va_end(args); 127 | fflush(fp); 128 | } 129 | 130 | 131 | static void signal_handler(int sig) 132 | { 133 | switch (sig) { 134 | case SIGINT: 135 | case SIGTERM: 136 | g_exit = 1; 137 | break; 138 | default: 139 | break; 140 | } 141 | } 142 | 143 | 144 | static int signal_setup(void) 145 | { 146 | struct sigaction sa; 147 | int res; 148 | 149 | memset(&sa, 0, sizeof(sa)); 150 | sa.sa_handler = SIG_IGN; 151 | 152 | res = sigaction(SIGPIPE, &sa, NULL); 153 | if (res < 0) { 154 | E("ERROR: sigaction(): %s", strerror(errno)); 155 | return -1; 156 | } 157 | 158 | res = sigaction(SIGHUP, &sa, NULL); 159 | if (res < 0) { 160 | E("ERROR: sigaction(): %s", strerror(errno)); 161 | return -1; 162 | } 163 | 164 | sa.sa_handler = signal_handler; 165 | 166 | res = sigaction(SIGINT, &sa, NULL); 167 | if (res < 0) { 168 | E("ERROR: sigaction(): %s", strerror(errno)); 169 | return -1; 170 | } 171 | 172 | res = sigaction(SIGTERM, &sa, NULL); 173 | if (res < 0) { 174 | E("ERROR: sigaction(): %s", strerror(errno)); 175 | return -1; 176 | } 177 | 178 | return 0; 179 | } 180 | 181 | 182 | static int kill_running(int signal) 183 | { 184 | int res, matched, err; 185 | ssize_t len; 186 | DIR *procfs; 187 | struct dirent *entry; 188 | pid_t pid, self_pid; 189 | char self_path[PATH_MAX], proc_path[PATH_MAX], exe_path[PATH_MAX]; 190 | 191 | self_pid = getpid(); 192 | 193 | len = readlink("/proc/self/exe", self_path, sizeof(self_path)); 194 | if (len < 0 || (size_t) len >= sizeof(self_path)) { 195 | E("ERROR: readlink(): /proc/self/exe: %s", strerror(errno)); 196 | return -1; 197 | } 198 | self_path[len] = 0; 199 | 200 | procfs = opendir("/proc"); 201 | if (!procfs) { 202 | E("ERROR: opendir(): /proc: %s", strerror(errno)); 203 | return -1; 204 | } 205 | 206 | matched = err = 0; 207 | while ((entry = readdir(procfs))) { 208 | pid = strtoull(entry->d_name, NULL, 0); 209 | if (pid <= 1 || pid == self_pid) { 210 | continue; 211 | } 212 | 213 | res = snprintf(exe_path, sizeof(exe_path), "/proc/%s/exe", 214 | entry->d_name); 215 | if (res < 0 || (size_t) res >= sizeof(exe_path)) { 216 | continue; 217 | } 218 | 219 | len = readlink(exe_path, proc_path, sizeof(proc_path)); 220 | if (len < 0 || (size_t) len >= sizeof(self_path)) { 221 | continue; 222 | } 223 | proc_path[len] = 0; 224 | 225 | if (strcmp(self_path, proc_path) == 0) { 226 | matched = 1; 227 | 228 | if (signal) { 229 | res = kill(pid, signal); 230 | if (res < 0) { 231 | E("ERROR: kill(): %llu: %s", pid, strerror(errno)); 232 | err = 1; 233 | } 234 | } 235 | } 236 | } 237 | 238 | res = closedir(procfs); 239 | if (res < 0) { 240 | E("ERROR: closedir(): %s", strerror(errno)); 241 | err = 1; 242 | } 243 | 244 | if (matched && !err) { 245 | return 0; 246 | } 247 | 248 | return -1; 249 | } 250 | 251 | 252 | static int execute_command(char **argv, int silent, char *input) 253 | { 254 | int res, pipefd[2], status, fd, i; 255 | size_t input_len, written; 256 | ssize_t n; 257 | pid_t pid; 258 | 259 | if (input) { 260 | res = pipe(pipefd); 261 | if (res < 0) { 262 | E("ERROR: pipe(): %s", strerror(errno)); 263 | return -1; 264 | } 265 | } 266 | 267 | pid = fork(); 268 | if (pid < 0) { 269 | E("ERROR: fork(): %s", strerror(errno)); 270 | if (input) { 271 | close(pipefd[0]); 272 | close(pipefd[1]); 273 | } 274 | return -1; 275 | } 276 | 277 | if (!pid) { 278 | fd = -1; 279 | 280 | if (silent) { 281 | fd = open("/dev/null", O_WRONLY); 282 | if (fd < 0) { 283 | E("ERROR: open(): %s", strerror(errno)); 284 | _exit(EXIT_FAILURE); 285 | } 286 | } else if (g_logfp) { 287 | fd = fileno(g_logfp); 288 | if (fd < 0) { 289 | E("ERROR: fileno(): %s", strerror(errno)); 290 | _exit(EXIT_FAILURE); 291 | } 292 | } 293 | 294 | if (fd >= 0) { 295 | res = dup2(fd, STDOUT_FILENO); 296 | if (res < 0) { 297 | E("ERROR: dup2(): %s", strerror(errno)); 298 | _exit(EXIT_FAILURE); 299 | } 300 | res = dup2(fd, STDERR_FILENO); 301 | if (res < 0) { 302 | E("ERROR: dup2(): %s", strerror(errno)); 303 | _exit(EXIT_FAILURE); 304 | } 305 | close(fd); 306 | } 307 | 308 | if (input) { 309 | close(pipefd[1]); 310 | res = dup2(pipefd[0], STDIN_FILENO); 311 | if (res < 0) { 312 | E("ERROR: dup2(): %s", strerror(errno)); 313 | _exit(EXIT_FAILURE); 314 | } 315 | close(pipefd[0]); 316 | } 317 | 318 | execvp(argv[0], argv); 319 | 320 | E("ERROR: execvp(): %s: %s", argv[0], strerror(errno)); 321 | 322 | _exit(EXIT_FAILURE); 323 | } 324 | 325 | if (input) { 326 | close(pipefd[0]); 327 | input_len = strlen(input); 328 | for (written = 0; written < input_len; written += n) { 329 | n = write(pipefd[1], input + written, input_len - written); 330 | if (n < 0) { 331 | E("ERROR: write(): %s", strerror(errno)); 332 | break; 333 | } 334 | } 335 | close(pipefd[1]); 336 | } 337 | 338 | if (waitpid(pid, &status, 0) < 0) { 339 | E("ERROR: waitpid(): %s", strerror(errno)); 340 | goto child_failed; 341 | } 342 | 343 | if (WIFEXITED(status) && WEXITSTATUS(status) == 0) { 344 | return 0; 345 | } 346 | 347 | child_failed: 348 | if (!silent) { 349 | E_RAW("[*] failed command is: %s", argv[0]); 350 | for (i = 1; argv[i]; i++) { 351 | E_RAW(" %s", argv[i]); 352 | } 353 | E_RAW("\n"); 354 | } 355 | 356 | return -1; 357 | } 358 | 359 | 360 | static int nft_is_working(void) 361 | { 362 | char *nft_ver_cmd[] = {"nft", "--version", NULL}; 363 | 364 | return !execute_command(nft_ver_cmd, 1, NULL); 365 | } 366 | 367 | 368 | static int nft_rules_flush(int auto_create) 369 | { 370 | int res; 371 | char *nft_flush_cmd[] = {"nft", "flush table fakehttp", NULL}; 372 | char *nft_cmd[] = {"nft", "-f", "-", NULL}; 373 | char *nft_create_conf = 374 | "table ip fakehttp {\n" 375 | " chain fh_input {\n" 376 | " type filter hook input priority mangle - 5;\n" 377 | " policy accept;\n" 378 | " }\n" 379 | "\n" 380 | " chain fh_output {\n" 381 | " type filter hook forward priority mangle - 5;\n" 382 | " policy accept;\n" 383 | " }\n" 384 | "\n" 385 | " chain fh_rules {\n" 386 | " }\n" 387 | "}\n"; 388 | 389 | res = execute_command(nft_flush_cmd, 1, NULL); 390 | if (res < 0) { 391 | if (!auto_create) { 392 | return -1; 393 | } 394 | 395 | res = execute_command(nft_cmd, 0, nft_create_conf); 396 | if (res) { 397 | E("ERROR: execute_command()"); 398 | return -1; 399 | } 400 | } 401 | 402 | return 0; 403 | } 404 | 405 | 406 | static int nft_rules_setup(void) 407 | { 408 | size_t i, nft_opt_cmds_cnt; 409 | int res; 410 | char *nft_cmd[] = {"nft", "-f", "-", NULL}; 411 | char nft_conf_buff[2048]; 412 | char *nft_conf_fmt = 413 | "table ip fakehttp {\n" 414 | " chain fh_input {\n" 415 | " jump fh_rules;\n" 416 | " }\n" 417 | "\n" 418 | " chain fh_output {\n" 419 | " jump fh_rules;\n" 420 | " }\n" 421 | "\n" 422 | " chain fh_rules {\n" 423 | 424 | /* 425 | exclude marked packets 426 | */ 427 | " meta mark and %" PRIu32 " == %" PRIu32 428 | " ct mark set ct mark and %" PRIu32 " xor %" PRIu32 ";\n" 429 | " ct mark and %" PRIu32 " == %" PRIu32 430 | " meta mark set mark and %" PRIu32 " xor %" PRIu32 ";\n" 431 | " meta mark and %" PRIu32 " == %" PRIu32 " return;\n" 432 | 433 | /* 434 | exclude local IPs 435 | */ 436 | " ip saddr 0.0.0.0/8 return;\n" 437 | " ip saddr 10.0.0.0/8 return;\n" 438 | " ip saddr 100.64.0.0/10 return;\n" 439 | " ip saddr 127.0.0.0/8 return;\n" 440 | " ip saddr 169.254.0.0/16 return;\n" 441 | " ip saddr 172.16.0.0/12 return;\n" 442 | " ip saddr 192.168.0.0/16 return;\n" 443 | " ip saddr 224.0.0.0/3 return;\n" 444 | 445 | /* 446 | send to nfqueue 447 | */ 448 | " iifname \"%s\" tcp flags & (fin | rst | ack) == ack queue " 449 | "num %" PRIu32 " bypass;\n" 450 | " }\n" 451 | "}\n"; 452 | 453 | char *nft_opt_cmds[][32] = { 454 | /* 455 | exclude packets from connections with more than 32 packets 456 | */ 457 | {"nft", "insert rule ip fakehttp fh_rules ct packets > 32 return", 458 | NULL}, 459 | 460 | /* 461 | exclude big packets 462 | */ 463 | {"nft", "insert rule ip fakehttp fh_rules meta length > 120 return", 464 | NULL}}; 465 | 466 | nft_opt_cmds_cnt = sizeof(nft_opt_cmds) / sizeof(*nft_opt_cmds); 467 | 468 | res = snprintf(nft_conf_buff, sizeof(nft_conf_buff), nft_conf_fmt, 469 | g_fwmask, g_fwmark, ~g_fwmask, g_fwmark, g_fwmask, g_fwmark, 470 | ~g_fwmask, g_fwmark, g_fwmask, g_fwmark, g_iface, g_nfqnum); 471 | if (res < 0 || (size_t) res >= sizeof(nft_conf_buff)) { 472 | E("ERROR: snprintf()"); 473 | return -1; 474 | } 475 | 476 | res = execute_command(nft_cmd, 1, nft_conf_buff); 477 | if (res) { 478 | E("ERROR: execute_command()"); 479 | return -1; 480 | } 481 | 482 | for (i = 0; i < nft_opt_cmds_cnt; i++) { 483 | execute_command(nft_opt_cmds[i], 1, NULL); 484 | } 485 | 486 | return 0; 487 | } 488 | 489 | 490 | static int ipt_rules_flush(int auto_create) 491 | { 492 | int res; 493 | size_t i, cnt; 494 | char *ipt_flush_cmd[] = {"iptables", "-w", "-t", "mangle", 495 | "-F", "FAKEHTTP", NULL}; 496 | char *ipt_create_cmds[][32] = { 497 | {"iptables", "-w", "-t", "mangle", "-N", "FAKEHTTP", NULL}, 498 | 499 | {"iptables", "-w", "-t", "mangle", "-I", "INPUT", "-j", "FAKEHTTP", 500 | NULL}, 501 | 502 | {"iptables", "-w", "-t", "mangle", "-I", "FORWARD", "-j", "FAKEHTTP", 503 | NULL}}; 504 | 505 | res = execute_command(ipt_flush_cmd, 1, NULL); 506 | if (res < 0) { 507 | if (!auto_create) { 508 | return -1; 509 | } 510 | 511 | cnt = sizeof(ipt_create_cmds) / sizeof(*ipt_create_cmds); 512 | for (i = 0; i < cnt; i++) { 513 | res = execute_command(ipt_create_cmds[i], 0, NULL); 514 | if (res) { 515 | E("ERROR: execute_command()"); 516 | return -1; 517 | } 518 | } 519 | } 520 | 521 | return 0; 522 | } 523 | 524 | 525 | static int ipt_rules_setup(void) 526 | { 527 | char xmark_str[64], nfqnum_str[32], iface_str[32]; 528 | size_t i, ipt_cmds_cnt, ipt_opt_cmds_cnt; 529 | int res; 530 | char *ipt_cmds[][32] = { 531 | /* 532 | exclude marked packets 533 | */ 534 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-m", "mark", 535 | "--mark", xmark_str, "-j", "CONNMARK", "--set-xmark", xmark_str, 536 | NULL}, 537 | 538 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-m", "connmark", 539 | "--mark", xmark_str, "-j", "MARK", "--set-xmark", xmark_str, NULL}, 540 | 541 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-m", "mark", 542 | "--mark", xmark_str, "-j", "RETURN", NULL}, 543 | 544 | /* 545 | exclude local IPs 546 | */ 547 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-s", "0.0.0.0/8", 548 | "-j", "RETURN", NULL}, 549 | 550 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-s", 551 | "10.0.0.0/8", "-j", "RETURN", NULL}, 552 | 553 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-s", 554 | "100.64.0.0/10", "-j", "RETURN", NULL}, 555 | 556 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-s", 557 | "127.0.0.0/8", "-j", "RETURN", NULL}, 558 | 559 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-s", 560 | "169.254.0.0/16", "-j", "RETURN", NULL}, 561 | 562 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-s", 563 | "172.16.0.0/12", "-j", "RETURN", NULL}, 564 | 565 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-s", 566 | "192.168.0.0/16", "-j", "RETURN", NULL}, 567 | 568 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-s", 569 | "224.0.0.0/3", "-j", "RETURN", NULL}, 570 | 571 | /* 572 | send to nfqueue 573 | */ 574 | {"iptables", "-w", "-t", "mangle", "-A", "FAKEHTTP", "-i", iface_str, 575 | "-p", "tcp", "--tcp-flags", "ACK,FIN,RST", "ACK", "-j", "NFQUEUE", 576 | "--queue-bypass", "--queue-num", nfqnum_str, NULL}}; 577 | 578 | char *ipt_opt_cmds[][32] = { 579 | /* 580 | exclude packets from connections with more than 32 packets 581 | */ 582 | {"iptables", "-w", "-t", "mangle", "-I", "FAKEHTTP", "-m", "connbytes", 583 | "!", "--connbytes", "0:32", "--connbytes-dir", "both", 584 | "--connbytes-mode", "packets", "-j", "RETURN", NULL}, 585 | 586 | /* 587 | exclude big packets 588 | */ 589 | {"iptables", "-w", "-t", "mangle", "-I", "FAKEHTTP", "-m", "length", 590 | "!", "--length", "0:120", "-j", "RETURN", NULL}}; 591 | 592 | ipt_cmds_cnt = sizeof(ipt_cmds) / sizeof(*ipt_cmds); 593 | ipt_opt_cmds_cnt = sizeof(ipt_opt_cmds) / sizeof(*ipt_opt_cmds); 594 | 595 | res = snprintf(xmark_str, sizeof(xmark_str), "%" PRIu32 "/%" PRIu32, 596 | g_fwmark, g_fwmask); 597 | if (res < 0 || (size_t) res >= sizeof(xmark_str)) { 598 | E("ERROR: snprintf()"); 599 | return -1; 600 | } 601 | 602 | res = snprintf(nfqnum_str, sizeof(nfqnum_str), "%" PRIu32, g_nfqnum); 603 | if (res < 0 || (size_t) res >= sizeof(nfqnum_str)) { 604 | E("ERROR: snprintf()"); 605 | return -1; 606 | } 607 | 608 | res = snprintf(iface_str, sizeof(iface_str), "%s", g_iface); 609 | if (res < 0 || (size_t) res >= sizeof(iface_str)) { 610 | E("ERROR: snprintf()"); 611 | return -1; 612 | } 613 | 614 | for (i = 0; i < ipt_cmds_cnt; i++) { 615 | res = execute_command(ipt_cmds[i], 0, NULL); 616 | if (res) { 617 | E("ERROR: execute_command()"); 618 | return -1; 619 | } 620 | } 621 | 622 | for (i = 0; i < ipt_opt_cmds_cnt; i++) { 623 | execute_command(ipt_opt_cmds[i], 1, NULL); 624 | } 625 | 626 | return 0; 627 | } 628 | 629 | 630 | static uint16_t chksum(void *pseudo, size_t pseudo_count, void *data, 631 | size_t count) 632 | { 633 | uint32_t sum = 0; 634 | uint8_t *ptr, b1, b2; 635 | 636 | if (pseudo_count % 2 != 0) { 637 | return 0; 638 | } 639 | 640 | ptr = pseudo; 641 | while (pseudo_count > 1) { 642 | b1 = *ptr++; 643 | b2 = *ptr++; 644 | sum += (b2 << 8) + b1; 645 | pseudo_count -= 2; 646 | } 647 | 648 | ptr = data; 649 | while (count > 1) { 650 | b1 = *ptr++; 651 | b2 = *ptr++; 652 | sum += (b2 << 8) + b1; 653 | count -= 2; 654 | } 655 | if (count > 0) { 656 | sum += *ptr; 657 | } 658 | while (sum >> 16) { 659 | sum = (sum & 0xffff) + (sum >> 16); 660 | } 661 | 662 | return ~sum; 663 | } 664 | 665 | 666 | static uint16_t chksum_pseudo_ipv4(uint8_t protonum, void *data, size_t count, 667 | uint32_t saddr_be, uint32_t daddr_be) 668 | { 669 | struct { 670 | uint32_t saddr; 671 | uint32_t daddr; 672 | uint8_t zero; 673 | uint8_t protocol; 674 | uint16_t len; 675 | } __attribute__((packed)) pseudo; 676 | 677 | pseudo.saddr = saddr_be; 678 | pseudo.daddr = daddr_be; 679 | pseudo.zero = 0; 680 | pseudo.protocol = protonum; 681 | pseudo.len = htons(count); 682 | 683 | return chksum(&pseudo, sizeof(pseudo), data, count); 684 | } 685 | 686 | 687 | static int make_pkt(char *buffer, size_t buffer_size, uint32_t saddr_be, 688 | uint32_t daddr_be, uint16_t sport_be, uint16_t dport_be, 689 | uint32_t seq_be, uint32_t ackseq_be, int psh, 690 | char *tcp_payload, size_t tcp_payload_size) 691 | { 692 | size_t pkt_len; 693 | struct iphdr *iph; 694 | struct tcphdr *tcph; 695 | char *tcppl; 696 | 697 | pkt_len = sizeof(*iph) + sizeof(*tcph) + tcp_payload_size; 698 | if (buffer_size < pkt_len + 1) { 699 | return -1; 700 | } 701 | 702 | iph = (struct iphdr *) buffer; 703 | tcph = (struct tcphdr *) (buffer + sizeof(*iph)); 704 | tcppl = buffer + sizeof(*iph) + sizeof(*tcph); 705 | 706 | memset(iph, 0, sizeof(*iph)); 707 | iph->version = 4; 708 | iph->ihl = sizeof(*iph) / 4; 709 | iph->tos = 0; 710 | iph->tot_len = htons(pkt_len); 711 | iph->id = ((rand() & 0xff) << 8) | (rand() & 0xff); 712 | iph->frag_off = htons(1 << 14 /* DF */); 713 | iph->ttl = g_ttl; 714 | iph->protocol = IPPROTO_TCP; 715 | iph->check = 0; 716 | iph->saddr = saddr_be; 717 | iph->daddr = daddr_be; 718 | 719 | memset(tcph, 0, sizeof(*tcph)); 720 | tcph->source = sport_be; 721 | tcph->dest = dport_be; 722 | tcph->seq = seq_be; 723 | tcph->ack_seq = ackseq_be; 724 | tcph->doff = sizeof(*tcph) / 4; 725 | tcph->psh = psh; 726 | tcph->ack = 1; 727 | tcph->window = htons(0x0080); 728 | tcph->check = 0; 729 | tcph->urg_ptr = 0; 730 | 731 | if (tcp_payload_size) { 732 | memcpy(tcppl, tcp_payload, tcp_payload_size); 733 | } 734 | 735 | iph->check = chksum(NULL, 0, iph, sizeof(*iph)); 736 | tcph->check = chksum_pseudo_ipv4(IPPROTO_TCP, tcph, 737 | sizeof(*tcph) + tcp_payload_size, 738 | saddr_be, daddr_be); 739 | return pkt_len; 740 | } 741 | 742 | 743 | static int send_ack(uint32_t saddr_be, uint32_t daddr_be, uint16_t sport_be, 744 | uint16_t dport_be, uint32_t seq_be, uint32_t ackseq_be) 745 | { 746 | int pkt_len; 747 | ssize_t nbytes; 748 | char pkt_buff[1024]; 749 | struct sockaddr_in dstaddr; 750 | 751 | memset(&dstaddr, 0, sizeof(dstaddr)); 752 | dstaddr.sin_family = AF_INET; 753 | dstaddr.sin_addr.s_addr = daddr_be; 754 | 755 | pkt_len = make_pkt(pkt_buff, sizeof(pkt_buff), saddr_be, daddr_be, 756 | sport_be, dport_be, seq_be, ackseq_be, 0, NULL, 0); 757 | if (pkt_len < 0) { 758 | E("ERROR: make_pkt()"); 759 | return -1; 760 | } 761 | 762 | nbytes = sendto(g_sockfd, pkt_buff, pkt_len, 0, 763 | (struct sockaddr *) &dstaddr, sizeof(dstaddr)); 764 | if (nbytes < 0) { 765 | E("ERROR: sendto(): %s", strerror(errno)); 766 | return -1; 767 | } 768 | 769 | return 0; 770 | } 771 | 772 | 773 | static int send_http(uint32_t saddr_be, uint32_t daddr_be, uint16_t sport_be, 774 | uint16_t dport_be, uint32_t seq_be, uint32_t ackseq_be) 775 | { 776 | static const char *http_fmt = "GET / HTTP/1.1\r\n" 777 | "Host: %s\r\n" 778 | "Accept: */*\r\n" 779 | "\r\n"; 780 | 781 | int http_len, pkt_len; 782 | ssize_t nbytes; 783 | char http_buff[512], pkt_buff[1024]; 784 | struct sockaddr_in dstaddr; 785 | 786 | memset(&dstaddr, 0, sizeof(dstaddr)); 787 | dstaddr.sin_family = AF_INET; 788 | dstaddr.sin_addr.s_addr = daddr_be; 789 | 790 | http_len = snprintf(http_buff, sizeof(http_buff), http_fmt, g_hostname); 791 | if (http_len < 0 || (size_t) http_len >= sizeof(http_buff)) { 792 | E("ERROR: snprintf()"); 793 | return -1; 794 | } 795 | 796 | pkt_len = make_pkt(pkt_buff, sizeof(pkt_buff), saddr_be, daddr_be, 797 | sport_be, dport_be, seq_be, ackseq_be, 1, http_buff, 798 | http_len); 799 | if (pkt_len < 0) { 800 | E("ERROR: make_pkt()"); 801 | return -1; 802 | } 803 | 804 | nbytes = sendto(g_sockfd, pkt_buff, pkt_len, 0, 805 | (struct sockaddr *) &dstaddr, sizeof(dstaddr)); 806 | if (nbytes < 0) { 807 | E("ERROR: sendto(): %s", strerror(errno)); 808 | return -1; 809 | } 810 | 811 | return 0; 812 | } 813 | 814 | 815 | static int callback(struct nfq_q_handle *qh, struct nfgenmsg *nfmsg, 816 | struct nfq_data *nfa, void *data) 817 | { 818 | uint32_t pkt_id, ack_new; 819 | int res, i, pkt_len, iph_len, tcph_len, tcp_payload_len; 820 | struct nfqnl_msg_packet_hdr *ph; 821 | struct iphdr *iph; 822 | struct tcphdr *tcph; 823 | unsigned char *pkt_data; 824 | char src_ip[INET_ADDRSTRLEN], dst_ip[INET_ADDRSTRLEN]; 825 | 826 | (void) nfmsg; 827 | (void) data; 828 | 829 | ph = nfq_get_msg_packet_hdr(nfa); 830 | if (!ph) { 831 | E("ERROR: nfq_get_msg_packet_hdr()"); 832 | return -1; 833 | } 834 | 835 | pkt_id = ntohl(ph->packet_id); 836 | pkt_data = NULL; 837 | pkt_len = nfq_get_payload(nfa, &pkt_data); 838 | if (pkt_len < 0 || !pkt_data) { 839 | E("ERROR: nfq_get_payload()"); 840 | goto ret_accept; 841 | } 842 | 843 | if ((size_t) pkt_len < sizeof(*iph)) { 844 | E("ERROR: invalid packet length: %d", pkt_len); 845 | goto ret_accept; 846 | } 847 | 848 | iph = (struct iphdr *) pkt_data; 849 | iph_len = iph->ihl * 4; 850 | 851 | if ((size_t) iph_len < sizeof(*iph)) { 852 | E("ERROR: invalid IP header length: %d", iph_len); 853 | goto ret_accept; 854 | } 855 | 856 | if (iph->protocol != IPPROTO_TCP) { 857 | E("ERROR: not a TCP packet (protocol %d)", (int) iph->protocol); 858 | goto ret_accept; 859 | } 860 | 861 | if ((size_t) pkt_len < iph_len + sizeof(*tcph)) { 862 | E("ERROR: invalid packet length: %d", pkt_len); 863 | goto ret_accept; 864 | } 865 | 866 | tcph = (struct tcphdr *) (pkt_data + iph_len); 867 | tcph_len = tcph->doff * 4; 868 | tcp_payload_len = pkt_len - iph_len - tcph_len; 869 | 870 | if (!g_silent) { 871 | if (!inet_ntop(AF_INET, &iph->saddr, src_ip, sizeof(src_ip))) { 872 | strncpy(src_ip, "INVALID", sizeof(src_ip) - 1); 873 | src_ip[sizeof(src_ip) - 1] = '\0'; 874 | } 875 | if (!inet_ntop(AF_INET, &iph->daddr, dst_ip, sizeof(dst_ip))) { 876 | strncpy(dst_ip, "INVALID", sizeof(dst_ip) - 1); 877 | src_ip[sizeof(src_ip) - 1] = '\0'; 878 | } 879 | } 880 | 881 | if (tcp_payload_len > 0) { 882 | E_INFO("%s:%u ===PAYLOAD(?)===> %s:%u", src_ip, ntohs(tcph->source), 883 | dst_ip, ntohs(tcph->dest)); 884 | goto ret_mark_repeat; 885 | } else if (tcph->syn && tcph->ack) { 886 | E_INFO("%s:%u ===SYN-ACK===> %s:%u", src_ip, ntohs(tcph->source), 887 | dst_ip, ntohs(tcph->dest)); 888 | 889 | ack_new = ntohl(tcph->seq); 890 | ack_new++; 891 | ack_new = htonl(ack_new); 892 | 893 | for (i = 0; i < g_repeat; i++) { 894 | res = send_ack(iph->daddr, iph->saddr, tcph->dest, tcph->source, 895 | tcph->ack_seq, ack_new); 896 | if (res < 0) { 897 | E("ERROR: send_ack()"); 898 | goto ret_accept; 899 | } 900 | } 901 | E_INFO("%s:%u <===ACK(*)=== %s:%u", src_ip, ntohs(tcph->source), 902 | dst_ip, ntohs(tcph->dest)); 903 | 904 | for (i = 0; i < g_repeat; i++) { 905 | res = send_http(iph->daddr, iph->saddr, tcph->dest, tcph->source, 906 | tcph->ack_seq, ack_new); 907 | if (res < 0) { 908 | E("ERROR: send_http()"); 909 | goto ret_accept; 910 | } 911 | } 912 | E_INFO("%s:%u <===HTTP(*)=== %s:%u", src_ip, ntohs(tcph->source), 913 | dst_ip, ntohs(tcph->dest)); 914 | 915 | goto ret_mark_repeat; 916 | } else if (tcph->ack) { 917 | E_INFO("%s:%u ===ACK===> %s:%u", src_ip, ntohs(tcph->source), dst_ip, 918 | ntohs(tcph->dest)); 919 | 920 | for (i = 0; i < g_repeat; i++) { 921 | res = send_http(iph->daddr, iph->saddr, tcph->dest, tcph->source, 922 | tcph->ack_seq, tcph->seq); 923 | if (res < 0) { 924 | E("ERROR: send_http()"); 925 | goto ret_accept; 926 | } 927 | } 928 | E_INFO("%s:%u <===HTTP(*)=== %s:%u", src_ip, ntohs(tcph->source), 929 | dst_ip, ntohs(tcph->dest)); 930 | 931 | goto ret_mark_repeat; 932 | } else { 933 | E_INFO("%s:%u ===(?)===> %s:%u", src_ip, ntohs(tcph->source), dst_ip, 934 | ntohs(tcph->dest)); 935 | goto ret_accept; 936 | } 937 | 938 | ret_accept: 939 | return nfq_set_verdict(qh, pkt_id, NF_ACCEPT, 0, NULL); 940 | 941 | ret_mark_repeat: 942 | return nfq_set_verdict2(qh, pkt_id, NF_REPEAT, g_fwmark, 0, NULL); 943 | } 944 | 945 | 946 | int main(int argc, char *argv[]) 947 | { 948 | static const size_t buffsize = UINT16_MAX; 949 | 950 | unsigned long long tmp; 951 | struct nfq_handle *h; 952 | struct nfq_q_handle *qh; 953 | int res, fd, opt, exitcode, err_cnt; 954 | socklen_t opt_len; 955 | ssize_t recv_len; 956 | char *buff, *err_hint; 957 | 958 | exitcode = EXIT_FAILURE; 959 | 960 | if (!argc) { 961 | return EXIT_FAILURE; 962 | } 963 | 964 | while ((opt = getopt(argc, argv, "dh:i:km:n:r:st:w:x:z")) != -1) { 965 | switch (opt) { 966 | case 'd': 967 | g_daemon = 1; 968 | break; 969 | case 'h': 970 | if (strlen(optarg) > _POSIX_HOST_NAME_MAX) { 971 | fprintf(stderr, "%s: hostname is too long.\n", argv[0]); 972 | print_usage(argv[0]); 973 | return EXIT_FAILURE; 974 | } 975 | g_hostname = optarg; 976 | break; 977 | case 'i': 978 | g_iface = optarg; 979 | if (strlen(optarg) > IFNAMSIZ - 1) { 980 | fprintf(stderr, "%s: interface name is too long.\n", 981 | argv[0]); 982 | print_usage(argv[0]); 983 | return EXIT_FAILURE; 984 | } 985 | break; 986 | case 'k': 987 | g_killproc = 1; 988 | break; 989 | case 'm': 990 | tmp = strtoull(optarg, NULL, 0); 991 | if (!tmp || tmp > UINT32_MAX) { 992 | fprintf(stderr, "%s: invalid value for -m.\n", argv[0]); 993 | print_usage(argv[0]); 994 | return EXIT_FAILURE; 995 | } 996 | g_fwmark = tmp; 997 | break; 998 | case 'n': 999 | tmp = strtoull(optarg, NULL, 0); 1000 | if (!tmp || tmp > UINT32_MAX) { 1001 | fprintf(stderr, "%s: invalid value for -n.\n", argv[0]); 1002 | print_usage(argv[0]); 1003 | return EXIT_FAILURE; 1004 | } 1005 | g_nfqnum = tmp; 1006 | break; 1007 | case 'r': 1008 | tmp = strtoull(optarg, NULL, 0); 1009 | if (!tmp || tmp > 10) { 1010 | fprintf(stderr, "%s: invalid value for -r.\n", argv[0]); 1011 | print_usage(argv[0]); 1012 | return EXIT_FAILURE; 1013 | } 1014 | g_repeat = tmp; 1015 | break; 1016 | case 's': 1017 | g_silent = 1; 1018 | break; 1019 | case 't': 1020 | if (sscanf(optarg, "%llu", &tmp) != 1 || !tmp || 1021 | tmp > UINT8_MAX) { 1022 | fprintf(stderr, "%s: invalid value for -t.\n", argv[0]); 1023 | print_usage(argv[0]); 1024 | return EXIT_FAILURE; 1025 | } 1026 | g_ttl = tmp; 1027 | break; 1028 | case 'w': 1029 | g_logfp = fopen(optarg, "a"); 1030 | if (!g_logfp) { 1031 | fprintf(stderr, "%s: invalid value for -w: %s\n", argv[0], 1032 | strerror(errno)); 1033 | print_usage(argv[0]); 1034 | return EXIT_FAILURE; 1035 | } 1036 | break; 1037 | case 'x': 1038 | tmp = strtoull(optarg, NULL, 0); 1039 | if (!tmp || tmp > UINT32_MAX) { 1040 | fprintf(stderr, "%s: invalid value for -x.\n", argv[0]); 1041 | print_usage(argv[0]); 1042 | return EXIT_FAILURE; 1043 | } 1044 | g_fwmask = tmp; 1045 | break; 1046 | case 'z': 1047 | g_use_iptables = 1; 1048 | break; 1049 | default: 1050 | print_usage(argv[0]); 1051 | return EXIT_FAILURE; 1052 | } 1053 | } 1054 | 1055 | if (g_killproc) { 1056 | res = kill_running(SIGTERM); 1057 | return res ? EXIT_FAILURE : EXIT_SUCCESS; 1058 | } 1059 | 1060 | if (!g_fwmask) { 1061 | g_fwmask = g_fwmark; 1062 | } else if ((g_fwmark & g_fwmask) != g_fwmark) { 1063 | fprintf(stderr, "%s: invalid value for -m/-x.\n", argv[0]); 1064 | print_usage(argv[0]); 1065 | return EXIT_FAILURE; 1066 | } 1067 | 1068 | if (!g_hostname) { 1069 | fprintf(stderr, "%s: option -h is required.\n", argv[0]); 1070 | print_usage(argv[0]); 1071 | return EXIT_FAILURE; 1072 | } 1073 | 1074 | if (!g_iface) { 1075 | fprintf(stderr, "%s: option -i is required.\n", argv[0]); 1076 | print_usage(argv[0]); 1077 | return EXIT_FAILURE; 1078 | } 1079 | 1080 | if (g_daemon) { 1081 | res = daemon(0, 0); 1082 | if (res < 0) { 1083 | fprintf(stderr, "%s: failed to daemonize: %s\n", argv[0], 1084 | strerror(errno)); 1085 | return EXIT_FAILURE; 1086 | } 1087 | 1088 | if (!g_logfp) { 1089 | g_silent = 1; 1090 | } 1091 | } 1092 | 1093 | E("FakeHTTP version " VERSION); 1094 | 1095 | srand(time(NULL)); 1096 | 1097 | buff = malloc(buffsize); 1098 | if (!buff) { 1099 | E("ERROR: malloc(): %s", strerror(errno)); 1100 | return EXIT_FAILURE; 1101 | } 1102 | 1103 | /* 1104 | Raw Socket 1105 | */ 1106 | g_sockfd = socket(AF_INET, SOCK_RAW, IPPROTO_RAW); 1107 | if (g_sockfd < 0) { 1108 | switch (errno) { 1109 | case EPERM: 1110 | err_hint = " (Are you root?)"; 1111 | break; 1112 | default: 1113 | err_hint = ""; 1114 | } 1115 | E("ERROR: socket(): %s%s", strerror(errno), err_hint); 1116 | goto free_buff; 1117 | } 1118 | 1119 | res = setsockopt(g_sockfd, SOL_SOCKET, SO_BINDTODEVICE, g_iface, 1120 | strlen(g_iface)); 1121 | if (res < 0) { 1122 | E("ERROR: setsockopt(): SO_BINDTODEVICE: %s", strerror(errno)); 1123 | goto close_socket; 1124 | } 1125 | 1126 | opt = 1; 1127 | res = setsockopt(g_sockfd, IPPROTO_IP, IP_HDRINCL, &opt, sizeof(opt)); 1128 | if (res < 0) { 1129 | E("ERROR: setsockopt(): IP_HDRINCL: %s", strerror(errno)); 1130 | goto close_socket; 1131 | } 1132 | 1133 | res = setsockopt(g_sockfd, SOL_SOCKET, SO_MARK, &g_fwmark, 1134 | sizeof(g_fwmark)); 1135 | if (res < 0) { 1136 | E("ERROR: setsockopt(): SO_MARK: %s", strerror(errno)); 1137 | goto close_socket; 1138 | } 1139 | 1140 | opt = 7; 1141 | res = setsockopt(g_sockfd, SOL_SOCKET, SO_PRIORITY, &opt, sizeof(opt)); 1142 | if (res < 0) { 1143 | E("ERROR: setsockopt(): SO_PRIORITY: %s", strerror(errno)); 1144 | goto close_socket; 1145 | } 1146 | 1147 | /* 1148 | Netfilter Queue 1149 | */ 1150 | h = nfq_open(); 1151 | if (!h) { 1152 | switch (errno) { 1153 | case EPERM: 1154 | err_hint = " (Are you root?)"; 1155 | break; 1156 | case EINVAL: 1157 | err_hint = " (Missing kernel module?)"; 1158 | break; 1159 | default: 1160 | err_hint = ""; 1161 | } 1162 | E("ERROR: nfq_open(): %s%s", strerror(errno), err_hint); 1163 | goto close_socket; 1164 | } 1165 | 1166 | qh = nfq_create_queue(h, g_nfqnum, &callback, NULL); 1167 | if (!qh) { 1168 | switch (errno) { 1169 | case EPERM: 1170 | res = kill_running(0); 1171 | errno = EPERM; 1172 | if (res) { 1173 | err_hint = " (Another process is running / Are you root?)"; 1174 | } else { 1175 | err_hint = " (Another process is running)"; 1176 | } 1177 | break; 1178 | case EINVAL: 1179 | err_hint = " (Missing kernel module?)"; 1180 | break; 1181 | default: 1182 | err_hint = ""; 1183 | } 1184 | E("ERROR: nfq_create_queue(): %s%s", strerror(errno), err_hint); 1185 | goto close_nfq; 1186 | } 1187 | 1188 | res = nfq_set_mode(qh, NFQNL_COPY_PACKET, 0xffff); 1189 | if (res < 0) { 1190 | E("ERROR: nfq_set_mode(): NFQNL_COPY_PACKET: %s", strerror(errno)); 1191 | goto destroy_queue; 1192 | } 1193 | 1194 | res = nfq_set_queue_flags(qh, NFQA_CFG_F_FAIL_OPEN, NFQA_CFG_F_FAIL_OPEN); 1195 | if (res < 0) { 1196 | E("ERROR: nfq_set_queue_flags(): NFQA_CFG_F_FAIL_OPEN: %s", 1197 | strerror(errno)); 1198 | goto destroy_queue; 1199 | } 1200 | 1201 | fd = nfq_fd(h); 1202 | 1203 | opt_len = sizeof(opt); 1204 | res = getsockopt(fd, SOL_SOCKET, SO_RCVBUF, &opt, &opt_len); 1205 | if (res < 0) { 1206 | E("ERROR: getsockopt(): SO_RCVBUF: %s", strerror(errno)); 1207 | goto destroy_queue; 1208 | } 1209 | 1210 | if (opt < 1048576 /* 1 MB */) { 1211 | opt = 1048576; 1212 | res = setsockopt(fd, SOL_SOCKET, SO_RCVBUFFORCE, &opt, sizeof(opt)); 1213 | if (res < 0) { 1214 | E("ERROR: setsockopt(): SO_RCVBUFFORCE: %s", strerror(errno)); 1215 | goto destroy_queue; 1216 | } 1217 | } 1218 | 1219 | /* 1220 | Firewall 1221 | */ 1222 | if (!g_use_iptables) { 1223 | if (!nft_is_working()) { 1224 | E("WARNING: Falling back to iptables command, as nft command is " 1225 | "not working."); 1226 | g_use_iptables = 1; 1227 | } 1228 | } 1229 | 1230 | if (g_use_iptables) { 1231 | res = ipt_rules_flush(1); 1232 | if (res) { 1233 | E("ERROR: ipt_rules_flush()"); 1234 | goto destroy_queue; 1235 | } 1236 | 1237 | res = ipt_rules_setup(); 1238 | if (res) { 1239 | E("ERROR: ipt_rules_setup()"); 1240 | goto flush_rules; 1241 | } 1242 | } else { 1243 | res = nft_rules_flush(1); 1244 | if (res) { 1245 | E("ERROR: nft_rules_flush()"); 1246 | goto destroy_queue; 1247 | } 1248 | 1249 | res = nft_rules_setup(); 1250 | if (res) { 1251 | E("ERROR: nft_rules_setup()"); 1252 | goto flush_rules; 1253 | } 1254 | } 1255 | 1256 | /* 1257 | Process priority 1258 | */ 1259 | res = setpriority(PRIO_PROCESS, getpid(), -20); 1260 | if (res) { 1261 | E("ERROR: setpriority(): %s", strerror(errno)); 1262 | /* ignored */ 1263 | } 1264 | 1265 | /* 1266 | Signals 1267 | */ 1268 | res = signal_setup(); 1269 | if (res) { 1270 | E("ERROR: signal_setup()"); 1271 | goto flush_rules; 1272 | } 1273 | 1274 | E("listening on %s, netfilter queue number %" PRIu32 "...", g_iface, 1275 | g_nfqnum); 1276 | 1277 | /* 1278 | Main Loop 1279 | */ 1280 | err_cnt = 0; 1281 | while (!g_exit) { 1282 | if (err_cnt >= 20) { 1283 | E("too many errors, exiting..."); 1284 | goto flush_rules; 1285 | } 1286 | 1287 | recv_len = recv(fd, buff, buffsize, 0); 1288 | if (recv_len < 0) { 1289 | switch (errno) { 1290 | case EINTR: 1291 | continue; 1292 | case EAGAIN: 1293 | case ETIMEDOUT: 1294 | case ENOBUFS: 1295 | E("ERROR: recv(): %s", strerror(errno)); 1296 | err_cnt++; 1297 | continue; 1298 | default: 1299 | E("ERROR: recv(): %s", strerror(errno)); 1300 | err_cnt++; 1301 | goto flush_rules; 1302 | } 1303 | } 1304 | 1305 | res = nfq_handle_packet(h, buff, recv_len); 1306 | if (res < 0) { 1307 | E("ERROR: nfq_handle_packet()"); 1308 | err_cnt++; 1309 | continue; 1310 | } 1311 | 1312 | err_cnt = 0; 1313 | } 1314 | 1315 | E("exiting normally..."); 1316 | exitcode = EXIT_SUCCESS; 1317 | 1318 | flush_rules: 1319 | if (g_use_iptables) { 1320 | ipt_rules_flush(0); 1321 | } else { 1322 | nft_rules_flush(0); 1323 | } 1324 | 1325 | destroy_queue: 1326 | nfq_destroy_queue(qh); 1327 | 1328 | close_nfq: 1329 | nfq_close(h); 1330 | 1331 | close_socket: 1332 | close(g_sockfd); 1333 | 1334 | free_buff: 1335 | free(buff); 1336 | 1337 | if (g_logfp) { 1338 | fclose(g_logfp); 1339 | } 1340 | 1341 | return exitcode; 1342 | } 1343 | --------------------------------------------------------------------------------