From f463d544793ff83efd8b95d0bce5ec80fd8170f3 Mon Sep 17 00:00:00 2001 From: Miquel Sabaté Solà Date: Wed, 4 Dec 2024 21:42:37 +0100 Subject: Remove old test code MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit There is some code that I had there after messing with some of the topics on Uros' blog (https://popovicu.com/), but that became irrelevant after working on some other projects (e.g. fbos) or on other examples. This commit also brings about a major overhaul on the structure of the project. Hopefully it's now at a more ready state. Signed-off-by: Miquel Sabaté Solà --- .gitignore | 5 +- LICENSE | 674 +++++++++++++++++++++++++++++++++++++ README.md | 20 +- arch/riscv/init/Makefile | 21 -- arch/riscv/init/file_list.txt | 2 - arch/riscv/init/hello.c | 8 - arch/riscv/init/initramfs.cpio | Bin 4959232 -> 0 bytes arch/riscv/init/little_shell.go | 19 -- arch/riscv/init/shell.c | 32 -- arch/riscv/kernel/Makefile | 20 -- arch/riscv/kernel/hello.ld | 9 - arch/riscv/kernel/hello.s | 15 - arch/riscv/kernel/infinite.ld | 9 - arch/riscv/kernel/infinite.s | 4 - arch/riscv/linux/Makefile | 60 ---- arch/riscv/linux/probe.c | 294 ---------------- arch/riscv/user/basics/Makefile | 19 ++ arch/riscv/user/basics/basics.c | 162 +++++++++ arch/riscv/user/basics/factorial.S | 28 ++ arch/riscv/user/basics/float.S | 40 +++ arch/riscv/user/basics/string.S | 111 ++++++ arch/riscv/user/hwprobe/Makefile | 60 ++++ arch/riscv/user/hwprobe/probe.c | 294 ++++++++++++++++ arch/riscv/usr/Makefile | 19 -- arch/riscv/usr/basics.c | 162 --------- arch/riscv/usr/factorial.S | 28 -- arch/riscv/usr/float.S | 40 --- arch/riscv/usr/string.S | 111 ------ 28 files changed, 1407 insertions(+), 859 deletions(-) create mode 100644 LICENSE delete mode 100644 arch/riscv/init/Makefile delete mode 100644 arch/riscv/init/file_list.txt delete mode 100644 arch/riscv/init/hello.c delete mode 100644 arch/riscv/init/initramfs.cpio delete mode 100644 arch/riscv/init/little_shell.go delete mode 100644 arch/riscv/init/shell.c delete mode 100644 arch/riscv/kernel/Makefile delete mode 100644 arch/riscv/kernel/hello.ld delete mode 100644 arch/riscv/kernel/hello.s delete mode 100644 arch/riscv/kernel/infinite.ld delete mode 100644 arch/riscv/kernel/infinite.s delete mode 100644 arch/riscv/linux/Makefile delete mode 100644 arch/riscv/linux/probe.c create mode 100644 arch/riscv/user/basics/Makefile create mode 100644 arch/riscv/user/basics/basics.c create mode 100644 arch/riscv/user/basics/factorial.S create mode 100644 arch/riscv/user/basics/float.S create mode 100644 arch/riscv/user/basics/string.S create mode 100644 arch/riscv/user/hwprobe/Makefile create mode 100644 arch/riscv/user/hwprobe/probe.c delete mode 100644 arch/riscv/usr/Makefile delete mode 100644 arch/riscv/usr/basics.c delete mode 100644 arch/riscv/usr/factorial.S delete mode 100644 arch/riscv/usr/float.S delete mode 100644 arch/riscv/usr/string.S diff --git a/.gitignore b/.gitignore index ed20509..0dfb6b0 100644 --- a/.gitignore +++ b/.gitignore @@ -6,11 +6,10 @@ *.cmd # arch/riscv -arch/riscv/usr/basics +arch/riscv/user/basics/basics +arch/riscv/user/hwprobe/probe arch/riscv/machine/machine arch/riscv/kernel/hello -arch/riscv/init/init -arch/riscv/init/little_shell arch/riscv/linux/probe # kernel/dtm diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/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/README.md b/README.md index f61f177..a31a3f5 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,18 @@ -Basic stuff at `basics`. Using features from the Linux Kernel in `linux`. +A bunch of code to messes with low level stuff. That is: -Experiments for `kernel`, `bios` and `init` taken from -[@popovicu](https://github.com/popovicu) and his blog. +- `arch`: + - `machine`: prints "hello, world" on the serial port while running in M mode + on QEMU. Check the [README file](./arch/riscv/machine/README.md) for more + info. + - `supervisor/hsm`: using the HSM extension from SBI to gather info from + harts. + - `user/`: + - `basics`: bunch of code checking on basic programming concepts from the + RISC-V ISA. + - `hwprobe`: using the `hwprobe` system call from the Linux kernel to check + on the features from the current machine. +- `kernel/dtm`: simple kernel module showcasing the API from the `of` driver. + +A lot of this is not taken solely from my brain, and I will give credit whenever +it's relevant to each piece of code. For the rest of the code, the GPLv3+ +license applies. diff --git a/arch/riscv/init/Makefile b/arch/riscv/init/Makefile deleted file mode 100644 index 71405c3..0000000 --- a/arch/riscv/init/Makefile +++ /dev/null @@ -1,21 +0,0 @@ -CROSS_CC ?= riscv64-suse-linux-gcc -CROSS_LD ?= riscv64-suse-linux-ld -CCFLAGS = -static - -## -# Targets - -.PHONY: hello -hello: clean - $(CROSS_CC) $(CCFLAGS) -o init hello.c - cpio -o -H newc < file_list.txt > initramfs.cpio - -.PHONY: shell -shell: clean - $(CROSS_CC) $(CCFLAGS) -o init shell.c - GOOS=linux GOARCH=riscv64 go build little_shell.go - cpio -o -H newc < file_list.txt > initramfs.cpio - -.PHONY: clean -clean: - @rm -f *.o init initramfs.cpio diff --git a/arch/riscv/init/file_list.txt b/arch/riscv/init/file_list.txt deleted file mode 100644 index 9dd8872..0000000 --- a/arch/riscv/init/file_list.txt +++ /dev/null @@ -1,2 +0,0 @@ -init -little_shell diff --git a/arch/riscv/init/hello.c b/arch/riscv/init/hello.c deleted file mode 100644 index d4e5892..0000000 --- a/arch/riscv/init/hello.c +++ /dev/null @@ -1,8 +0,0 @@ -#include -#include - -int main(int argc, char *argv[]) -{ - printf("Hello, world!\n"); - exit(0); -} diff --git a/arch/riscv/init/initramfs.cpio b/arch/riscv/init/initramfs.cpio deleted file mode 100644 index 9918d17..0000000 Binary files a/arch/riscv/init/initramfs.cpio and /dev/null differ diff --git a/arch/riscv/init/little_shell.go b/arch/riscv/init/little_shell.go deleted file mode 100644 index 7324323..0000000 --- a/arch/riscv/init/little_shell.go +++ /dev/null @@ -1,19 +0,0 @@ -package main - -import ( - "bufio" - "fmt" - "os" -) - -func main() { - fmt.Println("Hello world from Go!") - - reader := bufio.NewReader(os.Stdin) - - for { - fmt.Print("Enter your command: ") - line, _ := reader.ReadString('\n') - fmt.Printf("Your command is: %s", line) - } -} diff --git a/arch/riscv/init/shell.c b/arch/riscv/init/shell.c deleted file mode 100644 index d44b1c7..0000000 --- a/arch/riscv/init/shell.c +++ /dev/null @@ -1,32 +0,0 @@ -#include -#include - -int main(int argc, char *argv[]) -{ - pid_t pid = fork(); - - if (pid == -1) { - printf("Unable to fork!"); - return -1; - } - - if (pid == 0) { - // This is a child process. - int status = execl("/little_shell", "irrelevant", NULL); - - if (status == -1) { - printf("Forked process cannot start the little_shell"); - return -2; - } - } - - int count = 1; - - while (1) { - printf("Hello from the original init! %d\n", count); - count++; - sleep(10); - } - - return 0; -} diff --git a/arch/riscv/kernel/Makefile b/arch/riscv/kernel/Makefile deleted file mode 100644 index e943353..0000000 --- a/arch/riscv/kernel/Makefile +++ /dev/null @@ -1,20 +0,0 @@ -CROSS_AS ?= riscv64-suse-linux-as -CROSS_LD ?= riscv64-suse-linux-ld -ASFLAGS = -march=rv64g -mabi=lp64 - -## -# Targets - -.PHONY: infinite -infinite: clean - $(CROSS_AS) $(ASFLAGS) -o infinite.o -c infinite.s - $(CROSS_LD) -T infinite.ld infinite.o -o infinite - -.PHONY: hello -hello: clean - $(CROSS_AS) $(ASFLAGS) -o hello.o -c hello.s - $(CROSS_LD) -T hello.ld hello.o -o hello - -.PHONY: clean -clean: - @rm -f *.o infinite hello diff --git a/arch/riscv/kernel/hello.ld b/arch/riscv/kernel/hello.ld deleted file mode 100644 index e4af459..0000000 --- a/arch/riscv/kernel/hello.ld +++ /dev/null @@ -1,9 +0,0 @@ -MEMORY { - kernel_space (rwx) : ORIGIN = 0x80200000, LENGTH = 128 -} - -SECTIONS { - .text : { - hello.o(.text.kernel) - } > kernel_space -} diff --git a/arch/riscv/kernel/hello.s b/arch/riscv/kernel/hello.s deleted file mode 100644 index eacd797..0000000 --- a/arch/riscv/kernel/hello.s +++ /dev/null @@ -1,15 +0,0 @@ -.global _start -.section .text.kernel - -_start: li a7, 0x4442434E - li a6, 0x00 - li a0, 12 - lla a1, debug_string - li a2, 0 - ecall - -loop: j loop - - .section .rodata -debug_string: - .string "Hello world\n" diff --git a/arch/riscv/kernel/infinite.ld b/arch/riscv/kernel/infinite.ld deleted file mode 100644 index 2eee384..0000000 --- a/arch/riscv/kernel/infinite.ld +++ /dev/null @@ -1,9 +0,0 @@ -MEMORY { - kernel_space (rwx) : ORIGIN = 0x80200000, LENGTH = 128 -} - -SECTIONS { - .text : { - infinite.o(.text.kernel) - } > kernel_space -} diff --git a/arch/riscv/kernel/infinite.s b/arch/riscv/kernel/infinite.s deleted file mode 100644 index 855f58e..0000000 --- a/arch/riscv/kernel/infinite.s +++ /dev/null @@ -1,4 +0,0 @@ - .global _start - .section .text.kernel - -_start: j _start diff --git a/arch/riscv/linux/Makefile b/arch/riscv/linux/Makefile deleted file mode 100644 index 9b813ff..0000000 --- a/arch/riscv/linux/Makefile +++ /dev/null @@ -1,60 +0,0 @@ -## -# By default everything is silent. If you want to change this behavior, simply -# assign V=1 when calling make. - -V = -ifeq ($(strip $(V)),) - E = @echo - Q = @ -else - E = @\# - Q = -endif - -## -# Compile options. You can use CROSS_COMPILE just like on the Linux Kernel. You -# can also determine the ISA to be used, which defaults to my VisionFive2 board. -# I did not go too much into the rabbit hole of platform-specific flags because -# everything is in assembly anyways and everything is statically linked. Hence -# no `-mcpu`, no `-mtune`, no funny business. - -CC = $(CROSS_COMPILE)gcc -LD = $(CROSS_COMPILE)ld -ISA ?= rv64imafdc_zicntr_zicsr_zifencei_zihpm_zca_zcd_zba_zbb -WARNINGS = -Werror -Wpedantic -Wall -Wextra -Wcast-align -Wcast-qual -Winit-self \ - -Wmissing-include-dirs -Wredundant-decls -Wshadow -Wsign-conversion \ - -Wswitch-default -Wundef -Wunreachable-code -Wmissing-noreturn -CCFLAGS = $(WARNINGS) -march=$(ISA) -LDFLAGS = - - -# You can pass an optional `DEBUG` variable to manipulate the build type. -DEBUG = -ifeq ($(strip $(DEBUG)),) - CCFLAGS += -O3 -else - CCFLAGS += -g -endif - -## -# Paths. - -SRC = $(wildcard *.c) -EXES = $(SRC:.c=) - -## -# Targets - -.PHONY: all -all: clean $(EXES) - -.PHONY: build -build: $(EXES) - -.c: - $(E) " CC " $(*F) - $(Q) $(CC) $(CCFLAGS) $< -o $@ - -.PHONY: clean -clean: - $(Q) rm -f $(EXES) diff --git a/arch/riscv/linux/probe.c b/arch/riscv/linux/probe.c deleted file mode 100644 index 9e2e978..0000000 --- a/arch/riscv/linux/probe.c +++ /dev/null @@ -1,294 +0,0 @@ -#define _GNU_SOURCE - -#include -#include -#include -#include -#include -#include -#include - -#define NR_RISCV_HWPROBE 258 - -// Depend on Linux patches that have not been merged upstream... -#define RISCV_HWPROBE_EXT_ZICNTR (1ULL << 49) -#define RISCV_HWPROBE_EXT_ZIHPM (1ULL << 50) -#define RISCV_HWPROBE_EXT_ZICSR (1ULL << 51) -#define RISCV_HWPROBE_EXT_ZIFENCEI (1ULL << 52) - -#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof(arr)[0]) - -struct ext_pair_t { - char *id; - uint64_t value; -}; - -static struct ext_pair_t ext_pairs[] = { - { - .id = "F, D", - .value = RISCV_HWPROBE_IMA_FD, - }, - { - .id = "C", - .value = RISCV_HWPROBE_IMA_C, - }, - { - .id = "V", - .value = RISCV_HWPROBE_IMA_V, - }, - { - .id = "ZBA", - .value = RISCV_HWPROBE_EXT_ZBA, - }, - { - .id = "ZBB", - .value = RISCV_HWPROBE_EXT_ZBB, - }, - { - .id = "ZBS", - .value = RISCV_HWPROBE_EXT_ZBS, - }, - { - .id = "ZICBOZ", - .value = RISCV_HWPROBE_EXT_ZICBOZ, - }, - { - .id = "ZBC", - .value = RISCV_HWPROBE_EXT_ZBC, - }, - { - .id = "ZBKB", - .value = RISCV_HWPROBE_EXT_ZBKB, - }, - { - .id = "ZBKC", - .value = RISCV_HWPROBE_EXT_ZBKC, - }, - { - .id = "ZBKX", - .value = RISCV_HWPROBE_EXT_ZBKX, - }, - { - .id = "ZKND", - .value = RISCV_HWPROBE_EXT_ZKND, - }, - { - .id = "ZKNE", - .value = RISCV_HWPROBE_EXT_ZKNE, - }, - { - .id = "ZKNH", - .value = RISCV_HWPROBE_EXT_ZKNH, - }, - { - .id = "ZKSED", - .value = RISCV_HWPROBE_EXT_ZKSED, - }, - { - .id = "ZKSH", - .value = RISCV_HWPROBE_EXT_ZKSH, - }, - { - .id = "ZKT", - .value = RISCV_HWPROBE_EXT_ZKT, - }, - { - .id = "ZVBB", - .value = RISCV_HWPROBE_EXT_ZVBB, - }, - { - .id = "ZVBC", - .value = RISCV_HWPROBE_EXT_ZVBC, - }, - { - .id = "ZVKB", - .value = RISCV_HWPROBE_EXT_ZVKB, - }, - { - .id = "ZVKG", - .value = RISCV_HWPROBE_EXT_ZVKG, - }, - { - .id = "ZVKNED", - .value = RISCV_HWPROBE_EXT_ZVKNED, - }, - { - .id = "ZVKNHA", - .value = RISCV_HWPROBE_EXT_ZVKNHA, - }, - { - .id = "ZVKNHB", - .value = RISCV_HWPROBE_EXT_ZVKNHB, - }, - { - .id = "ZVKSED", - .value = RISCV_HWPROBE_EXT_ZVKSED, - }, - { - .id = "ZVKSH", - .value = RISCV_HWPROBE_EXT_ZVKSH, - }, - { - .id = "ZVKT", - .value = RISCV_HWPROBE_EXT_ZVKT, - }, - { - .id = "ZFH", - .value = RISCV_HWPROBE_EXT_ZFH, - }, - { - .id = "ZFHMIN", - .value = RISCV_HWPROBE_EXT_ZFHMIN, - }, - { - .id = "ZIHINTNTL", - .value = RISCV_HWPROBE_EXT_ZIHINTNTL, - }, - { - .id = "ZVFH", - .value = RISCV_HWPROBE_EXT_ZVFH, - }, - { - .id = "ZVFHMIN", - .value = RISCV_HWPROBE_EXT_ZVFHMIN, - }, - { - .id = "ZFA", - .value = RISCV_HWPROBE_EXT_ZFA, - }, - { - .id = "ZTSO", - .value = RISCV_HWPROBE_EXT_ZTSO, - }, - { - .id = "ZACAS", - .value = RISCV_HWPROBE_EXT_ZACAS, - }, - { - .id = "ZICOND", - .value = RISCV_HWPROBE_EXT_ZICOND, - }, - { - .id = "ZIHINTPAUSE", - .value = RISCV_HWPROBE_EXT_ZIHINTPAUSE, - }, - { - .id = "ZVE32X", - .value = RISCV_HWPROBE_EXT_ZVE32X, - }, - { - .id = "ZVE32F", - .value = RISCV_HWPROBE_EXT_ZVE32F, - }, - { - .id = "ZVE64X", - .value = RISCV_HWPROBE_EXT_ZVE64X, - }, - { - .id = "ZVE64F", - .value = RISCV_HWPROBE_EXT_ZVE64F, - }, - { - .id = "ZVE64D", - .value = RISCV_HWPROBE_EXT_ZVE64D, - }, - { - .id = "ZIMOP", - .value = RISCV_HWPROBE_EXT_ZIMOP, - }, - { - .id = "ZCA", - .value = RISCV_HWPROBE_EXT_ZCA, - }, - { - .id = "ZCB", - .value = RISCV_HWPROBE_EXT_ZCB, - }, - { - .id = "ZCD", - .value = RISCV_HWPROBE_EXT_ZCD, - }, - { - .id = "ZCF", - .value = RISCV_HWPROBE_EXT_ZCF, - }, - { - .id = "ZCMOP", - .value = RISCV_HWPROBE_EXT_ZCMOP, - }, - { - .id = "ZAWRS", - .value = RISCV_HWPROBE_EXT_ZAWRS, - }, - { - .id = "ZICNTR", - .value = RISCV_HWPROBE_EXT_ZICNTR, - }, - { - .id = "ZIHPM", - .value = RISCV_HWPROBE_EXT_ZIHPM, - }, - { - .id = "ZICSR", - .value = RISCV_HWPROBE_EXT_ZICSR, - }, - { - .id = "ZIFENCEI", - .value = RISCV_HWPROBE_EXT_ZIFENCEI, - }, -}; - -void print_bits(size_t size, void *ptr) -{ - unsigned char *b = (unsigned char *)ptr; - unsigned char byte; - int i, j; - - for (i = size - 1; i >= 0; i--) { - for (j = 7; j >= 0; j--) { - byte = (b[i] >> j) & 1; - printf("%u", byte); - } - } -} - -int main() -{ - struct riscv_hwprobe pairs; - long rc; - - // base: rv64ima - - pairs = (struct riscv_hwprobe){ - .key = RISCV_HWPROBE_KEY_BASE_BEHAVIOR, - }; - rc = syscall(NR_RISCV_HWPROBE, &pairs, 1, 0, NULL, 0); - if (rc) { - perror("could not fetch the base behavior for the system"); - exit(EXIT_FAILURE); - } - printf("Supports base extensions I, M, A? %s\n", (bool)pairs.value ? "yes" : "no"); - - // Extensions - - pairs = (struct riscv_hwprobe){ - .key = RISCV_HWPROBE_KEY_IMA_EXT_0, - }; - rc = syscall(NR_RISCV_HWPROBE, &pairs, 1, 0, NULL, 0); - if (rc) { - perror("could not fetch extensions as given by hwprobe"); - exit(EXIT_FAILURE); - } - - printf("\nWe got back this bit map: "); - print_bits(sizeof(long), &pairs.value); - - puts("; which means:\n"); - for (size_t i = 0; i < ARRAY_SIZE(ext_pairs); i++) { - if ((ext_pairs[i].value & pairs.value) == ext_pairs[i].value) { - printf("%s: OK\n", ext_pairs[i].id); - } - } - - exit(EXIT_SUCCESS); -} diff --git a/arch/riscv/user/basics/Makefile b/arch/riscv/user/basics/Makefile new file mode 100644 index 0000000..b4752a3 --- /dev/null +++ b/arch/riscv/user/basics/Makefile @@ -0,0 +1,19 @@ +CC = $(CROSS_COMPILE)gcc +CCFLAGS = +EXE = basics + +DEBUG = +ifneq ($(strip $(DEBUG)),) + CCFLAGS += -g +endif + +.PHONY: all +all: clean $(EXE) + +.PHONY: $(EXE) +$(EXE): + $(CC) $(CCFLAGS) -o $(EXE) basics.c factorial.S string.S float.S + +.PHONY: clean +clean: + @rm -f $(EXE) diff --git a/arch/riscv/user/basics/basics.c b/arch/riscv/user/basics/basics.c new file mode 100644 index 0000000..1d822c3 --- /dev/null +++ b/arch/riscv/user/basics/basics.c @@ -0,0 +1,162 @@ +#include +#include +#include +#include +#include + +/* + * Returns the factorial for the given unsigned 64-bit integer. + * + * Implemented in factorial.S + */ +int factorial(uint64_t n); + +void test_factorial(void) +{ + assert(factorial(0) == 0); + assert(factorial(1) == 1); + assert(factorial(2) == 2); + assert(factorial(3) == 6); + assert(factorial(4) == 24); + + printf("factorial:\t\tOK\n"); +} + +/* + * Returns a pointer with the same given string but reversed. Note that the + * string cannot be in read-only space since the reversal is done in-place. + * + * Implemented in string.S + */ +char *reverse_string(char *str); + +void test_reverse_string(void) +{ + assert(reverse_string(NULL) == NULL); + assert(strlen(reverse_string("")) == 0); + + char s1[] = "This is a string."; + assert(strcmp(reverse_string(s1), ".gnirts a si sihT") == 0); + + char s2[] = "."; + assert(strcmp(reverse_string(s2), ".") == 0); + + printf("reverse_string:\t\tOK\n"); +} + +/* + * Returns true if the given string is a palindrome, false otherwise. + * + * Implemented in string.S + */ +bool is_palindrome(char *str); + +void test_is_palindrome(void) +{ + assert(is_palindrome(NULL) == 0); + assert(is_palindrome("") == 0); + assert(is_palindrome("aba") == 1); + assert(is_palindrome("aaa") == 1); + assert(is_palindrome("This is a a si sihT") == 1); + + printf("is_palindrome:\t\tOK\n"); +} + +/* + * This function computes the following: ((a + b) * b) + b. Don't try to make + * sense of it, that's the computation I ended up while messing with RISC-V + * floating point instructions. Anyways, with this in mind, it will return if + * the computed value is greater than 10. + * + * Implemented in float.S + */ +bool greater_than_ten(double a, uint64_t b); + +void test_greater_than_ten(void) +{ + assert(!greater_than_ten(2.3, 1)); // 4.3 + assert(greater_than_ten(2.3, 2)); // 10.6 + + printf("greater_than_ten:\tOK\n"); +} + +/* + * Atomically add the integer pointed by `a` with the given `value`. + * this is a function, I've checked that the assembly produced by GCC on a + * decent optimization level actually inlines this. + */ +static inline void atomic_add(uint64_t *a, uint64_t value) +{ + /* + * The execution is a mere `amoadd` instruction, but it will set on `t0` the + * result. If it fails (e.g. the address was already being used), then `t0 = + * 0` and `beqz` will instruct it to try again. + * + * Note that on the board I'm using the 'Zawrs' extension is not available. + * Otherwise I could have re-arranged to code to something like this: + * + * amoadd.d t0, %1, %0 + * bnez t0, .Latomic_add_done + * wrs.nto + * .Latomic_add_done: + * + * This is an extra instruction but it saves on power if the memory address + * happens to be used at access time. + * + * As for the 'A' RISC-V specific constraint, it means "An address that is + * held in a general-purpose register". GCC will then do the magic and + * convert it to `amoadd.d t0, a1, (a0)` or something like that. Note that + * we have to pass the '+' constraint modifier because the address will be + * both read and written atomically. + * + * See: https://gcc.gnu.org/onlinedocs/gcc/Machine-Constraints.html. + */ + asm volatile(".Latomic_add_retry:\n\t" + "amoadd.d t0, %1, %0\n\t" + "beqz t0, .Latomic_add_retry" + : "+A"(*a) + : "r"(value) + : "t0", "memory"); +} + +void test_atomic_add(void) +{ + uint64_t i = 4; + + atomic_add(&i, 0); + assert(i == 4); + + atomic_add(&i, 2); + assert(i == 6); + + printf("atomic_add:\t\tOK\n"); +} + +extern int mstrcmp(const char *s1, const char *s2); + +void test_mstrcmp(void) +{ + char *strings[] = { + "hello", "", "iello", "helloa", "contammusaaquellhomedegranarditquetantissimerra", + }; + + for (uint64_t i = 0; i < 1000000000; i++) { + assert(mstrcmp(strings[0], strings[0]) == 0); + assert(mstrcmp(strings[0], strings[1]) > 0); + assert(mstrcmp(strings[0], strings[2]) < 0); + assert(mstrcmp(strings[0], strings[3]) < 0); + assert(mstrcmp(strings[0], strings[4]) > 0); + } + + printf("mstrcmp:\t\tOK\n"); +} + +int main() +{ + test_factorial(); + test_reverse_string(); + test_is_palindrome(); + test_greater_than_ten(); + test_atomic_add(); + test_mstrcmp(); +} diff --git a/arch/riscv/user/basics/factorial.S b/arch/riscv/user/basics/factorial.S new file mode 100644 index 0000000..7e3df12 --- /dev/null +++ b/arch/riscv/user/basics/factorial.S @@ -0,0 +1,28 @@ +.text +.globl factorial +.type factorial, @function + +factorial: + // If input <= 1, just return the given thing. + addi t0, zero, 1 + bgt a0, t0, else + jr ra +else: + // Preserve the argument and the return address before the call. + addi sp, sp, -16 + sd a0, 0(sp) + sd ra, 8(sp) + + // Call the same function but with a value of argument-1. + addi a0, a0, -1 + call factorial + + // Restore back the original argument and the return address. Then multiply + // the original argument with the returned one from the previous call. + ld t1, 0(sp) + ld ra, 8(sp) + addi sp, sp, 16 + mul a0, t1, a0 + + // And return to the caller. + jr ra diff --git a/arch/riscv/user/basics/float.S b/arch/riscv/user/basics/float.S new file mode 100644 index 0000000..f481f3e --- /dev/null +++ b/arch/riscv/user/basics/float.S @@ -0,0 +1,40 @@ +.text +.globl greater_than_ten +.type greater_than_ten, @function + +// bool greater_than_ten(double a, uint64_t b); +greater_than_ten: + // Upon entry a -> fa0; and b -> a0. That is, the ABI increments the + //(f)a register per argument type. + + // Change the rounding to "Rounds Towards Zero" (bits: 0b001). + li t0, 0b001 + fsrm t0 + + // Convert the second parameter to double. + fcvt.d.lu ft0, a0 + + // ret = a + b + fadd.d fa0, fa0, ft0 + + // ret = (ret * b) + b + fmv.d ft1, ft0 + fmadd.d fa0, fa0, ft0, ft1 + + // Now we need to compare the number with 10.0. There are multiple ways to + // load a floating point immediate: + // 1. Loading an integer immediate and then convert it into a double. This + // is discouraged on the RISC-V assembly manual. + // 2. Load a double with `fld` from a memory location on the data section. + // 3. Load a floating point immediate with `fli` (requires the `Zfa` + // extension). + // I don't have the `Zfa` extension on my board, so I'm opting for the + // second way. + fld ft1, .TEN, t0 + fle.d a0, ft1, fa0 + + ret + +.data +.TEN: + .double 10.0 diff --git a/arch/riscv/user/basics/string.S b/arch/riscv/user/basics/string.S new file mode 100644 index 0000000..3878074 --- /dev/null +++ b/arch/riscv/user/basics/string.S @@ -0,0 +1,111 @@ +.text + +.globl reverse_string +.type reverse_string, @function + +// char * reverse_string(char *str); +reverse_string: + // Return early on null pointer. + beq a0, zero, end + + // Preserve the original pointer. + addi sp, sp, -8 + sd a0, 0(sp) + + // Set `t0` to point to the end of the string. + add t0, a0, zero +set_end_ptr: + lbu t2, 0(t0) + beq t2, zero, end_ptr_done + addi t0, t0, 1 + j set_end_ptr + + // We are done iterating, if `a0` and `t0` are equal, then there's nothing + // to be done and we can return early. Otherwise decrement `t0` so it points + // to the byte right before the null termination. +end_ptr_done: + beq a0, t0, reverse_done + addi t0, t0, -1 + +reverse_loop: + // Swap values between the two pointers. + lb t1, 0(a0) + lb t2, 0(t0) + sb t1, 0(t0) + sb t2, 0(a0) + + // Move pointers and check whether the pointers have already crossed. If + // they have not crossed yet there is still looping to be done. Otherwise + // we are done. + addi a0, a0, 1 + addi t0, t0, -1 + bltu a0, t0, reverse_loop + +reverse_done: + // Restore things back and return to the caller. + ld a0, 0(sp) + addi sp, sp, 8 +end: + jr ra + +.globl is_palindrome +.type is_palindrome, @function + +// bool is_palindrome(char *str); +is_palindrome: + // Return early on null pointer. + beq a0, zero, palindrome_no + + // Set `t0` to point to the end of the string. + add t0, a0, zero +pal_set_end_ptr: + lbu t2, 0(t0) + beq t2, zero, pal_end_ptr_done + addi t0, t0, 1 + j pal_set_end_ptr + + // We are done iterating, if `a0` and `t0` are equal, then there's nothing + // to be done and we can return early. Otherwise decrement `t0` so it points + // to the byte right before the null termination. +pal_end_ptr_done: + beq a0, t0, palindrome_no + addi t0, t0, -1 + +pal_loop: + // Swap values between the two pointers. + lb t1, 0(a0) + lb t2, 0(t0) + bne t1, t2, palindrome_no + + // Move pointers and check whether the pointers have already crossed. If + // they have not crossed yet there is still looping to be done. Otherwise + // we are done. + addi a0, a0, 1 + addi t0, t0, -1 + bleu a0, t0, pal_loop + +palindrome_yes: + li a0, 1 + jr ra + +palindrome_no: + li a0, 0 + jr ra + +.globl mstrcmp +.type mstrcmp, @function + +// int mstrcmp(const char *, const char *); +mstrcmp: +1: + lbu t0, 0(a0) + lbu t1, 0(a1) + bne t0, t1, 2f + addi a0, a0, 1 + addi a1, a1, 1 + bnez t0, 1b + li a0, 0 + ret +2: + sub a0, t0, t1 + ret diff --git a/arch/riscv/user/hwprobe/Makefile b/arch/riscv/user/hwprobe/Makefile new file mode 100644 index 0000000..9b813ff --- /dev/null +++ b/arch/riscv/user/hwprobe/Makefile @@ -0,0 +1,60 @@ +## +# By default everything is silent. If you want to change this behavior, simply +# assign V=1 when calling make. + +V = +ifeq ($(strip $(V)),) + E = @echo + Q = @ +else + E = @\# + Q = +endif + +## +# Compile options. You can use CROSS_COMPILE just like on the Linux Kernel. You +# can also determine the ISA to be used, which defaults to my VisionFive2 board. +# I did not go too much into the rabbit hole of platform-specific flags because +# everything is in assembly anyways and everything is statically linked. Hence +# no `-mcpu`, no `-mtune`, no funny business. + +CC = $(CROSS_COMPILE)gcc +LD = $(CROSS_COMPILE)ld +ISA ?= rv64imafdc_zicntr_zicsr_zifencei_zihpm_zca_zcd_zba_zbb +WARNINGS = -Werror -Wpedantic -Wall -Wextra -Wcast-align -Wcast-qual -Winit-self \ + -Wmissing-include-dirs -Wredundant-decls -Wshadow -Wsign-conversion \ + -Wswitch-default -Wundef -Wunreachable-code -Wmissing-noreturn +CCFLAGS = $(WARNINGS) -march=$(ISA) +LDFLAGS = + + +# You can pass an optional `DEBUG` variable to manipulate the build type. +DEBUG = +ifeq ($(strip $(DEBUG)),) + CCFLAGS += -O3 +else + CCFLAGS += -g +endif + +## +# Paths. + +SRC = $(wildcard *.c) +EXES = $(SRC:.c=) + +## +# Targets + +.PHONY: all +all: clean $(EXES) + +.PHONY: build +build: $(EXES) + +.c: + $(E) " CC " $(*F) + $(Q) $(CC) $(CCFLAGS) $< -o $@ + +.PHONY: clean +clean: + $(Q) rm -f $(EXES) diff --git a/arch/riscv/user/hwprobe/probe.c b/arch/riscv/user/hwprobe/probe.c new file mode 100644 index 0000000..9e2e978 --- /dev/null +++ b/arch/riscv/user/hwprobe/probe.c @@ -0,0 +1,294 @@ +#define _GNU_SOURCE + +#include +#include +#include +#include +#include +#include +#include + +#define NR_RISCV_HWPROBE 258 + +// Depend on Linux patches that have not been merged upstream... +#define RISCV_HWPROBE_EXT_ZICNTR (1ULL << 49) +#define RISCV_HWPROBE_EXT_ZIHPM (1ULL << 50) +#define RISCV_HWPROBE_EXT_ZICSR (1ULL << 51) +#define RISCV_HWPROBE_EXT_ZIFENCEI (1ULL << 52) + +#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof(arr)[0]) + +struct ext_pair_t { + char *id; + uint64_t value; +}; + +static struct ext_pair_t ext_pairs[] = { + { + .id = "F, D", + .value = RISCV_HWPROBE_IMA_FD, + }, + { + .id = "C", + .value = RISCV_HWPROBE_IMA_C, + }, + { + .id = "V", + .value = RISCV_HWPROBE_IMA_V, + }, + { + .id = "ZBA", + .value = RISCV_HWPROBE_EXT_ZBA, + }, + { + .id = "ZBB", + .value = RISCV_HWPROBE_EXT_ZBB, + }, + { + .id = "ZBS", + .value = RISCV_HWPROBE_EXT_ZBS, + }, + { + .id = "ZICBOZ", + .value = RISCV_HWPROBE_EXT_ZICBOZ, + }, + { + .id = "ZBC", + .value = RISCV_HWPROBE_EXT_ZBC, + }, + { + .id = "ZBKB", + .value = RISCV_HWPROBE_EXT_ZBKB, + }, + { + .id = "ZBKC", + .value = RISCV_HWPROBE_EXT_ZBKC, + }, + { + .id = "ZBKX", + .value = RISCV_HWPROBE_EXT_ZBKX, + }, + { + .id = "ZKND", + .value = RISCV_HWPROBE_EXT_ZKND, + }, + { + .id = "ZKNE", + .value = RISCV_HWPROBE_EXT_ZKNE, + }, + { + .id = "ZKNH", + .value = RISCV_HWPROBE_EXT_ZKNH, + }, + { + .id = "ZKSED", + .value = RISCV_HWPROBE_EXT_ZKSED, + }, + { + .id = "ZKSH", + .value = RISCV_HWPROBE_EXT_ZKSH, + }, + { + .id = "ZKT", + .value = RISCV_HWPROBE_EXT_ZKT, + }, + { + .id = "ZVBB", + .value = RISCV_HWPROBE_EXT_ZVBB, + }, + { + .id = "ZVBC", + .value = RISCV_HWPROBE_EXT_ZVBC, + }, + { + .id = "ZVKB", + .value = RISCV_HWPROBE_EXT_ZVKB, + }, + { + .id = "ZVKG", + .value = RISCV_HWPROBE_EXT_ZVKG, + }, + { + .id = "ZVKNED", + .value = RISCV_HWPROBE_EXT_ZVKNED, + }, + { + .id = "ZVKNHA", + .value = RISCV_HWPROBE_EXT_ZVKNHA, + }, + { + .id = "ZVKNHB", + .value = RISCV_HWPROBE_EXT_ZVKNHB, + }, + { + .id = "ZVKSED", + .value = RISCV_HWPROBE_EXT_ZVKSED, + }, + { + .id = "ZVKSH", + .value = RISCV_HWPROBE_EXT_ZVKSH, + }, + { + .id = "ZVKT", + .value = RISCV_HWPROBE_EXT_ZVKT, + }, + { + .id = "ZFH", + .value = RISCV_HWPROBE_EXT_ZFH, + }, + { + .id = "ZFHMIN", + .value = RISCV_HWPROBE_EXT_ZFHMIN, + }, + { + .id = "ZIHINTNTL", + .value = RISCV_HWPROBE_EXT_ZIHINTNTL, + }, + { + .id = "ZVFH", + .value = RISCV_HWPROBE_EXT_ZVFH, + }, + { + .id = "ZVFHMIN", + .value = RISCV_HWPROBE_EXT_ZVFHMIN, + }, + { + .id = "ZFA", + .value = RISCV_HWPROBE_EXT_ZFA, + }, + { + .id = "ZTSO", + .value = RISCV_HWPROBE_EXT_ZTSO, + }, + { + .id = "ZACAS", + .value = RISCV_HWPROBE_EXT_ZACAS, + }, + { + .id = "ZICOND", + .value = RISCV_HWPROBE_EXT_ZICOND, + }, + { + .id = "ZIHINTPAUSE", + .value = RISCV_HWPROBE_EXT_ZIHINTPAUSE, + }, + { + .id = "ZVE32X", + .value = RISCV_HWPROBE_EXT_ZVE32X, + }, + { + .id = "ZVE32F", + .value = RISCV_HWPROBE_EXT_ZVE32F, + }, + { + .id = "ZVE64X", + .value = RISCV_HWPROBE_EXT_ZVE64X, + }, + { + .id = "ZVE64F", + .value = RISCV_HWPROBE_EXT_ZVE64F, + }, + { + .id = "ZVE64D", + .value = RISCV_HWPROBE_EXT_ZVE64D, + }, + { + .id = "ZIMOP", + .value = RISCV_HWPROBE_EXT_ZIMOP, + }, + { + .id = "ZCA", + .value = RISCV_HWPROBE_EXT_ZCA, + }, + { + .id = "ZCB", + .value = RISCV_HWPROBE_EXT_ZCB, + }, + { + .id = "ZCD", + .value = RISCV_HWPROBE_EXT_ZCD, + }, + { + .id = "ZCF", + .value = RISCV_HWPROBE_EXT_ZCF, + }, + { + .id = "ZCMOP", + .value = RISCV_HWPROBE_EXT_ZCMOP, + }, + { + .id = "ZAWRS", + .value = RISCV_HWPROBE_EXT_ZAWRS, + }, + { + .id = "ZICNTR", + .value = RISCV_HWPROBE_EXT_ZICNTR, + }, + { + .id = "ZIHPM", + .value = RISCV_HWPROBE_EXT_ZIHPM, + }, + { + .id = "ZICSR", + .value = RISCV_HWPROBE_EXT_ZICSR, + }, + { + .id = "ZIFENCEI", + .value = RISCV_HWPROBE_EXT_ZIFENCEI, + }, +}; + +void print_bits(size_t size, void *ptr) +{ + unsigned char *b = (unsigned char *)ptr; + unsigned char byte; + int i, j; + + for (i = size - 1; i >= 0; i--) { + for (j = 7; j >= 0; j--) { + byte = (b[i] >> j) & 1; + printf("%u", byte); + } + } +} + +int main() +{ + struct riscv_hwprobe pairs; + long rc; + + // base: rv64ima + + pairs = (struct riscv_hwprobe){ + .key = RISCV_HWPROBE_KEY_BASE_BEHAVIOR, + }; + rc = syscall(NR_RISCV_HWPROBE, &pairs, 1, 0, NULL, 0); + if (rc) { + perror("could not fetch the base behavior for the system"); + exit(EXIT_FAILURE); + } + printf("Supports base extensions I, M, A? %s\n", (bool)pairs.value ? "yes" : "no"); + + // Extensions + + pairs = (struct riscv_hwprobe){ + .key = RISCV_HWPROBE_KEY_IMA_EXT_0, + }; + rc = syscall(NR_RISCV_HWPROBE, &pairs, 1, 0, NULL, 0); + if (rc) { + perror("could not fetch extensions as given by hwprobe"); + exit(EXIT_FAILURE); + } + + printf("\nWe got back this bit map: "); + print_bits(sizeof(long), &pairs.value); + + puts("; which means:\n"); + for (size_t i = 0; i < ARRAY_SIZE(ext_pairs); i++) { + if ((ext_pairs[i].value & pairs.value) == ext_pairs[i].value) { + printf("%s: OK\n", ext_pairs[i].id); + } + } + + exit(EXIT_SUCCESS); +} diff --git a/arch/riscv/usr/Makefile b/arch/riscv/usr/Makefile deleted file mode 100644 index b4752a3..0000000 --- a/arch/riscv/usr/Makefile +++ /dev/null @@ -1,19 +0,0 @@ -CC = $(CROSS_COMPILE)gcc -CCFLAGS = -EXE = basics - -DEBUG = -ifneq ($(strip $(DEBUG)),) - CCFLAGS += -g -endif - -.PHONY: all -all: clean $(EXE) - -.PHONY: $(EXE) -$(EXE): - $(CC) $(CCFLAGS) -o $(EXE) basics.c factorial.S string.S float.S - -.PHONY: clean -clean: - @rm -f $(EXE) diff --git a/arch/riscv/usr/basics.c b/arch/riscv/usr/basics.c deleted file mode 100644 index 1d822c3..0000000 --- a/arch/riscv/usr/basics.c +++ /dev/null @@ -1,162 +0,0 @@ -#include -#include -#include -#include -#include - -/* - * Returns the factorial for the given unsigned 64-bit integer. - * - * Implemented in factorial.S - */ -int factorial(uint64_t n); - -void test_factorial(void) -{ - assert(factorial(0) == 0); - assert(factorial(1) == 1); - assert(factorial(2) == 2); - assert(factorial(3) == 6); - assert(factorial(4) == 24); - - printf("factorial:\t\tOK\n"); -} - -/* - * Returns a pointer with the same given string but reversed. Note that the - * string cannot be in read-only space since the reversal is done in-place. - * - * Implemented in string.S - */ -char *reverse_string(char *str); - -void test_reverse_string(void) -{ - assert(reverse_string(NULL) == NULL); - assert(strlen(reverse_string("")) == 0); - - char s1[] = "This is a string."; - assert(strcmp(reverse_string(s1), ".gnirts a si sihT") == 0); - - char s2[] = "."; - assert(strcmp(reverse_string(s2), ".") == 0); - - printf("reverse_string:\t\tOK\n"); -} - -/* - * Returns true if the given string is a palindrome, false otherwise. - * - * Implemented in string.S - */ -bool is_palindrome(char *str); - -void test_is_palindrome(void) -{ - assert(is_palindrome(NULL) == 0); - assert(is_palindrome("") == 0); - assert(is_palindrome("aba") == 1); - assert(is_palindrome("aaa") == 1); - assert(is_palindrome("This is a a si sihT") == 1); - - printf("is_palindrome:\t\tOK\n"); -} - -/* - * This function computes the following: ((a + b) * b) + b. Don't try to make - * sense of it, that's the computation I ended up while messing with RISC-V - * floating point instructions. Anyways, with this in mind, it will return if - * the computed value is greater than 10. - * - * Implemented in float.S - */ -bool greater_than_ten(double a, uint64_t b); - -void test_greater_than_ten(void) -{ - assert(!greater_than_ten(2.3, 1)); // 4.3 - assert(greater_than_ten(2.3, 2)); // 10.6 - - printf("greater_than_ten:\tOK\n"); -} - -/* - * Atomically add the integer pointed by `a` with the given `value`. - * this is a function, I've checked that the assembly produced by GCC on a - * decent optimization level actually inlines this. - */ -static inline void atomic_add(uint64_t *a, uint64_t value) -{ - /* - * The execution is a mere `amoadd` instruction, but it will set on `t0` the - * result. If it fails (e.g. the address was already being used), then `t0 = - * 0` and `beqz` will instruct it to try again. - * - * Note that on the board I'm using the 'Zawrs' extension is not available. - * Otherwise I could have re-arranged to code to something like this: - * - * amoadd.d t0, %1, %0 - * bnez t0, .Latomic_add_done - * wrs.nto - * .Latomic_add_done: - * - * This is an extra instruction but it saves on power if the memory address - * happens to be used at access time. - * - * As for the 'A' RISC-V specific constraint, it means "An address that is - * held in a general-purpose register". GCC will then do the magic and - * convert it to `amoadd.d t0, a1, (a0)` or something like that. Note that - * we have to pass the '+' constraint modifier because the address will be - * both read and written atomically. - * - * See: https://gcc.gnu.org/onlinedocs/gcc/Machine-Constraints.html. - */ - asm volatile(".Latomic_add_retry:\n\t" - "amoadd.d t0, %1, %0\n\t" - "beqz t0, .Latomic_add_retry" - : "+A"(*a) - : "r"(value) - : "t0", "memory"); -} - -void test_atomic_add(void) -{ - uint64_t i = 4; - - atomic_add(&i, 0); - assert(i == 4); - - atomic_add(&i, 2); - assert(i == 6); - - printf("atomic_add:\t\tOK\n"); -} - -extern int mstrcmp(const char *s1, const char *s2); - -void test_mstrcmp(void) -{ - char *strings[] = { - "hello", "", "iello", "helloa", "contammusaaquellhomedegranarditquetantissimerra", - }; - - for (uint64_t i = 0; i < 1000000000; i++) { - assert(mstrcmp(strings[0], strings[0]) == 0); - assert(mstrcmp(strings[0], strings[1]) > 0); - assert(mstrcmp(strings[0], strings[2]) < 0); - assert(mstrcmp(strings[0], strings[3]) < 0); - assert(mstrcmp(strings[0], strings[4]) > 0); - } - - printf("mstrcmp:\t\tOK\n"); -} - -int main() -{ - test_factorial(); - test_reverse_string(); - test_is_palindrome(); - test_greater_than_ten(); - test_atomic_add(); - test_mstrcmp(); -} diff --git a/arch/riscv/usr/factorial.S b/arch/riscv/usr/factorial.S deleted file mode 100644 index 7e3df12..0000000 --- a/arch/riscv/usr/factorial.S +++ /dev/null @@ -1,28 +0,0 @@ -.text -.globl factorial -.type factorial, @function - -factorial: - // If input <= 1, just return the given thing. - addi t0, zero, 1 - bgt a0, t0, else - jr ra -else: - // Preserve the argument and the return address before the call. - addi sp, sp, -16 - sd a0, 0(sp) - sd ra, 8(sp) - - // Call the same function but with a value of argument-1. - addi a0, a0, -1 - call factorial - - // Restore back the original argument and the return address. Then multiply - // the original argument with the returned one from the previous call. - ld t1, 0(sp) - ld ra, 8(sp) - addi sp, sp, 16 - mul a0, t1, a0 - - // And return to the caller. - jr ra diff --git a/arch/riscv/usr/float.S b/arch/riscv/usr/float.S deleted file mode 100644 index f481f3e..0000000 --- a/arch/riscv/usr/float.S +++ /dev/null @@ -1,40 +0,0 @@ -.text -.globl greater_than_ten -.type greater_than_ten, @function - -// bool greater_than_ten(double a, uint64_t b); -greater_than_ten: - // Upon entry a -> fa0; and b -> a0. That is, the ABI increments the - //(f)a register per argument type. - - // Change the rounding to "Rounds Towards Zero" (bits: 0b001). - li t0, 0b001 - fsrm t0 - - // Convert the second parameter to double. - fcvt.d.lu ft0, a0 - - // ret = a + b - fadd.d fa0, fa0, ft0 - - // ret = (ret * b) + b - fmv.d ft1, ft0 - fmadd.d fa0, fa0, ft0, ft1 - - // Now we need to compare the number with 10.0. There are multiple ways to - // load a floating point immediate: - // 1. Loading an integer immediate and then convert it into a double. This - // is discouraged on the RISC-V assembly manual. - // 2. Load a double with `fld` from a memory location on the data section. - // 3. Load a floating point immediate with `fli` (requires the `Zfa` - // extension). - // I don't have the `Zfa` extension on my board, so I'm opting for the - // second way. - fld ft1, .TEN, t0 - fle.d a0, ft1, fa0 - - ret - -.data -.TEN: - .double 10.0 diff --git a/arch/riscv/usr/string.S b/arch/riscv/usr/string.S deleted file mode 100644 index 3878074..0000000 --- a/arch/riscv/usr/string.S +++ /dev/null @@ -1,111 +0,0 @@ -.text - -.globl reverse_string -.type reverse_string, @function - -// char * reverse_string(char *str); -reverse_string: - // Return early on null pointer. - beq a0, zero, end - - // Preserve the original pointer. - addi sp, sp, -8 - sd a0, 0(sp) - - // Set `t0` to point to the end of the string. - add t0, a0, zero -set_end_ptr: - lbu t2, 0(t0) - beq t2, zero, end_ptr_done - addi t0, t0, 1 - j set_end_ptr - - // We are done iterating, if `a0` and `t0` are equal, then there's nothing - // to be done and we can return early. Otherwise decrement `t0` so it points - // to the byte right before the null termination. -end_ptr_done: - beq a0, t0, reverse_done - addi t0, t0, -1 - -reverse_loop: - // Swap values between the two pointers. - lb t1, 0(a0) - lb t2, 0(t0) - sb t1, 0(t0) - sb t2, 0(a0) - - // Move pointers and check whether the pointers have already crossed. If - // they have not crossed yet there is still looping to be done. Otherwise - // we are done. - addi a0, a0, 1 - addi t0, t0, -1 - bltu a0, t0, reverse_loop - -reverse_done: - // Restore things back and return to the caller. - ld a0, 0(sp) - addi sp, sp, 8 -end: - jr ra - -.globl is_palindrome -.type is_palindrome, @function - -// bool is_palindrome(char *str); -is_palindrome: - // Return early on null pointer. - beq a0, zero, palindrome_no - - // Set `t0` to point to the end of the string. - add t0, a0, zero -pal_set_end_ptr: - lbu t2, 0(t0) - beq t2, zero, pal_end_ptr_done - addi t0, t0, 1 - j pal_set_end_ptr - - // We are done iterating, if `a0` and `t0` are equal, then there's nothing - // to be done and we can return early. Otherwise decrement `t0` so it points - // to the byte right before the null termination. -pal_end_ptr_done: - beq a0, t0, palindrome_no - addi t0, t0, -1 - -pal_loop: - // Swap values between the two pointers. - lb t1, 0(a0) - lb t2, 0(t0) - bne t1, t2, palindrome_no - - // Move pointers and check whether the pointers have already crossed. If - // they have not crossed yet there is still looping to be done. Otherwise - // we are done. - addi a0, a0, 1 - addi t0, t0, -1 - bleu a0, t0, pal_loop - -palindrome_yes: - li a0, 1 - jr ra - -palindrome_no: - li a0, 0 - jr ra - -.globl mstrcmp -.type mstrcmp, @function - -// int mstrcmp(const char *, const char *); -mstrcmp: -1: - lbu t0, 0(a0) - lbu t1, 0(a1) - bne t0, t1, 2f - addi a0, a0, 1 - addi a1, a1, 1 - bnez t0, 1b - li a0, 0 - ret -2: - sub a0, t0, t1 - ret -- cgit v1.2.3