diff --git a/programs/other/TinyHashView/BUILD_KEX.SH b/programs/other/TinyHashView/BUILD_KEX.SH
new file mode 100644
index 0000000000..8c17266fda
--- /dev/null
+++ b/programs/other/TinyHashView/BUILD_KEX.SH
@@ -0,0 +1,2 @@
+#SHS
+/kolibrios/develop/tcc/tcc algorithms/md5.c algorithms/sha1.c algorithms/sha256.c thashview.c -o thashview -lck
diff --git a/programs/other/TinyHashView/LICENSE b/programs/other/TinyHashView/LICENSE
new file mode 100644
index 0000000000..f288702d2f
--- /dev/null
+++ b/programs/other/TinyHashView/LICENSE
@@ -0,0 +1,674 @@
+ 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
+.
diff --git a/programs/other/TinyHashView/algorithms/md5.c b/programs/other/TinyHashView/algorithms/md5.c
new file mode 100644
index 0000000000..e67f840dd5
--- /dev/null
+++ b/programs/other/TinyHashView/algorithms/md5.c
@@ -0,0 +1,189 @@
+/*********************************************************************
+* Filename: md5.c
+* Author: Brad Conte (brad AT bradconte.com)
+* Copyright:
+* Disclaimer: This code is presented "as is" without any guarantees.
+* Details: Implementation of the MD5 hashing algorithm.
+ Algorithm specification can be found here:
+ * http://tools.ietf.org/html/rfc1321
+ This implementation uses little endian byte order.
+*********************************************************************/
+
+/*************************** HEADER FILES ***************************/
+#include
+#include
+#include "md5.h"
+
+/****************************** MACROS ******************************/
+#define ROTLEFT(a,b) ((a << b) | (a >> (32-b)))
+
+#define F(x,y,z) ((x & y) | (~x & z))
+#define G(x,y,z) ((x & z) | (y & ~z))
+#define H(x,y,z) (x ^ y ^ z)
+#define I(x,y,z) (y ^ (x | ~z))
+
+#define FF(a,b,c,d,m,s,t) { a += F(b,c,d) + m + t; \
+ a = b + ROTLEFT(a,s); }
+#define GG(a,b,c,d,m,s,t) { a += G(b,c,d) + m + t; \
+ a = b + ROTLEFT(a,s); }
+#define HH(a,b,c,d,m,s,t) { a += H(b,c,d) + m + t; \
+ a = b + ROTLEFT(a,s); }
+#define II(a,b,c,d,m,s,t) { a += I(b,c,d) + m + t; \
+ a = b + ROTLEFT(a,s); }
+
+/*********************** FUNCTION DEFINITIONS ***********************/
+void md5_transform(MD5_CTX *ctx, const BYTE data[])
+{
+ WORD a, b, c, d, m[16], i, j;
+
+ // MD5 specifies big endian byte order, but this implementation assumes a little
+ // endian byte order CPU. Reverse all the bytes upon input, and re-reverse them
+ // on output (in md5_final()).
+ for (i = 0, j = 0; i < 16; ++i, j += 4)
+ m[i] = (data[j]) + (data[j + 1] << 8) + (data[j + 2] << 16) + (data[j + 3] << 24);
+
+ a = ctx->state[0];
+ b = ctx->state[1];
+ c = ctx->state[2];
+ d = ctx->state[3];
+
+ FF(a,b,c,d,m[0], 7,0xd76aa478);
+ FF(d,a,b,c,m[1], 12,0xe8c7b756);
+ FF(c,d,a,b,m[2], 17,0x242070db);
+ FF(b,c,d,a,m[3], 22,0xc1bdceee);
+ FF(a,b,c,d,m[4], 7,0xf57c0faf);
+ FF(d,a,b,c,m[5], 12,0x4787c62a);
+ FF(c,d,a,b,m[6], 17,0xa8304613);
+ FF(b,c,d,a,m[7], 22,0xfd469501);
+ FF(a,b,c,d,m[8], 7,0x698098d8);
+ FF(d,a,b,c,m[9], 12,0x8b44f7af);
+ FF(c,d,a,b,m[10],17,0xffff5bb1);
+ FF(b,c,d,a,m[11],22,0x895cd7be);
+ FF(a,b,c,d,m[12], 7,0x6b901122);
+ FF(d,a,b,c,m[13],12,0xfd987193);
+ FF(c,d,a,b,m[14],17,0xa679438e);
+ FF(b,c,d,a,m[15],22,0x49b40821);
+
+ GG(a,b,c,d,m[1], 5,0xf61e2562);
+ GG(d,a,b,c,m[6], 9,0xc040b340);
+ GG(c,d,a,b,m[11],14,0x265e5a51);
+ GG(b,c,d,a,m[0], 20,0xe9b6c7aa);
+ GG(a,b,c,d,m[5], 5,0xd62f105d);
+ GG(d,a,b,c,m[10], 9,0x02441453);
+ GG(c,d,a,b,m[15],14,0xd8a1e681);
+ GG(b,c,d,a,m[4], 20,0xe7d3fbc8);
+ GG(a,b,c,d,m[9], 5,0x21e1cde6);
+ GG(d,a,b,c,m[14], 9,0xc33707d6);
+ GG(c,d,a,b,m[3], 14,0xf4d50d87);
+ GG(b,c,d,a,m[8], 20,0x455a14ed);
+ GG(a,b,c,d,m[13], 5,0xa9e3e905);
+ GG(d,a,b,c,m[2], 9,0xfcefa3f8);
+ GG(c,d,a,b,m[7], 14,0x676f02d9);
+ GG(b,c,d,a,m[12],20,0x8d2a4c8a);
+
+ HH(a,b,c,d,m[5], 4,0xfffa3942);
+ HH(d,a,b,c,m[8], 11,0x8771f681);
+ HH(c,d,a,b,m[11],16,0x6d9d6122);
+ HH(b,c,d,a,m[14],23,0xfde5380c);
+ HH(a,b,c,d,m[1], 4,0xa4beea44);
+ HH(d,a,b,c,m[4], 11,0x4bdecfa9);
+ HH(c,d,a,b,m[7], 16,0xf6bb4b60);
+ HH(b,c,d,a,m[10],23,0xbebfbc70);
+ HH(a,b,c,d,m[13], 4,0x289b7ec6);
+ HH(d,a,b,c,m[0], 11,0xeaa127fa);
+ HH(c,d,a,b,m[3], 16,0xd4ef3085);
+ HH(b,c,d,a,m[6], 23,0x04881d05);
+ HH(a,b,c,d,m[9], 4,0xd9d4d039);
+ HH(d,a,b,c,m[12],11,0xe6db99e5);
+ HH(c,d,a,b,m[15],16,0x1fa27cf8);
+ HH(b,c,d,a,m[2], 23,0xc4ac5665);
+
+ II(a,b,c,d,m[0], 6,0xf4292244);
+ II(d,a,b,c,m[7], 10,0x432aff97);
+ II(c,d,a,b,m[14],15,0xab9423a7);
+ II(b,c,d,a,m[5], 21,0xfc93a039);
+ II(a,b,c,d,m[12], 6,0x655b59c3);
+ II(d,a,b,c,m[3], 10,0x8f0ccc92);
+ II(c,d,a,b,m[10],15,0xffeff47d);
+ II(b,c,d,a,m[1], 21,0x85845dd1);
+ II(a,b,c,d,m[8], 6,0x6fa87e4f);
+ II(d,a,b,c,m[15],10,0xfe2ce6e0);
+ II(c,d,a,b,m[6], 15,0xa3014314);
+ II(b,c,d,a,m[13],21,0x4e0811a1);
+ II(a,b,c,d,m[4], 6,0xf7537e82);
+ II(d,a,b,c,m[11],10,0xbd3af235);
+ II(c,d,a,b,m[2], 15,0x2ad7d2bb);
+ II(b,c,d,a,m[9], 21,0xeb86d391);
+
+ ctx->state[0] += a;
+ ctx->state[1] += b;
+ ctx->state[2] += c;
+ ctx->state[3] += d;
+}
+
+void md5_init(MD5_CTX *ctx)
+{
+ ctx->datalen = 0;
+ ctx->bitlen = 0;
+ ctx->state[0] = 0x67452301;
+ ctx->state[1] = 0xEFCDAB89;
+ ctx->state[2] = 0x98BADCFE;
+ ctx->state[3] = 0x10325476;
+}
+
+void md5_update(MD5_CTX *ctx, const BYTE data[], size_t len)
+{
+ size_t i;
+
+ for (i = 0; i < len; ++i) {
+ ctx->data[ctx->datalen] = data[i];
+ ctx->datalen++;
+ if (ctx->datalen == 64) {
+ md5_transform(ctx, ctx->data);
+ ctx->bitlen += 512;
+ ctx->datalen = 0;
+ }
+ }
+}
+
+void md5_final(MD5_CTX *ctx, BYTE hash[])
+{
+ size_t i;
+
+ i = ctx->datalen;
+
+ // Pad whatever data is left in the buffer.
+ if (ctx->datalen < 56) {
+ ctx->data[i++] = 0x80;
+ while (i < 56)
+ ctx->data[i++] = 0x00;
+ }
+ else if (ctx->datalen >= 56) {
+ ctx->data[i++] = 0x80;
+ while (i < 64)
+ ctx->data[i++] = 0x00;
+ md5_transform(ctx, ctx->data);
+ memset(ctx->data, 0, 56);
+ }
+
+ // Append to the padding the total message's length in bits and transform.
+ ctx->bitlen += ctx->datalen * 8;
+ ctx->data[56] = ctx->bitlen;
+ ctx->data[57] = ctx->bitlen >> 8;
+ ctx->data[58] = ctx->bitlen >> 16;
+ ctx->data[59] = ctx->bitlen >> 24;
+ ctx->data[60] = ctx->bitlen >> 32;
+ ctx->data[61] = ctx->bitlen >> 40;
+ ctx->data[62] = ctx->bitlen >> 48;
+ ctx->data[63] = ctx->bitlen >> 56;
+ md5_transform(ctx, ctx->data);
+
+ // Since this implementation uses little endian byte ordering and MD uses big endian,
+ // reverse all the bytes when copying the final state to the output hash.
+ for (i = 0; i < 4; ++i) {
+ hash[i] = (ctx->state[0] >> (i * 8)) & 0x000000ff;
+ hash[i + 4] = (ctx->state[1] >> (i * 8)) & 0x000000ff;
+ hash[i + 8] = (ctx->state[2] >> (i * 8)) & 0x000000ff;
+ hash[i + 12] = (ctx->state[3] >> (i * 8)) & 0x000000ff;
+ }
+}
diff --git a/programs/other/TinyHashView/algorithms/md5.h b/programs/other/TinyHashView/algorithms/md5.h
new file mode 100644
index 0000000000..1370387cee
--- /dev/null
+++ b/programs/other/TinyHashView/algorithms/md5.h
@@ -0,0 +1,34 @@
+/*********************************************************************
+* Filename: md5.h
+* Author: Brad Conte (brad AT bradconte.com)
+* Copyright:
+* Disclaimer: This code is presented "as is" without any guarantees.
+* Details: Defines the API for the corresponding MD5 implementation.
+*********************************************************************/
+
+#ifndef MD5_H
+#define MD5_H
+
+/*************************** HEADER FILES ***************************/
+#include
+
+/****************************** MACROS ******************************/
+#define MD5_BLOCK_SIZE 16 // MD5 outputs a 16 byte digest
+
+/**************************** DATA TYPES ****************************/
+typedef unsigned char BYTE; // 8-bit byte
+typedef unsigned int WORD; // 32-bit word, change to "long" for 16-bit machines
+
+typedef struct {
+ BYTE data[64];
+ WORD datalen;
+ unsigned long long bitlen;
+ WORD state[4];
+} MD5_CTX;
+
+/*********************** FUNCTION DECLARATIONS **********************/
+void md5_init(MD5_CTX *ctx);
+void md5_update(MD5_CTX *ctx, const BYTE data[], size_t len);
+void md5_final(MD5_CTX *ctx, BYTE hash[]);
+
+#endif // MD5_H
diff --git a/programs/other/TinyHashView/algorithms/sha1.c b/programs/other/TinyHashView/algorithms/sha1.c
new file mode 100644
index 0000000000..a982db00df
--- /dev/null
+++ b/programs/other/TinyHashView/algorithms/sha1.c
@@ -0,0 +1,149 @@
+/*********************************************************************
+* Filename: sha1.c
+* Author: Brad Conte (brad AT bradconte.com)
+* Copyright:
+* Disclaimer: This code is presented "as is" without any guarantees.
+* Details: Implementation of the SHA1 hashing algorithm.
+ Algorithm specification can be found here:
+ * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
+ This implementation uses little endian byte order.
+*********************************************************************/
+
+/*************************** HEADER FILES ***************************/
+#include
+#include
+#include "sha1.h"
+
+/****************************** MACROS ******************************/
+#define ROTLEFT(a, b) ((a << b) | (a >> (32 - b)))
+
+/*********************** FUNCTION DEFINITIONS ***********************/
+void sha1_transform(SHA1_CTX *ctx, const BYTE data[])
+{
+ WORD a, b, c, d, e, i, j, t, m[80];
+
+ for (i = 0, j = 0; i < 16; ++i, j += 4)
+ m[i] = (data[j] << 24) + (data[j + 1] << 16) + (data[j + 2] << 8) + (data[j + 3]);
+ for ( ; i < 80; ++i) {
+ m[i] = (m[i - 3] ^ m[i - 8] ^ m[i - 14] ^ m[i - 16]);
+ m[i] = (m[i] << 1) | (m[i] >> 31);
+ }
+
+ a = ctx->state[0];
+ b = ctx->state[1];
+ c = ctx->state[2];
+ d = ctx->state[3];
+ e = ctx->state[4];
+
+ for (i = 0; i < 20; ++i) {
+ t = ROTLEFT(a, 5) + ((b & c) ^ (~b & d)) + e + ctx->k[0] + m[i];
+ e = d;
+ d = c;
+ c = ROTLEFT(b, 30);
+ b = a;
+ a = t;
+ }
+ for ( ; i < 40; ++i) {
+ t = ROTLEFT(a, 5) + (b ^ c ^ d) + e + ctx->k[1] + m[i];
+ e = d;
+ d = c;
+ c = ROTLEFT(b, 30);
+ b = a;
+ a = t;
+ }
+ for ( ; i < 60; ++i) {
+ t = ROTLEFT(a, 5) + ((b & c) ^ (b & d) ^ (c & d)) + e + ctx->k[2] + m[i];
+ e = d;
+ d = c;
+ c = ROTLEFT(b, 30);
+ b = a;
+ a = t;
+ }
+ for ( ; i < 80; ++i) {
+ t = ROTLEFT(a, 5) + (b ^ c ^ d) + e + ctx->k[3] + m[i];
+ e = d;
+ d = c;
+ c = ROTLEFT(b, 30);
+ b = a;
+ a = t;
+ }
+
+ ctx->state[0] += a;
+ ctx->state[1] += b;
+ ctx->state[2] += c;
+ ctx->state[3] += d;
+ ctx->state[4] += e;
+}
+
+void sha1_init(SHA1_CTX *ctx)
+{
+ ctx->datalen = 0;
+ ctx->bitlen = 0;
+ ctx->state[0] = 0x67452301;
+ ctx->state[1] = 0xEFCDAB89;
+ ctx->state[2] = 0x98BADCFE;
+ ctx->state[3] = 0x10325476;
+ ctx->state[4] = 0xc3d2e1f0;
+ ctx->k[0] = 0x5a827999;
+ ctx->k[1] = 0x6ed9eba1;
+ ctx->k[2] = 0x8f1bbcdc;
+ ctx->k[3] = 0xca62c1d6;
+}
+
+void sha1_update(SHA1_CTX *ctx, const BYTE data[], size_t len)
+{
+ size_t i;
+
+ for (i = 0; i < len; ++i) {
+ ctx->data[ctx->datalen] = data[i];
+ ctx->datalen++;
+ if (ctx->datalen == 64) {
+ sha1_transform(ctx, ctx->data);
+ ctx->bitlen += 512;
+ ctx->datalen = 0;
+ }
+ }
+}
+
+void sha1_final(SHA1_CTX *ctx, BYTE hash[])
+{
+ WORD i;
+
+ i = ctx->datalen;
+
+ // Pad whatever data is left in the buffer.
+ if (ctx->datalen < 56) {
+ ctx->data[i++] = 0x80;
+ while (i < 56)
+ ctx->data[i++] = 0x00;
+ }
+ else {
+ ctx->data[i++] = 0x80;
+ while (i < 64)
+ ctx->data[i++] = 0x00;
+ sha1_transform(ctx, ctx->data);
+ memset(ctx->data, 0, 56);
+ }
+
+ // Append to the padding the total message's length in bits and transform.
+ ctx->bitlen += ctx->datalen * 8;
+ ctx->data[63] = ctx->bitlen;
+ ctx->data[62] = ctx->bitlen >> 8;
+ ctx->data[61] = ctx->bitlen >> 16;
+ ctx->data[60] = ctx->bitlen >> 24;
+ ctx->data[59] = ctx->bitlen >> 32;
+ ctx->data[58] = ctx->bitlen >> 40;
+ ctx->data[57] = ctx->bitlen >> 48;
+ ctx->data[56] = ctx->bitlen >> 56;
+ sha1_transform(ctx, ctx->data);
+
+ // Since this implementation uses little endian byte ordering and MD uses big endian,
+ // reverse all the bytes when copying the final state to the output hash.
+ for (i = 0; i < 4; ++i) {
+ hash[i] = (ctx->state[0] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 4] = (ctx->state[1] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 8] = (ctx->state[2] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 12] = (ctx->state[3] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 16] = (ctx->state[4] >> (24 - i * 8)) & 0x000000ff;
+ }
+}
diff --git a/programs/other/TinyHashView/algorithms/sha1.h b/programs/other/TinyHashView/algorithms/sha1.h
new file mode 100644
index 0000000000..f32bb7c04d
--- /dev/null
+++ b/programs/other/TinyHashView/algorithms/sha1.h
@@ -0,0 +1,35 @@
+/*********************************************************************
+* Filename: sha1.h
+* Author: Brad Conte (brad AT bradconte.com)
+* Copyright:
+* Disclaimer: This code is presented "as is" without any guarantees.
+* Details: Defines the API for the corresponding SHA1 implementation.
+*********************************************************************/
+
+#ifndef SHA1_H
+#define SHA1_H
+
+/*************************** HEADER FILES ***************************/
+#include
+
+/****************************** MACROS ******************************/
+#define SHA1_BLOCK_SIZE 20 // SHA1 outputs a 20 byte digest
+
+/**************************** DATA TYPES ****************************/
+typedef unsigned char BYTE; // 8-bit byte
+typedef unsigned int WORD; // 32-bit word, change to "long" for 16-bit machines
+
+typedef struct {
+ BYTE data[64];
+ WORD datalen;
+ unsigned long long bitlen;
+ WORD state[5];
+ WORD k[4];
+} SHA1_CTX;
+
+/*********************** FUNCTION DECLARATIONS **********************/
+void sha1_init(SHA1_CTX *ctx);
+void sha1_update(SHA1_CTX *ctx, const BYTE data[], size_t len);
+void sha1_final(SHA1_CTX *ctx, BYTE hash[]);
+
+#endif // SHA1_H
diff --git a/programs/other/TinyHashView/algorithms/sha256.c b/programs/other/TinyHashView/algorithms/sha256.c
new file mode 100644
index 0000000000..196a51461c
--- /dev/null
+++ b/programs/other/TinyHashView/algorithms/sha256.c
@@ -0,0 +1,158 @@
+/*********************************************************************
+* Filename: sha256.c
+* Author: Brad Conte (brad AT bradconte.com)
+* Copyright:
+* Disclaimer: This code is presented "as is" without any guarantees.
+* Details: Implementation of the SHA-256 hashing algorithm.
+ SHA-256 is one of the three algorithms in the SHA2
+ specification. The others, SHA-384 and SHA-512, are not
+ offered in this implementation.
+ Algorithm specification can be found here:
+ * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
+ This implementation uses little endian byte order.
+*********************************************************************/
+
+/*************************** HEADER FILES ***************************/
+#include
+#include
+#include "sha256.h"
+
+/****************************** MACROS ******************************/
+#define ROTLEFT(a,b) (((a) << (b)) | ((a) >> (32-(b))))
+#define ROTRIGHT(a,b) (((a) >> (b)) | ((a) << (32-(b))))
+
+#define CH(x,y,z) (((x) & (y)) ^ (~(x) & (z)))
+#define MAJ(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
+#define EP0(x) (ROTRIGHT(x,2) ^ ROTRIGHT(x,13) ^ ROTRIGHT(x,22))
+#define EP1(x) (ROTRIGHT(x,6) ^ ROTRIGHT(x,11) ^ ROTRIGHT(x,25))
+#define SIG0(x) (ROTRIGHT(x,7) ^ ROTRIGHT(x,18) ^ ((x) >> 3))
+#define SIG1(x) (ROTRIGHT(x,17) ^ ROTRIGHT(x,19) ^ ((x) >> 10))
+
+/**************************** VARIABLES *****************************/
+static const WORD k[64] = {
+ 0x428a2f98,0x71374491,0xb5c0fbcf,0xe9b5dba5,0x3956c25b,0x59f111f1,0x923f82a4,0xab1c5ed5,
+ 0xd807aa98,0x12835b01,0x243185be,0x550c7dc3,0x72be5d74,0x80deb1fe,0x9bdc06a7,0xc19bf174,
+ 0xe49b69c1,0xefbe4786,0x0fc19dc6,0x240ca1cc,0x2de92c6f,0x4a7484aa,0x5cb0a9dc,0x76f988da,
+ 0x983e5152,0xa831c66d,0xb00327c8,0xbf597fc7,0xc6e00bf3,0xd5a79147,0x06ca6351,0x14292967,
+ 0x27b70a85,0x2e1b2138,0x4d2c6dfc,0x53380d13,0x650a7354,0x766a0abb,0x81c2c92e,0x92722c85,
+ 0xa2bfe8a1,0xa81a664b,0xc24b8b70,0xc76c51a3,0xd192e819,0xd6990624,0xf40e3585,0x106aa070,
+ 0x19a4c116,0x1e376c08,0x2748774c,0x34b0bcb5,0x391c0cb3,0x4ed8aa4a,0x5b9cca4f,0x682e6ff3,
+ 0x748f82ee,0x78a5636f,0x84c87814,0x8cc70208,0x90befffa,0xa4506ceb,0xbef9a3f7,0xc67178f2
+};
+
+/*********************** FUNCTION DEFINITIONS ***********************/
+void sha256_transform(SHA256_CTX *ctx, const BYTE data[])
+{
+ WORD a, b, c, d, e, f, g, h, i, j, t1, t2, m[64];
+
+ for (i = 0, j = 0; i < 16; ++i, j += 4)
+ m[i] = (data[j] << 24) | (data[j + 1] << 16) | (data[j + 2] << 8) | (data[j + 3]);
+ for ( ; i < 64; ++i)
+ m[i] = SIG1(m[i - 2]) + m[i - 7] + SIG0(m[i - 15]) + m[i - 16];
+
+ a = ctx->state[0];
+ b = ctx->state[1];
+ c = ctx->state[2];
+ d = ctx->state[3];
+ e = ctx->state[4];
+ f = ctx->state[5];
+ g = ctx->state[6];
+ h = ctx->state[7];
+
+ for (i = 0; i < 64; ++i) {
+ t1 = h + EP1(e) + CH(e,f,g) + k[i] + m[i];
+ t2 = EP0(a) + MAJ(a,b,c);
+ h = g;
+ g = f;
+ f = e;
+ e = d + t1;
+ d = c;
+ c = b;
+ b = a;
+ a = t1 + t2;
+ }
+
+ ctx->state[0] += a;
+ ctx->state[1] += b;
+ ctx->state[2] += c;
+ ctx->state[3] += d;
+ ctx->state[4] += e;
+ ctx->state[5] += f;
+ ctx->state[6] += g;
+ ctx->state[7] += h;
+}
+
+void sha256_init(SHA256_CTX *ctx)
+{
+ ctx->datalen = 0;
+ ctx->bitlen = 0;
+ ctx->state[0] = 0x6a09e667;
+ ctx->state[1] = 0xbb67ae85;
+ ctx->state[2] = 0x3c6ef372;
+ ctx->state[3] = 0xa54ff53a;
+ ctx->state[4] = 0x510e527f;
+ ctx->state[5] = 0x9b05688c;
+ ctx->state[6] = 0x1f83d9ab;
+ ctx->state[7] = 0x5be0cd19;
+}
+
+void sha256_update(SHA256_CTX *ctx, const BYTE data[], size_t len)
+{
+ WORD i;
+
+ for (i = 0; i < len; ++i) {
+ ctx->data[ctx->datalen] = data[i];
+ ctx->datalen++;
+ if (ctx->datalen == 64) {
+ sha256_transform(ctx, ctx->data);
+ ctx->bitlen += 512;
+ ctx->datalen = 0;
+ }
+ }
+}
+
+void sha256_final(SHA256_CTX *ctx, BYTE hash[])
+{
+ WORD i;
+
+ i = ctx->datalen;
+
+ // Pad whatever data is left in the buffer.
+ if (ctx->datalen < 56) {
+ ctx->data[i++] = 0x80;
+ while (i < 56)
+ ctx->data[i++] = 0x00;
+ }
+ else {
+ ctx->data[i++] = 0x80;
+ while (i < 64)
+ ctx->data[i++] = 0x00;
+ sha256_transform(ctx, ctx->data);
+ memset(ctx->data, 0, 56);
+ }
+
+ // Append to the padding the total message's length in bits and transform.
+ ctx->bitlen += ctx->datalen * 8;
+ ctx->data[63] = ctx->bitlen;
+ ctx->data[62] = ctx->bitlen >> 8;
+ ctx->data[61] = ctx->bitlen >> 16;
+ ctx->data[60] = ctx->bitlen >> 24;
+ ctx->data[59] = ctx->bitlen >> 32;
+ ctx->data[58] = ctx->bitlen >> 40;
+ ctx->data[57] = ctx->bitlen >> 48;
+ ctx->data[56] = ctx->bitlen >> 56;
+ sha256_transform(ctx, ctx->data);
+
+ // Since this implementation uses little endian byte ordering and SHA uses big endian,
+ // reverse all the bytes when copying the final state to the output hash.
+ for (i = 0; i < 4; ++i) {
+ hash[i] = (ctx->state[0] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 4] = (ctx->state[1] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 8] = (ctx->state[2] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 12] = (ctx->state[3] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 16] = (ctx->state[4] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 20] = (ctx->state[5] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 24] = (ctx->state[6] >> (24 - i * 8)) & 0x000000ff;
+ hash[i + 28] = (ctx->state[7] >> (24 - i * 8)) & 0x000000ff;
+ }
+}
diff --git a/programs/other/TinyHashView/algorithms/sha256.h b/programs/other/TinyHashView/algorithms/sha256.h
new file mode 100644
index 0000000000..7123a30dd4
--- /dev/null
+++ b/programs/other/TinyHashView/algorithms/sha256.h
@@ -0,0 +1,34 @@
+/*********************************************************************
+* Filename: sha256.h
+* Author: Brad Conte (brad AT bradconte.com)
+* Copyright:
+* Disclaimer: This code is presented "as is" without any guarantees.
+* Details: Defines the API for the corresponding SHA1 implementation.
+*********************************************************************/
+
+#ifndef SHA256_H
+#define SHA256_H
+
+/*************************** HEADER FILES ***************************/
+#include
+
+/****************************** MACROS ******************************/
+#define SHA256_BLOCK_SIZE 32 // SHA256 outputs a 32 byte digest
+
+/**************************** DATA TYPES ****************************/
+typedef unsigned char BYTE; // 8-bit byte
+typedef unsigned int WORD; // 32-bit word, change to "long" for 16-bit machines
+
+typedef struct {
+ BYTE data[64];
+ WORD datalen;
+ unsigned long long bitlen;
+ WORD state[8];
+} SHA256_CTX;
+
+/*********************** FUNCTION DECLARATIONS **********************/
+void sha256_init(SHA256_CTX *ctx);
+void sha256_update(SHA256_CTX *ctx, const BYTE data[], size_t len);
+void sha256_final(SHA256_CTX *ctx, BYTE hash[]);
+
+#endif // SHA256_H
diff --git a/programs/other/TinyHashView/build_kex_kossdk.bat b/programs/other/TinyHashView/build_kex_kossdk.bat
new file mode 100644
index 0000000000..a80ceeb923
--- /dev/null
+++ b/programs/other/TinyHashView/build_kex_kossdk.bat
@@ -0,0 +1,9 @@
+kos32-gcc -c -fomit-frame-pointer -ID:\KOSSDK\newlib/libc/include algorithms\md5.c -o algorithms\md5.o -Wall -Wextra
+kos32-gcc -c -fomit-frame-pointer -ID:\KOSSDK\newlib/libc/include algorithms\sha1.c -o algorithms\sha1.o -Wall -Wextra
+kos32-gcc -c -fomit-frame-pointer -ID:\KOSSDK\newlib/libc/include algorithms\sha256.c -o algorithms\sha256.o -Wall -Wextra
+kos32-gcc -c -fomit-frame-pointer -ID:\KOSSDK\newlib/libc/include thashview.c -o thashview.o -Wall -Wextra
+
+kos32-ld thashview.o algorithms\md5.o algorithms\sha1.o algorithms\sha256.o -o thashview -call_shared -nostdlib --subsystem native -T D:\KOSSDK\newlib/app-dynamic.lds --image-base 0 -L "D:\KOSSDK\kos32-msys-5.4.0\win32\lib" -lgcc -lapp -lc.dll
+kos32-objcopy thashview -O binary
+@pause
+
diff --git a/programs/other/TinyHashView/installer/ASSOC.INI b/programs/other/TinyHashView/installer/ASSOC.INI
new file mode 100644
index 0000000000..3116bdcf2e
--- /dev/null
+++ b/programs/other/TinyHashView/installer/ASSOC.INI
@@ -0,0 +1,196 @@
+[THashView]
+exec=/sys/thashview
+icon=124
+next=$Quark
+
+[Quark]
+exec=/sys/QUARK
+icon=85
+next=$TinyPad
+
+[TinyPad]
+exec=/sys/tinypad
+icon=9
+next=$TextEditor
+
+[TextEditor]
+exec=/sys/develop/t_edit
+icon=58
+next=$WebView
+
+[Run]
+exec=/sys/run
+icon=55
+
+[FB2Read]
+exec=/sys/fb2read
+icon=44
+
+[WebView]
+exec=/sys/network/webview
+icon=31
+next=$TinyPad
+
+[zSea]
+exec=/kolibrios/media/zsea/zsea
+icon=46
+next=$KIV
+
+[KIV]
+exec=/sys/media/kiv
+icon=70
+next=$Animage
+
+[Animage]
+exec=/sys/media/animage
+icon=15
+
+[Pixie]
+exec=/sys/media/pixie
+icon=65
+next=$AC97snd
+
+[DosBox]
+exec=/kolibrios/emul/dosbox/dosbox
+icon=11
+
+[FPlay]
+exec=/kolibrios/media/fplay_run
+icon=40
+
+[AC97snd]
+exec=/sys/media/ac97snd
+icon=64
+
+[HexEditor]
+exec=/sys/develop/heed
+icon=22
+
+[KPack]
+exec=/sys/kpack
+icon=99
+
+[Unz]
+exec=/sys/unz
+icon=89
+
+[IconEdit]
+exec=/sys/media/iconedit
+icon=98
+
+[Assoc]
+/=/sys/file managers/eolite
+
+kf=/sys/KF_VIEW
+
+txt=$Quark
+log=$Quark
+c=$Quark
+h=$Quark
+cpp=$Quark
+
+asm=$TinyPad
+inc=$TinyPad
+mac=$TinyPad
+inf=$TinyPad
+conf=$TinyPad
+
+ini=$TextEditor
+
+fb2=$FB2Read
+
+htm=$WebView
+html=$WebView
+mht=$WebView
+docx=$WebView
+url=$WebView
+
+avi=$FPlay
+mkv=$FPlay
+wmv=$FPlay
+vob=$FPlay
+flv=$FPlay
+mp4=$FPlay
+mpg=$FPlay
+mpeg=$FPlay
+mov=$FPlay
+webm=$FPlay
+3gp=$FPlay
+divx=$FPlay
+
+png=$KIV
+jpg=$KIV
+jpeg=$KIV
+bmp=$KIV
+
+gif=$KIV
+ico=$KIV
+cur=$KIV
+pcx=$KIV
+pbm=$KIV
+pgm=$KIV
+pnm=$KIV
+tga=$KIV
+tif=$KIV
+tiff=$KIV
+wbmp=$KIV
+xbm=$KIV
+xcf=$KIV
+z80=$KIV
+
+mp3=$Pixie
+wav=$Pixie
+xm=$Pixie
+m3u=$AC97snd
+
+lap=/sys/media/listplay
+asf=/sys/media/listplay
+
+mid=/sys/media/midamp
+midi=/sys/media/midamp
+
+rtf=/sys/rtfread
+
+csv=/sys/table
+
+grf=/sys/graph
+
+com=$DosBox
+;bat=$DosBox
+;exe=$DosBox
+
+obj=/sys/develop/cObj
+
+raw=$HeEd
+
+shell=/sys/shell
+sh=/sys/shell
+
+3ds=/sys/3d/view3ds
+asc=/sys/3d/view3ds
+
+skn=/sys/skincfg
+dtp=/sys/skincfg
+lif=/kolibrios/demos/life2
+kla=/sys/games/klavisha
+pdf=/kolibrios/media/updf
+
+smc=/kolibrios/emul/zsnes
+mcr=/kolibrios/emul/psx4all
+nes=/kolibrios/emul/fceu/fceu
+sna=/kolibrios/emul/e80/e80
+gb=/kolibrios/emul/gameboy
+gbc=/kolibrios/emul/gameboy
+min=/kolibrios/emul/pokemini
+nc=/kolibrios/utils/cnc_editor/cnc_editor
+
+zip=$Unz
+7z=$Unz
+
+img=/sys/unimg
+
+bas=/kolibrios/develop/TinyBasic/TinyBasic
+
+vox=/kolibrios/3D/voxel_editor/VOXEL_EDITOR
+
+mgb=/sys/mgb
diff --git a/programs/other/TinyHashView/installer/SETUP.SH b/programs/other/TinyHashView/installer/SETUP.SH
new file mode 100644
index 0000000000..51280a91fd
--- /dev/null
+++ b/programs/other/TinyHashView/installer/SETUP.SH
@@ -0,0 +1,6 @@
+#SHS
+echo Starting installation ...
+cp thashview /rd/1/thashview
+cp icons32.png /rd/1/icons32.png
+cp ASSOC.INI /rd/1/Settings/ASSOC.ini
+echo Completed!
diff --git a/programs/other/TinyHashView/installer/icons32.png b/programs/other/TinyHashView/installer/icons32.png
new file mode 100644
index 0000000000..ecbcac1323
Binary files /dev/null and b/programs/other/TinyHashView/installer/icons32.png differ
diff --git a/programs/other/TinyHashView/kos32sys.h b/programs/other/TinyHashView/kos32sys.h
new file mode 100644
index 0000000000..5b269573b9
--- /dev/null
+++ b/programs/other/TinyHashView/kos32sys.h
@@ -0,0 +1,802 @@
+#ifndef __KOS_32_SYS_H__
+#define __KOS_32_SYS_H__
+
+// file header taken from newlib
+// added many sys functions, compatible with tcc
+
+//#include
+//#include
+#include
+#include
+typedef unsigned int uint32_t;
+typedef int int32_t;
+typedef unsigned char uint8_t;
+typedef unsigned short int uint16_t;
+typedef unsigned long long uint64_t;
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+//#ifdef CONFIG_DEBUF
+// #define DBG(format,...) printf(format,##__VA_ARGS__)
+//#else
+// #define DBG(format,...)
+//#endif
+
+#define TYPE_3_BORDER_WIDTH 5
+#define WIN_STATE_MINIMIZED 0x02
+#define WIN_STATE_ROLLED 0x04
+#define POS_SCREEN 0
+#define POS_WINDOW 1
+
+#define IPC_NOBUFFER 1
+#define IPC_LOCKED 2
+#define IPC_OVERFLOW 3
+#define IPC_NOPID 4
+
+#define SHM_OPEN 0x00
+#define SHM_OPEN_ALWAYS 0x04
+#define SHM_CREATE 0x08
+#define SHM_READ 0x00
+#define SHM_WRITE 0x01
+
+
+
+typedef unsigned int color_t;
+
+
+typedef union __attribute__((packed)) pos_t
+{
+ uint32_t val;
+ struct
+ {
+ short x;
+ short y;
+ };
+} pos_t;
+
+
+typedef union __attribute__((packed)) oskey_t
+{
+ uint32_t val;
+ struct
+ {
+ uint8_t state;
+ uint8_t code;
+ uint16_t ctrl_key;
+ };
+} oskey_t;
+
+typedef struct
+{
+ unsigned handle;
+ unsigned io_code;
+ void *input;
+ int inp_size;
+ void *output;
+ int out_size;
+}ioctl_t;
+
+typedef union
+{
+ struct
+ {
+ void *data;
+ size_t size;
+ } x;
+ unsigned long long raw;
+}ufile_t;
+
+struct kolibri_system_colors {
+ color_t frame_area;
+ color_t grab_bar;
+ color_t grab_bar_button;
+ color_t grab_button_text;
+ color_t grab_text;
+ color_t work_area;
+ color_t work_button;
+ color_t work_button_text;
+ color_t work_text;
+ color_t work_graph;
+};
+
+
+struct blit_call
+{
+ int dstx;
+ int dsty;
+ int w;
+ int h;
+
+ int srcx;
+ int srcy;
+ int srcw;
+ int srch;
+
+ void *bitmap;
+ int stride;
+};
+
+struct ipc_message
+{
+ uint32_t pid; // PID of sending thread
+ uint32_t datalen; // data bytes
+ char data[0]; // data begin
+};
+
+struct ipc_buffer
+{
+ uint32_t lock; // nonzero is locked
+ uint32_t used; // used bytes in buffer
+ struct ipc_message data[0]; // data begin
+};
+
+static inline void begin_draw(void)
+{
+ __asm__ __volatile__(
+ "int $0x40" ::"a"(12),"b"(1));
+};
+
+static inline
+void end_draw(void)
+{
+ __asm__ __volatile__(
+ "int $0x40" ::"a"(12),"b"(2));
+};
+
+static inline
+void sys_create_window(int x, int y, int w, int h, const char *name,
+ color_t workcolor, uint32_t style)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(0),
+ "b"((x << 16) | ((w-1) & 0xFFFF)),
+ "c"((y << 16) | ((h-1) & 0xFFFF)),
+ "d"((style << 24) | (workcolor & 0xFFFFFF)),
+ "D"(name),
+ "S"(0) : "memory");
+};
+
+static inline
+void define_button(uint32_t x_w, uint32_t y_h, uint32_t id, uint32_t color)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(8),
+ "b"(x_w),
+ "c"(y_h),
+ "d"(id),
+ "S"(color));
+};
+
+static inline
+void draw_line(int xs, int ys, int xe, int ye, color_t color)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(38), "d"(color),
+ "b"((xs << 16) | xe),
+ "c"((ys << 16) | ye));
+}
+
+static inline
+void draw_bar(int x, int y, int w, int h, color_t color)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(13), "d"(color),
+ "b"((x << 16) | w),
+ "c"((y << 16) | h));
+}
+
+static inline
+void draw_bitmap(void *bitmap, int x, int y, int w, int h)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(7), "b"(bitmap),
+ "c"((w << 16) | h),
+ "d"((x << 16) | y));
+}
+
+static inline
+void draw_text_sys(const char *text, int x, int y, int len, color_t color)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(4),"d"(text),
+ "b"((x << 16) | y),
+ "S"(len),"c"(color)
+ :"memory");
+}
+
+static inline
+uint32_t get_skin_height(void)
+{
+ uint32_t height;
+
+ __asm__ __volatile__(
+ "int $0x40 \n\t"
+ :"=a"(height)
+ :"a"(48),"b"(4));
+ return height;
+};
+
+static inline
+pos_t get_mouse_pos(int origin)
+{
+ pos_t val;
+
+ __asm__ __volatile__(
+ "int $0x40 \n\t"
+ "rol $16, %%eax"
+ :"=a"(val)
+ :"a"(37),"b"(origin));
+ return val;
+}
+
+static inline
+uint32_t get_mouse_buttons(void)
+{
+ uint32_t val;
+
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(37),"b"(2));
+ return val;
+};
+
+static inline
+uint32_t get_mouse_wheels(void)
+{
+ uint32_t val;
+
+ __asm__ __volatile__(
+ "int $0x40 \n\t"
+ :"=a"(val)
+ :"a"(37),"b"(7));
+ return val;
+};
+
+static inline uint32_t load_cursor(void *path, uint32_t flags)
+{
+ uint32_t val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(37), "b"(4), "c"(path), "d"(flags));
+ return val;
+}
+
+static inline uint32_t set_cursor(uint32_t cursor)
+{
+ uint32_t old;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(old)
+ :"a"(37), "b"(5), "c"(cursor));
+ return old;
+};
+
+static inline int destroy_cursor(uint32_t cursor)
+{
+ int ret;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(ret)
+ :"a"(37), "b"(6), "c"(cursor)
+ :"memory");
+ return ret;
+};
+
+
+static inline
+uint32_t wait_for_event(uint32_t time)
+{
+ uint32_t val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(23), "b"(time));
+ return val;
+};
+
+static inline uint32_t check_os_event()
+{
+ uint32_t val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(11));
+ return val;
+};
+
+static inline uint32_t get_os_event()
+{
+ uint32_t val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(10));
+ return val;
+};
+
+static inline
+uint32_t get_tick_count(void)
+{
+ uint32_t val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(26),"b"(9));
+ return val;
+};
+
+static inline
+uint64_t get_ns_count(void)
+{
+ uint64_t val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=A"(val)
+ :"a"(26), "b"(10));
+ return val;
+};
+
+static inline
+oskey_t get_key(void)
+{
+ oskey_t val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(2));
+ return val;
+}
+
+static inline
+uint32_t get_os_button()
+{
+ uint32_t val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(17));
+ return val>>8;
+};
+
+static inline uint32_t get_service(char *name)
+{
+ uint32_t retval = 0;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(retval)
+ :"a"(68),"b"(16),"c"(name)
+ :"memory");
+
+ return retval;
+};
+
+static inline int call_service(ioctl_t *io)
+{
+ int retval;
+
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(retval)
+ :"a"(68),"b"(17),"c"(io)
+ :"memory","cc");
+
+ return retval;
+};
+
+
+static inline void yield(void)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(68), "b"(1));
+};
+
+static inline void delay(uint32_t time)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(5), "b"(time)
+ :"memory");
+};
+
+static inline
+void *user_alloc(size_t size)
+{
+ void *val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(68),"b"(12),"c"(size));
+ return val;
+}
+
+static inline
+int user_free(void *mem)
+{
+ int val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(68),"b"(13),"c"(mem));
+ return val;
+}
+
+static inline
+void* user_realloc(void *mem, size_t size)
+{
+ void *val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(68),"b"(20),"c"(size),"d"(mem)
+ :"memory");
+
+ return val;
+};
+
+static inline
+int *user_unmap(void *base, size_t offset, size_t size)
+{
+ int *val;
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(68),"b"(26),"c"(base),"d"(offset),"S"(size));
+ return val;
+};
+
+static inline ufile_t load_file(const char *path)
+{
+ ufile_t uf;
+
+ __asm__ __volatile__ (
+ "int $0x40"
+ :"=A"(uf.raw)
+ :"a" (68), "b"(27),"c"(path));
+
+ return uf;
+};
+
+static inline int GetScreenSize()
+{
+ int retval;
+
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(retval)
+ :"a"(61), "b"(1));
+ return retval;
+}
+
+
+static inline void get_proc_info(char *info)
+{
+ __asm__ __volatile__(
+ "int $0x40"
+ :
+ :"a"(9), "b"(info), "c"(-1)
+ :"memory");
+};
+
+static inline void Blit(void *bitmap, int dst_x, int dst_y,
+ int src_x, int src_y, int w, int h,
+ int src_w, int src_h, int stride)
+{
+ volatile struct blit_call bc;
+
+ bc.dstx = dst_x;
+ bc.dsty = dst_y;
+ bc.w = w;
+ bc.h = h;
+ bc.srcx = src_x;
+ bc.srcy = src_y;
+ bc.srcw = src_w;
+ bc.srch = src_h;
+ bc.stride = stride;
+ bc.bitmap = bitmap;
+
+ __asm__ __volatile__(
+ "int $0x40"
+ ::"a"(73),"b"(0),"c"(&bc.dstx));
+};
+
+
+// newlib exclusive
+#ifndef __TINYC__
+int create_thread(int (*proc)(void *param), void *param, int stack_size);
+
+void* load_library(const char *name);
+
+void* get_proc_address(void *handle, const char *proc_name);
+
+void enumerate_libraries(int (*callback)(void *handle, const char* name,
+ uint32_t base, uint32_t size, void *user_data),
+ void *user_data);
+#endif
+
+// May be next section need to be added in newlibc
+
+enum KOLIBRI_GUI_EVENTS {
+ KOLIBRI_EVENT_NONE = 0, /* Event queue is empty */
+ KOLIBRI_EVENT_REDRAW = 1, /* Window and window elements should be redrawn */
+ KOLIBRI_EVENT_KEY = 2, /* A key on the keyboard was pressed */
+ KOLIBRI_EVENT_BUTTON = 3, /* A button was clicked with the mouse */
+ KOLIBRI_EVENT_DESKTOP = 5, /* Desktop redraw finished */
+ KOLIBRI_EVENT_MOUSE = 6, /* Mouse activity (movement, button press) was detected */
+ KOLIBRI_EVENT_IPC = 7, /* Interprocess communication notify */
+ KOLIBRI_EVENT_NETWORK = 8, /* Network event */
+ KOLIBRI_EVENT_DEBUG = 9, /* Debug subsystem event */
+ KOLIBRI_EVENT_IRQBEGIN = 16 /* 16..31 IRQ0..IRQ15 interrupt =IRQBEGIN+IRQn */
+};
+
+
+// copied from /programs/system/shell/system/kolibri.c
+// fn's returned -1 as syserror, 1 as error, 0 as OK
+static inline
+int kol_clip_num()
+{
+ register uint32_t val;
+ asm volatile ("int $0x40":"=a"(val):"a"(54), "b"(0));
+ return val;
+}
+
+static inline
+char* kol_clip_get(int n)
+// returned buffer must be freed by user_free()
+{
+ register char* val;
+ asm volatile ("int $0x40":"=a"(val):"a"(54), "b"(1), "c"(n));
+ return val;
+}
+
+static inline
+int kol_clip_set(int n, char buffer[])
+{
+ register uint32_t val;
+ asm volatile ("int $0x40":"=a"(val):"a"(54), "b"(2), "c"(n), "d"(buffer));
+ return val;
+}
+
+static inline
+int kol_clip_pop()
+{
+ register uint32_t val;
+ asm volatile ("int $0x40":"=a"(val):"a"(54), "b"(3));
+ return val;
+}
+
+static inline
+int kol_clip_unlock()
+{
+ register uint32_t val;
+ asm volatile ("int $0x40":"=a"(val):"a"(54), "b"(4));
+ return val;
+}
+
+static inline void get_system_colors(struct kolibri_system_colors *color_table)
+{
+ __asm__ volatile ("int $0x40"
+ :
+ :"a"(48),"b"(3),"c"(color_table),"d"(40)
+ );
+
+ /* color_table should point to the system color table */
+}
+
+static inline void debug_board_write_byte(const char ch){
+ __asm__ __volatile__(
+ "int $0x40"
+ :
+ :"a"(63), "b"(1), "c"(ch));
+}
+
+
+static inline void draw_number_sys(int32_t number, int x, int y, int len, color_t color){
+ register uint32_t fmt;
+ fmt = len << 16 | 0x80000000; // no leading zeros + width
+// fmt = len << 16 | 0x00000000; // leading zeros + width
+ __asm__ __volatile__(
+ "int $0x40"
+ :
+ :"a"(47), "b"(fmt), "c"(number), "d"((x << 16) | y), "S"(color));
+}
+
+static inline
+uint32_t get_mouse_eventstate(void)
+{
+ uint32_t val;
+
+ __asm__ __volatile__(
+ "int $0x40"
+ :"=a"(val)
+ :"a"(37),"b"(3));
+ return val;
+};
+
+static inline
+uint32_t set_event_mask(uint32_t mask)
+{
+ register uint32_t val;
+ asm volatile ("int $0x40":"=a"(val):"a"(40), "b"(mask));
+ return val;
+}
+
+typedef void (*thread_proc)(void*);
+
+static inline
+int start_thread(thread_proc proc, char* stack_top)
+{
+ register int val;
+ asm volatile ("int $0x40":"=a"(val):"a"(51), "b"(1), "c"(proc), "d"(stack_top));
+ return val;
+}
+
+static inline
+void kos_exit()
+{
+ asm volatile ("int $0x40"::"a"(-1));
+}
+
+static inline void focus_window(int slot){
+ asm volatile ("int $0x40"::"a"(18), "b"(3), "c"(slot));
+}
+
+static inline int get_thread_slot(int tid){
+ register int val;
+ asm volatile ("int $0x40":"=a"(val):"a"(18), "b"(21), "c"(tid));
+ return val;
+}
+
+static inline void set_current_folder(char* dir){
+ asm volatile ("int $0x40"::"a"(30), "b"(1), "c"(dir));
+}
+
+static inline int get_current_folder(char* buf, int bufsize){
+ register int val;
+ asm volatile ("int $0x40":"=a"(val):"a"(30), "b"(2), "c"(buf), "d"(bufsize));
+ return val;
+}
+
+static inline
+void ipc_set_area(void* buf, int bufsize){
+ asm volatile ("int $0x40"::"a"(60), "b"(1), "c"(buf), "d"(bufsize));
+}
+
+static inline
+int ipc_send_message(int pid_reciever, void *data, int datalen) {
+ register int val;
+ asm volatile ("int $0x40":"=a"(val):"a"(60), "b"(2), "c"(pid_reciever), "d"(data), "S"(datalen));
+ return val;
+}
+
+static inline
+void* shm_open(char *shm_name, int msize, int flags, int *retsz){
+ register int val, cod;
+ asm volatile ("int $0x40":"=a"(val),"=d"(cod):"a"(68), "b"(22), "c"(shm_name), "d"(msize), "S"(flags));
+
+ if(retsz) *retsz = cod; // errcode if NULL or memsize when open
+ return (void*)val;
+}
+
+static inline
+void shm_close(char *shm_name){
+ asm volatile ("int $0x40"::"a"(68), "b"(23), "c"(shm_name));
+}
+
+static inline
+int start_app(char *app_name, char *args){
+ #pragma pack(push, 1)
+ struct file_op_t
+ {
+ uint32_t fn;
+ uint32_t flags;
+ char* args;
+ uint32_t res1, res2;
+ char zero;
+ char* app_name __attribute__((packed));
+ } file_op;
+ #pragma pack(pop)
+ memset(&file_op, 0, sizeof(file_op));
+ file_op.fn = 7;
+ file_op.args = args;
+ file_op.app_name = app_name;
+
+ register int val;
+ asm volatile ("int $0x40":"=a"(val):"a"(70), "b"(&file_op));
+
+ return val;
+}
+
+
+/*
+static inline char *getcwd(char *buf, size_t size)
+{
+ int rc = get_current_folder(buf, size);
+ if (rc > size)
+ {
+ errno = ERANGE;
+ return 0;
+ }
+ else
+ return buf;
+}
+*/
+// end section
+
+
+
+//added nonstatic inline because incomfortabre stepping in in debugger
+void __attribute__ ((noinline)) debug_board_write_str(const char* str);
+void __attribute__ ((noinline)) debug_board_printf(const char *format,...);
+
+/* copy body to only one project file
+void __attribute__ ((noinline)) debug_board_write_str(const char* str){
+ while(*str)
+ debug_board_write_byte(*str++);
+}
+
+void __attribute__ ((noinline)) debug_board_printf(const char *format,...)
+{
+ va_list ap;
+ char log_board[300];
+
+ va_start (ap, format);
+ vsnprintf(log_board, sizeof log_board, format, ap);
+ va_end(ap);
+ debug_board_write_str(log_board);
+}
+*/
+
+
+
+// TinyC don't support aliasing of static inline funcs
+#ifndef __TINYC__
+static inline void BeginDraw(void) __attribute__ ((alias ("begin_draw")));
+static inline void EndDraw(void) __attribute__ ((alias ("end_draw")));
+static inline void DrawWindow(int x, int y, int w, int h, const char *name,
+ color_t workcolor, uint32_t style)
+ __attribute__ ((alias ("sys_create_window")));
+static inline void DefineButton(void) __attribute__ ((alias ("define_button")));
+static inline void DrawLine(int xs, int ys, int xe, int ye, color_t color)
+ __attribute__ ((alias ("draw_line")));
+static inline void DrawBar(int x, int y, int w, int h, color_t color)
+ __attribute__ ((alias ("draw_bar")));
+static inline void DrawBitmap(void *bitmap, int x, int y, int w, int h)
+ __attribute__ ((alias ("draw_bitmap")));
+static inline uint32_t GetSkinHeight(void) __attribute__ ((alias ("get_skin_height")));
+static inline pos_t GetMousePos(int origin) __attribute__ ((alias ("get_mouse_pos")));
+static inline uint32_t GetMouseButtons(void) __attribute__ ((alias ("get_mouse_buttons")));
+static inline uint32_t GetMouseWheels(void) __attribute__ ((alias ("get_mouse_wheels")));
+static inline uint32_t LoadCursor(void *path, uint32_t flags) __attribute__ ((alias ("load_cursor")));
+static inline uint32_t SetCursor(uint32_t cursor) __attribute__ ((alias ("set_cursor")));
+static inline int DestroyCursor(uint32_t cursor) __attribute__ ((alias ("destroy_cursor")));
+static inline uint32_t GetOsEvent(void) __attribute__ ((alias ("get_os_event")));
+static inline void *UserAlloc(size_t size) __attribute__ ((alias ("user_alloc")));
+static inline int UserFree(void *mem) __attribute__ ((alias ("user_free")));
+static inline void* UserRealloc(void *mem, size_t size) __attribute__ ((alias ("user_realloc")));
+static inline int *UserUnmap(void *base, size_t offset, size_t size) __attribute__ ((alias ("user_unmap")));
+static inline ufile_t LoadFile(const char *path) __attribute__ ((alias ("load_file")));
+static inline void GetProcInfo(char *info) __attribute__ ((alias ("get_proc_info")));
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+
+#endif
+
+
+
+
+
diff --git a/programs/other/TinyHashView/makefile b/programs/other/TinyHashView/makefile
new file mode 100755
index 0000000000..ff1198667d
--- /dev/null
+++ b/programs/other/TinyHashView/makefile
@@ -0,0 +1,13 @@
+all:
+ kos32-gcc -c -fomit-frame-pointer -I/usr/local/kos32/sdk/sources/newlib/libc/include ./algorithms/md5.c -o ./algorithms/md5.o -Wall -Wextra
+ kos32-gcc -c -fomit-frame-pointer -I/usr/local/kos32/sdk/sources/newlib/libc/include ./algorithms/sha1.c -o ./algorithms/sha1.o -Wall -Wextra
+ kos32-gcc -c -fomit-frame-pointer -I/usr/local/kos32/sdk/sources/newlib/libc/include ./algorithms/sha256.c -o ./algorithms/sha256.o -Wall -Wextra
+ kos32-gcc -c -fomit-frame-pointer -I/usr/local/kos32/sdk/sources/newlib/libc/include thashview.c -o thashview.o -Wall -Wextra
+ kos32-ld -call_shared -nostdlib --subsystem native --image-base 0 -T /usr/local/kos32/sdk/sources/newlib/app-dynamic.lds -Map=thashview.map -L /usr/local/kos32/lib/ -L /usr/local/kos32/sdk/lib/ -o thashview ./algorithms/md5.o ./algorithms/sha1.o ./algorithms/sha256.o thashview.o -lgcc -lc.dll
+ kos32-strip thashview -o thashview
+ kos32-objcopy thashview -O binary
+clean:
+ rm -f *.o
+ rm -f algorithms/*.o
+
+
diff --git a/programs/other/TinyHashView/notify.h b/programs/other/TinyHashView/notify.h
new file mode 100644
index 0000000000..bb97dbb5f1
--- /dev/null
+++ b/programs/other/TinyHashView/notify.h
@@ -0,0 +1,5 @@
+#include "kos32sys.h"
+void notify_show(char *text)
+{
+ start_app("/sys/@notify", text);
+}
diff --git a/programs/other/TinyHashView/thashview.c b/programs/other/TinyHashView/thashview.c
new file mode 100644
index 0000000000..f26c17c0ff
--- /dev/null
+++ b/programs/other/TinyHashView/thashview.c
@@ -0,0 +1,425 @@
+/*Автор: Логаев Максим(turbocat2001) */
+#include
+#include
+#include "kos32sys.h"
+#include "notify.h"
+#include
+#include
+#include "algorithms/md5.h"
+#include "algorithms/sha1.h"
+#include "algorithms/sha256.h"
+
+#define TRUE 1;
+#define FALSE 0;
+#define MAX_HASH_LEN 65 // Максимальная длина строки
+#define WINDOW_W 665
+#define VERSION "%s - thashview 2.2"
+
+typedef unsigned char bool;
+struct kolibri_system_colors sys_color_table;
+
+char hex[]={"abcdefABCDEF1234567890"}; //Для проверки вводимых символов
+char hash_str_md5[MAX_HASH_LEN]= "Click the 'MD5:' button to show the md5-checksum! "; //Вывод MD5
+char hash_str_sha1[MAX_HASH_LEN]= "Click the 'SHA1:' button to show the sha1-checksum! "; //Вывод SHA1
+char hash_str_sha256[MAX_HASH_LEN]="Click the 'SHA256:' button to show the sha256-checksum!"; //Вывод SHA256
+char edit_box_buff[MAX_HASH_LEN]; // Буффер для ввода
+char *filename; // Имя обрабатываемого файла
+char *title; // Заголовок окна
+
+enum MYCOLORS // Цвета
+{
+ GREEN = 0x00067D06,
+ RED = 0x00FF0000,
+ BLACK = 0x00000000,
+ WHITE = 0xFFFFFFFF,
+ GREY = 0x00DDD7CF
+};
+
+
+unsigned int str_pos=0; // Позиция курсора при печати в строке ввода
+int md5_flag=0, sha1_flag=0, sha256_flag=0; // Флаги показывающие была ли уже рассчитана котрольная сумма в функции check_sum()
+int edit_box_text_color=BLACK; // Изначальный цвет текста в строке ввода
+
+enum MYKEYS // Коды клавиш
+{
+ CTRL_V=22,
+ BACKSPACE=8
+};
+
+enum BUTTONS // Кнопки в интрефейсе
+{
+ BTN_QUIT=1, //Выход
+ BTN_MD5 = 10, //Рассчитать md5-контрольную сумму
+ BTN_SHA1 = 20, //Рассчитать sha1-контрольную сумму
+ BTN_SHA256 = 30, //Рассчитать sha256-контрольную сумму
+ BTN_COPY_MD5= 11, //Скопировать в буффер обмена
+ BTN_COPY_SHA1= 21,
+ BTN_COPY_SHA256=31,
+ BTN_CMP=40, //Сравнить edit_box и контрольную сумму
+ BTN_PASTE=50 //Вставить в edit_box(пока в разработке)
+};
+
+
+
+void* safe_malloc(size_t size) // Безопасный malloc. Показывает уведомление об ошибке и закрывает программу если память не была выделена
+{
+ void *p=malloc(size);
+ if(p==NULL)
+ {
+ notify_show("'Memory allocation error!' -E");
+ exit(0);
+ }
+ else
+ {
+ return p;
+ }
+}
+
+void global_var_init(unsigned int size) // Инициализируются глобальные массивы
+{
+ filename=safe_malloc(size);
+ title=safe_malloc(size+20);
+}
+
+/* Функции генерации контрольных сумм */
+void md5_hash(FILE* input, BYTE* hash )
+{
+ int input_size;
+ BYTE *temp_buffer;
+ temp_buffer=safe_malloc(1024);
+ MD5_CTX ctx;
+ md5_init(&ctx);
+ while((input_size = fread(temp_buffer, 1, 1024, input)) > 0){
+ md5_update(&ctx, temp_buffer, input_size);
+ }
+ md5_final(&ctx, hash);
+ free(temp_buffer);
+}
+
+void sha1_hash(FILE* input, BYTE* hash )
+{
+ int input_size;
+ BYTE *buffer;
+ buffer=safe_malloc(1024);
+ SHA1_CTX ctx;
+ sha1_init(&ctx);
+ while((input_size = fread(buffer, 1, 1024, input)) > 0){
+ sha1_update(&ctx, buffer, input_size);
+ }
+ sha1_final(&ctx, hash);
+ free(buffer);
+}
+
+void sha256_hash(FILE* input, BYTE* hash )
+{
+ int input_size;
+ BYTE *buffer;
+ buffer=safe_malloc(1024);
+ SHA256_CTX ctx;
+ sha256_init(&ctx);
+ while((input_size = fread(buffer, 1, 1024, input)) > 0){
+ sha256_update(&ctx, buffer, input_size);
+ }
+ sha256_final(&ctx, hash);
+ free(buffer);
+}
+
+
+BYTE* check_sum(int alg) // Генерируем контрольные суммы используя один из алгоритмов
+{
+ FILE* input_file;
+ BYTE *hash;
+ input_file=fopen(filename,"rb");
+ hash = safe_malloc(alg);
+ switch (alg)
+ {
+ case MD5_BLOCK_SIZE :
+ md5_hash(input_file, hash);
+ md5_flag=1;
+ break;
+
+ case SHA1_BLOCK_SIZE :
+ sha1_hash(input_file, hash);
+ sha1_flag=1;
+ break;
+
+ case SHA256_BLOCK_SIZE :
+ sha256_hash(input_file, hash);
+ sha256_flag=1;
+ break;
+ }
+ fclose(input_file);
+ return hash;
+}
+
+void sprint_hash(BYTE *hash, char* hash_str, int hash_size) //Преобрауем двоичные данные из hash в строку hash_str
+{
+ char block[3];
+ memset(hash_str, 0, MAX_HASH_LEN); // Очищаем строку для strcat
+ for(int i=0; i0) && ((int)*(temp_buff+4)==0) && ((int)*(temp_buff+8)==1))
+ {
+ strncpy(edit_box_buff,temp_buff+12, MAX_HASH_LEN-1);
+ str_pos=strlen(edit_box_buff);
+ notify_show("'Pasted from clipboard!' -I");
+ edit_box_text_color=BLACK;
+ }
+ user_free(temp_buff);
+}
+
+
+void copy_to_clipboard(char *text) // Копирлвать в буффер обмена
+{
+ if(55!=strlen(text))
+ {
+ char *temp_buffer=safe_malloc(MAX_HASH_LEN+12);
+ memset(temp_buffer, 0, MAX_HASH_LEN);
+ *(temp_buffer+4)=0;
+ *(temp_buffer+8)=1;
+ strncpy(temp_buffer+12, text, MAX_HASH_LEN-1);
+ kol_clip_set(strlen(text)+12, temp_buffer);
+ notify_show("'Copied to clipboard!' -I");
+ free(temp_buffer);
+ }
+}
+
+void print_pending_calc(char *str) // Выводим сообщение о том что контрольная суммма вычисляется.
+{
+ strcpy(str, "Please wait! Calculating checksum... ");
+ redraw_window();
+}
+
+bool calc_and_cmp(char *hash_str_universal,int alg) // Вычисляем контрольную сумму и сравниваем с edit_box_buff.
+{
+ print_pending_calc(hash_str_universal);
+ sprint_hash(check_sum(alg),hash_str_universal, alg);
+ return !strcmp(edit_box_buff, hash_str_universal);
+}
+
+bool hash_compare() // Главная функция для сравнения
+{
+ int alg=strlen(edit_box_buff)/2;
+
+ switch (alg) // Если вычисления ещё небыло
+ {
+ case MD5_BLOCK_SIZE:
+ if(md5_flag)
+ {
+ return !strcmp(edit_box_buff,hash_str_md5);
+ }
+ else
+ {
+ return calc_and_cmp(hash_str_md5,alg);
+ }
+ break;
+
+ case SHA1_BLOCK_SIZE:
+ if(sha1_flag)
+ {
+ return !strcmp(edit_box_buff,hash_str_sha1);
+ }
+ else
+ {
+ return calc_and_cmp(hash_str_sha1,alg);
+ }
+ break;
+
+ case SHA256_BLOCK_SIZE:
+
+ if(sha256_flag)
+ {
+ return !strcmp(edit_box_buff,hash_str_sha256);
+ }
+ else
+ {
+ return calc_and_cmp(hash_str_sha256,alg);
+ }
+ break;
+
+ default:
+ return FALSE;
+ break;
+ }
+}
+
+void edit_box(oskey_t key) //Функция реализующая строку ввода
+{
+ edit_box_text_color=BLACK;
+
+ if(key.code==CTRL_V) // Если нажато Ctrl+V то вставить из буфера обмена
+ {
+ paste_to_edit_buffer();
+ }
+ if(key.code==BACKSPACE && str_pos>0) // Если backspace то удалить последний символ
+ {
+ str_pos--;
+ edit_box_buff[str_pos]='\0';
+
+ }
+ else if(str_pos