├── Cargo.toml ├── LICENSE ├── README.md ├── generate_files.sh └── src └── main.rs /Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "ripwc" 3 | version = "1.0.0" 4 | edition = "2021" 5 | authors = ["LuminousToaster", "https://github.com/LuminousToaster"] 6 | 7 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 8 | 9 | [dependencies] 10 | clap = { version = "4.5.38", features = ["derive"] } 11 | 12 | rayon = "1.10.0" 13 | walkdir = "2.3.3" 14 | num_cpus = "1.16.0" 15 | 16 | [profile.release] 17 | lto = 'fat' 18 | codegen-units = 1 19 | opt-level = 3 20 | panic = 'abort' 21 | incremental = true 22 | -------------------------------------------------------------------------------- /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 | # ripwc 2 | 3 | `ripwc` is a high-performance rewrite of the GNU `wc` (word count) utility, implemented in Rust for speed and efficiency. It counts lines, words, characters, bytes, and maximum line lengths in files or directories, optimized for low-memory systems (e.g., 4GB RAM) while processing large datasets. Using unsafe Rust for pointer arithmetic, loop unrolling, and `rayon` for parallelism, `ripwc` achieves up to ~49x speedup (in my tests). 4 | 5 | To be clear, this was just something I wanted to try and was amazed by how much quicker it was when I did it myself. There's no expectation of this actually replacing wc or any other tools. 6 | 7 | ## Features 8 | - **Counts**: Lines (`-l`), words (`-w`), characters (`-m`), bytes (`-c`), and maximum line length (`-L`). 9 | - **Recursive Mode**: Processes directories recursively with `-r`. 10 | - **Concurrency**: Uses `rayon` with up to X threads where X is the number of CPU cores, processing files (>512KB) in parallel and batching small files (<512KB) sequentially to reduce thread overhead. 11 | - **Low Memory Usage**: ~1MB heap-allocated buffers minimize syscalls per thread (~8MB peak with 8 threads), suitable for low-RAM systems. 12 | - **Optimisations**: 13 | - Unsafe Rust for pointer arithmetic and 8-byte loop unrolling. 14 | - Static whitespace lookup table for efficient word counting. 15 | 16 | ## Notes 17 | - **wc Limitations**: 18 | - Single-threaded, leading to high user time. 19 | - Inefficient I/O for large datasets, resulting in ~40-50x slower performance. 20 | 21 | - **Test Conditions**: 22 | - Random binary files (from `/dev/urandom`) may yield different counts (e.g., words) than text files, but byte counts are consistent. 23 | - Disk sync (`--prepare 'sync'`) ensures fair I/O comparisons. 24 | 25 | 26 | ## Installation 27 | 1. **Clone the Repository**: 28 | ```bash 29 | git clone https://github.com/LuminousToaster/ripwc 30 | cd ripwc 31 | ``` 32 | 33 | 2. **Build the Project**: 34 | ```bash 35 | cargo build --release 36 | ``` 37 | The binary will be at `target/release/ripwc`. 38 | 39 | ## Usage 40 | Run `ripwc` with the following syntax: 41 | ```bash 42 | ./target/release/ripwc [OPTIONS] ... 43 | ``` 44 | 45 | ### Options 46 | - `-c, --bytes`: Print byte counts. 47 | - `-m, --chars`: Print character counts (non-zero bytes). 48 | - `-l, --lines`: Print newline counts. 49 | - `-w, --words`: Print word counts (non-whitespace sequences). 50 | - `-L, --max-line-length`: Print maximum line length. 51 | - `-r, --recursive`: Recursively process directories. 52 | - `-v`: Print verbose output (processing each file). 53 | - `-h`: Print help. 54 | - `-V`: Print version. 55 | - Default (no flags): Prints lines, words, and bytes. 56 | 57 | ### Examples 58 | - Count lines, words, and bytes for a single file: 59 | ```bash 60 | ./target/release/ripwc file.txt 61 | ``` 62 | Output: `lines: 100 words: 500 bytes: 2048 file.txt` 63 | 64 | - Process a directory recursively: 65 | ```bash 66 | ./target/release/ripwc -r /path/to/dir 67 | ``` 68 | Output: Per-file counts and totals, e.g., `lines: 60966229 words: 240316537 bytes: 15203482929 total` 69 | 70 | - Count only bytes and characters: 71 | ```bash 72 | ./target/release/ripwc -c -m file.txt 73 | ``` 74 | Output: `chars: 2000 bytes: 2048 file.txt` 75 | 76 | ## Generating Test Files 77 | The project includes a Bash script (`generate_files.sh`) to create random binary files for testing `ripwc`’s performance. The data is taken from ``/dev/urandom`` 78 | 79 | ### Script Usage 80 | ```bash 81 | ./generate_files.sh 82 | ``` 83 | - ``: Number of files to generate (positive integer). 84 | - ``: Size of each file in megabytes (positive integer). 85 | 86 | ### Example 87 | Generate 100 files, each 10MB: 88 | ```bash 89 | chmod +x generate_files.sh 90 | ./generate_files.sh 100 10 91 | ``` 92 | - Creates a `random_files/` directory with files `random_file_1.bin` to `random_file_100.bin`. 93 | - Total data: 1000MB (1GB). 94 | - Output: 95 | ``` 96 | Generating 100 files, each with 10 MB of random data... 97 | Completed! Generated 100 files of 10 MB each in the 'random_files' directory. 98 | Total data generated: 1000 MB 99 | ``` 100 | 101 | ### Testing with Generated Files 102 | Run `ripwc` on the generated files: 103 | ```bash 104 | ./target/release/ripwc -r random_files/ 105 | ``` 106 | Compare with GNU `wc`: 107 | ```bash 108 | wc -lwc random_files/* 109 | ``` 110 | 111 | ## Benchmarking 112 | To measure performance, use `hyperfine`: 113 | ```bash 114 | hyperfine --warmup 3 --min-runs 10 --prepare 'sync' "./target/release/ripwc -r /path/to/dir" "wc /path/to/dir/*" 115 | ``` 116 | Or `time`: 117 | ```bash 118 | time ./target/release/ripwc -r /path/to/dir 119 | time wc -lwc /path/to/dir/* 120 | ``` 121 | 122 | # ripwc benchmark results 123 | 124 | This document presents benchmark results comparing `ripwc` against GNU `wc`. Tests were conducted using `hyperfine` with 5 runs each, after warming up with 3 runs and syncing the disk (`--prepare 'sync'`). Three test cases were evaluated: 125 | 126 | 1. **40 files, 300MB each** (12GB total). 127 | 2. **1000 files, 3MB each** (3GB total). 128 | 3. **1 file, 3000MB** (3GB total). 129 | 130 | Files were generated using `generate_files.sh` (e.g., `./generate_files 40 300`). Benchmarks measured wall-clock time, user time, and system time for `ripwc -r random_files` and `wc random_files/*`. 131 | 132 | The benchmarks were run on a 4C/4T I5-7600k OC'd to 5GHz, 16GB RAM, Arch Linux with kernel 6.14.6-arch1-1. It should be noted that I ran the benchmarks after a fresh reboot and before any apps were opened by me with the exception 133 | of Konsole and a tmux server. 134 | 135 | Also note, the system used to benchmark is encrypted with LUKS2: 136 | ``` 137 | type: LUKS2 138 | cipher: aes-xts-plain 139 | keysize: 512 bits 140 | key location: keyring 141 | device: /dev/sdc2 142 | sector size: 512 143 | offset: 32768 sectors 144 | size: 478949376 sectors 145 | mode: read/write 146 | ``` 147 | 148 | ## Summary Table 149 | 150 | | Test Case | Total Data | ripwc Time (mean ± σ) | wc Time (mean ± σ) | Speedup (ripwc vs. wc) | 151 | |--------------------------|------------|-----------------------|--------------------|------------------------| 152 | | 40 files, 300MB each | 12GB | 5.576 s ± 0.663 s | 272.761 s ± 0.350 s | 48.92 ± 5.82x | 153 | | 1000 files, 3MB each | 3GB | 1.420 s ± 0.077 s | 68.610 s ± 1.168 s | 48.33 ± 2.76x | 154 | | 1 file, 3000MB | 3GB | 4.278 s ± 0.021 s | 68.001 s ± 0.075 s | 15.90 ± 0.08x | 155 | 156 | ## Detailed Results 157 | 158 | ### Test Case 1: 40 Files, 300MB Each (12GB Total) 159 | Command: `./generate_files 40 300` 160 | ```bash 161 | hyperfine --warmup 3 --min-runs 5 --prepare 'sync' "./target/release/ripwc -r random_files" "wc random_files/*" 162 | ``` 163 | 164 | - **ripwc**: 165 | - Time: 5.576 s ± 0.663 s 166 | - User: 15.990 s, System: 1.625 s 167 | - Range: 5.067 s … 6.677 s 168 | - **wc**: 169 | - Time: 272.761 s ± 0.350 s 170 | - User: 270.418 s, System: 1.140 s 171 | - Range: 272.406 s … 273.230 s 172 | - **Speedup**: 48.92 ± 5.82x 173 | 174 | ### Test Case 2: 1000 Files, 3MB Each (3GB Total) 175 | Command: `./generate_files 1000 3` 176 | ```bash 177 | hyperfine --warmup 3 --min-runs 5 --prepare 'sync' "./target/release/ripwc -r random_files" "wc random_files/*" 178 | ``` 179 | 180 | - **ripwc**: 181 | - Time: 1.420 s ± 0.077 s 182 | - User: 4.458 s, System: 0.559 s 183 | - Range: 1.362 s … 1.553 s 184 | - **wc**: 185 | - Time: 68.610 s ± 1.168 s 186 | - User: 68.206 s, System: 0.231 s 187 | - Range: 67.963 s … 70.692 s 188 | - **Speedup**: 48.33 ± 2.76x 189 | 190 | ### Test Case 3: 1 File, 3000MB (3GB Total) 191 | Command: `./generate_files 1 3000` 192 | ```bash 193 | hyperfine --warmup 3 --min-runs 5 --prepare 'sync' "./target/release/ripwc -r random_files" "wc random_files/*" 194 | ``` 195 | 196 | - **ripwc**: 197 | - Time: 4.278 s ± 0.021 s 198 | - User: 3.950 s, System: 0.314 s 199 | - Range: 4.256 s … 4.301 s 200 | - **wc**: 201 | - Time: 68.001 s ± 0.075 s 202 | - User: 67.618 s, System: 0.232 s 203 | - Range: 67.896 s … 68.091 s 204 | - **Speedup**: 15.90 ± 0.08x 205 | 206 | ## Performance Graphs 207 | 208 | ### Wall-Clock Time Comparison 209 | The following ASCII bar chart compares mean wall-clock times (in seconds) for `ripwc` and `wc` across the test cases. The scale is normalized to the maximum `wc` time (272.761 s). 210 | 211 | ``` 212 | Legend: █ = ripwc, ▓ = wc 213 | 40 files, 300MB (12GB): 214 | ripwc: █████ 5.576 s 215 | wc: ▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓ 272.761 s 216 | 217 | 1000 files, 3MB (3GB): 218 | ripwc: █ 1.420 s 219 | wc: ▓▓▓▓▓▓▓▓▓▓▓▓▓ 68.610 s 220 | 221 | 1 file, 3000MB (3GB): 222 | ripwc: ████ 4.278 s 223 | wc: ▓▓▓▓▓▓▓▓▓▓▓▓▓ 68.001 s 224 | ``` 225 | 226 | ### Speedup Comparison 227 | The following ASCII bar chart shows the speedup of `ripwc` over `wc` (times faster) for each test case. The scale is normalized to the maximum speedup (48.92x). 228 | 229 | ``` 230 | Legend: █ = Speedup 231 | 40 files, 300MB (12GB): ████████████████████████████████████████████████ 48.92x 232 | 1000 files, 3MB (3GB): ███████████████████████████████████████████████ 48.33x 233 | 1 file, 3000MB (3GB): ███████████████ 15.90x 234 | ``` 235 | 236 | ## Analysis 237 | - **40 Files, 300MB (12GB)**: 238 | - `ripwc` excels with large files processed in parallel, achieving ~49x speedup due to `rayon` parallelism (up to `num_cpus` threads) and 1MB buffers. 239 | - High user time (15.990 s) vs. wall-clock (5.576 s) indicates effective multi-core utilization (~287% CPU). 240 | - Throughput: 12GB / 5.576 s ≈ 2152 MB/s. 241 | 242 | - **1000 Files, 3MB (3GB)**: 243 | - `ripwc` maintains ~48x speedup, leveraging small-file batching (<512KB) to reduce thread overhead. 244 | - Lower system time (0.559 s) reflects efficient I/O for many small files. 245 | - Throughput: 3GB / 1.420 s ≈ 2113 MB/s. 246 | 247 | - **1 File, 3000MB (3GB)**: 248 | - Lower speedup (~16x) due to single-threaded processing (no parallelism for one file). 249 | - `ripwc` still outperforms `wc` with optimized I/O (1MB buffer) and unsafe Rust counting. 250 | - Throughput: 3GB / 4.278 s ≈ 701 MB/s. 251 | 252 | ## Contributing 253 | - Report issues or suggest features at [https://github.com/LuminousToaster/ripwc](https://github.com/LuminousToaster/ripwc). 254 | -------------------------------------------------------------------------------- /generate_files.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | # Check if arguments are provided 4 | if [ $# -lt 2 ]; then 5 | echo "Usage: $0 " 6 | echo "Example: $0 100 10" 7 | exit 1 8 | fi 9 | 10 | # Assign arguments to variables 11 | num_files=$1 12 | size_mb=$2 13 | 14 | # Validate input 15 | if ! [[ "$num_files" =~ ^[0-9]+$ ]]; then 16 | echo "Error: Number of files must be a positive integer" 17 | exit 1 18 | fi 19 | 20 | if ! [[ "$size_mb" =~ ^[0-9]+$ ]]; then 21 | echo "Error: Size must be a positive integer (in MB)" 22 | exit 1 23 | fi 24 | 25 | echo "Generating $num_files files, each with $size_mb MB of random data..." 26 | 27 | # Create directory if it doesn't exist 28 | mkdir -p random_files 29 | # Generate files 30 | for i in $(seq 1 $num_files); do 31 | filename="random_files/random_file_$i.bin" 32 | echo -ne "Generating file $i/$num_files\r" 33 | dd if=/dev/urandom of="$filename" bs=1M count="$size_mb" status=none 34 | done 35 | 36 | echo -e "\nCompleted! Generated $num_files files of $size_mb MB each in the 'random_files' directory." 37 | echo "Total data generated: $((num_files * size_mb)) MB" 38 | -------------------------------------------------------------------------------- /src/main.rs: -------------------------------------------------------------------------------- 1 | use std::fmt::Write as _; 2 | use std::fs::{File, Metadata}; 3 | use std::io::{self, BufReader, Read, Write}; 4 | use std::path::{Path, PathBuf}; 5 | 6 | use clap::Parser; 7 | use rayon::prelude::*; 8 | use walkdir::WalkDir; 9 | 10 | #[derive(Parser)] 11 | #[clap(author="https://github.com/LuminousToaster", version=env!("CARGO_PKG_VERSION"), about="A rewrite of the GNU coreutils 'wc' tool.", long_about = None)] 12 | struct Args { 13 | #[clap(value_parser, help="The file or folder to read", required=true)] 14 | file: Vec, 15 | #[clap(short='c', long, help="Print the byte counts")] 16 | bytes: bool, 17 | #[clap(short='m', long, help="Print the character counts")] 18 | chars: bool, 19 | #[clap(short='l', long, help="Print newline counts")] 20 | lines: bool, 21 | #[clap(short='w', long, help="Print word counts")] 22 | words: bool, 23 | #[clap(short='L', long, help="Print maximum display width")] 24 | max_line_length: bool, 25 | #[clap(short='r', long, help="Recursively search through folders and files")] 26 | recursive: bool, 27 | #[clap(short='v', help="Print verbose output")] 28 | verbose: bool, 29 | } 30 | 31 | // Struct to hold count data 32 | #[derive(Default, Clone)] 33 | struct Counts { 34 | bytes: usize, 35 | chars: usize, 36 | words: usize, 37 | lines: usize, 38 | max_line_length: usize, 39 | } 40 | 41 | impl Counts { 42 | fn add(&mut self, other: &Counts) { 43 | self.bytes += other.bytes; 44 | self.chars += other.chars; 45 | self.words += other.words; 46 | self.lines += other.lines; 47 | self.max_line_length = self.max_line_length.max(other.max_line_length); 48 | } 49 | } 50 | 51 | static IS_WHITESPACE: [bool; 256] = { 52 | let mut table = [false; 256]; 53 | table[b' ' as usize] = true; 54 | table[b'\t' as usize] = true; 55 | table[b'\n' as usize] = true; 56 | table[b'\r' as usize] = true; 57 | table 58 | }; 59 | 60 | #[inline(always)] 61 | fn main() -> io::Result<()> { 62 | rayon::ThreadPoolBuilder::new().num_threads(num_cpus::get()).build_global().unwrap(); 63 | let mut app = Args::parse(); 64 | // Set default flags if none are specified 65 | if !app.bytes && !app.lines && !app.words && !app.chars && !app.max_line_length { 66 | app.bytes = true; 67 | app.lines = true; 68 | app.words = true; 69 | } 70 | let mut total_counts = Counts::default(); 71 | let mut file_count = 0; 72 | let mut result = String::with_capacity(128); 73 | let stdout = io::stdout(); 74 | let mut stdout = stdout.lock(); 75 | 76 | // Collect paths and metadata 77 | let paths: Vec<(PathBuf, Option)> = app.file.iter().flat_map(|file_path| { 78 | WalkDir::new(file_path) .sort_by_file_name().into_iter().filter_map(Result::ok).take(if app.recursive { usize::MAX } else { 1 }).map(|entry| { 79 | let path = entry.into_path(); 80 | let metadata = std::fs::metadata(&path).ok(); 81 | (path, metadata)}) 82 | }).collect(); 83 | 84 | // Process files in parallel with small-file batching 85 | let counts: Vec<(Counts, String)> = paths.par_iter().filter_map(|(path, metadata)| { 86 | // Batch small files (<512KB) sequentially 87 | if let Some(meta) = metadata { 88 | if meta.len() < 512 * 1024 { 89 | let mut counts = Counts::default(); 90 | let result = process_file(path, Some(meta), &app).ok()?; 91 | counts.add(&result); 92 | let mut output = String::with_capacity(128); 93 | append_counts(&mut output, &counts, &app); 94 | return Some((counts, format!("{} {}", output.trim(), path.display()))); 95 | } 96 | } 97 | if app.verbose { 98 | writeln!(io::stderr(), "Processing: {}", path.display()).ok()?; 99 | } 100 | let counts = process_file(path, metadata.as_ref(), &app).ok()?; 101 | let mut result = String::with_capacity(128); 102 | append_counts(&mut result, &counts, &app); 103 | Some((counts, format!("{} {}", result.trim(), path.display()))) 104 | }).collect(); 105 | // Aggregate results 106 | for (counts, output) in counts { 107 | file_count += 1; 108 | total_counts.add(&counts); 109 | writeln!(stdout, "{}", output)?; 110 | } 111 | // Print totals if multiple files were processed 112 | if file_count > 1 { 113 | result.clear(); 114 | append_counts(&mut result, &total_counts, &app); 115 | writeln!(stdout, "\n{} total", result.trim())?; 116 | } 117 | Ok(()) 118 | } 119 | 120 | // Process a single file and return its counts 121 | #[inline(always)] 122 | fn process_file(path: &Path, metadata: Option<&Metadata>, app: &Args) -> io::Result { 123 | let file = File::open(path)?; 124 | let mut counts = Counts::default(); 125 | // If only bytes are needed, use metadata 126 | if app.bytes && !app.lines && !app.words && !app.chars && !app.max_line_length { 127 | if let Some(meta) = metadata { 128 | counts.bytes = meta.len() as usize; 129 | return Ok(counts); 130 | } 131 | } 132 | // Use buffered reading with 1MB buffer on heap 133 | let mut reader = BufReader::with_capacity(1024 * 1024, file); 134 | let mut buffer = vec![0u8; 1024 * 1024]; 135 | let mut in_word = false; 136 | let mut current_line_length = 0; 137 | 138 | loop { 139 | let bytes_read = reader.read(&mut buffer)?; 140 | if bytes_read == 0 { 141 | break; 142 | } 143 | // Process buffer with 8-byte unrolling 144 | let mut i = 0; 145 | unsafe { 146 | let ptr = buffer.as_ptr(); 147 | while i + 7 < bytes_read { 148 | let b0 = *ptr.add(i); 149 | let b1 = *ptr.add(i + 1); 150 | let b2 = *ptr.add(i + 2); 151 | let b3 = *ptr.add(i + 3); 152 | let b4 = *ptr.add(i + 4); 153 | let b5 = *ptr.add(i + 5); 154 | let b6 = *ptr.add(i + 6); 155 | let b7 = *ptr.add(i + 7); 156 | if app.bytes { 157 | counts.bytes += 8; 158 | } 159 | if app.chars { 160 | if b0 != 0 { counts.chars += 1; } 161 | if b1 != 0 { counts.chars += 1; } 162 | if b2 != 0 { counts.chars += 1; } 163 | if b3 != 0 { counts.chars += 1; } 164 | if b4 != 0 { counts.chars += 1; } 165 | if b5 != 0 { counts.chars += 1; } 166 | if b6 != 0 { counts.chars += 1; } 167 | if b7 != 0 { counts.chars += 1; } 168 | } 169 | if app.lines { 170 | if b0 == b'\n' { counts.lines += 1; } 171 | if b1 == b'\n' { counts.lines += 1; } 172 | if b2 == b'\n' { counts.lines += 1; } 173 | if b3 == b'\n' { counts.lines += 1; } 174 | if b4 == b'\n' { counts.lines += 1; } 175 | if b5 == b'\n' { counts.lines += 1; } 176 | if b6 == b'\n' { counts.lines += 1; } 177 | if b7 == b'\n' { counts.lines += 1; } 178 | } 179 | if app.max_line_length { 180 | if b0 == b'\n' { 181 | counts.max_line_length = counts.max_line_length.max(current_line_length); 182 | current_line_length = 0; 183 | } else { 184 | current_line_length += 1; 185 | } 186 | if b1 == b'\n' { 187 | counts.max_line_length = counts.max_line_length.max(current_line_length); 188 | current_line_length = 0; 189 | } else { 190 | current_line_length += 1; 191 | } 192 | if b2 == b'\n' { 193 | counts.max_line_length = counts.max_line_length.max(current_line_length); 194 | current_line_length = 0; 195 | } else { 196 | current_line_length += 1; 197 | } 198 | if b3 == b'\n' { 199 | counts.max_line_length = counts.max_line_length.max(current_line_length); 200 | current_line_length = 0; 201 | } else { 202 | current_line_length += 1; 203 | } 204 | if b4 == b'\n' { 205 | counts.max_line_length = counts.max_line_length.max(current_line_length); 206 | current_line_length = 0; 207 | } else { 208 | current_line_length += 1; 209 | } 210 | if b5 == b'\n' { 211 | counts.max_line_length = counts.max_line_length.max(current_line_length); 212 | current_line_length = 0; 213 | } else { 214 | current_line_length += 1; 215 | } 216 | if b6 == b'\n' { 217 | counts.max_line_length = counts.max_line_length.max(current_line_length); 218 | current_line_length = 0; 219 | } else { 220 | current_line_length += 1; 221 | } 222 | if b7 == b'\n' { 223 | counts.max_line_length = counts.max_line_length.max(current_line_length); 224 | current_line_length = 0; 225 | } else { 226 | current_line_length += 1; 227 | } 228 | } 229 | if app.words { 230 | let ws0 = IS_WHITESPACE[b0 as usize]; 231 | let ws1 = IS_WHITESPACE[b1 as usize]; 232 | let ws2 = IS_WHITESPACE[b2 as usize]; 233 | let ws3 = IS_WHITESPACE[b3 as usize]; 234 | let ws4 = IS_WHITESPACE[b4 as usize]; 235 | let ws5 = IS_WHITESPACE[b5 as usize]; 236 | let ws6 = IS_WHITESPACE[b6 as usize]; 237 | let ws7 = IS_WHITESPACE[b7 as usize]; 238 | if !in_word && !ws0 { 239 | in_word = true; 240 | } else if in_word && ws0 { 241 | in_word = false; 242 | counts.words += 1; 243 | } 244 | if !in_word && !ws1 { 245 | in_word = true; 246 | } else if in_word && ws1 { 247 | in_word = false; 248 | counts.words += 1; 249 | } 250 | if !in_word && !ws2 { 251 | in_word = true; 252 | } else if in_word && ws2 { 253 | in_word = false; 254 | counts.words += 1; 255 | } 256 | if !in_word && !ws3 { 257 | in_word = true; 258 | } else if in_word && ws3 { 259 | in_word = false; 260 | counts.words += 1; 261 | } 262 | if !in_word && !ws4 { 263 | in_word = true; 264 | } else if in_word && ws4 { 265 | in_word = false; 266 | counts.words += 1; 267 | } 268 | if !in_word && !ws5 { 269 | in_word = true; 270 | } else if in_word && ws5 { 271 | in_word = false; 272 | counts.words += 1; 273 | } 274 | if !in_word && !ws6 { 275 | in_word = true; 276 | } else if in_word && ws6 { 277 | in_word = false; 278 | counts.words += 1; 279 | } 280 | if !in_word && !ws7 { 281 | in_word = true; 282 | } else if in_word && ws7 { 283 | in_word = false; 284 | counts.words += 1; 285 | } 286 | } 287 | i += 8; 288 | } 289 | 290 | // Process final bytes 291 | while i < bytes_read { 292 | let byte = *ptr.add(i); 293 | if app.bytes { 294 | counts.bytes += 1; 295 | } 296 | if app.chars && byte != 0 { 297 | counts.chars += 1; 298 | } 299 | if app.lines && byte == b'\n' { 300 | counts.lines += 1; 301 | } 302 | if app.max_line_length { 303 | if byte == b'\n' { 304 | counts.max_line_length = counts.max_line_length.max(current_line_length); 305 | current_line_length = 0; 306 | } else { 307 | current_line_length += 1; 308 | } 309 | } 310 | if app.words { 311 | let is_whitespace = IS_WHITESPACE[byte as usize]; 312 | if !in_word && !is_whitespace { 313 | in_word = true; 314 | } else if in_word && is_whitespace { 315 | in_word = false; 316 | counts.words += 1; 317 | } 318 | } 319 | i += 1; 320 | } 321 | } 322 | } 323 | // Handle last word and line 324 | if app.words && in_word { 325 | counts.words += 1; 326 | } 327 | if app.max_line_length && current_line_length > 0 { 328 | counts.max_line_length = counts.max_line_length.max(current_line_length); 329 | } 330 | 331 | // Fallback to metadata for bytes if needed 332 | if app.bytes && counts.bytes == 0 { 333 | if let Some(meta) = metadata { 334 | counts.bytes = meta.len() as usize; 335 | } 336 | } 337 | Ok(counts) 338 | } 339 | 340 | // Append counts to the result string based on app flags 341 | #[inline(always)] 342 | fn append_counts(result: &mut String, counts: &Counts, app: &Args) { 343 | if app.lines && counts.lines > 0 { 344 | let _ = write!(result, " lines: {}", counts.lines); 345 | } 346 | if app.words && counts.words > 0 { 347 | let _ = write!(result, " words: {}", counts.words); 348 | } 349 | if app.chars && counts.chars > 0 { 350 | let _ = write!(result, " chars: {}", counts.chars); 351 | } 352 | if app.bytes && counts.bytes > 0 { 353 | let _ = write!(result, " bytes: {}", counts.bytes); 354 | } 355 | if app.max_line_length && counts.max_line_length > 0 { 356 | let _ = write!(result, " max line length: {}", counts.max_line_length); 357 | } 358 | } 359 | --------------------------------------------------------------------------------