pax_global_header00006660000000000000000000000064130727057210014516gustar00rootroot0000000000000052 comment=0d79213e2857df24e9b1e875a52a58fd0ff651a6 bcal-1.5/000077500000000000000000000000001307270572100122645ustar00rootroot00000000000000bcal-1.5/.gitignore000066400000000000000000000000101307270572100142430ustar00rootroot00000000000000/dist/* bcal-1.5/.travis.yml000066400000000000000000000023151307270572100143760ustar00rootroot00000000000000language: c sudo: required env: matrix: - OS_TYPE=centos OS_VERSION=7 - OS_TYPE=fedora OS_VERSION=24 services: - docker before_install: - sudo docker pull $OS_TYPE:$OS_VERSION script: - ./build-docker $OS_TYPE $OS_VERSION - sudo chown -R $(id -un).$(id -gn) dist after_success: - ls -l dist deploy: skip_cleanup: true provider: releases api-key: secure: ZtMbo/H21MoodNvw7+tvPId97meS4Xs2beUzqOhI166iuaLSWtjXxQgeC7vdYTWgPNacN6gxwhnXTLMXpt81a7g0NWxjRQ72/Rwh7aCdgQkJI/Y+0c7RNNVdLOtAWBM8csPoJy0jFdI34yHRj053tm9x65V4fMEKC9ArRm7pbTjNNovYXbW2KmRh6kr3dJdB/7tpoCpiMov6l4uHyWIcniFx97P+3dGnGqBd8SpR3IxeEypm8fzIGiX7NIJqwyG5MbLaWoyloBu21ilwh07dDifF6MI4mrkxtGY0yQ9GtHVp5cr7qyMgCt60hUGtrKhTtPQWwpzK0GSZ5eeYiLt6I/kkcj8FkWP+OazRLy/MydjGtG7q8tnbgNcmGqsbv+g1jJMEfZsnTfozeGOPPsYlhB/7kCi2BVqguXlKMRmpNPMZsc4HYK9yjV4HNsEkmwJcXgD350XS5iFu/koIGiT2PJ+/msdwPir74JpgRn00iGC0fD25V8M2TRnKn43g6jNRAZYMITaYDx+ML0SkdWIjksalW0759BgLfQopNbs9a9PbsKiNbfRRRF3xA8j2fQI6my7hXx0TzRwWTC7aMAuJkdjKn5UYOrMAZ+VXhHSOcX5LPiefwgtoU0YGjgWQdgTkQ7aR13rKuDSKepGonnkyiHWnM9gGftnNbNFi7WZRk5w= file_glob: true file: - dist/*.deb - dist/*.rpm on: repo: jarun/bcal tags: true # vim: et:ai:ts=4:sw=4:ft=yaml bcal-1.5/CHANGELOG000066400000000000000000000016031307270572100134760ustar00rootroot00000000000000bcal 1.5 2017-04-10 Modifications - Support binary and octal in CHS2LBA and LBA2CHS conversions ------------------------------------------------------------------------------- bcal 1.4 2016-10-17 Modifications - Travis integration - RPM generation via Travis and Docker ------------------------------------------------------------------------------- bcal v1.1 2016-10-04 Modifications - Rename utility to bcal (Byte CALculator) ------------------------------------------------------------------------------- calb v1.0 2016-09-28 Initial features - convert to IEC/SI standard data storage units - show the address in bytes - show address as LBA:OFFSET - convert CHS to LBA and vice versa - show binary, decimal and hex representation of a number - custom sector size, max heads/cylinder and max sectors/track ------------------------------------------------------------------------------- bcal-1.5/LICENSE000066400000000000000000001045051307270572100132760ustar00rootroot00000000000000 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. {one line to give the program's name and a brief idea of what it does.} Copyright (C) {year} {name of author} 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: {project} Copyright (C) {year} {fullname} 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 . bcal-1.5/Makefile000066400000000000000000000012451307270572100137260ustar00rootroot00000000000000CC = gcc CFLAGS = -O3 -m64 -Wall -Wextra -Werror LDLIBS = -lquadmath PREFIX ?= /usr/local BINDIR = $(DESTDIR)$(PREFIX)/bin MANDIR = $(DESTDIR)$(PREFIX)/share/man/man1 DOCDIR = $(DESTDIR)$(PREFIX)/share/doc/bcal all: bcal bcal: bcal.c $(CC) $(CFLAGS) -o bcal bcal.c $(LDLIBS) strip bcal .PHONY: clean clean: -rm -f bcal distclean: clean rm -f *~ install: bcal install -m755 -d $(BINDIR) install -m755 -d $(MANDIR) install -m755 -d $(DOCDIR) gzip -c bcal.1 > bcal.1.gz install -m755 bcal $(BINDIR) install -m644 bcal.1.gz $(MANDIR) install -m644 README.md $(DOCDIR) rm -f bcal.1.gz uninstall: rm -f $(BINDIR)/bcal rm -f $(MANDIR)/bcal.1.gz rm -rf $(DOCDIR) bcal-1.5/README.md000066400000000000000000000163661307270572100135570ustar00rootroot00000000000000

bcal

Latest release AUR Debian Strech+ Ubuntu Zesty+ License

bcal_asciicast

`bcal` (*Byte CALculator*) is a command-line utility for storage conversions and calculations. Storage, hardware and firmware developers work with numerical calculations regularly e.g., storage unit conversions, address calculations etc. If you are one and can't calculate the hex address offset for (512 - 16) MiB immediately, or the value when the 43rd bit of a 64-bit address is set, `bcal` is for you. Though it started with storage, the scope of `bcal` isn't limited to the storage domain. Feel free to raise PRs to simplify other domain-specific numerical calculations so it can evolve into an **engineer's tool**. `bcal` follows Ubuntu's standard unit conversion and notation [policy](https://wiki.ubuntu.com/UnitsPolicy). Only 64-bit operating systems are supported.

Donate via PayPal!

## Table of Contents - [Features](#features) - [Installation](#installation) - [Dependencies](#dependencies) - [Get the source code](#get-the-source-code) - [Compile and install](#compile-and-install) - [Installing with a package manager](#installing-with-a-package-manager) - [RPMs](#rpms) - [Usage](#usage) - [cmdline options](#cmdline-options) - [Operational notes](#operational-notes) - [Examples](#examples) - [Copyright](#copyright) ## Features - convert to IEC/SI standard data storage units - show the address in bytes - show address as LBA:OFFSET - convert CHS to LBA and *vice versa* - show binary, decimal and hex representation of a number - custom sector size, max heads/cylinder and max sectors/track - minimal dependencies ## Installation ### Dependencies `bcal` is written in C and depends on standard libc and [GCC libquadmath](https://gcc.gnu.org/onlinedocs/libquadmath/). ### Get the source code If you have git installed, run: $ git clone https://github.com/jarun/bcal Otherwise, download the latest [stable release](https://github.com/jarun/bcal/releases/latest) or [development version](https://github.com/jarun/bcal/archive/master.zip). ### Compile and install In the source directory, run: $ make $ sudo make install To uninstall, run: $ sudo make uninstall ### Installing with a package manager `bcal` is also available on - [AUR](https://aur.archlinux.org/packages/bcal/) - [Debian Sid](https://packages.debian.org/sid/bcal) - [Ubuntu](http://packages.ubuntu.com/search?keywords=bcal&searchon=names&exact=1) - [Ubuntu PPA](https://launchpad.net/~twodopeshaggy/+archive/ubuntu/jarun/) ### RPMs If you are on Fedora 24 or CentOS 7, visit [the latest stable release](https://github.com/jarun/bcal/releases/latest) and download the `.rpm` package for your OS. ## Usage ### cmdline options usage: bcal [-c N] [-f FORMAT] [-s bytes] [-h] [N unit] Perform storage conversions and calculations. positional arguments: N unit capacity in B/KiB/MiB/GiB/TiB/kB/MB/GB/TB see https://wiki.ubuntu.com/UnitsPolicy must be space-separated, case is ignored N can be decimal or '0x' prefixed hex value optional arguments: -c N show N in binary, decimal and hex -f FORMAT convert CHS to LBA or LBA to CHS formats are hyphen-separated LBA format: starts with 'l': lLBA-MAX_HEAD-MAX_SECTOR CHS format: starts with 'c': cC-H-S-MAX_HEAD-MAX_SECTOR omitted values are considered 0 FORMAT 'c-50--0x12-' denotes: C = 0, H = 50, S = 0, MH = 0x12, MS = 0 FORMAT 'l50-0x12' denotes: LBA = 50, MH = 0x12, MS = 0 default MAX_HEAD: 16, default MAX_SECTOR: 63 -s bytes sector size [default 512] -h show this help and exit ### Operational notes - **N unit**: `N` can be a decimal or '0x' prefixed hex value. `unit` can be B/KiB/MiB/GiB/TiB/kB/MB/GB/TB following Ubuntu policy. As all of these tokens are unique, `unit` is case-insensitive. `N` and `unit` must be space-separated. - Decimal and hex **numeric representations** are recognized for unit conversions. Decimal, hex, binary and octal are recognized for all other operations. - **Syntax**: Prefix hex inputs with `0x`, binary inputs with `0b`, octal inputs with `00`. - **No negative arguments** allowed. Input limits are `unsigned long long` and `double`. - **Fractional bytes do not exist**, because they can't be addressed. `bcal` shows the floor value of non-integer bytes. - **CHS and LBA syntax**: - LBA: `lLBA-MAX_HEAD-MAX_SECTOR` [NOTE: LBA starts with `l` (case ignored)] - CHS: `cC-H-S-MAX_HEAD-MAX_SECTOR` [NOTE: CHS starts with `c` (case ignored)] - Format conversion arguments must be hyphen separated. - Any unspecified value, including the one preceding the first `-` to the one following the last `-`, is considered `0` (zero). - **Default values**: - sector size: 0x200 (512) - max heads per cylinder: 0x10 (16) - max sectors per track: 0x3f (63) ## Examples 1. Convert storage capacity to other units and get address, LBA. $ bcal 20140115 b $ bcal 0x1335053 B $ bcal 0xaabbcc kb $ bcal 0xdef Gib Note that the units are case-insensitive. 2. Convert storage capacity, set sector size to 4096 to calculate LBA. $ bcal 0xaabbcc kb -s 4096 3. Convert LBA to CHS. $ bcal -f l500 $ bcal -f l0x600-18-0x7e $ bcal -f l0x300-0x12-0x7e 4. Convert CHS to LBA. $ bcal -f c10-10-10 $ bcal -f c0x10-0x10-0x10 $ bcal -f c0x10-10-2-0x12 $ bcal -f c-10-2-0x12 $ bcal -f c0x10-10--0x12 5. Show binary, decimal and hex representations of a number. $ bcal -c 20140115 $ bcal -c 0b1001100110101000001010011 $ bcal -c 0x1335053 6. Help and additional information. $ man bcal $ bcal -h ## Copyright Copyright © 2016-2017 [Arun Prakash Jana](mailto:engineerarun@gmail.com) bcal-1.5/bcal.1000066400000000000000000000077021307270572100132550ustar00rootroot00000000000000.TH "BCAL" "1" "Apr 2017" "Version 1.5" "User Commands" .SH NAME bcal \- Perform storage conversions and calculations. .SH SYNOPSIS .B bcal [-c N] [-f FORMAT] [-s bytes] [-h] .br .B " "[N unit] .SH DESCRIPTION .B bcal (Byte CALculator) is a command-line utility to help with numerical calculations involving data storage units, addressing, base conversions etc. .PP .B Features .PP * convert to IEC/SI standard data storage units * show the address in bytes * show address as LBA:OFFSET * convert CHS to LBA and vice versa * show binary, decimal and hex representation of a number * custom sector size, max heads/cylinder and max sectors/track * minimal dependencies .PP \fBbcal\fR follows Ubuntu's standard unit conversion and notation policy. Only 64-bit operating systems are supported. Refer to: .I https://wiki.ubuntu.com/UnitsPolicy .SH OPERATIONAL NOTES .PP .IP 1. 4 \fBN unit\fR: \fIN\fR can be a decimal or '0x' prefixed hex value. \fIunit\fR can be B/KiB/MiB/GiB/TiB/kB/MB/GB/TB following Ubuntu policy. As all of these tokens are unique, \fIunit\fR is case-insensitive. \fIN\fR and \fIunit\fR must be space-separated. .PP .IP 2. 4 Decimal and hex \fBnumeric representations\fR are recognized for unit conversions. Decimal, hex, binary and octal are recognized for all other operations. .PP .IP 3. 4 \fBSyntax\fR: Prefix hex inputs with '0x', binary inputs with '0b', octal inputs with '00'. .PP .IP 4. 4 \fBNo negative arguments\fR allowed. Input limits are \fIunsigned long long\fR and \fIdouble\fR. .PP .IP 5. 4 \fBFractional bytes do not exist\fR, because they can't be addressed. \fBbcal\fR shows the floor value of non-integer bytes. .PP .IP 6. 4 \fBCHS and LBA syntax\fR: - LBA: 'lLBA-MAX_HEAD-MAX_SECTOR' [NOTE: LBA starts with 'l' (case ignored)] - CHS: 'cC-H-S-MAX_HEAD-MAX_SECTOR' [NOTE: CHS starts with 'c' (case ignored)] - Format conversion arguments must be hyphen separated. - Any unspecified value, including the one preceding the first '-' to the one following the last '-', is considered '0' (zero). .PP .IP 7. 4 \fBDefault values\fR: - sector size: 0x200 (512) - max heads per cylinder: 0x10 (16) - max sectors per track: 0x3f (63) .SH OPTIONS .TP .BI "-c=" N Show decimal, binary and hex representation of \fIN\fR. \fIN\fR must be non-negative. .TP .BI "-f=" FORMAT Convert CHS to LBA or LBA to CHS. \fIFORMAT\fR is hyphen-separated representation of LBA or CHS. LBA: lLBA-MAX_HEAD-MAX_SECTOR (starts with 'l') .br CHS: cC-H-S-MAX_HEAD-MAX_SECTOR (starts with 'c') Omitted values, (other than MAX_HEAD and MAX_SECTOR) are considered 0. Default MAX_HEAD: 16, default MAX_SECTOR: 63. .TP .BI "-s=" bytes Sector size in bytes. Default value is 512. .TP .BI "-h" Show program help and exit. .SH EXAMPLES .PP .IP 1. 4 Convert storage capacity to other units and get address, LBA. .PP .EX .IP .B $ bcal 20140115 b .B $ bcal 0x1335053 B .B $ bcal 0xaabbcc kb .B $ bcal 0xdef Gib Note that the units are case-insensitive. .EE .PP .IP 2. 4 Convert storage capacity, set sector size to 4096 to calculate LBA. .PP .EX .IP .B $ bcal 0xaabbcc kb -s 4096 .EE .PP .IP 3. 4 Convert LBA to CHS. .PP .EX .IP .B $ bcal -f l500 .B $ bcal -f l0x600-18-0x7e .B $ bcal -f l0x300-0x12-0x7e .EE .PP .IP 4. 4 Convert CHS to LBA. .PP .EX .IP .B $ bcal -f c10-10-10 .B $ bcal -f c0x10-0x10-0x10 .B $ bcal -f c0x10-10-2-0x12 .B $ bcal -f c-10-2-0x12 .B $ bcal -f c0x10-10--0x12 .EE .PP .IP 5. 4 Show binary, decimal and hex representations of a number. .PP .EX .IP .B $ bcal -c 20140115 .B $ bcal -c 0b1001100110101000001010011 .B $ bcal -c 0x1335053 .SH AUTHORS Arun Prakash Jana .SH HOME .I https://github.com/jarun/bcal .SH REPORTING BUGS .I https://github.com/jarun/bcal/issues .SH LICENSE Copyright \(co 2016-2017 Arun Prakash Jana .PP License GPLv3+: GNU GPL version 3 or later . .br This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. bcal-1.5/bcal.c000066400000000000000000000425421307270572100133400ustar00rootroot00000000000000/* * Byte CALculator * * Author: Arun Prakash Jana * Copyright (C) 2016 by Arun Prakash Jana * * 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 bcal. If not, see . */ #include #include #include #include #include #define TRUE 1 #define FALSE !TRUE #define SECTOR_SIZE 512 /* 0x200 */ #define MAX_HEAD 16 /* 0x10 */ #define MAX_SECTOR 63 /* 0x3f */ #define UINT_BUF_LEN 40 /* log10(1 << 128) + '\0' */ #define FLOAT_BUF_LEN 128 #define FLOAT_WIDTH 40 #ifdef __SIZEOF_INT128__ typedef __uint128_t maxuint_t; typedef __float128 maxfloat_t; #else typedef __uint64_t maxuint_t; typedef double maxfloat_t; #endif char *VERSION = "1.5"; char *units[] = {"b", "kib", "mib", "gib", "tib", "kb", "mb", "gb", "tb"}; char uint_buf[UINT_BUF_LEN]; char float_buf[FLOAT_BUF_LEN]; typedef unsigned char bool; typedef unsigned long ulong; typedef unsigned long long ull; typedef struct { ulong c; ulong h; ulong s; } t_chs; void binprint(maxuint_t n) { int count = 127; char binstr[129] = {0}; if (!n) { fprintf(stdout, "0b0"); return; } while (n && count >= 0) { binstr[count--] = "01"[n & 1]; n >>= 1; } count++; fprintf(stdout, "0b%s", binstr + count); } char *getstr_u128(maxuint_t n, char *buf) { if (n == 0) { buf[0] = '0'; buf[1] = '\0'; return buf; } memset(buf, 0, UINT_BUF_LEN); char *loc = buf + UINT_BUF_LEN - 1; /* start at the end */ while (n != 0) { if (loc == buf) return NULL; /* should not happen */ *--loc = "0123456789"[n % 10]; /* save the last digit */ n /= 10; /* drop the last digit */ } return loc; } char *getstr_f128(maxfloat_t val, char *buf) { int n = quadmath_snprintf(buf, FLOAT_BUF_LEN, "%#*.10Qe", FLOAT_WIDTH, val); buf[n] = '\0'; return buf; } void printval(maxfloat_t val, char *unit) { if (val - (maxuint_t)val == 0) fprintf(stdout, "%40s %s\n", getstr_u128((maxuint_t)val, uint_buf), unit); else fprintf(stdout, "%s %s\n", getstr_f128(val, float_buf), unit); } void printhex_u128(maxuint_t n) { ull high = (ull)(n >> (sizeof(maxuint_t) << 2)); if (high) fprintf(stdout, "0x%llx%llx", high, (ull)n); else fprintf(stdout, "0x%llx", (ull)n); } char *strtolower(char *buf) { char *p = buf; for (; *p; ++p) *p = tolower(*p); return buf; } /* This function adds check for binary input to strtoul() */ ulong strtoul_b(char *token) { int base = 0; /* NOTE: no NULL check here! */ if (strlen(token) > 2 && token[0] == '0' && (token[1] == 'b' || token[1] == 'B')) { base = 2; } return strtoul(token + base, NULL, base); } /* This function adds check for binary input to strtoull() */ ull strtoull_b(char *token) { int base = 0; /* NOTE: no NULL check here! */ if (strlen(token) > 2 && token[0] == '0' && (token[1] == 'b' || token[1] == 'B')) { base = 2; } return strtoull(token + base, NULL, base); } maxuint_t convertbyte(char *buf) { /* Convert and print in bytes */ maxuint_t bytes = strtoull(buf, NULL, 0); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); /* Convert and print in IEC standard units */ fprintf(stdout, "\n IEC standard (base 2)\n\n"); maxfloat_t val = bytes / (maxfloat_t)1024; printval(val, "KiB"); val = bytes / (maxfloat_t)(1 << 20); printval(val, "MiB"); val = bytes / (maxfloat_t)(1 << 30); printval(val, "GiB"); val = bytes / (maxfloat_t)((maxuint_t)1 << 40); printval(val, "TiB"); /* Convert and print in SI standard values */ fprintf(stdout, "\n SI standard (base 10)\n\n"); val = bytes / (maxfloat_t)1000; printval(val, "kB"); val = bytes / (maxfloat_t)1000000; printval(val, "MB"); val = bytes / (maxfloat_t)1000000000; printval(val, "GB"); val = bytes / (maxfloat_t)1000000000000; printval(val, "TB"); return bytes; } maxuint_t convertkib(char *buf) { maxfloat_t kib = strtod(buf, NULL); maxuint_t bytes = (maxuint_t)(kib * 1024); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); fprintf(stdout, "\n IEC standard (base 2)\n\n"); printval(kib, "KiB"); maxfloat_t val = kib / 1024; printval(val, "MiB"); val = kib / (1 << 20); printval(val, "GiB"); val = kib / (1 << 30); printval(val, "TiB"); fprintf(stdout, "\n SI standard (base 10)\n\n"); val = kib * 1024 / 1000; printval(val, "kB"); val = kib * 1024 / 1000000; printval(val, "MB"); val = kib * 1024 / 1000000000; printval(val, "GB"); val = kib * 1024 / 1000000000000; printval(val, "TB"); return bytes; } maxuint_t convertmib(char *buf) { maxfloat_t mib = strtod(buf, NULL); maxuint_t bytes = (maxuint_t)(mib * (1 << 20)); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); fprintf(stdout, "\n IEC standard (base 2)\n\n"); maxfloat_t val = mib * 1024; printval(val, "KiB"); printval(mib, "MiB"); val = mib / 1024; printval(val, "GiB"); val = mib / (1 << 20); printval(val, "TiB"); fprintf(stdout, "\n SI standard (base 10)\n\n"); val = mib * (1 << 20)/ 1000; printval(val, "kB"); val = mib * (1 << 20) / 1000000; printval(val, "MB"); val = mib * (1 << 20) / 1000000000; printval(val, "GB"); val = mib * (1 << 20) / 1000000000000; printval(val, "TB"); return bytes; } maxuint_t convertgib(char *buf) { maxfloat_t gib = strtod(buf, NULL); maxuint_t bytes = (maxuint_t)(gib * (1 << 30)); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); fprintf(stdout, "\n IEC standard (base 2)\n\n"); maxfloat_t val = gib * (1 << 20); printval(val, "KiB"); val = gib * 1024; printval(val, "MiB"); printval(gib, "GiB"); val = gib / 1024; printval(val, "TiB"); fprintf(stdout, "\n SI standard (base 10)\n\n"); val = gib * (1 << 30)/ 1000; printval(val, "kB"); val = gib * (1 << 30) / 1000000; printval(val, "MB"); val = gib * (1 << 30) / 1000000000; printval(val, "GB"); val = gib * (1 << 30) / 1000000000000; printval(val, "TB"); return bytes; } maxuint_t converttib(char *buf) { maxfloat_t tib = strtod(buf, NULL); maxuint_t bytes = (maxuint_t)(tib * ((maxuint_t)1 << 40)); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); fprintf(stdout, "\n IEC standard (base 2)\n\n"); maxfloat_t val = tib * (1 << 30); printval(val, "KiB"); val = tib * (1 << 20); printval(val, "MiB"); val = tib * 1024; printval(val, "GiB"); printval(tib, "TiB"); fprintf(stdout, "\n SI standard (base 10)\n\n"); val = tib * ((maxuint_t)1 << 40)/ 1000; printval(val, "kB"); val = tib * ((maxuint_t)1 << 40) / 1000000; printval(val, "MB"); val = tib * ((maxuint_t)1 << 40) / 1000000000; printval(val, "GB"); val = tib * ((maxuint_t)1 << 40) / 1000000000000; printval(val, "TB"); return bytes; } maxuint_t convertkb(char *buf) { maxfloat_t kb = strtod(buf, NULL); maxuint_t bytes = (maxuint_t)(kb * 1000); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); fprintf(stdout, "\n IEC standard (base 2)\n\n"); maxfloat_t val = kb * 1000 / 1024; printval(val, "KiB"); val = kb * 1000 / (1 << 20); printval(val, "MiB"); val = kb * 1000 / (1 << 30); printval(val, "GiB"); val = kb * 1000 / ((maxuint_t)1 << 40); printval(val, "TiB"); fprintf(stdout, "\n SI standard (base 10)\n\n"); printval(kb, "kB"); val = kb / 1000; printval(val, "MB"); val = kb / 1000000; printval(val, "GB"); val = kb / 1000000000; printval(val, "TB"); return bytes; } maxuint_t convertmb(char *buf) { maxfloat_t mb = strtod(buf, NULL); maxuint_t bytes = (maxuint_t)(mb * 1000000); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); fprintf(stdout, "\n IEC standard (base 2)\n\n"); maxfloat_t val = mb * 1000000 / 1024; printval(val, "KiB"); val = mb * 1000000 / (1 << 20); printval(val, "MiB"); val = mb * 1000000 / (1 << 30); printval(val, "GiB"); val = mb * 1000000 / ((maxuint_t)1 << 40); printval(val, "TiB"); fprintf(stdout, "\n SI standard (base 10)\n\n"); val = mb * 1000; printval(val, "kB"); printval(mb, "MB"); val = mb / 1000; printval(val, "GB"); val = mb / 1000000; printval(val, "TB"); return bytes; } maxuint_t convertgb(char *buf) { maxfloat_t gb = strtod(buf, NULL); maxuint_t bytes = (maxuint_t)(gb * 1000000000); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); fprintf(stdout, "\n IEC standard (base 2)\n\n"); maxfloat_t val = gb * 1000000000 / 1024; printval(val, "KiB"); val = gb * 1000000000 / (1 << 20); printval(val, "MiB"); val = gb * 1000000000 / (1 << 30); printval(val, "GiB"); val = gb * 1000000000 / ((maxuint_t)1 << 40); printval(val, "TiB"); fprintf(stdout, "\n SI standard (base 10)\n\n"); val = gb * 1000000; printval(val, "kB"); val = gb * 1000; printval(val, "MB"); printval(gb, "GB"); val = gb / 1000; printval(val, "TB"); return bytes; } maxuint_t converttb(char *buf) { maxfloat_t tb = strtod(buf, NULL); maxuint_t bytes = (__uint128_t)(tb * 1000000000000); fprintf(stdout, "%40s B\n", getstr_u128(bytes, uint_buf)); fprintf(stdout, "\n IEC standard (base 2)\n\n"); maxfloat_t val = tb * 1000000000000 / 1024; printval(val, "KiB"); val = tb * 1000000000000 / (1 << 20); printval(val, "MiB"); val = tb * 1000000000000 / (1 << 30); printval(val, "GiB"); val = tb * 1000000000000 / ((maxuint_t)1 << 40); printval(val, "TiB"); fprintf(stdout, "\n SI standard (base 10)\n\n"); val = tb * 1000000000; printval(val, "kB"); val = tb * 1000000; printval(val, "MB"); val = tb * 1000; printval(val, "GB"); printval(tb, "TB"); return bytes; } bool chs2lba(char *chs, maxuint_t *lba) { int token_no = 0; char *ptr, *token; ulong chsparam[5] = {0, 0, 0, MAX_HEAD, MAX_SECTOR}; ptr = token = chs; while (*ptr && token_no < 5) { if (*ptr == '-') { /* Replace '-' with NULL and get the token */ *ptr = '\0'; chsparam[token_no++] = strtoul_b(token); /* Restore the '-' */ *ptr++ = '-'; /* Point to start of next token */ token = ptr; if (*ptr == '\0' && token_no < 5) chsparam[token_no++] = strtoul_b(token); continue; } ptr++; if (*ptr == '\0' && token_no < 5) chsparam[token_no++] = strtoul_b(token); } /* Fail if CHS is omitted */ if (token_no < 3) { fprintf(stderr, "CHS2LBA: CHS missing\n"); return FALSE; } if (!chsparam[3]) { fprintf(stderr, "CHS2LBA: MAX_HEAD = 0\n"); return FALSE; } if (!chsparam[4]) { fprintf(stderr, "CHS2LBA: MAX_SECTOR = 0\n"); return FALSE; } if (!chsparam[2]) { fprintf(stderr, "CHS2LBA: S = 0\n"); return FALSE; } if (chsparam[1] > chsparam[3]) { fprintf(stderr, "CHS2LBA: H > MAX_HEAD\n"); return FALSE; } if (chsparam[2] > chsparam[4]) { fprintf(stderr, "CHS2LBA: S > MAX_SECTOR\n"); return FALSE; } *lba = chsparam[3] * chsparam[4] * chsparam[0]; /* MH * MS * C */ *lba += chsparam[4] * chsparam[1]; /* MS * H */ *lba += chsparam[2] - 1; /* S - 1 */ fprintf(stdout, "\033[1mCHS2LBA\033[0m\n\tC %lu H %lu S %lu MAX_HEAD %lu MAX_SECTOR %lu\n", chsparam[0], chsparam[1], chsparam[2], chsparam[3], chsparam[4]); return TRUE; } bool lba2chs(char *lba, t_chs *p_chs) { int token_no = 0; char *ptr, *token; maxuint_t chsparam[3] = {0, MAX_HEAD, MAX_SECTOR}; ptr = token = lba; while (*ptr && token_no < 3) { if (*ptr == '-') { *ptr = '\0'; chsparam[token_no++] = strtoull_b(token); *ptr++ = '-'; token = ptr; if (*ptr == '\0' && token_no < 3) chsparam[token_no++] = strtoull_b(token); continue; } ptr++; if (*ptr == '\0' && token_no < 3) chsparam[token_no++] = strtoull_b(token); } /* Fail if LBA is omitted */ if (!token_no) { fprintf(stderr, "LBA2CHS: LBA missing\n"); return FALSE; } if (!chsparam[1]) { fprintf(stderr, "LBA2CHS: MAX_HEAD = 0\n"); return FALSE; } if (!chsparam[2]) { fprintf(stderr, "LBA2CHS: MAX_SECTOR = 0\n"); return FALSE; } p_chs->c = (ulong)(chsparam[0] / (chsparam[2] * chsparam[1])); /* L / (MS * MH) */ p_chs->h = (ulong)((chsparam[0] / chsparam[2]) % chsparam[1]); /* (L / MS) % MH */ if (p_chs->h > MAX_HEAD) { fprintf(stderr, "LBA2CHS: H > MAX_HEAD\n"); return FALSE; } p_chs->s = (ulong)((chsparam[0] % chsparam[2]) + 1); /* (L % MS) + 1 */ if (p_chs->s > MAX_SECTOR) { fprintf(stderr, "LBA2CHS: S > MAX_SECTOR\n"); return FALSE; } fprintf(stdout, "\033[1mLBA2CHS\033[0m\n\tLBA %s ", getstr_u128(chsparam[0], uint_buf)); fprintf(stdout, "MAX_HEAD %s ", getstr_u128(chsparam[1], uint_buf)); fprintf(stdout, "MAX_SECTOR %s\n", getstr_u128(chsparam[2], uint_buf)); return TRUE; } void usage() { fprintf(stdout, "usage: bcal [-c N] [-f FORMAT] [-s bytes] [-h]\n\ [N unit]\n\n\ Perform storage conversions and calculations.\n\n\ positional arguments:\n\ N unit capacity in B/KiB/MiB/GiB/TiB/kB/MB/GB/TB\n\ see https://wiki.ubuntu.com/UnitsPolicy\n\ must be space-separated, case is ignored\n\ N can be decimal or '0x' prefixed hex value\n\n\ optional arguments:\n\ -c N show N in binary, decimal and hex\n\ -f FORMAT convert CHS to LBA or LBA to CHS\n\ formats are hyphen-separated\n\ LBA format:\n\ starts with 'l':\n\ lLBA-MAX_HEAD-MAX_SECTOR\n\ CHS format:\n\ starts with 'c':\n\ cC-H-S-MAX_HEAD-MAX_SECTOR\n\ omitted values are considered 0\n\ FORMAT 'c-50--0x12-' denotes:\n\ C = 0, H = 50, S = 0, MH = 0x12, MS = 0\n\ FORMAT 'l50-0x12' denotes:\n\ LBA = 50, MH = 0x12, MS = 0\n\ default MAX_HEAD: 16, default MAX_SECTOR: 63\n\ -s bytes sector size [default 512]\n\ -h show this help and exit\n\n\ Version %s\n\ Copyright © 2016-2017 Arun Prakash Jana \n\ License: GPLv3\n\ Webpage: https://github.com/jarun/bcal\n", VERSION); } int main(int argc, char **argv) { int opt = 0; ulong sectorsize = SECTOR_SIZE; opterr = 0; while ((opt = getopt(argc, argv, "c:f:hs:")) != -1) { switch (opt) { case 'c': if (*optarg == '-') { fprintf(stderr, "N must be >= 0\n"); return 1; } fprintf(stdout, "\033[1mBASE CONVERSION\033[0m\n"); maxuint_t val = strtoull_b(optarg); fprintf(stdout, "\tbin: "); binprint(val); fprintf(stdout, "\n\tdec: %s\n\thex: ", getstr_u128(val, uint_buf)); printhex_u128(val); fprintf(stdout, "\n\n"); break; case 'f': if (tolower(*optarg) == 'c') { maxuint_t lba = 0; if (chs2lba(optarg + 1, &lba)) { fprintf(stdout, "\tLBA: (dec) %s, (hex) ", getstr_u128(lba, uint_buf)); printhex_u128(lba); fprintf(stdout, "\n\n"); } else fprintf(stderr, "Invalid input\n"); } else if (tolower(*optarg) == 'l') { t_chs chs; if (lba2chs(optarg + 1, &chs)) fprintf(stdout, "\tCHS: (dec) %lu %lu %lu, (hex) 0x%lx 0x%lx 0x%lx\n\n", chs.c, chs.h, chs.s, chs.c, chs.h, chs.s); else fprintf(stderr, "Invalid input\n"); } else fprintf(stderr, "Invalid input\n"); break; case 's': if (*optarg == '-') { fprintf(stderr, "sector size must be +ve\n"); return 1; } sectorsize = strtoul_b(optarg); break; case 'h': usage(); return 0; default: usage(); return 1; } } if (argc - optind == 1 || (argc == 1 && optind == 1)) { usage(); return 1; } if (argc - optind == 2) { int count = sizeof(units)/sizeof(*units); maxuint_t bytes = 0, lba = 0, offset = 0; while (count-- > 0) if (!strcmp(units[count], strtolower(argv[optind + 1]))) break; if (count == -1) { fprintf(stderr, "No matching unit\n"); return 1; } fprintf(stdout, "\033[1mUNIT CONVERSION\033[0m\n"); switch (count) { case 0: bytes = convertbyte(argv[optind]); break; case 1: bytes = convertkib(argv[optind]); break; case 2: bytes = convertmib(argv[optind]); break; case 3: bytes = convertgib(argv[optind]); break; case 4: bytes = converttib(argv[optind]); break; case 5: bytes = convertkb(argv[optind]); break; case 6: bytes = convertmb(argv[optind]); break; case 7: bytes = convertgb(argv[optind]); break; case 8: bytes = converttb(argv[optind]); break; default: fprintf(stderr, "Unknown unit\n"); return 1; } fprintf(stdout, "\n ADDRESS\n\tdec: %s\n\thex: ", getstr_u128(bytes, uint_buf)); printhex_u128(bytes); /* Calculate LBA and offset */ lba = bytes / sectorsize; offset = bytes % sectorsize; fprintf(stdout, "\n\n LBA:OFFSET\n\tsector size: 0x%lx\n", sectorsize); /* We use a global buffer, so print decimal lba first, then offset */ fprintf(stdout, "\n\tdec: %s:", getstr_u128(lba, uint_buf)); fprintf(stdout, "%s\n\thex: ", getstr_u128(offset, uint_buf)); printhex_u128(lba); fprintf(stdout, ":"); printhex_u128(offset); fprintf(stdout, "\n"); } return 0; } bcal-1.5/build-docker000077500000000000000000000015721307270572100145630ustar00rootroot00000000000000#!/bin/bash set -xe if [[ $# -ne 2 ]]; then echo "Usage: $0 " exit 1 fi os_type="$1" os_version="$2" docker_args="-e OS_TYPE=$os_type -e OS_VERSION=$os_version -v $(pwd):/build:rw --rm=true" case $os_type in centos|fedora) # check for correct package manager if [[ $os_type == "fedora" ]]; then YUM=dnf else YUM=yum fi # set up the docker image with a baseline cat >Dockerfile < - 1.1-1 - Initial RPM bcal-1.5/redhat/build-rpm000077500000000000000000000012231307270572100153520ustar00rootroot00000000000000#!/bin/bash set -xe # create the rpm tree rpmdir=$(mktemp -d) install -d -m0755 $rpmdir/{BUILD,BUILDROOT,RPMS/$(uname -m),SOURCES,SPECS,SRPMS} # copy the sources into place cp redhat/bcal.spec $rpmdir/SPECS/bcal.spec vers=$(git describe --always | sed 's/^v//' | tr - .) sed -i -e "s/Version:\s*\(\S\+\)/Version: $vers/" $rpmdir/SPECS/bcal.spec git archive --prefix=bcal-$vers/ --format=tar.gz -o $rpmdir/SOURCES/bcal-$vers.tar.gz HEAD # do the build ( cd $rpmdir/SPECS && rpmbuild --define="%_topdir $rpmdir" -ba bcal.spec ) # retreive the artifacts mkdir -p dist cp $rpmdir/{SRPMS,RPMS/*}/*.rpm dist/ # clean up rm -rf $rpmdir # vim: et:ai:ts=4:sw=4