pax_global_header00006660000000000000000000000064122244615300014511gustar00rootroot0000000000000052 comment=1104c45d54254d7d9b35acbe53d2213f43a4f65e diskscan-0.13/000077500000000000000000000000001222446153000132335ustar00rootroot00000000000000diskscan-0.13/.gitignore000066400000000000000000000001221222446153000152160ustar00rootroot00000000000000*.did *.o *.a *.d .do_built .do_built.dir .redo diskscan arch/arch.c arch/arch.id diskscan-0.13/COPYING000066400000000000000000001045131222446153000142720ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . diskscan-0.13/Documentation/000077500000000000000000000000001222446153000160445ustar00rootroot00000000000000diskscan-0.13/Documentation/.gitignore000066400000000000000000000000271222446153000200330ustar00rootroot00000000000000/*.1 /*.tmp /md-to-man diskscan-0.13/Documentation/all.do000066400000000000000000000001031222446153000171320ustar00rootroot00000000000000/bin/ls *.md | sed 's/\.md/.1/' | xargs redo-ifchange redo-always diskscan-0.13/Documentation/clean.do000066400000000000000000000000571222446153000174540ustar00rootroot00000000000000rm -f *~ .*~ *.1 t/*.1 md-to-man *.tmp t/*.tmp diskscan-0.13/Documentation/default.1.do000066400000000000000000000000711222446153000201510ustar00rootroot00000000000000redo-ifchange md-to-man $2.md.tmp . ./md-to-man $1 $2 $3 diskscan-0.13/Documentation/default.md.tmp.do000066400000000000000000000001541222446153000212120ustar00rootroot00000000000000redo-ifchange ../version/vars $2.md . ../version/vars sed -e "s/%VERSION%/$TAG/" -e "s/%DATE%/$DATE/" $2.md diskscan-0.13/Documentation/diskscan.md000066400000000000000000000042021222446153000201630ustar00rootroot00000000000000% diskscan(1) DiskScan %VERSION% % Baruch Even % %DATE% # NAME diskscan - scan a disk for failed and near failure sectors # SYNOPSIS `diskscan` [options...] *block_device* # DESCRIPTION `diskscan` is intended to check a disk and find any bad sectors already present and assess it for any possible sectors that are in the process of going bad. The operation is all read-only and can cause no direct damage to the data on the disk. diskscan reads the entire block device and notes the time it took to read a block. When there is an error it is immediately noted and also when there is a higher latency to read a block. A histogram of the block latency times is also given to assess the health of the disk. The output of diskscan will show any serious errors or very high latency and will also emit an histogram at the end of the run in the form: I: Validating path /dev/sdg I: Opened disk /dev/sdg I: Scanning disk /dev/sdg Access time histogram: 1: 0 10: 0 100: 0 500: 120 1000: 0 2000: 1 3000: 0 4000: 0 5000: 0 6000: 0 7000: 0 8000: 0 9000: 0 10000: 0 15000: 0 20000: 0 25000: 0 30000: 0 above that: 0 I: Closed disk /dev/sdg This means that all I/Os in this case were between 100 and 600 msec and there were 120 chunks being read. Current these chunks are 1MB in size. # OPTIONS `-v`, `--verbose` display verbose information from the workings of the scan use multiple times for increased verbosity. `-f`, `--fix` Attempt to fix areas that are nearing failure. This should only be attempted on an unmounted block device and never on an inuse filesystem or corruption is likely. `-s `, `--scan ` Scan mode can be either `seq` or `random`, random reduces the chance that the disk will be able spend time to recover data before we try to access a sector but the seeks add noise to the latency measurement. Sequential test is the default and random test is still experimental with regard to its usefulness. # SEE ALSO `badblocks`(1), `fsck`(1) diskscan-0.13/Documentation/md-to-man.do000066400000000000000000000004321222446153000201600ustar00rootroot00000000000000redo-ifchange md2man.py if ./md2man.py /dev/null; then echo './md2man.py $2.md.tmp' else echo "Warning: md2man.py missing modules; can't generate manpages." >&2 echo "Warning: try this: sudo easy_install markdown BeautifulSoup" >&2 echo 'echo Skipping: $2.1 >&2' fi diskscan-0.13/Documentation/md2man.py000077500000000000000000000162771222446153000176140ustar00rootroot00000000000000#!/usr/bin/env python import sys, os, markdown, re from BeautifulSoup import BeautifulSoup def _split_lines(s): return re.findall(r'([^\n]*\n?)', s) class Writer: def __init__(self): self.started = False self.indent = 0 self.last_wrote = '\n' def _write(self, s): if s: self.last_wrote = s sys.stdout.write(s) def writeln(self, s): if s: self.linebreak() self._write('%s\n' % s) def write(self, s): if s: self.para() for line in _split_lines(s): if line.startswith('.'): self._write('\\&' + line) else: self._write(line) def linebreak(self): if not self.last_wrote.endswith('\n'): self._write('\n') def para(self, bullet=None): if not self.started: if not bullet: bullet = ' ' if not self.indent: self.writeln(_macro('.PP')) else: assert(self.indent >= 2) prefix = ' '*(self.indent-2) + bullet + ' ' self.writeln('.IP "%s" %d' % (prefix, self.indent)) self.started = True def end_para(self): self.linebreak() self.started = False def start_bullet(self): self.indent += 3 self.para(bullet='\\[bu]') def end_bullet(self): self.indent -= 3 self.end_para() w = Writer() def _macro(name, *args): if not name.startswith('.'): raise ValueError('macro names must start with "."') fixargs = [] for i in args: i = str(i) i = i.replace('\\', '') i = i.replace('"', "'") if (' ' in i) or not i: i = '"%s"' % i fixargs.append(i) return ' '.join([name] + list(fixargs)) def macro(name, *args): w.writeln(_macro(name, *args)) def _force_string(owner, tag): if tag.string: return tag.string else: out = '' for i in tag: if not (i.string or i.name in ['a', 'br']): raise ValueError('"%s" tags must contain only strings: ' 'got %r: %r' % (owner.name, tag.name, tag)) out += _force_string(owner, i) return out def _clean(s): s = s.replace('\\', '\\\\') return s def _bitlist(tag): if getattr(tag, 'contents', None) == None: for i in _split_lines(str(tag)): yield None,_clean(i) else: for e in tag: name = getattr(e, 'name', None) if name in ['a', 'br']: name = None # just treat as simple text s = _force_string(tag, e) if name: yield name,_clean(s) else: for i in _split_lines(s): yield None,_clean(i) def _bitlist_simple(tag): for typ,text in _bitlist(tag): if typ and not typ in ['em', 'strong', 'code']: raise ValueError('unexpected tag %r inside %r' % (typ, tag.name)) yield text def _text(bitlist, tag): out = '' for typ,text in bitlist: if not typ: out += text elif typ == 'em': out += '\\fI%s\\fR' % text elif typ in ['strong', 'code']: out += '\\fB%s\\fR' % text else: raise ValueError('unexpected tag %r inside %r' % (typ, tag.name)) out = out.strip() out = re.sub(re.compile(r'^\s+', re.M), '', out) return out def text(tag): w.write(_text(_bitlist(tag), tag)) # This is needed because .BI (and .BR, .RB, etc) are weird little state # machines that alternate between two fonts. So if someone says something # like foochickenwickendicken we have to convert that to # .BI foo chickenwicken dicken def _boldline(l): out = [''] last_bold = False for typ,text in l: nonzero = not not typ if nonzero != last_bold: last_bold = not last_bold out.append('') out[-1] += re.sub(r'\s+', ' ', text) macro('.BI', *out) def do_definition(tag): w.end_para() macro('.TP') w.started = True split = 0 pre = [] post = [] for typ,text in _bitlist(tag): if split: post.append((typ,text)) elif text.lstrip().startswith(': '): split = 1 post.append((typ,text.lstrip()[2:].lstrip())) else: pre.append((typ,text)) _boldline(pre) w.write(_text(post, tag)) def do_list(tag): for i in tag: name = getattr(i, 'name', '').lower() if not name and not str(i).strip(): pass elif name != 'li': raise ValueError('only
  • is allowed inside
      : got %r' % i) else: w.start_bullet() for xi in i: do(xi) w.end_para() w.end_bullet() def do(tag): name = getattr(tag, 'name', '').lower() if not name: text(tag) elif name == 'h1': macro('.SH', _force_string(tag, tag).upper()) w.started = True elif name == 'h2': macro('.SS', _force_string(tag, tag)) w.started = True elif name.startswith('h') and len(name)==2: raise ValueError('%r invalid - man page headers must be h1 or h2' % name) elif name == 'pre': t = _force_string(tag.code, tag.code) if t.strip(): macro('.RS', '+4n') macro('.nf') w.write(_clean(t).rstrip()) macro('.fi') macro('.RE') w.end_para() elif name == 'p' or name == 'br': g = re.match(re.compile(r'([^\n]*)\n +: +(.*)', re.S), str(tag)) if g: # it's a definition list (which some versions of python-markdown # don't support, including the one in Debian-lenny, so we can't # enable that markdown extension). Fake it up. do_definition(tag) else: text(tag) w.end_para() elif name == 'ul': do_list(tag) else: raise ValueError('non-man-compatible html tag %r' % name) PROD='Untitled' VENDOR='Vendor Name' SECTION='9' GROUPNAME='User Commands' DATE='' AUTHOR='' lines = [] if len(sys.argv) > 1: for n in sys.argv[1:]: lines += open(n).read().decode('utf8').split('\n') else: lines += sys.stdin.read().decode('utf8').split('\n') # parse pandoc-style document headers (not part of markdown) g = re.match(r'^%\s+(.*?)\((.*?)\)\s+(.*)$', lines[0]) if g: PROD = g.group(1) SECTION = g.group(2) VENDOR = g.group(3) lines.pop(0) g = re.match(r'^%\s+(.*?)$', lines[0]) if g: AUTHOR = g.group(1) lines.pop(0) g = re.match(r'^%\s+(.*?)$', lines[0]) if g: DATE = g.group(1) lines.pop(0) g = re.match(r'^%\s+(.*?)$', lines[0]) if g: GROUPNAME = g.group(1) lines.pop(0) inp = '\n'.join(lines) if AUTHOR: inp += ('\n# AUTHOR\n\n%s\n' % AUTHOR).replace('<', '\\<') html = markdown.markdown(inp) soup = BeautifulSoup(html, convertEntities=BeautifulSoup.HTML_ENTITIES) macro('.TH', PROD.upper(), SECTION, DATE, VENDOR, GROUPNAME) macro('.ad', 'l') # left justified macro('.nh') # disable hyphenation for e in soup: do(e) diskscan-0.13/Makefile000066400000000000000000000002261222446153000146730ustar00rootroot00000000000000all: ./do all static: LDFLAGS=-static ./do all scan: scan-build ./do all clean: ./do clean install: ./do all install distclean: ./do clean diskscan-0.13/README.md000066400000000000000000000020651222446153000145150ustar00rootroot00000000000000DiskScan -- Scan HDD/SSD for failed and near failed sectors ----------------------------------------------------------- DiskScan is a Unix/Linux tool to scan a block device and check if there are unreadable sectors, in addition it uses read latency times as an assessment for a near failure as sectors that are problematic to read usually entail many retries. This can be used to assess the state of the disk and maybe decide on a replacement in advance to its imminent failure. The disk self test may or may not pick up on such clues depending on the disk vendor decision making logic. Build ----- This project is using [redo][1] and includes the minimal do program as a replacement if you don't have the full redo installed. As a shortcut for those who are used to the traditional Make there is a Makefile provided that does the right thing. Install ------- make install You can control the DESTDIR when building packages and PREFIX if /usr is not right. License ------- DiskScan is licensed under the GPL version 3 or later. [1]: https://github.com/apenwarr/redo diskscan-0.13/all.do000066400000000000000000000000561222446153000143300ustar00rootroot00000000000000redo-ifchange diskscan tags Documentation/all diskscan-0.13/arch/000077500000000000000000000000001222446153000141505ustar00rootroot00000000000000diskscan-0.13/arch/arch-freebsd.c000066400000000000000000000004761222446153000166500ustar00rootroot00000000000000#include "arch.h" #include #include #include int get_block_device_size(int fd, uint64_t *size_bytes, uint64_t *sector_size) { if (ioctl(fd, DIOCGMEDIASIZE, size_bytes) < 0) { return -1; } if (ioctl(fd, DIOCGSECTORSIZE, sector_size) < 0) { return -1; } return 0; } diskscan-0.13/arch/arch-linux.c000066400000000000000000000004661222446153000163740ustar00rootroot00000000000000#include "arch.h" #include #include #include int get_block_device_size(int fd, uint64_t *size_bytes, uint64_t *sector_size) { if (ioctl(fd, BLKGETSIZE64, size_bytes) < 0) { return -1; } if (ioctl(fd, BLKSSZGET, sector_size) < 0) { return -1; } return 0; } diskscan-0.13/arch/arch.a.do000066400000000000000000000000611222446153000156250ustar00rootroot00000000000000OBJS="arch.o" redo-ifchange $OBJS ar rc $3 $OBJS diskscan-0.13/arch/arch.c.do000066400000000000000000000001671222446153000156360ustar00rootroot00000000000000exec >&2 redo-ifchange arch.id ARCH=$(cat arch.id) ARCH_FILE=arch-${ARCH}.c redo-ifchange $ARCH_FILE cp $ARCH_FILE $3 diskscan-0.13/arch/arch.id.do000066400000000000000000000000571222446153000160060ustar00rootroot00000000000000redo-always uname | tr '[:upper:]' '[:lower:]' diskscan-0.13/clean.do000066400000000000000000000003461222446153000146440ustar00rootroot00000000000000exec >&2 redo-always redo version/clean Documentation/clean for dir in . cli lib arch; do rm -f $dir/*.a $dir/*.o $dir/*.did $dir/.*.d done rm -f diskscan tags .do_built arch/arch.c arch/arch.id rm -rf .do_built.dir .redo diskscan-0.13/cli/000077500000000000000000000000001222446153000140025ustar00rootroot00000000000000diskscan-0.13/cli/cli.a.do000066400000000000000000000000721222446153000153130ustar00rootroot00000000000000OBJS="verbose.o cli.o" redo-ifchange $OBJS ar rc $3 $OBJS diskscan-0.13/cli/cli.c000066400000000000000000000127731222446153000147270ustar00rootroot00000000000000/* * Copyright 2013 Baruch Even * * This file is part of DiskScan. * * DiskScan is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * DiskScan is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with DiskScan. If not, see . * */ #include "verbose.h" #include "diskscan.h" #include "version.h" #include #include #include #include #include static disk_t disk; typedef struct options_t options_t; struct options_t { char *disk_path; int verbose; int fix; enum scan_mode mode; }; void print_header(void) { printf("diskscan version %s\n\n", TAG); VERBOSE("Verbosity set"); VVERBOSE("High verbosity set"); VVVERBOSE("Very high verbosity set"); } int usage(void) { printf("diskscan version %s\n\n", TAG); printf("diskscan [options] /dev/sd\n"); printf("Options:\n"); printf(" -v, --verbose - Increase verbosity, multiple uses for higher levels\n"); printf(" -f, --fix - Attempt to fix near failures, nothing can be done for unreadable sectors\n"); printf(" -s, --scan - Scan in order (seq, random)\n"); printf("\n"); return 1; } void report_scan_success(disk_t *disk, uint64_t offset_bytes, uint64_t data_size, uint64_t time) { } void report_scan_error(disk_t *disk, uint64_t offset_bytes, uint64_t data_size, uint64_t time) { } static void print_latency(latency_t *latency_graph, unsigned latency_graph_len) { unsigned i; const uint32_t height = 30; // number of lines to fill const uint32_t min_val = 0; uint32_t max_val = 1; for (i = 0; i < latency_graph_len; i++) { if (max_val < latency_graph[i].latency_max_msec) max_val = latency_graph[i].latency_max_msec; } uint32_t height_interval = (max_val - min_val + 1) / (height - 3); if (height_interval == 0) height_interval = 1; else if (height_interval > 10000) height_interval = 10000; int j; for (j = height; j > 0; j--) { if (j % 5 == 0) printf("%5u | ", j * height_interval); else printf(" | "); for (i = 0; i < latency_graph_len; i++) { uint32_t max_height = latency_graph[i].latency_max_msec / height_interval + 1; uint32_t med_height = latency_graph[i].latency_median_msec / height_interval + 1; uint32_t min_height = latency_graph[i].latency_min_msec / height_interval + 1; if (max_height == med_height) { max_height++; } if (med_height == min_height) { med_height++; if (max_height == med_height) max_height++; } if (max_height != j && med_height != j && min_height != j) { printf(" "); continue; } if (max_height == j) printf("^"); else if (med_height == j) printf("*"); else printf("_"); } printf("\n"); } printf(" +-"); for (i = 0; i < latency_graph_len; i++) { printf("-"); } printf("\n"); } void report_scan_done(disk_t *disk) { int hist_idx; printf("Access time histogram:\n"); for (hist_idx = 0; hist_idx < ARRAY_SIZE(disk->histogram); hist_idx++) { if (hist_idx != ARRAY_SIZE(disk->histogram)-1) printf("%8" PRIu64 ": %" PRIu64 "\n", histogram_time[hist_idx], disk->histogram[hist_idx]); else printf("%8s: %" PRIu64 "\n", "above that", disk->histogram[hist_idx]); } print_latency(disk->latency_graph, disk->latency_graph_len); } int parse_args(int argc, char **argv, options_t *opts) { int c; int unknown = 0; while (1) { int option_index = 0; static struct option long_options[] = { {"verbose", no_argument, 0, 'v'}, {"fix", no_argument, 0, 'f'}, {"scan", required_argument, 0, 's'}, {0, 0, 0, 0} }; c = getopt_long(argc, argv, "vfs:", long_options, &option_index); if (c == -1) break; switch (c) { case 0: break; case 'v': opts->verbose++; break; case 'f': opts->fix = 1; break; case 's': opts->mode = str_to_scan_mode(optarg); if (opts->mode == SCAN_MODE_UNKNOWN) { opts->mode = SCAN_MODE_SEQ; printf("Unknown scan mode %s given, using sequential\n", optarg); } break; default: unknown = 1; break; } } if (optind == argc) { printf("No disk path provided to scan!\n"); return usage(); } if (optind < argc - 1) { printf("Too many disk paths provided to scan, can only scan one disk!\n"); return usage(); } if (unknown) { printf("Unknown option provided"); return usage(); } opts->disk_path = argv[optind]; return 0; } int print_disk_info(disk_t *disk) { return 0; } static void diskscan_cli_signal(int signal) { disk_scan_stop(&disk); } static void setup_signals(void) { struct sigaction act = { .sa_handler = diskscan_cli_signal, .sa_flags = SA_RESTART, }; sigaction(SIGINT, &act, NULL); sigaction(SIGTERM, &act, NULL); } int diskscan_cli(int argc, char **argv) { options_t opts = {0}; if (parse_args(argc, argv, &opts)) return 1; verbose = opts.verbose; print_header(); setup_signals(); if (disk_open(&disk, opts.disk_path, opts.fix, 70)) return 1; if (print_disk_info(&disk)) return 1; if (disk_scan(&disk, opts.mode)) return 1; disk_close(&disk); return 0; } diskscan-0.13/cli/verbose.c000066400000000000000000000016441222446153000156200ustar00rootroot00000000000000/* * Copyright 2013 Baruch Even * * This file is part of DiskScan. * * DiskScan is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * DiskScan is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with DiskScan. If not, see . * */ #include "verbose.h" #include #include void verbose_out(const char *fmt, ...) { va_list ap; va_start(ap, fmt); vprintf(fmt, ap); va_end(ap); printf("\n"); } diskscan-0.13/default.o.do000066400000000000000000000006431222446153000154430ustar00rootroot00000000000000exec >&2 redo-ifchange $2.c DEP_FILE=$(dirname $2)/.$(basename $2).d CFLAGS="-O3 -g -Wall -Werror -D_GNU_SOURCE -D_FILE_OFFSET_BITS=64 $CFLAGS" CC=${CC:-gcc} $CC $CPPFLAGS $CFLAGS -I$PWD/include -M -MG -MF $DEP_FILE -E -o /dev/null $2.c read DEPS <$DEP_FILE redo-ifchange ${DEPS#*:} [ -n "$VERBOSE" ] && echo $CC $CPPFLAGS $CFLAGS -I$PWD/include -I. -c -o $3 $2.c $CC $CPPFLAGS $CFLAGS -I$PWD/include -I. -c -o $3 $2.c diskscan-0.13/diskscan.c000066400000000000000000000015041222446153000151760ustar00rootroot00000000000000/* * Copyright 2013 Baruch Even * * This file is part of DiskScan. * * DiskScan is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * DiskScan is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with DiskScan. If not, see . * */ #include "cli.h" int main(int argc, char **argv) { return diskscan_cli(argc, argv); } diskscan-0.13/diskscan.do000066400000000000000000000003211222446153000153520ustar00rootroot00000000000000exec >&2 OBJS="diskscan.o" LIBS="cli/cli.a lib/diskscan.a arch/arch.a" redo-ifchange $OBJS $LIBS CC=${CC:-gcc} [ -n "$VERBOSE" ] && echo $CC -o $3 $LDFLAGS $OBJS $LIBS -lrt $CC -o $3 $LDFLAGS $OBJS $LIBS -lrt diskscan-0.13/do000077500000000000000000000071461222446153000135730ustar00rootroot00000000000000#!/bin/sh # # A minimal alternative to djb redo that doesn't support incremental builds. # For the full version, visit http://github.com/apenwarr/redo # # The author disclaims copyright to this source file and hereby places it in # the public domain. (2010 12 14) # # By default, no output coloring. green="" bold="" plain="" if [ -n "$TERM" -a "$TERM" != "dumb" ] && tty <&2 >/dev/null 2>&1; then green="$(printf '\033[32m')" bold="$(printf '\033[1m')" plain="$(printf '\033[m')" fi _dirsplit() { base=${1##*/} dir=${1%$base} } dirname() ( _dirsplit "$1" dir=${dir%/} echo "${dir:-.}" ) _dirsplit "$0" export REDO=$(cd "${dir:-.}" && echo "$PWD/$base") DO_TOP= if [ -z "$DO_BUILT" ]; then DO_TOP=1 [ -n "$*" ] || set all # only toplevel redo has a default target export DO_BUILT=$PWD/.do_built : >>"$DO_BUILT" echo "Removing previously built files..." >&2 sort -u "$DO_BUILT" | tee "$DO_BUILT.new" | while read f; do printf "%s\0%s.did\0" "$f" "$f"; done | xargs -0 rm -f 2>/dev/null mv "$DO_BUILT.new" "$DO_BUILT" DO_PATH=$DO_BUILT.dir export PATH=$DO_PATH:$PATH rm -rf "$DO_PATH" mkdir "$DO_PATH" for d in redo redo-ifchange; do ln -s "$REDO" "$DO_PATH/$d"; done [ -e /bin/true ] && TRUE=/bin/true || TRUE=/usr/bin/true for d in redo-ifcreate redo-stamp redo-always; do ln -s $TRUE "$DO_PATH/$d"; done fi _find_dofile_pwd() { dofile=default.$1.do while :; do dofile=default.${dofile#default.*.} [ -e "$dofile" -o "$dofile" = default.do ] && break done ext=${dofile#default} ext=${ext%.do} base=${1%$ext} } _find_dofile() { local prefix= while :; do _find_dofile_pwd "$1" [ -e "$dofile" ] && break [ "$PWD" = "/" ] && break target=${PWD##*/}/$target tmp=${PWD##*/}/$tmp prefix=${PWD##*/}/$prefix cd .. done base=$prefix$base } _run_dofile() { export DO_DEPTH="$DO_DEPTH " export REDO_TARGET=$PWD/$target local line1 set -e read line1 <"$PWD/$dofile" || true cmd=${line1#"#!/"} if [ "$cmd" != "$line1" ]; then /$cmd "$PWD/$dofile" "$@" >"$tmp.tmp2" else :; . "$PWD/$dofile" >"$tmp.tmp2" fi } _do() { local dir=$1 target=$2 tmp=$3 if [ ! -e "$target" ] || [ -d "$target" -a ! -e "$target.did" ]; then printf '%sdo %s%s%s%s\n' \ "$green" "$DO_DEPTH" "$bold" "$dir$target" "$plain" >&2 echo "$PWD/$target" >>"$DO_BUILT" dofile=$target.do base=$target ext= [ -e "$target.do" ] || _find_dofile "$target" if [ ! -e "$dofile" ]; then echo "do: $target: no .do file" >&2 return 1 fi [ ! -e "$DO_BUILT" ] || [ ! -d "$(dirname "$target")" ] || : >>"$target.did" ( _run_dofile "$target" "$base" "$tmp.tmp" ) rv=$? if [ $rv != 0 ]; then printf "do: %s%s\n" "$DO_DEPTH" \ "$dir$target: got exit code $rv" >&2 rm -f "$tmp.tmp" "$tmp.tmp2" return $rv fi mv "$tmp.tmp" "$target" 2>/dev/null || ! test -s "$tmp.tmp2" || mv "$tmp.tmp2" "$target" 2>/dev/null rm -f "$tmp.tmp2" else echo "do $DO_DEPTH$target exists." >&2 fi } # Make corrections for directories that don't actually exist yet. _dir_shovel() { local dir base xdir=$1 xbase=$2 xbasetmp=$2 while [ ! -d "$xdir" -a -n "$xdir" ]; do _dirsplit "${xdir%/}" xbasetmp=${base}__$xbase xdir=$dir xbase=$base/$xbase echo "xbasetmp='$xbasetmp'" >&2 done } _redo() { set +e for i in "$@"; do _dirsplit "$i" _dir_shovel "$dir" "$base" dir=$xdir base=$xbase basetmp=$xbasetmp ( cd "$dir" && _do "$dir" "$base" "$basetmp" ) [ "$?" = 0 ] || return 1 done } _redo "$@" [ "$?" = 0 ] || exit 1 if [ -n "$DO_TOP" ]; then echo "Removing stamp files..." >&2 [ ! -e "$DO_BUILT" ] || while read f; do printf "%s.did\0" "$f"; done <"$DO_BUILT" | xargs -0 rm -f 2>/dev/null fi diskscan-0.13/include/000077500000000000000000000000001222446153000146565ustar00rootroot00000000000000diskscan-0.13/include/arch.h000066400000000000000000000002401222446153000157400ustar00rootroot00000000000000#ifndef _DISKSCAN_ARCH_H #define _DISKSCAN_ARCH_H #include int get_block_device_size(int fd, uint64_t *size_bytes, uint64_t *sector_size); #endif diskscan-0.13/include/cli.h000066400000000000000000000001341222446153000155740ustar00rootroot00000000000000#ifndef DISKSCAN_CLI #define DISKSCAN_CLI int diskscan_cli(int argc, char **argv); #endif diskscan-0.13/include/diskscan.h000066400000000000000000000025041222446153000166270ustar00rootroot00000000000000#ifndef _DISKSCAN_H_ #define _DISKSCAN_H_ #include #define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0])) static const uint64_t histogram_time[] = {1, 10, 100, 500, 1000, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, 10000, 15000, 20000, 25000, 30000, UINT64_MAX}; enum scan_mode { SCAN_MODE_UNKNOWN, SCAN_MODE_SEQ, SCAN_MODE_RANDOM, }; typedef struct latency_t { uint64_t start_sector; uint64_t end_sector; uint32_t latency_min_msec; uint32_t latency_max_msec; uint32_t latency_median_msec; } latency_t; typedef struct disk_t { int fd; char path[128]; char vendor[32]; char model[32]; char serial[32]; uint64_t num_bytes; uint64_t sector_size; int run; uint64_t num_errors; uint64_t histogram[ARRAY_SIZE(histogram_time)]; unsigned latency_graph_len; latency_t *latency_graph; } disk_t; int disk_open(disk_t *disk, const char *path, int fix, unsigned latency_graph_len); int disk_scan(disk_t *disk, enum scan_mode mode); int disk_close(disk_t *disk); void disk_scan_stop(disk_t *disk); enum scan_mode str_to_scan_mode(const char *s); /* Implemented by the user (gui/cli) */ void report_scan_success(disk_t *disk, uint64_t offset_bytes, uint64_t data_size, uint64_t time); void report_scan_error(disk_t *disk, uint64_t offset_bytes, uint64_t data_size, uint64_t time); void report_scan_done(disk_t *disk); #endif diskscan-0.13/include/median.h000066400000000000000000000031271222446153000162670ustar00rootroot00000000000000#ifndef _MEDIAN_H #define _MEDIAN_H /* This is taken from http://ndevilla.free.fr/median/median/src/wirth.c */ /* * Algorithm from N. Wirth's book, implementation by N. Devillard. * This code in public domain. */ #include #define elem_type uint32_t #define ELEM_SWAP(a,b) { register elem_type t=(a);(a)=(b);(b)=t; } /*--------------------------------------------------------------------------- Function : kth_smallest() In : array of elements, # of elements in the array, rank k Out : one element Job : find the kth smallest element in the array Notice : use the median() macro defined below to get the median. Reference: Author: Wirth, Niklaus Title: Algorithms + data structures = programs Publisher: Englewood Cliffs: Prentice-Hall, 1976 Physical description: 366 p. Series: Prentice-Hall Series in Automatic Computation ---------------------------------------------------------------------------*/ static elem_type kth_smallest(elem_type a[], int n, int k) { register int i,j,l,m ; register elem_type x ; l=0 ; m=n-1 ; while (l 0) verbose_out("V: " __VA_ARGS__) #define VVERBOSE(...) if (verbose > 1) verbose_out("V: " __VA_ARGS__) #define VVVERBOSE(...) if (verbose > 2) verbose_out("V: " __VA_ARGS__) #define INFO(...) verbose_out("I: " __VA_ARGS__) #define ERROR(...) verbose_out("E: " __VA_ARGS__) #endif diskscan-0.13/include/version.h000066400000000000000000000001471222446153000165160ustar00rootroot00000000000000#ifndef VERSION_H #define VERSION_H extern char *COMMIT; extern char *TAG; extern char *DATE; #endif diskscan-0.13/install.do000066400000000000000000000006531222446153000152310ustar00rootroot00000000000000exec >&2 : ${INSTALL:=install} : ${DESTDIR:=} : ${PREFIX:=/usr} : ${MANDIR:=$DESTDIR$PREFIX/share/man} : ${DOCDIR:=$DESTDIR$PREFIX/share/doc/diskscan} : ${BINDIR:=$DESTDIR$PREFIX/bin} echo "Installing to: $DESTDIR$PREFIX" # make dirs $INSTALL -d $MANDIR/man1 $DOCDIR $BINDIR # docs $INSTALL -m 0644 README.md $DOCDIR # manpages $INSTALL -m 0644 Documentation/*.1 $MANDIR/man1 # binaries $INSTALL -m 0755 diskscan $BINDIR diskscan-0.13/lib/000077500000000000000000000000001222446153000140015ustar00rootroot00000000000000diskscan-0.13/lib/diskscan.a.do000066400000000000000000000001241222446153000163400ustar00rootroot00000000000000OBJS="verbose.o diskscan.o ../version/version.o" redo-ifchange $OBJS ar rc $3 $OBJS diskscan-0.13/lib/diskscan.c000066400000000000000000000240701222446153000157470ustar00rootroot00000000000000/* * Copyright 2013 Baruch Even * * This file is part of DiskScan. * * DiskScan is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * DiskScan is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with DiskScan. If not, see . * */ #include "diskscan.h" #include "verbose.h" #include "arch.h" #include "median.h" #include #include #include #include #include #include #include #include #include #include #include struct scan_state { uint32_t latency_bucket; uint64_t latency_stride; uint32_t latency_count; uint32_t *latency; void *data; }; enum scan_mode str_to_scan_mode(const char *s) { if (strcasecmp(s, "seq") == 0 || strcasecmp(s, "sequential") == 0) return SCAN_MODE_SEQ; if (strcasecmp(s, "random") == 0) return SCAN_MODE_RANDOM; return SCAN_MODE_UNKNOWN; } int disk_open(disk_t *disk, const char *path, int fix, unsigned latency_graph_len) { memset(disk, 0, sizeof(*disk)); INFO("Validating path %s", path); if (access(path, F_OK)) { ERROR("Disk path %s does not exist: %m", path); return 1; } const int access_mode_flag = fix ? R_OK|W_OK : R_OK; if (access(path, access_mode_flag)) { ERROR("Disk path %s is inaccessible: %m", path); return 1; } const int open_mode_flag = fix ? O_RDWR : O_RDONLY; disk->fd = open(path, open_mode_flag|O_DIRECT); if (disk->fd < 0) { ERROR("Failed to open path %s: %m", path); return 1; } if (get_block_device_size(disk->fd, &disk->num_bytes, &disk->sector_size) < 0) { ERROR("Can't get block device size information for path %s: %m", path); goto Error; } if (disk->num_bytes == 0) { ERROR("Invalid number of sectors"); goto Error; } if (disk->sector_size == 0 || disk->sector_size % 512 != 0) { ERROR("Invalid sector size %d", disk->sector_size); goto Error; } #if 0 const uint64_t new_bytes_raw = disk->num_bytes / 10; const uint64_t new_bytes_leftover = new_bytes_raw % 512; const uint64_t new_bytes = new_bytes_raw - new_bytes_leftover; disk->num_bytes = new_bytes; #endif strncpy(disk->path, path, sizeof(disk->path)); disk->path[sizeof(disk->path)-1] = 0; disk->latency_graph_len = latency_graph_len; disk->latency_graph = calloc(latency_graph_len, sizeof(latency_t)); if (disk->latency_graph == NULL) { ERROR("Failed to allocate memory for latency graph data"); goto Error; } INFO("Opened disk %s sector size %u num bytes %llu", path, disk->sector_size, disk->num_bytes); return 0; Error: disk_close(disk); return 1; } int disk_close(disk_t *disk) { INFO("Closed disk %s", disk->path); close(disk->fd); disk->fd = -1; if (disk->latency_graph) { free(disk->latency_graph); disk->latency_graph = NULL; } return 0; } void disk_scan_stop(disk_t *disk) { disk->run = 0; } static int decide_buffer_size(disk_t *disk) { // TODO: Should use 64KB first and switch to sector size on errors, this will get the best speed overall and enough granularity. return 64*1024; } static void *allocate_buffer(int buf_size) { void *buf = mmap(NULL, buf_size, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0); if (!buf) return NULL; return buf; } static void free_buffer(void *buf, int buf_size) { munmap(buf, buf_size); } static void latency_bucket_prepare(disk_t *disk, struct scan_state *state, uint64_t offset) { assert(state->latency_bucket < disk->latency_graph_len); latency_t *l = &disk->latency_graph[state->latency_bucket]; const uint64_t start_sector = offset / disk->sector_size; VVERBOSE("bucket prepare bucket=%u", state->latency_bucket); l->start_sector = start_sector; l->latency_min_msec = UINT32_MAX; state->latency_count = 0; } static void latency_bucket_finish(disk_t *disk, struct scan_state *state, uint64_t offset) { latency_t *l = &disk->latency_graph[state->latency_bucket]; const uint64_t end_sector = offset / disk->sector_size; VVERBOSE("bucket finish bucket=%d", state->latency_bucket); l->end_sector = end_sector; l->latency_median_msec = median(state->latency, state->latency_count); state->latency_count = 0; state->latency_bucket++; } static void latency_bucket_add(disk_t *disk, uint64_t latency, struct scan_state *state) { latency_t *l = &disk->latency_graph[state->latency_bucket]; if (latency < l->latency_min_msec) l->latency_min_msec = latency; if (l->latency_max_msec < latency) l->latency_max_msec = latency; // Collect info for median calculation later state->latency[state->latency_count++] = latency; } static void disk_scan_part(disk_t *disk, uint64_t offset, void *data, int data_size, struct scan_state *state) { ssize_t ret; struct timespec t_start; struct timespec t_end; uint64_t t; clock_gettime(CLOCK_MONOTONIC, &t_start); ret = pread(disk->fd, data, data_size, offset); clock_gettime(CLOCK_MONOTONIC, &t_end); t = (t_end.tv_sec - t_start.tv_sec) * 1000000000 + t_end.tv_nsec - t_start.tv_nsec; if (ret != data_size) { int s_errno = errno; ERROR("Error when reading at offset %" PRIu64 " size %d read %d: %m", offset, data_size, ret); report_scan_error(disk, offset, data_size, t); disk->num_errors++; if (s_errno != EIO) abort(); } else { report_scan_success(disk, offset, data_size, t); } uint64_t t_msec = t / 1000000; int hist_idx = 0; while (t_msec >= histogram_time[hist_idx] && hist_idx < ARRAY_SIZE(disk->histogram) - 1) { hist_idx++; } disk->histogram[hist_idx]++; latency_bucket_add(disk, t_msec, state); if (t_msec > 1000) { VERBOSE("Scanning at offset %" PRIu64 " took %llu msec", offset, t_msec); } if (t_msec > 3000) { INFO("Fixing region by rewriting, offset=%d size=%d", offset, data_size); ret = pwrite(disk->fd, data, data_size, offset); if (ret != 0) { ERROR("Error while attempting to rewrite the data! errno=%d: %m", errno); } } } static uint64_t calc_latency_stride(disk_t *disk) { const uint64_t num_sectors = disk->num_bytes / disk->sector_size; const uint64_t stride_size = num_sectors / disk->latency_graph_len; // At this stage stride_size may have a reminder, we need to distribute the // latencies a bit more to avoid it Since the remainder can never be more // than the latency_graph_len we can just add one entry to all the buckets return stride_size + 1; } static uint32_t *calc_scan_order_seq(disk_t *disk, uint64_t stride_size, int read_size_sectors) { uint64_t num_reads = stride_size / read_size_sectors + 2; uint32_t *order = malloc(sizeof(uint32_t) * num_reads); uint64_t i; for (i = 0; i < num_reads; i++) order[i] = i * read_size_sectors * disk->sector_size; order[i] = UINT32_MAX; return order; } static uint32_t *calc_scan_order_random(disk_t *disk, uint64_t stride_size, int read_size_sectors) { uint64_t num_reads = stride_size / read_size_sectors + 2; uint32_t *order = malloc(sizeof(uint32_t) * num_reads); // Fill sequential data uint64_t i; for (i = 0; i < num_reads - 1; i++) order[i] = i * read_size_sectors * disk->sector_size; order[i] = UINT32_MAX; // Shuffle it srand(time(NULL)); for (i = 0; i < num_reads - 1; i++) { int j = rand() % num_reads; if (i == j) continue; uint32_t tmp = order[i]; order[i] = order[j]; order[j] = tmp; } return order; } static uint32_t *calc_scan_order(disk_t *disk, enum scan_mode mode, uint64_t stride_size, int read_size) { int read_size_sectors = read_size / disk->sector_size; if (mode == SCAN_MODE_SEQ) return calc_scan_order_seq(disk, stride_size, read_size_sectors); else if (mode == SCAN_MODE_RANDOM) return calc_scan_order_random(disk, stride_size, read_size_sectors); else return NULL; } static void disk_scan_latency_stride(disk_t *disk, struct scan_state *state, uint64_t base_offset, uint64_t data_size, uint32_t *scan_order) { unsigned i; for (i = 0; disk->run && scan_order[i] != UINT32_MAX; i++) { uint64_t offset = base_offset + scan_order[i]; VVVERBOSE("Scanning at offset %llu index %u", offset, i); uint64_t remainder = base_offset + state->latency_stride * disk->sector_size - offset; if (remainder < data_size) { data_size = remainder; VERBOSE("Last part scanning size %d", data_size); } disk_scan_part(disk, offset, state->data, data_size, state); } } int disk_scan(disk_t *disk, enum scan_mode mode) { INFO("Scanning disk %s", disk->path); disk->run = 1; int data_size = decide_buffer_size(disk); void *data = allocate_buffer(data_size); uint32_t *scan_order = NULL; int result = 0; struct scan_state state = {.latency = NULL}; VVVERBOSE("Using buffer of size %d", data_size); if (data == NULL) { ERROR("Failed to allocate data buffer: %m"); result = 1; goto Exit; } uint64_t offset; const uint64_t disk_size_bytes = disk->num_bytes; const uint64_t latency_stride = calc_latency_stride(disk); VVERBOSE("latency stride is %llu", latency_stride); state.latency_bucket = 0; state.latency_stride = latency_stride; state.latency_count = 0; state.latency = malloc(sizeof(uint32_t) * latency_stride); state.data = data; scan_order = calc_scan_order(disk, mode, latency_stride, data_size); if (!scan_order) { result = 1; ERROR("Failed to generate scan order"); goto Exit; } for (offset = 0; disk->run && offset < disk_size_bytes; offset += latency_stride * disk->sector_size) { VVERBOSE("Scanning stride starting at %llu", offset); latency_bucket_prepare(disk, &state, offset); disk_scan_latency_stride(disk, &state, offset, data_size, scan_order); latency_bucket_finish(disk, &state, offset + latency_stride * disk->sector_size); } if (!disk->run) { INFO("Disk scan interrupted"); } report_scan_done(disk); Exit: free(scan_order); free_buffer(data, data_size); free(state.latency); disk->run = 0; return result; } diskscan-0.13/lib/verbose.c000066400000000000000000000014171222446153000156150ustar00rootroot00000000000000/* * Copyright 2013 Baruch Even * * This file is part of DiskScan. * * DiskScan is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * DiskScan is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with DiskScan. If not, see . * */ #include "verbose.h" int verbose; diskscan-0.13/tags.do000066400000000000000000000003601222446153000145140ustar00rootroot00000000000000exec >&2 SRCS=$(find . -name \*.c -or -name \*.h) redo-ifchange $SRCS # Do not panic if ctags is not available, most likely this is a non-developer trying to build or a build machine which ctags >/dev/null && ctags -f $3 $SRCS || /bin/true diskscan-0.13/version/000077500000000000000000000000001222446153000147205ustar00rootroot00000000000000diskscan-0.13/version/.gitattributes000066400000000000000000000000321222446153000176060ustar00rootroot00000000000000gitvars.pre export-subst diskscan-0.13/version/.gitignore000066400000000000000000000000321222446153000167030ustar00rootroot00000000000000/vars /gitvars /version.c diskscan-0.13/version/all.do000066400000000000000000000000351222446153000160120ustar00rootroot00000000000000redo-ifchange vars version.c diskscan-0.13/version/clean.do000066400000000000000000000000551222446153000163260ustar00rootroot00000000000000rm -f *~ .*~ version.c vars gitvars *.o .*.d diskscan-0.13/version/gitvars.do000066400000000000000000000014621222446153000167260ustar00rootroot00000000000000redo-ifchange gitvars.pre prodname read PROD $3 # Fix each line from gitvars.pre where git may or may not have already # substituted the variables. If someone generated a tarball with 'git archive', # then the data will have been substituted already. If we're in a checkout of # the git repo, then it won't, but we can just ask git to do the substitutions # right now. while read line; do # Lines *may* be of the form: $Format: ... $ x=${line#\$Format:} # remove prefix if [ "$x" != "$line" ]; then # git didn't substitute it redo-always # git this from the git repo x=${x%\$} # remove trailing $ if [ "$x" = "%d" ]; then tag=$(git describe --match="$PROD-*") x="(tag: $tag)" else x=$(git log -1 --pretty=format:"$x") fi fi echo "$x" done