├── .gitignore ├── LICENSE ├── README.md └── crawler ├── Makefile └── src ├── main.c ├── util.c └── util.h /.gitignore: -------------------------------------------------------------------------------- 1 | .DS_Store 2 | *~ 3 | *.swp 4 | *.o 5 | *.lo 6 | *.a 7 | *.d 8 | *.exe 9 | *.out 10 | *.app 11 | *.swp 12 | *.orig 13 | crawler/crawler 14 | crawler_logs 15 | *.cwl 16 | *.json 17 | -------------------------------------------------------------------------------- /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 | 676 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # toxcrawler 2 | toxcrawler is a [Tox](https://tox.chat) DHT network crawler. 3 | 4 | ## Crawler 5 | The crawler crawls the DHT network with multiple concurrent instances, allowing for a steady stream of up-to-date data on the number of active DHT notes on the network at any given time. When a crawler instance completes its mission, a log file containing all space separated IP addresses that it found is created in the `crawler_logs/{currentdate}/` directory, with the name `{timestamp}.cwl`. 6 | 7 | ### Compiling 8 | Compile and install [toxcore](https://github.com/toktok/c-toxcore). 9 | Clone this repo to the same base directory as toxcore, then run the command `make` in the `crawler` directory. 10 | -------------------------------------------------------------------------------- /crawler/Makefile: -------------------------------------------------------------------------------- 1 | LIBS = toxcore 2 | CFLAGS = -std=c17 -Wpedantic -Wunused -Wunused-macros -Wvla -Wmissing-declarations -Wall -Werror -ggdb -fstack-protector-all -pthread 3 | OBJ = main.o util.o 4 | LDFLAGS = $(shell pkg-config --libs $(LIBS)) 5 | SRC_DIR = ./src 6 | 7 | all: $(OBJ) 8 | @echo " LD $@" 9 | @$(CC) $(CFLAGS) -o crawler $(OBJ) $(LDFLAGS) 10 | 11 | %.o: $(SRC_DIR)/%.c 12 | @echo " CC $@" 13 | @$(CC) $(CFLAGS) -o $*.o -c $(SRC_DIR)/$*.c 14 | @$(CC) -MM $(CFLAGS) $(SRC_DIR)/$*.c > $*.d 15 | 16 | clean: 17 | rm -f *.d *.o crawler 18 | 19 | .PHONY: clean all 20 | -------------------------------------------------------------------------------- /crawler/src/main.c: -------------------------------------------------------------------------------- 1 | /* main.c 2 | * 3 | * 4 | * Copyright (C) 2016-2024 toxcrawler All Rights Reserved. 5 | * 6 | * This file is part of toxcrawler. 7 | * 8 | * toxcrawler is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * toxcrawler is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with toxcrawler. If not, see . 20 | * 21 | */ 22 | 23 | #include "util.h" 24 | 25 | #include 26 | #include 27 | #include 28 | #include 29 | #include 30 | #include 31 | #include 32 | #include 33 | #include 34 | #include 35 | #include 36 | 37 | #include 38 | #include 39 | 40 | /* Seconds to wait between new crawler instances */ 41 | #define NEW_CRAWLER_INTERVAL (60u * 2) 42 | 43 | /* Maximum number of concurrent crawler instances */ 44 | #define MAX_CRAWLERS 5u 45 | 46 | /* Seconds since last seen new node before we time a crawler out */ 47 | #define CRAWLER_TIMEOUT 20u 48 | 49 | /* The maximum time a crawler can run before timing out */ 50 | #define CRAWLER_MAX_RUNTIME (60 * 20) 51 | 52 | /* Default maximum number of nodes the nodes list can store */ 53 | #define DEFAULT_NODES_LIST_SIZE 4096u 54 | 55 | /* Max number of nodes to send getnodes requests to per iteration */ 56 | #define MAX_GETNODES_REQUESTS 6u 57 | 58 | /* Number of random node requests to make for each node we send a request to */ 59 | #define NUM_RAND_GETNODE_REQUESTS 8u 60 | 61 | typedef struct DHT_Node { 62 | uint8_t public_key[TOX_DHT_NODE_PUBLIC_KEY_SIZE]; 63 | char ip[TOX_DHT_NODE_IP_STRING_SIZE]; 64 | uint16_t port; 65 | bool seen; // true if we have sent a getnodes request to this node 66 | } DHT_Node; 67 | 68 | typedef struct Crawler { 69 | Tox *tox; 70 | DHT_Node **nodes_list; 71 | uint32_t num_nodes; 72 | uint32_t nodes_list_size; 73 | uint32_t send_ptr; /* index of the oldest node that we haven't sent a getnodes request to */ 74 | time_t last_seen_new_node; 75 | time_t start_time; 76 | pthread_t tid; 77 | pthread_attr_t attr; 78 | } Crawler; 79 | 80 | 81 | /* Use these to lock and unlock the global threads struct */ 82 | #define LOCK pthread_mutex_lock(&threads.lock) 83 | #define UNLOCK pthread_mutex_unlock(&threads.lock) 84 | 85 | struct Threads { 86 | uint16_t num_active; 87 | time_t last_created; 88 | pthread_mutex_t lock; 89 | } threads; 90 | 91 | static const struct toxNodes { 92 | const char *ip; 93 | uint16_t port; 94 | const char *key; 95 | } bs_nodes[] = { 96 | { "144.217.86.39", 33445, "7E5668E0EE09E19F320AD47902419331FFEE147BB3606769CFBE921A2A2FD34C" }, 97 | { "tox.abilinski.com", 33445, "10C00EB250C3233E343E2AEBA07115A5C28920E9C8D29492F6D00B29049EDC7E" }, 98 | { "81.169.136.229", 33445, "836D1DA2BE12FE0E669334E437BE3FB02806F1528C2B2782113E0910C7711409" }, 99 | { "172.104.215.182", 33445, "DA2BD927E01CD05EBCC2574EBE5BEBB10FF59AE0B2105A7D1E2B40E49BB20239" }, 100 | { "188.225.9.167", 33445, "1911341A83E02503AB1FD6561BD64AF3A9D6C3F12B5FBB656976B2E678644A67" }, 101 | { "tox.initramfs.io", 33445, "3F0A45A268367C1BEA652F258C85F4A66DA76BCAA667A49E770BCC4917AB6A25" }, 102 | { "139.162.110.188", 33445, "F76A11284547163889DDC89A7738CF271797BF5E5E220643E97AD3C7E7903D55" }, 103 | { "172.105.109.31", 33445, "D46E97CF995DC1820B92B7D899E152A217D36ABE22730FEA4B6BF1BFC06C617C" }, 104 | { "91.146.66.26", 33445, "B5E7DAC610DBDE55F359C7F8690B294C8E4FCEC4385DE9525DBFA5523EAD9D53" }, 105 | { "5.19.249.240", 33445, "DA98A4C0CD7473A133E115FEA2EBDAEEA2EF4F79FD69325FC070DA4DE4BA3238" }, 106 | { "188.225.9.167", 33445, "1911341A83E02503AB1FD6561BD64AF3A9D6C3F12B5FBB656976B2E678644A67" }, 107 | { "104.225.141.59", 43334, "933BA20B2E258B4C0D475B6DECE90C7E827FE83EFA9655414E7841251B19A72C" }, 108 | { NULL, 0, NULL }, 109 | }; 110 | 111 | /* Attempts to bootstrap to every listed bootstrap node */ 112 | static void bootstrap_tox(Crawler *cwl) 113 | { 114 | for (size_t i = 0; bs_nodes[i].ip != NULL; ++i) { 115 | char bin_key[TOX_PUBLIC_KEY_SIZE]; 116 | if (hex_string_to_bin(bs_nodes[i].key, strlen(bs_nodes[i].key), bin_key, sizeof(bin_key)) == -1) { 117 | fprintf(stderr, "failed to parse bootstrap node: %s\n", bs_nodes[i].key); 118 | continue; 119 | } 120 | 121 | Tox_Err_Bootstrap err; 122 | tox_bootstrap(cwl->tox, bs_nodes[i].ip, bs_nodes[i].port, (uint8_t *) bin_key, &err); 123 | 124 | if (err != TOX_ERR_BOOTSTRAP_OK) { 125 | fprintf(stderr, "Failed to bootstrap DHT via: %s %d (error %d)\n", bs_nodes[i].ip, bs_nodes[i].port, err); 126 | } 127 | } 128 | } 129 | 130 | static volatile bool FLAG_EXIT = false; 131 | static void catch_SIGINT(int sig) 132 | { 133 | LOCK; 134 | FLAG_EXIT = true; 135 | UNLOCK; 136 | } 137 | 138 | /* 139 | * Return true if public_key is in the crawler's nodes list. 140 | * TODO: A hashtable would be nice but the str8C holds up for now. 141 | */ 142 | static bool node_crawled(Crawler *cwl, const uint8_t *public_key) 143 | { 144 | for (uint32_t i = 0; i < cwl->num_nodes; ++i) { 145 | if (memcmp(cwl->nodes_list[i]->public_key, public_key, TOX_DHT_NODE_PUBLIC_KEY_SIZE) == 0) { 146 | return true; 147 | } 148 | } 149 | 150 | return false; 151 | } 152 | 153 | void cb_getnodes_response(Tox *tox, const uint8_t *public_key, const char *ip, uint32_t ip_length, 154 | uint16_t port, void *user_data) 155 | { 156 | Crawler *cwl = (Crawler *)user_data; 157 | 158 | if (cwl == NULL) { 159 | return; 160 | } 161 | 162 | if (public_key == NULL || ip == NULL || ip_length == 0) { 163 | return; 164 | } 165 | 166 | if (node_crawled(cwl, public_key)) { 167 | return; 168 | } 169 | 170 | if (cwl->num_nodes + 1 >= cwl->nodes_list_size) { 171 | DHT_Node **tmp = realloc(cwl->nodes_list, cwl->nodes_list_size * 2 * sizeof(DHT_Node *)); 172 | 173 | if (tmp == NULL) { 174 | return; 175 | } 176 | 177 | cwl->nodes_list = tmp; 178 | cwl->nodes_list_size *= 2; 179 | } 180 | 181 | DHT_Node *new_node = (DHT_Node *) calloc(1, sizeof(DHT_Node)); 182 | 183 | if (new_node == NULL) { 184 | return; 185 | } 186 | 187 | memcpy(new_node->public_key, public_key, TOX_DHT_NODE_PUBLIC_KEY_SIZE); 188 | snprintf(new_node->ip, sizeof(new_node->ip), "%s", ip); 189 | new_node->port = port; 190 | 191 | cwl->last_seen_new_node = get_time(); 192 | 193 | cwl->nodes_list[cwl->num_nodes] = new_node; 194 | ++cwl->num_nodes; 195 | } 196 | 197 | /* 198 | * Sends getnodes requests to nodes in the nodes list. 199 | * 200 | * Returns the number of requests sent. 201 | */ 202 | static uint32_t send_node_requests(Crawler *cwl) 203 | { 204 | uint32_t count = 0; 205 | uint32_t i; 206 | 207 | for (i = cwl->send_ptr; count < MAX_GETNODES_REQUESTS && i < cwl->num_nodes; ++i) { 208 | DHT_Node *node = cwl->nodes_list[i]; 209 | 210 | for (int32_t j = 0; j < NUM_RAND_GETNODE_REQUESTS; ++j) { 211 | const uint32_t r = ((uint32_t) rand()) % cwl->num_nodes; 212 | const DHT_Node *rand_node = cwl->nodes_list[r]; 213 | 214 | tox_dht_send_nodes_request(cwl->tox, node->public_key, node->ip, node->port, rand_node->public_key, NULL); 215 | tox_dht_send_nodes_request(cwl->tox, rand_node->public_key, rand_node->ip, rand_node->port, 216 | node->public_key, NULL); 217 | } 218 | 219 | node->seen = true; 220 | ++count; 221 | } 222 | 223 | cwl->send_ptr = i == cwl->num_nodes ? 0 : i; 224 | 225 | return count; 226 | } 227 | 228 | /* 229 | * Returns a pointer to a new crawler instance. 230 | * Returns NULL on failure. 231 | */ 232 | Crawler *crawler_new(void) 233 | { 234 | Crawler *cwl = (Crawler *) calloc(1, sizeof(Crawler)); 235 | 236 | if (cwl == NULL) { 237 | return cwl; 238 | } 239 | 240 | DHT_Node **nodes_list = (DHT_Node **) calloc(DEFAULT_NODES_LIST_SIZE, sizeof(DHT_Node *)); 241 | 242 | if (nodes_list == NULL) { 243 | free(cwl); 244 | return NULL; 245 | } 246 | 247 | Tox_Err_Options_New options_new_err; 248 | struct Tox_Options *options = tox_options_new(&options_new_err); 249 | 250 | if (options == NULL) { 251 | fprintf(stderr, "tox_options_new() failed with error: %d\n", options_new_err); 252 | free(cwl); 253 | free(nodes_list); 254 | return NULL; 255 | } 256 | 257 | tox_options_default(options); 258 | 259 | Tox_Err_New err; 260 | Tox *tox = tox_new(options, &err); 261 | 262 | tox_options_free(options); 263 | 264 | if (err != TOX_ERR_NEW_OK || tox == NULL) { 265 | fprintf(stderr, "tox_new() failed: %d\n", err); 266 | free(cwl); 267 | free(nodes_list); 268 | return NULL; 269 | } 270 | 271 | cwl->tox = tox; 272 | cwl->nodes_list = nodes_list; 273 | cwl->nodes_list_size = DEFAULT_NODES_LIST_SIZE; 274 | 275 | tox_callback_dht_nodes_response(tox, cb_getnodes_response); 276 | 277 | cwl->start_time = get_time(); 278 | cwl->last_seen_new_node = get_time(); 279 | 280 | bootstrap_tox(cwl); 281 | 282 | return cwl; 283 | } 284 | 285 | #define TEMP_FILE_EXT ".tmp" 286 | 287 | /* Dumps crawler nodes list to log file. */ 288 | static int crawler_dump_log(Crawler *cwl) 289 | { 290 | char log_path[PATH_MAX]; 291 | 292 | if (get_log_path(log_path, sizeof(log_path)) == -1) { 293 | return -1; 294 | } 295 | 296 | const uint32_t temp_len = strlen(log_path) + strlen(TEMP_FILE_EXT) + 1; 297 | char *log_path_temp = malloc(temp_len); 298 | 299 | if (log_path_temp == NULL) { 300 | return -2; 301 | } 302 | 303 | snprintf(log_path_temp, temp_len, "%s%s", log_path, TEMP_FILE_EXT); 304 | 305 | FILE *fp = fopen(log_path_temp, "w"); 306 | 307 | if (fp == NULL) { 308 | free(log_path_temp); 309 | return -3; 310 | } 311 | 312 | for (uint32_t i = 0; i < cwl->num_nodes; ++i) { 313 | fprintf(fp, "%s ", cwl->nodes_list[i]->ip); 314 | } 315 | 316 | fclose(fp); 317 | 318 | if (rename(log_path_temp, log_path) != 0) { 319 | free(log_path_temp); 320 | return -4; 321 | } 322 | 323 | free(log_path_temp); 324 | 325 | return 0; 326 | } 327 | 328 | static void crawler_kill(Crawler *cwl) 329 | { 330 | pthread_attr_destroy(&cwl->attr); 331 | tox_kill(cwl->tox); 332 | 333 | for (size_t i = 0; i < cwl->num_nodes; ++i) { 334 | free(cwl->nodes_list[i]); 335 | } 336 | 337 | free(cwl->nodes_list); 338 | free(cwl); 339 | } 340 | 341 | /* 342 | * Returns true if all nodes in the crawler's nodes list have been seen. 343 | */ 344 | static bool crawler_all_nodes_seen(const Crawler *cwl) 345 | { 346 | uint32_t count = 0; 347 | 348 | for (uint32_t i = 0; i < cwl->num_nodes; ++i) { 349 | const DHT_Node *node = cwl->nodes_list[i]; 350 | 351 | if (node->seen) { 352 | ++count; 353 | } 354 | } 355 | 356 | return count == cwl->num_nodes; 357 | } 358 | 359 | /* Returns true if the crawler is unable to find new nodes in the DHT or the exit flag has been triggered */ 360 | static bool crawler_finished(Crawler *cwl) 361 | { 362 | LOCK; 363 | if (FLAG_EXIT 364 | || (timed_out(cwl->last_seen_new_node, CRAWLER_TIMEOUT) && crawler_all_nodes_seen(cwl)) 365 | || timed_out(cwl->start_time, CRAWLER_MAX_RUNTIME)) { 366 | UNLOCK; 367 | return true; 368 | } 369 | UNLOCK; 370 | 371 | return false; 372 | } 373 | 374 | void *do_crawler_thread(void *data) 375 | { 376 | Crawler *cwl = (Crawler *) data; 377 | 378 | while (!crawler_finished(cwl)) { 379 | tox_iterate(cwl->tox, cwl); 380 | send_node_requests(cwl); 381 | sleep_thread(tox_iteration_interval(cwl->tox) * 1000); 382 | } 383 | 384 | // uncomment to show ratio of nodes that are compatible with NGC 385 | /* const uint16_t num_close = tox_dht_get_num_closelist(cwl->tox); */ 386 | /* const uint16_t num_new = tox_dht_get_num_closelist_announce_capable(cwl->tox); */ 387 | /* const float r = num_new > 0 ? (float)num_new / (float)num_close : 0; */ 388 | 389 | char time_format[128]; 390 | get_time_format(time_format, sizeof(time_format)); 391 | 392 | /* printf("[%s] Nodes: %llu (Support NGC ratio: %.2f)\n", time_format, (unsigned long long) cwl->num_nodes, r); */ 393 | printf("[%s] Nodes: %llu\n", time_format, (unsigned long long) cwl->num_nodes); 394 | 395 | LOCK; 396 | const bool interrupted = FLAG_EXIT; 397 | UNLOCK; 398 | 399 | if (!interrupted) { 400 | const int ret = crawler_dump_log(cwl); 401 | 402 | if (ret < 0) { 403 | fprintf(stderr, "crawler_dump_log() failed with error %d\n", ret); 404 | } 405 | } 406 | 407 | crawler_kill(cwl); 408 | 409 | LOCK; 410 | --threads.num_active; 411 | UNLOCK; 412 | 413 | pthread_exit(0); 414 | } 415 | 416 | /* Initializes a crawler thread. 417 | * 418 | * Returns 0 on success. 419 | * Returns -1 if thread attributes cannot be set. 420 | * Returns -2 if thread state cannot be set. 421 | * Returns -3 if thread cannot be created. 422 | */ 423 | static int init_crawler_thread(Crawler *cwl) 424 | { 425 | if (pthread_attr_init(&cwl->attr) != 0) { 426 | return -1; 427 | } 428 | 429 | if (pthread_attr_setdetachstate(&cwl->attr, PTHREAD_CREATE_DETACHED) != 0) { 430 | pthread_attr_destroy(&cwl->attr); 431 | return -2; 432 | } 433 | 434 | if (pthread_create(&cwl->tid, NULL, do_crawler_thread, (void *) cwl) != 0) { 435 | pthread_attr_destroy(&cwl->attr); 436 | return -3; 437 | } 438 | 439 | return 0; 440 | } 441 | 442 | /* 443 | * Creates new crawler instances. 444 | * 445 | * Returns 0 on success or if new instance is not needed. 446 | * Returns -1 if crawler instance fails to initialize. 447 | * Returns -2 if thread fails to initialize. 448 | */ 449 | static int do_thread_control(void) 450 | { 451 | LOCK; 452 | const uint16_t num_active_threads = threads.num_active; 453 | const time_t last_created_thread = threads.last_created; 454 | UNLOCK; 455 | 456 | if (num_active_threads >= MAX_CRAWLERS || !timed_out(last_created_thread, NEW_CRAWLER_INTERVAL)) { 457 | return 0; 458 | } 459 | 460 | Crawler *cwl = crawler_new(); 461 | 462 | if (cwl == NULL) { 463 | return -1; 464 | } 465 | 466 | const int ret = init_crawler_thread(cwl); 467 | 468 | if (ret != 0) { 469 | fprintf(stderr, "init_crawler_thread() failed with error: %d\n", ret); 470 | return -2; 471 | } 472 | 473 | LOCK; 474 | ++threads.num_active; 475 | threads.last_created = get_time(); 476 | UNLOCK; 477 | 478 | return 0; 479 | } 480 | 481 | int main(int argc, char **argv) 482 | { 483 | if (pthread_mutex_init(&threads.lock, NULL) != 0) { 484 | fprintf(stderr, "pthread mutex failed to init in main()\n"); 485 | exit(EXIT_FAILURE); 486 | } 487 | 488 | signal(SIGINT, catch_SIGINT); 489 | 490 | while (true) { 491 | LOCK; 492 | const bool flag_exit = FLAG_EXIT; 493 | UNLOCK; 494 | 495 | if (flag_exit) { 496 | break; 497 | } 498 | 499 | const int ret = do_thread_control(); 500 | 501 | if (ret < 0) { 502 | fprintf(stderr, "do_thread_control() failed with error %d\n", ret); 503 | sleep(5); 504 | } else { 505 | sleep_thread(10000); 506 | } 507 | } 508 | 509 | /* Wait for threads to exit cleanly */ 510 | while (true) { 511 | LOCK; 512 | const uint16_t num_active_threads = threads.num_active; 513 | UNLOCK; 514 | 515 | if (num_active_threads == 0) { 516 | break; 517 | } 518 | 519 | sleep_thread(10000); 520 | } 521 | 522 | return 0; 523 | } 524 | -------------------------------------------------------------------------------- /crawler/src/util.c: -------------------------------------------------------------------------------- 1 | /* util.c 2 | * 3 | * 4 | * Copyright (C) 2016-2024 toxcrawler All Rights Reserved. 5 | * 6 | * This file is part of toxcrawler. 7 | * 8 | * toxcrawler is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * toxcrawler is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with toxcrawler. If not, see . 20 | * 21 | */ 22 | 23 | #include "util.h" 24 | 25 | #include 26 | #include 27 | #include 28 | #include 29 | #include 30 | #include 31 | #include 32 | 33 | void sleep_thread(long int usec) 34 | { 35 | struct timespec req; 36 | struct timespec rem; 37 | 38 | req.tv_sec = 0; 39 | req.tv_nsec = usec * 1000L; 40 | 41 | if (nanosleep(&req, &rem) == -1) { 42 | if (nanosleep(&rem, NULL) == -1) { 43 | fprintf(stderr, "nanosleep() returned -1\n"); 44 | } 45 | } 46 | } 47 | 48 | int32_t min(int32_t x, int32_t y) 49 | { 50 | return x < y ? x : y; 51 | } 52 | 53 | time_t get_time(void) 54 | { 55 | return time(NULL); 56 | } 57 | 58 | bool timed_out(time_t timestamp, time_t timeout) 59 | { 60 | return timestamp + timeout <= get_time(); 61 | } 62 | 63 | void get_time_format(char *buf, int bufsize) 64 | { 65 | struct tm *timeinfo; 66 | const time_t t = get_time(); 67 | timeinfo = localtime((const time_t*) &t); 68 | strftime(buf, bufsize, "%H:%M:%S", timeinfo); 69 | } 70 | 71 | int hex_string_to_bin(const char *hex_string, size_t hex_len, char *output, size_t output_size) 72 | { 73 | if (output_size == 0 || hex_len != output_size * 2) { 74 | return -1; 75 | } 76 | 77 | for (size_t i = 0; i < output_size; ++i) { 78 | sscanf(hex_string, "%2hhx", (unsigned char *) &output[i]); 79 | hex_string += 2; 80 | } 81 | 82 | return 0; 83 | } 84 | 85 | #define BASE_LOG_PATH "../crawler_logs" 86 | int get_log_path(char *buf, size_t buf_len) 87 | { 88 | const time_t tm = get_time(); 89 | 90 | char tmstr[32]; 91 | strftime(tmstr, sizeof(tmstr), "%Y-%m-%d", localtime(&tm)); 92 | 93 | const uint32_t path_len = strlen(BASE_LOG_PATH) + strlen(tmstr) + 3; 94 | char *path = malloc(path_len); 95 | 96 | if (path == NULL) { 97 | return -1; 98 | } 99 | 100 | snprintf(path, path_len, "%s/%s/", BASE_LOG_PATH, tmstr); 101 | 102 | struct stat st; 103 | 104 | if (stat(BASE_LOG_PATH, &st) == -1) { 105 | if (mkdir(BASE_LOG_PATH, 0700) == -1) { 106 | free(path); 107 | return -1; 108 | } 109 | } 110 | 111 | if (stat(path, &st) == -1) { 112 | if (mkdir(path, 0700) == -1) { 113 | free(path); 114 | return -1; 115 | } 116 | } 117 | 118 | snprintf(buf, buf_len, "%s/%llu.cwl", path, (long long unsigned) tm); 119 | 120 | free(path); 121 | 122 | return 0; 123 | } 124 | 125 | -------------------------------------------------------------------------------- /crawler/src/util.h: -------------------------------------------------------------------------------- 1 | /* util.h 2 | * 3 | * 4 | * Copyright (C) 2016-2024 toxcrawler All Rights Reserved. 5 | * 6 | * This file is part of toxcrawler. 7 | * 8 | * toxcrawler is free software: you can redistribute it and/or modify 9 | * it under the terms of the GNU General Public License as published by 10 | * the Free Software Foundation, either version 3 of the License, or 11 | * (at your option) any later version. 12 | * 13 | * toxcrawler is distributed in the hope that it will be useful, 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 | * GNU General Public License for more details. 17 | * 18 | * You should have received a copy of the GNU General Public License 19 | * along with toxcrawler. If not, see . 20 | * 21 | */ 22 | 23 | #ifndef UTIL_H 24 | #define UTIL_H 25 | 26 | #include 27 | #include 28 | #include 29 | 30 | /* Sleeps the calling thread for `usec` nanoseconds. */ 31 | void sleep_thread(long int usec); 32 | 33 | /* Returns the smaller value between x and y. */ 34 | int32_t min(int32_t x, int32_t y); 35 | 36 | /* Returns the current unix time. */ 37 | time_t get_time(void); 38 | 39 | /* Returns true if timestamp has timed out according to timeout value. */ 40 | bool timed_out(time_t timestamp, time_t timeout); 41 | 42 | /* Puts the current time in buf in the format of [HH:mm:ss] */ 43 | void get_time_format(char *buf, int bufsize); 44 | 45 | /* 46 | * Converts a hexidecimal string of length hex_len to binary format and puts the result in output. 47 | * output_size must be exactly half of hex_len. 48 | * 49 | * Returns 0 on success. 50 | * Returns -1 on failure. 51 | */ 52 | int hex_string_to_bin(const char *hex_string, size_t hex_len, char *output, size_t output_size); 53 | 54 | /* Puts log file path into buf in the form: BASE_LOG_PATH/YY-mm-dd/unixtime 55 | * The date is the current day, and the unixtime is the current unixtime. 56 | * 57 | * If the current day's directory does not exist it is automatically created. 58 | * 59 | * Returns 0 on success. 60 | * Returns -1 on failure. 61 | */ 62 | int get_log_path(char *buf, size_t buf_len); 63 | 64 | #endif /* UTIL_H */ 65 | --------------------------------------------------------------------------------